{"meta":{"query_hash":"8b3ede01295f","filters":{"venue":"COMBINATORICA"},"cohort_total":98,"direct_labels_cover":0,"predictions_cover":98,"exported":98,"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/8b3ede01295f","api":"https://metacan.xera.ac/api/v1/cohort?venue=COMBINATORICA"},"results":[{"id":"W1481873605","doi":"10.1007/s00493-009-2178-y","title":"Highly parity linked graphs","year":2009,"lang":"en","type":"article","venue":"COMBINATORICA","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":"Combinatorics; Mathematics; Parity (physics); Disjoint sets; Graph; Joins; Discrete mathematics; Physics; Computer science","score_opus":0.0204968892541353,"score_gpt":0.28604150329798345,"score_spread":0.26554461404384816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481873605","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54675955,0.0007052126,0.18272385,0.005062561,0.0008356409,0.00018161604,0.00145136,0.0013703366,0.26090991],"genre_scores_gemma":[0.9168064,0.00032064962,0.02715766,0.0013002724,0.00035893594,0.00014324852,0.001203453,0.00046368633,0.052245736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992803,0.00019436113,0.000024686171,0.00017227359,0.00020632354,0.00012215853],"domain_scores_gemma":[0.99639076,0.0014948688,0.0003982754,0.0008133784,0.0004687361,0.00043398162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005502124,0.0004940802,0.00057760207,0.0017451273,0.002233545,0.0028655343,0.0011601235,0.0017360598,0.019612232],"category_scores_gemma":[0.0054425756,0.00057774363,0.00046990011,0.001359483,0.0015708362,0.004541841,0.0027686397,0.0029618938,0.0024165912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009357666,0.00006768771,0.000792987,0.00006387724,0.000014025104,0.00023773892,0.00022209677,0.0013275241,0.0033475794,0.97312886,0.006950314,0.013753869],"study_design_scores_gemma":[0.00001950651,0.000014896957,0.00031837975,0.000015514022,0.000014393366,0.00023034394,0.00009575279,0.005881099,0.0016958608,0.98625237,0.005452779,0.000009049093],"about_ca_topic_score_codex":0.00036809573,"about_ca_topic_score_gemma":0.0006169389,"teacher_disagreement_score":0.019612232,"about_ca_system_score_codex":0.00066863926,"about_ca_system_score_gemma":0.00051611924,"threshold_uncertainty_score":0.065609396},"labels":[],"label_agreement":null},{"id":"W1609788678","doi":"10.1007/s00493-016-3356-3","title":"Density of 5/2-critical graphs","year":2016,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Graph homomorphism; Discrete mathematics; Graph; Homomorphism; Triangle-free graph; Graph power; Line graph","score_opus":0.018925724334806764,"score_gpt":0.2944850513808936,"score_spread":0.2755593270460868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1609788678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86234087,0.00066507293,0.048837144,0.0018640881,0.00013710205,0.00007082552,0.0004921322,0.00043006972,0.08516267],"genre_scores_gemma":[0.98643756,0.00028762253,0.005744364,0.00019705007,0.00013232937,0.00008798172,0.00040264626,0.00009536492,0.0066151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992854,0.00019793812,0.000024308672,0.00011540521,0.00021430216,0.00016267046],"domain_scores_gemma":[0.99490476,0.00281455,0.00052912626,0.0002964195,0.00051964825,0.0009356582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000913093,0.00054708595,0.00069891574,0.0036816017,0.0019450873,0.0030936867,0.0016744408,0.0013692675,0.0123550305],"category_scores_gemma":[0.008123886,0.00071133504,0.0004573458,0.0012330912,0.0024578143,0.0025983267,0.0017408478,0.0014174844,0.00076190464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008998809,0.000038154045,0.0015632263,0.00007729153,0.000012452696,0.00014293099,0.0003691729,0.0034497147,0.0019168747,0.98551846,0.0032334924,0.0035881212],"study_design_scores_gemma":[0.00004582715,0.000024974428,0.002534417,0.000061962746,0.00002108102,0.00040706407,0.00035516665,0.042296708,0.0017547525,0.9495164,0.0029560395,0.000025661704],"about_ca_topic_score_codex":0.0018460766,"about_ca_topic_score_gemma":0.0018026661,"teacher_disagreement_score":0.0123550305,"about_ca_system_score_codex":0.0014961176,"about_ca_system_score_gemma":0.0007349559,"threshold_uncertainty_score":0.04133171},"labels":[],"label_agreement":null},{"id":"W1660086198","doi":"10.1007/s00493-015-3237-1","title":"Odd circuits in dense binary matroids","year":2015,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Matroid; Combinatorics; Lemma (botany); Integer (computer science); Abelian group; Binary number; Discrete mathematics; Simple (philosophy); Arithmetic; Computer science","score_opus":0.07131799654960404,"score_gpt":0.31188509652276625,"score_spread":0.24056709997316222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1660086198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7665125,0.0024842937,0.112937875,0.0037095295,0.00017923054,0.000060013757,0.0004989173,0.0002554303,0.113362186],"genre_scores_gemma":[0.9686566,0.001066934,0.012420045,0.00036528692,0.00025622168,0.00008218489,0.00028601184,0.00007230657,0.016794378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936825,0.0002084712,0.000034104276,0.00011643518,0.0001692512,0.00010354518],"domain_scores_gemma":[0.9973212,0.0018342341,0.0002660611,0.00016129804,0.00015704581,0.00026017925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007449275,0.00060888147,0.00094215263,0.0018779427,0.0018342931,0.004312853,0.0012189072,0.0010850581,0.005718251],"category_scores_gemma":[0.0035586045,0.00086146645,0.00054077856,0.0021246437,0.003706251,0.0073757092,0.0022279986,0.0029907194,0.00039736385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025666375,0.000016016362,0.00021739575,0.00003093359,0.0000030580504,0.000041061016,0.00022661786,0.00060057815,0.0002895779,0.99481505,0.00058484246,0.003149128],"study_design_scores_gemma":[0.000010283195,0.0000035689177,0.00009597756,0.000006994949,0.00000448262,0.00003639324,0.00005627951,0.0018893138,0.00013786567,0.99676764,0.0009876731,0.0000035416138],"about_ca_topic_score_codex":0.0015344556,"about_ca_topic_score_gemma":0.0023294562,"teacher_disagreement_score":0.005718251,"about_ca_system_score_codex":0.0018219382,"about_ca_system_score_gemma":0.00046791957,"threshold_uncertainty_score":0.019129515},"labels":[],"label_agreement":null},{"id":"W1924742230","doi":"10.1007/s00493-015-3003-4","title":"Regular families of forests, antichains and duality pairs of relational structures","year":2016,"lang":"en","type":"article","venue":"COMBINATORICA","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":"Royal Military College of Canada","funders":"","keywords":"Antichain; Mathematics; Homomorphism; Duality (order theory); Combinatorics; Constraint (computer-aided design); Constraint satisfaction problem; Discrete mathematics; Partially ordered set; Geometry","score_opus":0.020806861208372263,"score_gpt":0.2683903031659259,"score_spread":0.2475834419575536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1924742230","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57108605,0.0012931534,0.39342538,0.0009793328,0.00013107591,0.00007840153,0.0008456261,0.00043085986,0.031730138],"genre_scores_gemma":[0.93183976,0.0004861086,0.059144147,0.0002737625,0.0001352555,0.00012334912,0.00082204526,0.00012415425,0.0070512393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807847,0.00051249063,0.00013291354,0.0006502753,0.00039022195,0.00023561656],"domain_scores_gemma":[0.99443346,0.0032223496,0.0007039785,0.00057571277,0.00048931385,0.000575164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016167383,0.0004500965,0.00080944074,0.0026825836,0.0029635404,0.004470003,0.0012763524,0.001136649,0.004343745],"category_scores_gemma":[0.0054215775,0.0012059256,0.0011222835,0.0026217452,0.0035119571,0.008571616,0.0018028558,0.0021680077,0.00040121665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051085397,0.000030957537,0.0013953763,0.000039159793,0.000015279373,0.00016544804,0.0006448233,0.00080255297,0.000914352,0.98894894,0.0007155714,0.0062764306],"study_design_scores_gemma":[0.000016645603,0.000013484791,0.0006778714,0.000017307633,0.00002267687,0.00036857708,0.00027065846,0.0042770104,0.0007117638,0.99085087,0.0027594212,0.000013771635],"about_ca_topic_score_codex":0.0012200164,"about_ca_topic_score_gemma":0.0019044002,"teacher_disagreement_score":0.004470003,"about_ca_system_score_codex":0.0014593127,"about_ca_system_score_gemma":0.0007166178,"threshold_uncertainty_score":0.014531314},"labels":[],"label_agreement":null},{"id":"W1963931974","doi":"10.1007/s00493-006-0034-x","title":"Local Chromatic Number, KY Fan's Theorem, And Circular Colorings","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":99,"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; Brooks' theorem; Chromatic scale; Upper and lower bounds; Chordal graph; Discrete mathematics; Conjecture; Indifference graph; Bipartite graph; Vertex (graph theory); Graph; 1-planar graph","score_opus":0.0060103561267724126,"score_gpt":0.20559387058850803,"score_spread":0.1995835144617356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963931974","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63788885,0.0011408023,0.29451436,0.0024078905,0.00013134204,0.000057171743,0.0006546873,0.000642313,0.06256267],"genre_scores_gemma":[0.9630621,0.00059089763,0.021875199,0.00020268155,0.00013049626,0.000070370734,0.00048555344,0.00014340605,0.013439249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934775,0.000110209556,0.00003222863,0.00023764615,0.00013104094,0.00014111889],"domain_scores_gemma":[0.9953856,0.0023030553,0.0005558709,0.00079039054,0.00044074925,0.0005243559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012247897,0.00048495835,0.0007415172,0.002281333,0.0025787458,0.003226989,0.0012846458,0.0007246773,0.006736306],"category_scores_gemma":[0.0042948932,0.0004294313,0.00059450575,0.0026700725,0.003977968,0.0061728284,0.0019782316,0.0016014354,0.0005143143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011234151,0.00003535559,0.0035076204,0.00005261687,0.0000103579905,0.000068467074,0.00037705348,0.006231276,0.001166951,0.97330374,0.0024984921,0.012635734],"study_design_scores_gemma":[0.000023461285,0.000019589332,0.0015488937,0.000019393263,0.00002749743,0.00015704807,0.0002545697,0.026117684,0.0012335193,0.9648445,0.005724899,0.000029038645],"about_ca_topic_score_codex":0.0046258564,"about_ca_topic_score_gemma":0.0047442475,"teacher_disagreement_score":0.006736306,"about_ca_system_score_codex":0.0025600756,"about_ca_system_score_gemma":0.0009442605,"threshold_uncertainty_score":0.022535205},"labels":[],"label_agreement":null},{"id":"W1964031838","doi":"10.1007/s00493-011-1687-5","title":"Packing directed circuits exactly","year":2011,"lang":"en","type":"article","venue":"COMBINATORICA","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":"Disjoint sets; Cardinality (data modeling); Combinatorics; Mathematics; Set (abstract data type); Electronic circuit; Characterization (materials science); Property (philosophy); Discrete mathematics; Minor (academic); Computer science; Law","score_opus":0.05387108488223161,"score_gpt":0.27160837928300036,"score_spread":0.21773729440076875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964031838","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3764549,0.0011418387,0.2360365,0.0017137466,0.0009271316,0.00026619557,0.0011832973,0.0027835122,0.37949282],"genre_scores_gemma":[0.84101,0.000994605,0.0771222,0.0013978145,0.00029260412,0.0002225813,0.0019012915,0.001116571,0.07594236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899083,0.00016746768,0.000040454666,0.00023129239,0.00029774816,0.000272147],"domain_scores_gemma":[0.9987387,0.00046406337,0.00008880728,0.0004915656,0.000108202454,0.00010858339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000265734,0.0011076456,0.0012309755,0.000822627,0.0014044531,0.0030905204,0.0012361058,0.0018040051,0.019583764],"category_scores_gemma":[0.0027639477,0.0009808103,0.0008080802,0.0018896933,0.0011946578,0.0043142247,0.0023901102,0.0024741832,0.00353612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023992157,0.0002505789,0.0007177956,0.0003480387,0.00007296463,0.0003165198,0.0005064586,0.012688316,0.014491646,0.85247064,0.025322113,0.092574984],"study_design_scores_gemma":[0.00007957097,0.000071778006,0.0005933608,0.00006971268,0.000063232386,0.00037910914,0.00028668626,0.032821197,0.00974415,0.9318027,0.024063852,0.0000246212],"about_ca_topic_score_codex":0.00079608336,"about_ca_topic_score_gemma":0.0015509076,"teacher_disagreement_score":0.019583764,"about_ca_system_score_codex":0.0009957269,"about_ca_system_score_gemma":0.00057810225,"threshold_uncertainty_score":0.06551421},"labels":[],"label_agreement":null},{"id":"W1965966420","doi":"10.1007/s00493-010-2329-1","title":"Type-II matrices and combinatorial structures","year":2010,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Algebraic structures and combinatorial models","field":"Mathematics","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":"University of Waterloo; York University","funders":"","keywords":"Mathematics; Combinatorics; Type (biology); Connection (principal bundle); Class (philosophy); Combinatorial analysis; Combinatorial proof; Discrete mathematics; Geometry; Computer science","score_opus":0.018614966392392716,"score_gpt":0.282572723573241,"score_spread":0.26395775718084824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965966420","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2027028,0.01609628,0.20749192,0.01789077,0.0021864045,0.00008965522,0.00085581734,0.00042076924,0.5522657],"genre_scores_gemma":[0.8963204,0.0067792307,0.023762243,0.0016264413,0.0025674962,0.0001683809,0.00047238317,0.00008049088,0.06822302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995695,0.00016664136,0.000019284142,0.00006258695,0.00012996273,0.000051983534],"domain_scores_gemma":[0.99872154,0.00066837587,0.00021120076,0.00013261959,0.00015646328,0.000109837245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052135147,0.00079810683,0.00047457326,0.0015339594,0.0014391835,0.004465354,0.00070079596,0.0011359217,0.010443844],"category_scores_gemma":[0.0022111645,0.00031407663,0.0004154225,0.0015687309,0.0031390316,0.003501598,0.0008662125,0.0026431622,0.0014724735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058837268,0.000006939828,0.00008328005,0.000016674796,0.000001583659,0.000019726189,0.000076786106,0.0002197125,0.0001400392,0.9951267,0.0017636794,0.002538881],"study_design_scores_gemma":[0.0000030616452,0.0000028291379,0.000057071862,0.000005877515,0.0000016902046,0.00004962515,0.00003478822,0.0007131416,0.000070411326,0.99547076,0.0035878695,0.0000029043633],"about_ca_topic_score_codex":0.0006998325,"about_ca_topic_score_gemma":0.0008330012,"teacher_disagreement_score":0.010443844,"about_ca_system_score_codex":0.0011142285,"about_ca_system_score_gemma":0.00060038245,"threshold_uncertainty_score":0.034938097},"labels":[],"label_agreement":null},{"id":"W1966530078","doi":"10.1007/s00493-011-2545-3","title":"On the threshold for k-regular subgraphs of random graphs","year":2011,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Induced subgraph; Factor-critical graph; Random regular graph; Random graph; Discrete mathematics; Line graph; Graph power; Pathwidth; Vertex (graph theory)","score_opus":0.0697965727121189,"score_gpt":0.27221612325454037,"score_spread":0.20241955054242144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966530078","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68580633,0.0048442064,0.24027085,0.009897631,0.00028121698,0.00011085956,0.00074936,0.000977677,0.05706189],"genre_scores_gemma":[0.98059547,0.0014081231,0.01032477,0.000592067,0.00039574638,0.00011622734,0.00029758769,0.0001998675,0.006070142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997735,0.0008218696,0.00013506577,0.00045559835,0.00045627102,0.00039606896],"domain_scores_gemma":[0.9636933,0.02745029,0.002253603,0.0021661343,0.0013646832,0.003072037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037561345,0.00080791727,0.0028456391,0.004180584,0.0025583727,0.006266014,0.0034046653,0.0027799252,0.005715476],"category_scores_gemma":[0.030623788,0.0012515254,0.0013779367,0.0028032893,0.0074769957,0.015136357,0.0041711554,0.004341021,0.00057385507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008567025,0.000042352298,0.0009138561,0.0000992208,0.00001661581,0.00009169233,0.00047191404,0.005058143,0.0009464849,0.98763615,0.0013604059,0.0032774094],"study_design_scores_gemma":[0.000017651477,0.0000105633535,0.00030749882,0.000023898145,0.000013159777,0.00007771688,0.00008358249,0.026029458,0.00023906797,0.97272116,0.00046166076,0.000014631676],"about_ca_topic_score_codex":0.0029405525,"about_ca_topic_score_gemma":0.0021743288,"teacher_disagreement_score":0.006266014,"about_ca_system_score_codex":0.0040221936,"about_ca_system_score_gemma":0.0013238613,"threshold_uncertainty_score":0.029183209},"labels":[],"label_agreement":null},{"id":"W1969083090","doi":"10.1007/s004930070004","title":"On Cayley Graphs on the Symmetric Group Generated by Tranpositions","year":2000,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph theory and applications","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Cayley graph; Mathematics; Bipartite graph; Symmetric group; Conjecture; Graph; Eigenvalues and eigenvectors; Discrete mathematics","score_opus":0.022248902024591323,"score_gpt":0.2555700609254552,"score_spread":0.23332115890086388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969083090","genre_codex":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71503586,0.0018273945,0.095065065,0.0033832039,0.0010436785,0.000112378955,0.0006897238,0.00051514077,0.18232754],"genre_scores_gemma":[0.92473674,0.0021963287,0.014202118,0.00089630805,0.00082722545,0.00010178381,0.0007884589,0.00026707049,0.05598397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993973,0.00018513108,0.00002408207,0.00011250248,0.00013550409,0.00014550185],"domain_scores_gemma":[0.9979492,0.00082679914,0.00045140495,0.00022163916,0.00023409202,0.0003169307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005171016,0.0012072404,0.0008757064,0.0027274108,0.002074849,0.0031765623,0.0013973102,0.0015605399,0.014169655],"category_scores_gemma":[0.002044198,0.0006439044,0.0008553132,0.0025285906,0.0026542975,0.0049145874,0.0018483232,0.0022735535,0.002007093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041397092,0.000025529804,0.00020450613,0.000039750565,0.000008306126,0.00019027178,0.00026920333,0.0017106041,0.0012558307,0.98861605,0.0018730197,0.0057656053],"study_design_scores_gemma":[0.000014032954,0.000016023416,0.00018653432,0.000013489518,0.0000064789433,0.000106701154,0.00011780279,0.0036418196,0.00045950542,0.993226,0.0022000903,0.00001160992],"about_ca_topic_score_codex":0.0022584351,"about_ca_topic_score_gemma":0.003164106,"teacher_disagreement_score":0.014169655,"about_ca_system_score_codex":0.0013362342,"about_ca_system_score_gemma":0.00064736063,"threshold_uncertainty_score":0.047402263},"labels":[],"label_agreement":null},{"id":"W1969104367","doi":"10.1007/s00493-013-2910-5","title":"Lines in hypergraphs","year":2013,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Concordia University; Google (Canada)","funders":"Concordia University; Canada Research Chairs","keywords":"Hypergraph; Combinatorics; Mathematics; Vertex (graph theory); De Bruijn sequence; Finite set; Statement (logic); Discrete mathematics; Graph","score_opus":0.023471736362064788,"score_gpt":0.2756630780826877,"score_spread":0.2521913417206229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969104367","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2123836,0.011774564,0.30074203,0.012225321,0.00079288473,0.00010080841,0.0008495856,0.00088618766,0.460245],"genre_scores_gemma":[0.8562795,0.0055216025,0.041499205,0.0015114726,0.0012542462,0.00022837467,0.0005855023,0.0003577592,0.09276242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990237,0.0004468589,0.000047005473,0.00020702991,0.00019273454,0.000082747116],"domain_scores_gemma":[0.997463,0.0014744385,0.00028377888,0.00024980307,0.00032193886,0.00020709677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009339895,0.0005284086,0.0007544808,0.0032875796,0.0031082756,0.0063299746,0.001081758,0.0016763518,0.012520041],"category_scores_gemma":[0.004554853,0.00079257984,0.0005935081,0.003989604,0.0062109684,0.013393657,0.002264933,0.0043284246,0.0018142539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004675459,0.0000047246117,0.000078074954,0.000013982644,0.0000016137088,0.000017302276,0.00023243857,0.00015306422,0.00007109822,0.99652016,0.0008735141,0.0020293945],"study_design_scores_gemma":[0.0000033968338,0.0000016598287,0.000048374262,0.000008612208,0.0000030474991,0.000029730329,0.000080474245,0.00048113553,0.000061798906,0.99376523,0.005513604,0.0000030015399],"about_ca_topic_score_codex":0.002321302,"about_ca_topic_score_gemma":0.002179994,"teacher_disagreement_score":0.012520041,"about_ca_system_score_codex":0.002167664,"about_ca_system_score_gemma":0.00058915716,"threshold_uncertainty_score":0.041883707},"labels":[],"label_agreement":null},{"id":"W1969944193","doi":"10.1007/s00493-011-2563-1","title":"On planarity of compact, locally connected, metric spaces","year":2011,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Geometric and Algebraic Topology","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":"Mathematics; Disjoint sets; Planarity testing; Social connectedness; Metric space; Compact space; Metric (unit); Combinatorics; Space (punctuation); Disjoint union (topology); Surface (topology); Locally compact space; Pure mathematics; Geometry","score_opus":0.06910947974797159,"score_gpt":0.2846020704323632,"score_spread":0.21549259068439158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969944193","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7941722,0.005860302,0.100583956,0.005109982,0.00019535726,0.00007165707,0.00075549306,0.0001783477,0.09307258],"genre_scores_gemma":[0.97172046,0.003114571,0.011919262,0.0003229632,0.00043563853,0.00006358267,0.00073604606,0.00008033258,0.0116071105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891007,0.00029666664,0.00005850443,0.0002672457,0.0003155456,0.00015196574],"domain_scores_gemma":[0.9948967,0.0028083776,0.0009650269,0.000351511,0.0004745598,0.0005037682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001084727,0.0010667818,0.0012258622,0.0036858316,0.0020273419,0.004888696,0.0018646554,0.0015941731,0.0058372095],"category_scores_gemma":[0.007730203,0.00076998747,0.0009244468,0.0034929183,0.006839041,0.009702216,0.004231979,0.003978306,0.00052304927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006648923,0.000016205475,0.00069157605,0.00012542779,0.000020960466,0.00012019612,0.00062065,0.002703946,0.0007807535,0.9878479,0.0008832394,0.0061225356],"study_design_scores_gemma":[0.00001657913,0.000030045985,0.0008622986,0.000017698754,0.000019616535,0.00019485653,0.0004094733,0.0034226235,0.0003131619,0.9921293,0.0025691928,0.000015132715],"about_ca_topic_score_codex":0.0014075065,"about_ca_topic_score_gemma":0.0013555075,"teacher_disagreement_score":0.0058372095,"about_ca_system_score_codex":0.0015202659,"about_ca_system_score_gemma":0.00045847654,"threshold_uncertainty_score":0.019527376},"labels":[],"label_agreement":null},{"id":"W1975999171","doi":"10.1007/s00493-007-2163-2","title":"Birth control for giants","year":2007,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":107,"is_retracted":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; Random graph; Giant component; Logarithm; Vertex (graph theory); Connected component; Branching process; Graph; Discrete mathematics; Mathematical analysis","score_opus":0.041606537222897,"score_gpt":0.33842125206509777,"score_spread":0.2968147148422008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975999171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43657985,0.0023056376,0.5021122,0.0073905154,0.00047303646,0.00010957414,0.0004695657,0.0012968093,0.049262844],"genre_scores_gemma":[0.9604277,0.0008821219,0.015305027,0.00049350155,0.00032815387,0.00012519027,0.00024798836,0.00025592404,0.021934344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900204,0.00028149065,0.000045455858,0.000227887,0.00021029524,0.00023275451],"domain_scores_gemma":[0.98618144,0.008577429,0.001352046,0.0011460972,0.0009960438,0.0017470414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023977743,0.00061428896,0.0014664808,0.0024787418,0.0022155105,0.003087604,0.002086697,0.0020186536,0.0069309413],"category_scores_gemma":[0.019023623,0.00053035986,0.001314103,0.0012508723,0.005031805,0.0040327725,0.003690578,0.002902708,0.0005265438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032405424,0.000010632471,0.0002982711,0.000036690468,0.000014649178,0.00007971464,0.00016677137,0.005097304,0.0006086268,0.9881727,0.0017341456,0.0037480288],"study_design_scores_gemma":[0.000020042808,0.000010712132,0.00015236376,0.000011065187,0.000011895532,0.000072427574,0.000051495183,0.04207562,0.0003023626,0.9563077,0.00097144826,0.000012855491],"about_ca_topic_score_codex":0.0031080213,"about_ca_topic_score_gemma":0.0022802392,"teacher_disagreement_score":0.0069309413,"about_ca_system_score_codex":0.002772228,"about_ca_system_score_gemma":0.0013002366,"threshold_uncertainty_score":0.023186326},"labels":[],"label_agreement":null},{"id":"W1976459503","doi":"10.1007/s00493-006-0016-z","title":"Network Design Via Iterative Rounding Of Setpair Relaxations","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","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":"McGill University; University of Waterloo","funders":"","keywords":"Rounding; Mathematics; Combinatorics; Linear programming relaxation; Vertex (graph theory); Omega; Approximation algorithm; Discrete mathematics; Relaxation (psychology); Linear programming; Integer (computer science); Network planning and design; Vertex connectivity; Undirected graph; Graph; Mathematical optimization; Computer science","score_opus":0.023675307206910665,"score_gpt":0.23164786684606414,"score_spread":0.20797255963915348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976459503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014173559,0.00019594806,0.9720081,0.0002310815,0.000096197815,0.000107000844,0.00009831337,0.00030684,0.012782921],"genre_scores_gemma":[0.3112531,0.00039554408,0.67970514,0.00023429269,0.00011147528,0.00046838768,0.0003458321,0.00033501303,0.0071512363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984617,0.00071351626,0.000060997307,0.000230239,0.00033161498,0.00020202223],"domain_scores_gemma":[0.99670106,0.0022147156,0.00020064751,0.0004459297,0.0003154224,0.00012212463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022329988,0.0016616249,0.0014864136,0.0012380995,0.0007842761,0.0021067855,0.0024510978,0.0015582792,0.01151084],"category_scores_gemma":[0.008071011,0.00095546007,0.001338929,0.0013960919,0.00097059447,0.002672438,0.002552279,0.003108945,0.0015411753],"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.00020471719,0.0001434427,0.00027574756,0.000274266,0.000060965813,0.00008704007,0.00021160292,0.7628262,0.0033043176,0.112980396,0.006897138,0.11273411],"study_design_scores_gemma":[0.00003950041,0.00009771458,0.000053569373,0.000043218235,0.000021840176,0.00004744807,0.00007724708,0.9229692,0.0016756036,0.07238744,0.0025715765,0.000015523336],"about_ca_topic_score_codex":0.0012369126,"about_ca_topic_score_gemma":0.0018733401,"teacher_disagreement_score":0.01151084,"about_ca_system_score_codex":0.0012931961,"about_ca_system_score_gemma":0.001047192,"threshold_uncertainty_score":0.03850764},"labels":[],"label_agreement":null},{"id":"W1977900870","doi":"10.1007/s00493-009-2269-9","title":"Tilings of the integers can have superpolynomial periods","year":2009,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Mathematical Analysis and Transform Methods","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 British Columbia","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics; Partition (number theory); Set (abstract data type); Period (music); Square (algebra); Discrete mathematics; Upper and lower bounds; Function (biology); Geometry","score_opus":0.040109790994112854,"score_gpt":0.32715807986496936,"score_spread":0.28704828887085654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977900870","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5355558,0.0029039262,0.21581261,0.0019412596,0.0016953642,0.00009964379,0.00050811697,0.0006693849,0.24081391],"genre_scores_gemma":[0.9446,0.00081387704,0.02894571,0.00046420883,0.0005203808,0.00011601415,0.00017190444,0.000236244,0.024131712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994875,0.000093844,0.00003240957,0.00012407139,0.00010917773,0.00015302052],"domain_scores_gemma":[0.99875677,0.0005322931,0.00018532411,0.00033574633,0.00007124822,0.00011867656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047587702,0.00051625085,0.0005804042,0.0010672834,0.0008616606,0.0023434164,0.0006038642,0.00082405924,0.01185746],"category_scores_gemma":[0.0021926945,0.00045640924,0.0006220378,0.0010119751,0.0020897824,0.0035783008,0.0013151686,0.0015627845,0.0013259869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007820211,0.000014779822,0.00018820798,0.00003586207,0.0000055739933,0.00010631268,0.00010463611,0.00105888,0.0026920706,0.9841323,0.001320586,0.010262518],"study_design_scores_gemma":[0.000020714704,0.000024059518,0.0002773175,0.000018027911,0.00001002273,0.00015833252,0.0001025357,0.004367476,0.0022856889,0.98213273,0.01058997,0.000013171162],"about_ca_topic_score_codex":0.00017561358,"about_ca_topic_score_gemma":0.0003993459,"teacher_disagreement_score":0.01185746,"about_ca_system_score_codex":0.0006826177,"about_ca_system_score_gemma":0.0002917072,"threshold_uncertainty_score":0.03966713},"labels":[],"label_agreement":null},{"id":"W1979736093","doi":"10.1007/s00493-008-2272-6","title":"Note edge-colourings of K n,n with no long two-coloured cycles","year":2008,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Bounded function; Graph; Upper and lower bounds","score_opus":0.0062415386611180896,"score_gpt":0.1904457517298767,"score_spread":0.18420421306875862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979736093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73918724,0.0005964337,0.06636083,0.002148545,0.0010110101,0.00029613537,0.0029216593,0.0007298831,0.18674831],"genre_scores_gemma":[0.88445926,0.0004121777,0.048399284,0.00069087103,0.000076851196,0.0001589032,0.0014748402,0.0002670425,0.064060695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999546,0.00006446245,0.000034770044,0.00011799169,0.000084531624,0.00015231024],"domain_scores_gemma":[0.99836224,0.0005341506,0.00023324473,0.000355061,0.00023315134,0.00028214543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003088744,0.0006282503,0.00044636006,0.0007330568,0.0018801222,0.0017433198,0.00081819156,0.0008586392,0.015689982],"category_scores_gemma":[0.0016320017,0.0003980106,0.0005301466,0.0009809807,0.001057088,0.0019193534,0.0012101474,0.0011241699,0.0018405487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022442082,0.0002763467,0.007929129,0.00064796716,0.00010516782,0.003634059,0.0018121692,0.005774817,0.06574485,0.7781252,0.04403049,0.08967558],"study_design_scores_gemma":[0.00012168481,0.00017535248,0.010764444,0.00014533366,0.00011246376,0.002565487,0.0013743842,0.009739896,0.04364742,0.84465003,0.08660879,0.000094670846],"about_ca_topic_score_codex":0.0018383607,"about_ca_topic_score_gemma":0.0043196464,"teacher_disagreement_score":0.015689982,"about_ca_system_score_codex":0.0009221319,"about_ca_system_score_gemma":0.00053700677,"threshold_uncertainty_score":0.05248815},"labels":[],"label_agreement":null},{"id":"W1979865967","doi":"10.1007/s004930070030","title":"Approximate Homomorphisms II: Group Homomorphisms","year":2000,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Functional Equations Stability Results","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Homomorphism; Mathematics; Group (periodic table); Combinatorics; Discrete mathematics; Chemistry","score_opus":0.03743375855110635,"score_gpt":0.27089127136301955,"score_spread":0.23345751281191318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979865967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29705518,0.0025340028,0.58511937,0.0033134709,0.0005336641,0.0000855411,0.000366733,0.00041031468,0.11058177],"genre_scores_gemma":[0.9459571,0.0011031922,0.02453077,0.00042590965,0.00055629195,0.00011156306,0.00023057923,0.0001117038,0.02697281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955124,0.0001280709,0.000019480349,0.000113362745,0.00013028077,0.000057682264],"domain_scores_gemma":[0.9988745,0.00059940515,0.000110359775,0.00016427634,0.00013871276,0.0001127559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006806773,0.0006120973,0.0006755431,0.0013090894,0.0010891317,0.002008096,0.00077576644,0.0008358597,0.0076311086],"category_scores_gemma":[0.0032569992,0.00031017253,0.00059507263,0.0012706073,0.0019125383,0.006229048,0.0021149232,0.0024481078,0.00080588507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026383515,0.0000126004,0.00016327814,0.000031623313,0.000008274198,0.000021748483,0.0001769002,0.0009971141,0.0007074008,0.9907516,0.00092683244,0.006176167],"study_design_scores_gemma":[0.000005890775,0.000013624991,0.0001266657,0.0000045929933,0.000007047995,0.000060025137,0.000050931936,0.0065881787,0.000749584,0.9903054,0.0020829625,0.0000051666275],"about_ca_topic_score_codex":0.0005831145,"about_ca_topic_score_gemma":0.00027013847,"teacher_disagreement_score":0.0076311086,"about_ca_system_score_codex":0.00089825084,"about_ca_system_score_gemma":0.00027187195,"threshold_uncertainty_score":0.02552867},"labels":[],"label_agreement":null},{"id":"W1981300700","doi":"10.1007/s00493-013-2771-y","title":"Local chromatic number of quadrangulations of surfaces","year":2013,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Topological and Geometric Data Analysis","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Chromatic scale; Vertex (graph theory); Graph; Betti number; Generalization; Discrete mathematics; Mathematical analysis","score_opus":0.010703791616940099,"score_gpt":0.2437316914439877,"score_spread":0.2330278998270476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981300700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9617808,0.00018568426,0.018112794,0.00025949584,0.000022392873,0.000016949598,0.0003178415,0.00013441747,0.019169621],"genre_scores_gemma":[0.9926813,0.00011881382,0.0026595362,0.000028209883,0.00003232296,0.000015145409,0.00030736328,0.00005715147,0.0041001635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995339,0.00007785965,0.000019383517,0.00013060993,0.00012180291,0.00011642994],"domain_scores_gemma":[0.9976909,0.0010251605,0.00038839114,0.00027359088,0.000204128,0.00041786634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005139719,0.00046051765,0.00045539121,0.0028141206,0.0014072292,0.0038243434,0.0012410218,0.0006419136,0.013287584],"category_scores_gemma":[0.002606208,0.00033672046,0.00031950438,0.0019953384,0.0024820475,0.0027149932,0.0013598546,0.0009908467,0.00070818985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005959601,0.00011425188,0.0158498,0.00016009065,0.0000436151,0.00028867836,0.0012859297,0.021152312,0.013441696,0.9165222,0.0037843548,0.026761146],"study_design_scores_gemma":[0.00006884505,0.00010612338,0.014168763,0.000051255058,0.000075867334,0.00045596433,0.0011996934,0.087006524,0.008570133,0.880661,0.007565127,0.00007065876],"about_ca_topic_score_codex":0.0027177227,"about_ca_topic_score_gemma":0.0040297345,"teacher_disagreement_score":0.013287584,"about_ca_system_score_codex":0.0018483822,"about_ca_system_score_gemma":0.00045851563,"threshold_uncertainty_score":0.044451356},"labels":[],"label_agreement":null},{"id":"W1982114488","doi":"10.1007/s004930200024","title":"On Erdős's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6","year":2002,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Upper and lower bounds; Discrete mathematics","score_opus":0.044313882278276054,"score_gpt":0.28693761128235407,"score_spread":0.24262372900407803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982114488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44824162,0.009254902,0.28367883,0.05409498,0.002129733,0.00038263298,0.004442503,0.0022566777,0.19551815],"genre_scores_gemma":[0.918117,0.0037674177,0.04360279,0.00443352,0.004978992,0.00063742825,0.0021113644,0.0007902748,0.021561176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98886746,0.0025058195,0.0005415332,0.0034101137,0.0025967357,0.002078421],"domain_scores_gemma":[0.894988,0.08643423,0.0039921044,0.0065233326,0.0029017648,0.0051605524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01261192,0.00300202,0.0056991125,0.0070796493,0.0072502466,0.010192469,0.009413221,0.0056485385,0.01937019],"category_scores_gemma":[0.07304186,0.004313932,0.0042307014,0.007424436,0.010957576,0.03090852,0.011086779,0.016666101,0.002753902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001117362,0.00026561882,0.0034933386,0.0004476749,0.00013659654,0.0002703039,0.0013620995,0.012521089,0.0020454118,0.94757473,0.015571212,0.015194545],"study_design_scores_gemma":[0.000092665454,0.00004404424,0.0006481909,0.00007634508,0.000077557095,0.00015782616,0.00016459475,0.019837296,0.0009764265,0.9736473,0.004226546,0.000051311705],"about_ca_topic_score_codex":0.002862764,"about_ca_topic_score_gemma":0.0026694606,"teacher_disagreement_score":0.01937019,"about_ca_system_score_codex":0.005904443,"about_ca_system_score_gemma":0.0019446217,"threshold_uncertainty_score":0.06669903},"labels":[],"label_agreement":null},{"id":"W1984911038","doi":"10.1007/s004930100000","title":"On a Generalized Anti-Ramsey Problem","year":2001,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Ramsey's theorem; Order (exchange); Ramsey theory; Greedy coloring; Fractional coloring; List coloring; Complete coloring; Discrete mathematics","score_opus":0.03030719509583264,"score_gpt":0.29230931718515496,"score_spread":0.26200212208932233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984911038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47017378,0.003404779,0.2103295,0.043331455,0.001186007,0.00013752583,0.0006763708,0.0006060076,0.27015463],"genre_scores_gemma":[0.9241851,0.0020468624,0.036497302,0.0022431216,0.0009622979,0.0001611415,0.0005048215,0.00018722967,0.033212196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899095,0.00047388542,0.000036333084,0.00020565453,0.00016574697,0.00012742144],"domain_scores_gemma":[0.9960186,0.0027850447,0.00021517074,0.00040007196,0.00024241766,0.00033874137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017759299,0.00071378885,0.0013922831,0.000963483,0.003430864,0.003037721,0.0022797622,0.002904707,0.009425394],"category_scores_gemma":[0.007161419,0.0005846644,0.00093714806,0.002084576,0.0042863656,0.012900462,0.0037850244,0.004322036,0.0007381007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004756843,0.000028719913,0.00011488612,0.000059565366,0.000007172265,0.00006104501,0.00016480063,0.0019097809,0.000199254,0.98829716,0.0049134404,0.0041965684],"study_design_scores_gemma":[0.000015844902,0.000004921487,0.000043975648,0.000009773462,0.0000061091446,0.000056471505,0.00008093383,0.005135355,0.00009763507,0.99219173,0.0023516617,0.0000055250403],"about_ca_topic_score_codex":0.001348185,"about_ca_topic_score_gemma":0.0013659422,"teacher_disagreement_score":0.009425394,"about_ca_system_score_codex":0.0014652244,"about_ca_system_score_gemma":0.0010166087,"threshold_uncertainty_score":0.031531096},"labels":[],"label_agreement":null},{"id":"W1986273263","doi":"10.1007/s00493-003-0030-3","title":"Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*","year":2003,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","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 British Columbia","funders":"","keywords":"Submodular set function; Mathematics; Time complexity; Minimum-cost flow problem; Combinatorics; Flow (mathematics); Disjoint sets; Algorithm; Flow network; Discrete mathematics","score_opus":0.02942264740207311,"score_gpt":0.2672352279507417,"score_spread":0.2378125805486686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986273263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07080487,0.0010074435,0.8994856,0.0017291644,0.00042507105,0.0006576858,0.00087184313,0.0050865514,0.019931756],"genre_scores_gemma":[0.23292865,0.00042967702,0.7542557,0.0006092748,0.00023677018,0.0005628281,0.0015236634,0.0011073826,0.008345947],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983394,0.0004765059,0.000090726084,0.00033180843,0.00040495564,0.00035652207],"domain_scores_gemma":[0.9933437,0.004142151,0.00038760007,0.0012607803,0.0005118681,0.00035379914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032258418,0.0024401266,0.0026522218,0.0023799266,0.001922437,0.0026486358,0.0044380887,0.002389494,0.016561663],"category_scores_gemma":[0.010352971,0.001050578,0.0019407895,0.0031624038,0.0016426702,0.006118578,0.0036146494,0.0040929397,0.0020005172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017782348,0.0007919966,0.0010740447,0.00081011327,0.00013039485,0.00010441173,0.00033249104,0.16127385,0.008755679,0.123007804,0.041261584,0.66067934],"study_design_scores_gemma":[0.000441397,0.00024917567,0.000309408,0.00006325219,0.00006444611,0.000091555085,0.00008831366,0.73965824,0.00488783,0.24779686,0.0063041025,0.00004546613],"about_ca_topic_score_codex":0.0049678516,"about_ca_topic_score_gemma":0.0065939277,"teacher_disagreement_score":0.016561663,"about_ca_system_score_codex":0.0026906263,"about_ca_system_score_gemma":0.0039000544,"threshold_uncertainty_score":0.055404246},"labels":[],"label_agreement":null},{"id":"W1994006656","doi":"10.1007/s00493-012-2552-z","title":"A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks","year":2012,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","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 British Columbia","funders":"","keywords":"Spanning tree; Minimum spanning tree; Steiner tree problem; Minimum weight; Minimum degree spanning tree; k-minimum spanning tree; Connected dominating set; Bounded function; Asymptotically optimal algorithm","score_opus":0.028307662286784503,"score_gpt":0.26016036637486684,"score_spread":0.23185270408808234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994006656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2623022,0.013089877,0.6712405,0.014173146,0.0006332561,0.00027340898,0.0017244288,0.0021501263,0.034413077],"genre_scores_gemma":[0.91774815,0.0038319172,0.067026675,0.0023711277,0.001253804,0.00040047299,0.000806177,0.00048942375,0.006072418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941755,0.0015493517,0.0003711362,0.0014696077,0.0013192627,0.0011150951],"domain_scores_gemma":[0.9001576,0.07969949,0.005468741,0.0050278744,0.0033019609,0.0063444343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008214921,0.0020681156,0.004948751,0.0049678893,0.0025318626,0.009545278,0.007217721,0.0064622224,0.0066915895],"category_scores_gemma":[0.091037996,0.0032174382,0.0028734747,0.0039707874,0.007587801,0.022101851,0.007487856,0.010938581,0.0010502943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010591658,0.00017272921,0.0033661106,0.00085202476,0.00013267905,0.00032249978,0.0010215774,0.035873037,0.007852519,0.9183963,0.009652257,0.021299059],"study_design_scores_gemma":[0.0001172288,0.00013826806,0.0015047948,0.00017170167,0.00012649132,0.0004886337,0.0002424744,0.1525643,0.0027180265,0.8386232,0.0032038398,0.00010102064],"about_ca_topic_score_codex":0.0016136327,"about_ca_topic_score_gemma":0.0014243645,"teacher_disagreement_score":0.009545278,"about_ca_system_score_codex":0.00589032,"about_ca_system_score_gemma":0.0018991946,"threshold_uncertainty_score":0.04344517},"labels":[],"label_agreement":null},{"id":"W2005117665","doi":"10.1007/s00493-007-0041-6","title":"Vertex-Colouring Edge-Weightings","year":2007,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":114,"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; Vertex (graph theory); Graph; Neighbourhood (mathematics); Discrete mathematics","score_opus":0.008634628087088286,"score_gpt":0.22095935191402125,"score_spread":0.21232472382693296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005117665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1019376,0.0006229888,0.8577277,0.001307791,0.00022318395,0.00010132238,0.0006096043,0.0007764801,0.036693275],"genre_scores_gemma":[0.52690995,0.0008543518,0.44078508,0.00063283806,0.00023761933,0.00025301948,0.0010065394,0.0008739372,0.028446648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846244,0.0005511274,0.00008258902,0.00037208735,0.00032060305,0.00021108035],"domain_scores_gemma":[0.991411,0.004398331,0.00040033876,0.002441591,0.0007334859,0.0006153072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021502646,0.0008391612,0.0012421967,0.002026446,0.0015615998,0.002953416,0.0026226956,0.001499009,0.011554304],"category_scores_gemma":[0.0121189635,0.0006623416,0.000857993,0.004140111,0.0019114829,0.0064092423,0.0025512862,0.002882798,0.0014222844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011651585,0.00010814024,0.0007794355,0.00014571079,0.000023590792,0.000035719204,0.00015920133,0.0158349,0.002854022,0.8675222,0.008971318,0.10344923],"study_design_scores_gemma":[0.000021193,0.000014744615,0.00021505823,0.000025161502,0.000025596766,0.00006779057,0.00004969834,0.056721393,0.0018013775,0.93344873,0.007592285,0.000016885499],"about_ca_topic_score_codex":0.001395376,"about_ca_topic_score_gemma":0.0022607385,"teacher_disagreement_score":0.011554304,"about_ca_system_score_codex":0.0016603849,"about_ca_system_score_gemma":0.00084214873,"threshold_uncertainty_score":0.038653016},"labels":[],"label_agreement":null},{"id":"W2009649498","doi":"10.1007/s00493-014-3040-4","title":"Highly arc-transitive digraphs — Structure and counterexamples","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Transitive relation; Arc (geometry); Counterexample; Combinatorics; Digraph; Discrete mathematics; Transitive closure; Geometry","score_opus":0.029607543545062426,"score_gpt":0.28701406332159995,"score_spread":0.2574065197765375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009649498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75436634,0.00077677483,0.0993233,0.007376448,0.00026838988,0.00013118355,0.0012918455,0.0006988993,0.13576677],"genre_scores_gemma":[0.9822238,0.00035652934,0.009688765,0.0005810208,0.00013589024,0.000055834535,0.00070442643,0.00007998211,0.006173693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984586,0.00049763185,0.00011834371,0.00036554984,0.0003177764,0.00024203549],"domain_scores_gemma":[0.9862402,0.009755098,0.00090079725,0.00157694,0.0006005309,0.0009264201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001495547,0.0006021994,0.0011197958,0.0021005673,0.003543315,0.005113622,0.0016367603,0.0023440712,0.007976599],"category_scores_gemma":[0.007875559,0.0007262027,0.0012747493,0.0027686884,0.0047696214,0.00710445,0.0029397756,0.004077418,0.0006622974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050816347,0.00005014181,0.0004816165,0.00004634654,0.000012878391,0.00016077975,0.0003246914,0.00083702814,0.00043470276,0.9941924,0.0014737041,0.0019348979],"study_design_scores_gemma":[0.0000544601,0.000013289326,0.00030463308,0.000018293766,0.000023323246,0.00022173308,0.00021787467,0.005129434,0.0005507156,0.9912368,0.0022164842,0.000013148663],"about_ca_topic_score_codex":0.0018907278,"about_ca_topic_score_gemma":0.0023568773,"teacher_disagreement_score":0.007976599,"about_ca_system_score_codex":0.0019754225,"about_ca_system_score_gemma":0.0007999925,"threshold_uncertainty_score":0.026684344},"labels":[],"label_agreement":null},{"id":"W2016667694","doi":"10.1007/s004930200014","title":"Ramsey Numbers for Trees of Small Maximum Degree","year":2002,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Degree (music); Ramsey's theorem; Vertex (graph theory); Graph; Upper and lower bounds; Complete bipartite graph; Tree (set theory); Discrete mathematics","score_opus":0.1102685928597671,"score_gpt":0.28648096946199547,"score_spread":0.17621237660222838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016667694","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6687508,0.006584154,0.18009031,0.008512049,0.00046605963,0.000103835875,0.0006899511,0.0006440713,0.13415875],"genre_scores_gemma":[0.9577808,0.0023990048,0.025789153,0.0006557163,0.00047673902,0.00024179895,0.00027992838,0.00012400276,0.012252953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992293,0.0002468163,0.00004559177,0.00017750102,0.00017971774,0.00012101886],"domain_scores_gemma":[0.9891394,0.008273629,0.000878954,0.0004688367,0.0004147142,0.00082452595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023402749,0.0005305454,0.0011367957,0.0038547409,0.0025470583,0.0048135957,0.0014794834,0.0015299218,0.0065091243],"category_scores_gemma":[0.0131321,0.00084303226,0.000612936,0.002503698,0.004027597,0.012200624,0.002309205,0.0035635177,0.00064647925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039377817,0.000016649592,0.00025875794,0.00005059839,0.0000043284317,0.000024067596,0.00029684065,0.0009505855,0.00038507165,0.993543,0.0011850052,0.0032456913],"study_design_scores_gemma":[0.000009003977,0.000006518793,0.00019524738,0.000016578293,0.000007870758,0.000063115614,0.00007651132,0.003343272,0.00019723018,0.99454606,0.0015289553,0.000009759093],"about_ca_topic_score_codex":0.00072111626,"about_ca_topic_score_gemma":0.0012991262,"teacher_disagreement_score":0.0065091243,"about_ca_system_score_codex":0.0021315191,"about_ca_system_score_gemma":0.0007668673,"threshold_uncertainty_score":0.021775186},"labels":[],"label_agreement":null},{"id":"W2019038833","doi":"10.1007/s00493-014-2967-9","title":"Erratum to: Commentary for “On planarity of compact, locally connected, metric spaces”","year":2014,"lang":"en","type":"erratum","venue":"COMBINATORICA","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":"University of Waterloo","funders":"","keywords":"Mathematics; Planarity testing; Metric space; Metric (unit); Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.018324183717083123,"score_gpt":0.2670987992344801,"score_spread":0.248774615517397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019038833","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000071051225,0.0014292381,0.00031368618,0.730846,0.26419815,0.000017041628,0.00027849094,0.00006794662,0.0027783995],"genre_scores_gemma":[0.0011841219,0.0013674826,0.0005912677,0.8599102,0.121256664,0.000107738044,0.00011442761,0.00015106838,0.0153169865],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.986511,0.0024501795,0.002129562,0.0020419322,0.0056637856,0.0012036009],"domain_scores_gemma":[0.9483872,0.029550925,0.0021974612,0.0015671819,0.01664021,0.0016569727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008698246,0.0023056704,0.0031781043,0.003897843,0.008300437,0.006567512,0.008852751,0.051810246,0.015467858],"category_scores_gemma":[0.097748116,0.0020870327,0.0031492303,0.003118668,0.01390808,0.008462007,0.0051415446,0.06665411,0.012763922],"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.000009218654,0.000002124144,0.000011057311,0.000037217134,0.000004139337,0.000038087725,0.000027258386,0.00001807226,0.000012721197,0.0024611542,0.9966922,0.0006868585],"study_design_scores_gemma":[0.000054760905,0.000018822304,0.00036737134,0.00051621016,0.000054029526,0.00013512361,0.00020105921,0.00020337533,0.00018788989,0.01239328,0.9857971,0.000070956776],"about_ca_topic_score_codex":0.06318443,"about_ca_topic_score_gemma":0.06444792,"teacher_disagreement_score":0.06318443,"about_ca_system_score_codex":0.012386327,"about_ca_system_score_gemma":0.01344362,"threshold_uncertainty_score":0.12563336},"labels":[],"label_agreement":null},{"id":"W2026211607","doi":"10.1007/s004930070006","title":"Hedetniemi's Conjecture and the Retracts of a Product of Graphs","year":2000,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph Labeling and Dimension Problems","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 Regina; Champlain Regional College","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Product (mathematics); Discrete mathematics; Geometry","score_opus":0.004598761815875983,"score_gpt":0.18767523242924197,"score_spread":0.183076470613366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026211607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67631257,0.0019405191,0.14379482,0.018720891,0.0007054005,0.0000761872,0.0009160072,0.0005793682,0.15695423],"genre_scores_gemma":[0.9366347,0.00093042303,0.03083914,0.0014838534,0.0004591392,0.00009102455,0.0007489665,0.00016869232,0.028644029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981092,0.00055653806,0.00009941134,0.00057841314,0.00031290014,0.00034345896],"domain_scores_gemma":[0.9902159,0.006029144,0.0005466515,0.0018437342,0.00050215394,0.000862384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021642765,0.0008054763,0.0015894672,0.0014656152,0.0035630711,0.004372922,0.0027037875,0.002732605,0.011947704],"category_scores_gemma":[0.009440373,0.0012340571,0.0013973216,0.0019280325,0.0065471414,0.014914746,0.0052234223,0.0066169286,0.0012494124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009207327,0.00003149128,0.0005783296,0.00004704751,0.000007719132,0.000077808654,0.00046378595,0.0015212976,0.00034587082,0.98975986,0.0030214698,0.0040532257],"study_design_scores_gemma":[0.000021342279,0.000009788453,0.0001826628,0.000011202969,0.0000064570377,0.00006773016,0.00016672512,0.003666736,0.00032249079,0.9913879,0.004147656,0.000009230545],"about_ca_topic_score_codex":0.0021711467,"about_ca_topic_score_gemma":0.0019323794,"teacher_disagreement_score":0.011947704,"about_ca_system_score_codex":0.0017504118,"about_ca_system_score_gemma":0.0007824908,"threshold_uncertainty_score":0.039969027},"labels":[],"label_agreement":null},{"id":"W2029049420","doi":"10.1007/s00493-003-0034-z","title":"The Fixing Block Method in Combinatorics on Words","year":2003,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"semigroups and automata theory","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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Block (permutation group theory); Combinatorics on words; Algebraic combinatorics; Discrete mathematics; Word (group theory); Geometry","score_opus":0.010670412091314195,"score_gpt":0.25678029379713985,"score_spread":0.24610988170582565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029049420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010960448,0.002453762,0.94177717,0.0018963419,0.0007133609,0.00006573584,0.00020313691,0.0007460723,0.041183997],"genre_scores_gemma":[0.34142026,0.006272424,0.53390384,0.0015989168,0.0019801916,0.0007924442,0.0007563055,0.0024365634,0.11083909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828315,0.00079342054,0.00007817937,0.00032089296,0.00036007914,0.00016421461],"domain_scores_gemma":[0.997572,0.001315396,0.000090082714,0.00074906315,0.00018250546,0.00009080778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022503831,0.0013013281,0.0016977425,0.0026489748,0.0023750043,0.0027892962,0.0025854253,0.0017952713,0.015929831],"category_scores_gemma":[0.0045820824,0.0012856519,0.002033818,0.0034164006,0.006842825,0.010613013,0.0030344822,0.00584843,0.0049993354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018182849,0.0000059851495,0.000030831296,0.000041623298,0.0000060962443,0.000014844245,0.00009754308,0.0007385555,0.00037903053,0.98536694,0.0017529363,0.0115475375],"study_design_scores_gemma":[0.00001147846,0.000011691286,0.000031047934,0.000016545036,0.000010477423,0.000028329729,0.000019877194,0.0039285943,0.0007037923,0.9838562,0.011365845,0.000016017748],"about_ca_topic_score_codex":0.0024436065,"about_ca_topic_score_gemma":0.002104322,"teacher_disagreement_score":0.015929831,"about_ca_system_score_codex":0.001863588,"about_ca_system_score_gemma":0.0012049474,"threshold_uncertainty_score":0.053290546},"labels":[],"label_agreement":null},{"id":"W2031397195","doi":"10.1007/s00493-008-2099-1","title":"Near optimal bounds for the Erdős distinct distances problem in high dimensions","year":2008,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","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 British Columbia Hospital","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Set (abstract data type)","score_opus":0.018005790983252574,"score_gpt":0.24024051087477719,"score_spread":0.2222347198915246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031397195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09322341,0.0147450045,0.7486243,0.016602242,0.0014638476,0.00030894313,0.002060841,0.0016377541,0.121333696],"genre_scores_gemma":[0.5867971,0.010878966,0.35470453,0.0041104387,0.002197227,0.0009766027,0.0030343356,0.002213646,0.035087146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935061,0.0022639427,0.0002788544,0.0009708389,0.0019407312,0.0010397044],"domain_scores_gemma":[0.95179987,0.038823754,0.0014642219,0.004211459,0.0016660868,0.0020345852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00813034,0.0037707423,0.0041106087,0.004130126,0.00302756,0.0089905085,0.0076481793,0.0042394167,0.021029865],"category_scores_gemma":[0.044724196,0.0018584852,0.0020231178,0.0057134572,0.005757664,0.018732492,0.010952349,0.011366616,0.0034182712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010532284,0.00038421966,0.0011280605,0.0009573931,0.0001573663,0.00013555592,0.00054755004,0.14598711,0.0027553535,0.75095075,0.031167418,0.064776085],"study_design_scores_gemma":[0.00012043364,0.00007823914,0.00027641217,0.00013314195,0.00007131402,0.0001060093,0.00018523575,0.18674397,0.0010609259,0.80406266,0.0071148584,0.000046778066],"about_ca_topic_score_codex":0.0023074863,"about_ca_topic_score_gemma":0.0042664027,"teacher_disagreement_score":0.021029865,"about_ca_system_score_codex":0.005813127,"about_ca_system_score_gemma":0.0031568022,"threshold_uncertainty_score":0.0703519},"labels":[],"label_agreement":null},{"id":"W2032198109","doi":"10.1007/s00493-008-2157-8","title":"An algorithm for packing non-zero A-paths in group-labelled graphs","year":2008,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","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","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Disjoint sets; Path (computing); Abelian group; Graph; Group (periodic table); Matching (statistics); Induced path; Zero (linguistics); Discrete mathematics; Algorithm; Longest path problem; Shortest path problem; Computer science","score_opus":0.02376304741433146,"score_gpt":0.2586423356285821,"score_spread":0.2348792882142506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032198109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07215099,0.00020678504,0.90881765,0.00079858984,0.00014813,0.00048903096,0.0008628506,0.0058171363,0.010708844],"genre_scores_gemma":[0.09664979,0.00011292117,0.8966387,0.00012877629,0.00003250207,0.00027978476,0.0014583627,0.00040539211,0.004293872],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988851,0.00017675853,0.00010150118,0.00033681933,0.00027664445,0.00022329994],"domain_scores_gemma":[0.9969258,0.0012863483,0.00025025065,0.0008752259,0.00030907607,0.0003532447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008463931,0.00161692,0.0016572658,0.0020704484,0.002356894,0.0036032794,0.0038406898,0.003020441,0.014830436],"category_scores_gemma":[0.003981428,0.0011962474,0.0015770557,0.004507965,0.0016140606,0.005613757,0.0047901543,0.0024817241,0.0039078514],"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.0010115744,0.00097447436,0.0028799146,0.000985136,0.00018814635,0.0003915268,0.0011950566,0.0560699,0.026038043,0.11214982,0.03032837,0.76778805],"study_design_scores_gemma":[0.0005989967,0.0004484293,0.0014581301,0.00014495527,0.00023734751,0.0006796551,0.0007686819,0.5042238,0.024516424,0.4467417,0.020041626,0.00014030025],"about_ca_topic_score_codex":0.003493609,"about_ca_topic_score_gemma":0.0050398638,"teacher_disagreement_score":0.014830436,"about_ca_system_score_codex":0.0018482114,"about_ca_system_score_gemma":0.0025235922,"threshold_uncertainty_score":0.04961276},"labels":[],"label_agreement":null},{"id":"W2033177258","doi":"10.1007/s00493-007-2241-5","title":"A phase transition for the metric distortion of percolation on the hypercube","year":2007,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Hypercube; Combinatorics; Distortion (music); Phase transition; Percolation (cognitive psychology); Uniqueness; Bernoulli's principle; Metric (unit); Discrete mathematics; Mathematical analysis; Physics; Condensed matter physics; Thermodynamics","score_opus":0.06520229943308131,"score_gpt":0.35047540168216074,"score_spread":0.2852731022490794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033177258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86619616,0.0039588194,0.0678061,0.0057512987,0.0004777327,0.00010777557,0.0005616358,0.0004306043,0.054709863],"genre_scores_gemma":[0.9887524,0.00051065534,0.0067590447,0.00018595964,0.00013227106,0.000041322568,0.00013906432,0.00006762236,0.0034116507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997665,0.00007407106,0.00001052055,0.000033046923,0.00006913222,0.000046797635],"domain_scores_gemma":[0.9986528,0.00060645764,0.00019240283,0.00011481153,0.00012391766,0.0003096171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046695847,0.00034106476,0.0006003793,0.0013167647,0.0011586546,0.0025812332,0.0009858429,0.0011862381,0.006018028],"category_scores_gemma":[0.0047925054,0.00036048022,0.0004793571,0.00060590304,0.0022001297,0.0020537581,0.0011618298,0.0012341869,0.00038198842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012147424,0.000029517087,0.0005802041,0.000078961384,0.00000925938,0.00012482544,0.00018752193,0.009650787,0.0033734448,0.98058987,0.0024773232,0.0027768342],"study_design_scores_gemma":[0.00007820718,0.000058255704,0.0011649197,0.000035643818,0.000010434736,0.00038615818,0.00014319432,0.11226467,0.0018424343,0.88055074,0.0034258391,0.00003943237],"about_ca_topic_score_codex":0.0014981576,"about_ca_topic_score_gemma":0.00095309794,"teacher_disagreement_score":0.006018028,"about_ca_system_score_codex":0.0016037448,"about_ca_system_score_gemma":0.00062831497,"threshold_uncertainty_score":0.020132363},"labels":[],"label_agreement":null},{"id":"W2039034730","doi":"10.1007/s00493-005-0013-7","title":"Matroid Matching Via Mixed Skew-Symmetric Matrices","year":2005,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Matroid; Rank (graph theory); Matching (statistics); Discrete mathematics; Matrix (chemical analysis); Bipartite graph; Cardinality (data modeling); Skew; Graph","score_opus":0.00494074972957487,"score_gpt":0.1859508627076843,"score_spread":0.18101011297810943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039034730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21289358,0.00030969264,0.75378585,0.00065991876,0.000106400104,0.00009875441,0.00020588348,0.00044264735,0.03149732],"genre_scores_gemma":[0.8494146,0.00038120354,0.13385877,0.0003097678,0.00015892141,0.00012913642,0.00023550222,0.00011744802,0.015394726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988286,0.00041064163,0.0000645644,0.00022135476,0.00033125913,0.00014356733],"domain_scores_gemma":[0.9969886,0.001382794,0.0004761267,0.00051333953,0.00039348824,0.00024569116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009756976,0.0004490714,0.0006399012,0.0014711841,0.0009899508,0.0027575726,0.0009917043,0.0010140907,0.0060252347],"category_scores_gemma":[0.0050789095,0.0005244249,0.00050858,0.0017733646,0.0009869786,0.0046393923,0.0018684631,0.0011803837,0.00082452653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014684605,0.00007343889,0.00038156591,0.000054231376,0.000019576823,0.000103452796,0.00013871916,0.01311029,0.006037138,0.95320207,0.0015827373,0.02514997],"study_design_scores_gemma":[0.000038878003,0.000049761442,0.00020526588,0.0000145794875,0.000015782956,0.00018775152,0.00006878765,0.15566678,0.0045179753,0.8360604,0.0031518855,0.00002211086],"about_ca_topic_score_codex":0.00079019304,"about_ca_topic_score_gemma":0.0011092959,"teacher_disagreement_score":0.0060252347,"about_ca_system_score_codex":0.0009795644,"about_ca_system_score_gemma":0.00070275815,"threshold_uncertainty_score":0.020156384},"labels":[],"label_agreement":null},{"id":"W2040142481","doi":"10.1007/s00493-013-2723-6","title":"Ramsey degrees of boron tree structures","year":2013,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Automorphism group; Automorphism; Embedding; Tree (set theory); Discrete mathematics; Group (periodic table); Limit (mathematics); Ramsey's theorem; Binary tree; Class (philosophy); Graph","score_opus":0.03028159500317529,"score_gpt":0.29926871099050356,"score_spread":0.2689871159873283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040142481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6908087,0.0016827529,0.08465749,0.0027880357,0.00019457344,0.000048070047,0.00091732707,0.0003097832,0.2185932],"genre_scores_gemma":[0.97810453,0.00067255256,0.0062341457,0.00029750424,0.00010987897,0.000042739957,0.00035763788,0.00006794283,0.014113047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956423,0.00010545988,0.000021198692,0.00007763734,0.00011663963,0.00011475084],"domain_scores_gemma":[0.99895525,0.0004710789,0.00012017083,0.00008759965,0.0001302289,0.00023555855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009165394,0.00047856773,0.0006648828,0.0021936127,0.0019331806,0.003086904,0.0007622888,0.0007181917,0.0096999025],"category_scores_gemma":[0.0023262468,0.0005362846,0.0004442965,0.0014087672,0.0023200822,0.005438883,0.0018565191,0.0020827379,0.0009259966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005111333,0.000011738387,0.00023057585,0.000026885713,0.000004006362,0.000020337839,0.00027886246,0.0005788004,0.00047977213,0.99469626,0.0007064246,0.0029151288],"study_design_scores_gemma":[0.000016529393,0.00000884015,0.0003773841,0.000019684629,0.000012405968,0.000051057214,0.00021941609,0.0017307432,0.00046077988,0.9938127,0.003277621,0.000012770866],"about_ca_topic_score_codex":0.0017093176,"about_ca_topic_score_gemma":0.0026851823,"teacher_disagreement_score":0.0096999025,"about_ca_system_score_codex":0.0013552358,"about_ca_system_score_gemma":0.00045235772,"threshold_uncertainty_score":0.032449424},"labels":[],"label_agreement":null},{"id":"W2042875854","doi":"10.1007/s00493-014-2959-9","title":"Many non-equivalent realizations of the associahedron","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Liquid Crystal Research Advancements","field":"Materials Science","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":"York University","funders":"","keywords":"Modulo; Polytope; Equivalence (formal languages); Isometry (Riemannian geometry); Type (biology); Cluster algebra; Realization (probability); Polyhedron","score_opus":0.014258493655138814,"score_gpt":0.28036040500932735,"score_spread":0.26610191135418854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042875854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61297756,0.0014082047,0.11739836,0.0031068511,0.0007359203,0.00006223639,0.00046269986,0.00035882433,0.26348928],"genre_scores_gemma":[0.96314704,0.0004501752,0.016507637,0.00052482804,0.0004153256,0.000088065615,0.00038545864,0.00009361448,0.018387932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982882,0.0005569862,0.00012729927,0.0002480826,0.00045742173,0.0003219638],"domain_scores_gemma":[0.99842536,0.00065533264,0.0001475443,0.0002943324,0.00020083043,0.00027660708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012351383,0.00072180835,0.0009981703,0.0020328988,0.003557448,0.0058853608,0.0013460387,0.0023517958,0.011634809],"category_scores_gemma":[0.0023805266,0.00061340793,0.0012391071,0.001461254,0.003971451,0.005478547,0.0024751236,0.0028060193,0.0010612691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001750896,0.000016665317,0.00007427635,0.000011446054,0.0000050316235,0.00006969524,0.00006413362,0.00039505458,0.00023335312,0.9975914,0.0003591813,0.001162351],"study_design_scores_gemma":[0.000013811872,0.000008122539,0.00009725826,0.000007847891,0.000005181952,0.00008347255,0.00006909481,0.0032447644,0.00019522205,0.99499196,0.0012703063,0.000013023972],"about_ca_topic_score_codex":0.00052782195,"about_ca_topic_score_gemma":0.0008499333,"teacher_disagreement_score":0.011634809,"about_ca_system_score_codex":0.0013230093,"about_ca_system_score_gemma":0.0006564095,"threshold_uncertainty_score":0.03892225},"labels":[],"label_agreement":null},{"id":"W2044603066","doi":"10.1007/s00493-005-0014-6","title":"Lower Bounds For Concurrent Zero Knowledge*","year":2005,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Cryptography and Data Security","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 Toronto","funders":"","keywords":"Mathematical proof; Zero-knowledge proof; Asynchronous communication; Zero (linguistics); Argument (complex analysis); Mathematics; Class (philosophy); Discrete mathematics; Theoretical computer science; Computer science; Artificial intelligence; Computer network","score_opus":0.018413443628149253,"score_gpt":0.27931495785124527,"score_spread":0.26090151422309604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044603066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06164723,0.006772775,0.71920025,0.019799285,0.001303672,0.00045121484,0.0025638074,0.002603916,0.18565774],"genre_scores_gemma":[0.8069646,0.0062771337,0.12121219,0.004382572,0.0037332182,0.0013214655,0.002886054,0.0020613624,0.05116141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9819759,0.0035780082,0.0007621195,0.003063287,0.005470686,0.0051500225],"domain_scores_gemma":[0.831974,0.13208063,0.0047585354,0.018723056,0.0068536107,0.0056101712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0123704765,0.004706194,0.0048253667,0.0061481856,0.007520476,0.019237543,0.01227305,0.0060222317,0.0328567],"category_scores_gemma":[0.080674514,0.003119605,0.0041294023,0.008626539,0.010896396,0.045594223,0.018807124,0.020436695,0.006614635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066438795,0.0002579353,0.0009255739,0.00053311297,0.0000967931,0.00013472627,0.00050026935,0.018561108,0.0012117348,0.9408731,0.0122899525,0.023951337],"study_design_scores_gemma":[0.000050729508,0.000034110806,0.00011517362,0.00007993921,0.00007321488,0.00009790508,0.000059856913,0.031881176,0.0009846555,0.9634964,0.0030950913,0.000031813997],"about_ca_topic_score_codex":0.0030667274,"about_ca_topic_score_gemma":0.0039658532,"teacher_disagreement_score":0.0328567,"about_ca_system_score_codex":0.01017773,"about_ca_system_score_gemma":0.00842835,"threshold_uncertainty_score":0.10991663},"labels":[],"label_agreement":null},{"id":"W2044987315","doi":"10.1007/s00493-014-3132-1","title":"Sabidussi versus Hedetniemi for three variations of the chromatic number","year":2015,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Algebraic structures and combinatorial models","field":"Mathematics","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":"University of Waterloo","funders":"","keywords":"Cartesian product; Mathematics; Combinatorics; Conjecture; Chromatic scale; Homomorphism; Product (mathematics); Graph; Discrete mathematics; Geometry","score_opus":0.12270365183534478,"score_gpt":0.34171966285097594,"score_spread":0.21901601101563117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044987315","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4347958,0.0045822207,0.10824528,0.00848192,0.0019981093,0.0001315177,0.0008131805,0.0004811069,0.44047084],"genre_scores_gemma":[0.9563037,0.00081988284,0.016426908,0.0005248816,0.00031645037,0.00008329692,0.00024606384,0.00013624075,0.02514255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993026,0.00017515988,0.000026989464,0.00014984277,0.00016896689,0.00017645305],"domain_scores_gemma":[0.99886775,0.00050506723,0.000122008685,0.00023893289,0.00010725189,0.00015899325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011466868,0.00053706265,0.0006062987,0.0017014634,0.0022970745,0.0034010492,0.0016790911,0.0017090905,0.0161766],"category_scores_gemma":[0.0035303277,0.00023227697,0.00066372135,0.0017485656,0.004498822,0.0041623213,0.0021284898,0.0027189702,0.0012536932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071213915,0.000009860157,0.00014834543,0.000020058782,0.0000030518727,0.000021996359,0.00008110485,0.00093733775,0.00029542638,0.9933537,0.0014239028,0.003633985],"study_design_scores_gemma":[0.00004441268,0.000035774745,0.0007108378,0.00003801014,0.00002395496,0.000112894966,0.00019409932,0.010861545,0.00082573673,0.9727313,0.014379614,0.00004171083],"about_ca_topic_score_codex":0.0016865637,"about_ca_topic_score_gemma":0.0023669063,"teacher_disagreement_score":0.0161766,"about_ca_system_score_codex":0.0024715085,"about_ca_system_score_gemma":0.00089175184,"threshold_uncertainty_score":0.05411613},"labels":[],"label_agreement":null},{"id":"W2046052042","doi":"10.1007/s00493-006-0013-2","title":"Canonical Partitions Of Universal Structures","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Algebra and Logic","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 Calgary","funders":"","keywords":"Mathematics; Countable set; Combinatorics; Equivalence relation; Homogeneous; Equivalence (formal languages); Omega; Characterization (materials science); Discrete mathematics; Binary number; Equivalence class (music); Arithmetic","score_opus":0.007565791298253982,"score_gpt":0.21510860452189662,"score_spread":0.20754281322364262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046052042","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41833565,0.0016095637,0.2845475,0.0021398007,0.0009828267,0.0001862373,0.0012739486,0.0013306873,0.2895937],"genre_scores_gemma":[0.91934484,0.00054599624,0.024689602,0.00039454282,0.00035631075,0.00015053336,0.00082460186,0.0005485599,0.053145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778384,0.00047968578,0.00012242368,0.0005783296,0.0004105432,0.0006252274],"domain_scores_gemma":[0.99787426,0.0007008909,0.00015154952,0.00042497565,0.00037885088,0.00046947834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001346953,0.0009787476,0.00135885,0.0033302421,0.005163276,0.008144491,0.0013390764,0.0014162246,0.018169457],"category_scores_gemma":[0.0033033737,0.0012536239,0.0015869432,0.0027288664,0.0063030384,0.0124670705,0.0055452455,0.0036001327,0.0026296733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014647012,0.0000051056027,0.0000640332,0.0000075600046,0.0000019828494,0.000014086122,0.0001763968,0.0000647252,0.00011309827,0.99793184,0.0003762037,0.0012303365],"study_design_scores_gemma":[0.000008086183,0.000005094102,0.00009878796,0.000009020866,0.0000073673014,0.000049054182,0.00018521279,0.00055663625,0.00031700547,0.9951846,0.0035700735,0.000009144155],"about_ca_topic_score_codex":0.0016901788,"about_ca_topic_score_gemma":0.002375574,"teacher_disagreement_score":0.018169457,"about_ca_system_score_codex":0.0024755134,"about_ca_system_score_gemma":0.0010841385,"threshold_uncertainty_score":0.06078291},"labels":[],"label_agreement":null},{"id":"W2051714857","doi":"10.1007/s00493-006-0015-0","title":"COLORING SUBGRAPHS OF THE RADO GRAPH","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"semigroups and automata theory","field":"Computer Science","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":"University of Calgary","funders":"","keywords":"Mathematics; Partition (number theory); Combinatorics; Countable set; Homogeneous; Element (criminal law); Graph; Binary number; Discrete mathematics; Class (philosophy); Arithmetic; Computer science","score_opus":0.003797364287851082,"score_gpt":0.17083807351288774,"score_spread":0.16704070922503667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051714857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7285327,0.0005366245,0.16834582,0.0013682398,0.00014911994,0.0001250738,0.0012276366,0.00092303276,0.09879175],"genre_scores_gemma":[0.924616,0.00032651678,0.050198223,0.00032220644,0.00006397667,0.000125098,0.001281383,0.00020792412,0.022858826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996929,0.00009955911,0.000013347947,0.0000836534,0.00004568715,0.00006493955],"domain_scores_gemma":[0.99865097,0.0006354598,0.00016519165,0.0002735193,0.00011380601,0.00016106012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023673566,0.00030175145,0.000387302,0.0006957899,0.0010463423,0.0013610332,0.0007035774,0.0005140219,0.006486143],"category_scores_gemma":[0.0011092299,0.00036252354,0.0005279223,0.0007507778,0.00087892637,0.0012272864,0.00068427506,0.00062003837,0.0009216114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019509018,0.00006470371,0.0021433118,0.00011556904,0.00002193781,0.00035345563,0.0007100507,0.0066388096,0.012802872,0.95137435,0.0055888924,0.01999087],"study_design_scores_gemma":[0.000053468422,0.00003214118,0.00199118,0.000025482912,0.00004049448,0.00033254133,0.0003920268,0.026921842,0.00488212,0.95269984,0.012604939,0.000023864988],"about_ca_topic_score_codex":0.0023947787,"about_ca_topic_score_gemma":0.004109287,"teacher_disagreement_score":0.006486143,"about_ca_system_score_codex":0.0007013435,"about_ca_system_score_gemma":0.00046706598,"threshold_uncertainty_score":0.021698296},"labels":[],"label_agreement":null},{"id":"W2058108962","doi":"10.1007/s004930170003","title":"Integer and Fractional Packings in Dense Graphs","year":2001,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":92,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Graph; Disjoint sets; Integer (computer science); Pairwise comparison; Discrete mathematics; Statistics","score_opus":0.024759626505838645,"score_gpt":0.28694245928115264,"score_spread":0.262182832775314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058108962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.750827,0.0033790579,0.13065393,0.0032937366,0.00030601758,0.000042739066,0.0003794359,0.00033886486,0.1107792],"genre_scores_gemma":[0.96332276,0.001361785,0.021347778,0.0003600207,0.00035847386,0.00006751223,0.00029949617,0.000083275016,0.012798802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917966,0.00023259861,0.000050567472,0.00014908076,0.00021702172,0.00017095813],"domain_scores_gemma":[0.9955428,0.002796496,0.00065900484,0.00035394015,0.00022226051,0.00042543354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010984202,0.000630732,0.0011725314,0.0034309,0.0030345528,0.0052600736,0.0013623909,0.0017095057,0.005910738],"category_scores_gemma":[0.008467753,0.0010647045,0.00066546415,0.003529652,0.0051640724,0.008898443,0.002494329,0.0027570562,0.00042437456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031655785,0.000022774184,0.00021590179,0.000029735873,0.0000032434941,0.00005066073,0.0002960262,0.0016297076,0.00027171912,0.9931243,0.00075892813,0.0035654323],"study_design_scores_gemma":[0.000008364729,0.000004874006,0.00013597516,0.000013490638,0.0000042768024,0.000074544696,0.00012336975,0.0045655696,0.00016943149,0.99378407,0.0011109285,0.000005184766],"about_ca_topic_score_codex":0.0020046874,"about_ca_topic_score_gemma":0.0023610485,"teacher_disagreement_score":0.005910738,"about_ca_system_score_codex":0.0018341944,"about_ca_system_score_gemma":0.00051784894,"threshold_uncertainty_score":0.019773364},"labels":[],"label_agreement":null},{"id":"W2059154872","doi":"10.1007/s004930170005","title":"Critical Facets of the Stable Set Polytope","year":2001,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","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":"Combinatorics; Mathematics; Polytope; Critical graph; Birkhoff polytope; Graph; Facet (psychology); Discrete mathematics; Line graph; Voltage graph; Geometry; Convex set","score_opus":0.028981905935811323,"score_gpt":0.27306865573500755,"score_spread":0.24408674979919623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059154872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57007176,0.0014175422,0.21378265,0.002404601,0.00015060524,0.00016291422,0.0017008851,0.0002949256,0.21001409],"genre_scores_gemma":[0.9524209,0.0009324778,0.021025524,0.00016372761,0.00017872575,0.00016051842,0.0014660144,0.00013224363,0.023519823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994893,0.000080273225,0.000021640053,0.000087679255,0.00021228046,0.0001086538],"domain_scores_gemma":[0.9984212,0.00086291914,0.00014729217,0.00013713176,0.00017244589,0.00025899662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004329275,0.00049750553,0.0010463757,0.001888324,0.002097095,0.005650888,0.0010094527,0.0009127172,0.014238566],"category_scores_gemma":[0.0025622146,0.0006403786,0.00079992006,0.0017275648,0.002901568,0.0038838768,0.00176256,0.0025221691,0.0010971272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006205367,0.000020563855,0.00044583462,0.000048793416,0.000012193318,0.00006482919,0.00016912713,0.0044869934,0.00079200295,0.9864668,0.0025087746,0.004921953],"study_design_scores_gemma":[0.000025045218,0.000010237489,0.00039416566,0.000017539978,0.000008906928,0.00007802117,0.00015497209,0.014478766,0.0006552458,0.98064154,0.0035258878,0.000009635251],"about_ca_topic_score_codex":0.003247789,"about_ca_topic_score_gemma":0.0026750828,"teacher_disagreement_score":0.014238566,"about_ca_system_score_codex":0.0018023794,"about_ca_system_score_gemma":0.00080619275,"threshold_uncertainty_score":0.047632754},"labels":[],"label_agreement":null},{"id":"W2062920840","doi":"10.1007/s00493-005-0031-5","title":"Small Forbidden Configurations IV: The 3 Rowed Case","year":2005,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.06555081426316522,"score_gpt":0.2961509496191087,"score_spread":0.23060013535594348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062920840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57394683,0.0009959337,0.082247436,0.0026967023,0.00037923714,0.00007354932,0.00031359436,0.0006247679,0.33872196],"genre_scores_gemma":[0.96862596,0.00022294342,0.01402125,0.0003413343,0.00009261556,0.000078409095,0.00012602023,0.00010522719,0.016386196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918133,0.00022163236,0.000034730518,0.00013154383,0.00018056032,0.00025017207],"domain_scores_gemma":[0.9984276,0.00060110237,0.00020493123,0.00028161792,0.00012718112,0.00035743808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063398253,0.0006185613,0.00078174705,0.0014695752,0.0024958325,0.0047988365,0.0016771395,0.002203175,0.014511781],"category_scores_gemma":[0.0024914297,0.0005857786,0.00078815105,0.0011224642,0.0042313645,0.0033566377,0.0022483284,0.0027470787,0.0013883971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053172465,0.00002786132,0.00026792169,0.00002952609,0.000009235205,0.00041309977,0.0001882544,0.0012823795,0.0012447735,0.99198204,0.0015137114,0.0029880847],"study_design_scores_gemma":[0.000020246696,0.0000106154475,0.00015105295,0.00001430725,0.0000070062188,0.00030639066,0.0001795015,0.0052840267,0.00077682355,0.9917441,0.0014921249,0.000013712201],"about_ca_topic_score_codex":0.001374076,"about_ca_topic_score_gemma":0.0017483576,"teacher_disagreement_score":0.014511781,"about_ca_system_score_codex":0.00079363456,"about_ca_system_score_gemma":0.00069941516,"threshold_uncertainty_score":0.04854679},"labels":[],"label_agreement":null},{"id":"W2064317094","doi":"10.1007/s00493-003-0028-x","title":"Sharp Concentration of the Number of Submaps in Random Planar Triangulations","year":2003,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Planar; Vertex (graph theory); Degree (music); Convex polygon; Polygon (computer graphics); Regular polygon; Limiting; Triangulation; Planar graph; Point set triangulation; Geometry; Graph; Delaunay triangulation; Physics","score_opus":0.012195773987423764,"score_gpt":0.24536825558037026,"score_spread":0.23317248159294648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064317094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37295467,0.0037622242,0.5832007,0.0067854375,0.0002965383,0.0001763155,0.0010771945,0.0009466212,0.030800233],"genre_scores_gemma":[0.90540284,0.0019552046,0.07540322,0.0011504369,0.0004659758,0.00057392113,0.0010570929,0.00066074583,0.013330667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968991,0.0012842162,0.00015546242,0.0005071163,0.0007400948,0.00041397227],"domain_scores_gemma":[0.9280531,0.057325173,0.005520471,0.0034770968,0.002327097,0.003297136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056956713,0.0015349603,0.0029196632,0.004183414,0.0019971991,0.0057957773,0.0048025656,0.0042192065,0.0075177043],"category_scores_gemma":[0.06307461,0.002598234,0.0017430534,0.0023001747,0.0070398026,0.007325448,0.00583477,0.0044709346,0.00086392433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051049766,0.00008154645,0.0034172554,0.0004312248,0.00015297689,0.00033678437,0.00046659572,0.19481058,0.003949797,0.7778866,0.007249897,0.010706289],"study_design_scores_gemma":[0.00010245823,0.0000747675,0.0010061354,0.00011138145,0.0000527364,0.0002825999,0.00014522448,0.39630032,0.0018481279,0.5981366,0.0018813008,0.000058390466],"about_ca_topic_score_codex":0.0016096951,"about_ca_topic_score_gemma":0.0015656719,"teacher_disagreement_score":0.0075177043,"about_ca_system_score_codex":0.0032424,"about_ca_system_score_gemma":0.0010076977,"threshold_uncertainty_score":0.030121922},"labels":[],"label_agreement":null},{"id":"W2065653857","doi":"10.1007/s00493-009-2267-y","title":"On the edge-density of 4-critical graphs","year":2009,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Brock University","funders":"Kempe Foundation","keywords":"Mathematics; Combinatorics; Conjecture; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","score_opus":0.027806760855781033,"score_gpt":0.29770400574462824,"score_spread":0.2698972448888472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065653857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83892757,0.003900884,0.07946689,0.0042183395,0.0001738638,0.00004820317,0.0002417172,0.00024558342,0.07277701],"genre_scores_gemma":[0.9846629,0.0013572538,0.007559711,0.00029214128,0.00031500403,0.00007057834,0.00014524184,0.000066713415,0.005530415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924064,0.00034588575,0.00002736804,0.000089281624,0.00018544978,0.000111374495],"domain_scores_gemma":[0.99058366,0.0068119476,0.00075621996,0.00035021355,0.0005713983,0.00092654803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00182342,0.0006989767,0.0011596411,0.004938236,0.0023433608,0.0029510832,0.0022247392,0.0018619151,0.0053809555],"category_scores_gemma":[0.013537483,0.0008458731,0.0005029713,0.0021497859,0.005590243,0.006451684,0.0024893414,0.002265199,0.0003850996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029975592,0.000018361477,0.00048692114,0.000040513947,0.0000055200812,0.000049357197,0.00024767345,0.0025356186,0.0003702925,0.99355185,0.000703344,0.0019605507],"study_design_scores_gemma":[0.000009475466,0.000006087772,0.00029809738,0.000020938347,0.0000054192515,0.00006366665,0.00008764791,0.011249343,0.00013908236,0.98756707,0.000544328,0.0000088465795],"about_ca_topic_score_codex":0.002085216,"about_ca_topic_score_gemma":0.0016375047,"teacher_disagreement_score":0.0053809555,"about_ca_system_score_codex":0.0018855804,"about_ca_system_score_gemma":0.00065727334,"threshold_uncertainty_score":0.01800108},"labels":[],"label_agreement":null},{"id":"W2074813456","doi":"10.1007/s00493-014-2880-2","title":"Measurable events indexed by products of trees","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Cartesian product; Combinatorics; Homogeneous; Tree (set theory); Product (mathematics); Sequence (biology); Discrete mathematics; Integer (computer science); Lebesgue integration; Finite set; Mathematical analysis","score_opus":0.020607426182429462,"score_gpt":0.2553691899771304,"score_spread":0.2347617637947009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074813456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31599125,0.0016225533,0.61333185,0.0016683195,0.00034657062,0.00012583562,0.0010063226,0.00097478007,0.06493249],"genre_scores_gemma":[0.9157748,0.0011328699,0.06504897,0.00026604132,0.0004039666,0.00022252931,0.0007666107,0.00032997376,0.016054224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967704,0.00092246244,0.000290795,0.0007443748,0.00085057964,0.0004214668],"domain_scores_gemma":[0.9877144,0.0068762144,0.0014316093,0.0011927448,0.0012487896,0.0015362441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029100704,0.0008191312,0.0010572497,0.0039954497,0.0026237047,0.0075332,0.0018791578,0.0016045719,0.006447183],"category_scores_gemma":[0.011022357,0.0011216283,0.0016604838,0.0037271848,0.0048741777,0.0143313045,0.0035744794,0.003304165,0.00077219703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023758026,0.000018187893,0.0003788319,0.000024027991,0.0000106478055,0.00012964127,0.00026093348,0.00041941824,0.00048032025,0.9960639,0.00028497138,0.0019053397],"study_design_scores_gemma":[0.000009602725,0.000011315962,0.00022904317,0.00001349313,0.000014460023,0.00015630071,0.000108034576,0.0033027101,0.00062972365,0.9934881,0.0020259887,0.0000111709405],"about_ca_topic_score_codex":0.00093700475,"about_ca_topic_score_gemma":0.00093906705,"teacher_disagreement_score":0.0075332,"about_ca_system_score_codex":0.0018055127,"about_ca_system_score_gemma":0.00084506144,"threshold_uncertainty_score":0.021568},"labels":[],"label_agreement":null},{"id":"W2076369652","doi":"10.1007/s004930100002","title":"Optimal Edge-Colourings for a Class of Planar Multigraphs","year":2001,"lang":"en","type":"article","venue":"COMBINATORICA","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":"Université du Québec à Montréal; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Multigraph; Polytope; Discrete mathematics; Planar graph; Graph","score_opus":0.02340767389095119,"score_gpt":0.28925956485033,"score_spread":0.2658518909593788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076369652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72933996,0.0017660768,0.20876472,0.0025923082,0.00021113548,0.000245766,0.0014886317,0.0011899755,0.054401472],"genre_scores_gemma":[0.8489399,0.0022510386,0.12973918,0.0005979817,0.00026097414,0.00020783074,0.0016374442,0.00054643425,0.015819173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991509,0.00013797526,0.000049037662,0.00023148459,0.0001798418,0.00025068797],"domain_scores_gemma":[0.9968966,0.0016271506,0.00039868406,0.00050207163,0.00016136507,0.00041402687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008782608,0.0011654273,0.0013634118,0.0014407617,0.0018585286,0.0035747543,0.0018394958,0.0019463763,0.0080172485],"category_scores_gemma":[0.004359775,0.0011114454,0.0010452603,0.0022490711,0.001592951,0.0038762926,0.0019531138,0.002938758,0.0006464685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011336325,0.00070442166,0.0037606955,0.0008294079,0.00016790768,0.0004567842,0.0007695348,0.08133876,0.023647605,0.6909845,0.024268502,0.17193824],"study_design_scores_gemma":[0.00023861803,0.00016489888,0.0027046034,0.00009328932,0.00013440507,0.0004575705,0.00028783735,0.09571022,0.0052604894,0.8833721,0.0115299765,0.000045983055],"about_ca_topic_score_codex":0.0011906532,"about_ca_topic_score_gemma":0.0025594754,"teacher_disagreement_score":0.0080172485,"about_ca_system_score_codex":0.0020697825,"about_ca_system_score_gemma":0.00095743214,"threshold_uncertainty_score":0.026820362},"labels":[],"label_agreement":null},{"id":"W2077882202","doi":"10.1007/s00493-014-2862-4","title":"The edge density of critical digraphs","year":2014,"lang":"ceb","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"Combinatorics; Mathematics; Digraph; Critical graph; Graph; Corollary; Discrete mathematics; Graph power; Line graph","score_opus":0.01392579734803384,"score_gpt":0.2806488513578588,"score_spread":0.26672305400982493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077882202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8387796,0.0022605218,0.10187229,0.002491376,0.00009618378,0.00004458596,0.00043194892,0.00024527893,0.053778235],"genre_scores_gemma":[0.9883477,0.000942929,0.005887813,0.00016498391,0.00013739025,0.000056621997,0.00017637356,0.000048175007,0.004238009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937975,0.00023122404,0.00002680043,0.000097106255,0.00016959081,0.000095406765],"domain_scores_gemma":[0.98751897,0.009246206,0.0008045966,0.00051086623,0.0007612495,0.0011580414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013209507,0.0004850446,0.0009880131,0.0051820423,0.0018915613,0.003560754,0.0016434814,0.0013684592,0.004638573],"category_scores_gemma":[0.015464155,0.0009124759,0.0003810835,0.0024760175,0.0040803775,0.006068021,0.0019639723,0.0016676014,0.00025965093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024310257,0.000017793365,0.00085760996,0.000042048647,0.0000065905624,0.00005059725,0.00022636162,0.0028375855,0.00032260097,0.99236816,0.0007905629,0.0024557794],"study_design_scores_gemma":[0.000009949446,0.0000058721394,0.00052216614,0.000024033581,0.000008886822,0.000107023174,0.00011189223,0.017023789,0.00022224263,0.9810647,0.0008897618,0.000009799979],"about_ca_topic_score_codex":0.0019155198,"about_ca_topic_score_gemma":0.0017031506,"teacher_disagreement_score":0.0051820423,"about_ca_system_score_codex":0.0018063043,"about_ca_system_score_gemma":0.0005508746,"threshold_uncertainty_score":0.015517592},"labels":[],"label_agreement":null},{"id":"W2082374751","doi":"10.1007/s00493-011-2595-6","title":"Linear algebra methods for forbidden configurations","year":2011,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; TRACE (psycholinguistics); Matrix (chemical analysis); Context (archaeology); Permutation (music); Row; Simple (philosophy); Concatenation (mathematics); Physics","score_opus":0.04519378722971197,"score_gpt":0.29338629396375326,"score_spread":0.2481925067340413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082374751","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010513316,0.0011993857,0.9434161,0.00083755126,0.00022382176,0.00003668321,0.0001794244,0.00026617286,0.043327514],"genre_scores_gemma":[0.46158704,0.0043614614,0.4478508,0.001328591,0.0018265271,0.0005766306,0.0011298569,0.0010401581,0.08029894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985147,0.0006973205,0.000067206274,0.00021976633,0.000381043,0.00011994373],"domain_scores_gemma":[0.99650514,0.00234881,0.00018492906,0.0004331015,0.00041759346,0.00011048581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016505773,0.0013259321,0.0013330951,0.0036150462,0.0017742114,0.0034612927,0.0024215933,0.001083836,0.019153353],"category_scores_gemma":[0.005381713,0.0008272451,0.0018152213,0.00343577,0.0035715948,0.005851414,0.0023383964,0.005350722,0.0033014729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008763211,0.00001995878,0.000050997547,0.000047904294,0.000009811327,0.000019032546,0.000085615626,0.0030577995,0.00019717986,0.98638064,0.0015086367,0.008613564],"study_design_scores_gemma":[0.000004395776,0.0000030841143,0.00001617371,0.000010539218,0.000004258311,0.00001439763,0.000020992287,0.011896208,0.0001285009,0.98590696,0.001988005,0.0000064599253],"about_ca_topic_score_codex":0.001846082,"about_ca_topic_score_gemma":0.0028421273,"teacher_disagreement_score":0.019153353,"about_ca_system_score_codex":0.0017589679,"about_ca_system_score_gemma":0.000920571,"threshold_uncertainty_score":0.06407434},"labels":[],"label_agreement":null},{"id":"W2087219950","doi":"10.1007/s004930200002","title":"Homomorphisms of Products of Graphs into Graphs Without Four Cycles","year":2002,"lang":"en","type":"article","venue":"COMBINATORICA","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 Calgary","funders":"","keywords":"Mathematics; Combinatorics; Homomorphism; Indifference graph; Chordal graph; Graph product; Discrete mathematics; 1-planar graph; Graph","score_opus":0.034409806586687866,"score_gpt":0.2682679763669812,"score_spread":0.23385816978029333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087219950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6674883,0.0007472807,0.23937486,0.0006551742,0.00039400044,0.0002441938,0.00039958928,0.0019330082,0.08876359],"genre_scores_gemma":[0.90364444,0.0006852063,0.06497025,0.00034498563,0.00016413146,0.0002146813,0.0004316657,0.00062508456,0.028919464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910396,0.00023995819,0.000068945425,0.00026061974,0.0001449284,0.0001814792],"domain_scores_gemma":[0.997598,0.0010098611,0.0003104094,0.00035588496,0.00024925428,0.0004766256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007730176,0.0006555061,0.00038417688,0.0014070803,0.001120736,0.0023602704,0.0009948574,0.00063430436,0.0078424355],"category_scores_gemma":[0.0026549553,0.0007824834,0.0011776546,0.00091593264,0.0018116023,0.0046655275,0.0027119634,0.0015844045,0.0015248234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024246474,0.00015821676,0.0012806852,0.00015736984,0.000036330035,0.00050386635,0.002245695,0.001066729,0.009736883,0.9455957,0.0025770739,0.036398895],"study_design_scores_gemma":[0.00006476226,0.00017187437,0.0013795245,0.000051471176,0.000079448335,0.0009913294,0.00088684965,0.004415331,0.012385871,0.95645916,0.023060871,0.000053558422],"about_ca_topic_score_codex":0.0005164785,"about_ca_topic_score_gemma":0.0004408968,"teacher_disagreement_score":0.0078424355,"about_ca_system_score_codex":0.00065764145,"about_ca_system_score_gemma":0.00048432645,"threshold_uncertainty_score":0.02623552},"labels":[],"label_agreement":null},{"id":"W2090968858","doi":"10.1007/s00493-014-3035-1","title":"On the monotonicity of a data stream","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Subsequence; Combinatorics; Omega; Upper and lower bounds; Monotonic function; Alphabet; Space (punctuation); Binary logarithm; Discrete mathematics; Mathematical analysis","score_opus":0.04818908662102291,"score_gpt":0.26956434263017376,"score_spread":0.22137525600915084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090968858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17726533,0.0018214404,0.768139,0.011667212,0.00031305218,0.00017064804,0.0014134684,0.0008242566,0.038385652],"genre_scores_gemma":[0.75893563,0.0026873301,0.21903855,0.0018967971,0.0010909016,0.00033614555,0.0015021298,0.0007248007,0.013787678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99528176,0.0015552321,0.00044014002,0.00087849627,0.0013404662,0.00050383055],"domain_scores_gemma":[0.92432207,0.057795472,0.0028438813,0.0074635106,0.0057050786,0.0018700678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055063306,0.00078679953,0.0015799971,0.003031381,0.00238876,0.005111076,0.002587593,0.0018848493,0.008359399],"category_scores_gemma":[0.05124144,0.0010637454,0.001579379,0.0040310286,0.005572799,0.02652438,0.0043449122,0.0052917902,0.0010663967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029433792,0.00009791743,0.0026686804,0.0002156213,0.000030808264,0.00019359494,0.00055320736,0.010192391,0.0022371358,0.94497347,0.0044352775,0.034107488],"study_design_scores_gemma":[0.000036977504,0.000047161087,0.00058544334,0.000058658843,0.000035477253,0.00029930891,0.00014823154,0.08645578,0.0019571548,0.9053182,0.005030032,0.000027572643],"about_ca_topic_score_codex":0.0033708133,"about_ca_topic_score_gemma":0.0019891758,"teacher_disagreement_score":0.008359399,"about_ca_system_score_codex":0.0023003148,"about_ca_system_score_gemma":0.0022002575,"threshold_uncertainty_score":0.029120624},"labels":[],"label_agreement":null},{"id":"W2094094736","doi":"10.1007/s004930200025","title":"The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four","year":2002,"lang":"en","type":"article","venue":"COMBINATORICA","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":"Burnaby Hospital; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.038923521854735244,"score_gpt":0.27472123876878557,"score_spread":0.23579771691405033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094094736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87272495,0.0006156513,0.048274484,0.0017265604,0.00039319458,0.000100347745,0.00081584125,0.0008885186,0.07446046],"genre_scores_gemma":[0.95611674,0.000400536,0.027635107,0.00036588343,0.00012521089,0.00014565501,0.0013649031,0.00011514954,0.013730839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994481,0.00006271755,0.00003664494,0.00015259933,0.000094729476,0.00020516553],"domain_scores_gemma":[0.99726474,0.0012748062,0.0003889568,0.00031896553,0.00023047255,0.0005220481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004904825,0.0005988012,0.0006352136,0.0010371187,0.0020341314,0.0018827862,0.001032203,0.0015693174,0.01143818],"category_scores_gemma":[0.0022130883,0.00038543256,0.00050424534,0.00086984184,0.0014937879,0.0037504362,0.0010513965,0.0011531942,0.0016744592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004893563,0.000851583,0.01837432,0.0011966705,0.00015210663,0.0015590811,0.000971627,0.01986709,0.14104334,0.5691926,0.024837632,0.2170604],"study_design_scores_gemma":[0.0005313956,0.0010254172,0.020860087,0.00022894873,0.00027966575,0.0033872626,0.0011389864,0.05361933,0.14359711,0.67444795,0.100562066,0.0003218798],"about_ca_topic_score_codex":0.000684053,"about_ca_topic_score_gemma":0.000748845,"teacher_disagreement_score":0.01143818,"about_ca_system_score_codex":0.0008322004,"about_ca_system_score_gemma":0.000952288,"threshold_uncertainty_score":0.038264573},"labels":[],"label_agreement":null},{"id":"W2099528956","doi":"10.1007/s00493-006-0024-z","title":"Independent Sets In Association Schemes","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph theory and applications","field":"Mathematics","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":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Eigenvalues and eigenvectors; Adjacency matrix; Corollary; Graph; Upper and lower bounds; Discrete mathematics; Mathematical analysis","score_opus":0.017459315025400254,"score_gpt":0.28325560825745477,"score_spread":0.2657962932320545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099528956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2870855,0.0028388174,0.4859536,0.0051988093,0.00066288165,0.00021645906,0.0010668061,0.00059937785,0.21637774],"genre_scores_gemma":[0.86514646,0.002146714,0.0661015,0.00077042135,0.0008786225,0.0003650247,0.000943189,0.00024467506,0.063403405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708325,0.0008904711,0.00018731106,0.00069017237,0.0007914427,0.0003572381],"domain_scores_gemma":[0.9917973,0.0048856135,0.0006990607,0.0012992066,0.0005924065,0.00072626816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022404438,0.0009988234,0.0018626224,0.004848312,0.005918861,0.009210949,0.0024722351,0.002472029,0.013346882],"category_scores_gemma":[0.0075175087,0.0020308963,0.0016798322,0.009120577,0.0068771276,0.0155267725,0.0064547323,0.008111654,0.0022596645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000098353285,0.000009081812,0.00009056786,0.000013004469,0.0000031159332,0.000017645274,0.00019844667,0.00020730024,0.000069504655,0.99662685,0.00039871395,0.002355879],"study_design_scores_gemma":[0.000006087976,0.000003273329,0.00008005444,0.0000088059505,0.00001002752,0.000053499727,0.0000644604,0.0008268994,0.000104387866,0.99593663,0.0028997613,0.000006003699],"about_ca_topic_score_codex":0.0012109078,"about_ca_topic_score_gemma":0.0010341116,"teacher_disagreement_score":0.013346882,"about_ca_system_score_codex":0.0025663967,"about_ca_system_score_gemma":0.0011376977,"threshold_uncertainty_score":0.04464978},"labels":[],"label_agreement":null},{"id":"W2102229938","doi":"10.1007/s00493-016-3441-7","title":"Point-Curve Incidences in the Complex Plane","year":2017,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Hypersurface; Lemma (botany); Algebraic curve; Combinatorics; Plane curve; Algebraic geometry; Algebraic number; Differential geometry; Plane (geometry); Incidence (geometry); Complex plane; Geometry; Discrete mathematics; Mathematical analysis","score_opus":0.047440835050536416,"score_gpt":0.2976345836036157,"score_spread":0.2501937485530793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102229938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42134935,0.00040096417,0.47305188,0.00072278146,0.00018064557,0.00012956547,0.00048225358,0.00057901535,0.10310352],"genre_scores_gemma":[0.912408,0.00062965206,0.06219517,0.00008443706,0.00009282303,0.000057419526,0.0004316913,0.0003666663,0.023734119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992512,0.00010813468,0.000037719157,0.000100092955,0.00038975384,0.000113014634],"domain_scores_gemma":[0.9985257,0.00060217327,0.00019464343,0.00017555397,0.00033600497,0.00016601867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005757948,0.0006171751,0.00064033834,0.0032902637,0.0012541346,0.0036698978,0.0009622675,0.001187966,0.010812633],"category_scores_gemma":[0.0044132317,0.0005113658,0.0005056956,0.0023330739,0.0019026651,0.0024564269,0.0022587413,0.002130422,0.0022000493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094425086,0.000067262175,0.0020877619,0.000054785032,0.000009456887,0.00030338802,0.0003941046,0.02408098,0.0031915307,0.9245104,0.002644149,0.042561825],"study_design_scores_gemma":[0.000034079385,0.00004520153,0.0011036026,0.000048355436,0.000012568818,0.0005613736,0.0005031484,0.14375725,0.0052295416,0.83487,0.013803121,0.000031795276],"about_ca_topic_score_codex":0.0013692225,"about_ca_topic_score_gemma":0.0011345412,"teacher_disagreement_score":0.010812633,"about_ca_system_score_codex":0.0011356787,"about_ca_system_score_gemma":0.000499297,"threshold_uncertainty_score":0.036171913},"labels":[],"label_agreement":null},{"id":"W2103315245","doi":"10.1007/s00493-014-2952-3","title":"An analogue of the Erdős-Stone theorem for finite geometries","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Integer (computer science); Rank (graph theory); Equivalence (formal languages); Discrete mathematics","score_opus":0.02408680668586328,"score_gpt":0.28996538134667854,"score_spread":0.26587857466081527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103315245","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11194803,0.0050217444,0.4144986,0.011912563,0.001388954,0.00008797618,0.0008997054,0.00045550516,0.45378697],"genre_scores_gemma":[0.86099803,0.004996226,0.068159215,0.0031343834,0.0023364297,0.00018899486,0.0006554072,0.0003279048,0.05920336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847716,0.00043735758,0.00009539207,0.0003978409,0.00042954014,0.00016274782],"domain_scores_gemma":[0.99691296,0.0015892897,0.0002732303,0.000535188,0.00044524146,0.00024400791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018657331,0.00082794076,0.0014632201,0.0027343286,0.0021793055,0.0039740587,0.0016874068,0.0021128915,0.011184705],"category_scores_gemma":[0.0062053753,0.0005625289,0.0014372113,0.0026224959,0.0062244325,0.014797838,0.0046423306,0.004459933,0.0013331217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037980437,0.0000031492175,0.000034156717,0.000015390795,0.0000022959864,0.000016622764,0.000060668524,0.00013779948,0.00008864353,0.9980825,0.00047690282,0.0010781192],"study_design_scores_gemma":[0.000004455716,0.0000031326297,0.00004884841,0.0000056578183,0.0000024809685,0.000041718275,0.00002608906,0.00043218443,0.000072954805,0.99653155,0.0028269056,0.0000040520417],"about_ca_topic_score_codex":0.0011582832,"about_ca_topic_score_gemma":0.0008146344,"teacher_disagreement_score":0.011184705,"about_ca_system_score_codex":0.0015883106,"about_ca_system_score_gemma":0.0005781298,"threshold_uncertainty_score":0.037416518},"labels":[],"label_agreement":null},{"id":"W2105506385","doi":"10.1007/s00493-014-3079-2","title":"Embedding a graph-like continuum in a surface","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Voltage graph; Symmetric graph; Embedding; Discrete mathematics; Graph; Line graph; Computer science","score_opus":0.009086792051369086,"score_gpt":0.240379365254211,"score_spread":0.2312925732028419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105506385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22427808,0.00017012517,0.7416395,0.000969742,0.00025821404,0.00008779988,0.00025155293,0.0009887563,0.0313562],"genre_scores_gemma":[0.74770796,0.00023578265,0.22917564,0.00020065745,0.00007721595,0.00007067721,0.00024969366,0.0004628788,0.02181961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997582,0.000043071617,0.000011172177,0.0000676703,0.000088213616,0.000031697477],"domain_scores_gemma":[0.9996201,0.0001312946,0.00003988621,0.00007858852,0.000051934727,0.00007808827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022595449,0.00046600352,0.00044612418,0.001138089,0.0007726416,0.0018262237,0.00093702576,0.00137732,0.0066393265],"category_scores_gemma":[0.001143863,0.00044730818,0.0004865454,0.00067601644,0.001488585,0.001974477,0.002385267,0.0014019088,0.0015581532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001438943,0.00013991675,0.0010997751,0.0002127685,0.000029598788,0.0007969237,0.000644864,0.08456756,0.03392084,0.8285401,0.0046210224,0.04528265],"study_design_scores_gemma":[0.0000457504,0.00010800534,0.00052091,0.00005978682,0.000018841252,0.0005643279,0.0005232352,0.3350363,0.0069521437,0.6371812,0.018955352,0.00003415695],"about_ca_topic_score_codex":0.00057032035,"about_ca_topic_score_gemma":0.0007703978,"teacher_disagreement_score":0.0066393265,"about_ca_system_score_codex":0.00050586264,"about_ca_system_score_gemma":0.00028953218,"threshold_uncertainty_score":0.022210777},"labels":[],"label_agreement":null},{"id":"W2111430057","doi":"10.1007/s00493-005-0036-0","title":"Proof Of A Conjecture Of Erdős On Triangles In Set-Systems","year":2005,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Microsoft Research","keywords":"Conjecture; Combinatorics; Mathematics; Element (criminal law); Set (abstract data type); Discrete mathematics; Law; Computer science","score_opus":0.03945362164017345,"score_gpt":0.30515233261533936,"score_spread":0.2656987109751659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111430057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18756396,0.005468882,0.3854342,0.112108484,0.006840286,0.00030425066,0.0024713017,0.0019713913,0.29783717],"genre_scores_gemma":[0.85671973,0.0035168957,0.0924035,0.00831488,0.0039032986,0.00039638724,0.0015143387,0.00059589784,0.03263514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786985,0.00062624266,0.000113967355,0.00046904307,0.00066039595,0.00026049474],"domain_scores_gemma":[0.98112273,0.01378474,0.0006755914,0.0017750313,0.0015877989,0.0010541654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033293748,0.0015312735,0.0019001359,0.0024358346,0.0026603015,0.003309425,0.0027472144,0.002550409,0.023054196],"category_scores_gemma":[0.020597955,0.0010978669,0.0024507397,0.0029026568,0.0077174455,0.0130881425,0.009108966,0.009691969,0.0021137965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097374366,0.000072609546,0.00047954902,0.00021913246,0.000032189888,0.00019319459,0.0005609462,0.0016480788,0.0007474397,0.9751769,0.013539622,0.0072329855],"study_design_scores_gemma":[0.00005073967,0.000024301597,0.00026229085,0.00004092493,0.00002390253,0.00011384777,0.000113236616,0.0038627114,0.00031415225,0.98590964,0.009267585,0.00001670667],"about_ca_topic_score_codex":0.0028072686,"about_ca_topic_score_gemma":0.0020206296,"teacher_disagreement_score":0.023054196,"about_ca_system_score_codex":0.0026293995,"about_ca_system_score_gemma":0.0011680245,"threshold_uncertainty_score":0.07712394},"labels":[],"label_agreement":null},{"id":"W2115859130","doi":"10.1007/s00493-005-0010-x","title":"List Colouring When The Chromatic Number Is Close To the Order Of The Graph","year":2004,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","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":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Conjecture; Graph; Order (exchange); Discrete mathematics","score_opus":0.005272078131285529,"score_gpt":0.19078437274404528,"score_spread":0.18551229461275975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115859130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68076867,0.00056961935,0.21856862,0.0036717986,0.0007101122,0.00024231733,0.00091525423,0.0038205853,0.09073301],"genre_scores_gemma":[0.93700445,0.0003465589,0.0383498,0.00048040977,0.00013787909,0.000094367984,0.0006311469,0.00041906163,0.022536425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927086,0.000107122185,0.000034850025,0.0001395101,0.00011481983,0.00033272605],"domain_scores_gemma":[0.9933074,0.0036675096,0.00041747966,0.0011613264,0.0006526431,0.0007936109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005396437,0.00045987914,0.0006586039,0.001296321,0.001905011,0.0031415455,0.0010819832,0.0018464609,0.016995711],"category_scores_gemma":[0.0065529714,0.00036582464,0.0004194953,0.001277817,0.0014276331,0.0037757417,0.0014433517,0.001424296,0.0016208182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0043511847,0.00059920526,0.012118605,0.0009002019,0.00008886758,0.0032491765,0.0016310255,0.051991053,0.11464157,0.594109,0.047631,0.16868915],"study_design_scores_gemma":[0.0003002033,0.00029337793,0.0037322198,0.000102540704,0.00009091831,0.0017841987,0.0009211157,0.19723625,0.06038371,0.71315944,0.021861225,0.00013478451],"about_ca_topic_score_codex":0.002699453,"about_ca_topic_score_gemma":0.004303871,"teacher_disagreement_score":0.016995711,"about_ca_system_score_codex":0.0015155199,"about_ca_system_score_gemma":0.0010376885,"threshold_uncertainty_score":0.056856275},"labels":[],"label_agreement":null},{"id":"W2122404357","doi":"10.1007/s00493-014-2806-z","title":"A minimum degree condition forcing complete graph immersion","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":61,"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; Graph; Discrete mathematics; Disjoint sets; Simple graph; Immersion (mathematics); Complement graph; Graph power; Line graph; Geometry","score_opus":0.03635824512445577,"score_gpt":0.2841506765625666,"score_spread":0.24779243143811083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122404357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33491817,0.0007871222,0.3687167,0.009550147,0.0011112362,0.00028661493,0.0022387032,0.0018368459,0.28055444],"genre_scores_gemma":[0.89772135,0.0005132464,0.051246855,0.0014279821,0.00056629063,0.00022395427,0.001469593,0.00069711695,0.046133637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842715,0.00018967949,0.00007718763,0.00052479934,0.00041984345,0.00036133328],"domain_scores_gemma":[0.9951448,0.0025459745,0.00025212226,0.00057656626,0.00066118053,0.00081942213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010567427,0.0008652572,0.0019610547,0.0014624185,0.0028527365,0.0033231226,0.0017623705,0.002834312,0.019827975],"category_scores_gemma":[0.005983338,0.001004815,0.00194569,0.0012038826,0.0031364483,0.0087978,0.0068121534,0.0070253937,0.0020520603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009624645,0.000037184247,0.00018390911,0.00009130933,0.000010348316,0.00010128337,0.00026186908,0.0016424799,0.002296034,0.9883663,0.002789904,0.004123098],"study_design_scores_gemma":[0.00003065959,0.000027171414,0.00012688464,0.0000190943,0.000011211234,0.000104768376,0.00010574507,0.0059485184,0.0010294437,0.9889048,0.0036766096,0.000015148821],"about_ca_topic_score_codex":0.0010744008,"about_ca_topic_score_gemma":0.0012008516,"teacher_disagreement_score":0.019827975,"about_ca_system_score_codex":0.0020039196,"about_ca_system_score_gemma":0.0009751362,"threshold_uncertainty_score":0.06633115},"labels":[],"label_agreement":null},{"id":"W2125752997","doi":"10.1007/s00493-009-2362-0","title":"Hamilton cycles in highly connected and expanding graphs","year":2009,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Cograph; Indifference graph; Random graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Pathwidth; Graph; Variety (cybernetics); Chordal graph; 1-planar graph; Line graph; Computer science; Artificial intelligence","score_opus":0.022547729658570406,"score_gpt":0.29615728101104155,"score_spread":0.27360955135247117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125752997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8440845,0.0022213277,0.070905544,0.0017128757,0.00010032146,0.00006999307,0.00023183771,0.00022901437,0.08044462],"genre_scores_gemma":[0.9678312,0.0010877119,0.012016101,0.00024023135,0.00017629219,0.000097046875,0.00015933858,0.000055022476,0.018337088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995678,0.0001437524,0.000019600608,0.000070134396,0.00012746194,0.00007121922],"domain_scores_gemma":[0.9967505,0.0020970812,0.00039655683,0.00017369215,0.00022949176,0.00035279137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005820872,0.0004324325,0.0005917154,0.0026185228,0.0019417411,0.0025492592,0.00095954025,0.0010455875,0.0038680346],"category_scores_gemma":[0.0043650214,0.0006410454,0.00037315403,0.0023952343,0.0034521993,0.0034291022,0.0015703741,0.0014468307,0.00026032614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016305383,0.000012262934,0.00026454302,0.0000228924,0.0000041729218,0.00010673408,0.0004604275,0.0013807222,0.00049706234,0.99334866,0.00064827665,0.0032379276],"study_design_scores_gemma":[0.000007743432,0.000003377053,0.000163889,0.000005502942,0.0000043602313,0.000056053133,0.00009623701,0.0032890248,0.00015276673,0.99517643,0.0010401659,0.000004555021],"about_ca_topic_score_codex":0.0028646241,"about_ca_topic_score_gemma":0.004866639,"teacher_disagreement_score":0.0038680346,"about_ca_system_score_codex":0.0012385891,"about_ca_system_score_gemma":0.00053924625,"threshold_uncertainty_score":0.01293987},"labels":[],"label_agreement":null},{"id":"W2136175864","doi":"10.1007/s00493-015-3070-6","title":"Nonrepetitive colouring via entropy compression","year":2015,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":61,"is_retracted":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; Vertex (graph theory); Graph; Mathematical proof; Discrete mathematics; Geometry","score_opus":0.031856152558521776,"score_gpt":0.29475177600056146,"score_spread":0.2628956234420397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136175864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09637106,0.00049728283,0.85454005,0.00111792,0.0002984968,0.00015927404,0.00044909952,0.0021865198,0.0443802],"genre_scores_gemma":[0.724861,0.00043343092,0.2455568,0.0006540627,0.00036012995,0.00021862701,0.0006753229,0.0009987518,0.026241735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847764,0.0004337244,0.000069410096,0.00031643698,0.00049204094,0.00021069721],"domain_scores_gemma":[0.9931666,0.0035257917,0.00024966485,0.0024641228,0.00038668167,0.00020712042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096517365,0.0006934918,0.0009933482,0.0014343618,0.0011639157,0.0016859326,0.0020559065,0.0014549702,0.010642354],"category_scores_gemma":[0.0069289193,0.0005980389,0.00079730636,0.0018418332,0.0022821417,0.003987113,0.003347465,0.0024004346,0.0018457349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031459265,0.000173073,0.0005078246,0.00018626532,0.000043451142,0.00027195687,0.0003555109,0.055794373,0.012241101,0.75232536,0.0084017515,0.16938485],"study_design_scores_gemma":[0.000029315002,0.000034252513,0.00016330303,0.00002811217,0.000021722137,0.00012934138,0.00003248296,0.16810407,0.0064864643,0.8213948,0.0035522373,0.000023909372],"about_ca_topic_score_codex":0.00068063673,"about_ca_topic_score_gemma":0.0013187672,"teacher_disagreement_score":0.010642354,"about_ca_system_score_codex":0.0010004129,"about_ca_system_score_gemma":0.00087745703,"threshold_uncertainty_score":0.035602212},"labels":[],"label_agreement":null},{"id":"W2139177710","doi":"10.1007/s00493-015-2662-5","title":"Counting flags in triangle-free digraphs","year":2016,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Univerzita Karlova v Praze; National Science Foundation","keywords":"Digraph; Flag (linear algebra); FLAGS register; Upper and lower bounds; Backslash","score_opus":0.02876470606477036,"score_gpt":0.2769097246493653,"score_spread":0.24814501858459495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139177710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66216326,0.0009775666,0.27056757,0.0013527843,0.00020036596,0.00007011287,0.00045609544,0.0005864144,0.06362589],"genre_scores_gemma":[0.9519148,0.000601248,0.03198515,0.00022997361,0.00011683395,0.00008358694,0.00043366876,0.00013307668,0.0145016955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988813,0.0002876688,0.00009343319,0.00020212602,0.00030010575,0.00023540884],"domain_scores_gemma":[0.9918609,0.0049502784,0.0007765321,0.00054528523,0.00078421534,0.0010828996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015534925,0.00064586254,0.0009880963,0.005026816,0.0027187916,0.0048205927,0.0022687973,0.0017810651,0.007147362],"category_scores_gemma":[0.011087693,0.00088146375,0.0007246976,0.0042637093,0.0033983043,0.009024662,0.0027608187,0.002095166,0.00059171655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032892392,0.00002735687,0.00078274513,0.000060437877,0.000004754555,0.000092163085,0.0005111007,0.0011923201,0.00055678276,0.98904306,0.0009327505,0.0067635756],"study_design_scores_gemma":[0.000010584411,0.000008967441,0.00024225895,0.000025058762,0.000009168488,0.00010309483,0.00017527075,0.009215084,0.00040972998,0.9883336,0.0014566995,0.0000105512245],"about_ca_topic_score_codex":0.003970587,"about_ca_topic_score_gemma":0.005813116,"teacher_disagreement_score":0.007147362,"about_ca_system_score_codex":0.002293888,"about_ca_system_score_gemma":0.00077206834,"threshold_uncertainty_score":0.023910344},"labels":[],"label_agreement":null},{"id":"W2159330890","doi":"10.1007/s00493-006-0030-1","title":"Packing Non-Zero A-Paths In Group-Labelled Graphs","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":70,"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; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Vertex (graph theory); Abelian group; Zero (linguistics); Induced path; Integer (computer science); Path (computing); Graph; Matching (statistics); Discrete mathematics; Group (periodic table); Longest path problem; Shortest path problem","score_opus":0.0036333433700278684,"score_gpt":0.17088307904416922,"score_spread":0.16724973567414134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159330890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8255804,0.0003440205,0.13782941,0.00084394414,0.00018256238,0.000082967905,0.00031228305,0.0005418167,0.034282673],"genre_scores_gemma":[0.9490333,0.00027671762,0.04052024,0.00020111506,0.00006580334,0.00008419185,0.00030460194,0.00013585952,0.009378044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896634,0.00033636295,0.000065224405,0.00018519232,0.00018852174,0.00025828165],"domain_scores_gemma":[0.9932088,0.004034301,0.0009590647,0.00069672306,0.0002921071,0.0008089917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069769396,0.00069372373,0.0008223163,0.0024020337,0.0030987407,0.0039334414,0.0013064052,0.0024670204,0.0076921848],"category_scores_gemma":[0.0049227956,0.0009756641,0.0006505226,0.0028059965,0.0031169741,0.004368859,0.0025539498,0.002022212,0.00092675735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041571216,0.00020060444,0.0018999685,0.00018139665,0.000034884666,0.0007204167,0.0012232363,0.014059407,0.0095725525,0.94658405,0.002876952,0.022230832],"study_design_scores_gemma":[0.000042417487,0.00005343517,0.00052588625,0.000043294127,0.000017390696,0.00024858065,0.00040046978,0.02783982,0.0027388856,0.9663191,0.0017509485,0.000019835508],"about_ca_topic_score_codex":0.0013607868,"about_ca_topic_score_gemma":0.0022838318,"teacher_disagreement_score":0.0076921848,"about_ca_system_score_codex":0.0012276097,"about_ca_system_score_gemma":0.0008303251,"threshold_uncertainty_score":0.025732934},"labels":[],"label_agreement":null},{"id":"W2166183308","doi":"10.1007/s00493-013-2649-z","title":"Chromatic number and complete graph substructures for degree sequences","year":2013,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Topological and Geometric Data Analysis","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Degree (music); Conjecture; Disjoint sets; Upper and lower bounds; Clique number; Subdivision; Clique; Chromatic scale; Discrete mathematics","score_opus":0.033176896259429364,"score_gpt":0.2485224778428964,"score_spread":0.21534558158346706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166183308","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8804739,0.00041623035,0.09550742,0.00074404484,0.00004368682,0.00006551792,0.0011847059,0.0002657193,0.021298816],"genre_scores_gemma":[0.96930987,0.00035648726,0.021866059,0.00009916832,0.00008601172,0.00007676388,0.0011440058,0.00011054376,0.006951235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908996,0.00012267046,0.000056726443,0.00036177336,0.00022908945,0.00013991902],"domain_scores_gemma":[0.9908354,0.005140197,0.001196298,0.0013474921,0.0005877025,0.0008927869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095797953,0.0004886206,0.00070261955,0.0041162674,0.0023496868,0.00357569,0.0015481942,0.0009858669,0.008156187],"category_scores_gemma":[0.008178436,0.0005651865,0.000693172,0.0040261154,0.0032994086,0.006065132,0.0016183772,0.0019330296,0.00058302697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030201316,0.00011981012,0.011991964,0.00013707548,0.000028641614,0.00018366374,0.0012665186,0.01590773,0.0060560764,0.93446976,0.0024004441,0.02713615],"study_design_scores_gemma":[0.000031734948,0.000047084242,0.0051791505,0.00004485429,0.000049779646,0.00035988764,0.00046585797,0.047970194,0.0041976953,0.9372219,0.0043938262,0.000038163373],"about_ca_topic_score_codex":0.0021699467,"about_ca_topic_score_gemma":0.0035784845,"teacher_disagreement_score":0.008156187,"about_ca_system_score_codex":0.002271988,"about_ca_system_score_gemma":0.0009024707,"threshold_uncertainty_score":0.027285159},"labels":[],"label_agreement":null},{"id":"W2285618017","doi":"10.1007/s00493-016-3594-4","title":"On the Number of Bases of Almost All Matroids","year":2018,"lang":"en","type":"preprint","venue":"COMBINATORICA","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":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Matroid; Combinatorics; Mathematics; Graphic matroid; Cardinality (data modeling); Omega; Discrete mathematics; Embedding; Physics","score_opus":0.03759325496127142,"score_gpt":0.33073093295384776,"score_spread":0.29313767799257634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2285618017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7654239,0.0023866699,0.12309206,0.011196368,0.00062072184,0.00009387707,0.0029506395,0.00054669305,0.09368901],"genre_scores_gemma":[0.94938016,0.0009605989,0.029248541,0.0007715457,0.000961681,0.00018522484,0.0020858452,0.00033472653,0.0160718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663454,0.0010869901,0.00015667062,0.0007746167,0.00076907256,0.0005781617],"domain_scores_gemma":[0.9768747,0.014986245,0.0016760173,0.002119428,0.0014128173,0.0029307927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002714131,0.0013806104,0.0020191784,0.002823852,0.0031229714,0.008295571,0.004050156,0.0026448069,0.018083965],"category_scores_gemma":[0.01686594,0.0012910652,0.0012414703,0.0028733995,0.0050593717,0.011652148,0.0038924983,0.0055389823,0.0016615409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006113117,0.00013631703,0.0035743106,0.00022221492,0.00009265019,0.000106642765,0.0003840125,0.008997941,0.0025871797,0.9545551,0.008494543,0.02023786],"study_design_scores_gemma":[0.000055119875,0.000034685087,0.00076004013,0.0000344325,0.000040506526,0.00016185438,0.00013780345,0.017181013,0.00070064235,0.97837585,0.002499318,0.000018748391],"about_ca_topic_score_codex":0.00094801997,"about_ca_topic_score_gemma":0.0012654623,"teacher_disagreement_score":0.018083965,"about_ca_system_score_codex":0.002290685,"about_ca_system_score_gemma":0.001187268,"threshold_uncertainty_score":0.060496867},"labels":[],"label_agreement":null},{"id":"W2520939841","doi":"10.1007/s00493-019-3817-6","title":"Geometry of Permutation Limits","year":2019,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Permutation (music); Limit (mathematics); Sorting; Random permutation; Path (computing); Identity (music); Sorting network","score_opus":0.032677817526748226,"score_gpt":0.30995440405192604,"score_spread":0.27727658652517784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520939841","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27284327,0.005581129,0.25816473,0.009304107,0.00075562485,0.0000679019,0.0010155784,0.0003961372,0.4518715],"genre_scores_gemma":[0.9234825,0.0021045727,0.017370459,0.0007268553,0.000985167,0.0001076165,0.0005317014,0.00014783998,0.05454335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903405,0.00029984154,0.000044818255,0.00021659065,0.00029914576,0.00010556258],"domain_scores_gemma":[0.99884063,0.00047135717,0.00014654348,0.00014046227,0.00020891248,0.00019197965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009122347,0.00073559384,0.00078539003,0.002235629,0.0020241453,0.004642928,0.001016769,0.0010808567,0.009646176],"category_scores_gemma":[0.0027324776,0.00047651157,0.00073630543,0.0015960033,0.0041619437,0.005519226,0.0024221498,0.0025257186,0.0013132885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024285996,0.0000021566038,0.000026531956,0.000004144043,0.0000013346545,0.000009914153,0.00003056204,0.0001235535,0.000052771436,0.9989956,0.00022574281,0.0005252614],"study_design_scores_gemma":[0.0000026914952,0.0000032848384,0.00006442301,0.0000023133248,0.0000017493244,0.00003124758,0.000017913815,0.0007287389,0.000057319612,0.9970585,0.0020291095,0.0000026342416],"about_ca_topic_score_codex":0.0018385953,"about_ca_topic_score_gemma":0.0008560234,"teacher_disagreement_score":0.009646176,"about_ca_system_score_codex":0.0019805215,"about_ca_system_score_gemma":0.0009121825,"threshold_uncertainty_score":0.032269657},"labels":[],"label_agreement":null},{"id":"W2743168372","doi":"10.1007/s00493-019-3848-z","title":"Clustered Colouring in Minor-Closed Classes","year":2019,"lang":"en","type":"article","venue":"COMBINATORICA","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":"","keywords":"Monochromatic color; Conjecture; Chromatic scale; Graph; Windmill graph; Friendship graph; Integer (computer science); Graph coloring","score_opus":0.014357102561388977,"score_gpt":0.268063887531273,"score_spread":0.253706784969884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743168372","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6684651,0.0004189053,0.2655563,0.0014320394,0.00024024276,0.00015594135,0.0006853154,0.0008648488,0.062181246],"genre_scores_gemma":[0.92437744,0.00024552975,0.04855545,0.00033019163,0.00020732345,0.00010858264,0.00074872345,0.00041788645,0.025008962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986608,0.00021916364,0.00005609987,0.0005294909,0.00026160027,0.00027294067],"domain_scores_gemma":[0.9944864,0.0023219949,0.0005478419,0.0009423228,0.0006873059,0.001014138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006586494,0.00051450473,0.0012991943,0.0017875369,0.0029427805,0.00416262,0.0022712746,0.0015594392,0.012936867],"category_scores_gemma":[0.0047009303,0.0008416008,0.0012535594,0.0023089973,0.0030897832,0.00419627,0.0025298633,0.0026324838,0.001283262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012434686,0.00006459396,0.0011784994,0.00007239708,0.000016839547,0.00012784934,0.00076329656,0.0022944026,0.003231436,0.97743964,0.0029989807,0.011687791],"study_design_scores_gemma":[0.000036581554,0.000021669824,0.0008894389,0.000017745444,0.000020234975,0.00020706312,0.0002065925,0.0098826075,0.001223921,0.9821988,0.005280621,0.000014859799],"about_ca_topic_score_codex":0.002942807,"about_ca_topic_score_gemma":0.0034939095,"teacher_disagreement_score":0.012936867,"about_ca_system_score_codex":0.0022760243,"about_ca_system_score_gemma":0.000703322,"threshold_uncertainty_score":0.043278098},"labels":[],"label_agreement":null},{"id":"W2751713657","doi":"10.1007/s00493-019-3856-z","title":"The Extremal Function for Bipartite Linklessly Embeddable Graphs","year":2019,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Structural Analysis and Optimization","field":"Engineering","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":"Bipartite graph; Disjoint sets; Edge-transitive graph; Complete bipartite graph; Graph; Embedding; Pancyclic graph; Cograph","score_opus":0.00429969646013545,"score_gpt":0.17865703529762733,"score_spread":0.17435733883749188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751713657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59911877,0.0016655443,0.3275755,0.002495089,0.0001883206,0.000049056423,0.0004308959,0.00040344073,0.06807343],"genre_scores_gemma":[0.9661167,0.0009135618,0.018128742,0.00024132802,0.00023717139,0.00008132057,0.00032963394,0.00017836003,0.01377324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994822,0.00022698252,0.000012491434,0.000077978235,0.000101712685,0.000098628734],"domain_scores_gemma":[0.9967534,0.0020792158,0.00040211278,0.00019958775,0.00017806095,0.0003876193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010631628,0.0011818486,0.00091654557,0.002535501,0.0010002013,0.0023135946,0.0016646436,0.0019741266,0.005494619],"category_scores_gemma":[0.007237617,0.0006446123,0.000529694,0.0011198405,0.0023772381,0.0034233676,0.001626882,0.0021857428,0.00062971574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015922824,0.00006833251,0.00063386385,0.00012757978,0.000028086242,0.000092462964,0.00014312369,0.031139735,0.0025290893,0.9500921,0.0035580962,0.011428416],"study_design_scores_gemma":[0.000017945114,0.000025775817,0.00058710267,0.000035498444,0.000013853085,0.00008651815,0.00006691204,0.1324599,0.0009025566,0.8646125,0.0011710516,0.000020490019],"about_ca_topic_score_codex":0.0006985475,"about_ca_topic_score_gemma":0.00082488684,"teacher_disagreement_score":0.005494619,"about_ca_system_score_codex":0.0012185664,"about_ca_system_score_gemma":0.00042878627,"threshold_uncertainty_score":0.018381357},"labels":[],"label_agreement":null},{"id":"W2766828223","doi":"10.1007/s00493-019-3897-3","title":"The Satisfiability Threshold For Random Linear Equations","year":2020,"lang":"en","type":"preprint","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","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":"Finite field; Mathematics; Satisfiability; Random matrix; Combinatorics; Discrete mathematics; Matrix (chemical analysis); Field (mathematics); Zero (linguistics); Multivariate random variable; Combinatorial proof; Random variable; Pure mathematics; Physics; Quantum mechanics; Statistics","score_opus":0.06303154819406136,"score_gpt":0.3012957554934848,"score_spread":0.23826420729942344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766828223","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5232738,0.0033888223,0.38791224,0.021122009,0.0003944329,0.00016796737,0.0019284297,0.0017026034,0.06010976],"genre_scores_gemma":[0.97508574,0.0006486467,0.016717343,0.0008135184,0.00041792038,0.00014249419,0.00055265805,0.00025414623,0.00536754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99454224,0.0016991065,0.00032111007,0.0013477852,0.0012880443,0.0008017534],"domain_scores_gemma":[0.8698949,0.112740226,0.004419772,0.0073322933,0.0027730763,0.0028397534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051215566,0.00058525876,0.0025102657,0.0029070433,0.0018708861,0.0074770553,0.0021945825,0.0030200707,0.008819926],"category_scores_gemma":[0.071084976,0.0013945006,0.0011668642,0.0017976938,0.005360379,0.015469326,0.003140557,0.006474403,0.00070435996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024108491,0.000091932896,0.0027895377,0.00023331033,0.000048915048,0.00011153858,0.0003688671,0.016603818,0.0022368259,0.95781446,0.0061355648,0.013324212],"study_design_scores_gemma":[0.00002741653,0.000014701318,0.0006099832,0.000033947526,0.000018032333,0.000083709885,0.000064512,0.084451504,0.0010777549,0.91278446,0.00081338664,0.000020670073],"about_ca_topic_score_codex":0.0015369386,"about_ca_topic_score_gemma":0.0011531014,"teacher_disagreement_score":0.008819926,"about_ca_system_score_codex":0.0037202202,"about_ca_system_score_gemma":0.0020297735,"threshold_uncertainty_score":0.02950561},"labels":[],"label_agreement":null},{"id":"W2774144053","doi":"10.1007/s00493-017-3396-3","title":"Extending Factorizations of Complete Uniform Hypergraphs","year":2017,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","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 Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Hypergraph; Discrete mathematics","score_opus":0.019760809228066133,"score_gpt":0.22312220478638162,"score_spread":0.20336139555831548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774144053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15554668,0.0011666334,0.77264065,0.0005528054,0.00022539234,0.00011252579,0.0006102261,0.0005634338,0.0685817],"genre_scores_gemma":[0.78806466,0.0013025698,0.1773912,0.0003640135,0.0003481427,0.00012777284,0.0009315032,0.0003324029,0.03113777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987723,0.00037028993,0.000066005734,0.00034814738,0.00020339867,0.00023985635],"domain_scores_gemma":[0.99672925,0.0014592742,0.00029640654,0.0007590141,0.00043782615,0.0003181701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013137726,0.0007693824,0.0008591286,0.0018905352,0.001652373,0.002708047,0.0008658152,0.00062237674,0.010198373],"category_scores_gemma":[0.0045475666,0.00069619284,0.0011917226,0.0018662197,0.002137533,0.0058616246,0.002387198,0.0017458335,0.0011697421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065309185,0.00003271798,0.0002638343,0.00006222308,0.000013260358,0.00010314209,0.0004559431,0.0043307263,0.0015868663,0.9735339,0.0016239069,0.017928064],"study_design_scores_gemma":[0.00001216323,0.000016280657,0.0001594325,0.000028739463,0.000013761836,0.000077441306,0.0001091632,0.009909109,0.00067804864,0.9814834,0.007500589,0.000011890538],"about_ca_topic_score_codex":0.0025021918,"about_ca_topic_score_gemma":0.0030041216,"teacher_disagreement_score":0.010198373,"about_ca_system_score_codex":0.0012970793,"about_ca_system_score_gemma":0.00057589414,"threshold_uncertainty_score":0.034116983},"labels":[],"label_agreement":null},{"id":"W2824286381","doi":"10.1007/s00493-020-4041-0","title":"Expanding Polynomials: A Generalization of the Elekes-Rónyai Theorem to d Variables","year":2020,"lang":"en","type":"preprint","venue":"COMBINATORICA","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Physics; Omega; Mathematics; Quantum mechanics","score_opus":0.06982136849772809,"score_gpt":0.32616016381708435,"score_spread":0.25633879531935627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2824286381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11970086,0.0066895485,0.6708601,0.0046094977,0.0013145127,0.00007207635,0.00044019512,0.00036996347,0.19594327],"genre_scores_gemma":[0.82197,0.0075080087,0.113407135,0.001511222,0.0022886116,0.0001167513,0.0003418371,0.0003315269,0.05252493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955434,0.00014032303,0.000021549526,0.000098129196,0.00011711789,0.000068467074],"domain_scores_gemma":[0.99930584,0.0003449681,0.00008659172,0.00009503176,0.000090896574,0.000076685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011074892,0.00086853653,0.00067178183,0.0021370326,0.0011304445,0.0021640079,0.0010240425,0.0008004077,0.005787381],"category_scores_gemma":[0.0026213387,0.00031898884,0.0009443122,0.0023485704,0.0028093315,0.0044338345,0.0026840128,0.002886733,0.00097072445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008644445,0.0000056131994,0.00007406495,0.000023043785,0.0000027971498,0.000044518438,0.00010104737,0.0003879216,0.0003536072,0.991527,0.00092319644,0.0065486194],"study_design_scores_gemma":[0.000007039271,0.0000070860556,0.00013275343,0.00001127121,0.000005792992,0.00012262122,0.000035637127,0.004732517,0.00029719577,0.9886685,0.0059723007,0.0000072778785],"about_ca_topic_score_codex":0.0009495988,"about_ca_topic_score_gemma":0.0007519069,"teacher_disagreement_score":0.005787381,"about_ca_system_score_codex":0.00082112063,"about_ca_system_score_gemma":0.0006623126,"threshold_uncertainty_score":0.019360662},"labels":[],"label_agreement":null},{"id":"W2921418856","doi":"10.1007/s00493-018-3708-2","title":"The Minimally Non-Ideal Binary Clutters with a Triangle","year":2019,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Vibration and Dynamic Analysis","field":"Engineering","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":"Mathematics; Ideal (ethics); Combinatorics; Binary number; Discrete mathematics; Arithmetic; Epistemology","score_opus":0.0030253145988220586,"score_gpt":0.17572052417320796,"score_spread":0.17269520957438592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921418856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3670845,0.00074095157,0.42287603,0.0016636485,0.00052085915,0.000079466154,0.00046868672,0.00054353965,0.20602243],"genre_scores_gemma":[0.936106,0.00028497318,0.0368673,0.00036881457,0.00034340925,0.00006227055,0.00030261095,0.00020474433,0.025459899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987041,0.00030068934,0.000069643684,0.00027441277,0.00041417158,0.0002369194],"domain_scores_gemma":[0.9982907,0.0006633982,0.00024248734,0.0002156801,0.00024743582,0.0003402645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000713182,0.0007412283,0.0008743386,0.002541614,0.0024359378,0.004038279,0.0010684258,0.0009840427,0.012797071],"category_scores_gemma":[0.0043087676,0.0006286959,0.0006583601,0.0015944602,0.003187137,0.0037118646,0.0028963084,0.0020442235,0.0015339507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050589097,0.000010382867,0.00019657529,0.000023269842,0.0000036501765,0.000077970566,0.0001530321,0.00081744994,0.00085352873,0.9934638,0.0009848037,0.003364808],"study_design_scores_gemma":[0.000015233758,0.000022479751,0.00033369716,0.000018140465,0.000006120583,0.00036730693,0.0001795644,0.00840477,0.0010376333,0.984544,0.0050511286,0.000019816263],"about_ca_topic_score_codex":0.0009914048,"about_ca_topic_score_gemma":0.0006429618,"teacher_disagreement_score":0.012797071,"about_ca_system_score_codex":0.00078928325,"about_ca_system_score_gemma":0.00045875346,"threshold_uncertainty_score":0.04281044},"labels":[],"label_agreement":null},{"id":"W2921478501","doi":"10.1007/s00493-020-4177-y","title":"On the Density of C7-Critical Graphs","year":2022,"lang":"en","type":"preprint","venue":"COMBINATORICA","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; Homomorphism; Planar graph; Modulo; Girth (graph theory); Conjecture; Graph homomorphism; Graph; Discrete mathematics; Odd graph; 1-planar graph; Graph power; Line graph","score_opus":0.0345622702573892,"score_gpt":0.3188477609824474,"score_spread":0.28428549072505815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921478501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7658805,0.0029121235,0.099412635,0.0056286766,0.0003021892,0.00010191322,0.0009129219,0.00048211243,0.12436694],"genre_scores_gemma":[0.98090094,0.001229649,0.008791774,0.00043260923,0.00041318146,0.000113698174,0.0005392418,0.00015386751,0.0074250167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990226,0.0003485378,0.000026824855,0.00014490307,0.0002658864,0.00019117631],"domain_scores_gemma":[0.9846635,0.01096707,0.0009309159,0.0006190949,0.0012183507,0.0016011588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015850026,0.00068855524,0.001195856,0.0053089713,0.0021953816,0.0035511744,0.0021699022,0.0019135117,0.013173649],"category_scores_gemma":[0.01732547,0.00081612467,0.00054363156,0.0023029405,0.004211175,0.004680247,0.0026299823,0.00234157,0.00089935126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007029354,0.000030456282,0.0011288176,0.000091785645,0.000010610044,0.00007284285,0.00026470856,0.0031681138,0.00084231864,0.9865955,0.0035081923,0.004216434],"study_design_scores_gemma":[0.000023333883,0.000012729606,0.0010219956,0.000055115408,0.0000120992045,0.00016410262,0.00017785077,0.026457839,0.0006366403,0.9697267,0.0016937114,0.000017877917],"about_ca_topic_score_codex":0.002791504,"about_ca_topic_score_gemma":0.0020579866,"teacher_disagreement_score":0.013173649,"about_ca_system_score_codex":0.0023337845,"about_ca_system_score_gemma":0.00089370104,"threshold_uncertainty_score":0.044070244},"labels":[],"label_agreement":null},{"id":"W2922170409","doi":"10.1007/s00493-018-3779-0","title":"The Two-Point Fano and Ideal Binary Clutters","year":2019,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Coding theory and cryptography","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":"Fano plane; Ideal (ethics); Combinatorics; Binary number; Mathematics; Clutter; Discrete mathematics; Physics; Pure mathematics; Arithmetic; Computer science; Telecommunications","score_opus":0.0053238846182333665,"score_gpt":0.21095649114792916,"score_spread":0.2056326065296958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922170409","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39736426,0.0028035627,0.16736741,0.0060722064,0.0006174026,0.00007941969,0.0008000187,0.00048008285,0.42441562],"genre_scores_gemma":[0.94801664,0.0009136255,0.014166341,0.00057063706,0.0005672165,0.00006479131,0.00027731972,0.00010990829,0.035313547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898535,0.00026518616,0.0000372784,0.00016232922,0.00029820175,0.00025160034],"domain_scores_gemma":[0.9983132,0.00074883655,0.00019821718,0.00022791454,0.00019172755,0.0003200548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012776302,0.0008054252,0.0009647806,0.0036522995,0.003202692,0.0041511413,0.00092031923,0.0014029284,0.011362453],"category_scores_gemma":[0.0044927676,0.0005170045,0.00066993246,0.0025090503,0.005320968,0.0062187226,0.0027240214,0.002128339,0.0013528662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020163558,0.0000047947715,0.000072241535,0.000007637103,0.0000012062742,0.000020473684,0.000060223276,0.00033336045,0.00009901406,0.99669766,0.00080325204,0.0018800527],"study_design_scores_gemma":[0.0000092341315,0.0000058219057,0.000117508695,0.000010548847,0.000002676589,0.00010205302,0.00004709171,0.0022400625,0.00020088314,0.9932591,0.003992789,0.000012258228],"about_ca_topic_score_codex":0.0013333217,"about_ca_topic_score_gemma":0.00080677326,"teacher_disagreement_score":0.011362453,"about_ca_system_score_codex":0.0016118422,"about_ca_system_score_gemma":0.00069748354,"threshold_uncertainty_score":0.038011253},"labels":[],"label_agreement":null},{"id":"W2962755011","doi":"10.1007/s00493-018-3859-1","title":"Improved Bounds for Rota's Basis Conjecture","year":2018,"lang":"en","type":"article","venue":"COMBINATORICA","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":"Mathematics; Matroid; Combinatorics; Disjoint sets; Conjecture; Rank (graph theory); Basis (linear algebra); Discrete mathematics; Geometry","score_opus":0.00628664731631921,"score_gpt":0.2029663673454901,"score_spread":0.1966797200291709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962755011","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10794732,0.011084294,0.32518017,0.043561272,0.004218134,0.0002927129,0.0038804833,0.003594111,0.5002416],"genre_scores_gemma":[0.8149323,0.006529024,0.10180107,0.008985009,0.007291662,0.0011729456,0.004093592,0.0024915326,0.052702945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9899713,0.0028472338,0.00033551155,0.0018286516,0.003181283,0.0018360503],"domain_scores_gemma":[0.9436323,0.043023787,0.001305251,0.0067950487,0.0030440884,0.0021995907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008853876,0.0039803735,0.00553705,0.007124046,0.0057557235,0.011584955,0.008505442,0.005776641,0.047084365],"category_scores_gemma":[0.046294514,0.0018669697,0.0036475619,0.0078626815,0.009396739,0.025816374,0.0129423775,0.01978611,0.012227047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069164886,0.00028881477,0.0010835126,0.00049120054,0.0000883134,0.0001892463,0.0005063315,0.009802677,0.0016697719,0.9200491,0.038853433,0.026286038],"study_design_scores_gemma":[0.000058403053,0.00003168821,0.00023204062,0.0000836089,0.00005606324,0.0000723094,0.00007642757,0.02008775,0.00058528234,0.9730907,0.0055890544,0.00003684155],"about_ca_topic_score_codex":0.0034977996,"about_ca_topic_score_gemma":0.0037286158,"teacher_disagreement_score":0.047084365,"about_ca_system_score_codex":0.006723432,"about_ca_system_score_gemma":0.0029910398,"threshold_uncertainty_score":0.1575129},"labels":[],"label_agreement":null},{"id":"W2963873020","doi":"10.1007/s00493-017-3538-5","title":"Treewidth of Grid Subsets","year":2017,"lang":"en","type":"article","venue":"COMBINATORICA","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":"McGill University","funders":"","keywords":"Mathematics; Treewidth; Combinatorics; Grid; Graph; Pathwidth; Geometry","score_opus":0.029705580329058148,"score_gpt":0.31315980002095173,"score_spread":0.2834542196918936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963873020","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8029748,0.0007730683,0.13705419,0.001647429,0.000067281726,0.00005084235,0.0021337692,0.00038851783,0.054910086],"genre_scores_gemma":[0.95711136,0.0006573924,0.028992094,0.00029276512,0.00008286717,0.00010132021,0.0018822729,0.00020486736,0.010675072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995776,0.00009306846,0.000028485234,0.00009586923,0.00009358013,0.00011148103],"domain_scores_gemma":[0.99777657,0.0012647989,0.00022702561,0.00027409545,0.00019743334,0.00026002884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004377851,0.00035288004,0.0007604785,0.0011458604,0.0010572225,0.003515198,0.001195355,0.0006760448,0.009726813],"category_scores_gemma":[0.0029664284,0.00054532365,0.0004353267,0.0022183964,0.0009820791,0.0042056274,0.0015482258,0.0013846542,0.00095320155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004318877,0.00008341386,0.004408574,0.00017534533,0.000038390084,0.00021754713,0.0010146527,0.00863873,0.006818578,0.93963087,0.0065588476,0.031983245],"study_design_scores_gemma":[0.00005466158,0.000029434048,0.0015763215,0.0000354153,0.000035049332,0.00028126655,0.0004432094,0.023465881,0.0024791523,0.96526384,0.0063252817,0.000010497937],"about_ca_topic_score_codex":0.0012826908,"about_ca_topic_score_gemma":0.0014529134,"teacher_disagreement_score":0.009726813,"about_ca_system_score_codex":0.0007146966,"about_ca_system_score_gemma":0.00044370396,"threshold_uncertainty_score":0.032539487},"labels":[],"label_agreement":null},{"id":"W2989234367","doi":"10.1007/s00493-023-00007-w","title":"On the Density of Critical Graphs with No Large Cliques","year":2023,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph theory and applications","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":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Combinatorics; Clique-sum; Chordal graph; Discrete mathematics; Graph; 1-planar graph","score_opus":0.0351792611584909,"score_gpt":0.31964784191637935,"score_spread":0.28446858075788845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989234367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7075078,0.0059791747,0.19755314,0.011230905,0.0005032252,0.00017184477,0.0012653493,0.00062307453,0.0751655],"genre_scores_gemma":[0.97445506,0.0021017788,0.014468179,0.00070928433,0.0009377464,0.00019417773,0.00067916187,0.00021258835,0.0062419674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985238,0.0006990997,0.000035820263,0.00025242355,0.00027549095,0.00021342565],"domain_scores_gemma":[0.94862086,0.042287998,0.0023397952,0.0015503118,0.0018872007,0.0033138576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027953188,0.0009404061,0.0022011015,0.0049733324,0.002676448,0.003637407,0.0037259702,0.0023553204,0.008775192],"category_scores_gemma":[0.04199545,0.0016264841,0.0007757147,0.0026108949,0.006356817,0.0073295026,0.003100979,0.0030322513,0.0005594797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020322621,0.00008368815,0.002747691,0.00026466793,0.000042685762,0.00012775215,0.000460977,0.01607861,0.0013255667,0.9653196,0.0073729623,0.0059726215],"study_design_scores_gemma":[0.00005759666,0.000027872755,0.0016835708,0.000077435616,0.000030694668,0.00022403788,0.00024170364,0.08461697,0.000462658,0.9107959,0.0017518325,0.000029707538],"about_ca_topic_score_codex":0.0033436315,"about_ca_topic_score_gemma":0.0026753906,"teacher_disagreement_score":0.008775192,"about_ca_system_score_codex":0.002612527,"about_ca_system_score_gemma":0.00094374106,"threshold_uncertainty_score":0.029356003},"labels":[],"label_agreement":null},{"id":"W3001610491","doi":"10.1007/s00493-020-4516-z","title":"On the Directions Determined by a Cartesian Product in an Affine Galois Plane","year":2021,"lang":"en","type":"preprint","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Cartesian product; Combinatorics; Affine transformation; Upper and lower bounds; Clique; Graph; Product (mathematics); Discrete mathematics; Pure mathematics; Geometry","score_opus":0.02954398501120894,"score_gpt":0.28591201975071084,"score_spread":0.2563680347395019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001610491","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76731426,0.0015890774,0.10018454,0.0015980201,0.00029416836,0.00008526634,0.0006729087,0.00019946392,0.12806219],"genre_scores_gemma":[0.9463948,0.0014450226,0.026808647,0.00023999391,0.00028867408,0.00012646744,0.000600922,0.00014351083,0.023951853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990822,0.0003161051,0.000051269966,0.00018855529,0.00021497904,0.00014689744],"domain_scores_gemma":[0.9986749,0.00047217333,0.00027215978,0.00009878355,0.00024177025,0.00024014078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010463333,0.0011139442,0.00063853565,0.003732708,0.0024379408,0.00455776,0.0010393081,0.0011657948,0.0046598674],"category_scores_gemma":[0.0018310961,0.00072797306,0.0006719621,0.002167133,0.003492699,0.005260618,0.001886497,0.002555658,0.0010040839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043595464,0.000016669945,0.00021079229,0.000016932701,0.000004376135,0.00007777708,0.0003004549,0.00048714984,0.0005614361,0.99512297,0.00046422757,0.0026935497],"study_design_scores_gemma":[0.000027204298,0.000026253092,0.0003412309,0.00002216618,0.0000087496755,0.00015729354,0.00028771537,0.0020305344,0.00056632963,0.99240816,0.0041094623,0.0000147613255],"about_ca_topic_score_codex":0.0018995779,"about_ca_topic_score_gemma":0.0018684169,"teacher_disagreement_score":0.0046598674,"about_ca_system_score_codex":0.0011970196,"about_ca_system_score_gemma":0.0006168534,"threshold_uncertainty_score":0.01558876},"labels":[],"label_agreement":null},{"id":"W3134598310","doi":"10.1007/s00493-021-4774-4","title":"A Family of Balanced Generalized Weighing Matrices","year":2022,"lang":"en","type":"article","venue":"COMBINATORICA","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":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Class (philosophy); Matrix (chemical analysis); Association scheme; Scheme (mathematics); Integer matrix; Mathematical analysis; Symmetric matrix; Nonnegative matrix; Eigenvalues and eigenvectors; Physics","score_opus":0.006785211765883642,"score_gpt":0.18435956513308321,"score_spread":0.17757435336719957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134598310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21110962,0.0014395221,0.7118264,0.0008255561,0.00029464057,0.0001602075,0.0005307406,0.00075976405,0.07305349],"genre_scores_gemma":[0.7951029,0.0016777843,0.14569958,0.0006776751,0.00029619594,0.00033805807,0.00075156405,0.00028853494,0.055167735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999438,0.00013228788,0.000022912764,0.00014150603,0.00016465045,0.00010062078],"domain_scores_gemma":[0.9988393,0.0003961838,0.0001820103,0.00017413503,0.00025015874,0.00015821491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004978044,0.00088274054,0.00057702325,0.0015273278,0.0010572225,0.0015852246,0.0009266104,0.00092677464,0.0075798663],"category_scores_gemma":[0.0028236853,0.0004312881,0.00047517396,0.0016192355,0.00076313113,0.0015268553,0.00095621054,0.0010031406,0.0013354938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008183638,0.000040333343,0.000519318,0.000074966476,0.00003176694,0.00020048414,0.00012668638,0.0065210974,0.011737611,0.9311172,0.004131168,0.045417633],"study_design_scores_gemma":[0.000051985597,0.00007346794,0.00065802684,0.000046961042,0.000026336627,0.00064702024,0.00007919527,0.070882946,0.0041215,0.9011394,0.02223026,0.000042957563],"about_ca_topic_score_codex":0.0008700329,"about_ca_topic_score_gemma":0.0010005002,"teacher_disagreement_score":0.0075798663,"about_ca_system_score_codex":0.0006987373,"about_ca_system_score_gemma":0.00056341157,"threshold_uncertainty_score":0.025357187},"labels":[],"label_agreement":null},{"id":"W3160268110","doi":"10.1007/s00493-023-00055-2","title":"Effective Results on the Size and Structure of Sumsets","year":2023,"lang":"lv","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Centre de Recherches Mathématiques","keywords":"Algorithm; Computer science","score_opus":0.015744175514643532,"score_gpt":0.26513998291885726,"score_spread":0.24939580740421374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160268110","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5625457,0.0041366983,0.1784255,0.007114343,0.00055824796,0.00012020433,0.003657904,0.0009500158,0.24249135],"genre_scores_gemma":[0.9435785,0.0013102269,0.020632382,0.0006065564,0.00086924224,0.0001698974,0.0016176649,0.00039132356,0.030824099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705577,0.0005669461,0.00021530404,0.00063752034,0.0010473331,0.00047715497],"domain_scores_gemma":[0.9856091,0.010056543,0.00089929963,0.0014617365,0.0007945084,0.0011788013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002224429,0.00096937374,0.0015256106,0.0038156975,0.002403435,0.0060168332,0.0023385799,0.0011775851,0.016706958],"category_scores_gemma":[0.01070863,0.00094493676,0.0014859693,0.002663313,0.0043752333,0.012734944,0.0045295972,0.003041355,0.0016128055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014292997,0.000040371655,0.00089116854,0.00014429381,0.00003295821,0.00009711209,0.0003268818,0.0030941227,0.0012273896,0.9830005,0.0033447647,0.0076573743],"study_design_scores_gemma":[0.00002562486,0.000028305118,0.0005575355,0.000035807578,0.00003710507,0.00016038878,0.00013841629,0.007197233,0.00142419,0.98445475,0.0059202905,0.000020301637],"about_ca_topic_score_codex":0.0009058465,"about_ca_topic_score_gemma":0.0011454549,"teacher_disagreement_score":0.016706958,"about_ca_system_score_codex":0.0028843128,"about_ca_system_score_gemma":0.0008452592,"threshold_uncertainty_score":0.05589038},"labels":[],"label_agreement":null},{"id":"W3204767113","doi":"10.1007/s00493-023-00015-w","title":"Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path","year":2023,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of 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":"Algorithm; Mathematics","score_opus":0.03349660689747145,"score_gpt":0.32149013006570326,"score_spread":0.2879935231682318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204767113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18972601,0.008124018,0.4460232,0.028752357,0.0017913886,0.0005450206,0.004529057,0.0036646724,0.31684425],"genre_scores_gemma":[0.840994,0.0042950995,0.09046254,0.004123172,0.0027773834,0.0006221842,0.003679516,0.0019834172,0.051062725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944494,0.0006948233,0.00011681837,0.0014197474,0.0014171773,0.0019021997],"domain_scores_gemma":[0.9801379,0.012803353,0.0009160678,0.0026068361,0.0013848935,0.0021510164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003671823,0.0026110802,0.0020155187,0.0034204733,0.0044285585,0.007144355,0.0055103847,0.00248017,0.02914331],"category_scores_gemma":[0.015561623,0.0010373549,0.0034494023,0.0038624771,0.0058834474,0.012478202,0.005716839,0.012561743,0.0059685386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003370873,0.0011317746,0.0072355005,0.0014689601,0.00024304148,0.0007672411,0.0010385441,0.105460234,0.024849618,0.65820175,0.09597529,0.10025729],"study_design_scores_gemma":[0.00028305757,0.00039463595,0.003415982,0.00034546602,0.00031972374,0.0005694829,0.00032672368,0.22642246,0.011776297,0.7185719,0.037415713,0.00015850825],"about_ca_topic_score_codex":0.00977154,"about_ca_topic_score_gemma":0.012517412,"teacher_disagreement_score":0.02914331,"about_ca_system_score_codex":0.008639129,"about_ca_system_score_gemma":0.0039461134,"threshold_uncertainty_score":0.097494066},"labels":[],"label_agreement":null},{"id":"W3216450391","doi":"10.1007/s00493-020-4264-0","title":"The Ramsey Properties for Grassmannians Over ℝ, ℂ","year":2021,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Topology and Set 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":"Collège Lionel Groulx","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Fundação de Amparo à Pesquisa do Estado de São Paulo; Instituto de Ciencias Matemáticas; National Science Foundation","keywords":"Mathematics; Rothschild; Combinatorics; Factorization; Finite field; Metric (unit); Ramsey theory; Dual (grammatical number); Field (mathematics); Discrete mathematics; Integer (computer science); Pure mathematics; Algorithm","score_opus":0.05685348400987948,"score_gpt":0.32288979978793997,"score_spread":0.2660363157780605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216450391","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69234544,0.003569729,0.082080275,0.0074531483,0.00070256076,0.00008434689,0.00075479865,0.0004349832,0.21257474],"genre_scores_gemma":[0.97490126,0.00087531656,0.006688548,0.00052995427,0.00038516553,0.00005766944,0.00022895576,0.000072373914,0.016260777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993119,0.00014776802,0.00004182845,0.0001832775,0.00014821047,0.00016704005],"domain_scores_gemma":[0.99850285,0.0005937289,0.00024198553,0.00019178647,0.0001698434,0.0002998313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012259381,0.00064546836,0.000852068,0.0016799723,0.0032804515,0.0037685076,0.00090437307,0.0010600731,0.007926099],"category_scores_gemma":[0.002592318,0.0006948757,0.0008908708,0.0016884601,0.005161511,0.010846561,0.0025963269,0.0031807309,0.0008394515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002870446,0.000008694186,0.000091531074,0.0000147385645,0.0000032470734,0.000027340377,0.0002676133,0.000118424825,0.00024134437,0.9972144,0.00063485734,0.0013491708],"study_design_scores_gemma":[0.000013121556,0.000011065369,0.00023558004,0.000006812971,0.000007088336,0.00007725695,0.0001405203,0.0005295968,0.00021646799,0.99644876,0.0023039326,0.000009874564],"about_ca_topic_score_codex":0.0021303794,"about_ca_topic_score_gemma":0.0017111974,"teacher_disagreement_score":0.007926099,"about_ca_system_score_codex":0.0016650282,"about_ca_system_score_gemma":0.00085708936,"threshold_uncertainty_score":0.026515484},"labels":[],"label_agreement":null},{"id":"W4247202641","doi":"10.1007/s004930070033","title":"Adaptive Multicolouring","year":2000,"lang":"en","type":"article","venue":"COMBINATORICA","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":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02092664864078052,"score_gpt":0.27073266581200073,"score_spread":0.2498060171712202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247202641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1850382,0.00064616883,0.6641758,0.00067417213,0.0007089008,0.00022006531,0.00044957435,0.003981789,0.14410536],"genre_scores_gemma":[0.7834922,0.00027828617,0.16040416,0.00042487952,0.00023003593,0.00012278637,0.00034923485,0.0007439076,0.053954504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954104,0.000056698496,0.000016428212,0.00015661947,0.00012883681,0.000100396406],"domain_scores_gemma":[0.998326,0.00031391808,0.00008938426,0.0009773904,0.00017397816,0.00011925718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030507482,0.0004082723,0.00040136854,0.00081809575,0.00096037076,0.0009807621,0.0010849754,0.00067397207,0.022910325],"category_scores_gemma":[0.002091572,0.00023651864,0.0004558344,0.0007408056,0.0009092842,0.0016995133,0.002263929,0.0012571238,0.0025016693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046902668,0.00021480376,0.0013486055,0.0002202842,0.00004425847,0.00023825844,0.0002856727,0.025931237,0.056138255,0.45189372,0.01594257,0.44727337],"study_design_scores_gemma":[0.00014434534,0.0002986339,0.0024996682,0.00008985877,0.00007896373,0.0008121954,0.0002129367,0.3342144,0.067655206,0.52319777,0.070711054,0.00008500796],"about_ca_topic_score_codex":0.00042769118,"about_ca_topic_score_gemma":0.0009896415,"teacher_disagreement_score":0.022910325,"about_ca_system_score_codex":0.0004886739,"about_ca_system_score_gemma":0.0003849348,"threshold_uncertainty_score":0.07664269},"labels":[],"label_agreement":null},{"id":"W4376143266","doi":"10.1007/s00493-023-00031-w","title":"Stronger Counterexamples to the Topological Tverberg Conjecture","year":2023,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","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":"Counterexample; Mathematics; Combinatorics; Conjecture; Disjoint sets; Embedding; Equivariant map; Continuous map; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.012019137954067779,"score_gpt":0.20605481547363724,"score_spread":0.19403567751956946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376143266","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45270768,0.0034487671,0.1081754,0.06286757,0.0030420204,0.000118169235,0.0015012382,0.0012400391,0.36689916],"genre_scores_gemma":[0.97453564,0.00070978183,0.007832615,0.003181029,0.0016012801,0.00012793911,0.00062035903,0.00013394585,0.011257295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958801,0.0015594772,0.00017846691,0.0008271171,0.0009955936,0.0005592945],"domain_scores_gemma":[0.9717334,0.023217568,0.001140155,0.0020607377,0.0009037277,0.0009442734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036002828,0.000990213,0.0019045215,0.0022518216,0.003264182,0.006949085,0.0027275055,0.0050660656,0.023238147],"category_scores_gemma":[0.0190464,0.00089438644,0.0012232495,0.0021113157,0.008262379,0.013023849,0.0053927996,0.0063973316,0.0017044968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099734476,0.000045680757,0.0002778957,0.00007150428,0.000014952777,0.00009752499,0.00025673053,0.00095053023,0.00035285356,0.99188995,0.004422185,0.0015204293],"study_design_scores_gemma":[0.000056060657,0.000014140274,0.00015182626,0.000016756238,0.000009722251,0.000095162155,0.00013775863,0.0034556221,0.00023983546,0.99308467,0.002726162,0.000012231881],"about_ca_topic_score_codex":0.0009039979,"about_ca_topic_score_gemma":0.00083406444,"teacher_disagreement_score":0.023238147,"about_ca_system_score_codex":0.0024090619,"about_ca_system_score_gemma":0.0007552462,"threshold_uncertainty_score":0.07773936},"labels":[],"label_agreement":null},{"id":"W4380373845","doi":"10.1007/s00493-023-00047-2","title":"The Chromatic Number of the Product of 5-Chromatic Graphs can be 4","year":2023,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Topological and Geometric Data Analysis","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":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Product (mathematics); Discrete mathematics; Geometry","score_opus":0.017308036087016348,"score_gpt":0.2537779589324572,"score_spread":0.23646992284544086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380373845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8030462,0.00058364455,0.068340845,0.0011876777,0.00033578178,0.00011579622,0.0026974767,0.0006473375,0.12304518],"genre_scores_gemma":[0.93878037,0.0004230629,0.026428942,0.00015068095,0.000097345124,0.00011795667,0.001993952,0.00016596368,0.031841636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931264,0.00008359671,0.000034518293,0.00023412923,0.0001626369,0.00017244914],"domain_scores_gemma":[0.9981918,0.0007570009,0.0002718152,0.00025868535,0.0002916883,0.00022914188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061644963,0.00075694267,0.00040692207,0.001955709,0.0014355062,0.0030316534,0.0012033817,0.0009373003,0.026225844],"category_scores_gemma":[0.001678216,0.00037147768,0.0006967464,0.0015432694,0.0017044303,0.002635276,0.001085114,0.0010664612,0.0026732627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008169313,0.00022302795,0.019043535,0.000375985,0.0001539491,0.0005333921,0.00091215264,0.011571919,0.039150782,0.83206934,0.013368783,0.0817803],"study_design_scores_gemma":[0.00010712498,0.00032777523,0.037056416,0.00020710629,0.00030098404,0.0016561411,0.001380903,0.06689514,0.04077203,0.736534,0.11455041,0.00021209534],"about_ca_topic_score_codex":0.002157108,"about_ca_topic_score_gemma":0.0044705803,"teacher_disagreement_score":0.026225844,"about_ca_system_score_codex":0.0015280342,"about_ca_system_score_gemma":0.0008507967,"threshold_uncertainty_score":0.08773416},"labels":[],"label_agreement":null},{"id":"W4380629273","doi":"10.1007/s00493-023-00024-9","title":"An Improved Bound for the Linear Arboricity Conjecture","year":2023,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Algorithm; Conjecture; Mathematics; Combinatorics","score_opus":0.028501187315718303,"score_gpt":0.33020969997860394,"score_spread":0.3017085126628856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380629273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16947275,0.013344966,0.40443286,0.041459065,0.004374544,0.0003980958,0.0064833127,0.007400067,0.35263434],"genre_scores_gemma":[0.84726536,0.0050805304,0.08265131,0.00797943,0.0051103164,0.00047931814,0.007216856,0.0020946602,0.042122204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99214786,0.0015910525,0.00023062757,0.0021031566,0.0021742422,0.0017530927],"domain_scores_gemma":[0.96088946,0.026057485,0.0013828757,0.0060200742,0.0036321452,0.0020178922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004874858,0.0021504252,0.0021057753,0.0031596574,0.0029265606,0.0048883297,0.005414177,0.0030751547,0.0505234],"category_scores_gemma":[0.032472186,0.0012795933,0.0029641688,0.0032885722,0.0042922515,0.016492948,0.006537747,0.011278509,0.010235768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021723502,0.0007680749,0.008067281,0.001373135,0.00027931604,0.0011961123,0.0007883699,0.04946346,0.011618939,0.6262246,0.19524741,0.102800936],"study_design_scores_gemma":[0.00019355876,0.0002207603,0.0017289512,0.00023928205,0.00014941336,0.0006105324,0.00020485568,0.14629151,0.0042245407,0.8092621,0.036783654,0.00009086584],"about_ca_topic_score_codex":0.004171835,"about_ca_topic_score_gemma":0.004424318,"teacher_disagreement_score":0.0505234,"about_ca_system_score_codex":0.00423933,"about_ca_system_score_gemma":0.0019323556,"threshold_uncertainty_score":0.16901761},"labels":[],"label_agreement":null},{"id":"W4394572107","doi":"10.1007/s00493-024-00097-0","title":"Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","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":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Combinatorics; Prism; Tree (set theory); Forestry; Geography; Physics","score_opus":0.025770290063203218,"score_gpt":0.2955779802607052,"score_spread":0.269807690197502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394572107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.613565,0.0010544104,0.3162238,0.0019982534,0.00020493225,0.00012426947,0.0008650482,0.0005072358,0.06545702],"genre_scores_gemma":[0.89444464,0.00070178544,0.084307745,0.00039927728,0.000103294224,0.00008946526,0.0010887854,0.00016058123,0.018704446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996736,0.000060758925,0.000018539615,0.00008674419,0.000073465104,0.00008690508],"domain_scores_gemma":[0.9989531,0.00048126874,0.00018138763,0.000113767615,0.00009195188,0.0001785695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047740518,0.0003787446,0.00039921157,0.0009251372,0.0010091268,0.001700418,0.000743912,0.0006625285,0.0050718565],"category_scores_gemma":[0.0015039,0.00064567174,0.000980663,0.0012142933,0.0013219687,0.0025866025,0.0013044177,0.002247353,0.0005307093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015195133,0.000079754,0.0028094286,0.000229125,0.000044017554,0.000573162,0.00092875614,0.007563448,0.010446589,0.94957507,0.0048884284,0.022710288],"study_design_scores_gemma":[0.00003800466,0.000037741785,0.002032766,0.00004644037,0.00005254249,0.000653193,0.0005653542,0.018074527,0.0037418467,0.9681111,0.0066298144,0.000016588414],"about_ca_topic_score_codex":0.0020262087,"about_ca_topic_score_gemma":0.0032957161,"teacher_disagreement_score":0.0050718565,"about_ca_system_score_codex":0.00066398265,"about_ca_system_score_gemma":0.0006195607,"threshold_uncertainty_score":0.016966999},"labels":[],"label_agreement":null},{"id":"W4396904930","doi":"10.1007/s00493-024-00106-2","title":"List-k-Coloring H-Free Graphs for All $$k>4$$","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","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":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.03212748022118933,"score_gpt":0.3144627735592146,"score_spread":0.28233529333802526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396904930","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3792717,0.0010823641,0.32061872,0.012374806,0.0010871134,0.00072404376,0.030983744,0.012802689,0.24105483],"genre_scores_gemma":[0.7842073,0.0006855529,0.09929721,0.0032346665,0.00028754617,0.00064189633,0.017737282,0.0025975837,0.09131098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998776,0.00014271522,0.0000490223,0.00038024777,0.00015151603,0.00050039665],"domain_scores_gemma":[0.99345374,0.0025628945,0.0005041057,0.0016497994,0.0009709151,0.0008585894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006667312,0.0012473364,0.00083778345,0.0009935182,0.0031080362,0.003648406,0.0027807201,0.00149651,0.036668994],"category_scores_gemma":[0.004086096,0.00084586616,0.0010632388,0.0014504001,0.0016481142,0.0043890867,0.002514997,0.003277268,0.008098781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023133021,0.00083587045,0.007988652,0.0014130133,0.00024163414,0.0007395557,0.0012630502,0.012698255,0.03310633,0.6358971,0.20617424,0.09732908],"study_design_scores_gemma":[0.00024105773,0.000116061085,0.0044708084,0.00010333362,0.0001814278,0.001166032,0.0008072925,0.025768869,0.02239453,0.89104664,0.053604517,0.000099516],"about_ca_topic_score_codex":0.0034439464,"about_ca_topic_score_gemma":0.0062070987,"teacher_disagreement_score":0.036668994,"about_ca_system_score_codex":0.0021420952,"about_ca_system_score_gemma":0.0025579457,"threshold_uncertainty_score":0.122669995},"labels":[],"label_agreement":null},{"id":"W4399544156","doi":"10.1007/s00493-024-00109-z","title":"List-Avoiding Orientations","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph Labeling and Dimension Problems","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":"Mathematics; Combinatorics","score_opus":0.00929819383538542,"score_gpt":0.2415265926093738,"score_spread":0.2322283987739884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399544156","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32428023,0.0009780796,0.21883827,0.0047889235,0.0004195296,0.00015624241,0.0030420925,0.0015244109,0.4459722],"genre_scores_gemma":[0.8013567,0.0012725504,0.07963733,0.0011311639,0.00031202773,0.00018016736,0.0042212056,0.00077388546,0.11111499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935335,0.00012654591,0.000030022882,0.00015918755,0.00013922041,0.0001916133],"domain_scores_gemma":[0.99816906,0.0008061174,0.00017186782,0.00034682083,0.00024738678,0.0002588142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041001337,0.0006569019,0.00056193245,0.0013585233,0.0028054044,0.0042722975,0.0012334707,0.0012401503,0.026875615],"category_scores_gemma":[0.0023278156,0.0005918688,0.00071792444,0.001996273,0.0013870213,0.004303855,0.0022058906,0.0026712103,0.004564855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098782606,0.00006610513,0.0007327495,0.00008199549,0.000007082876,0.00007437625,0.00024372712,0.0012699529,0.0020857307,0.95774275,0.013751843,0.023844954],"study_design_scores_gemma":[0.000026020347,0.000012688442,0.00043649253,0.000027455982,0.000019989266,0.00017218791,0.00023829649,0.005261777,0.0023353267,0.97129244,0.020163605,0.000013726387],"about_ca_topic_score_codex":0.001989493,"about_ca_topic_score_gemma":0.003448679,"teacher_disagreement_score":0.026875615,"about_ca_system_score_codex":0.0017243384,"about_ca_system_score_gemma":0.0008407011,"threshold_uncertainty_score":0.089907885},"labels":[],"label_agreement":null},{"id":"W4400543041","doi":"10.1007/s00493-024-00112-4","title":"Unavoidable Flats in Matroids Representable over Prime Fields","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Coding theory and cryptography","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":"Matroid; Mathematics; Combinatorics; Prime (order theory); Graphic matroid; Discrete mathematics","score_opus":0.007505440034048896,"score_gpt":0.24720173998075382,"score_spread":0.2396962999467049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400543041","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7814413,0.0008004139,0.12547462,0.003165481,0.00026964216,0.00010596013,0.00101737,0.0008854774,0.08683975],"genre_scores_gemma":[0.9710542,0.00041822804,0.0110099185,0.00033550232,0.00021131917,0.00006559811,0.0006581264,0.00016518374,0.016081842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982622,0.00041840997,0.000113226044,0.00033048238,0.00041529845,0.0004604648],"domain_scores_gemma":[0.99384296,0.0032710882,0.0008431574,0.0008081942,0.00042052203,0.0008141295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001348982,0.0009501396,0.0012210523,0.0027208456,0.0034563162,0.0051763696,0.0017686532,0.0019097624,0.010316063],"category_scores_gemma":[0.005961555,0.0014197857,0.0011606573,0.0030844545,0.0036049972,0.009174086,0.0030348182,0.004975273,0.0011062499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015468073,0.00004993876,0.0005878262,0.000058929567,0.000012632568,0.00022284604,0.00043834542,0.0018886536,0.00076599646,0.9902108,0.001517094,0.0040923427],"study_design_scores_gemma":[0.000024311244,0.000025611564,0.00026503013,0.000016263684,0.000013581899,0.00016033277,0.000139263,0.0045809634,0.00053688517,0.9927852,0.0014403661,0.000012271066],"about_ca_topic_score_codex":0.0013794381,"about_ca_topic_score_gemma":0.0019412182,"teacher_disagreement_score":0.010316063,"about_ca_system_score_codex":0.0020948967,"about_ca_system_score_gemma":0.00077660073,"threshold_uncertainty_score":0.03451073},"labels":[],"label_agreement":null},{"id":"W4400919119","doi":"10.1007/s00493-024-00114-2","title":"Storage Codes on Coset Graphs with Asymptotically Unit Rate","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Data Storage Technologies","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":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Coset; Unit (ring theory); Discrete mathematics","score_opus":0.015269433132303528,"score_gpt":0.25138211051095577,"score_spread":0.23611267737865224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400919119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42236283,0.0021169642,0.51032245,0.005600117,0.00066544145,0.0003221033,0.002141957,0.0029862106,0.053481903],"genre_scores_gemma":[0.9162062,0.001530107,0.051518954,0.0011077116,0.000492097,0.0005181703,0.00084918237,0.00083596515,0.02694143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825484,0.00052521436,0.00010029648,0.00022618182,0.0005052777,0.00038820208],"domain_scores_gemma":[0.9812042,0.011667431,0.0015869755,0.0027468011,0.001975054,0.00081958703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015268109,0.0012182797,0.001595347,0.0024440004,0.0020665575,0.003641744,0.0018788886,0.0020986672,0.01043482],"category_scores_gemma":[0.020414846,0.0009362413,0.0006284769,0.0038749804,0.0026214635,0.0057941703,0.003097888,0.0023735915,0.0018399985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003760702,0.0000749168,0.00045704798,0.00016133938,0.000026859114,0.00014736857,0.0002687468,0.031779632,0.005091997,0.93281204,0.009046048,0.019757902],"study_design_scores_gemma":[0.00006488826,0.00005192705,0.00020896448,0.000065588756,0.000019723462,0.00018254977,0.000106156695,0.12175605,0.0041361656,0.87075984,0.0026044385,0.000043612683],"about_ca_topic_score_codex":0.002461659,"about_ca_topic_score_gemma":0.0030786651,"teacher_disagreement_score":0.01043482,"about_ca_system_score_codex":0.002475689,"about_ca_system_score_gemma":0.002561089,"threshold_uncertainty_score":0.034907877},"labels":[],"label_agreement":null},{"id":"W4401333586","doi":"10.1007/s00493-024-00117-z","title":"Pure Pairs. VIII. Excluding a Sparse Graph","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","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":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.03483557909027746,"score_gpt":0.2996560542547483,"score_spread":0.2648204751644708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401333586","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08951117,0.001449592,0.27680817,0.009541257,0.0019711817,0.00027719451,0.0016880087,0.0009920037,0.6177614],"genre_scores_gemma":[0.6880951,0.0015940646,0.102940336,0.0041248333,0.0010320259,0.0005815619,0.0027586946,0.0008452956,0.19802813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917394,0.00022339135,0.000035450463,0.00018774642,0.0002065402,0.00017283086],"domain_scores_gemma":[0.9984579,0.00061348954,0.00014074524,0.00027899677,0.00032179503,0.00018710586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005426694,0.0008325926,0.00076323847,0.0011193809,0.0030385545,0.0020179525,0.0011842573,0.0016845361,0.033101387],"category_scores_gemma":[0.0037145973,0.0004986169,0.0010383397,0.0009281368,0.0018626367,0.005200465,0.002452153,0.0020556473,0.0086005805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006424049,0.000031966123,0.00033078896,0.00016905885,0.000020104506,0.00025535282,0.00017573759,0.00047801097,0.0014492186,0.95641696,0.021772437,0.018836034],"study_design_scores_gemma":[0.000012777679,0.000020227495,0.00025667666,0.000037763133,0.000019853898,0.00029876843,0.00013861808,0.0016422443,0.0017165609,0.97343713,0.022411175,0.000008210011],"about_ca_topic_score_codex":0.0011093011,"about_ca_topic_score_gemma":0.001606944,"teacher_disagreement_score":0.033101387,"about_ca_system_score_codex":0.0007506787,"about_ca_system_score_gemma":0.00090406113,"threshold_uncertainty_score":0.11073512},"labels":[],"label_agreement":null},{"id":"W4404145574","doi":"10.1007/s00493-024-00122-2","title":"Any Two-Coloring of the Plane Contains Monochromatic 3-Term Arithmetic Progressions","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Monochromatic color; Term (time); Arithmetic; Combinatorics; Arithmetic progression; Plane (geometry); Geometry; Physics","score_opus":0.006440745679770104,"score_gpt":0.2143328731498059,"score_spread":0.2078921274700358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404145574","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5872284,0.0010177713,0.19133092,0.0014052866,0.0005667363,0.00017254447,0.0018166347,0.001215133,0.21524654],"genre_scores_gemma":[0.8956351,0.0008190046,0.06001926,0.00043470363,0.00017512617,0.0001402048,0.0013177901,0.00032586095,0.041132938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994387,0.00007136231,0.000027074893,0.00011814409,0.00012093714,0.00022382934],"domain_scores_gemma":[0.99871933,0.00050519116,0.00019400043,0.00021945656,0.00021066541,0.00015146003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032390366,0.0008641161,0.00068860577,0.0015818238,0.0017943034,0.002878166,0.00074702635,0.00085131323,0.0118093295],"category_scores_gemma":[0.0011196443,0.0004994108,0.0006587859,0.0018369132,0.0011525222,0.002303689,0.0011312875,0.0016575862,0.0023690194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007911892,0.0001796695,0.0014241616,0.00033407626,0.000047868907,0.0010026174,0.0005787282,0.0046722516,0.052598566,0.8753906,0.009746394,0.053233773],"study_design_scores_gemma":[0.00016030582,0.0001591794,0.0028424063,0.000091018635,0.00006985632,0.0013408528,0.0004955431,0.011451958,0.031699985,0.90138257,0.05021409,0.0000923089],"about_ca_topic_score_codex":0.0022874821,"about_ca_topic_score_gemma":0.00306122,"teacher_disagreement_score":0.0118093295,"about_ca_system_score_codex":0.0009812411,"about_ca_system_score_gemma":0.0007757487,"threshold_uncertainty_score":0.039506137},"labels":[],"label_agreement":null},{"id":"W4408986240","doi":"10.1007/s00493-025-00147-1","title":"Induced Subgraphs of $$K_r$$-Free Graphs and the Erdős–Rogers Problem","year":2025,"lang":"lv","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.011869118175728008,"score_gpt":0.2551920491449339,"score_spread":0.24332293096920588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408986240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6803673,0.003050663,0.23745383,0.005778972,0.00028501143,0.00030292151,0.0019950282,0.00087307283,0.06989322],"genre_scores_gemma":[0.9420085,0.0013485111,0.03845403,0.0005874632,0.00016269863,0.00025044582,0.0011995403,0.00013797077,0.015850779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986727,0.00048742507,0.000070256276,0.00036992843,0.00019182112,0.00020793926],"domain_scores_gemma":[0.99615675,0.002144074,0.00075181614,0.00034331187,0.00026721475,0.0003368486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009773555,0.0006981638,0.0010884783,0.0012202977,0.0011812842,0.0020930662,0.0015050239,0.0014396625,0.00634706],"category_scores_gemma":[0.005709826,0.0007143881,0.0011961375,0.0014746744,0.001602188,0.004159486,0.002129134,0.0015621486,0.00101832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005939701,0.00011035495,0.0023453257,0.00040624253,0.00012752075,0.000492492,0.000584415,0.05079459,0.0040714005,0.88988024,0.016088864,0.034504578],"study_design_scores_gemma":[0.00022773557,0.00009733291,0.0020459166,0.0000907066,0.00011790284,0.00074902555,0.00050665543,0.13513991,0.0040183957,0.83181995,0.025111586,0.00007483112],"about_ca_topic_score_codex":0.0026109768,"about_ca_topic_score_gemma":0.0019624534,"teacher_disagreement_score":0.00634706,"about_ca_system_score_codex":0.0016319574,"about_ca_system_score_gemma":0.0007053642,"threshold_uncertainty_score":0.021233022},"labels":[],"label_agreement":null},{"id":"W4408986355","doi":"10.1007/s00493-025-00141-7","title":"Improved Integrality Gap in Max–Min Allocation, or, Topology at the North Pole","year":2025,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Freie Universität Berlin","keywords":"Mathematics; Combinatorics; Topology (electrical circuits); Discrete mathematics","score_opus":0.018865894879261894,"score_gpt":0.2707360994386738,"score_spread":0.25187020455941195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408986355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18908288,0.003573225,0.7127488,0.003824595,0.0003924951,0.000084377214,0.0003016617,0.00061104295,0.08938101],"genre_scores_gemma":[0.8909892,0.0012273407,0.097336255,0.0005633378,0.0002887782,0.00009747802,0.00023440385,0.00027595749,0.008987246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794644,0.0007234602,0.00006603575,0.00048233624,0.00054228556,0.00023955129],"domain_scores_gemma":[0.9941104,0.004029662,0.00040870148,0.00067945407,0.0003906339,0.0003811401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035689252,0.00085599406,0.0018114428,0.0014658679,0.0012420375,0.0031947857,0.002653346,0.0014618469,0.008806758],"category_scores_gemma":[0.014078478,0.00063744147,0.0008741249,0.0018384071,0.0022478623,0.0077725006,0.003668326,0.0038218305,0.00093471585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005221095,0.00013518431,0.00092299195,0.0002567817,0.00004459049,0.00015260416,0.00035790008,0.14559723,0.0023453748,0.7998736,0.0053281966,0.044463508],"study_design_scores_gemma":[0.000027736192,0.000089286754,0.0004473081,0.00006501961,0.00003133262,0.00017851197,0.00012535151,0.3817861,0.0015776653,0.6094023,0.006249858,0.000019537081],"about_ca_topic_score_codex":0.000921586,"about_ca_topic_score_gemma":0.0006494896,"teacher_disagreement_score":0.008806758,"about_ca_system_score_codex":0.0025992042,"about_ca_system_score_gemma":0.0009447802,"threshold_uncertainty_score":0.029461563},"labels":[],"label_agreement":null},{"id":"W4412016901","doi":"10.1007/s00493-025-00160-4","title":"Signed graphs with the same even cycles","year":2025,"lang":"en","type":"article","venue":"COMBINATORICA","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":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.011003287367122902,"score_gpt":0.27149403176875814,"score_spread":0.2604907444016352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412016901","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53171283,0.00085273,0.21394391,0.0028682984,0.0019320068,0.00028118148,0.0012516498,0.00095065875,0.24620683],"genre_scores_gemma":[0.8978398,0.0007349366,0.0369211,0.0013504925,0.00025276822,0.00024915763,0.0009012776,0.00039391592,0.061356556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992176,0.00018639874,0.000057687048,0.00014725821,0.00021919698,0.00017184093],"domain_scores_gemma":[0.9974228,0.0005995375,0.0003943467,0.0005393679,0.00061349384,0.00043039516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005308735,0.0007871133,0.0005649046,0.0017250279,0.0015397634,0.0034898408,0.00090923015,0.0014479643,0.01593161],"category_scores_gemma":[0.00348902,0.00045643141,0.00068735017,0.0013585187,0.0014569146,0.004297439,0.0017529607,0.0016445912,0.0023929588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001945264,0.00006681567,0.00063881243,0.0001102771,0.000022104608,0.0005285719,0.00022259958,0.0012715358,0.007680946,0.95715535,0.0035419357,0.028566452],"study_design_scores_gemma":[0.000054427215,0.000049261194,0.00050439907,0.000051711715,0.000036475314,0.0004656592,0.00028974705,0.004739902,0.005597837,0.97235626,0.01581714,0.000037216654],"about_ca_topic_score_codex":0.0005722975,"about_ca_topic_score_gemma":0.00089174684,"teacher_disagreement_score":0.01593161,"about_ca_system_score_codex":0.00077346526,"about_ca_system_score_gemma":0.00094543025,"threshold_uncertainty_score":0.053296506},"labels":[],"label_agreement":null},{"id":"W4412597347","doi":"10.1007/s00493-025-00167-x","title":"An Approximate Counting Version of the Multidimensional Szemerédi Theorem","year":2025,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.011591249925362566,"score_gpt":0.27813665399151827,"score_spread":0.2665454040661557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412597347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12536518,0.002713965,0.6952411,0.006799737,0.0010536575,0.00008517157,0.0012927769,0.00074063794,0.16670787],"genre_scores_gemma":[0.86218035,0.00265845,0.09238604,0.0021306416,0.0019489445,0.00023711708,0.00080555474,0.00047446604,0.03717844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978198,0.00046012466,0.00012242235,0.0004963007,0.0008718094,0.00022957151],"domain_scores_gemma":[0.99530506,0.002163071,0.000372559,0.0012086342,0.0006608914,0.00028980288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017831807,0.0008953481,0.0015824136,0.0033304002,0.0017746725,0.005001777,0.0028144552,0.0016250459,0.012375429],"category_scores_gemma":[0.010436706,0.00061842805,0.0014845732,0.0037846824,0.0031549507,0.0151530495,0.004754602,0.004525773,0.0019278472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023012894,0.000013798304,0.00019348948,0.00004150431,0.000008593576,0.00003519276,0.000071254086,0.0010093279,0.0003684566,0.98983335,0.0019001806,0.0065018223],"study_design_scores_gemma":[0.0000048230745,0.0000051567968,0.00010874902,0.000008792174,0.000006828949,0.00008516001,0.000022561286,0.0075192526,0.0003367866,0.9891935,0.00269877,0.00000958881],"about_ca_topic_score_codex":0.0006988069,"about_ca_topic_score_gemma":0.0005046055,"teacher_disagreement_score":0.012375429,"about_ca_system_score_codex":0.0016995636,"about_ca_system_score_gemma":0.0007276672,"threshold_uncertainty_score":0.041399956},"labels":[],"label_agreement":null},{"id":"W4414537095","doi":"10.1007/s00493-025-00179-7","title":"Extension Property for Partial Automorphisms of the n-partite and Semigeneric Tournaments","year":2025,"lang":"lv","type":"article","venue":"COMBINATORICA","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Agence Nationale de la Recherche; Technische Universität Dresden; Deutsche Forschungsgemeinschaft; Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Tournament; Automorphism; Extension (predicate logic); Property (philosophy); Class (philosophy); Finite set","score_opus":0.026292804331246918,"score_gpt":0.30218853299806464,"score_spread":0.2758957286668177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414537095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7922116,0.00034590164,0.103129975,0.00068862893,0.00013238455,0.000098968085,0.000484998,0.0002700068,0.102637514],"genre_scores_gemma":[0.9905041,0.00010653496,0.003740025,0.000090266425,0.00009787802,0.0000452342,0.00023790203,0.00003076663,0.0051473677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991565,0.00015614214,0.00005190341,0.00023087562,0.00020608307,0.00019850858],"domain_scores_gemma":[0.99801826,0.0008853219,0.00019170271,0.00028659342,0.00026974644,0.00034844453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007772982,0.00036560828,0.00050925335,0.00072721345,0.0011583124,0.0016211779,0.00046180366,0.00045953758,0.007821541],"category_scores_gemma":[0.0022899953,0.0003471869,0.0015797595,0.00058605947,0.002193643,0.0024597216,0.0020477176,0.0018526184,0.0005219785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016684862,0.00005872968,0.0038408763,0.000090458656,0.000033689324,0.0004056965,0.0005566195,0.0021911424,0.004207561,0.9730377,0.0015589742,0.013851655],"study_design_scores_gemma":[0.000104864856,0.00017360719,0.008318928,0.000061848084,0.00005924311,0.0014695562,0.0003781922,0.014568288,0.005741305,0.95004517,0.019037826,0.000041136496],"about_ca_topic_score_codex":0.0007294769,"about_ca_topic_score_gemma":0.00052042154,"teacher_disagreement_score":0.007821541,"about_ca_system_score_codex":0.00084319816,"about_ca_system_score_gemma":0.00035869185,"threshold_uncertainty_score":0.026165605},"labels":[],"label_agreement":null},{"id":"W4414756345","doi":"10.1007/s00493-025-00181-z","title":"Average plane-size in complex-representable matroids","year":2025,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Digital Image Processing Techniques","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":"Matroid; Bounded function; Constant (computer programming); Rank (graph theory); Integer (computer science); Upper and lower bounds","score_opus":0.012517289125328734,"score_gpt":0.2742975333598036,"score_spread":0.2617802442344749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414756345","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7697467,0.0012725267,0.20043746,0.002438091,0.000117147334,0.00007565894,0.0012920301,0.00061295,0.024007414],"genre_scores_gemma":[0.97170883,0.0009397708,0.020180836,0.00018667386,0.00023776926,0.000107053624,0.00051235367,0.00020269673,0.0059240563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998961,0.0002712739,0.000047167636,0.00021463627,0.0002977509,0.00020823863],"domain_scores_gemma":[0.9872248,0.008221111,0.0015263954,0.00097429624,0.00077054,0.0012828995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013834535,0.00086531084,0.001472681,0.0017058711,0.0009860514,0.0044042864,0.0024482417,0.0016670575,0.008169633],"category_scores_gemma":[0.0129564265,0.00078308646,0.00061746396,0.0021699115,0.0020420204,0.0063107903,0.0018119247,0.0018905282,0.0005527086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063202274,0.0001710795,0.0040714582,0.0003188614,0.00010799669,0.00023380472,0.0003964954,0.12867251,0.009223742,0.81751585,0.008279704,0.030376524],"study_design_scores_gemma":[0.00006122465,0.00009401215,0.0018529233,0.000035035955,0.000051852574,0.00033178448,0.00014343126,0.24871929,0.0028851447,0.7434932,0.002304548,0.00002745329],"about_ca_topic_score_codex":0.0009886204,"about_ca_topic_score_gemma":0.0012751422,"teacher_disagreement_score":0.008169633,"about_ca_system_score_codex":0.0019409187,"about_ca_system_score_gemma":0.0006008802,"threshold_uncertainty_score":0.0273301},"labels":[],"label_agreement":null},{"id":"W4415991362","doi":"10.1007/s00493-025-00168-w","title":"The Grid-Minor Theorem Revisited","year":2025,"lang":"en","type":"article","venue":"COMBINATORICA","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":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; Monash University; Australian Government","keywords":"Treewidth; Graph minor; Planar graph; Graph; Upper and lower bounds; Existential quantification; Perfect graph; Chromatic scale","score_opus":0.010468888549975325,"score_gpt":0.2878532767963204,"score_spread":0.27738438824634504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415991362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38972083,0.002934741,0.5125925,0.003487718,0.00038145983,0.00013370681,0.0006444975,0.0011567406,0.088947855],"genre_scores_gemma":[0.95512533,0.00059330557,0.03561712,0.0006191628,0.00012452714,0.000094613,0.00026192813,0.00015057974,0.0074134027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999091,0.00011738736,0.00003052753,0.0003525467,0.00023381694,0.0001747701],"domain_scores_gemma":[0.997221,0.0014334195,0.00024111384,0.0005030761,0.0003296943,0.00027180166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009689318,0.00033873247,0.00059900753,0.0006974852,0.0010369868,0.0013153037,0.0015154508,0.0006863323,0.007197664],"category_scores_gemma":[0.0034976287,0.0003755639,0.000647956,0.00059942674,0.0023830894,0.0033236234,0.0024344411,0.0018645073,0.00079288846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024838728,0.000053808268,0.004128881,0.00021110794,0.00003379525,0.00028913567,0.00032695354,0.009803294,0.015702244,0.93554413,0.005735604,0.02792264],"study_design_scores_gemma":[0.0001111401,0.0003207761,0.006189163,0.000075584525,0.00006222444,0.002144659,0.0004561542,0.07872822,0.029767126,0.83286643,0.0492232,0.000055284112],"about_ca_topic_score_codex":0.0022382224,"about_ca_topic_score_gemma":0.0021614507,"teacher_disagreement_score":0.007197664,"about_ca_system_score_codex":0.0012786546,"about_ca_system_score_gemma":0.0005666423,"threshold_uncertainty_score":0.024078608},"labels":[],"label_agreement":null},{"id":"W4415991870","doi":"10.1007/s00493-025-00186-8","title":"Sunflowers in Set Systems with Small VC-Dimension","year":2025,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Illinois at Urbana-Champaign; American Institute of Mathematics; National Science Foundation","keywords":"Family of sets; Set (abstract data type); Function (biology); Conjecture; Generating function","score_opus":0.06503684596531571,"score_gpt":0.3303971572465832,"score_spread":0.26536031128126747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415991870","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6409376,0.0010998495,0.30932125,0.001112925,0.00025664395,0.0001463716,0.0009098641,0.0030419498,0.043173485],"genre_scores_gemma":[0.9576044,0.00019183973,0.029242417,0.00011777341,0.00008065558,0.00009123122,0.00034589457,0.0001176488,0.012208086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914086,0.00013881407,0.00006318507,0.00027835072,0.00017912811,0.00019966002],"domain_scores_gemma":[0.99814117,0.00087056874,0.00022294772,0.00032017485,0.0001739209,0.00027110838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081172324,0.00038855788,0.0006463071,0.0008752309,0.0010437185,0.0023380136,0.00077854324,0.00062954164,0.012890659],"category_scores_gemma":[0.0030937777,0.0003453977,0.0005691059,0.0005524465,0.0014024944,0.0036533598,0.0019886077,0.0009983795,0.00096293475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005219652,0.000111641515,0.0021381576,0.00016948444,0.000043141707,0.00038090927,0.00049813394,0.045419335,0.013139504,0.88192093,0.0058261785,0.04983057],"study_design_scores_gemma":[0.00016603437,0.00015449886,0.0014864069,0.000071864815,0.000043892054,0.00040254445,0.00020810965,0.26048976,0.012299829,0.695131,0.029477615,0.00006848945],"about_ca_topic_score_codex":0.0014437016,"about_ca_topic_score_gemma":0.0013189067,"teacher_disagreement_score":0.012890659,"about_ca_system_score_codex":0.0016639932,"about_ca_system_score_gemma":0.000635181,"threshold_uncertainty_score":0.043123603},"labels":[],"label_agreement":null}]}