{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":219,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":219,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"d7e185dcc2e7","filters":{"venue":"European Journal of Combinatorics"}},"results":[{"id":"W2047595535","doi":"10.1016/j.ejc.2008.01.002","title":"Equiangular lines, mutually unbiased bases, and spin models","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":168,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Mathematics; Mutually unbiased bases; Combinatorics; Conjecture; Prime (order theory); Commutative property; Association scheme; Prime power; Discrete mathematics; Pure mathematics; Hilbert space","authors":[{"name":"Chris Godsil","is_ca":true},{"name":"Aidan Roy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01916857852181212,"gpt":0.1819355989369194,"spread":0.1627670204151073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009818878,0.0003486264,0.0005834277,0.001411167,0.001522558,0.002255472,0.0007747765,0.001490203,0.007410236],"category_scores_gemma":[0.003059755,0.0002821653,0.0003651825,0.0009663578,0.0022411,0.002907443,0.001337043,0.001591303,0.0008505766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005939006,"about_ca_system_score_gemma":0.0004670041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000824065,"about_ca_topic_score_gemma":0.001120244,"domain_scores_codex":[0.9993845,0.0002143252,0.00002378046,0.00008028349,0.0001545623,0.0001424587],"domain_scores_gemma":[0.9985597,0.0005311904,0.0002503805,0.0002547123,0.0002306026,0.0001735419],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002000621,0.00001443278,0.0001111658,0.000007148738,0.000003063815,0.00002833173,0.00005497867,0.001000467,0.0002392786,0.9955296,0.0005930959,0.002398446],"study_design_scores_gemma":[0.000008675373,0.000007491617,0.00005641032,0.000006369633,0.000002681693,0.00004007957,0.00005198715,0.005500792,0.0001469789,0.9933669,0.0008057255,0.000005915515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6103439,0.001366849,0.2205088,0.00347849,0.0002724779,0.00007066607,0.0003378781,0.0002968747,0.163324],"genre_scores_gemma":[0.9710758,0.000451619,0.012039,0.0005578745,0.000186466,0.00006466346,0.000156557,0.0000525968,0.01541552],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007410236,"threshold_uncertainty_score":0.02478969,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2913518517","doi":"10.1016/j.ejc.2008.04.006","title":"Palindromic richness","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":151,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Palindrome; Conjecture; Mathematics; Class (philosophy); Word (group theory); Combinatorics; Property (philosophy); Sequence (biology); Pure mathematics; Computer science; Artificial intelligence","authors":[{"name":"Amy Glen","is_ca":true},{"name":"Jacques Justin","is_ca":false},{"name":"Steve Widmer","is_ca":false},{"name":"Luca Q. Zamboni","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01561513954250889,"gpt":0.1937676582586337,"spread":0.1781525187161248,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001267583,0.0006163145,0.00133067,0.002282084,0.002652851,0.004275796,0.0009598722,0.0009786936,0.02176339],"category_scores_gemma":[0.003725098,0.0006008295,0.001209832,0.001730628,0.00368428,0.01045702,0.004335294,0.003326277,0.002992325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009338381,"about_ca_system_score_gemma":0.0004637166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002096535,"about_ca_topic_score_gemma":0.0002190718,"domain_scores_codex":[0.9984043,0.0003392012,0.0001329004,0.0005063366,0.000383705,0.0002334978],"domain_scores_gemma":[0.9971468,0.001262295,0.0002220544,0.0007113029,0.0003620159,0.000295569],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001535847,0.000008727323,0.00008851457,0.00002200096,0.000004172785,0.00003441277,0.0001623996,0.00007695305,0.0003808423,0.9949183,0.0006641338,0.003624074],"study_design_scores_gemma":[0.000009170837,0.0000107854,0.0001433354,0.000008962154,0.000009728679,0.0002265203,0.00007917296,0.0004315079,0.0004032926,0.991546,0.007124041,0.000007465685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2064551,0.001815835,0.2091031,0.004499907,0.0006046887,0.0001063149,0.0009873612,0.001011442,0.5754163],"genre_scores_gemma":[0.9240908,0.0007109314,0.02181737,0.0006383039,0.0006007171,0.00009392554,0.0005772202,0.0002881991,0.05118258],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02176339,"threshold_uncertainty_score":0.07280576,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2084490360","doi":"10.1016/j.ejc.2003.10.006","title":"Stable sets of maximal size in Kneser-type graphs","year":2003,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":123,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Combinatorics; Automorphism; Transitive relation; Vertex (graph theory); Indifference graph; Chordal graph; Maximal independent set; Discrete mathematics; 1-planar graph; Graph","authors":[{"name":"Benoît Larose","is_ca":true},{"name":"Claudia Malvenuto","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02711403822394142,"gpt":0.2683398913297358,"spread":0.2412258531057944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001748914,0.0005203632,0.001679624,0.004415252,0.004828636,0.007291062,0.002499172,0.002214347,0.006254718],"category_scores_gemma":[0.01060338,0.001723737,0.001276551,0.00351749,0.005275998,0.01041565,0.003510095,0.002440464,0.0005776429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001974129,"about_ca_system_score_gemma":0.0008739966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009871023,"about_ca_topic_score_gemma":0.001783648,"domain_scores_codex":[0.998295,0.0003557124,0.0001312339,0.000358825,0.0005680678,0.0002911618],"domain_scores_gemma":[0.9863067,0.009587063,0.001283518,0.00087341,0.0006922819,0.001257078],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001998518,0.00004745276,0.00122716,0.00008047168,0.00002247351,0.0001588563,0.0009767463,0.002337587,0.002187239,0.9882465,0.0007362673,0.003779308],"study_design_scores_gemma":[0.00003901227,0.00001735162,0.0004895892,0.00001725301,0.00002788134,0.0001968516,0.0003456025,0.005120364,0.001322369,0.9915141,0.000888753,0.00002087452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8766068,0.0006924435,0.07381462,0.001330547,0.00008397745,0.00006466805,0.0006343386,0.0005364941,0.04623611],"genre_scores_gemma":[0.9778022,0.0002962926,0.01408721,0.0001339474,0.0001054478,0.0001359508,0.0003365029,0.0001036118,0.006998781],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007291062,"threshold_uncertainty_score":0.02092415,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134206798","doi":"10.1016/j.ejc.2011.01.016","title":"On the asymptotic proportion of connected matroids","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Marsden Fund; Foundation for Research, Science and Technology","keywords":"Matroid; Mathematics; Combinatorics; Conjecture; Asymptotically optimal algorithm; Automorphism group; Discrete mathematics; Automorphism","authors":[{"name":"Dillon Mayhew","is_ca":false},{"name":"Mike Newman","is_ca":true},{"name":"Dominic Welsh","is_ca":false},{"name":"Geoff Whittle","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03805669037780503,"gpt":0.2392331797498589,"spread":0.2011764893720538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005179642,0.0009922888,0.002581578,0.005018034,0.002580266,0.007299046,0.004780614,0.003084974,0.01949605],"category_scores_gemma":[0.07564776,0.001554914,0.001144296,0.003694048,0.005367964,0.01150344,0.005170019,0.004441923,0.002245454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003040664,"about_ca_system_score_gemma":0.0009575489,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001127689,"about_ca_topic_score_gemma":0.001057019,"domain_scores_codex":[0.9954637,0.001764594,0.0001732499,0.000873571,0.001185551,0.0005394388],"domain_scores_gemma":[0.9232267,0.0616955,0.003764482,0.00446663,0.003446437,0.003400318],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009418527,0.0002094437,0.01277673,0.0005507838,0.0001530904,0.0003309583,0.000960322,0.03687952,0.00687184,0.8921704,0.01352019,0.0346349],"study_design_scores_gemma":[0.0001076981,0.0001020103,0.004871988,0.0001620799,0.000122276,0.001237859,0.0004125225,0.1714218,0.002877423,0.8128333,0.005784106,0.0000668964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7161983,0.004987273,0.165467,0.009822017,0.000489337,0.0001147082,0.002136775,0.001365219,0.09941942],"genre_scores_gemma":[0.961355,0.00276248,0.01801404,0.0009377928,0.001104155,0.0002609769,0.001391316,0.0008284517,0.01334563],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01949605,"threshold_uncertainty_score":0.06522077,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1995234636","doi":"10.1016/j.ejc.2008.05.006","title":"A new proof of the Erdős–Ko–Rado theorem for intersecting families of permutations","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":82,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Coset; Symmetric group; Point (geometry); Upper and lower bounds; Discrete mathematics; Geometry","authors":[{"name":"Chris Godsil","is_ca":true},{"name":"Karen Meagher","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0373681242687923,"gpt":0.2692964400335086,"spread":0.2319283157647163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002643144,0.001764533,0.002041228,0.005022913,0.002450729,0.003409215,0.002307002,0.002178104,0.01424417],"category_scores_gemma":[0.008704247,0.000990381,0.002737364,0.003373653,0.004417854,0.01133045,0.007050157,0.007619198,0.002599529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001905462,"about_ca_system_score_gemma":0.0009498292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008951805,"about_ca_topic_score_gemma":0.0009259785,"domain_scores_codex":[0.9983954,0.0003611907,0.0001409934,0.0003936626,0.0005378585,0.000170924],"domain_scores_gemma":[0.9945281,0.002871088,0.0004103482,0.0008233137,0.0009351675,0.0004319781],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003927751,0.00004939653,0.0003790487,0.0002093761,0.00003584245,0.0002195668,0.0003035622,0.001073049,0.001573362,0.9730045,0.00597128,0.01714177],"study_design_scores_gemma":[0.00002506433,0.00002656319,0.000398656,0.00006276942,0.00005763106,0.0004319113,0.00009816144,0.005285912,0.0008508506,0.9654656,0.02725135,0.00004544411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05788928,0.006495838,0.7300163,0.01081277,0.003822852,0.000161862,0.00114156,0.00111229,0.1885472],"genre_scores_gemma":[0.638605,0.01017553,0.2808945,0.005828471,0.004974871,0.0005432424,0.001289623,0.001044177,0.05664467],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01424417,"threshold_uncertainty_score":0.04765147,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1695953772","doi":"10.1016/j.ejc.2015.06.005","title":"Improved complexity results on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-coloring <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si5.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math>-free graphs","year":2015,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph coloring; Vertex (graph theory); Complete coloring; Graph; Induced subgraph; Discrete mathematics; Line graph","authors":[{"name":"Shenwei Huang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03197586937708036,"gpt":0.2621459650223334,"spread":0.230170095645253,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002026599,0.002447865,0.001615229,0.004028005,0.002402029,0.004852225,0.00455607,0.001969866,0.05757092],"category_scores_gemma":[0.01369256,0.0007714138,0.003084515,0.004540087,0.002357922,0.01086248,0.004766167,0.007560912,0.01412159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005582985,"about_ca_system_score_gemma":0.002795662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009384505,"about_ca_topic_score_gemma":0.02020611,"domain_scores_codex":[0.9964964,0.0006671802,0.0001736976,0.0006601111,0.001312131,0.000690447],"domain_scores_gemma":[0.9827544,0.01002923,0.0007648499,0.003498822,0.002040931,0.0009116966],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001225003,0.0007128338,0.004662303,0.002505297,0.0003402681,0.0007763068,0.001018732,0.07673921,0.01203457,0.5304832,0.2260728,0.1434295],"study_design_scores_gemma":[0.0001728287,0.0001174152,0.003096717,0.0001660064,0.0002753166,0.0005643134,0.0002444878,0.08571781,0.005593181,0.8559584,0.04797719,0.0001163101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.09669913,0.007378155,0.3725759,0.02007934,0.002575384,0.0005557279,0.01249998,0.005181498,0.4824548],"genre_scores_gemma":[0.6015212,0.0061411,0.2155117,0.004312366,0.003596875,0.0009127773,0.01875661,0.00539052,0.1438569],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.05757092,"threshold_uncertainty_score":0.1925939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974623598","doi":"10.1016/j.ejc.2007.03.001","title":"On an involution of Christoffel words and Sturmian morphisms","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Modulo; Morphism; Christoffel symbols; Combinatorics on words; Involution (esoterism); Iterated function; Combinatorics; Automorphism; Endomorphism; Quotient; Palindrome; Discrete mathematics; Pure mathematics; Word (group theory)","authors":[{"name":"Valérie Berthé","is_ca":false},{"name":"Aldo de Luca","is_ca":false},{"name":"Christophe Reutenauer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01025562220827607,"gpt":0.226067542029621,"spread":0.2158119198213449,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001433097,0.0007616404,0.001002651,0.003133574,0.004196262,0.003240813,0.0009572475,0.001684881,0.005747616],"category_scores_gemma":[0.003026335,0.0006250464,0.001513901,0.002739854,0.005620833,0.00476937,0.003115746,0.0023246,0.0009302754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001959137,"about_ca_system_score_gemma":0.0007337015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001735282,"about_ca_topic_score_gemma":0.001574928,"domain_scores_codex":[0.9989674,0.000226775,0.00006572614,0.0001789597,0.0002346184,0.0003264703],"domain_scores_gemma":[0.998081,0.0009291047,0.0001807677,0.000194173,0.0003011722,0.0003138778],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000358582,0.00001548057,0.0001372805,0.0000115802,0.000004183192,0.0001401073,0.0005316109,0.0002437635,0.0005925641,0.9950767,0.0003012547,0.002909577],"study_design_scores_gemma":[0.000008946771,0.00001837307,0.0001787773,0.000008913285,0.000007819381,0.0001110998,0.0001450046,0.00115734,0.0004887195,0.9960352,0.001825011,0.00001481256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6907412,0.001620645,0.1572586,0.001555928,0.001074699,0.00004871533,0.0001616514,0.0004977343,0.1470409],"genre_scores_gemma":[0.9638668,0.0005615805,0.01227284,0.0002989332,0.0003680084,0.00003835408,0.0001164372,0.0001523489,0.02232465],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005747616,"threshold_uncertainty_score":0.01922768,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1989633733","doi":"10.1016/j.ejc.2010.04.001","title":"On a conjecture about the Szeged index","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":68,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Bipartite graph; Edge-transitive graph; Graph; Graph power; Discrete mathematics; Line graph","authors":[{"name":"Mustapha Aouchiche","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02010410939671536,"gpt":0.2738195751573895,"spread":0.2537154657606742,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003636757,0.001018576,0.002802122,0.003327617,0.004787707,0.007983197,0.003229719,0.004805596,0.01588949],"category_scores_gemma":[0.01783291,0.0008325149,0.001966668,0.004279269,0.01192021,0.01916118,0.006268078,0.008909581,0.002117348],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003299741,"about_ca_system_score_gemma":0.001292557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002004748,"about_ca_topic_score_gemma":0.001119207,"domain_scores_codex":[0.9975261,0.0005474826,0.0001522833,0.0007457173,0.0005539462,0.0004744655],"domain_scores_gemma":[0.988091,0.007695714,0.0009247469,0.00143913,0.0008468584,0.001002539],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001086088,0.00002710662,0.0003931637,0.00005297878,0.000009980075,0.00005948277,0.0003046789,0.0005847503,0.0002765542,0.9905759,0.004321276,0.003285386],"study_design_scores_gemma":[0.00002434581,0.00001019864,0.0001600814,0.00001477904,0.000007441618,0.00004046981,0.00005782539,0.001116405,0.0001126494,0.9966857,0.001758835,0.0000112165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4688133,0.00399485,0.1088956,0.07138227,0.005037286,0.000103499,0.0016961,0.001033119,0.3390439],"genre_scores_gemma":[0.951427,0.001567276,0.01422638,0.004700206,0.003860764,0.0001404834,0.001105509,0.0003317085,0.02264065],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01588949,"threshold_uncertainty_score":0.05315566,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2070037875","doi":"10.1016/j.ejc.2005.11.005","title":"Dejean’s conjecture and Sturmian words","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"University of Tehran","keywords":"Conjecture; Mathematics; Alphabet; Repetition (rhetorical device); Combinatorics; Word (group theory); Combinatorics on words; Quadratic equation; Discrete mathematics; Geometry; Linguistics","authors":[{"name":"Morteza Mohammad-Noori","is_ca":false},{"name":"James D. Currie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00414040258297324,"gpt":0.1786910934205255,"spread":0.1745506908375522,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001820548,0.0008047382,0.001576888,0.001964695,0.005162189,0.003489655,0.001418316,0.003714751,0.01148304],"category_scores_gemma":[0.006143414,0.000787481,0.001355664,0.002253833,0.006910946,0.01129159,0.003559091,0.003963433,0.001369278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002068095,"about_ca_system_score_gemma":0.0008588585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002266249,"about_ca_topic_score_gemma":0.002714845,"domain_scores_codex":[0.9987986,0.0003113012,0.00007010549,0.0003420873,0.0002198057,0.0002581216],"domain_scores_gemma":[0.9970151,0.001778534,0.0001697358,0.0004528162,0.0003589563,0.000224905],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004320101,0.0000146459,0.0001541562,0.00002141225,0.00000470024,0.00005823508,0.0002416458,0.0003327723,0.0001330786,0.9948992,0.002054821,0.002042112],"study_design_scores_gemma":[0.00001020215,0.000004486222,0.0000824141,0.000004665595,0.000003149808,0.00003333802,0.00005630899,0.000545606,0.00006877601,0.9968448,0.002340211,0.000005930703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.438769,0.003796401,0.08683373,0.0370162,0.002338071,0.00006335269,0.0006831082,0.0005597706,0.4299403],"genre_scores_gemma":[0.9521302,0.0007216901,0.01120913,0.002815609,0.0009741939,0.00008596045,0.0004475586,0.00009262704,0.03152296],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01148304,"threshold_uncertainty_score":0.0384146,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146959334","doi":"10.1016/j.ejc.2007.11.012","title":"A dichotomy for minimum cost graph homomorphisms","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Mathematics; Combinatorics; Graph; Graph homomorphism; Discrete mathematics; Vertex (graph theory); Algebra homomorphism; Line graph; Graph power","authors":[{"name":"Gregory Gutin","is_ca":false},{"name":"Pavol Hell","is_ca":true},{"name":"Arash Rafiey","is_ca":true},{"name":"Anders Yeo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0400559946199954,"gpt":0.2741690628301987,"spread":0.2341130682102033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00325734,0.001281758,0.003179847,0.002548046,0.003426527,0.008133502,0.004640635,0.005881261,0.02212307],"category_scores_gemma":[0.02169432,0.001426413,0.001943959,0.003076507,0.005419374,0.01898648,0.007264507,0.01103671,0.002195683],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003952605,"about_ca_system_score_gemma":0.00149672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006697451,"about_ca_topic_score_gemma":0.0005568537,"domain_scores_codex":[0.9964615,0.001050532,0.0001443536,0.0008498632,0.000841087,0.0006526884],"domain_scores_gemma":[0.9764245,0.0187992,0.0008031935,0.001613483,0.0006789113,0.001680703],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002880353,0.0001407648,0.000334481,0.0002140107,0.0000287341,0.0000699871,0.0002538305,0.004174164,0.001144114,0.9697382,0.008871938,0.01474177],"study_design_scores_gemma":[0.00005237043,0.00002780832,0.0001205674,0.00002060401,0.0000150088,0.00007059758,0.00005241655,0.01108717,0.0002223059,0.9871221,0.001198645,0.00001048189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4528995,0.003617724,0.3350046,0.04944945,0.001051747,0.0002621092,0.002003561,0.001586067,0.1541254],"genre_scores_gemma":[0.9201861,0.001743358,0.04786138,0.003605007,0.00135265,0.0005181956,0.001160529,0.0004580309,0.02311479],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02212307,"threshold_uncertainty_score":0.07400906,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153268570","doi":"10.1016/j.ejc.2005.05.001","title":"Sphere packings revisited","year":2005,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Hungarian Science Foundation","keywords":"Mathematics; Combinatorics; Isoperimetric inequality; Conjecture; Discrete geometry; Regular polygon; SPHERES; Dodecahedron; Polyhedron; Voronoi diagram; Constant curvature; Curvature; Geometry; Physics","authors":[{"name":"Károly Bezdek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04658571231293762,"gpt":0.2953418779338797,"spread":0.2487561656209421,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001024522,0.000867537,0.001685251,0.002580968,0.002465198,0.004859956,0.001753568,0.003209203,0.01583062],"category_scores_gemma":[0.00633911,0.0007038765,0.001135235,0.003736078,0.004264892,0.007305706,0.004718658,0.005294145,0.00208164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001823083,"about_ca_system_score_gemma":0.0006288044,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002623077,"about_ca_topic_score_gemma":0.001789302,"domain_scores_codex":[0.9986865,0.0004126669,0.0000592947,0.000239811,0.0003781003,0.0002236651],"domain_scores_gemma":[0.9975915,0.001135983,0.0003054811,0.0003777375,0.0002976508,0.0002916122],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008927204,0.000004216454,0.00007156003,0.00001530366,0.000003936589,0.00003154551,0.00008266135,0.0005916998,0.00008009811,0.9936179,0.002548305,0.002943797],"study_design_scores_gemma":[0.000006543156,0.0000056258,0.0001924745,0.00001860299,0.000006155848,0.0001399641,0.0001257218,0.003776885,0.0001168663,0.9874772,0.008127674,0.000006231382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2265795,0.01484219,0.1626435,0.03203017,0.002813508,0.0000693945,0.0007786983,0.0004237907,0.5598193],"genre_scores_gemma":[0.8985885,0.005849664,0.02162869,0.002668754,0.002351018,0.00008566838,0.0005023751,0.0002105699,0.06811472],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01583062,"threshold_uncertainty_score":0.05295873,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973866695","doi":"10.1016/j.ejc.2009.11.019","title":"Combinatorial characterization of the Assur graphs from engineering","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Terminology; Mathematics; Rigidity (electromagnetism); Characterization (materials science); Combinatorics; Graph theory; Kinematics; Discrete mathematics; Linguistics; Engineering","authors":[{"name":"Brigitte Servatius","is_ca":false},{"name":"Offer Shai","is_ca":false},{"name":"Walter Whiteley","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.003883127762864689,"gpt":0.1538509751646961,"spread":0.1499678474018314,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005020548,0.001234048,0.0007325658,0.003471923,0.001609784,0.002682681,0.001157293,0.001156781,0.01127078],"category_scores_gemma":[0.003054564,0.0005252535,0.001036755,0.002093365,0.001741157,0.0032114,0.00179855,0.002168508,0.001207989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007733845,"about_ca_system_score_gemma":0.0005229596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001144104,"about_ca_topic_score_gemma":0.001122372,"domain_scores_codex":[0.9993361,0.0001942252,0.0000281651,0.0001290557,0.0002353398,0.00007727854],"domain_scores_gemma":[0.9973025,0.001307173,0.0003785392,0.0003563091,0.0004191442,0.0002361735],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006094197,0.00004940161,0.0008696519,0.0001415344,0.00001810419,0.0002216033,0.0003228882,0.00698901,0.003130451,0.9624593,0.002698523,0.02303864],"study_design_scores_gemma":[0.00001121525,0.0000474335,0.001140562,0.00004617202,0.00002738212,0.000412418,0.0002616472,0.02622457,0.002551613,0.9531322,0.01612499,0.00001987455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4544084,0.001525735,0.3137232,0.002679284,0.0002354917,0.0002182949,0.001208789,0.0005462972,0.2254544],"genre_scores_gemma":[0.9050924,0.00154402,0.05855319,0.0007633494,0.0003813809,0.0001601377,0.002060786,0.0002708592,0.03117386],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01127078,"threshold_uncertainty_score":0.03770447,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121495542","doi":"10.1016/j.ejc.2006.06.024","title":"Divisibility of countable metric spaces","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Divisibility rule; Countable set; Metric space; Combinatorics; Metric (unit); Pure mathematics; Discrete mathematics","authors":[{"name":"Christian Delhommé","is_ca":false},{"name":"Claude Laflamme","is_ca":true},{"name":"Maurice Pouzet","is_ca":false},{"name":"Norbert Sauer","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02242475217081205,"gpt":0.2816058676378148,"spread":0.2591811154670027,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002280419,0.0009515954,0.001565742,0.003883137,0.00358059,0.005707561,0.002021361,0.001623552,0.006808084],"category_scores_gemma":[0.009027643,0.001110323,0.001429383,0.002327197,0.008556858,0.01277689,0.006740244,0.005370507,0.0004963285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002391802,"about_ca_system_score_gemma":0.0006686497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007418607,"about_ca_topic_score_gemma":0.0006362458,"domain_scores_codex":[0.9981128,0.0005072427,0.0001367742,0.00051471,0.0004881288,0.0002403052],"domain_scores_gemma":[0.9904159,0.005559479,0.0008522798,0.001201971,0.0008025295,0.00116776],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005709225,0.00001835519,0.0004213665,0.00004215126,0.00001647396,0.00009463154,0.0004717594,0.0005006097,0.0005611232,0.995533,0.0002785434,0.00200486],"study_design_scores_gemma":[0.00001180299,0.0000112906,0.000200714,0.000007391038,0.000005503491,0.00009377154,0.00008654794,0.001008364,0.0001841002,0.9974442,0.0009389409,0.000007391666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7732889,0.002526227,0.1140366,0.004333775,0.0002672701,0.00005969088,0.0004508906,0.0002592037,0.1047776],"genre_scores_gemma":[0.9746979,0.0007269796,0.00729638,0.0001877711,0.0003081825,0.00006649029,0.0003432695,0.00007983402,0.0162932],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006808084,"threshold_uncertainty_score":0.02277529,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1989100100","doi":"10.1016/j.ejc.2010.11.004","title":"Uniform approximation and Bernstein polynomials with coefficients in the unit interval","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Bernstein polynomial; Interval (graph theory); Unit interval; Polynomial; Degree (music); Interval arithmetic; Discrete mathematics; Combinatorics; Applied mathematics; Mathematical analysis","authors":[{"name":"Weikang Qian","is_ca":false},{"name":"Marc D. Riedel","is_ca":false},{"name":"Ivo G. Rosenberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03429918784590631,"gpt":0.2252314303177882,"spread":0.1909322424718819,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002943111,0.000805142,0.001190423,0.001701932,0.0007394359,0.002543171,0.002014548,0.001170943,0.006930711],"category_scores_gemma":[0.02339988,0.0004845192,0.0007768468,0.001948974,0.002745283,0.004034518,0.002481875,0.003524614,0.001101039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001726982,"about_ca_system_score_gemma":0.0009405526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002991977,"about_ca_topic_score_gemma":0.001870045,"domain_scores_codex":[0.997951,0.0008343823,0.00005781659,0.0002624265,0.0005470596,0.0003473673],"domain_scores_gemma":[0.9921499,0.005228259,0.0006367969,0.0004873334,0.0009666591,0.0005309691],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001004938,0.0000186236,0.0003104692,0.00005820305,0.00001211438,0.00004821546,0.0001210899,0.01142689,0.0007897436,0.9752935,0.001108721,0.01071189],"study_design_scores_gemma":[0.00003271937,0.00003766522,0.0003278305,0.00003824392,0.00001608679,0.0001219984,0.00009787091,0.135889,0.0005689522,0.8602324,0.002608357,0.00002893097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1582844,0.003370543,0.7918451,0.00178911,0.0003289806,0.00004275404,0.000269315,0.0002073019,0.04386242],"genre_scores_gemma":[0.896226,0.003047923,0.08044817,0.0003002076,0.0005055922,0.00008570053,0.0003461975,0.0001747312,0.01886551],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006930711,"threshold_uncertainty_score":0.02318555,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119307154","doi":"10.1016/j.ejc.2012.10.008","title":"Resolving sets for Johnson and Kneser graphs","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina; Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Chordal graph; Indifference graph; Discrete mathematics; Metric dimension; 1-planar graph; Graph","authors":[{"name":"R. A. Bailey","is_ca":true},{"name":"José Cáceres","is_ca":false},{"name":"Delia Garijo","is_ca":false},{"name":"Antonio González","is_ca":false},{"name":"Alberto Márquez","is_ca":false},{"name":"Karen Meagher","is_ca":true},{"name":"María Luz Puertas","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01434686287249292,"gpt":0.2139818547159782,"spread":0.1996349918434853,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00193385,0.001084212,0.001893704,0.004581317,0.008790053,0.01055028,0.002904507,0.003429743,0.02021216],"category_scores_gemma":[0.0105852,0.00172241,0.002148601,0.005463543,0.004524122,0.01276949,0.00574999,0.005635476,0.002658267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002256265,"about_ca_system_score_gemma":0.001656632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002927005,"about_ca_topic_score_gemma":0.003800074,"domain_scores_codex":[0.9966989,0.0008065806,0.0002590842,0.0006191831,0.0009665316,0.0006496125],"domain_scores_gemma":[0.9933078,0.004086374,0.0006184441,0.0008364732,0.0004916702,0.0006591546],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002952,0.00004971963,0.0001445972,0.0000435284,0.00001246368,0.00007845034,0.0004854396,0.001059365,0.0003216504,0.9912157,0.001699267,0.004860234],"study_design_scores_gemma":[0.00001124621,0.000005876089,0.0000918735,0.00001600525,0.00001933914,0.00007932486,0.0002191669,0.002008328,0.0003323288,0.9931225,0.004077496,0.00001643727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3360404,0.003156447,0.3303786,0.006151035,0.0007191487,0.0003005847,0.001557814,0.001502919,0.3201931],"genre_scores_gemma":[0.8126265,0.002176106,0.1032122,0.001688532,0.0006897891,0.0003371447,0.002178461,0.0007224606,0.07636885],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02021216,"threshold_uncertainty_score":0.06761646,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975911106","doi":"10.1016/j.ejc.2007.04.018","title":"Deterministic random walks on the integers","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Theoretical and Computational Physics","field":"Physics and Astronomy","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Random walk; Vertex (graph theory); Graph; Discrete mathematics; Path (computing); Constant (computer programming); Statistics; Computer science","authors":[{"name":"Joshua Cooper","is_ca":false},{"name":"Benjamin Doerr","is_ca":false},{"name":"Joel Spencer","is_ca":false},{"name":"Gábor Tardos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007934329050717573,"gpt":0.2171063312910351,"spread":0.2091720022403175,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001269729,0.0005888405,0.0009072211,0.001541252,0.0008601644,0.003326123,0.001104821,0.001456171,0.004858665],"category_scores_gemma":[0.01164284,0.0005816682,0.0004870895,0.001379556,0.001738234,0.003961822,0.001450034,0.001649259,0.0006709203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001412525,"about_ca_system_score_gemma":0.0007244449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000978434,"about_ca_topic_score_gemma":0.001222563,"domain_scores_codex":[0.9987015,0.0004927707,0.000071262,0.0002456316,0.0002383949,0.000250424],"domain_scores_gemma":[0.9902337,0.007120229,0.0009772186,0.0007527877,0.0003892154,0.0005269731],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009982753,0.00001935691,0.0003431498,0.00005031592,0.000008858219,0.00005655186,0.00006071371,0.01431156,0.0005433656,0.9787804,0.001021262,0.004704682],"study_design_scores_gemma":[0.00006541016,0.00002223947,0.0002516373,0.00003091883,0.00001170153,0.0000738154,0.00003226128,0.08633321,0.0003580312,0.9099023,0.002896576,0.00002179167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4744515,0.003451383,0.4670675,0.005038443,0.0004480389,0.0001559011,0.001544794,0.000693747,0.04714862],"genre_scores_gemma":[0.9455699,0.001616773,0.03270546,0.0003640113,0.0002524763,0.0001533908,0.0004637407,0.000111362,0.01876292],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004858665,"threshold_uncertainty_score":0.01625389,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083711510","doi":"10.1016/j.ejc.2007.04.015","title":"Colorful subgraphs in Kneser-like graphs","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Generalization; Bipartite graph; Vertex (graph theory); Chromatic scale; Robertson–Seymour theorem; Discrete mathematics; Chordal graph; Graph; 1-planar graph","authors":[{"name":"Gábor Simonyi","is_ca":false},{"name":"Gábor Tardos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01183428605431537,"gpt":0.2289304178246546,"spread":0.2170961317703392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005894307,0.0004863219,0.0007268029,0.002249877,0.001929493,0.003180501,0.001106719,0.001313034,0.005735261],"category_scores_gemma":[0.004723576,0.0008793393,0.0006379979,0.00238716,0.001716628,0.004395301,0.001757057,0.001432408,0.000657859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007095863,"about_ca_system_score_gemma":0.0004555349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001258469,"about_ca_topic_score_gemma":0.002658248,"domain_scores_codex":[0.9992608,0.0001700383,0.00004347391,0.0001989607,0.0002073393,0.0001192509],"domain_scores_gemma":[0.9952749,0.002330305,0.0008004113,0.0005891183,0.0003474536,0.0006578938],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002860632,0.0001499129,0.005554135,0.0001737142,0.00003722581,0.0008101278,0.001720094,0.008757829,0.007494241,0.951605,0.00315576,0.02025593],"study_design_scores_gemma":[0.00002877935,0.00003204228,0.00151902,0.00002162117,0.00004704895,0.0006749491,0.0004513583,0.01885828,0.002056248,0.9735847,0.00270128,0.00002465161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8754423,0.0002926618,0.09597225,0.0008156882,0.000055312,0.00006351108,0.0004915996,0.000930694,0.02593595],"genre_scores_gemma":[0.9709986,0.0002264755,0.02001781,0.0001928212,0.00005264446,0.00004797686,0.0005833187,0.0001598297,0.007720535],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005735261,"threshold_uncertainty_score":0.01918632,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065521247","doi":"10.1016/j.ejc.2007.11.017","title":"Generalised dualities and maximal finite antichains in the homomorphism order of relational structures","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Homomorphism; Finitary; Digraph; Mathematics; Duality (order theory); Algebra homomorphism; Order (exchange); Discrete mathematics; Combinatorics; Partially ordered set; Treewidth; Pathwidth; Graph","authors":[{"name":"Jan Foniok","is_ca":false},{"name":"Jaroslav Nešetřil","is_ca":false},{"name":"Claude Tardif","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04494834000764881,"gpt":0.2553175102867368,"spread":0.210369170279088,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001883884,0.0004450934,0.0009518539,0.002178546,0.002916042,0.006385967,0.001242726,0.001392648,0.005125025],"category_scores_gemma":[0.004706882,0.00116651,0.001206634,0.001614903,0.005775989,0.01071729,0.003149296,0.00426912,0.0005234285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001930491,"about_ca_system_score_gemma":0.0008934486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001682246,"about_ca_topic_score_gemma":0.003170419,"domain_scores_codex":[0.998027,0.0006141343,0.0001718907,0.0004769541,0.0003641315,0.0003457848],"domain_scores_gemma":[0.9949211,0.002422916,0.0005508221,0.0007218575,0.0006921384,0.0006910831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005243031,0.00002580741,0.0004336577,0.00002595595,0.000008411753,0.00009503215,0.0006659701,0.0002194392,0.0009328547,0.994873,0.000151225,0.002516218],"study_design_scores_gemma":[0.0000195068,0.00001513436,0.0003324657,0.00001506629,0.0000157938,0.0001119514,0.0002491994,0.001192578,0.0008535563,0.9959895,0.001191812,0.00001344718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7798339,0.001110883,0.1467607,0.001394146,0.0002082847,0.00008216898,0.0004697907,0.0003534405,0.06978665],"genre_scores_gemma":[0.9703928,0.0002160081,0.02122331,0.0001957775,0.0001108777,0.00004542044,0.0002617158,0.00007488364,0.007479251],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006385967,"threshold_uncertainty_score":0.01714486,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963693997","doi":"10.1016/j.ejc.2013.06.043","title":"Graph partitions with prescribed patterns","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Induced subgraph isomorphism problem; Graph homomorphism; Homomorphism; Partition (number theory); Induced subgraph; Discrete mathematics; Graph; Distance-hereditary graph; Factor-critical graph; Line graph; Voltage graph","authors":[{"name":"Pavol Hell","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01618968927603948,"gpt":0.2311268041165678,"spread":0.2149371148405283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007791838,0.0006836734,0.001043847,0.001765,0.002522422,0.003495427,0.001422853,0.001940694,0.01583093],"category_scores_gemma":[0.005823727,0.0009390863,0.001344154,0.001846202,0.002436052,0.003729136,0.003507324,0.00222069,0.003250147],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001055558,"about_ca_system_score_gemma":0.001026784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008148483,"about_ca_topic_score_gemma":0.001398514,"domain_scores_codex":[0.9981731,0.000392256,0.0001455721,0.0004035459,0.0005103328,0.0003751378],"domain_scores_gemma":[0.9956874,0.00131694,0.0003928719,0.001397494,0.0006339088,0.0005713425],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001968028,0.00007988264,0.0007583366,0.0001083916,0.00002091094,0.0002928184,0.000460446,0.002635384,0.004850025,0.9687008,0.004832946,0.0170631],"study_design_scores_gemma":[0.00006043467,0.00003543297,0.0005066352,0.00003389312,0.00002164873,0.0004394717,0.0002581116,0.01219852,0.00302404,0.9763198,0.007083884,0.00001819723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.478141,0.000365262,0.3529273,0.001919656,0.000503138,0.0004233535,0.001645043,0.001727448,0.1623479],"genre_scores_gemma":[0.8314406,0.0004022971,0.1165431,0.0005991432,0.0001598025,0.0005033867,0.001971316,0.0008924203,0.04748795],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01583093,"threshold_uncertainty_score":0.05295974,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983401788","doi":"10.1016/j.ejc.2010.08.002","title":"Vertex-coloring 2-edge-weighting of graphs","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Thompson Rivers University","funders":"Nankai University","keywords":"Combinatorics; Mathematics; Edge coloring; Bipartite graph; Vertex (graph theory); Weighting; Discrete mathematics; Complete coloring; Graph coloring; Fractional coloring; Edge cover; Graph; Graph power; Line graph; Physics","authors":[{"name":"Hongliang Lu","is_ca":false},{"name":"Qinglin Yu","is_ca":true},{"name":"Cun‐Quan Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00992254455779144,"gpt":0.2044921355836255,"spread":0.1945695910258341,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001666302,0.0009819996,0.001326285,0.001781436,0.001216265,0.002439031,0.002512935,0.001317532,0.005255909],"category_scores_gemma":[0.007974883,0.0007784527,0.000777439,0.002685648,0.001112741,0.003493536,0.001937298,0.00159395,0.0006821316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001586296,"about_ca_system_score_gemma":0.0007838244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002473815,"about_ca_topic_score_gemma":0.003549934,"domain_scores_codex":[0.9986284,0.0005283871,0.00006711009,0.0002754652,0.0002581433,0.0002425782],"domain_scores_gemma":[0.9950447,0.002205593,0.0004953038,0.001136913,0.0005525179,0.0005649307],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007235257,0.0004047124,0.007230715,0.0004920554,0.0001544421,0.0002137951,0.0005373373,0.1346569,0.01542024,0.656422,0.01543873,0.1683056],"study_design_scores_gemma":[0.0000520074,0.00006147701,0.001523443,0.00004034819,0.00006210571,0.0001649737,0.0001404853,0.2835532,0.004367365,0.7041999,0.005807159,0.00002747915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4387838,0.0007619894,0.5354197,0.0009419607,0.0001834769,0.0001372509,0.0008792348,0.000693296,0.02219922],"genre_scores_gemma":[0.7621334,0.0004270602,0.2185587,0.0003339548,0.000135793,0.000141332,0.001197185,0.0004466283,0.01662599],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005255909,"threshold_uncertainty_score":0.01758277,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033843939","doi":"10.1016/j.ejc.2003.07.007","title":"Embedding grids in surfaces","year":2004,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Embedding; Mathematics; Grid; Combinatorics; Surface (topology); Minor (academic); Square tiling; Graph; Discrete mathematics; Geometry; Computer science; Artificial intelligence","authors":[{"name":"Jim Geelen","is_ca":true},{"name":"R. Bruce Richter","is_ca":true},{"name":"Gelasio Salazar","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01319359694265675,"gpt":0.2423519576016498,"spread":0.2291583606589931,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003093407,0.0005567558,0.0006002111,0.001290557,0.0007118155,0.002071278,0.0006600124,0.0007904202,0.01061219],"category_scores_gemma":[0.001869121,0.0005550951,0.0005064472,0.001008396,0.001377779,0.002216994,0.002632927,0.002120618,0.002158715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006158685,"about_ca_system_score_gemma":0.0002467014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009876724,"about_ca_topic_score_gemma":0.001029487,"domain_scores_codex":[0.9996758,0.00008691008,0.00001812382,0.00007084625,0.0001112549,0.00003714413],"domain_scores_gemma":[0.9994019,0.0002226083,0.00004655719,0.0001638197,0.00009875577,0.00006626147],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003730343,0.00001924679,0.0002656306,0.000057741,0.00001003346,0.0000567079,0.0002275859,0.01404003,0.002012352,0.934769,0.004452381,0.04405192],"study_design_scores_gemma":[0.00001137731,0.00002089702,0.0001901111,0.00002686757,0.000007961216,0.00009332017,0.0001378926,0.05191313,0.001579256,0.9191309,0.02687838,0.00000982023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1256154,0.002113746,0.7781333,0.002041421,0.0008568359,0.00007289709,0.0003710984,0.001264079,0.08953121],"genre_scores_gemma":[0.7100002,0.002108756,0.1928864,0.0003948458,0.0003582729,0.0000883804,0.0006991348,0.001124321,0.09233975],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01061219,"threshold_uncertainty_score":0.0355013,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051569409","doi":"10.1016/j.ejc.2003.10.002","title":"On codes from hypergraphs","year":2003,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Hebrew University of Jerusalem","keywords":"Mathematics; Hypergraph; Combinatorics; Vertex (graph theory); Discrete mathematics; Binary number; Decoding methods; List decoding; Block code; Algorithm; Graph; Concatenated error correction code","authors":[{"name":"Yonatan Bilu","is_ca":false},{"name":"Shlomo Hoory","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01307566050862434,"gpt":0.2220836248975633,"spread":0.2090079643889389,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001169194,0.001729121,0.001391406,0.004579078,0.002337951,0.003540908,0.001539124,0.002142906,0.007921099],"category_scores_gemma":[0.01475514,0.001074792,0.001069239,0.004915894,0.003162771,0.006505927,0.005377595,0.004510341,0.001773387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002440678,"about_ca_system_score_gemma":0.001328912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003202575,"about_ca_topic_score_gemma":0.002509269,"domain_scores_codex":[0.998122,0.000652493,0.00008411909,0.0002588827,0.0006739234,0.0002085004],"domain_scores_gemma":[0.9874833,0.008723185,0.0007901299,0.001421259,0.001137125,0.000445089],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006313008,0.00001543685,0.0002197061,0.00008323616,0.00001479828,0.00009044071,0.00028633,0.009219635,0.0007497677,0.9665977,0.003723454,0.01893629],"study_design_scores_gemma":[0.000009170368,0.00001179191,0.00007019136,0.0000498683,0.00001068255,0.00008494379,0.00003373692,0.01781566,0.0006709092,0.9767736,0.004452895,0.00001647893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1852009,0.005888977,0.669038,0.007709771,0.001257168,0.0002233905,0.001286605,0.001535897,0.1278592],"genre_scores_gemma":[0.7884899,0.007908884,0.1203238,0.002574664,0.001867642,0.0005011919,0.001683977,0.001583496,0.07506651],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007921099,"threshold_uncertainty_score":0.02649873,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2219887110","doi":"10.1016/j.ejc.2016.02.005","title":"An Erdős–Ko–Rado theorem for finite 2-transitive groups","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Mathematics; Combinatorics; Transitive relation; Cardinality (data modeling); Finite set; Discrete mathematics; Set (abstract data type)","authors":[{"name":"Karen Meagher","is_ca":true},{"name":"Pablo Spiga","is_ca":false},{"name":"Pham Huu Tiep","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0265312122647821,"gpt":0.2779128343328651,"spread":0.251381622068083,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001908746,0.0009219417,0.001749017,0.002863275,0.002761964,0.003478046,0.001659898,0.001835283,0.008436639],"category_scores_gemma":[0.004585311,0.0006743257,0.001701424,0.001993916,0.004914487,0.01109818,0.005040667,0.004549021,0.001326863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001517446,"about_ca_system_score_gemma":0.000700852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007794165,"about_ca_topic_score_gemma":0.0005449867,"domain_scores_codex":[0.9986909,0.0002867133,0.0001006942,0.0004045188,0.0003096924,0.0002075595],"domain_scores_gemma":[0.9969376,0.001715568,0.0002972417,0.0004214905,0.0003062706,0.0003218249],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002805218,0.00001462513,0.0001521744,0.00004477407,0.000009747473,0.00004299245,0.0002055498,0.0003843732,0.0004411008,0.9940547,0.001194616,0.003427317],"study_design_scores_gemma":[0.0000145437,0.000009490828,0.0001425419,0.00001102764,0.00001264801,0.00007108203,0.0000466138,0.001197363,0.0002134721,0.9937605,0.004510164,0.00001052605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3561996,0.005512893,0.3300355,0.01140717,0.001201528,0.0001499738,0.00123691,0.0007893462,0.2934671],"genre_scores_gemma":[0.9154422,0.003196283,0.03759642,0.002165115,0.001215967,0.0002577592,0.000637788,0.0002711297,0.03921745],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008436639,"threshold_uncertainty_score":0.0282234,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066666508","doi":"10.1016/j.ejc.2011.09.004","title":"Polynomial treewidth forces a large grid-like-minor","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Australian Research Council","keywords":"Treewidth; Combinatorics; Mathematics; Partial k-tree; Minor (academic); Graph minor; Tree-depth; Tree decomposition; 1-planar graph; Discrete mathematics; Graph; Clique-sum; Pathwidth; Chordal graph; Line graph; Graph power","authors":[{"name":"Bruce A. Reed","is_ca":true},{"name":"David R. Wood","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03214453760996638,"gpt":0.2523958817513119,"spread":0.2202513441413456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000642653,0.000613922,0.001231688,0.0004284338,0.002104175,0.002150585,0.001746418,0.001990524,0.02657314],"category_scores_gemma":[0.005653868,0.0008006839,0.001247047,0.0006178121,0.001525487,0.00387253,0.003152901,0.003153877,0.003232451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008330041,"about_ca_system_score_gemma":0.000823428,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001279935,"about_ca_topic_score_gemma":0.002543191,"domain_scores_codex":[0.9991775,0.0001103321,0.00003705926,0.0002224192,0.0001936246,0.0002589499],"domain_scores_gemma":[0.9962559,0.001776408,0.0002459622,0.0007673641,0.0003349013,0.0006194614],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008682834,0.0002767602,0.00195823,0.0003395166,0.0000539269,0.001037679,0.0007297788,0.01022045,0.03141451,0.8935058,0.03799518,0.0216],"study_design_scores_gemma":[0.0002973296,0.0001191317,0.0007326514,0.00002091292,0.00003822223,0.0009728142,0.0003538692,0.0451258,0.006553655,0.929687,0.01606417,0.00003432943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5682385,0.0002381029,0.3066057,0.008499104,0.001056794,0.0003301738,0.001404204,0.003529878,0.1100974],"genre_scores_gemma":[0.9121736,0.0001109174,0.058033,0.0008891037,0.0002062483,0.0001263681,0.0007076004,0.0009868502,0.02676632],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02657314,"threshold_uncertainty_score":0.08889604,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2294555104","doi":"10.1016/j.ejc.2016.02.004","title":"Spectral radius and fractional matchings in graphs","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Spectral radius; Vertex (graph theory); Graph; Matching (statistics); Integer (computer science); Eigenvalues and eigenvectors; Upper and lower bounds; Discrete mathematics; Mathematical analysis; Physics","authors":[{"name":"O Suil","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02137434924267125,"gpt":0.2604147178289835,"spread":0.2390403685863122,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001584008,0.00077379,0.001706899,0.005338815,0.002412475,0.004530124,0.002226122,0.002569879,0.008597947],"category_scores_gemma":[0.0123476,0.0008480998,0.000707752,0.003178095,0.004439835,0.00701911,0.002955888,0.001722353,0.001111032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001876861,"about_ca_system_score_gemma":0.0004705431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001234235,"about_ca_topic_score_gemma":0.0008206571,"domain_scores_codex":[0.9984331,0.0005992906,0.00007762288,0.0003305818,0.0003054589,0.0002540685],"domain_scores_gemma":[0.9930422,0.004139899,0.001224869,0.0004095949,0.0003929037,0.0007905455],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001302883,0.00002903803,0.0005509063,0.00007648758,0.00001256266,0.00006343015,0.0003776464,0.003851806,0.001141199,0.9865859,0.001157889,0.006022966],"study_design_scores_gemma":[0.00002281296,0.00001690792,0.0004030947,0.00003018527,0.00002059714,0.0001880074,0.0002327472,0.01982175,0.000602835,0.9766758,0.001969347,0.00001589627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7641982,0.004436542,0.1594469,0.003562215,0.0002621652,0.00006665517,0.000432804,0.0006063686,0.0669881],"genre_scores_gemma":[0.9803304,0.0009737857,0.01197497,0.0002202951,0.000298175,0.00005294985,0.0001876875,0.0001024708,0.00585929],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008597947,"threshold_uncertainty_score":0.028763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2050977427","doi":"10.1006/eujc.1998.0266","title":"Judicious Partitions of 3-uniform Hypergraphs","year":2000,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Trinity College","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Partition (number theory); Conjecture; Class (philosophy); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","authors":[{"name":"B Bollobás","is_ca":true},{"name":"Alex Scott","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00526714390918659,"gpt":0.1650904988186982,"spread":0.1598233549095116,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001284748,0.0008313511,0.001172041,0.001120337,0.001878245,0.002610159,0.001799433,0.001263607,0.01178932],"category_scores_gemma":[0.007121732,0.0008733323,0.0006734841,0.001373708,0.001354778,0.002739041,0.003850153,0.001743774,0.002088369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001136824,"about_ca_system_score_gemma":0.0008422418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001302054,"about_ca_topic_score_gemma":0.004054244,"domain_scores_codex":[0.997906,0.0007889031,0.0001156682,0.0003202686,0.0003076317,0.0005616106],"domain_scores_gemma":[0.9942762,0.002009779,0.000255791,0.002192334,0.0005770761,0.0006887999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.008439247,0.0008257116,0.005520758,0.0006250307,0.0002395808,0.001201435,0.00214761,0.1850729,0.1347169,0.3900516,0.02664988,0.2445092],"study_design_scores_gemma":[0.0005588789,0.000519909,0.002915798,0.0002071848,0.0001849126,0.0006590141,0.001557262,0.3691611,0.05684927,0.5376371,0.02961939,0.0001301597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6215377,0.0007399752,0.3298253,0.000912984,0.0006115141,0.0003210795,0.0008121246,0.001969097,0.04327012],"genre_scores_gemma":[0.8421352,0.0003282854,0.1460069,0.0004187501,0.00009709299,0.0002278392,0.000701562,0.0008200159,0.00926445],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01178932,"threshold_uncertainty_score":0.0394392,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035172594","doi":"10.1016/j.ejc.2009.11.020","title":"Geometric properties of Assur graphs","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Mathematics; Characterization (materials science); Link (geometry); Combinatorics; Focus (optics); Geometric analysis; Mathematical analysis; Physics","authors":[{"name":"Brigitte Servatius","is_ca":false},{"name":"Offer Shai","is_ca":false},{"name":"Walter Whiteley","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01050891993799969,"gpt":0.1715197828147909,"spread":0.1610108628767912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005807885,0.0008661617,0.0006009512,0.002731128,0.001747002,0.002843177,0.001084447,0.0009154441,0.008590885],"category_scores_gemma":[0.002936948,0.0005116711,0.0006005158,0.001783489,0.002077642,0.002613752,0.00152521,0.001210527,0.0008680153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008463899,"about_ca_system_score_gemma":0.0003818774,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001288668,"about_ca_topic_score_gemma":0.001285609,"domain_scores_codex":[0.9994314,0.0001672553,0.00002886664,0.0001033873,0.0001848509,0.00008411088],"domain_scores_gemma":[0.9972147,0.001274021,0.0006185168,0.0002539453,0.0003736202,0.0002652284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009531067,0.0000350491,0.002259569,0.00006391092,0.00001774243,0.0002487695,0.0005186743,0.009066416,0.003845199,0.9701477,0.001444393,0.01225731],"study_design_scores_gemma":[0.00001858651,0.00006423164,0.002171159,0.00002254422,0.00002914544,0.0004654798,0.0005615711,0.02249476,0.002183191,0.966262,0.005703458,0.00002369399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8884761,0.0005038636,0.04697298,0.0006966565,0.00006630185,0.00004797084,0.0003210041,0.0002142063,0.06270091],"genre_scores_gemma":[0.9824868,0.0004460038,0.00761455,0.0001421725,0.0001077647,0.00003722127,0.0005087999,0.00008894279,0.008567795],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008590885,"threshold_uncertainty_score":0.02873933,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1980573399","doi":"10.1016/j.ejc.2011.03.005","title":"Limits of kernel operators and the spectral regularity lemma","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Lemma (botany); Eigenvalues and eigenvectors; Invariant (physics); Combinatorics; Spectral theory; Spectral graph theory; Graph; Discrete mathematics; Pure mathematics; Hilbert space; Voltage graph; Line graph","authors":[{"name":"Balázs Szegedy","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06104600602389194,"gpt":0.2611345016580148,"spread":0.2000884956341228,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001890974,0.000543891,0.001138831,0.002589128,0.001793567,0.002790283,0.001560133,0.001317714,0.005497874],"category_scores_gemma":[0.008370473,0.0006293757,0.001143865,0.001139835,0.004361643,0.009143427,0.005352354,0.003429889,0.0007053763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008673997,"about_ca_system_score_gemma":0.0005972329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000793565,"about_ca_topic_score_gemma":0.0004788043,"domain_scores_codex":[0.9989361,0.0003044641,0.00006885447,0.0002079925,0.0003033176,0.0001792458],"domain_scores_gemma":[0.9945738,0.003070186,0.0004265222,0.0004189574,0.0008354596,0.0006751217],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002907193,0.00002587472,0.0002362705,0.00002766723,0.000008089799,0.00009344826,0.000195607,0.000378931,0.0009084362,0.9953667,0.000453582,0.002276188],"study_design_scores_gemma":[0.00001355344,0.00001429374,0.0002693391,0.000008706793,0.000008137206,0.0001504239,0.00009653496,0.00579183,0.0005893103,0.9917186,0.001326961,0.00001236248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5311055,0.002729395,0.3305825,0.00490345,0.0004525154,0.00007363618,0.0003294918,0.0004349516,0.1293886],"genre_scores_gemma":[0.9594716,0.001112554,0.01807306,0.0005397212,0.0005477599,0.00009705286,0.0001999081,0.000223197,0.01973499],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005497874,"threshold_uncertainty_score":0.01839221,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024214480","doi":"10.1016/j.ejc.2004.08.007","title":"Rigidity of ball-polyhedra in Euclidean 3-space","year":2004,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dual polyhedron; Polyhedron; Ball (mathematics); Mathematics; Rigidity (electromagnetism); Euclidean space; Euclidean geometry; Combinatorics; Pure mathematics; Geometry","authors":[{"name":"Károly Bezdek","is_ca":true},{"name":"Márton Naszódi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04564418200867169,"gpt":0.3011429456739542,"spread":0.2554987636652825,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008271876,0.00105808,0.001386238,0.002550388,0.00285473,0.003636384,0.002662732,0.001959777,0.009151734],"category_scores_gemma":[0.003704,0.001188572,0.00146421,0.002022354,0.003967618,0.003361078,0.004592013,0.003534,0.001589562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0011207,"about_ca_system_score_gemma":0.0006632045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004249407,"about_ca_topic_score_gemma":0.00399798,"domain_scores_codex":[0.9978533,0.0004597717,0.000144762,0.0004497282,0.0007684812,0.0003239556],"domain_scores_gemma":[0.9967226,0.001236857,0.0007456988,0.0003875807,0.0002808163,0.000626489],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004240442,0.00006729493,0.001115214,0.0001457774,0.00004016364,0.0003664288,0.0008531694,0.01918167,0.00419793,0.9605218,0.001592651,0.01149386],"study_design_scores_gemma":[0.00004956844,0.0001310881,0.001957319,0.00004629894,0.00002739208,0.0003962049,0.0004884769,0.03541488,0.001779222,0.9539911,0.005643947,0.00007450152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7271193,0.0008534497,0.2194636,0.0009889861,0.0002623964,0.00009751834,0.0008819476,0.0005869118,0.04974587],"genre_scores_gemma":[0.9333643,0.0004563427,0.04907365,0.0001976007,0.0001126535,0.00006637924,0.001004362,0.0002021868,0.01552256],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009151734,"threshold_uncertainty_score":0.03061557,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037445555","doi":"10.1006/eujc.2001.0456","title":"Hamilton-Connected Cayley Graphs on Hamiltonian Groups","year":2001,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique","keywords":"Mathematics; Combinatorics; Cayley graph; Valency; Bipartite graph; Hamiltonian (control theory); Hamiltonian path; Vertex-transitive graph; Pancyclic graph; Complete bipartite graph; Graph; Discrete mathematics; Voltage graph; Chordal graph; Line graph; 1-planar graph","authors":[{"name":"Brian Alspach","is_ca":true},{"name":"Yusheng Qin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06348036643430521,"gpt":0.3046526594731529,"spread":0.2411722930388477,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000245914,0.0006628828,0.000617288,0.001893094,0.001785384,0.002262557,0.001119083,0.00118366,0.0105752],"category_scores_gemma":[0.00138776,0.0006853134,0.0005619384,0.001792099,0.001558229,0.002406077,0.001571048,0.00127875,0.0006902543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001017764,"about_ca_system_score_gemma":0.0006249305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002927048,"about_ca_topic_score_gemma":0.005781102,"domain_scores_codex":[0.9997256,0.00007416467,0.00001085259,0.0000601456,0.00006235262,0.00006689141],"domain_scores_gemma":[0.9987183,0.0004805464,0.0002776509,0.0001052128,0.000110387,0.0003079661],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005963062,0.00004029207,0.000518878,0.00004404546,0.00001706077,0.000239272,0.0004335651,0.001750897,0.001857084,0.9885423,0.001904877,0.004592149],"study_design_scores_gemma":[0.00003749355,0.00001494104,0.0005202548,0.000009176367,0.00001622999,0.00008794836,0.0002085359,0.004872768,0.0004385246,0.992388,0.001396473,0.000009690604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8986197,0.0004773535,0.03468155,0.001279534,0.0002293729,0.0001007325,0.0004224132,0.0002706703,0.06391878],"genre_scores_gemma":[0.9670264,0.0004488407,0.008035813,0.0003946274,0.000152774,0.00007070948,0.0004665703,0.00007506955,0.02332926],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0105752,"threshold_uncertainty_score":0.03537756,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062741650","doi":"10.1016/j.ejc.2014.07.003","title":"Automorphisms of Cayley graphs on generalised dicyclic groups","year":2014,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"Australian Research Council","keywords":"Cayley graph; Automorphism; Mathematics; Combinatorics; Abelian group; Vertex-transitive graph; Vertex (graph theory); Graph; Dicyclic group; Discrete mathematics; Voltage graph; Quaternion group; Alternating group; Line graph","authors":[{"name":"Joy Morris","is_ca":true},{"name":"Pablo Spiga","is_ca":false},{"name":"Gabriel Verret","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05284546534984777,"gpt":0.2940220498000868,"spread":0.2411765844502391,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003966867,0.0007079027,0.000660399,0.001872554,0.00154726,0.002143511,0.0008413774,0.001112032,0.005794942],"category_scores_gemma":[0.001820798,0.0005012419,0.0008805576,0.001310461,0.002464934,0.001736217,0.002264187,0.001643694,0.0008024941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001074609,"about_ca_system_score_gemma":0.0005225866,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002437795,"about_ca_topic_score_gemma":0.002487083,"domain_scores_codex":[0.9994442,0.0001237083,0.00003037192,0.0001179753,0.0001264619,0.0001572802],"domain_scores_gemma":[0.9984618,0.0004547825,0.0003329097,0.0002376505,0.0001598452,0.0003529406],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001064723,0.00003266833,0.0007512735,0.00003963664,0.00001242148,0.0003952101,0.0008350234,0.002461934,0.003707267,0.9844862,0.0009679156,0.006204009],"study_design_scores_gemma":[0.00004253394,0.00004844233,0.001156664,0.00002319693,0.00001704922,0.0002560894,0.0003655264,0.005160134,0.001389213,0.9873428,0.00417425,0.00002391679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9132178,0.0003904398,0.02483109,0.0005979386,0.0003639869,0.00007963464,0.0001928656,0.0002599015,0.06006637],"genre_scores_gemma":[0.9739432,0.0003536042,0.004926371,0.0002040375,0.0002006983,0.00004834785,0.0002344832,0.00009636793,0.01999282],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005794942,"threshold_uncertainty_score":0.01938599,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100478405","doi":"10.1016/j.ejc.2011.09.031","title":"Reduced clique graphs of chordal graphs","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Treewidth; Indifference graph; Interval graph; Split graph; Clique-sum; Pathwidth; Discrete mathematics; Clique; Graph; 1-planar graph; Line graph","authors":[{"name":"Michel Habib","is_ca":false},{"name":"Juraj Stacho","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.039253829072214,"gpt":0.2658061011198843,"spread":0.2265522720476703,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004210412,0.0005078038,0.0008467532,0.001495203,0.001920103,0.002768985,0.002434239,0.001128588,0.0135768],"category_scores_gemma":[0.003235131,0.000662705,0.0008788945,0.001517197,0.001354489,0.002046914,0.001503424,0.002118381,0.0009924244],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00140364,"about_ca_system_score_gemma":0.0008448899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00382785,"about_ca_topic_score_gemma":0.006234085,"domain_scores_codex":[0.999123,0.0002053904,0.00002765366,0.0002009574,0.0002597969,0.0001832441],"domain_scores_gemma":[0.9967453,0.001503327,0.0003506681,0.00048459,0.0003584628,0.0005576065],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004102212,0.0001932207,0.001697703,0.0003482298,0.0001045338,0.000505783,0.0009650387,0.01159643,0.01425238,0.9422505,0.01004738,0.01762844],"study_design_scores_gemma":[0.0001351549,0.00004353633,0.002528854,0.0000360743,0.0000752617,0.0003458362,0.0004373658,0.03869013,0.003648664,0.9423555,0.01167289,0.00003063984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8029935,0.000898699,0.08991525,0.00181572,0.0002196974,0.0002380405,0.001967576,0.0005674344,0.1013841],"genre_scores_gemma":[0.9529288,0.0004224246,0.02342432,0.0003015012,0.0001520737,0.0001267464,0.002508992,0.0001968481,0.01993838],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0135768,"threshold_uncertainty_score":0.04541892,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1971692815","doi":"10.1016/j.ejc.2005.03.004","title":"Hadamard ideals and Hadamard matrices with two circulant cores","year":2005,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Hadamard transform; Complex Hadamard matrix; Hadamard matrix; Hadamard's inequality; Hadamard's maximal determinant problem; Mathematics; Hadamard three-lines theorem; Circulant matrix; Hadamard three-circle theorem; Formalism (music); Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","authors":[{"name":"Ilias Kotsireas","is_ca":true},{"name":"Christos Koukouvinos","is_ca":false},{"name":"Jennifer Seberry","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004872586124596952,"gpt":0.1753602694732534,"spread":0.1704876833486564,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001242034,0.0009778575,0.0009302536,0.002938526,0.002688682,0.003996767,0.00118626,0.001376951,0.008185424],"category_scores_gemma":[0.004098977,0.0007176997,0.0009458709,0.001723062,0.003858973,0.003505105,0.001861306,0.002797796,0.001389478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001056052,"about_ca_system_score_gemma":0.0009721103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006112919,"about_ca_topic_score_gemma":0.0006156869,"domain_scores_codex":[0.9982495,0.0004341435,0.00008782349,0.0002571568,0.0005566386,0.000414707],"domain_scores_gemma":[0.9967788,0.001021517,0.0004469578,0.0004421477,0.0006594493,0.0006511787],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005030734,0.00002583335,0.00006895071,0.00001570771,0.000004213142,0.000108231,0.0001203287,0.0004043151,0.001214293,0.9950498,0.0007578133,0.002180271],"study_design_scores_gemma":[0.00002643009,0.00003256964,0.0001216696,0.000009660253,0.000005892223,0.0002522223,0.00008004894,0.004414082,0.001489392,0.9905715,0.002972253,0.00002429797],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4566717,0.001016317,0.3091788,0.00285205,0.001295577,0.0002526815,0.0004745365,0.0006154265,0.2276428],"genre_scores_gemma":[0.8913869,0.0003576994,0.06646933,0.0006741424,0.0008767765,0.0001681991,0.0002583183,0.0001442689,0.03966451],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008185424,"threshold_uncertainty_score":0.02738297,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068865948","doi":"10.1016/j.ejc.2006.07.001","title":"Minimal paths and cycles in set systems","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Disjoint sets; Conjecture; Modulo; Disjoint union (topology); Family of sets; Set (abstract data type); Discrete mathematics","authors":[{"name":"Dhruv Mubayi","is_ca":false},{"name":"Jacques Verstraëte","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02241512389590421,"gpt":0.2542392567298244,"spread":0.2318241328339202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00106111,0.0006397759,0.001157809,0.003705758,0.003407852,0.005275823,0.001533593,0.001761764,0.008496982],"category_scores_gemma":[0.006495487,0.001009127,0.001051665,0.00496887,0.00526663,0.009887285,0.003581662,0.003014439,0.0004927506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002352416,"about_ca_system_score_gemma":0.001117201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002822211,"about_ca_topic_score_gemma":0.003118071,"domain_scores_codex":[0.9989023,0.0003207039,0.00008645139,0.0002433069,0.0003179222,0.0001292818],"domain_scores_gemma":[0.9955995,0.003073211,0.0003291683,0.0002554124,0.0003475341,0.0003952333],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001513565,0.000008292939,0.0001698327,0.00003313754,0.000004910884,0.00003160599,0.0003402411,0.000846136,0.0001510542,0.9952958,0.0002770636,0.002826807],"study_design_scores_gemma":[0.000004540392,0.000003281544,0.0000479387,0.000007310451,0.000004683362,0.0000287199,0.00006865827,0.001279123,0.0000816745,0.9974633,0.001007106,0.000003507289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5693979,0.004501516,0.3132004,0.004029526,0.0002390281,0.000176813,0.0008814579,0.0004577221,0.1071156],"genre_scores_gemma":[0.9307371,0.001719376,0.04682625,0.0002915414,0.0001780483,0.0002598055,0.0004859146,0.0001112924,0.01939064],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008496982,"threshold_uncertainty_score":0.02842522,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969885991","doi":"10.1016/j.ejc.2012.07.010","title":"Computing regularities in strings: A survey","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computation; Mathematics; Combinatorics; Algorithm","authors":[{"name":"W.F. Smyth","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02669545516524006,"gpt":0.2450184204284972,"spread":0.2183229652632572,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003348358,0.001324588,0.003507746,0.005846105,0.001236962,0.006223516,0.004216477,0.002002015,0.005337258],"category_scores_gemma":[0.01524775,0.001512354,0.002003422,0.01259895,0.002863792,0.01553465,0.003726657,0.003307543,0.002288163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001681607,"about_ca_system_score_gemma":0.002229747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001327263,"about_ca_topic_score_gemma":0.001305764,"domain_scores_codex":[0.9948328,0.0007074142,0.0006281848,0.001704567,0.001835547,0.0002915055],"domain_scores_gemma":[0.9846198,0.01084815,0.0005576808,0.002544362,0.001099262,0.000330811],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002084857,0.0002461573,0.005199083,0.003711783,0.0001455778,0.00011224,0.0004308547,0.01133088,0.002373239,0.1474972,0.008337038,0.8204075],"study_design_scores_gemma":[0.00007621323,0.0003253007,0.004197717,0.001614004,0.0002216768,0.002006042,0.0007519932,0.09491748,0.01041493,0.7683935,0.1169468,0.0001343378],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.05644007,0.2568545,0.6546394,0.004631049,0.000706935,0.0002225323,0.001541907,0.002282386,0.02268119],"genre_scores_gemma":[0.2631171,0.2601735,0.4549259,0.001909782,0.003885872,0.0003585242,0.005378545,0.001154241,0.009096459],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.006223516,"threshold_uncertainty_score":0.01785493,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2799851485","doi":"10.1016/j.ejc.2018.03.006","title":"Constructing de Bruijn sequences with co-lexicographic order: The<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml23\" display=\"inline\" overflow=\"scroll\" altimg=\"si23.gif\"><mml:mi>k</mml:mi></mml:math>-ary Grandmama sequence","year":2018,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"De Bruijn sequence; Lexicographical order; Substring; Mathematics; String (physics); Combinatorics; Sequence (biology); Order (exchange); De Bruijn graph; Aperiodic graph; Discrete mathematics; Data structure; Computer science","authors":[{"name":"Patrick Baxter Dragon","is_ca":false},{"name":"Oscar I. Hernandez","is_ca":false},{"name":"Joe Sawada","is_ca":true},{"name":"Aaron Williams","is_ca":false},{"name":"Dennis Wong","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01772005671135669,"gpt":0.2376812240304814,"spread":0.2199611673191247,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007818722,0.0009003922,0.0006122199,0.00148279,0.001367209,0.002100236,0.0007283346,0.0007069423,0.01807059],"category_scores_gemma":[0.004285597,0.0006817825,0.0008407292,0.001464388,0.0009802156,0.002385822,0.001988848,0.00149571,0.01205506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006819853,"about_ca_system_score_gemma":0.001585972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00117762,"about_ca_topic_score_gemma":0.002294845,"domain_scores_codex":[0.9990896,0.0002464897,0.00008846311,0.0001810869,0.0002458129,0.0001485574],"domain_scores_gemma":[0.9981406,0.0007964607,0.0001052326,0.000463079,0.0003812237,0.000113434],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003499709,0.0001526129,0.0009057381,0.0005505432,0.0000450444,0.0005978359,0.0008824772,0.009544612,0.01897073,0.735279,0.0382729,0.1944485],"study_design_scores_gemma":[0.0001237203,0.0001293236,0.0004232363,0.0001897028,0.00004334927,0.0008440674,0.0003040069,0.03719109,0.0620243,0.7683407,0.130298,0.00008862018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0584468,0.000514296,0.8305521,0.001029275,0.0007932562,0.0003333716,0.002331672,0.004925167,0.101074],"genre_scores_gemma":[0.3351353,0.000829018,0.5904583,0.0004804515,0.0002964745,0.0002837112,0.005465926,0.003016237,0.06403461],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01807059,"threshold_uncertainty_score":0.0604521,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2045095870","doi":"10.1016/j.ejc.2012.07.011","title":"Computing the Longest Previous Factor","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Substring; Suffix array; Combinatorics; Suffix; Factor (programming language); Mathematics; Prefix; Permutation (music); String (physics); Compressed suffix array; Discrete mathematics; Algorithm; Data structure; Suffix tree; Computer science; Physics","authors":[{"name":"Maxime Crochemore","is_ca":false},{"name":"Lucian Ilie","is_ca":true},{"name":"Costas S. Iliopoulos","is_ca":false},{"name":"Marcin Kubica","is_ca":false},{"name":"Wojciech Rytter","is_ca":false},{"name":"Tomasz Waleń","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02312963989812978,"gpt":0.2435922149546209,"spread":0.2204625750564911,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001051455,0.001382981,0.001569832,0.00322858,0.001694472,0.003820418,0.001993001,0.001254339,0.02543271],"category_scores_gemma":[0.008964866,0.0005964061,0.001767698,0.003624839,0.001728536,0.007617835,0.00210506,0.001784036,0.00783012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00178113,"about_ca_system_score_gemma":0.002001551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003174137,"about_ca_topic_score_gemma":0.005832078,"domain_scores_codex":[0.9981187,0.0001471538,0.0001627729,0.0006635796,0.0004728334,0.0004348976],"domain_scores_gemma":[0.9951704,0.001656088,0.0003081219,0.001648041,0.0008571155,0.0003602355],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003945269,0.0005874704,0.0129074,0.0009661496,0.0003063136,0.0007293992,0.0008162039,0.03705762,0.04721626,0.1205932,0.03924023,0.7356345],"study_design_scores_gemma":[0.0003915564,0.0008230375,0.005293597,0.0002801723,0.0005382453,0.001581245,0.0009486027,0.2831864,0.09332986,0.5588759,0.05451297,0.0002383283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4255181,0.003206909,0.5162168,0.003278692,0.001228855,0.0002593591,0.004286045,0.007496983,0.03850834],"genre_scores_gemma":[0.6440767,0.0009374298,0.3233006,0.0003421423,0.0004665093,0.0001383976,0.006217108,0.001656573,0.02286442],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02543271,"threshold_uncertainty_score":0.08508086,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996940011","doi":"10.1016/j.ejc.2006.08.008","title":"Representations of directed strongly regular graphs","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Mathematics; Combinatorics; Directed graph; Discrete mathematics","authors":[{"name":"Chris Godsil","is_ca":true},{"name":"Sylvia A. Hobart","is_ca":false},{"name":"William J. Martin","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03640506570934796,"gpt":0.3005941386890048,"spread":0.2641890729796568,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005929393,0.0005883474,0.0004651669,0.001348343,0.0007550882,0.003091412,0.0007503211,0.0008439075,0.006513393],"category_scores_gemma":[0.00184121,0.000351786,0.0005892745,0.001027104,0.001253866,0.002604818,0.001511611,0.001493252,0.000738055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008830854,"about_ca_system_score_gemma":0.0003637303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005250386,"about_ca_topic_score_gemma":0.0006603417,"domain_scores_codex":[0.9995481,0.0001094285,0.00002894019,0.00009505318,0.0001165035,0.0001019093],"domain_scores_gemma":[0.9987776,0.0004568466,0.0002047034,0.0001703782,0.0001848889,0.0002056484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003468788,0.00002133568,0.0001453893,0.00001629567,0.000003583762,0.00007301311,0.0002903085,0.000845967,0.001346913,0.9914634,0.000569656,0.005189377],"study_design_scores_gemma":[0.00001878863,0.00001933375,0.0001266999,0.000009241699,0.000008671984,0.00008503479,0.0001554386,0.007222028,0.0006098338,0.9889897,0.00274616,0.000009098732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6303376,0.0004229019,0.258377,0.00150625,0.0003293277,0.0001250422,0.0005935802,0.0008521023,0.1074563],"genre_scores_gemma":[0.9531053,0.0003013208,0.02033297,0.0002131226,0.0001509874,0.00009096345,0.0004787993,0.0001492655,0.02517716],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006513393,"threshold_uncertainty_score":0.02178943,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093180783","doi":"10.1016/j.ejc.2014.06.009","title":"The Chen–Chvátal conjecture for metric spaces induced by distance-hereditary graphs","year":2014,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Conjecture; Metric space; De Bruijn sequence; Discrete mathematics; De Bruijn graph; Generalization; Mathematical analysis","authors":[{"name":"Pierre Aboulker","is_ca":true},{"name":"Rohan Kapadia","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01485898419639465,"gpt":0.2557884431531749,"spread":0.2409294589567803,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001423838,0.0006566973,0.001738401,0.00180441,0.003466427,0.004549896,0.001961923,0.002864323,0.01003927],"category_scores_gemma":[0.009461693,0.0008338089,0.001366675,0.002500576,0.004668135,0.01020433,0.004580606,0.004462956,0.0008726648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002484155,"about_ca_system_score_gemma":0.001066095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003014779,"about_ca_topic_score_gemma":0.002876114,"domain_scores_codex":[0.9979764,0.0004921246,0.00008577859,0.0005707892,0.0004740861,0.0004008595],"domain_scores_gemma":[0.9909226,0.00502635,0.0008765112,0.001288573,0.0008365443,0.001049349],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008123904,0.00003181858,0.000751821,0.0000839215,0.00001788498,0.00007408463,0.0003254915,0.003023704,0.0005180619,0.9888957,0.002797476,0.003398889],"study_design_scores_gemma":[0.00003003545,0.00001304203,0.000468754,0.00001576451,0.00001176992,0.00009179023,0.0001440275,0.008275256,0.0003618725,0.9883936,0.002177892,0.00001617128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.780918,0.001651677,0.0813464,0.01315371,0.0003998114,0.00007062274,0.001173096,0.0004405849,0.120846],"genre_scores_gemma":[0.9780895,0.0007104288,0.008236546,0.00100732,0.0003245015,0.00006709307,0.0008544853,0.0000970611,0.01061315],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01003927,"threshold_uncertainty_score":0.03358471,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022451101","doi":"10.1016/j.ejc.2011.09.002","title":"Connectivity augmentation in planar straight line graphs","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Planar graph; Book embedding; Planar straight-line graph; Mathematics; Polyhedral graph; Embedding; Planar; Outerplanar graph; Line graph; Graph; Discrete mathematics; 1-planar graph; Pathwidth; Computer science; Artificial intelligence","authors":[{"name":"Csaba D. Tóth","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03723774661021497,"gpt":0.2340681393779614,"spread":0.1968303927677464,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002202037,0.0003915262,0.0004210341,0.0009353965,0.0006876614,0.001060271,0.0009454109,0.0006719186,0.007948884],"category_scores_gemma":[0.00203001,0.0004350432,0.000500744,0.0009093501,0.0009467338,0.001529153,0.001477471,0.001168437,0.0008219038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003621175,"about_ca_system_score_gemma":0.0002577768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000795904,"about_ca_topic_score_gemma":0.001011575,"domain_scores_codex":[0.9997512,0.00006939763,0.00001151856,0.00005327425,0.00007496777,0.00003960033],"domain_scores_gemma":[0.9984676,0.0008189096,0.000194934,0.0002153247,0.0001423883,0.0001607858],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004745363,0.0003230716,0.003858455,0.0004241082,0.00003671906,0.0008291583,0.0009428429,0.1516464,0.03075282,0.6092049,0.0102219,0.1912851],"study_design_scores_gemma":[0.00006782572,0.0002180061,0.002194723,0.00007889351,0.00004410471,0.0007665061,0.000460405,0.4566003,0.01151814,0.5119511,0.01606695,0.00003296074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5511532,0.0004343675,0.4004687,0.000597469,0.0001151989,0.0001666891,0.0004523472,0.001234695,0.04537743],"genre_scores_gemma":[0.8578625,0.0004105298,0.1286719,0.0001121159,0.00006398097,0.0001347816,0.0007142434,0.000250274,0.01177967],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007948884,"threshold_uncertainty_score":0.02659166,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1986161890","doi":"10.1016/j.ejc.2008.09.022","title":"On the geodesic pre-hull number of a graph","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Convexity; Combinatorics; Hull; Geodesic; Bipartite graph; Convex hull; Graph; Discrete mathematics; Regular polygon; Geometry","authors":[{"name":"Norbert Polat","is_ca":false},{"name":"Gert Sabidussi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02757615659496736,"gpt":0.2700224635671326,"spread":0.2424463069721652,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001180396,0.00108509,0.00143204,0.006126879,0.002601611,0.003961207,0.002610399,0.001959275,0.01300594],"category_scores_gemma":[0.006178014,0.0006889497,0.000855213,0.003025415,0.004878502,0.008077167,0.002597983,0.003903872,0.001313823],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002371068,"about_ca_system_score_gemma":0.0006794096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00211903,"about_ca_topic_score_gemma":0.001987492,"domain_scores_codex":[0.9990376,0.0002459016,0.00004189728,0.0001998024,0.0002994385,0.0001754212],"domain_scores_gemma":[0.9932522,0.003779658,0.0008007386,0.0003309413,0.0004890898,0.001347257],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003030117,0.00005675255,0.001650997,0.0001242512,0.00002224421,0.0001894162,0.0006053894,0.00718363,0.00207425,0.9709779,0.003925618,0.01288664],"study_design_scores_gemma":[0.00003865657,0.00007928242,0.002322386,0.00004503646,0.00002575146,0.000210656,0.0002432383,0.02496435,0.001026757,0.9669357,0.004071386,0.0000367457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7903714,0.001247768,0.0823442,0.00331793,0.0004495099,0.00008115247,0.000793203,0.0003780532,0.1210168],"genre_scores_gemma":[0.9473413,0.001156489,0.02256292,0.000333696,0.0007318555,0.0001211499,0.001115382,0.0002106438,0.02642646],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01300594,"threshold_uncertainty_score":0.04350919,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964393859","doi":"10.1016/j.ejc.2012.07.003","title":"On the removal lemma for linear systems over Abelian groups","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Mathematics; Abelian group; Coprime integers; Lemma (botany); Integer (computer science); Combinatorics; Order (exchange); Elementary abelian group; Group (periodic table); Extension (predicate logic); Discrete mathematics; Matrix (chemical analysis)","authors":[{"name":"Daniel Král͏̌","is_ca":false},{"name":"Oriol Serra","is_ca":false},{"name":"Lluís Vena","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01782300999946134,"gpt":0.2064599083475682,"spread":0.1886368983481068,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002316798,0.001155645,0.001663402,0.002591435,0.002847329,0.003977065,0.001985067,0.002424888,0.01657298],"category_scores_gemma":[0.006961399,0.0008438287,0.002248142,0.001904514,0.004813474,0.01007837,0.006506603,0.00811414,0.004090552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00118355,"about_ca_system_score_gemma":0.0007031062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001242742,"about_ca_topic_score_gemma":0.00102877,"domain_scores_codex":[0.9979305,0.00061319,0.0001123474,0.0003192028,0.0005727268,0.000452066],"domain_scores_gemma":[0.9927241,0.005108802,0.000320125,0.0009527155,0.0006008334,0.0002934348],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001910678,0.00006652308,0.0003610249,0.0002098726,0.00003398667,0.0004769944,0.0004818562,0.001536889,0.003852301,0.9687992,0.01012205,0.01386814],"study_design_scores_gemma":[0.00004075622,0.00003938893,0.0002868035,0.00003945447,0.00004147849,0.0003236246,0.0001331384,0.006582411,0.002517164,0.9735005,0.0164563,0.00003898585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1456587,0.005285371,0.5361559,0.0115804,0.002756505,0.000171411,0.0006344002,0.001322446,0.2964349],"genre_scores_gemma":[0.8393594,0.003875111,0.05532579,0.004637005,0.002602873,0.0002605316,0.001619886,0.001300255,0.0910193],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01657298,"threshold_uncertainty_score":0.05544215,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2914340152","doi":"10.1006/eujc.1999.0384","title":"n-Semimetrics","year":2000,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Extension (predicate logic); Combinatorics; Simplex; Triangle inequality; Inequality; Discrete mathematics; Mathematical analysis; Computer science","authors":[{"name":"Michel Deza","is_ca":false},{"name":"Ivo G. Rosenberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0450805289558108,"gpt":0.2919103819671798,"spread":0.246829853011369,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001536731,0.001053155,0.001247614,0.002843406,0.003496292,0.003947328,0.001389908,0.001263216,0.01545798],"category_scores_gemma":[0.004194288,0.0008430604,0.001262691,0.002153173,0.003800847,0.00901947,0.006886464,0.004903093,0.002892084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001821957,"about_ca_system_score_gemma":0.000703555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005931765,"about_ca_topic_score_gemma":0.0007404015,"domain_scores_codex":[0.9978447,0.0004891083,0.0001799987,0.0006340729,0.0006101589,0.0002420828],"domain_scores_gemma":[0.9964868,0.001316689,0.0003871928,0.0004479614,0.0006208407,0.0007406902],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002796076,0.00002117575,0.0002291784,0.00002788607,0.0000092278,0.00005482842,0.0001430966,0.000111769,0.0003721901,0.9896092,0.003107017,0.006286335],"study_design_scores_gemma":[0.00001084084,0.00001678422,0.0003900111,0.00001537999,0.000009309241,0.0003720183,0.0001135523,0.0008985379,0.0004299682,0.9783288,0.01940473,0.000009996334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2083244,0.002485955,0.1896537,0.01130881,0.002942236,0.0001528905,0.002123698,0.0007943184,0.582214],"genre_scores_gemma":[0.7823075,0.001766724,0.05145735,0.00261644,0.001283372,0.0003361155,0.002086968,0.0005302464,0.1576154],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01545798,"threshold_uncertainty_score":0.0517121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005133195","doi":"10.1016/j.ejc.2004.07.010","title":"Poset edge-labellings and left modularity","year":2004,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Fields Institute for Research in Mathematical Sciences; University of New Brunswick; Université du Québec à Montréal","funders":"","keywords":"Mathematics; Partially ordered set; Combinatorics; Bounded function; Lattice (music); Discrete mathematics; Modular design; Computer science; Physics; Mathematical analysis","authors":[{"name":"Peter R. W. McNamara","is_ca":true},{"name":"Hugh Thomas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0058107588642839,"gpt":0.1672636208497889,"spread":0.161452861985505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001462237,0.0006394949,0.0008065723,0.001945675,0.003621284,0.004238686,0.001255138,0.001698077,0.01854379],"category_scores_gemma":[0.006076975,0.0008862671,0.001209261,0.001460125,0.004527785,0.008158494,0.004209831,0.003249296,0.001992129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001009443,"about_ca_system_score_gemma":0.000662394,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007665433,"about_ca_topic_score_gemma":0.001039399,"domain_scores_codex":[0.9984686,0.0004362233,0.00007180185,0.0003846714,0.0002644362,0.0003742131],"domain_scores_gemma":[0.9934804,0.003148534,0.0007670321,0.0009676305,0.0006197056,0.001016556],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000752027,0.00003669483,0.0003074487,0.00002256102,0.000004612038,0.000135432,0.0005092926,0.0006693845,0.001506963,0.9901071,0.000732619,0.005892697],"study_design_scores_gemma":[0.00001879581,0.00001480978,0.0001783567,0.00001111728,0.00001186088,0.0001669664,0.000129158,0.003139747,0.00123763,0.9933537,0.00172329,0.0000145464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4016828,0.0002796797,0.4757082,0.002232826,0.0002764723,0.00009583474,0.0004238278,0.001121586,0.1181788],"genre_scores_gemma":[0.923421,0.0002004084,0.04745437,0.0004696285,0.0001738378,0.0001223129,0.0002848633,0.0004466707,0.0274269],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01854379,"threshold_uncertainty_score":0.06203514,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1863544524","doi":"10.1016/j.ejc.2016.01.002","title":"On inversion sets and the weak order in Coxeter groups","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Coxeter group; Mathematics; Joins; Inversion (geology); Longest element of a Coxeter group; Coxeter complex; Combinatorics; Point group; Coxeter element; Pure mathematics; Artin group","authors":[{"name":"Christophe Hohlweg","is_ca":true},{"name":"Jean‐Philippe Labbé","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02259396256635644,"gpt":0.2625315394824732,"spread":0.2399375769161167,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001514441,0.001293505,0.001237857,0.003489652,0.003519144,0.00531646,0.001520849,0.001791428,0.009723484],"category_scores_gemma":[0.004048429,0.0007215566,0.001275467,0.002593927,0.008012096,0.01004638,0.004756913,0.005199961,0.001025128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002068677,"about_ca_system_score_gemma":0.0008687683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001938749,"about_ca_topic_score_gemma":0.002067855,"domain_scores_codex":[0.9990632,0.0002800705,0.00005925957,0.0001344458,0.0002184745,0.0002445468],"domain_scores_gemma":[0.997411,0.001517576,0.0002748097,0.000248146,0.0002251106,0.0003234756],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004182272,0.00002337823,0.0002436704,0.00002368785,0.00000495998,0.00006019445,0.0003238382,0.0003842839,0.0002800663,0.9957125,0.0004521914,0.002449434],"study_design_scores_gemma":[0.00001120326,0.00001302306,0.00017812,0.0000115473,0.00000562786,0.00004080146,0.0001445193,0.0006600996,0.0001337646,0.9975024,0.001290449,0.000008353441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6430157,0.003653566,0.08819581,0.007288139,0.001277611,0.00009028556,0.0004886049,0.0002341588,0.2557561],"genre_scores_gemma":[0.9572101,0.002071799,0.008851711,0.0006801057,0.001196559,0.00008792207,0.0004562901,0.0001000487,0.02934551],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009723484,"threshold_uncertainty_score":0.03252828,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2301667118","doi":"10.1016/j.ejc.2016.10.009","title":"Minimum size of feedback vertex sets of planar graphs of girth at least five","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Conjecture; Feedback vertex set; Girth (graph theory); Planar graph; Upper and lower bounds; Discrete mathematics; Graph","authors":[{"name":"Tom Kelly","is_ca":true},{"name":"Chun‐Hung Liu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01541974543615408,"gpt":0.2450804113464845,"spread":0.2296606659103304,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008149139,0.0008060126,0.001804368,0.001042465,0.001215863,0.002547931,0.002771481,0.00222888,0.004923907],"category_scores_gemma":[0.01458925,0.0009810013,0.0008958986,0.001161025,0.001098492,0.00300187,0.001623368,0.001098165,0.0004551608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001253108,"about_ca_system_score_gemma":0.001218184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008474571,"about_ca_topic_score_gemma":0.001217947,"domain_scores_codex":[0.9988612,0.0002725672,0.00007345974,0.0002534084,0.0002978899,0.0002414628],"domain_scores_gemma":[0.9821059,0.01281122,0.00168624,0.001205529,0.001041164,0.001150013],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.01048803,0.001015445,0.03078809,0.003723809,0.0006725282,0.001521744,0.003131717,0.2907438,0.1659953,0.3367194,0.02765843,0.1275418],"study_design_scores_gemma":[0.0009851032,0.0008870746,0.01174138,0.00030506,0.0003741944,0.001628857,0.001384568,0.3790289,0.04900927,0.5485711,0.005947088,0.0001375145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.953779,0.0004863792,0.03326872,0.001101347,0.00005205385,0.0001247031,0.003330759,0.0005108797,0.007346089],"genre_scores_gemma":[0.9797798,0.000226267,0.01626062,0.000112525,0.00004969156,0.0001547713,0.001734839,0.0001143063,0.001567306],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004923907,"threshold_uncertainty_score":0.0164721,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4313450058","doi":"10.1016/j.ejc.2007.04.014","title":"An upper bound for the chromatic number of line graphs","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Chromatic scale; Upper and lower bounds; Computer science; Line (geometry); Combinatorics; Mathematics; Geometry","authors":[{"name":"Andrew King","is_ca":true},{"name":"Adrian Vetta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02439923940933715,"gpt":0.3239694786796888,"spread":0.2995702392703516,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002393023,0.002683148,0.002017209,0.005993534,0.002812572,0.006822478,0.005609334,0.003145878,0.02364485],"category_scores_gemma":[0.01418124,0.001383631,0.001642151,0.00481186,0.003636266,0.009788108,0.004656042,0.006489031,0.004667105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005264821,"about_ca_system_score_gemma":0.001493892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002847346,"about_ca_topic_score_gemma":0.005475262,"domain_scores_codex":[0.9968863,0.0005361439,0.0001055433,0.0008501125,0.00086459,0.0007573694],"domain_scores_gemma":[0.9802182,0.0137991,0.0007483183,0.002569568,0.001197119,0.001467708],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001715061,0.0005804286,0.005121856,0.001505958,0.0002838632,0.0005042057,0.0008530975,0.1120754,0.04633316,0.641627,0.06243709,0.1269628],"study_design_scores_gemma":[0.00014356,0.0002477115,0.00459874,0.0003837834,0.0003264267,0.0006760862,0.0002455394,0.2867728,0.01599395,0.6370895,0.05331441,0.0002074924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1871394,0.01381477,0.5354586,0.01163566,0.001801748,0.000322637,0.004477357,0.005157271,0.2401925],"genre_scores_gemma":[0.7499546,0.00739474,0.1838598,0.002510069,0.002406986,0.0007051977,0.003727604,0.001795675,0.04764535],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02364485,"threshold_uncertainty_score":0.07909983,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038193038","doi":"10.1016/j.ejc.2011.09.024","title":"A stability theorem on fractional covering of triangles by edges","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Disjoint sets; Graph; Discrete mathematics","authors":[{"name":"Penny Haxell","is_ca":true},{"name":"Alexandr Kostochka","is_ca":false},{"name":"Stéphan Thomassé","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05720135198896756,"gpt":0.2618078043544493,"spread":0.2046064523654817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006646411,0.0005742736,0.0008024421,0.001800036,0.001909836,0.002114892,0.001388911,0.001260008,0.009972369],"category_scores_gemma":[0.005605014,0.0004796526,0.001108229,0.001030588,0.001620825,0.003130509,0.002343232,0.001474596,0.0008292217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001074278,"about_ca_system_score_gemma":0.000362391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002239889,"about_ca_topic_score_gemma":0.001163119,"domain_scores_codex":[0.9995728,0.0000680671,0.00002073326,0.0001278931,0.0001092099,0.0001012059],"domain_scores_gemma":[0.9968466,0.001926001,0.0002398148,0.0002610611,0.0004190697,0.0003073866],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000373439,0.00005652189,0.001964187,0.0001560316,0.00004964993,0.0003192587,0.0007966453,0.01242001,0.01939603,0.9329308,0.005295394,0.02624198],"study_design_scores_gemma":[0.00006454666,0.0001156214,0.001409673,0.00004070301,0.00004741676,0.0004825351,0.0003244194,0.125651,0.006957971,0.8580781,0.006793807,0.00003423539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5696169,0.0009877601,0.3630454,0.002029747,0.0004374221,0.00007570322,0.0005309136,0.0004823474,0.06279383],"genre_scores_gemma":[0.954439,0.0005543624,0.02424016,0.0003851935,0.000420145,0.0001023856,0.0004579615,0.0002195874,0.0191812],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009972369,"threshold_uncertainty_score":0.0333609,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2146949677","doi":"10.1006/eujc.2000.0409","title":"Transitive Factorizations in the Symmetric Group, and Combinatorial Aspects of Singularity Theory","year":2000,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monodromy; Symmetric group; Combinatorics; Conjecture; Alternating group; Group (periodic table); Permutation group; Permutation (music); Combinatorial proof; Generating function; Series (stratigraphy); Holomorphic function; Partition (number theory); Pure mathematics","authors":[{"name":"I. P. Goulden","is_ca":true},{"name":"D. M. Jackson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01029537145746291,"gpt":0.207856369470658,"spread":0.1975609980131951,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008987157,0.000544412,0.0007467879,0.001900129,0.002398964,0.004072241,0.000800447,0.001257454,0.004447628],"category_scores_gemma":[0.003585921,0.0004373063,0.0007634014,0.001477256,0.005181406,0.007163654,0.001793095,0.001709365,0.0004436177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001280022,"about_ca_system_score_gemma":0.0008225607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001341957,"about_ca_topic_score_gemma":0.001462724,"domain_scores_codex":[0.9993731,0.0001655891,0.00004600683,0.0001148866,0.0001912655,0.0001092147],"domain_scores_gemma":[0.9984643,0.0006479696,0.0003285157,0.0001900206,0.0001459689,0.0002232887],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001453908,0.00001002967,0.0001229267,0.00001282127,0.000002249971,0.00004395021,0.000154678,0.0004429667,0.0002179673,0.9969962,0.0004138633,0.001567838],"study_design_scores_gemma":[0.000006223469,0.000006881168,0.00006418492,0.000004158292,0.000001996952,0.0000565876,0.00006405699,0.001000882,0.00005186192,0.9980198,0.0007195181,0.000003723887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7326434,0.004465487,0.1123961,0.006182958,0.0005660449,0.00008622724,0.0003639742,0.0001511019,0.1431447],"genre_scores_gemma":[0.978556,0.00107511,0.009335994,0.0002463987,0.0005465686,0.00003145066,0.0001436066,0.00002515285,0.01003968],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004447628,"threshold_uncertainty_score":0.01487881,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984989930","doi":"10.1016/j.ejc.2008.09.010","title":"Local Steiner convexity","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Mathematics; Steiner tree problem; Vertex (graph theory); Convexity; Convex set; Regular polygon; Graph; Discrete mathematics; Convex optimization; Geometry","authors":[{"name":"Michael A. Henning","is_ca":false},{"name":"Morten H. Nielsen","is_ca":true},{"name":"Ortrud R. Oellermann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03156079600770018,"gpt":0.2555717393532047,"spread":0.2240109433455045,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004782913,0.0008399356,0.001246518,0.001638293,0.001748135,0.002937471,0.001175483,0.001025589,0.03513199],"category_scores_gemma":[0.002150524,0.0005809275,0.001137448,0.001816866,0.001905896,0.005107644,0.003585002,0.004874601,0.004748532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001502631,"about_ca_system_score_gemma":0.0006137193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007554847,"about_ca_topic_score_gemma":0.0009611484,"domain_scores_codex":[0.9994594,0.0001110767,0.00002194181,0.0001456907,0.0001611645,0.0001006599],"domain_scores_gemma":[0.9991959,0.0002950105,0.00008435788,0.0001600778,0.0001416246,0.0001230493],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002821072,0.00001189967,0.0001293344,0.00004703466,0.00001197809,0.00007335485,0.00007867726,0.001063911,0.0005966725,0.9836,0.007472101,0.006886813],"study_design_scores_gemma":[0.00001276284,0.000009158168,0.0002735886,0.00001416597,0.00001755346,0.0002778122,0.00009005996,0.003330719,0.0005629478,0.9835852,0.01181832,0.000007763982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1360416,0.001992343,0.1319601,0.006664381,0.0005171564,0.00008559736,0.001595835,0.0005373223,0.7206056],"genre_scores_gemma":[0.775221,0.002572324,0.02213842,0.00159039,0.0006776441,0.0001887973,0.001926427,0.0008103891,0.1948745],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03513199,"threshold_uncertainty_score":0.1175282,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}