{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007161964,0.0001531057,0.0002444217,0.0001436504,0.00007857501,0.00002656781,0.0002189438,0.00002679761,0.000007943542],"category_scores_gemma":[0.00003744987,0.0001410187,0.00008843645,0.0001991986,0.00004790979,0.0002208925,0.00002687512,0.0002650326,0.00001303557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002526007,"about_ca_system_score_gemma":0.00001997836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.836287e-7,"about_ca_topic_score_gemma":1.139275e-7,"domain_scores_codex":[0.9988416,0.0002169738,0.0004558353,0.00008000986,0.0002273842,0.0001781699],"domain_scores_gemma":[0.999366,0.00004492137,0.0001237302,0.000166552,0.000122595,0.0001762183],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006156438,0.001411917,0.009726401,0.001629294,0.001844794,0.04596396,0.01627083,0.2964202,0.03303111,0.461681,0.1033219,0.02808299],"study_design_scores_gemma":[0.03540687,0.008013596,0.03437653,0.003327246,0.000826486,0.03429829,0.002612164,0.2394476,0.01780637,0.1436841,0.4736012,0.006599602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9655216,0.00503095,0.01654044,0.00002984146,0.001117055,0.0000605623,0.000003200027,0.00008037078,0.01161592],"genre_scores_gemma":[0.9989038,0.0005358442,0.0001677234,0.00003938889,0.0001588186,2.511992e-7,0.000001072462,0.00004983887,0.0001433276],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3702793,"threshold_uncertainty_score":0.5750574,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00105399,0.0001072154,0.0001869644,0.0001333851,0.0001243525,0.00005603688,0.001386018,0.00001481564,0.000008838007],"category_scores_gemma":[0.0000681688,0.00008864268,0.0001099455,0.0003557804,0.0000454146,0.0004092082,0.0001750457,0.0002386625,0.0001018855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003128217,"about_ca_system_score_gemma":0.00006369351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.826191e-7,"about_ca_topic_score_gemma":6.861487e-9,"domain_scores_codex":[0.9986449,0.0003204185,0.000402936,0.0001142885,0.0003405096,0.0001769001],"domain_scores_gemma":[0.9989157,0.00008034684,0.0003518108,0.0003447143,0.0001746799,0.0001327128],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004003777,0.0009134642,0.008542565,0.00003609323,0.0001397717,0.02075714,0.00415024,0.0002218126,0.002126905,0.890632,0.0394342,0.03300576],"study_design_scores_gemma":[0.0154396,0.005240466,0.3077445,0.0005541828,0.0001141136,0.0556534,0.0003685566,0.01157911,0.01372298,0.2578592,0.3288181,0.002905833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6839716,0.0008405576,0.2981847,0.0004011765,0.00255275,0.00003742468,4.204285e-7,0.00008985566,0.01392148],"genre_scores_gemma":[0.9963782,0.0001268497,0.002951283,0.0001763769,0.0001171954,9.134688e-8,1.46324e-7,0.00001501433,0.0002348852],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6327729,"threshold_uncertainty_score":0.3614743,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002437659,0.0001570367,0.0003948483,0.0001975252,0.00006471826,0.00001774885,0.0003812815,0.000037307,0.00009790951],"category_scores_gemma":[0.001777413,0.0001261513,0.0001428253,0.0005298095,0.00007520247,0.0001279351,0.00006258879,0.0004030924,0.000002593722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003236121,"about_ca_system_score_gemma":0.00005905779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.880527e-7,"about_ca_topic_score_gemma":2.339618e-7,"domain_scores_codex":[0.9977195,0.0007817352,0.0007864443,0.0001022203,0.0003809416,0.0002291931],"domain_scores_gemma":[0.9982037,0.000479925,0.0005949459,0.0002823224,0.0003377455,0.000101386],"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.00009686145,0.0002659778,0.01290081,0.00008540968,0.00005753293,0.0003123891,0.0009327473,0.0000153322,0.0002973953,0.9831287,0.001615114,0.00029168],"study_design_scores_gemma":[0.001552566,0.0004963659,0.01014752,0.00009860331,0.00003718924,0.0001281827,0.0002205819,0.000003432917,0.001195747,0.9818355,0.004124432,0.0001598544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9593793,0.0004825843,0.0001291772,0.00002022938,0.001186396,0.00006679782,0.000001731838,0.000009013558,0.03872476],"genre_scores_gemma":[0.9967731,0.0001144147,0.00278018,0.00003010829,0.00001908113,1.110106e-7,1.480127e-7,0.00003862172,0.0002442996],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03848046,"threshold_uncertainty_score":0.51443,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002412527,0.00009726168,0.000159651,0.000181174,0.00007807097,0.00002866958,0.001418851,0.00001300464,0.00002715231],"category_scores_gemma":[0.0005024172,0.0000611092,0.00009913256,0.0005697821,0.000108844,0.0002484454,0.0001503111,0.0003490627,0.00003376282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002968151,"about_ca_system_score_gemma":0.00005670535,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.004109e-7,"about_ca_topic_score_gemma":2.436763e-8,"domain_scores_codex":[0.9978644,0.0008216052,0.0004533541,0.0001080427,0.0005745862,0.0001779761],"domain_scores_gemma":[0.9980966,0.000229698,0.0005560323,0.0004548458,0.0005722059,0.00009056536],"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.00004551732,0.0001620439,0.0003577879,0.000007210739,0.00002354166,0.000126073,0.0004497641,0.00001672689,0.0006296189,0.9964927,0.000278105,0.001410942],"study_design_scores_gemma":[0.001349339,0.004437797,0.02462045,0.0001524781,0.00001970222,0.0002480057,0.0001185239,0.0006381242,0.02025503,0.9471554,0.0007798705,0.0002252746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6783245,0.0001360017,0.2973952,0.0003206991,0.0007769997,0.0001597398,5.72639e-7,0.00003688546,0.0228494],"genre_scores_gemma":[0.9980056,0.00001818942,0.001796661,0.00005109924,0.00001994668,3.436908e-7,8.293105e-8,0.0000143629,0.00009368491],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3196811,"threshold_uncertainty_score":0.2636602,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009355524,0.0001195909,0.0003014571,0.0001159341,0.0001869038,0.000007589962,0.0005176499,0.00002349874,0.00001027355],"category_scores_gemma":[0.001310566,0.00007435909,0.0003174016,0.0002306929,0.000154855,0.00008013382,0.0001062322,0.0002371341,1.512095e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002301545,"about_ca_system_score_gemma":0.00009482013,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.668259e-7,"about_ca_topic_score_gemma":3.118993e-7,"domain_scores_codex":[0.9984855,0.0003062102,0.0007145906,0.00007296618,0.000294357,0.0001263879],"domain_scores_gemma":[0.9976234,0.0005985583,0.001027359,0.0002562813,0.0004391753,0.00005523412],"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.000102216,0.0001275773,0.001547878,0.0001635731,0.0001584257,0.00001414633,0.02082299,0.00005880578,0.0005253465,0.9713637,0.003013318,0.002101996],"study_design_scores_gemma":[0.001566953,0.0006084783,0.003009942,0.0002750631,0.0001357604,0.0002770039,0.002493485,0.00004686859,0.01050897,0.97971,0.001233371,0.0001341235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9556209,0.0002573742,0.03337507,0.0001035354,0.001114925,0.0002114893,0.000006794245,0.000008953096,0.009300976],"genre_scores_gemma":[0.9954191,0.00002396925,0.004098366,0.00002034147,0.00009680966,3.557574e-7,1.85465e-7,0.00003195923,0.0003088889],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03979824,"threshold_uncertainty_score":0.3032276,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.009453803,0.002117013,0.001034421,0.001531224,0.003480792,0.003711063,0.008535828,0.002506399,0.01621563],"category_scores_gemma":[0.006802146,0.003523662,0.003772011,0.003496812,0.003518859,0.004296464,0.007081145,0.00585061,0.003271937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009880371,"about_ca_system_score_gemma":0.003659473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007827634,"about_ca_topic_score_gemma":0.0005883045,"domain_scores_codex":[0.9776818,0.002065478,0.004919237,0.003521127,0.006808025,0.005004376],"domain_scores_gemma":[0.9794554,0.003732068,0.006353144,0.006110345,0.0009660051,0.003383015],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.006229797,0.001270871,0.00002974025,0.001315384,0.002234562,0.007236511,0.003360818,0.004244052,0.002404765,0.8802742,0.08895098,0.002448311],"study_design_scores_gemma":[0.01074063,0.01039646,0.0003636786,0.00374831,0.002097303,0.0051479,0.002609582,0.4596281,0.4876924,0.003583355,0.009919058,0.004073252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8107993,0.002143189,0.003434495,0.001256423,0.008551617,0.0001340817,0.0005837213,0.0004821747,0.172615],"genre_scores_gemma":[0.9827703,0.002357879,0.006290856,0.001926519,0.003345054,0.0004886514,0.0007525557,0.001609256,0.0004589816],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8766909,"threshold_uncertainty_score":0.999193,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002937275,0.0001022495,0.0001725514,0.0002117632,0.00006183374,0.00004622481,0.0006240068,0.00002082358,0.00000192856],"category_scores_gemma":[0.00007596759,0.00008608388,0.00005108391,0.0002796174,0.00005723184,0.0003806845,0.00009987254,0.000225159,0.000004098283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003820582,"about_ca_system_score_gemma":0.00002615926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001021369,"about_ca_topic_score_gemma":2.49558e-7,"domain_scores_codex":[0.9987132,0.000249668,0.0004183076,0.0001214275,0.0003407799,0.0001566046],"domain_scores_gemma":[0.9988918,0.0001086632,0.0004321836,0.0002787722,0.0001284187,0.0001601906],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00008384487,0.0005253395,0.001576733,0.00002489196,0.00003220313,0.0005775406,0.002742266,0.00006984456,0.004141865,0.9210687,0.0009835572,0.06817321],"study_design_scores_gemma":[0.008941604,0.01578997,0.5179004,0.0008213779,0.00008884332,0.001548012,0.001261827,0.008252328,0.01841514,0.413789,0.0118835,0.001308001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8044008,0.0004379378,0.1921906,0.0000845489,0.0006990794,0.00002942633,3.989277e-7,0.00002169716,0.002135465],"genre_scores_gemma":[0.9975116,0.00004274673,0.002202882,0.000125338,0.00007395655,3.700877e-8,2.562978e-7,0.0000119923,0.00003117699],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5163237,"threshold_uncertainty_score":0.3510399,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001700548,0.0001107034,0.000148446,0.00006915663,0.0001882665,0.00005101795,0.0005527231,0.00002839376,0.00006775791],"category_scores_gemma":[0.0005837439,0.00006592878,0.0001277025,0.0002109633,0.00008763045,0.00004622851,0.00003571631,0.001008723,0.00004405944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008492434,"about_ca_system_score_gemma":0.00002837517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.463214e-8,"about_ca_topic_score_gemma":4.108693e-7,"domain_scores_codex":[0.9988937,0.0003149612,0.0003421579,0.00007237602,0.000250442,0.0001263522],"domain_scores_gemma":[0.9983594,0.0006229376,0.0004055054,0.000365562,0.0001592862,0.00008728622],"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.00001877547,0.000138757,0.0001281472,0.000005351571,0.00002401762,0.00002994459,0.0003038298,0.000002819954,0.0005166447,0.9901883,0.008103821,0.0005395699],"study_design_scores_gemma":[0.0006400105,0.0001666734,0.00273219,0.00002597619,0.00003127618,0.0001378887,0.00005792167,0.000007033322,0.000413019,0.9495197,0.04618246,0.00008583201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9603971,0.00003869163,0.001882326,0.001110645,0.0008709024,0.000104271,0.000002052434,0.00002510875,0.03556886],"genre_scores_gemma":[0.9990274,0.000007838732,0.0001831141,0.0002331285,0.0001552695,8.13453e-7,2.337032e-7,0.0000276216,0.0003645727],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04066861,"threshold_uncertainty_score":0.4382457,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009520731,0.0001182098,0.0001717394,0.000113097,0.00008391722,0.0001899854,0.0006752803,0.00001846447,0.000004175837],"category_scores_gemma":[0.00003362672,0.00009357301,0.00006198049,0.0002327365,0.00004213888,0.0003130408,0.0001546757,0.0002411617,0.00001119945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002499888,"about_ca_system_score_gemma":0.00003129319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001390223,"about_ca_topic_score_gemma":3.351616e-7,"domain_scores_codex":[0.9988542,0.0002643746,0.0003323343,0.0001238815,0.0002563142,0.0001688522],"domain_scores_gemma":[0.99921,0.00008249593,0.0002804672,0.0002324973,0.00009441921,0.0001001086],"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.000009231665,0.0001384599,0.003107282,0.00001544988,0.00002619725,0.001368764,0.0005041011,0.00004173466,0.0004652512,0.9569021,0.01188786,0.02553361],"study_design_scores_gemma":[0.005588599,0.001863119,0.1684633,0.0002675349,0.00006713536,0.004135505,0.0002419709,0.00211715,0.002488269,0.5859444,0.227818,0.001005134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7305189,0.00387541,0.2410074,0.001546041,0.002013289,0.00007070748,0.000001432077,0.0001079948,0.02085884],"genre_scores_gemma":[0.9966867,0.00004287519,0.002685865,0.0001808456,0.0001758559,7.857437e-8,2.896995e-7,0.00001404373,0.0002134694],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3709577,"threshold_uncertainty_score":0.3815797,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001792768,0.0001709223,0.0002900922,0.0003933939,0.0002877434,0.00007622349,0.00198793,0.00002306114,0.00000534822],"category_scores_gemma":[0.0003134873,0.0001506236,0.0002476908,0.000844497,0.0001760727,0.0005946122,0.0002103117,0.0003901578,0.00003112811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005463593,"about_ca_system_score_gemma":0.0001241205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.07941e-7,"about_ca_topic_score_gemma":3.114657e-8,"domain_scores_codex":[0.9977773,0.0004512768,0.000544432,0.0002169669,0.0006065515,0.000403432],"domain_scores_gemma":[0.9976324,0.0003687227,0.0004305899,0.0005036708,0.0007488464,0.0003158062],"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.0002617585,0.0008058971,0.001721484,0.00004791731,0.0001525413,0.0049603,0.001379664,0.0001989001,0.001668074,0.9480988,0.02491073,0.01579397],"study_design_scores_gemma":[0.01294737,0.005616562,0.008935044,0.0001848994,0.00004627077,0.005951307,0.0001143164,0.001929247,0.005686984,0.6558422,0.3016421,0.001103769],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05157327,0.0006313951,0.9411591,0.0004057447,0.001260784,0.0002950128,0.00000342635,0.00005584777,0.004615411],"genre_scores_gemma":[0.9825633,0.000221002,0.01638073,0.0001557245,0.0001244592,0.000004245762,7.153016e-7,0.00003815806,0.0005116249],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.93099,"threshold_uncertainty_score":0.6142253,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002039562,0.0001384869,0.0003039242,0.0001797054,0.00006980746,0.00007368762,0.0003718881,0.00002271736,0.0001960002],"category_scores_gemma":[0.001410079,0.0001112136,0.0001449625,0.0005363088,0.00002522974,0.0002800027,0.00006313786,0.0003153263,0.00008266968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005897966,"about_ca_system_score_gemma":0.00004286049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.134831e-7,"about_ca_topic_score_gemma":1.007647e-7,"domain_scores_codex":[0.9983156,0.0002262341,0.0007332147,0.00008623961,0.0004291565,0.0002095841],"domain_scores_gemma":[0.9981747,0.000270248,0.000690565,0.0001966197,0.0005455894,0.0001223316],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006720984,0.0005186233,0.0008102497,0.000366759,0.0001511431,0.0004690689,0.001900045,0.00001443451,0.00009414527,0.8030284,0.1575541,0.03502573],"study_design_scores_gemma":[0.002009556,0.0006640521,0.0006783438,0.000367375,0.0001080582,0.0004801341,0.000538055,0.00003476781,0.000804377,0.2285807,0.7653651,0.0003695103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6886615,0.00658764,0.03434198,0.002354368,0.001244313,0.0001654281,0.000007493837,0.0001373524,0.2665],"genre_scores_gemma":[0.9914989,0.0002249622,0.004283867,0.0002083408,0.0005227468,1.256559e-7,5.081841e-7,0.0000395695,0.003220998],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.607811,"threshold_uncertainty_score":0.4535157,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000202125,0.0001052448,0.0001972273,0.00008728238,0.00003090333,0.00002839338,0.0002654148,0.00002281457,0.00001219784],"category_scores_gemma":[0.00004794601,0.00007628504,0.0001375657,0.0003771503,0.000009237593,0.0001468111,0.00001403629,0.0001834609,0.000001376108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002892278,"about_ca_system_score_gemma":0.000007612802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.509764e-7,"about_ca_topic_score_gemma":2.399253e-8,"domain_scores_codex":[0.9991023,0.00007269909,0.0004379023,0.0000505274,0.0002465333,0.00009002124],"domain_scores_gemma":[0.9993961,0.00002183702,0.0002393545,0.0001366848,0.0001595346,0.00004650324],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","study_design_scores_codex":[0.00007823356,0.0002293299,0.009096533,0.00006755756,0.0006090715,0.00007203361,0.001236424,0.2448174,0.6345121,0.0909405,0.0009101334,0.0174307],"study_design_scores_gemma":[0.002532592,0.0003616471,0.8804268,0.0002417576,0.000280462,0.00002678548,0.00002605341,0.04698636,0.05196798,0.01237676,0.004300328,0.0004724908],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.990401,0.0001271205,0.005950577,0.00005881342,0.002697918,0.00003568529,0.00000393293,0.00002639851,0.0006985376],"genre_scores_gemma":[0.9995999,0.00008825454,0.0001220909,0.00001530979,0.0001468422,5.372506e-8,0.000004686274,0.00001645043,0.000006368924],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8713303,"threshold_uncertainty_score":0.3110813,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002428361,0.0001120411,0.00034735,0.0001699095,0.00006193112,0.00001143534,0.0003024686,0.00002781688,0.00004980665],"category_scores_gemma":[0.0007326403,0.00009120268,0.0001232413,0.0003595573,0.0001228888,0.0001473659,0.00005462652,0.000265599,0.000009539106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004377081,"about_ca_system_score_gemma":0.00003725649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001434346,"about_ca_topic_score_gemma":4.672874e-7,"domain_scores_codex":[0.9983216,0.0004911587,0.0006557835,0.00008615545,0.0002858659,0.000159436],"domain_scores_gemma":[0.997966,0.000605936,0.0007992137,0.0002337247,0.0003425302,0.00005261254],"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.00007660049,0.0006065776,0.007415816,0.00008294325,0.00005286109,0.0001445862,0.0001563736,0.0000804576,0.0003388745,0.9858186,0.004790377,0.0004359243],"study_design_scores_gemma":[0.0009700145,0.0003593733,0.007677958,0.00003825202,0.00006407777,0.00007164438,0.0001225543,0.000008599977,0.001886154,0.9820622,0.006626694,0.0001124459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.914472,0.001158062,0.03447508,0.00007247405,0.0007004995,0.00006362302,0.000003798265,0.00002074267,0.04903375],"genre_scores_gemma":[0.9962599,0.00003931635,0.002699213,0.00001330381,0.00008624428,9.699541e-8,4.592413e-7,0.00002134022,0.0008801587],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08178789,"threshold_uncertainty_score":0.3719137,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008873136,0.00006802928,0.00009162651,0.00007151469,0.00006160969,0.00008253829,0.0006666802,0.000008044885,0.000001216335],"category_scores_gemma":[0.00001031113,0.00004026459,0.00001973575,0.0003554113,0.000035773,0.0002402541,0.00007897406,0.0001733199,0.000003389771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001010109,"about_ca_system_score_gemma":0.00001588868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001598445,"about_ca_topic_score_gemma":8.44985e-7,"domain_scores_codex":[0.9991995,0.0002016184,0.0002489587,0.00007759895,0.0001714185,0.0001009738],"domain_scores_gemma":[0.9994236,0.00004512225,0.0002257391,0.0001791878,0.00007972254,0.00004663465],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00009418715,0.001013609,0.0122435,0.00002964021,0.00004163706,0.000479085,0.01510681,0.0003213608,0.0001736309,0.8835016,0.00141472,0.08558022],"study_design_scores_gemma":[0.0171428,0.01259065,0.7339753,0.001247325,0.0001788977,0.005126016,0.004372481,0.05306242,0.003636724,0.08926875,0.07735275,0.002045908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7436677,0.00008754892,0.2454955,0.0005254458,0.000167315,0.0001250549,3.765468e-7,0.00001245285,0.009918656],"genre_scores_gemma":[0.9977308,0.00002091748,0.002067283,0.0001229788,0.00002360246,5.199631e-7,1.998014e-7,0.000005719899,0.00002797192],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7942328,"threshold_uncertainty_score":0.1641942,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001446054,0.0001033173,0.0001614085,0.0001210752,0.00006302434,0.00003293132,0.000127844,0.00002012623,0.000004252225],"category_scores_gemma":[0.00005365587,0.00009077349,0.00007955422,0.0001243799,0.00001788786,0.0002382129,0.00001651191,0.0001590752,0.000005668463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001553066,"about_ca_system_score_gemma":0.000003426413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.379445e-8,"about_ca_topic_score_gemma":2.952265e-8,"domain_scores_codex":[0.9992047,0.00013945,0.0002924904,0.00004268847,0.000115032,0.0002056227],"domain_scores_gemma":[0.9994904,0.00008494712,0.00009912749,0.00009758443,0.0000745959,0.0001533613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000314436,0.0005063815,0.07604633,0.001686547,0.0009204532,0.0002833294,0.0111715,0.001171579,0.01367005,0.749503,0.1100321,0.03469434],"study_design_scores_gemma":[0.006356277,0.001310348,0.08641478,0.0007215185,0.0002842286,0.00148183,0.001210792,0.001401406,0.003868252,0.05898854,0.8366956,0.001266477],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9746955,0.009003851,0.00306886,0.00002552459,0.002927006,0.000085719,0.000002322406,0.00004805528,0.01014314],"genre_scores_gemma":[0.9993406,0.000179755,0.0002312822,0.00001340281,0.0001388631,5.745907e-7,4.018267e-7,0.0000400431,0.00005509684],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7266635,"threshold_uncertainty_score":0.3701636,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001090587,0.00009457231,0.0001272681,0.00003529085,0.00009214484,0.00003973978,0.0002806257,0.000005720731,0.0000726887],"category_scores_gemma":[0.00003535894,0.00005684693,0.0001387308,0.0001207145,0.00007168956,0.00003851597,0.00003100781,0.0003090851,0.00008123106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000140803,"about_ca_system_score_gemma":0.00002322644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.042296e-7,"about_ca_topic_score_gemma":5.872819e-9,"domain_scores_codex":[0.9990752,0.0001773235,0.0003155548,0.00005958616,0.0002354577,0.000136914],"domain_scores_gemma":[0.9988003,0.0006675911,0.0002215936,0.0001048808,0.0001164265,0.00008914622],"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.0001044126,0.0001158029,0.0002252008,0.000001262374,0.00003439299,0.00003644032,0.0001185838,0.00009224765,0.00003220783,0.9858685,0.000677719,0.01269324],"study_design_scores_gemma":[0.002051559,0.0005387713,0.003678127,0.00006014515,0.00004480681,0.00001231799,0.0002983839,0.0001639094,0.0009092313,0.9816989,0.01037665,0.0001671697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5863404,0.00002593719,0.1907678,0.000730385,0.001073783,0.00007509089,0.000002611394,0.0000105615,0.2209734],"genre_scores_gemma":[0.9992326,5.970792e-7,0.00004345411,0.0001668527,0.0004104754,1.352487e-7,7.167165e-7,0.00001463546,0.0001305689],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4128921,"threshold_uncertainty_score":0.231815,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004409997,0.0001406233,0.0003024391,0.001200258,0.00006720593,0.0001041454,0.001733056,0.0000313726,0.00001964816],"category_scores_gemma":[0.0002649571,0.0001084618,0.0001955504,0.004629604,0.00006195703,0.0004627095,0.0002667012,0.0004086356,0.00004772625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004482178,"about_ca_system_score_gemma":0.00003144824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003927467,"about_ca_topic_score_gemma":0.000003247128,"domain_scores_codex":[0.9978567,0.0003152667,0.0007532269,0.0001984348,0.0005265469,0.0003498399],"domain_scores_gemma":[0.9984661,0.0002532503,0.0004200661,0.0003752763,0.0002501282,0.0002352151],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00009046091,0.001372063,0.1194065,0.00001764145,0.0001387081,0.01118966,0.0007527793,0.0001183689,0.0002028132,0.7915401,0.00937722,0.06579369],"study_design_scores_gemma":[0.003327179,0.002091491,0.749224,0.00005772219,0.00005202897,0.0005045686,0.0002329934,0.0002891769,0.0003500625,0.1107801,0.1324495,0.0006412013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7124712,0.001408755,0.2637849,0.0006413345,0.002144833,0.00007121347,0.000001602655,0.00005590468,0.01942029],"genre_scores_gemma":[0.9971049,0.0001498838,0.002272038,0.0002461874,0.00003814749,9.592033e-8,6.822415e-7,0.000007906478,0.0001801417],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.68076,"threshold_uncertainty_score":0.4422943,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001441908,0.00009312949,0.0001672046,0.0002423878,0.0001160912,0.0000316063,0.0007147025,0.00001576282,0.00000460428],"category_scores_gemma":[0.0003085434,0.00006545155,0.00004609082,0.0005768418,0.0002214159,0.000320889,0.0001343444,0.0003365745,0.000001037468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001432498,"about_ca_system_score_gemma":0.00007447244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001042964,"about_ca_topic_score_gemma":2.344551e-7,"domain_scores_codex":[0.9979106,0.000886682,0.0004025217,0.0001024053,0.0005406872,0.0001571729],"domain_scores_gemma":[0.9987092,0.0004197207,0.0002673118,0.0002278103,0.0003206764,0.00005525368],"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.00003144596,0.0000719309,0.007331587,0.00001067495,0.0000173969,0.000740007,0.004181203,0.0009496199,0.0001990366,0.985819,0.0002590245,0.000389016],"study_design_scores_gemma":[0.004485413,0.001232671,0.3554333,0.00007841341,0.00001488652,0.00273935,0.0004547774,0.004730221,0.0006599679,0.6238727,0.00591274,0.0003856427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.91172,0.0009606032,0.08485162,0.0007210558,0.0002468751,0.00007243687,0.000003537425,0.000008013236,0.001415822],"genre_scores_gemma":[0.991963,0.0002211539,0.00758686,0.0001048232,0.00003806272,2.207833e-7,5.511091e-7,0.00000905487,0.00007632677],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3619464,"threshold_uncertainty_score":0.2669037,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007094133,0.0001233536,0.0001615096,0.0002335647,0.0001220165,0.0002147885,0.001298215,0.00001164578,0.00004052589],"category_scores_gemma":[0.00006672199,0.00009062477,0.00008231688,0.000586116,0.00007105256,0.001063987,0.0001756432,0.000374521,0.0001078496],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002625123,"about_ca_system_score_gemma":0.00004611154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000107999,"about_ca_topic_score_gemma":2.386444e-7,"domain_scores_codex":[0.9981881,0.0005159359,0.0003393956,0.0001493873,0.0005166912,0.0002904294],"domain_scores_gemma":[0.9982859,0.0001088574,0.0002647497,0.0004582799,0.0006271475,0.0002550319],"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.00006061963,0.0009321601,0.02721546,0.00005599992,0.0002278464,0.001966236,0.001943012,0.0009262292,0.001424882,0.9268252,0.01413356,0.02428879],"study_design_scores_gemma":[0.00552535,0.005790691,0.1737131,0.0003970295,0.00004730321,0.001307932,0.0003225981,0.001030611,0.003628591,0.7825755,0.02466097,0.001000336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1822179,0.0001879999,0.8092193,0.0009092196,0.000389855,0.000144124,0.000001142131,0.00005904641,0.006871376],"genre_scores_gemma":[0.9940922,0.00004515363,0.005464353,0.0001008687,0.00004506652,0.000002254125,3.413279e-7,0.00002090659,0.0002288156],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8118743,"threshold_uncertainty_score":0.3695571,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002118876,0.0001231738,0.0002359384,0.0002895947,0.0001067121,0.00007361083,0.001122213,0.00002690473,0.0000052421],"category_scores_gemma":[0.0002447789,0.0001033579,0.0001525823,0.0006100083,0.0000637044,0.000337928,0.0001972077,0.000555515,0.00001489643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008458482,"about_ca_system_score_gemma":0.00006210604,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.205651e-7,"about_ca_topic_score_gemma":1.475867e-7,"domain_scores_codex":[0.9983832,0.0001859772,0.0006523269,0.000144312,0.0004253886,0.0002088404],"domain_scores_gemma":[0.9980981,0.000127941,0.000660483,0.0003958672,0.0005477521,0.0001698942],"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.000007699593,0.0001706491,0.002979332,0.0000199971,0.00003269963,0.0001769316,0.000493783,0.00004314332,0.03176776,0.9551285,0.001021921,0.008157575],"study_design_scores_gemma":[0.005006416,0.002291063,0.02068373,0.0004609533,0.00008625041,0.0009663643,0.000103379,0.003830481,0.06816186,0.8789701,0.01859514,0.0008443004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9762799,0.0003078025,0.008919479,0.0002402712,0.005107155,0.00003864762,2.615006e-7,0.00004630709,0.009060155],"genre_scores_gemma":[0.989942,0.00003429885,0.009887708,0.00005558848,0.0000143147,1.205235e-7,1.021101e-7,0.00001551594,0.00005038029],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07615845,"threshold_uncertainty_score":0.4214811,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001133185,0.00007101418,0.0001114006,0.0002306294,0.00004817004,0.00009695004,0.0004837175,0.00001031795,0.00000214851],"category_scores_gemma":[0.00008603132,0.00006587872,0.00004842425,0.0005959385,0.00001081955,0.0004889569,0.00007718052,0.0001733697,0.00001913199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000737348,"about_ca_system_score_gemma":0.00009465468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.176405e-7,"about_ca_topic_score_gemma":2.526439e-7,"domain_scores_codex":[0.9989879,0.0001648113,0.0003515623,0.00009247127,0.0002863989,0.0001169118],"domain_scores_gemma":[0.9993992,0.0000495837,0.0001985648,0.0001135232,0.0001687974,0.0000702928],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001183589,0.0002843605,0.001030987,0.00001227593,0.00001721894,0.000882779,0.001331453,0.6465275,0.001067967,0.334009,0.000542899,0.0142817],"study_design_scores_gemma":[0.01895567,0.004326259,0.2204285,0.0008163609,0.00004104878,0.002548869,0.0003837925,0.08798868,0.01680013,0.5801726,0.0658141,0.001723978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5137477,0.0003558517,0.4821481,0.0005478043,0.001133316,0.00002375676,1.185259e-7,0.00001450693,0.002028883],"genre_scores_gemma":[0.9860972,0.0000394743,0.01364503,0.00008042429,0.00008605697,8.173737e-8,2.908027e-7,0.000005778209,0.00004567587],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5585389,"threshold_uncertainty_score":0.2686456,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001404255,0.0001425249,0.0002070863,0.0002014635,0.00008587653,0.000117235,0.001171615,0.00002141364,0.000009281309],"category_scores_gemma":[0.0005699492,0.0001240838,0.0001248346,0.000420481,0.00002655302,0.0002544957,0.00007748331,0.0004150661,0.00005029577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005219505,"about_ca_system_score_gemma":0.00005414478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001164049,"about_ca_topic_score_gemma":1.679759e-7,"domain_scores_codex":[0.9980531,0.000769564,0.000402938,0.0001688042,0.0004242464,0.0001813791],"domain_scores_gemma":[0.998442,0.0003137001,0.0003978768,0.0004698789,0.0002453827,0.0001311772],"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.00001415366,0.0003099322,0.002118512,0.000004043682,0.00004523037,0.0008357271,0.0006659367,0.00005017216,0.001332297,0.9725164,0.01433039,0.007777215],"study_design_scores_gemma":[0.00245099,0.003697613,0.008505168,0.0003798298,0.00004678797,0.0005802872,0.0001015046,0.0005419443,0.04617187,0.84248,0.094155,0.0008890267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3203806,0.0005641539,0.5850291,0.0002895248,0.003846882,0.00006798847,9.212089e-7,0.0002611417,0.08955967],"genre_scores_gemma":[0.9770904,0.00004353934,0.02244345,0.0002569905,0.00003867161,1.904481e-7,1.378922e-7,0.00002183885,0.000104843],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6567097,"threshold_uncertainty_score":0.5059993,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002459749,0.00021439,0.0003541513,0.0001523011,0.0002168102,0.00004464397,0.0005670342,0.00004529606,0.00004355436],"category_scores_gemma":[0.0007999344,0.0001261593,0.000276923,0.0001358376,0.0001379711,0.0002885749,0.00004946563,0.0002266288,0.000005606129],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004596905,"about_ca_system_score_gemma":0.0000337161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.984332e-8,"about_ca_topic_score_gemma":1.067835e-7,"domain_scores_codex":[0.9978985,0.0006895449,0.0006300639,0.0001635736,0.0003321812,0.0002861338],"domain_scores_gemma":[0.9970021,0.00140134,0.0005433958,0.0003762089,0.0004758583,0.0002011568],"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.0002352163,0.0001484672,0.0001804758,0.00003228313,0.00009584158,0.0001061552,0.001654762,0.000002147782,0.0008413489,0.9886978,0.001374637,0.006630843],"study_design_scores_gemma":[0.002427059,0.00124806,0.0009670301,0.0001418236,0.00009517585,0.00009824269,0.0002091612,0.00001772967,0.001146432,0.986043,0.007379191,0.0002271062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5734902,0.000258379,0.4090162,0.0005216453,0.002920744,0.0003004401,0.00004886696,0.00007644917,0.01336713],"genre_scores_gemma":[0.9959295,0.00007114068,0.003122332,0.0001349125,0.0004223916,8.498538e-7,7.570137e-7,0.00008000491,0.000238059],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4224394,"threshold_uncertainty_score":0.5144628,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002265468,0.0001853511,0.0002717114,0.0003499324,0.0001725732,0.0001055192,0.002448341,0.00002594419,0.00003696863],"category_scores_gemma":[0.0001503858,0.0001555313,0.0001945059,0.0006455741,0.00008472671,0.0009066547,0.0004887884,0.0005011469,0.00009882999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005613095,"about_ca_system_score_gemma":0.0001008086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.864769e-7,"about_ca_topic_score_gemma":4.336457e-7,"domain_scores_codex":[0.9974644,0.0006838951,0.0005460187,0.0002229687,0.0005909505,0.0004917528],"domain_scores_gemma":[0.9981962,0.0001131445,0.0004585011,0.0005573846,0.0003488043,0.000326002],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001142255,0.002621707,0.01593447,0.00008755476,0.0003964576,0.009985954,0.01360617,0.00003453826,0.001427787,0.8180806,0.07387435,0.06280817],"study_design_scores_gemma":[0.02075463,0.01367822,0.08852407,0.0003891655,0.0001385483,0.003260524,0.0008878926,0.002174411,0.01727745,0.163681,0.6866454,0.002588762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1734857,0.001405352,0.7396115,0.0002898767,0.006541477,0.0002308447,0.000006881042,0.0001630243,0.07826535],"genre_scores_gemma":[0.9896683,0.00006559995,0.009123161,0.0001447888,0.0002209586,5.669576e-7,3.546409e-7,0.00003359593,0.0007426543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8161826,"threshold_uncertainty_score":0.6342383,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001066179,0.00008055852,0.0001401801,0.0001484896,0.0000513219,0.00001866992,0.0001554273,0.00001448065,0.00003225692],"category_scores_gemma":[0.00016423,0.00005475525,0.0000603523,0.0001565826,0.00005436055,0.0001520292,0.00002436723,0.0001826839,0.00001132546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002374288,"about_ca_system_score_gemma":0.00001514117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.086521e-7,"about_ca_topic_score_gemma":2.132906e-7,"domain_scores_codex":[0.9991201,0.000197434,0.0003418845,0.00007401178,0.0001539636,0.0001126015],"domain_scores_gemma":[0.9991571,0.0003425797,0.000250259,0.0001051613,0.00006347107,0.0000814267],"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.00002161029,0.000116801,0.00344854,0.000006840109,0.00001358595,0.00006100911,0.000156118,3.028902e-7,0.0009476237,0.9930551,0.001110941,0.0010615],"study_design_scores_gemma":[0.0009363933,0.00009162936,0.0217622,0.00006480411,0.00001234139,0.0002119963,0.000041815,0.000001180071,0.0002498148,0.9720635,0.004489222,0.00007510052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9898373,0.0000952663,0.003398986,0.0008938054,0.0001865364,0.00004276852,0.00000168628,0.00001207158,0.005531506],"genre_scores_gemma":[0.9986396,0.00009919213,0.000951779,0.00003482164,0.00004522517,3.844164e-7,9.399075e-8,0.00001658543,0.0002123367],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02099162,"threshold_uncertainty_score":0.2232854,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005330076,0.00009536136,0.0001994352,0.0001239309,0.00004242673,0.00001290313,0.0002226675,0.00001768595,0.0001502066],"category_scores_gemma":[0.00001234162,0.0000868436,0.0001361271,0.0002849251,0.00004025259,0.0001109398,0.000006430227,0.0001910302,0.00005912171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000145146,"about_ca_system_score_gemma":0.000008649281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.038589e-7,"about_ca_topic_score_gemma":1.1513e-7,"domain_scores_codex":[0.9990408,0.0001268392,0.0004816145,0.00004198599,0.0001755272,0.0001332642],"domain_scores_gemma":[0.9995221,0.0000314164,0.0001064616,0.0001530062,0.00009115045,0.00009582806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000416268,0.002144859,0.0113466,0.001056894,0.002119413,0.003170944,0.009778108,0.1553488,0.02007458,0.5831474,0.09045528,0.1209408],"study_design_scores_gemma":[0.009228217,0.003953527,0.03313054,0.001456707,0.0005452555,0.002793283,0.00139563,0.00194956,0.01599552,0.194631,0.7331567,0.001764074],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8609913,0.0009631284,0.0004380888,0.00001924193,0.0007236242,0.00003352239,0.000003579839,0.00004200255,0.1367855],"genre_scores_gemma":[0.9993051,0.0003667256,0.00004613376,0.00001186857,0.00006430929,2.420526e-7,6.428209e-7,0.00002742316,0.0001775096],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6427014,"threshold_uncertainty_score":0.3541379,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002856167,0.0000804431,0.0001899863,0.0003288816,0.00002136388,0.00001995556,0.0001695692,0.000012411,0.00001137242],"category_scores_gemma":[0.00005629476,0.00005909068,0.0001077016,0.0007686787,0.00001123308,0.0001261821,0.000007273738,0.0001233724,0.00000305398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001902139,"about_ca_system_score_gemma":0.000005941984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.586097e-7,"about_ca_topic_score_gemma":1.837785e-8,"domain_scores_codex":[0.9992129,0.00005213209,0.0003950513,0.0000377908,0.0002148071,0.00008731461],"domain_scores_gemma":[0.9994689,0.000007935196,0.00016348,0.00008446039,0.0002240232,0.00005117503],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","study_design_scores_codex":[0.0001418844,0.0004922107,0.009184451,0.00035712,0.00103349,0.0003885131,0.001707487,0.6047384,0.07007742,0.02706407,0.01477977,0.2700351],"study_design_scores_gemma":[0.009411075,0.006004919,0.6162246,0.001166539,0.001239174,0.00067341,0.0006294569,0.06290224,0.2446371,0.02446543,0.03017024,0.002475841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.984821,0.00336761,0.005555937,0.00004612377,0.0004633788,0.00002620806,4.448929e-7,0.00002695598,0.005692369],"genre_scores_gemma":[0.9989829,0.0004373725,0.0004812283,0.00001296537,0.00003770534,2.465885e-8,3.553076e-7,0.00001126387,0.00003617343],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6070402,"threshold_uncertainty_score":0.2409648,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002268893,0.00009243521,0.000224502,0.00005455726,0.00009262628,0.00001673479,0.0003478822,0.00001698404,0.00002017615],"category_scores_gemma":[0.000268065,0.00005854075,0.0001078088,0.0001662979,0.0002319161,0.00008126568,0.00004782176,0.0002490521,0.0000035074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007546641,"about_ca_system_score_gemma":0.00001984302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.169941e-7,"about_ca_topic_score_gemma":2.11871e-7,"domain_scores_codex":[0.9987143,0.0004979428,0.0004526122,0.00006700122,0.0001663768,0.0001017657],"domain_scores_gemma":[0.9988617,0.0002073912,0.0004308739,0.0002404985,0.0001854914,0.00007409258],"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.00006894613,0.0001512959,0.0006600295,0.00001625517,0.0000441064,0.00001720182,0.001566834,2.228088e-7,0.0001415315,0.9966177,0.0005161851,0.0001996826],"study_design_scores_gemma":[0.001701759,0.0001946929,0.008385798,0.00004288443,0.0001003783,0.0001295958,0.0002914197,0.000006957551,0.003979192,0.9841571,0.0009254317,0.00008482098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9739165,0.0001976567,0.001109413,0.0001814469,0.0001609185,0.00009239958,0.00000156311,0.000009410304,0.02433071],"genre_scores_gemma":[0.9983075,0.00008163825,0.001362295,0.00002840546,0.00003920568,4.11971e-7,1.030415e-7,0.00001754234,0.0001629232],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02439099,"threshold_uncertainty_score":0.2387222,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001607346,0.0001223323,0.0003361708,0.000153409,0.00003674316,0.00002027871,0.0004131274,0.00002394513,0.000026782],"category_scores_gemma":[0.0004657999,0.000105854,0.0001238369,0.0003347949,0.00004677587,0.00008602585,0.00006537575,0.0002859052,0.00001562863],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007056636,"about_ca_system_score_gemma":0.00007382649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001883006,"about_ca_topic_score_gemma":0.000001325373,"domain_scores_codex":[0.9984307,0.0001438913,0.0008425723,0.00008710724,0.0003409679,0.0001547527],"domain_scores_gemma":[0.9983561,0.0002008507,0.0008120928,0.0003031377,0.0002250601,0.0001027733],"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.00001228298,0.001045141,0.0005033183,0.0001396974,0.0000320414,0.0001072893,0.001294311,0.00008186693,0.0009248166,0.991065,0.004573924,0.0002202954],"study_design_scores_gemma":[0.002615171,0.0003494368,0.002246125,0.0004107012,0.00005489228,0.0001121619,0.0003151547,0.00003371749,0.003950592,0.9808749,0.008815993,0.0002211866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9370469,0.0001461171,0.0226489,0.000824675,0.0002563852,0.0001551728,0.000003861639,0.00001900376,0.03889895],"genre_scores_gemma":[0.9872825,0.00006137088,0.01239309,0.00001842774,0.00005121624,5.019923e-7,3.148641e-7,0.00003080996,0.0001618165],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05023551,"threshold_uncertainty_score":0.4316599,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004208013,0.0003241564,0.00052569,0.0006429666,0.000208488,0.0001215754,0.001082636,0.00006448834,0.0001743672],"category_scores_gemma":[0.001660163,0.0002772636,0.0003047008,0.001004355,0.0001372567,0.000228759,0.0001121264,0.001142764,0.0002956509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001602728,"about_ca_system_score_gemma":0.00007107435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001039642,"about_ca_topic_score_gemma":0.000001373853,"domain_scores_codex":[0.9954806,0.001635495,0.0009868001,0.000251938,0.001078883,0.0005663097],"domain_scores_gemma":[0.9964454,0.001149933,0.0006562104,0.0006906947,0.0006654185,0.0003924136],"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.0006394962,0.001298509,0.00270234,0.00007644176,0.0002250486,0.00629496,0.001944884,0.00002050811,0.0009927972,0.966686,0.01637406,0.002745006],"study_design_scores_gemma":[0.006879149,0.004643247,0.01565117,0.0004953643,0.0001263122,0.001892828,0.0005865273,0.0001052244,0.0008767133,0.908867,0.05904756,0.0008289229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9188259,0.000166478,0.001009925,0.0002886316,0.001056473,0.0001702347,0.000003854428,0.00008925959,0.0783892],"genre_scores_gemma":[0.9971109,0.0002252492,0.0005454828,0.0001804325,0.0002202264,0.00000106704,0.00000194634,0.0001394506,0.001575251],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07828495,"threshold_uncertainty_score":0.9999679,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005512774,0.0002190902,0.000527755,0.0004608796,0.00008777775,0.00004004284,0.0008757616,0.00004515382,0.00007084248],"category_scores_gemma":[0.001897823,0.0001807721,0.0002720049,0.0004896201,0.0001530189,0.0001183148,0.0001179705,0.0006221118,0.0000598463],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006563107,"about_ca_system_score_gemma":0.00004288439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.110459e-7,"about_ca_topic_score_gemma":2.055602e-7,"domain_scores_codex":[0.9956134,0.001955701,0.0009632767,0.0001655365,0.0009764254,0.000325685],"domain_scores_gemma":[0.996747,0.001043621,0.0009142375,0.0005720628,0.0004793431,0.000243767],"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.0001486854,0.0005791963,0.0008385368,0.00009788779,0.00009384078,0.0001794688,0.0005058813,0.0000267496,0.0033513,0.9844052,0.007977222,0.001796012],"study_design_scores_gemma":[0.004026852,0.003556126,0.005250389,0.0002814322,0.00008958361,0.0001428435,0.00006751926,0.0002425949,0.005172596,0.9730238,0.007829485,0.000316736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9687044,0.00008705022,0.00342297,0.0002348093,0.0007979322,0.0001216587,0.00000433479,0.00003894698,0.0265879],"genre_scores_gemma":[0.9977233,0.00003979229,0.001521871,0.00009445596,0.0001577332,5.907364e-7,0.000001310079,0.00008905809,0.0003718325],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02901896,"threshold_uncertainty_score":0.7371671,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002895341,0.0001759551,0.0003344376,0.0006067593,0.00008730174,0.00003817187,0.002473996,0.00003022892,0.00001750158],"category_scores_gemma":[0.0002557164,0.0001531294,0.0002653814,0.001285512,0.0001881929,0.0006283112,0.0003272285,0.0005766966,0.00001719233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002831838,"about_ca_system_score_gemma":0.0001046473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001022482,"about_ca_topic_score_gemma":1.000127e-7,"domain_scores_codex":[0.9970001,0.001025789,0.0007792035,0.0002113537,0.0006422975,0.0003412473],"domain_scores_gemma":[0.9974023,0.0001346685,0.0007434887,0.000664246,0.0007821516,0.0002731439],"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.00008283417,0.0002955812,0.001405887,0.00001810463,0.00005795557,0.0004536361,0.001171837,0.00000654257,0.003769339,0.9866414,0.0004244788,0.005672373],"study_design_scores_gemma":[0.001562493,0.002268018,0.0180163,0.0001013003,0.00001858606,0.0003447816,0.00008714399,0.00006086216,0.03024019,0.945427,0.001576595,0.0002967442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7097369,0.0009581819,0.235167,0.0001827211,0.002357808,0.0002014876,0.000002255143,0.00008737258,0.05130629],"genre_scores_gemma":[0.9854243,0.0001892393,0.01420437,0.00004085345,0.00002509763,4.58407e-7,1.75768e-7,0.00002855491,0.0000869398],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2756874,"threshold_uncertainty_score":0.6244434,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008919126,0.0001677323,0.0002743184,0.0001516675,0.00006831596,0.00009075998,0.0002249581,0.00001764378,0.00001194402],"category_scores_gemma":[0.0000177861,0.0001290974,0.00006257109,0.0001923666,0.00004307631,0.0002167803,0.00002321069,0.0002600133,0.00002094245],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003384482,"about_ca_system_score_gemma":0.00001335201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.84366e-7,"about_ca_topic_score_gemma":8.625329e-7,"domain_scores_codex":[0.9988265,0.0001942659,0.0004239805,0.00008742074,0.0002714525,0.0001963558],"domain_scores_gemma":[0.9993244,0.00006818893,0.000185774,0.0001502429,0.0001068889,0.0001645099],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.001251009,0.00103215,0.1626478,0.002136395,0.003854498,0.01298075,0.01211131,0.120214,0.0213413,0.454111,0.08469395,0.1236259],"study_design_scores_gemma":[0.02115007,0.004093685,0.1312349,0.002514283,0.0008585687,0.01504108,0.002130771,0.00689126,0.007044535,0.01823738,0.7875656,0.003237898],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9767428,0.005140095,0.002274718,0.00008814925,0.0005705531,0.00006629005,0.000002348604,0.00007200758,0.01504301],"genre_scores_gemma":[0.9989856,0.0003646581,0.0002595523,0.00003744682,0.0002174589,3.718055e-7,4.929008e-7,0.00004815795,0.00008624416],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7028716,"threshold_uncertainty_score":0.5264438,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001372199,0.000117963,0.0002563139,0.0001553397,0.00006930649,0.0000504767,0.0002013851,0.00002635467,0.00000369429],"category_scores_gemma":[0.0001461263,0.00009084856,0.00005903832,0.0001267577,0.0000556452,0.00009129508,0.00007095579,0.0002489737,0.000001237511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002479361,"about_ca_system_score_gemma":0.00001319224,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000177147,"about_ca_topic_score_gemma":4.505444e-7,"domain_scores_codex":[0.9985405,0.0004242286,0.0005689033,0.00008323995,0.0002311993,0.0001519312],"domain_scores_gemma":[0.999121,0.0002312719,0.0003591072,0.000135305,0.00009384612,0.00005952648],"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.00003696327,0.0000945849,0.016442,0.00008844041,0.00002066239,0.0007446987,0.0007081102,0.00002231189,0.00008598697,0.9775444,0.003812528,0.0003993222],"study_design_scores_gemma":[0.002261174,0.0003996371,0.07285468,0.0002534277,0.00004936168,0.0007906482,0.0006225661,0.00009016542,0.000090647,0.9132333,0.009072917,0.0002815164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9851865,0.001319312,0.0002364617,0.00003874025,0.0007490324,0.00005352982,0.000002816123,0.00001094081,0.01240269],"genre_scores_gemma":[0.9992159,0.00005817023,0.0003832011,0.00001303672,0.0001666301,1.745318e-7,3.248716e-7,0.00002605493,0.0001365246],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06431114,"threshold_uncertainty_score":0.3704697,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004476574,0.0001050772,0.0001970847,0.0001817369,0.00006926643,0.0001256327,0.0009755665,0.00001712691,0.000002547208],"category_scores_gemma":[0.0001926678,0.0000904804,0.00004969897,0.0004205534,0.00002172599,0.0009707418,0.0004374361,0.0003048947,0.00001204093],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005056332,"about_ca_system_score_gemma":0.00004040516,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006631183,"about_ca_topic_score_gemma":3.602362e-7,"domain_scores_codex":[0.9979926,0.0007988987,0.0004816074,0.00009748042,0.0003499579,0.0002794841],"domain_scores_gemma":[0.9988682,0.0001796426,0.0003495399,0.0002780917,0.0001732072,0.0001513257],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0000688017,0.001697023,0.4180209,0.00007939035,0.00007672564,0.001066549,0.007258232,0.0005653264,0.000288667,0.4414792,0.01928751,0.1101116],"study_design_scores_gemma":[0.001480375,0.0002830842,0.976354,0.0002247117,0.000005068311,0.0002830673,0.0001033412,0.003782708,0.0002191611,0.003190878,0.01377695,0.0002966485],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2835928,0.001883726,0.7087188,0.0001005692,0.002632099,0.00004947815,0.000001902351,0.0000348233,0.002985889],"genre_scores_gemma":[0.9908955,0.00003814217,0.008820507,0.00005237506,0.0001419971,4.282813e-8,0.000001002745,0.00001112002,0.00003928768],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7073027,"threshold_uncertainty_score":0.3689684,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002831026,0.0003307229,0.0002504867,0.00022354,0.0009420441,0.0006487036,0.001902158,0.0001196142,0.00001390133],"category_scores_gemma":[0.0002801454,0.0002918676,0.0003263911,0.001099098,0.001041071,0.0008139868,0.0003223103,0.0008644321,0.00008680096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002054695,"about_ca_system_score_gemma":0.0004729284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001609958,"about_ca_topic_score_gemma":0.00001029059,"domain_scores_codex":[0.9968129,0.0005905952,0.0007020762,0.0004244191,0.0008526561,0.0006173307],"domain_scores_gemma":[0.9970446,0.0005136065,0.001053367,0.000756565,0.000299179,0.000332638],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001718511,0.0000885182,0.0004962789,0.00005247884,0.000175604,0.0008508245,0.001211119,0.00009348263,0.0004819017,0.9929991,0.0002427816,0.003136009],"study_design_scores_gemma":[0.009030211,0.01539358,0.002644576,0.003818958,0.001134701,0.02972076,0.00501437,0.7679636,0.02253376,0.1117633,0.02766205,0.003320098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9687083,0.0004304707,0.02457637,0.0004007052,0.001173021,0.00004344894,0.00001113577,0.0001147169,0.00454188],"genre_scores_gemma":[0.9932058,0.0002389542,0.005440984,0.0006112438,0.0004123336,0.000005676263,0.000004987367,0.00006576368,0.00001426192],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8812359,"threshold_uncertainty_score":0.9999533,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001480336,0.0001195963,0.0001557861,0.0000600346,0.0002008013,0.0001805009,0.001619457,0.00001424604,0.000007218192],"category_scores_gemma":[0.00009923569,0.00007101669,0.00008912184,0.0002527232,0.00003110099,0.0007532074,0.000531849,0.0003625115,0.0000587874],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003243871,"about_ca_system_score_gemma":0.00003203337,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.966239e-7,"about_ca_topic_score_gemma":1.75401e-8,"domain_scores_codex":[0.9983382,0.0004904412,0.0003911321,0.00009239191,0.0004167731,0.0002710171],"domain_scores_gemma":[0.9985727,0.0001698893,0.000460813,0.0004364485,0.0001770168,0.000183125],"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.00002709606,0.001289849,0.03047445,0.00005977129,0.0001803366,0.0006158153,0.01132284,0.0002534732,0.0005033663,0.2415817,0.05730138,0.65639],"study_design_scores_gemma":[0.002306389,0.001097268,0.3385589,0.0003168186,0.00005746037,0.002176942,0.0001979733,0.009522621,0.0009141433,0.003046571,0.64101,0.0007948343],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09427853,0.004133607,0.8904746,0.000667387,0.005265907,0.00008787493,0.000001483918,0.00005814967,0.005032435],"genre_scores_gemma":[0.9940373,0.00007387412,0.00512292,0.0001635651,0.0005217144,6.518887e-8,3.098535e-7,0.00001348664,0.00006670875],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8997588,"threshold_uncertainty_score":0.300938,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002345804,0.0001275051,0.0003152425,0.000346686,0.00007266809,0.00003299263,0.0005034229,0.00002516112,0.00005494155],"category_scores_gemma":[0.0009804235,0.0001140109,0.000192962,0.0006530588,0.0001252886,0.0001495382,0.00008582742,0.0003511489,0.00001251526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004332625,"about_ca_system_score_gemma":0.00005536723,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002785566,"about_ca_topic_score_gemma":5.935282e-7,"domain_scores_codex":[0.9970477,0.001055671,0.0008836102,0.0001116875,0.0006848637,0.0002164285],"domain_scores_gemma":[0.9973108,0.0006157556,0.0007520495,0.0004053677,0.0008222255,0.0000938214],"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.00009214404,0.0006367587,0.005461167,0.0000736119,0.00009418259,0.0003272289,0.0002500874,0.00005520711,0.003523907,0.9694961,0.0197352,0.0002544032],"study_design_scores_gemma":[0.002098436,0.0006212805,0.02340454,0.0001289397,0.0000933073,0.0001257979,0.000242288,0.00006795643,0.004109075,0.965858,0.003061314,0.0001890867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9388556,0.0002874773,0.002997845,0.0001229,0.0003565689,0.0001213738,0.00000706741,0.00004957744,0.05720157],"genre_scores_gemma":[0.9948819,0.00002109666,0.003568078,0.000003436155,0.00008404506,4.236744e-7,0.000002393749,0.000050602,0.001388082],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05602622,"threshold_uncertainty_score":0.4649229,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003827517,0.0001985062,0.0002692832,0.0002337178,0.0004415714,0.0003163833,0.00245484,0.00003362003,0.000001679646],"category_scores_gemma":[0.0009787367,0.000131378,0.0002067154,0.00117056,0.0001313423,0.0004720308,0.0002214255,0.0005958315,0.000007520499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005571686,"about_ca_system_score_gemma":0.00006495477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.353868e-7,"about_ca_topic_score_gemma":3.261255e-7,"domain_scores_codex":[0.9972591,0.0008931032,0.0004826337,0.0002315195,0.000697112,0.0004365032],"domain_scores_gemma":[0.9968843,0.00132506,0.0005214739,0.0005444479,0.0004876823,0.0002369955],"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.00009412602,0.0001272565,0.0002351051,0.00002319009,0.00009805819,0.00005998979,0.0002924454,0.00004331517,0.0009243349,0.9433083,0.01819621,0.03659767],"study_design_scores_gemma":[0.003295306,0.003179271,0.001596721,0.00005848113,0.00003120284,0.0001649356,0.0001530312,0.001324517,0.002429175,0.6514338,0.3358601,0.00047345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06391734,0.003404184,0.9244617,0.002037223,0.002961418,0.0002591087,0.00000625964,0.00006148397,0.002891309],"genre_scores_gemma":[0.9973941,0.0001271128,0.001955936,0.00009633959,0.0001610393,0.00000214435,9.813134e-7,0.00003418502,0.0002281945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9334767,"threshold_uncertainty_score":0.5357438,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001141262,0.00008094267,0.0001194167,0.0003059942,0.00004637107,0.00004271268,0.0003869821,0.00001341044,0.00001403176],"category_scores_gemma":[0.00006023363,0.00007591503,0.00005278472,0.0005661819,0.00001422933,0.0005234999,0.00003579633,0.0001700536,0.00001206861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003776087,"about_ca_system_score_gemma":0.00005372659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001318852,"about_ca_topic_score_gemma":0.000001293254,"domain_scores_codex":[0.998811,0.0003410658,0.0003753886,0.0001102686,0.000253647,0.0001086272],"domain_scores_gemma":[0.9992667,0.00006379197,0.0002827623,0.0001221488,0.0001878897,0.00007667644],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00007677371,0.0008328388,0.005212642,0.00001784156,0.00004419462,0.0008397561,0.003296254,0.001465731,0.001457315,0.9437993,0.001297252,0.04166017],"study_design_scores_gemma":[0.006591821,0.003504453,0.6230938,0.0001377046,0.00003354244,0.0005602705,0.0001539727,0.0107922,0.01376778,0.3356971,0.005012519,0.0006547832],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3947554,0.000160188,0.5950436,0.0001428831,0.001187208,0.00005493678,6.600312e-7,0.00001910212,0.008635986],"genre_scores_gemma":[0.9913644,0.00002797234,0.008425326,0.00007632347,0.00004831614,2.367648e-7,0.000001206437,0.000005885738,0.00005028582],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6178812,"threshold_uncertainty_score":0.3095725,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002005845,0.0001264307,0.0002050914,0.0001626597,0.0001682099,0.00003229308,0.002026999,0.00001518362,0.00002170973],"category_scores_gemma":[0.0003668545,0.00008256674,0.0001747234,0.0008425463,0.0002014632,0.0002839953,0.0002192278,0.0005161358,0.00005799813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000284724,"about_ca_system_score_gemma":0.00007694982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.477793e-7,"about_ca_topic_score_gemma":2.670496e-8,"domain_scores_codex":[0.9974129,0.0009802184,0.0004496127,0.0001387073,0.0007761013,0.0002424675],"domain_scores_gemma":[0.9978043,0.0005853983,0.0004448001,0.0006045843,0.0004327483,0.0001282054],"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.0000605305,0.0002294578,0.001484695,0.000007783025,0.00003969615,0.0005131888,0.0007667432,0.0001801163,0.0001926182,0.991578,0.003452603,0.001494582],"study_design_scores_gemma":[0.001947778,0.001784648,0.02309174,0.0001541411,0.00001476061,0.001699461,0.00005651401,0.0004752295,0.003780176,0.9587204,0.007943789,0.0003313084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.790298,0.000221565,0.1856779,0.000585855,0.0006102971,0.0001127668,8.964977e-7,0.00002801105,0.02246459],"genre_scores_gemma":[0.9977153,0.0001270373,0.001605375,0.000126572,0.00003356086,4.402543e-7,6.823401e-8,0.00001896287,0.0003726909],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2074172,"threshold_uncertainty_score":0.3766702,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002586488,0.0001494232,0.0002046864,0.00009263241,0.0001030811,0.0000482717,0.0003301691,0.00002870968,0.000009831592],"category_scores_gemma":[0.0000997777,0.00009920608,0.0001592763,0.0001677557,0.00002177306,0.0001516759,0.0000160506,0.0002980898,0.00005625363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004465864,"about_ca_system_score_gemma":0.00000653257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.890595e-7,"about_ca_topic_score_gemma":1.927624e-8,"domain_scores_codex":[0.9986589,0.0003368819,0.0004361351,0.00005453213,0.0002444697,0.0002690619],"domain_scores_gemma":[0.9991072,0.0002624663,0.0001751316,0.0002219527,0.00009460007,0.0001385998],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00005819712,0.0001029443,0.0003101967,0.0001359254,0.0001641618,0.0000715232,0.0007150358,0.002831234,0.0007668592,0.9646116,0.0297975,0.0004348407],"study_design_scores_gemma":[0.002828698,0.001035174,0.002512163,0.0005959725,0.000137575,0.001017974,0.0007415668,0.004836274,0.000965297,0.009972869,0.9747196,0.0006368334],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9533036,0.003922448,0.007997316,0.00006560629,0.01141237,0.0002358692,0.000007319457,0.00007586106,0.02297959],"genre_scores_gemma":[0.9987069,0.00003771185,0.00003147843,0.00004150119,0.0008306872,0.00000154717,6.975704e-7,0.00006291445,0.0002865408],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9546387,"threshold_uncertainty_score":0.4045506,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001267353,0.0001011816,0.0002077269,0.0001134031,0.00007224242,0.00004290891,0.0003920434,0.00001668724,0.0005207885],"category_scores_gemma":[0.0002811061,0.00008318706,0.0001190786,0.0004183506,0.00002445394,0.00007217403,0.00002373021,0.0002220827,0.0001852686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002626844,"about_ca_system_score_gemma":0.00002379569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.911486e-8,"about_ca_topic_score_gemma":2.024334e-8,"domain_scores_codex":[0.9987544,0.0001336346,0.0005794395,0.00006894407,0.0003276282,0.0001359827],"domain_scores_gemma":[0.9988153,0.0002573828,0.0003453283,0.0002629018,0.0001978921,0.0001212148],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002213026,0.001287144,0.0002423904,0.000109384,0.0001093872,0.0002523698,0.0009662659,0.00001854515,0.0002012748,0.5437945,0.4075158,0.0454809],"study_design_scores_gemma":[0.001071468,0.0002931262,0.0003614667,0.00008586082,0.00008705895,0.0002898817,0.00007445138,0.0001095018,0.0003635574,0.3862367,0.6107932,0.000233751],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4856068,0.0004163989,0.02183136,0.0006009464,0.0004145344,0.0001647451,0.000004032495,0.00007034251,0.4908908],"genre_scores_gemma":[0.9809539,0.0001907066,0.01321842,0.00006440265,0.0001541105,4.652806e-7,3.904361e-7,0.00004269434,0.005374946],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4953471,"threshold_uncertainty_score":0.5702269,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007848995,0.0001156282,0.0001783406,0.00009321948,0.00005769419,0.00004691513,0.0001826142,0.00002328921,0.000004694297],"category_scores_gemma":[0.00002239282,0.0001071345,0.00006077935,0.0001063385,0.00003302607,0.0001498301,0.00002114986,0.0003012158,0.00001992406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003212581,"about_ca_system_score_gemma":0.000009904298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.160209e-7,"about_ca_topic_score_gemma":1.0791e-7,"domain_scores_codex":[0.9992109,0.0001046237,0.0003234638,0.00006272303,0.0001554565,0.000142822],"domain_scores_gemma":[0.9995511,0.00001998648,0.0000912948,0.000119647,0.0000849328,0.0001330618],"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.0001668029,0.0008332568,0.01602261,0.001040144,0.0009482267,0.004266063,0.01257631,0.06208729,0.03362032,0.8502595,0.008834006,0.009345442],"study_design_scores_gemma":[0.01847816,0.003302147,0.06378376,0.00163138,0.0003981572,0.007774324,0.001197477,0.001937335,0.0264991,0.6536558,0.2187212,0.002621183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9826433,0.001985305,0.007872078,0.00006390585,0.001349532,0.00003671692,0.000001660858,0.00005261009,0.005994897],"genre_scores_gemma":[0.9993857,0.0002549681,0.0001637071,0.00002296641,0.00009282606,4.390409e-8,4.40508e-7,0.00003207225,0.0000472595],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2098872,"threshold_uncertainty_score":0.4368818,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002379349,0.0001903789,0.0003859474,0.0001530566,0.00007406604,0.00003475141,0.0004035182,0.00003532186,0.00001827072],"category_scores_gemma":[0.003174806,0.00009590941,0.00008351914,0.0002648935,0.0001547899,0.0001940892,0.0001509576,0.0003495559,0.00003076758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001033476,"about_ca_system_score_gemma":0.00002917412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.820185e-7,"about_ca_topic_score_gemma":2.781183e-7,"domain_scores_codex":[0.9977468,0.0007630568,0.0006826382,0.0001310262,0.000460589,0.000215894],"domain_scores_gemma":[0.996361,0.002359048,0.000605872,0.0003292352,0.0002379445,0.0001068841],"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.0002588048,0.0001790712,0.0001533563,0.000032676,0.00002493369,0.0001157644,0.0005987083,0.000002452373,0.00006845039,0.9941646,0.002852199,0.001548916],"study_design_scores_gemma":[0.009099621,0.0004041185,0.0001876113,0.0004010852,0.00003032261,0.00007826594,0.0001239054,0.00004123323,0.0001214092,0.9872361,0.00212867,0.0001476273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9606265,0.0001896972,0.01791695,0.002793355,0.002096385,0.0003340852,0.000001792905,0.00003762581,0.01600354],"genre_scores_gemma":[0.9981983,0.0001343385,0.001140777,0.0001179147,0.00007036246,9.490329e-7,7.571352e-8,0.00005075523,0.0002865449],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03757171,"threshold_uncertainty_score":0.3911072,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001595998,0.000176445,0.0004993695,0.0003185501,0.00005256918,0.00001170105,0.001911264,0.00003165039,0.00002462058],"category_scores_gemma":[0.0005864142,0.0001254647,0.0002491558,0.0007380806,0.0003369843,0.0003955457,0.0003824845,0.0002174123,0.0000170947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005618944,"about_ca_system_score_gemma":0.0001057505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.368214e-7,"about_ca_topic_score_gemma":2.981797e-7,"domain_scores_codex":[0.9969422,0.0007327794,0.0009230857,0.0002026937,0.0008965092,0.0003027909],"domain_scores_gemma":[0.9960698,0.0009173297,0.001256658,0.0006305264,0.0009151309,0.000210527],"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.001841239,0.001707745,0.0276497,0.0004680764,0.0006540196,0.001086302,0.004100913,0.0001179176,0.1646421,0.7473739,0.01161128,0.03874686],"study_design_scores_gemma":[0.02010644,0.01341549,0.1588016,0.002558745,0.0001263938,0.0008249118,0.0004946777,0.0003042683,0.1821958,0.6133743,0.006584188,0.00121327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9717867,0.0006737382,0.02157034,0.0003642811,0.0007898163,0.0001281404,0.00002578433,0.00001620045,0.004644951],"genre_scores_gemma":[0.9967055,0.0002151074,0.002495718,0.00001769873,0.00001347232,1.886028e-7,2.123063e-7,0.00002443768,0.0005276066],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1339996,"threshold_uncertainty_score":0.5116304,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005854929,0.000115923,0.000204007,0.0001664221,0.0001623917,0.00008526522,0.00192226,0.00001747136,0.000008583715],"category_scores_gemma":[0.0002550567,0.00007757725,0.0001673766,0.0006651009,0.0001430704,0.0004731733,0.0001205774,0.0002906506,0.000009173813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002942578,"about_ca_system_score_gemma":0.00005781363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.168025e-7,"about_ca_topic_score_gemma":2.014684e-7,"domain_scores_codex":[0.9981325,0.0003232863,0.0005896639,0.0001268935,0.0005352159,0.0002924447],"domain_scores_gemma":[0.9973873,0.0007703031,0.000466972,0.000566821,0.0006474702,0.0001611707],"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.000105975,0.0003860766,0.002411616,0.00004250315,0.00008602972,0.000132824,0.0009643827,0.0001483045,0.001771481,0.9703104,0.0005450427,0.02309536],"study_design_scores_gemma":[0.003414831,0.003045107,0.0241007,0.000136755,0.00005555598,0.0006767323,0.0003353402,0.004349721,0.008318078,0.9405162,0.01466816,0.000382864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2367862,0.0003886739,0.7603925,0.0002039534,0.0006778142,0.0001261287,9.574021e-7,0.00001654553,0.001407134],"genre_scores_gemma":[0.9856693,0.00005317303,0.01399009,0.00007583165,0.00008359136,4.315828e-7,2.441778e-7,0.00002335181,0.0001039839],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7488831,"threshold_uncertainty_score":0.3572069,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002596299,0.0001119911,0.0002134175,0.000156106,0.00007020469,0.00003020538,0.001135228,0.00001712156,0.00003906731],"category_scores_gemma":[0.0004444305,0.00009230599,0.0001241372,0.0003718854,0.000121523,0.0004515241,0.0001658911,0.0003766651,0.00001385349],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005485157,"about_ca_system_score_gemma":0.00005759977,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.450342e-7,"about_ca_topic_score_gemma":3.517896e-8,"domain_scores_codex":[0.9978437,0.0008015517,0.0004577878,0.0001498589,0.0005626585,0.0001843868],"domain_scores_gemma":[0.9982264,0.000380873,0.0004764204,0.0003806805,0.0004020157,0.0001335998],"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.0004431771,0.0009689299,0.002382311,0.00002754023,0.00007438292,0.0001614865,0.00169735,0.000033811,0.003826378,0.9709068,0.0009777842,0.01850005],"study_design_scores_gemma":[0.004365585,0.006037853,0.02180227,0.0001996978,0.00002379345,0.0001757418,0.0003704374,0.0003308446,0.1770224,0.7750325,0.01411843,0.0005204996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3591928,0.0004573383,0.6059493,0.0001285845,0.001007529,0.0001057882,0.000006168488,0.00003504525,0.03311742],"genre_scores_gemma":[0.9973921,0.00004901249,0.002435593,0.00002891516,0.0000316765,2.793275e-7,2.026704e-7,0.00001417645,0.00004801129],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6381993,"threshold_uncertainty_score":0.3764129,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002733778,0.0001165866,0.000209142,0.0003066509,0.0001131765,0.00009029175,0.0008563519,0.00002157726,0.000007060809],"category_scores_gemma":[0.0001235252,0.00008723527,0.0001033915,0.001603262,0.0001041783,0.0003261258,0.00004122835,0.0003507835,0.000001393908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000175217,"about_ca_system_score_gemma":0.0000321638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.88935e-7,"about_ca_topic_score_gemma":3.571435e-7,"domain_scores_codex":[0.997195,0.001761036,0.0004159793,0.0001265317,0.0003509439,0.0001504761],"domain_scores_gemma":[0.998797,0.0005584068,0.0002188831,0.0002406192,0.000118754,0.00006635839],"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.0000368904,0.0002804746,0.0007701064,0.000007561376,0.00001937953,0.0001007749,0.002332244,0.00000733459,0.00002694307,0.9839909,0.00001798274,0.01240942],"study_design_scores_gemma":[0.001515528,0.0009663846,0.08197567,0.00005004595,0.00003023666,0.0001039899,0.0001224668,0.00006890892,0.00007293889,0.913194,0.001760143,0.0001396616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7585555,0.001153061,0.1862089,0.0002827835,0.001289399,0.0001721213,0.000003677005,0.00003051133,0.05230408],"genre_scores_gemma":[0.9994565,0.0001244615,0.0002907277,0.0000623089,0.00005379654,2.371804e-7,4.090568e-7,0.000007759751,0.000003765709],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2409011,"threshold_uncertainty_score":0.3557351,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001525112,0.0001196649,0.0002058071,0.0001961721,0.0001579798,0.000041682,0.001599632,0.00001661282,0.00001259537],"category_scores_gemma":[0.0001547523,0.00009999311,0.000120255,0.0005890575,0.0002219659,0.0005697748,0.0002978947,0.0004972211,0.0001152768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005725162,"about_ca_system_score_gemma":0.0001094302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.098071e-7,"about_ca_topic_score_gemma":2.894928e-8,"domain_scores_codex":[0.9978216,0.0006877033,0.0004152243,0.0001484662,0.0006569633,0.000270008],"domain_scores_gemma":[0.9983884,0.0001394391,0.0002729981,0.0004326836,0.0005148253,0.0002517219],"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.00008456446,0.0004558598,0.002872961,0.0000195032,0.00007412776,0.01090805,0.00112138,0.0006134789,0.0005985805,0.9497974,0.01022803,0.02322607],"study_design_scores_gemma":[0.01338415,0.007871612,0.06277543,0.0002291296,0.00003918203,0.01770896,0.0003111002,0.009988224,0.01616637,0.5150256,0.3546724,0.001827827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06027404,0.000418552,0.9253501,0.0003285008,0.0007616582,0.00004095474,3.238786e-7,0.00004104861,0.01278484],"genre_scores_gemma":[0.9945851,0.0001040836,0.004506607,0.0001286203,0.00006417237,1.496884e-7,1.1562e-7,0.00001780367,0.0005933748],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.934311,"threshold_uncertainty_score":0.4077601,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}