{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":477,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":477,"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":"87e7fe313859","filters":{"venue":"The Electronic Journal of Combinatorics"}},"results":[{"id":"W1584631835","doi":"10.37236/1832","title":"Pólya's Permanent Problem","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":137,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Invertible matrix; Mathematics; Sign (mathematics); Square (algebra); Combinatorics; Square matrix; Matrix (chemical analysis); Zero (linguistics); Polynomial; Discrete mathematics; Pure mathematics; Symmetric matrix; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.00503819198431989,"gpt":0.214211948657631,"spread":0.2091737566733111,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001364748,0.0001145638,0.0001685342,0.00007753466,0.0001580608,0.00008485527,0.00156335,0.0000373643,0.000005360067],"category_scores_gemma":[0.00002227129,0.00007173193,0.000120615,0.0004230776,0.00004019852,0.0003253554,0.0001117518,0.000604378,0.00002580996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002752974,"about_ca_system_score_gemma":0.0005389503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002955081,"about_ca_topic_score_gemma":7.086937e-7,"domain_scores_codex":[0.9986268,0.00009797694,0.0003124817,0.00009977634,0.0004074489,0.0004555421],"domain_scores_gemma":[0.999087,0.00007034626,0.0002877733,0.0003253043,0.0001541932,0.00007534793],"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.000007749599,0.00009546911,0.000004217856,0.000004266468,0.00002794195,0.00001685846,0.0002998177,0.000415031,0.00009903941,0.9975734,0.0001101778,0.001346033],"study_design_scores_gemma":[0.0007297694,0.0005034969,0.00002658248,0.00001749619,0.00001417612,0.0007023697,0.000026509,0.000136563,0.001840071,0.9875685,0.008341116,0.00009336321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0632178,0.005827976,0.9142156,0.009803955,0.001199718,0.0002002981,3.205295e-7,0.00006139703,0.005472922],"genre_scores_gemma":[0.9986728,0.0003350894,0.0003979048,0.0001472031,0.0001093415,0.000001359007,1.022513e-7,0.000007081557,0.0003291244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.935455,"threshold_uncertainty_score":0.2925143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1575622900","doi":"10.37236/1819","title":"Short Cycles in Random Regular Graphs","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":112,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Australian Research Council","keywords":"Mathematics; Combinatorics; Bipartite graph; Random regular graph; Random graph; Discrete mathematics; Degree (music); Poisson distribution; Random variable; Chordal graph; Graph; Statistics; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01336264396624669,"gpt":0.2724877291639331,"spread":0.2591250851976864,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002186886,0.0001637448,0.0003825908,0.0001882022,0.0001611458,0.00002262624,0.0006306351,0.00009001625,0.000005620826],"category_scores_gemma":[0.0002419065,0.00009922156,0.0002273836,0.0004172421,0.0001116364,0.0001134457,0.00005769828,0.0008997131,6.596838e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002634398,"about_ca_system_score_gemma":0.0002264393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003333822,"about_ca_topic_score_gemma":0.000009130836,"domain_scores_codex":[0.9982505,0.0001708189,0.0005586653,0.00009482702,0.0004364605,0.0004887057],"domain_scores_gemma":[0.9988929,0.0003647702,0.0002451051,0.0003215417,0.0001200683,0.00005560363],"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.0001516753,0.0001081028,0.0003515421,0.00001140821,0.00008777643,0.00002164297,0.0006837862,0.00008989061,0.00009370601,0.9980158,0.0000633615,0.0003213336],"study_design_scores_gemma":[0.002542655,0.0002138528,0.0006011384,0.00004966406,0.00006846878,0.0002717308,0.0001800451,0.000002821946,0.001573903,0.9940475,0.0003305306,0.0001176551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9914814,0.003484399,0.00306027,0.0004478948,0.0004366225,0.0001511936,3.541001e-7,0.000014893,0.0009229578],"genre_scores_gemma":[0.9987859,0.0009726958,0.00005817465,0.000048676,0.00006402356,0.000002139803,1.762914e-7,0.0000241182,0.00004412642],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007304453,"threshold_uncertainty_score":0.4046138,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1798981749","doi":"10.37236/999","title":"On the Quantum Chromatic Number of a Graph","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; University of Bristol","keywords":"Mathematics; Combinatorics; Chromatic scale; Discrete mathematics; Critical graph; Windmill graph; Friendship graph; Graph; Clique number; Quantum; Brooks' theorem; Graph power; Line graph; Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.008306689640085747,"gpt":0.2395849130024391,"spread":0.2312782233623534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004197172,0.0001137388,0.0002022474,0.0001059106,0.0001501233,0.00003480129,0.001269704,0.00004196768,0.000006957782],"category_scores_gemma":[0.0001452229,0.00005611205,0.0001576924,0.0008714646,0.00008845272,0.0001039618,0.00006680362,0.0005843178,0.00001211689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006609964,"about_ca_system_score_gemma":0.0002115191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006279655,"about_ca_topic_score_gemma":0.000001207918,"domain_scores_codex":[0.9982278,0.0001415607,0.000495997,0.00008926017,0.0006106902,0.0004346424],"domain_scores_gemma":[0.9978218,0.0008295997,0.0005523761,0.0004793568,0.0002602292,0.00005664049],"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.00001485363,0.000118249,0.00006357295,0.000004716468,0.00004723609,0.000004082195,0.0002861521,0.0000372082,0.0003953392,0.9981318,0.0006973477,0.0001995072],"study_design_scores_gemma":[0.0003790825,0.0004605622,0.0001681784,0.0000456509,0.00001927776,0.0001880179,0.00004643217,0.0006698661,0.003135105,0.9946373,0.0001840219,0.00006650636],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9095691,0.001405405,0.08478937,0.002544449,0.0006063349,0.0000965058,1.054804e-7,0.00002025026,0.0009685017],"genre_scores_gemma":[0.9994851,0.0001373822,0.00006141346,0.0002501386,0.000008492238,6.107051e-7,4.240193e-8,0.000007520905,0.00004925486],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.08991607,"threshold_uncertainty_score":0.2538603,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123221405","doi":"10.37236/1659","title":"The Number of Labeled 2-Connected Planar Graphs","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":89,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Chordal graph; 1-planar graph; Clique-sum; Discrete mathematics; Indifference graph; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01642320628677946,"gpt":0.2645024867667231,"spread":0.2480792804799437,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001543184,0.0001636581,0.0003387837,0.00005795598,0.0004226316,0.00002469025,0.0009052312,0.00008454255,0.00007407898],"category_scores_gemma":[0.0005296816,0.0000802781,0.0002382988,0.0004385689,0.0001939807,0.00007105669,0.00004725749,0.0008212228,0.000003179431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008203099,"about_ca_system_score_gemma":0.00006385277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002024703,"about_ca_topic_score_gemma":0.00000308952,"domain_scores_codex":[0.998008,0.0002963791,0.0006218314,0.00007855947,0.0005045128,0.0004907093],"domain_scores_gemma":[0.996682,0.001746512,0.0007634301,0.0004373831,0.0003168898,0.00005380871],"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.0000604631,0.00008915253,0.0003106309,0.00001255952,0.0002725389,0.000003792557,0.0006469653,9.391431e-7,0.00009711909,0.9955233,0.002662603,0.0003199095],"study_design_scores_gemma":[0.000821361,0.0002096946,0.0001071619,0.00002156456,0.0001261266,0.0002932528,0.0001859453,0.00003194068,0.0008861713,0.9940214,0.003197648,0.0000977325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.988877,0.004904623,0.0003304895,0.0007622265,0.0007013995,0.0001402817,0.00000159607,0.00001864661,0.004263746],"genre_scores_gemma":[0.997157,0.002082739,0.00002833218,0.00004684695,0.00006416313,0.000001578325,1.415396e-7,0.00002428934,0.0005948835],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008280034,"threshold_uncertainty_score":0.356785,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2770859862","doi":"10.37236/1671","title":"There Are Ternary Circular Square-Free Words of Length $n$ for $n\\ge 18$","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"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","keywords":"Mathematics; Ternary operation; Combinatorics; Square (algebra); Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01556969058956936,"gpt":0.2225624394145583,"spread":0.206992748824989,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001411338,0.0001775538,0.0003608244,0.0001177849,0.0001341703,0.00006096052,0.002889347,0.00007455754,0.00002739419],"category_scores_gemma":[0.0001039102,0.0001212775,0.0002813306,0.0004149495,0.00006403985,0.0003334704,0.0001776747,0.0004856964,0.000004075478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001701984,"about_ca_system_score_gemma":0.0001219732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003436784,"about_ca_topic_score_gemma":0.000001056801,"domain_scores_codex":[0.9981364,0.000159415,0.0004969581,0.000157482,0.0005058239,0.0005439352],"domain_scores_gemma":[0.9976894,0.0003815762,0.0007724494,0.0008542462,0.0002300906,0.00007222693],"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.00003187917,0.0003273418,0.0004054668,0.00005685428,0.0002349965,0.00002394767,0.00102669,0.00009428849,0.0004675711,0.9873982,0.004669967,0.005262808],"study_design_scores_gemma":[0.00176814,0.001040239,0.000507098,0.0001003019,0.00007079644,0.0002806936,0.0002645572,0.01387437,0.002579047,0.9737142,0.005591516,0.000208989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.426359,0.04720258,0.5182015,0.005131393,0.001422052,0.0004197735,0.000006272639,0.00008588729,0.001171574],"genre_scores_gemma":[0.998369,0.0009263416,0.0001516479,0.0001202865,0.0001218968,0.00000434163,2.211441e-7,0.00002127965,0.0002850133],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.57201,"threshold_uncertainty_score":0.5369174,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104925482","doi":"10.37236/1495","title":"Restricted permutations, continued fractions, and Chebyshev polynomials","year":2000,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":77,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Chebyshev polynomials; Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01626977213501819,"gpt":0.2823365822993558,"spread":0.2660668101643376,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001100143,0.0001523883,0.0003715701,0.0001023678,0.0002594151,0.00006913804,0.0002407243,0.00008863187,0.0006040618],"category_scores_gemma":[0.0007157953,0.0001008381,0.0001194186,0.0003272456,0.00006942418,0.0001566672,0.00001735193,0.0005891555,0.00002276008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001327533,"about_ca_system_score_gemma":0.0002448052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000082293,"about_ca_topic_score_gemma":0.000003415613,"domain_scores_codex":[0.9983469,0.0002171287,0.000674722,0.00009710406,0.0002952002,0.0003689447],"domain_scores_gemma":[0.9976695,0.001409848,0.0003876936,0.0002577832,0.0001801612,0.00009502798],"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.0001040268,0.0002393322,0.00006307889,0.00002400222,0.0001608799,0.000003930438,0.0004484115,0.000004705458,0.0003471339,0.9829788,0.01296622,0.002659489],"study_design_scores_gemma":[0.0009262197,0.0002919552,0.0003298476,0.00003377319,0.0002012229,0.0003744023,0.0002247083,0.00006677377,0.0004277523,0.961982,0.03501363,0.0001276754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9850316,0.002996201,0.003803903,0.002451789,0.0002571068,0.0002640705,0.000003483778,0.00003607195,0.005155793],"genre_scores_gemma":[0.9934191,0.001694735,0.0001226931,0.00008797296,0.0001662028,0.000006183758,7.875282e-7,0.00002285426,0.004479473],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02204741,"threshold_uncertainty_score":0.6614053,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1836341359","doi":"10.37236/2475","title":"Recurrence Relations and Splitting Formulas for the Domination Polynomial","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Cape Breton University","funders":"European Social Fund","keywords":"Mathematics; Combinatorics; Graph; Polynomial; Reduction (mathematics); Recurrence relation; Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01530257340099532,"gpt":0.288004921558996,"spread":0.2727023481580007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003887279,0.00008037292,0.0001077784,0.0000821301,0.0004742397,0.00007156511,0.0008000335,0.00003280477,0.000001087546],"category_scores_gemma":[0.000514367,0.00004577196,0.00006960663,0.0003910238,0.00007688408,0.0007768826,0.0001139725,0.0005085122,0.000001587721],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001703447,"about_ca_system_score_gemma":0.0001851427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.762191e-7,"about_ca_topic_score_gemma":7.525136e-7,"domain_scores_codex":[0.9987589,0.0001320164,0.0002492927,0.00007380047,0.0002847951,0.0005012144],"domain_scores_gemma":[0.9972565,0.001917716,0.0002870418,0.0002465075,0.0002298592,0.00006239535],"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.00002585097,0.00002656006,0.0002740867,0.000002732423,0.00002206829,1.061084e-7,0.000576132,0.00003139284,0.00008542398,0.9851201,0.0001825799,0.01365293],"study_design_scores_gemma":[0.0006943279,0.0003105289,0.001307284,0.0000130605,0.0000277926,0.0001360746,0.0001297767,0.007083494,0.0009372034,0.9794157,0.00985931,0.00008550094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05011444,0.008816547,0.9368216,0.003256177,0.0005578571,0.0002587562,4.01052e-7,0.00001022684,0.0001640213],"genre_scores_gemma":[0.9987296,0.0003677979,0.0005653241,0.00003343465,0.0001423561,0.000008325567,1.347253e-7,0.000006837218,0.0001461518],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9486152,"threshold_uncertainty_score":0.3647516,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1568296425","doi":"10.37236/1533","title":"Large Equiangular Sets of Lines in Euclidean Space","year":2000,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Equiangular polygon; Mathematics; Combinatorics; Euclidean space; Upper and lower bounds; Constructive; Euclidean geometry; Integer (computer science); Euclidean distance; Space (punctuation); Order (exchange); Dimension (graph theory); Set (abstract data type); Discrete mathematics; Geometry; Mathematical analysis; Regular polygon; Process (computing); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.00353167202720187,"gpt":0.200087413656909,"spread":0.1965557416297072,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001240919,0.0001146448,0.0002720809,0.0001104407,0.00003034359,0.00000972874,0.0003379878,0.00006128487,0.0000575319],"category_scores_gemma":[0.00002053593,0.00008456927,0.0001089087,0.0004178778,0.00002305513,0.00009395496,0.000009704084,0.0004915923,0.000007981342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009799472,"about_ca_system_score_gemma":0.00005672805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003149662,"about_ca_topic_score_gemma":0.000009171376,"domain_scores_codex":[0.9988015,0.0001110055,0.0004175706,0.00004879861,0.0002114634,0.0004096532],"domain_scores_gemma":[0.999531,0.0000798559,0.0001094455,0.0001845496,0.00005466705,0.00004049285],"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.0001109389,0.0002047843,0.001181053,0.0001057879,0.0002030746,0.0000361972,0.002242399,0.01126356,0.002657792,0.9798656,0.0006636636,0.001465124],"study_design_scores_gemma":[0.002612866,0.0006323789,0.001193815,0.0002347351,0.00008070702,0.0003298635,0.0007469524,0.003246437,0.01156613,0.9500837,0.0289519,0.0003205373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9870125,0.01007234,0.0004484102,0.0001025826,0.000277361,0.00006924574,0.000001157541,0.00001754897,0.001998854],"genre_scores_gemma":[0.9985778,0.001134212,0.000002099465,0.00001016965,0.00004866644,9.743108e-7,3.729301e-7,0.00002049055,0.0002051616],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02978194,"threshold_uncertainty_score":0.3448635,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4248533316","doi":"10.37236/510","title":"Periodic Graphs","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Molecular spectroscopy and chirality","field":"Chemistry","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Adjacency matrix; Vertex (graph theory); Eigenvalues and eigenvectors; Discrete mathematics; Graph; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01176006144005606,"gpt":0.2210379499606552,"spread":0.2092778885205991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005043299,0.0001298389,0.0001967131,0.00004017933,0.0001310712,0.00002055554,0.0006338751,0.00006928379,0.0005206781],"category_scores_gemma":[0.00003835822,0.00008678376,0.0002072748,0.0001748268,0.00008451763,0.0000759295,0.00003707032,0.0008529183,0.000009934927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000145794,"about_ca_system_score_gemma":0.0002628395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001065379,"about_ca_topic_score_gemma":0.000002892697,"domain_scores_codex":[0.9987783,0.00004619449,0.0003269225,0.00008579344,0.000316499,0.0004462541],"domain_scores_gemma":[0.9991474,0.00002745051,0.0003253308,0.0003160042,0.0001098267,0.00007396085],"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.00009997798,0.0001799787,0.001244453,0.00001522131,0.0001293719,0.00002365342,0.0007029993,5.903551e-7,0.01045575,0.9867681,0.0001624681,0.0002174464],"study_design_scores_gemma":[0.0005977076,0.0002607198,0.0003698223,0.00001656891,0.00009328506,0.0002909416,0.0001450849,0.00000485568,0.1228179,0.8694889,0.005789264,0.0001249761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9540164,0.004189221,0.001201942,0.0001551552,0.0002282529,0.00002592545,5.770276e-7,0.00002001655,0.04016249],"genre_scores_gemma":[0.9987959,0.0005928259,0.000009957483,0.00006444242,0.0000561083,0.000001273906,3.923347e-7,0.00001603228,0.0004630168],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1172792,"threshold_uncertainty_score":0.570106,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1764008429","doi":"10.37236/161","title":"Counting Abelian Squares","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Abelian group; Combinatorics; Permutation (music); Concatenation (mathematics); Discrete mathematics; String (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.005164885710695032,"gpt":0.2253073682846694,"spread":0.2201424825739744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001036337,0.0001047031,0.0001641792,0.00008065792,0.000200371,0.0001459151,0.001618122,0.00003709589,0.000003163944],"category_scores_gemma":[0.00004968691,0.00006395208,0.00008057549,0.0004153573,0.00001947672,0.0005584849,0.00008852357,0.000529148,0.000007150765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001259581,"about_ca_system_score_gemma":0.0002764903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003437026,"about_ca_topic_score_gemma":4.435381e-7,"domain_scores_codex":[0.9986196,0.00007313288,0.0003071765,0.0001013678,0.0004696187,0.0004291378],"domain_scores_gemma":[0.9989154,0.00009696269,0.000339089,0.0003821092,0.0002051661,0.00006126035],"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.000007104604,0.00007107596,0.00003904235,0.000001386119,0.00001307856,0.00001009841,0.0001415466,0.00005217675,0.0002436307,0.9813357,0.00204122,0.01604394],"study_design_scores_gemma":[0.0004974971,0.00077628,0.0009576939,0.00003137927,0.00001307128,0.0002623958,0.00002711745,0.006169541,0.0008033909,0.96778,0.02256071,0.0001209136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04971233,0.008017497,0.9339836,0.005858945,0.0009495799,0.00008771118,3.787615e-7,0.0000548568,0.001335125],"genre_scores_gemma":[0.9987109,0.0004186716,0.000354957,0.0003053957,0.000124911,2.615402e-7,2.402068e-7,0.000004421849,0.0000802275],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9489986,"threshold_uncertainty_score":0.3006901,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1550173909","doi":"10.37236/1107","title":"Encores on Cores","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":55,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Random graph; Combinatorics; Sequence (biology); Discrete mathematics; Simple (philosophy); Poisson distribution; Random regular graph; Degree (music); Graph; Line graph; Pathwidth; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01095922579002131,"gpt":0.2607164635614196,"spread":0.2497572377713983,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009513105,0.0001382714,0.0002328007,0.00009600081,0.0002743723,0.00002480906,0.0005404907,0.00006029872,0.00002219113],"category_scores_gemma":[0.0001937841,0.00007572819,0.000165616,0.0001918274,0.00009133861,0.00005579334,0.00004196811,0.0006314529,0.000002480973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001445991,"about_ca_system_score_gemma":0.0001003179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004924813,"about_ca_topic_score_gemma":0.000007938655,"domain_scores_codex":[0.9986246,0.000107634,0.0003821418,0.00007190932,0.0004289978,0.0003846858],"domain_scores_gemma":[0.9983433,0.0008060902,0.0004030424,0.0002738806,0.0001412322,0.00003240115],"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.00007137537,0.00009898274,0.000303359,0.000007987132,0.00004852944,0.00000731335,0.0001314435,0.00003367485,0.00002868865,0.9926161,0.006530751,0.000121823],"study_design_scores_gemma":[0.0004973956,0.0005216477,0.0006067535,0.0000223636,0.00005414247,0.0001317194,0.00004578862,0.00001207727,0.00123136,0.9897944,0.006991687,0.00009069333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9840909,0.00196429,0.001923458,0.0006371464,0.0008447539,0.0001067141,7.853801e-7,0.00002438303,0.0104076],"genre_scores_gemma":[0.9988676,0.0001982506,0.00002296965,0.00007271029,0.000276677,0.000001076038,1.880407e-7,0.00002040647,0.0005400973],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01477676,"threshold_uncertainty_score":0.3088106,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1926352835","doi":"10.37236/1101","title":"Grothendieck Bialgebras, Partition Lattices, and Symmetric Functions in Noncommutative Variables","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":54,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bialgebra; Mathematics; Noncommutative geometry; Symmetric function; Pure mathematics; Partition (number theory); Hopf algebra; Basis (linear algebra); Symmetrization; Lattice (music); Combinatorics; Algebra over a field","retraction":null,"screen_n_in":null,"score":{"opus":0.01293556970569637,"gpt":0.2537020866813878,"spread":0.2407665169756914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001005931,0.000177893,0.0003528161,0.0002520803,0.0001728598,0.00005814196,0.0002809818,0.00009780079,0.00001724087],"category_scores_gemma":[0.0002215742,0.0001240445,0.00008829965,0.0008148781,0.00007753372,0.0002079174,0.00005145638,0.0006947485,0.00000163478],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003190961,"about_ca_system_score_gemma":0.0002185031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008870564,"about_ca_topic_score_gemma":0.00005497079,"domain_scores_codex":[0.9982446,0.0002400104,0.0005820679,0.0001220331,0.0003682551,0.0004430557],"domain_scores_gemma":[0.9981416,0.0009333677,0.0005109543,0.0001975905,0.0001685761,0.00004791763],"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.000051041,0.0001578786,0.0008004962,0.0000168041,0.00005466853,0.000005548043,0.0001677619,0.00004888979,0.00002069933,0.9980997,0.0004199172,0.0001565544],"study_design_scores_gemma":[0.001333307,0.0003690879,0.001049179,0.00003814231,0.0001114227,0.0001235216,0.0001991848,0.0001590243,0.0001402145,0.9958392,0.0005051168,0.0001325803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9848978,0.00406262,0.007433609,0.0006147735,0.0007309437,0.0002586485,0.000001701297,0.00002309099,0.001976844],"genre_scores_gemma":[0.999274,0.0002395415,0.00004456407,0.00002232219,0.0002226463,0.000008163239,0.000001203162,0.0000240772,0.000163482],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01437623,"threshold_uncertainty_score":0.5058386,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103626912","doi":"10.37236/278","title":"Large Bounded Degree Trees in Expanding Graphs","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"University of Illinois at Urbana-Champaign; Hungarian Scientific Research Fund; National Science Foundation","keywords":"Mathematics; Bounded function; Combinatorics; Degree (music); Embedding; Dense graph; Random graph; Discrete mathematics; Graph; Spanning tree; Spectral gap; 1-planar graph; Chordal graph; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01994977074148044,"gpt":0.2944839138187778,"spread":0.2745341430772973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002697169,0.0001675557,0.0003295135,0.0002299572,0.0002659714,0.00004149857,0.0007215695,0.0001191583,0.00003698967],"category_scores_gemma":[0.0004678644,0.0001029308,0.0001899884,0.0004219332,0.00009280108,0.0001422839,0.00008341784,0.001796051,9.505081e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001073092,"about_ca_system_score_gemma":0.0001765101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002578086,"about_ca_topic_score_gemma":0.0001534778,"domain_scores_codex":[0.9982143,0.0001520696,0.0005079175,0.00009788157,0.0003935763,0.0006342765],"domain_scores_gemma":[0.9984417,0.0006096122,0.0004134085,0.0003492229,0.0001213065,0.00006474091],"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.00005460346,0.0001198834,0.001612208,0.000007139456,0.00005874528,0.0000108023,0.001269707,6.61981e-7,0.0007272427,0.9957668,0.000164638,0.000207546],"study_design_scores_gemma":[0.00125639,0.0001903555,0.001249818,0.00002105971,0.00004701947,0.0002090237,0.0003624842,0.00001477222,0.001137078,0.9940065,0.00138177,0.0001237024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9948581,0.0008170702,0.001056887,0.0002059947,0.001097099,0.0001039508,7.285439e-7,0.00001552205,0.001844617],"genre_scores_gemma":[0.9993958,0.0002386421,0.00005501141,0.00004671391,0.0001039972,0.000002029495,2.090396e-7,0.00002550012,0.000132086],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00453768,"threshold_uncertainty_score":0.7803047,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100702681","doi":"10.37236/775","title":"The Map Asymptotics Constant $t_g$","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":44,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Recursion (computer science); Mathematics; Constant (computer programming); Combinatorics; Variety (cybernetics); Genus; Surface (topology); Pure mathematics; Geometry; Algorithm; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.0249878307489158,"gpt":0.2772456172292732,"spread":0.2522577864803573,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001408118,0.0001684803,0.0003082843,0.00003603245,0.0006040331,0.00003928133,0.0007430823,0.00006737664,0.00001263937],"category_scores_gemma":[0.001821773,0.00008530006,0.0001335993,0.0002521316,0.000193051,0.00005939185,0.00006743464,0.0008932531,0.00001393011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000227662,"about_ca_system_score_gemma":0.0007695039,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.137931e-7,"about_ca_topic_score_gemma":0.000002381533,"domain_scores_codex":[0.9978779,0.0001082082,0.0006118182,0.00008923732,0.0006724568,0.0006404038],"domain_scores_gemma":[0.9954919,0.003072836,0.0005258093,0.0003167659,0.0004930504,0.00009966006],"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.00005867165,0.00008620109,0.000006154254,0.0000138123,0.00009573832,0.00002634212,0.0001843701,0.000003775338,0.00001754271,0.9948183,0.004347682,0.0003414195],"study_design_scores_gemma":[0.000589799,0.0005956037,0.00000612705,0.00002590715,0.0001003224,0.001045743,0.0001957613,0.0005648397,0.0002044276,0.9886928,0.007868715,0.0001099095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01969071,0.008786405,0.9634073,0.003637279,0.001769533,0.000283487,0.000004187737,0.00003857863,0.002382516],"genre_scores_gemma":[0.9970685,0.001816381,0.0002381942,0.00008532172,0.0001317318,0.000002712806,1.829471e-7,0.0000261041,0.0006309163],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9773778,"threshold_uncertainty_score":0.4645795,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1523516139","doi":"10.37236/1167","title":"Maximal Fillings of Moon Polyominoes, Simplicial Complexes, and Schubert Polynomials","year":2012,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Polyomino; Bijection; Combinatorics; Schubert polynomial; Mathematics; Vertex (graph theory); Permutation (music); Simplicial complex; Enumerative combinatorics; Connection (principal bundle); Geometry; Graph; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02667880008184111,"gpt":0.2986068591763595,"spread":0.2719280590945184,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002165987,0.0002884983,0.0007977832,0.0001508405,0.0001549448,0.00002578981,0.000610884,0.0001381598,0.00001916706],"category_scores_gemma":[0.0009493461,0.0002076613,0.0001850227,0.0003317506,0.0001765356,0.000339488,0.0001583628,0.000779972,0.000002979651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002976978,"about_ca_system_score_gemma":0.0002524403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001112548,"about_ca_topic_score_gemma":0.000001981509,"domain_scores_codex":[0.9971237,0.000186825,0.001075834,0.0001166519,0.0006317774,0.0008651723],"domain_scores_gemma":[0.9963069,0.001340224,0.00143909,0.0004096715,0.0003297688,0.0001743492],"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.0001297874,0.0003658852,0.0003553876,0.00007951934,0.0001415275,0.000001342738,0.0007293063,0.000002379525,0.003872905,0.9932985,0.0006897069,0.0003337652],"study_design_scores_gemma":[0.00126185,0.0005735956,0.0001748177,0.0000692253,0.0002241141,0.0003098293,0.0002286214,0.00003117425,0.01703673,0.9779828,0.001896581,0.0002106883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9785882,0.006029134,0.01310324,0.0003525308,0.0009024816,0.0003308604,0.00000480101,0.00003002591,0.0006587631],"genre_scores_gemma":[0.9982007,0.0004076994,0.0007886976,0.0000372566,0.0003911758,0.000003286507,5.784495e-7,0.00005638965,0.0001142328],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01961252,"threshold_uncertainty_score":0.8468181,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149489229","doi":"10.37236/1720","title":"Binary Gray Codes with Long Bit Runs","year":2003,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Mathematics; Gray code; Combinatorics; Subsequence; Hamming distance; Binary number; Hamming code; Gray (unit); Discrete mathematics; Arithmetic; Algorithm; Block code; Decoding methods","retraction":null,"screen_n_in":null,"score":{"opus":0.005235754770155271,"gpt":0.2027874407928435,"spread":0.1975516860226882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001797187,0.0001543319,0.0002153816,0.0001648998,0.0002507334,0.0001063272,0.001239404,0.00004134137,0.000007545525],"category_scores_gemma":[0.00004253545,0.00009103895,0.0001310009,0.001082631,0.00009122722,0.0003352697,0.00005131245,0.0006467851,0.000004972134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007583398,"about_ca_system_score_gemma":0.0004352376,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001189939,"about_ca_topic_score_gemma":0.00000235081,"domain_scores_codex":[0.9983612,0.0003029658,0.0002617173,0.0001310765,0.0004176118,0.0005253893],"domain_scores_gemma":[0.9987514,0.0002323611,0.000300462,0.000435846,0.0001932887,0.00008661823],"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.0000319944,0.0001168738,0.0009377996,0.000004778644,0.00008273413,0.00002154698,0.000217728,0.0000837365,0.0001079083,0.9977846,0.0001801193,0.0004302283],"study_design_scores_gemma":[0.0008091916,0.00187505,0.0006120375,0.00004051337,0.00005134096,0.001006038,0.00006894457,0.0001141146,0.002095212,0.983494,0.009647385,0.0001862169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3563646,0.007481368,0.6313527,0.0009927199,0.0007779092,0.00012482,2.129958e-7,0.00006314934,0.002842493],"genre_scores_gemma":[0.9992102,0.0003725084,0.0001768523,0.00008918033,0.00003430069,0.000001538392,9.208674e-8,0.00001136171,0.0001039225],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6428456,"threshold_uncertainty_score":0.3712461,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1588217500","doi":"10.37236/2639","title":"Metric Dimension for Random Graphs","year":2013,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Microsoft Research; National Science Foundation","keywords":"Metric dimension; Combinatorics; Mathematics; Vertex (graph theory); Dimension (graph theory); Packing dimension; Graph; Discrete mathematics; Metric (unit); Random graph; Minkowski–Bouligand dimension; Chordal graph; 1-planar graph","retraction":null,"screen_n_in":null,"score":{"opus":0.006990342412215714,"gpt":0.2153006784157689,"spread":0.2083103360035532,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001819593,0.0001318012,0.0002598322,0.0002846039,0.0002145824,0.0001168868,0.001028405,0.00005300035,0.000003431396],"category_scores_gemma":[0.000183779,0.00007734321,0.0002210743,0.001067468,0.00003936643,0.0003638247,0.00007914743,0.0003840514,0.00001324361],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007541386,"about_ca_system_score_gemma":0.0002099536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008999205,"about_ca_topic_score_gemma":3.493123e-7,"domain_scores_codex":[0.9983733,0.0001202251,0.0004389278,0.0001321626,0.0004163698,0.0005190169],"domain_scores_gemma":[0.9979149,0.0005530646,0.0004081026,0.0003692942,0.0006590566,0.00009557977],"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.00001824659,0.00007549295,0.00005154088,0.000004507628,0.00005286435,5.582942e-7,0.00007987514,0.0001286835,0.0008012035,0.9944354,0.002507013,0.001844667],"study_design_scores_gemma":[0.002230198,0.0006777635,0.00006632039,0.00001307441,0.00003270206,0.00008360064,0.00002021699,0.004911378,0.002044093,0.988647,0.0011728,0.0001008001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4002733,0.01594268,0.5749079,0.005950332,0.001978229,0.0006420271,2.479426e-7,0.00007606761,0.0002292229],"genre_scores_gemma":[0.9986233,0.0004558061,0.0005453469,0.0001981322,0.00001273604,0.00001088709,2.150046e-7,0.00001058324,0.0001430179],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.59835,"threshold_uncertainty_score":0.3153965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1563415799","doi":"10.37236/370","title":"Properties of the Steiner Triple Systems of Order 19","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Nokia Foundation; Academy of Finland; Natural Sciences and Engineering Research Council of Canada; U.S. Department of Defense","keywords":"Mathematics; Chromatic scale; Combinatorics; Order (exchange); Index (typography); Edge coloring; Discrete mathematics; Graph; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.004956060529502049,"gpt":0.1697239882227626,"spread":0.1647679276932605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001210236,0.0001147828,0.0002957364,0.00006603618,0.00005793725,0.00001284315,0.0006085667,0.0000716499,0.00000493446],"category_scores_gemma":[0.00008447524,0.00005667991,0.0001356767,0.0004110668,0.00008972003,0.00007502449,0.00002433103,0.0007117548,0.000001044784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004829954,"about_ca_system_score_gemma":0.0001732215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001472357,"about_ca_topic_score_gemma":0.000007767863,"domain_scores_codex":[0.9987307,0.0001292076,0.0005131497,0.00004278898,0.0003236028,0.0002605979],"domain_scores_gemma":[0.9989952,0.00005751291,0.0003259638,0.0003268205,0.0002597485,0.00003477187],"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.00005868855,0.00008492019,0.0006801662,0.0002671644,0.0002900312,7.543152e-7,0.0008422781,0.00425012,0.1534605,0.8394615,0.000536255,0.0000675896],"study_design_scores_gemma":[0.006973449,0.001915529,0.001767727,0.001113221,0.0008035795,0.001555112,0.004415222,0.008918702,0.5921437,0.3254935,0.05389251,0.001007733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9875332,0.008684645,0.0003420301,0.0000619834,0.002553752,0.0001683036,9.835018e-7,0.00001301193,0.000642119],"genre_scores_gemma":[0.9994049,0.0001359876,8.521588e-7,0.000004072871,0.00007596055,0.000003051882,7.050789e-8,0.00002008208,0.0003550253],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.513968,"threshold_uncertainty_score":0.309226,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1629366369","doi":"10.37236/1893","title":"Matroid Inequalities from Electrical Network Theory","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Generalization; Combinatorics; Rank (graph theory); Logarithm; Class (philosophy); Graphic matroid; Property (philosophy); Discrete mathematics; Plane (geometry); Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.0108807580615145,"gpt":0.2616404004158826,"spread":0.2507596423543681,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003834391,0.0001876952,0.0003265169,0.0001374103,0.0002530121,0.0001238903,0.002750684,0.00007382315,0.0000241702],"category_scores_gemma":[0.0002296374,0.0001258241,0.0001872309,0.0009914389,0.000112701,0.0006091659,0.0002455087,0.001437309,0.00003349038],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004308536,"about_ca_system_score_gemma":0.0005448082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002573726,"about_ca_topic_score_gemma":0.000002795804,"domain_scores_codex":[0.9965337,0.0008786849,0.0005372007,0.0001829793,0.0008041152,0.001063321],"domain_scores_gemma":[0.9969243,0.001646505,0.0003921915,0.0006280721,0.0002780442,0.0001308793],"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.00009537712,0.00007274938,0.0000764707,0.000001190913,0.00008642708,0.000007518992,0.0003007458,0.0007288376,0.0001136161,0.9894018,0.0008234043,0.008291902],"study_design_scores_gemma":[0.000569606,0.0004675279,0.0001014509,0.00001164588,0.00001852209,0.0001156005,0.00004005371,0.001879916,0.001003055,0.9848046,0.01084612,0.0001419111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05500294,0.02331611,0.9169421,0.002907929,0.0004559706,0.0001323726,6.407741e-7,0.000066551,0.001175366],"genre_scores_gemma":[0.9966067,0.00100545,0.0009296986,0.0003517728,0.0005959696,0.000003430439,4.314694e-7,0.00002033626,0.0004861769],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9416038,"threshold_uncertainty_score":0.6244472,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1576464478","doi":"10.37236/1937","title":"Erdős-Ko-Rado theorems for uniform set-partition systems","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Partition (number theory); Mathematics; Combinatorics; Cardinality (data modeling); Generalization; Discrete mathematics; Class (philosophy); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02366036630594945,"gpt":0.2953013095934258,"spread":0.2716409432874763,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002715718,0.0001946643,0.0003662891,0.0001092571,0.0003757604,0.0000583466,0.000611888,0.0001133409,0.00001471865],"category_scores_gemma":[0.0002613248,0.0001165241,0.0002504852,0.0002120375,0.00009062696,0.0001956737,0.00004715464,0.0006060976,0.000002668829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003778686,"about_ca_system_score_gemma":0.0001926785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001421491,"about_ca_topic_score_gemma":0.000002784021,"domain_scores_codex":[0.9980763,0.0001610756,0.0006367257,0.0001057389,0.0004276989,0.0005924154],"domain_scores_gemma":[0.9979117,0.0006405982,0.0006731573,0.0003531492,0.0003437653,0.0000776154],"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.0001152478,0.0000719017,0.00001785414,0.00004347182,0.0001541904,0.000001076672,0.0007681506,0.0001226587,0.0000562177,0.9952343,0.002780231,0.0006346668],"study_design_scores_gemma":[0.00103446,0.0004811487,0.00001089085,0.00004214522,0.0001546805,0.0002567462,0.0003581546,0.0008971107,0.0006037352,0.9631128,0.03290366,0.0001444949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8998276,0.009891405,0.07810289,0.002300357,0.003356624,0.001105213,0.00001446382,0.00009314545,0.005308331],"genre_scores_gemma":[0.9981463,0.0004287077,0.00009193597,0.00007698836,0.0006115247,0.000009677979,0.000001385347,0.0000386393,0.0005948383],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09831873,"threshold_uncertainty_score":0.4751714,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2103213553","doi":"10.37236/652","title":"Quantum Walks on Regular Graphs and Eigenvalues","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Quantum walk; Mathematics; Eigenvalues and eigenvectors; Combinatorics; Spectrum (functional analysis); Stochastic matrix; Strongly regular graph; Matrix (chemical analysis); Quantum; Discrete mathematics; Random walk; Graph; Quantum algorithm; Pathwidth; Line graph; Quantum mechanics; Markov chain; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.0112959498168125,"gpt":0.2079735669755661,"spread":0.1966776171587536,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00119688,0.0001586763,0.0002209089,0.0001439762,0.000221273,0.00006364048,0.001136604,0.00005108974,0.000001919127],"category_scores_gemma":[0.00004090658,0.000096754,0.0001104904,0.0003799694,0.00008052729,0.0001334549,0.0001353639,0.000751551,0.000003011995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005419825,"about_ca_system_score_gemma":0.0001636597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000648176,"about_ca_topic_score_gemma":5.325551e-7,"domain_scores_codex":[0.9985079,0.0001667473,0.0002999585,0.000161414,0.0003880133,0.0004760184],"domain_scores_gemma":[0.9989409,0.0001428947,0.0003005428,0.0004012977,0.0001222268,0.00009217073],"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.00001750161,0.00007869662,0.00005729431,0.000003637874,0.00004448004,0.00001778382,0.001034628,0.00003996841,0.00006177265,0.9919195,0.0001483095,0.006576442],"study_design_scores_gemma":[0.000377294,0.001554139,0.001130443,0.00003035834,0.00001779098,0.0004068023,0.00003431573,0.01245537,0.001259245,0.9817269,0.0008803905,0.0001268812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9016551,0.005185573,0.09024865,0.00124613,0.0008998351,0.00009991737,2.22692e-7,0.00006337275,0.0006012077],"genre_scores_gemma":[0.9989011,0.0004991615,0.0003476982,0.0001506406,0.00004560071,6.21628e-7,5.933756e-8,0.00001145819,0.00004361826],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09724605,"threshold_uncertainty_score":0.3945514,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2993394850","doi":"10.37236/1637","title":"Exchange Symmetries in Motzkin Path and Bargraph Models of Copolymer Adsorption","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Path (computing); Homogeneous space; Generating function; Critical point (mathematics); Graph; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03158084590770291,"gpt":0.260208681313554,"spread":0.2286278354058511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001320123,0.0002102585,0.0005702057,0.0003064593,0.00005476415,0.00001910626,0.0004001532,0.0001107204,0.00002036201],"category_scores_gemma":[0.000461634,0.0001548383,0.0001165309,0.0006606838,0.0001184997,0.0003057245,0.00007581521,0.0006545795,0.000001262797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002181337,"about_ca_system_score_gemma":0.00006610601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004653101,"about_ca_topic_score_gemma":0.000003701028,"domain_scores_codex":[0.9978448,0.000186402,0.0008208483,0.0001191114,0.0005605817,0.0004682812],"domain_scores_gemma":[0.9976205,0.0008431062,0.0008638551,0.0003250543,0.0002797833,0.00006773155],"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.00003706785,0.0003386404,0.00005782496,0.0001154359,0.00005581074,0.00000403493,0.001429661,0.00002744772,0.000240271,0.9970398,0.0002603223,0.0003937054],"study_design_scores_gemma":[0.00148828,0.0005628465,0.00001472239,0.0001176391,0.00008066872,0.00008962628,0.0003707619,0.002002133,0.002361892,0.9926603,0.0001077913,0.0001433394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9316705,0.03040087,0.03459249,0.0005277346,0.0006105072,0.0004909547,0.000003097457,0.00003198793,0.001671887],"genre_scores_gemma":[0.9943985,0.005166773,0.0002001101,0.00002013864,0.00004780732,0.000005385191,1.750037e-7,0.00003589645,0.0001251603],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06272808,"threshold_uncertainty_score":0.6314123,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3000216555","doi":"10.37236/478","title":"A Classification of Ramanujan Unitary Cayley Graphs","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Queen's University","keywords":"Mathematics; Combinatorics; Cayley graph; Ramanujan's sum; Vertex (graph theory); Multiplicative function; Modulo; Graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01874658218390824,"gpt":0.2853144750696924,"spread":0.2665678928857841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001751057,0.0001032612,0.0002119975,0.0001260826,0.0001255943,0.00001119862,0.0005775284,0.00007535527,0.00002056327],"category_scores_gemma":[0.0002305248,0.00007034695,0.0001512747,0.0004862541,0.0001349565,0.00008692344,0.00002352619,0.0009532086,0.000002813979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003559921,"about_ca_system_score_gemma":0.0002113077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002807825,"about_ca_topic_score_gemma":0.00001222411,"domain_scores_codex":[0.9988238,0.0001213048,0.0004651964,0.00006905631,0.0002684073,0.0002522567],"domain_scores_gemma":[0.9980254,0.0005277977,0.0006430916,0.0004173704,0.0003332171,0.0000530809],"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.00002674974,0.000225808,0.0002399084,0.00001234067,0.00006132037,4.652655e-7,0.0002447462,9.073415e-7,0.01533716,0.9832911,0.0003326296,0.0002268513],"study_design_scores_gemma":[0.0003820972,0.0001719397,0.0009611137,0.0000112365,0.0001050686,0.00008374623,0.0002350726,0.00002226765,0.005387457,0.9910066,0.001563898,0.00006954578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9953898,0.0002330324,0.001941116,0.0007967799,0.0002165477,0.0001338284,0.000001301501,0.00001347925,0.00127416],"genre_scores_gemma":[0.9996009,0.0001230916,0.00007894194,0.00001913704,0.00004027169,0.00000470498,8.665768e-7,0.00001542624,0.0001166359],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009949706,"threshold_uncertainty_score":0.414127,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1491916424","doi":"10.37236/1129","title":"A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Singularity; Unit circle; Smoothness; Prime (order theory); Boundary (topology); Product (mathematics); Unit (ring theory); Mathematical analysis; Applied mathematics; Combinatorial method; Pure mathematics; Combinatorics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01122659218380573,"gpt":0.2882512973551546,"spread":0.2770247051713489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003866268,0.0001649853,0.0007774,0.0003246107,0.00007447897,0.00003229522,0.0002920891,0.00007885733,0.00002323821],"category_scores_gemma":[0.0006097805,0.0001148238,0.000244782,0.0008002001,0.0000823848,0.00008130751,0.00005734674,0.0005723661,4.555007e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001730053,"about_ca_system_score_gemma":0.0002253066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006108345,"about_ca_topic_score_gemma":0.00002190515,"domain_scores_codex":[0.9977096,0.0003715483,0.0009948907,0.0001116299,0.0004330586,0.0003792295],"domain_scores_gemma":[0.9968531,0.001813277,0.0007349246,0.000300641,0.0002450736,0.00005297007],"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.0000559234,0.0004459567,0.0009523001,0.0000451416,0.0003174442,0.000004703689,0.00009341595,0.00006800564,0.0001268494,0.9976298,0.0001564217,0.0001040632],"study_design_scores_gemma":[0.001067684,0.0002938756,0.0005077547,0.00002559594,0.0009318754,0.00006871428,0.0000356858,0.0008764436,0.001588428,0.9941639,0.0003304553,0.0001095709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7877797,0.001127995,0.2086557,0.0003244666,0.0003276114,0.0001755977,0.000003640946,0.00001016323,0.001595165],"genre_scores_gemma":[0.9988563,0.00008238041,0.0008701553,0.00001014992,0.00009092959,0.000001450793,8.007585e-7,0.00001577866,0.00007206648],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2110766,"threshold_uncertainty_score":0.468238,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2767999306","doi":"10.37236/1898","title":"Sequentially Perfect and Uniform One-Factorizations of the Complete Graph","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Factorization; Disjoint sets; Graph; Hamiltonian path; Complete graph; Discrete mathematics; Perfect power; Integer (computer science); Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.007111906554473927,"gpt":0.1797280156676221,"spread":0.1726161091131482,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005868995,0.0001022947,0.0001879628,0.00007007319,0.0001225952,0.0000189967,0.0003479777,0.00004316957,0.000009108058],"category_scores_gemma":[0.00001766742,0.00006257041,0.0001148496,0.0003367655,0.00007067228,0.0001100037,0.00002231139,0.000427697,0.000001037701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000105549,"about_ca_system_score_gemma":0.00008374976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002337071,"about_ca_topic_score_gemma":0.00001199591,"domain_scores_codex":[0.9990699,0.0000936178,0.0003242056,0.00004244115,0.0002253248,0.0002444678],"domain_scores_gemma":[0.9994332,0.00007550701,0.0001692943,0.0001853283,0.00009920646,0.00003741854],"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.00001098731,0.00003461542,0.0004069415,0.00002804359,0.0001801653,2.909948e-7,0.0004693102,0.004734904,0.006371077,0.9874718,0.00007427903,0.0002176172],"study_design_scores_gemma":[0.002013965,0.0006430244,0.004503774,0.0001853497,0.0004120786,0.0004459748,0.0004369079,0.004261492,0.02324702,0.9439142,0.01954802,0.0003881884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9831001,0.004413578,0.009527541,0.0002463209,0.0005752982,0.00014101,0.0000035063,0.00002345604,0.001969163],"genre_scores_gemma":[0.9992205,0.0006217681,0.000005839842,0.00001311786,0.0000686175,9.927271e-7,3.36632e-7,0.0000155567,0.00005325306],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04355757,"threshold_uncertainty_score":0.2551547,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1737347830","doi":"10.37236/1785","title":"Enumerative Problems Inspired by Mayer's Theory of Cluster Integrals","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Class (philosophy); Virial expansion; Enumeration; Cluster (spacecraft); Homogeneous space; Cluster expansion; Imperfect; Discrete mathematics; Virial coefficient; Computer science; Physics; Geometry; Quantum mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.01686202179759467,"gpt":0.2683087266909238,"spread":0.2514467048933292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002200924,0.0001560132,0.0003308574,0.00008220354,0.0001267472,0.00001783857,0.0005618539,0.00007477395,0.00001843445],"category_scores_gemma":[0.0002164833,0.00009748491,0.0001782511,0.0003717128,0.0001525919,0.0001272331,0.0000395139,0.0006676402,0.00000410787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001747641,"about_ca_system_score_gemma":0.0002587716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002604841,"about_ca_topic_score_gemma":0.000002580389,"domain_scores_codex":[0.9984145,0.0002757412,0.0005903737,0.00008918106,0.0002952921,0.0003349583],"domain_scores_gemma":[0.9980618,0.0005691632,0.0007432384,0.0002948647,0.0002773035,0.00005365093],"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.00006509337,0.0003591891,0.00001065712,0.00002014766,0.0001605147,4.601966e-7,0.001460431,0.00003877362,0.0020143,0.9950904,0.0005658396,0.0002142186],"study_design_scores_gemma":[0.001112925,0.0004907324,0.000007929389,0.00006556352,0.0001093608,0.00005748956,0.0004426743,0.000003833269,0.02453895,0.9717742,0.00129909,0.00009730332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9241517,0.002906242,0.06855182,0.001998295,0.0001600791,0.0004643445,0.000006581009,0.00002432119,0.00173667],"genre_scores_gemma":[0.9991796,0.0002619783,0.00007618024,0.00008239797,0.00002867528,0.00001164678,9.816292e-7,0.0000226989,0.0003358255],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07502797,"threshold_uncertainty_score":0.3975319,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118970668","doi":"10.37236/1538","title":"Colouring Planar Mixed Hypergraphs","year":2000,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Fields Institute for Research in Mathematical Sciences; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Combinatorics; Mathematics; Bipartite graph; Chromatic polynomial; Vertex (graph theory); Planar graph; Graph; Planar; Chromatic scale; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.008014680410700175,"gpt":0.2406045820898491,"spread":0.2325899016791489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001719692,0.0001364297,0.0002236122,0.0001675614,0.0002456501,0.00008133773,0.002355456,0.00004833907,0.00002715844],"category_scores_gemma":[0.00005737491,0.00009321357,0.0001455344,0.0009728243,0.00009078869,0.0004205274,0.00006305979,0.0009380167,0.00003140944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001934547,"about_ca_system_score_gemma":0.0003356242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002014481,"about_ca_topic_score_gemma":0.00000189884,"domain_scores_codex":[0.997869,0.0002748645,0.000343129,0.0001417591,0.0006264531,0.0007447832],"domain_scores_gemma":[0.9986951,0.0003277231,0.0001880007,0.0004985203,0.0001766986,0.00011396],"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.00005488531,0.00007533326,0.00007949593,0.000002755905,0.00005576959,0.00002853738,0.0001562218,0.0002092449,0.0002948935,0.9893275,0.0003700105,0.00934532],"study_design_scores_gemma":[0.0006574003,0.0005988073,0.0002686422,0.00001309489,0.00001115791,0.0004928537,0.00003048847,0.0005052448,0.001982563,0.9807109,0.01461224,0.0001166071],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8279873,0.008496966,0.153583,0.003678428,0.0007433054,0.0002337137,6.03211e-7,0.0000916607,0.005185045],"genre_scores_gemma":[0.9976075,0.001306523,0.0001747938,0.00009183225,0.00005480626,0.00000214246,1.192059e-7,0.0000130641,0.000749193],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1696203,"threshold_uncertainty_score":0.4377062,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1501289071","doi":"10.37236/135","title":"Random Even Graphs","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of British Columbia; University of Cambridge; Isaac Newton Institute for Mathematical Sciences","keywords":"Combinatorics; Mathematics; Random graph; Discrete mathematics; Lattice (music); Phase transition; Random regular graph; Transition point; Graph; Line graph; 1-planar graph; Physics; Condensed matter physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01606366324389873,"gpt":0.2915499532463266,"spread":0.2754862900024279,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00121837,0.0001336021,0.0003321262,0.0000649523,0.0001116385,0.00002821051,0.0004807875,0.0000565021,0.00002104274],"category_scores_gemma":[0.001085686,0.00008048293,0.0001441572,0.0003135014,0.00002615748,0.00007004484,0.00001739157,0.0006181217,0.000004747072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001129949,"about_ca_system_score_gemma":0.0002498912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.565047e-7,"about_ca_topic_score_gemma":5.122116e-7,"domain_scores_codex":[0.9984901,0.00007572511,0.0004557216,0.00007570792,0.0004540597,0.0004487053],"domain_scores_gemma":[0.9981724,0.000901675,0.0003716281,0.0001973925,0.0002760292,0.00008086453],"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.0001374958,0.000126107,0.000001064165,0.000008272069,0.00004793908,0.000008124469,0.000103125,0.000003610595,0.00007091631,0.9964401,0.001383595,0.001669627],"study_design_scores_gemma":[0.001617441,0.001082807,0.00001235462,0.00002875348,0.0001270996,0.0002349556,0.00005185812,0.0002261644,0.0002679715,0.9953763,0.0008784683,0.00009582307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02468552,0.002856974,0.9680803,0.002180936,0.0004508217,0.0001673744,0.000001182813,0.0000262919,0.001550631],"genre_scores_gemma":[0.9988764,0.0004208544,0.0002886029,0.0001513481,0.00007375388,0.000001105205,1.753731e-7,0.00001238123,0.0001753627],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9741909,"threshold_uncertainty_score":0.3281999,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2105335308","doi":"10.37236/1074","title":"Tilings of the Sphere with Right Triangles I: The Asymptotically Right Families","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Tile; Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Spherical trigonometry; Geometry; Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.002305915727975238,"gpt":0.1694912427611991,"spread":0.1671853270332238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001044934,0.0001585022,0.0002682049,0.00002080469,0.0003447411,0.00007865692,0.001051384,0.00005538635,0.0001130399],"category_scores_gemma":[0.00005046623,0.00005100649,0.0001385642,0.0002786998,0.0004311121,0.0001118405,0.00007119725,0.0004801827,0.000003036651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001020312,"about_ca_system_score_gemma":0.0003864876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008989709,"about_ca_topic_score_gemma":0.000120727,"domain_scores_codex":[0.9981722,0.0002615116,0.0004393435,0.0000947758,0.0006197599,0.0004123769],"domain_scores_gemma":[0.9986249,0.0002291107,0.0005321606,0.0003307067,0.0002551523,0.00002796563],"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.0004156959,0.000106808,0.0003464882,0.00002804962,0.00006038525,0.000006858298,0.0004500058,0.0006389933,0.04801802,0.9483158,0.001387683,0.0002252278],"study_design_scores_gemma":[0.00100045,0.0008465298,0.001572088,0.00007448115,0.0001509507,0.0004209691,0.0002776932,0.00003562111,0.2352064,0.7373253,0.02293612,0.000153428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.989198,0.005220358,0.0004491844,0.002153089,0.0003933482,0.0001598223,0.000002243351,0.000009406009,0.002414495],"genre_scores_gemma":[0.9989439,0.000153526,0.00001464716,0.00007677032,0.0001399536,0.000001456353,1.657872e-7,0.00001466386,0.0006549619],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2109905,"threshold_uncertainty_score":0.2651505,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2767562605","doi":"10.37236/109","title":"On a Problem of Marco Buratti","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01356816524068383,"gpt":0.2845898947932947,"spread":0.2710217295526109,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001125736,0.00009551231,0.0002158183,0.0000777399,0.00008113871,0.000009527738,0.0004202686,0.00004087093,0.00001439446],"category_scores_gemma":[0.00008501046,0.00005993942,0.0001315912,0.0003288433,0.00004156183,0.00004988503,0.00001077649,0.0004812132,0.000003440699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007271489,"about_ca_system_score_gemma":0.0001317344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.347572e-7,"about_ca_topic_score_gemma":3.23383e-7,"domain_scores_codex":[0.9989294,0.0001006637,0.0003872886,0.00005613797,0.0002697534,0.0002567576],"domain_scores_gemma":[0.9986317,0.0004305511,0.0004818843,0.0002492044,0.0001686176,0.00003808508],"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.00005831356,0.0003559095,0.000005463623,0.000008434577,0.00003904034,9.278958e-7,0.0001574189,0.000009890953,0.0008222917,0.9967179,0.001194761,0.0006296456],"study_design_scores_gemma":[0.0004519421,0.001060902,0.00005562344,0.00003726183,0.00005832847,0.00005919379,0.00004844038,0.000008369113,0.003973628,0.9931632,0.001024562,0.00005856522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9810758,0.0008245581,0.006614184,0.003446407,0.00006975018,0.0002644695,0.000001056557,0.00001966428,0.007684149],"genre_scores_gemma":[0.9993842,0.000123342,0.00009293496,0.00007498479,0.00002756512,0.000001864069,1.664305e-7,0.000008773616,0.000286177],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01830843,"threshold_uncertainty_score":0.2444258,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169650883","doi":"10.37236/1694","title":"Bent Hamilton Cycles in $d$-Dimensional Grid Graphs","year":2003,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bent molecular geometry; Combinatorics; Mathematics; Hamiltonian path; Dimension (graph theory); Graph; Grid; Path (computing); Discrete mathematics; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02957615537545228,"gpt":0.3082204082643228,"spread":0.2786442528888706,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005187094,0.0001815364,0.0003581323,0.0003048783,0.0001205747,0.00003107687,0.0005845058,0.00008829909,0.00006257056],"category_scores_gemma":[0.0007893422,0.0001228618,0.0001736771,0.0006961976,0.0001044705,0.0001299616,0.00004228045,0.001409256,0.00001284542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000487383,"about_ca_system_score_gemma":0.0004823676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003770195,"about_ca_topic_score_gemma":0.00001506377,"domain_scores_codex":[0.99693,0.00068943,0.0006280046,0.0001262833,0.0008480382,0.0007782363],"domain_scores_gemma":[0.9976447,0.001324817,0.000344285,0.0003480501,0.0002444325,0.0000936671],"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.0000883849,0.0003615257,0.0006394754,0.0000165194,0.00006495169,0.00002771062,0.0003258051,0.00004319847,0.0003231695,0.9973125,0.0007272313,0.00006951892],"study_design_scores_gemma":[0.001239293,0.0004704425,0.0003261774,0.00004636499,0.00003022109,0.0003216384,0.0001574339,0.00003496435,0.002230006,0.993003,0.002012835,0.0001276463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9942232,0.002640716,0.0003731269,0.0003207669,0.0004493329,0.0001832226,8.986725e-7,0.00001293912,0.00179574],"genre_scores_gemma":[0.9991183,0.0004443321,0.00006498775,0.00004856215,0.00004405782,0.000004044747,4.749941e-7,0.0000334162,0.000241788],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00489508,"threshold_uncertainty_score":0.6122596,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2110444749","doi":"10.37236/893","title":"A Note on Palindromic $\\delta$-Vectors for Certain Rational Polytopes","year":2008,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Polytope; Palindrome; Combinatorics; Lattice (music); Mathematics; Convex polytope; Regular polygon; Convex set; Physics; Geometry; Convex optimization; Chemistry","retraction":null,"screen_n_in":null,"score":{"opus":0.03439933350523307,"gpt":0.3126438170031136,"spread":0.2782444834978806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001345487,0.0003007302,0.0005842554,0.0001652927,0.0004005537,0.00002475382,0.0007670657,0.0001309813,0.0000137282],"category_scores_gemma":[0.001949784,0.0002089367,0.0003384286,0.0003606422,0.0001331795,0.0001689035,0.00004893358,0.0008335079,0.000008366649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007069228,"about_ca_system_score_gemma":0.0008459826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001719841,"about_ca_topic_score_gemma":0.000002807015,"domain_scores_codex":[0.9973133,0.0001580337,0.0008856526,0.0001697087,0.0007755692,0.0006977458],"domain_scores_gemma":[0.9949067,0.003052414,0.0009870392,0.0004386611,0.0005063085,0.0001089035],"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.0002488255,0.0003791123,0.00001891594,0.00003114937,0.000115732,0.00001029581,0.0007090961,0.0001164501,0.0002777989,0.9958922,0.002104686,0.00009577132],"study_design_scores_gemma":[0.002244878,0.001472675,0.00002157897,0.00005586779,0.0001040274,0.00042263,0.00009922899,0.0003656957,0.004476247,0.9872763,0.003233799,0.0002270289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.805142,0.0008084706,0.1877031,0.002257459,0.002308932,0.001033931,0.00001003977,0.00008318067,0.0006528773],"genre_scores_gemma":[0.9977332,0.0002018016,0.0009596772,0.0001061153,0.0003950315,0.0000217932,0.000001891063,0.00007278045,0.0005077083],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1925912,"threshold_uncertainty_score":0.8520193,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2998895846","doi":"10.37236/930","title":"On the Genus Distribution of $(p,q,n)$-Dipoles","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Black Holes and Theoretical Physics","field":"Physics and Astronomy","cited_by":29,"is_retracted":false,"has_abstract":true,"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; Universities Space Research Association","keywords":"Mathematics; Torus; Feynman diagram; Genus; Combinatorics; Enumeration; Type (biology); String (physics); Class (philosophy); String theory; Field (mathematics); Discrete mathematics; Mathematical physics; Pure mathematics; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.004517359008021139,"gpt":0.2211356351688237,"spread":0.2166182761608025,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001236091,0.0001002015,0.000165464,0.00001785931,0.0001123657,0.0000146649,0.0003765447,0.00002490069,0.00002757142],"category_scores_gemma":[0.00002265542,0.00005128232,0.0001668545,0.0002257539,0.0001311934,0.00003982022,0.00003015378,0.0005815832,0.000005990967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007108138,"about_ca_system_score_gemma":0.0001109505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006865377,"about_ca_topic_score_gemma":2.990917e-7,"domain_scores_codex":[0.9989299,0.0000694115,0.0003127948,0.00005352708,0.0002920066,0.0003423882],"domain_scores_gemma":[0.9988545,0.0003876633,0.0003444095,0.0002033556,0.0001680707,0.00004206185],"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.00005759177,0.0001588432,0.0001783338,0.000001864488,0.00008220916,4.093024e-7,0.00006088727,0.00002549318,0.00005406038,0.9970601,0.0003652553,0.00195491],"study_design_scores_gemma":[0.0003015808,0.0003097674,0.0004484354,0.00001581715,0.00005152802,0.000003083984,0.0001811055,0.0000192329,0.009272795,0.9872977,0.002042462,0.00005655085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9108853,0.0003032868,0.08294671,0.0007183061,0.0001925381,0.00008064642,0.000005774893,0.000003316745,0.004864174],"genre_scores_gemma":[0.9997119,0.00001624267,7.862665e-7,0.00003163684,0.0001793173,4.972675e-7,0.000002686255,0.000009613818,0.0000473671],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0888266,"threshold_uncertainty_score":0.2526722,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1598186826","doi":"10.37236/1548","title":"Small Forbidden Configurations II","year":2000,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Combinatorics; Mathematics; Notation; Permutation (music); Vertex (graph theory); Matrix (chemical analysis); Discrete mathematics; Graph; Physics; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.006646584142994286,"gpt":0.175282247176562,"spread":0.1686356630335677,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005825696,0.00009928027,0.0001571293,0.00005141829,0.0001584012,0.00002325538,0.0003327868,0.00004745134,0.0001544582],"category_scores_gemma":[0.000009450527,0.00006997412,0.0001038729,0.0002223785,0.00002598056,0.00008768899,0.000005879564,0.0004548754,0.00002520047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009521408,"about_ca_system_score_gemma":0.00006875927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001549682,"about_ca_topic_score_gemma":0.000003541515,"domain_scores_codex":[0.9991426,0.00006475447,0.0002903513,0.0000397585,0.0001429077,0.000319623],"domain_scores_gemma":[0.9995998,0.00006117129,0.00006462823,0.0001634695,0.00006261426,0.00004833148],"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.00002129067,0.000041793,0.00001642403,0.00001007803,0.000145436,0.000004459414,0.0006299495,0.003183215,0.0009607645,0.9908716,0.001447312,0.002667663],"study_design_scores_gemma":[0.0008231223,0.0005032008,0.0001529545,0.00003425607,0.00008522777,0.0004870283,0.0001934295,0.001071928,0.003195947,0.865007,0.1282545,0.000191355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9657313,0.00552881,0.002630554,0.0002455981,0.0005814539,0.0001014275,9.35863e-7,0.00005769494,0.02512218],"genre_scores_gemma":[0.9977624,0.0007212074,0.000001802614,0.00002402271,0.0001033951,0.000002406576,4.997474e-7,0.00001745491,0.001366829],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1268072,"threshold_uncertainty_score":0.2853462,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2123338985","doi":"10.37236/939","title":"Truncations of Random Unitary Matrices and Young Tableaux","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Random Matrices and Applications","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics; Unitary matrix; Young tableau; Unitary state; Unitary group; Haar measure; Random matrix; Matrix (chemical analysis); Unitary transformation; Lattice (music); Simple (philosophy); Eigenvalues and eigenvectors; Quantum mechanics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.008453647387334947,"gpt":0.2525583935603761,"spread":0.2441047461730411,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009935921,0.00009959286,0.0002847439,0.0001037316,0.0001451974,0.00002424513,0.0002805854,0.00004124478,0.000008759268],"category_scores_gemma":[0.00008756788,0.00006462886,0.00009382186,0.0004458868,0.00006116774,0.0001108734,0.00002540586,0.0002829822,9.325791e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006452455,"about_ca_system_score_gemma":0.0001730207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005908962,"about_ca_topic_score_gemma":0.00001897633,"domain_scores_codex":[0.9988429,0.00007909076,0.0005251183,0.00006120619,0.0002604605,0.0002312321],"domain_scores_gemma":[0.9982369,0.000666769,0.0006279418,0.0001908353,0.0002471231,0.00003044711],"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.00005838097,0.0001444345,0.0003267302,0.0000295191,0.0000550843,6.230819e-7,0.000125393,0.00003839066,0.0002364577,0.9969262,0.00194826,0.0001104829],"study_design_scores_gemma":[0.002365538,0.0001179881,0.0003641019,0.00001775924,0.0002350509,0.000105244,0.0001988486,0.000187249,0.0004950835,0.9932281,0.002613635,0.00007142752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9570516,0.0150754,0.022849,0.001096673,0.0001508604,0.000290591,0.000003824692,0.00001717577,0.003464822],"genre_scores_gemma":[0.9972594,0.002011417,0.0001514395,0.000007309196,0.00008259236,0.000004889445,9.571392e-7,0.00001365598,0.0004683624],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04020773,"threshold_uncertainty_score":0.2635489,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116562963","doi":"10.37236/1621","title":"Relaxed Graceful Labellings of Trees","year":2002,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Bijection; Vertex (graph theory); Combinatorics; Mathematics; Upper and lower bounds; Graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0107111344842803,"gpt":0.1939844687147212,"spread":0.1832733342304409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001271413,0.000117197,0.0002528263,0.0001460726,0.0001115382,0.00003704509,0.001201063,0.00005429836,0.00000916031],"category_scores_gemma":[0.00007699198,0.00007578597,0.0001464279,0.000780656,0.00007238019,0.000220535,0.00007637502,0.0005413182,0.00001051355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006014628,"about_ca_system_score_gemma":0.00009413613,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004444009,"about_ca_topic_score_gemma":0.000001740579,"domain_scores_codex":[0.9983655,0.0001200009,0.000507171,0.0001112589,0.0004989106,0.0003971928],"domain_scores_gemma":[0.9983639,0.0002006114,0.0005905958,0.0004203272,0.0003561022,0.00006848817],"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.000006713487,0.000160836,0.0001288313,0.000004724521,0.00004913309,0.000004581917,0.0004796466,0.0001697242,0.0009951709,0.9948494,0.001895844,0.001255406],"study_design_scores_gemma":[0.0007705772,0.0007988713,0.00006335105,0.0000337493,0.00003110161,0.0001503343,0.0000244749,0.003962647,0.006789312,0.9841906,0.003082897,0.000102032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8398716,0.04916226,0.09658834,0.01065868,0.001617414,0.0001898738,5.013347e-7,0.0000919864,0.001819377],"genre_scores_gemma":[0.9970942,0.002101589,0.0002123303,0.00008973161,0.000009926517,5.93578e-7,5.752505e-8,0.000008621982,0.0004829323],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1572226,"threshold_uncertainty_score":0.3090462,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147161887","doi":"10.37236/1909","title":"Generating Function for $K$-Restricted Jagged Partitions","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Lambda; Partition (number theory); Generalization; Generating function; Interpretation (philosophy); Discrete mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03064624197582931,"gpt":0.3108343208109319,"spread":0.2801880788351025,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007810903,0.0001266528,0.0002510766,0.00007945098,0.000257424,0.00004783587,0.0002641648,0.00005485168,0.00002442575],"category_scores_gemma":[0.001464281,0.00008758085,0.0001404513,0.0002877224,0.00004365323,0.0002710063,0.00002595774,0.0004217941,0.000006338461],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003173261,"about_ca_system_score_gemma":0.0002196746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.695181e-7,"about_ca_topic_score_gemma":0.000007641292,"domain_scores_codex":[0.9985294,0.00007683119,0.0005759489,0.00007666348,0.0003171598,0.0004240516],"domain_scores_gemma":[0.9977072,0.0009953246,0.000522099,0.0002026578,0.0005174634,0.00005528804],"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.00003302651,0.0001539369,0.000003241023,0.00002426566,0.00008477488,4.27882e-7,0.0001377301,0.0004109823,0.0009418652,0.9938205,0.004082757,0.000306441],"study_design_scores_gemma":[0.0007764348,0.0003737428,0.000006464199,0.00002703453,0.0001866894,0.00005540566,0.0001664334,0.001541489,0.001651543,0.9891167,0.006002612,0.00009540635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2017867,0.00158412,0.7930724,0.001919483,0.0004469819,0.0003878588,0.000002293806,0.00006181451,0.0007383851],"genre_scores_gemma":[0.995133,0.0001346913,0.002487958,0.00006646726,0.0004472928,0.00002157186,0.000001126208,0.00003097154,0.001676897],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7933463,"threshold_uncertainty_score":0.3571444,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2994108360","doi":"10.37236/2018","title":"Christoffel Words and the Calkin-Wilf Tree","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Christoffel symbols; Noncommutative geometry; Tree (set theory); Combinatorics; Duality (order theory); Rational number; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0079640133193285,"gpt":0.1884078611678091,"spread":0.1804438478484806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002573058,0.0001300265,0.0002331563,0.00006282033,0.0001989658,0.00007806302,0.001725107,0.00004390176,0.000006461061],"category_scores_gemma":[0.00007536411,0.00006266367,0.0001130196,0.0003371635,0.0002026348,0.0002631943,0.0001928076,0.0006372264,0.000005185296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008654644,"about_ca_system_score_gemma":0.0001996427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001673095,"about_ca_topic_score_gemma":0.000003595475,"domain_scores_codex":[0.9985746,0.0002544459,0.0003128331,0.0001104407,0.0003304029,0.0004172456],"domain_scores_gemma":[0.9986982,0.0003630521,0.0003371727,0.0004518938,0.00008572065,0.00006392672],"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.00004784086,0.00004454254,0.00004709322,0.00000219172,0.00004700069,0.000007381454,0.002347912,7.712705e-7,0.00002391088,0.9897751,0.0003854423,0.007270781],"study_design_scores_gemma":[0.001457603,0.0002876415,0.0007613322,0.00001348212,0.00003720037,0.0004796051,0.0001520284,0.001280299,0.0005217951,0.9918897,0.003023015,0.00009630939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4549589,0.04835087,0.4738886,0.008548685,0.002334494,0.0003734791,5.296062e-7,0.0001120564,0.01143239],"genre_scores_gemma":[0.9981734,0.001137212,0.0000777563,0.0003243644,0.00007677225,0.000002054315,4.524559e-8,0.000009194899,0.000199181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5432146,"threshold_uncertainty_score":0.3205707,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137217287","doi":"10.37236/1588","title":"Gaps in the Chromatic Spectrum of Face-Constrained Plane Graphs","year":2001,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Fields Institute for Research in Mathematical Sciences; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chromatic scale; Plane (geometry); Graph; Spectrum (functional analysis); Colored; Face (sociological concept); Complete coloring; Fractional coloring; Discrete mathematics; Graph power; Physics; Geometry; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01033061752458155,"gpt":0.2600367389247938,"spread":0.2497061214002123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003397999,0.0001460798,0.0002982512,0.0003046867,0.0001079298,0.00004949352,0.002921106,0.00004603262,0.000008840669],"category_scores_gemma":[0.0001366811,0.00008290875,0.0001360862,0.001825014,0.0001901544,0.0002931575,0.00009914082,0.001018833,0.000004194279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001464902,"about_ca_system_score_gemma":0.0003864098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005921576,"about_ca_topic_score_gemma":0.00001232672,"domain_scores_codex":[0.9973777,0.0004982486,0.0005281316,0.0001250147,0.000781241,0.0006896548],"domain_scores_gemma":[0.9980723,0.0007564483,0.0004233345,0.000591109,0.0001018041,0.0000550326],"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.00004205079,0.0001480865,0.0004247911,0.000008760343,0.00003785092,0.00005015304,0.0008778473,0.0001600849,0.0004455621,0.997137,0.00004242456,0.0006253787],"study_design_scores_gemma":[0.0008567662,0.0008261274,0.001090639,0.0000324812,0.00001081787,0.001136648,0.0003044423,0.0005714256,0.001306932,0.9934509,0.0003239613,0.00008890254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8873029,0.004378978,0.1011985,0.004957932,0.0002612398,0.0003197005,6.693401e-7,0.00001935488,0.001560759],"genre_scores_gemma":[0.9987655,0.001025861,0.00005540187,0.00006568222,0.00002259066,0.000002766551,2.210683e-7,0.000008625834,0.00005334745],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1114626,"threshold_uncertainty_score":0.5428191,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1488677252","doi":"10.37236/1972","title":"A Note on Graphs Without Short Even Cycles","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Chordal graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01295528252795957,"gpt":0.2994299267812243,"spread":0.2864746442532647,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002088505,0.0001750748,0.0002585238,0.0002640217,0.0002167713,0.00008258622,0.002422829,0.00005713085,0.000004266757],"category_scores_gemma":[0.000118891,0.0001148243,0.0001789427,0.0008196352,0.0001004053,0.0004950591,0.0001563021,0.001249828,0.00002415453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003756891,"about_ca_system_score_gemma":0.0004044273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.499128e-7,"about_ca_topic_score_gemma":0.000004428245,"domain_scores_codex":[0.9974954,0.0002657148,0.0003771385,0.000182049,0.0009056753,0.0007740036],"domain_scores_gemma":[0.9984031,0.0003572735,0.0002077895,0.0006430068,0.000258834,0.0001300304],"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.00006732252,0.0001304136,0.0001996309,0.000002338835,0.00004402967,0.000008322982,0.000231898,0.0005512696,0.0004080186,0.9822915,0.0001678864,0.01589743],"study_design_scores_gemma":[0.0005275994,0.0009071783,0.000410687,0.00002449434,0.00001241797,0.0002391061,0.00001685081,0.002066938,0.004759005,0.9844691,0.006420176,0.0001464898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3725733,0.004471406,0.6093851,0.009037843,0.0006676122,0.0003527654,7.096546e-7,0.0001060671,0.003405164],"genre_scores_gemma":[0.9984826,0.0005540456,0.0003993925,0.0002192153,0.00009997743,0.000003263719,1.153764e-7,0.00001839433,0.0002229882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6259093,"threshold_uncertainty_score":0.5429952,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132071928","doi":"10.37236/1600","title":"The Game of End-Nim","year":2001,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; String (physics); Mathematics; Combinatorial game theory; Stack (abstract data type); Sequential game; Computer science; Mathematical economics; Game theory; Mathematical physics; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01269252635933079,"gpt":0.2589302169930107,"spread":0.2462376906336799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00202574,0.0001083914,0.0001904959,0.00006496274,0.0001748604,0.00008301326,0.002660658,0.00004117744,0.000008145776],"category_scores_gemma":[0.0002286793,0.00005813695,0.0001437916,0.0006286732,0.0001681104,0.0002574048,0.0001474945,0.0005890966,0.00001377741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001658168,"about_ca_system_score_gemma":0.000478179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001100587,"about_ca_topic_score_gemma":0.0000107848,"domain_scores_codex":[0.9980924,0.0001739867,0.0005424937,0.00009110104,0.0005863019,0.0005137022],"domain_scores_gemma":[0.9977133,0.0007334542,0.0005799708,0.0005293,0.0003897845,0.00005422656],"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.00001977907,0.00005463442,0.0001799605,0.000001171464,0.00003806775,0.000006597372,0.0004783774,0.0001396873,0.0002775662,0.9815277,0.0003564001,0.0169201],"study_design_scores_gemma":[0.0001099472,0.0004976746,0.0001918048,0.0000124668,0.00001494242,0.0002846576,0.0001497172,0.00223879,0.01133319,0.950024,0.03506711,0.00007570055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3323987,0.01621544,0.6325439,0.01222469,0.002233037,0.0002045854,2.332837e-7,0.00004125739,0.004138242],"genre_scores_gemma":[0.9963087,0.00305087,0.00003707899,0.00007241068,0.00009005035,0.000001137633,2.716396e-8,0.000007779938,0.0004318982],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6639101,"threshold_uncertainty_score":0.4944208,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1945551230","doi":"10.37236/292","title":"Distinguishing Number of Countable Homogeneous Relational Structures","year":2010,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"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; University of Calgary","keywords":"Mathematics; Countable set; Combinatorics; Conjecture; Homogeneous; Automorphism; Discrete mathematics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.006701448224600764,"gpt":0.2318128234633887,"spread":0.2251113752387879,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001238508,0.00009536582,0.0001758336,0.00005923941,0.0001622616,0.00005442148,0.0008663766,0.00005940138,0.00001603577],"category_scores_gemma":[0.0002287827,0.00006316626,0.00009031953,0.000370356,0.00007035836,0.0001867547,0.00008521117,0.0008198507,0.000003368447],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004245918,"about_ca_system_score_gemma":0.00042282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001739396,"about_ca_topic_score_gemma":0.000005372851,"domain_scores_codex":[0.9986407,0.00005928439,0.0003902306,0.00009475555,0.0005109536,0.0003040617],"domain_scores_gemma":[0.9983696,0.0002402857,0.0005168139,0.0003130191,0.0005049644,0.00005527562],"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.000006322467,0.00003864701,0.001368278,0.000003657506,0.00003055547,0.000002995182,0.000150202,0.0002306729,0.002008391,0.9956789,0.0002668666,0.0002144938],"study_design_scores_gemma":[0.0003339187,0.00009262055,0.000391121,0.00001003576,0.00001834954,0.0006394687,0.000009163704,0.001428669,0.002688952,0.9923024,0.002011543,0.0000737824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9648225,0.001298804,0.03013238,0.0006657502,0.001680386,0.00005791158,8.561267e-7,0.00002397373,0.001317467],"genre_scores_gemma":[0.9981672,0.00005782204,0.001591349,0.00004647352,0.00002395026,4.146864e-7,3.556133e-7,0.000007460197,0.0001049532],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03334475,"threshold_uncertainty_score":0.3561889,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144900670","doi":"10.37236/106","title":"Automorphism Groups of Wreath Product Digraphs","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Wreath product; Combinatorics; Mathematics; Automorphism; Automorphism group; Vertex (graph theory); Graph; Product (mathematics); Discrete mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02617345998663777,"gpt":0.3063965851523656,"spread":0.2802231251657278,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004099935,0.0001959829,0.0005008605,0.0002567018,0.0001141186,0.00002640481,0.001036513,0.00006945401,0.0000239099],"category_scores_gemma":[0.0008437566,0.0001268955,0.0002502775,0.0008166078,0.0001408589,0.000167589,0.00004978354,0.001160356,0.000005282029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002511041,"about_ca_system_score_gemma":0.0004543313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001893604,"about_ca_topic_score_gemma":0.000001116749,"domain_scores_codex":[0.9971833,0.0003500234,0.0007229803,0.0001322572,0.000916876,0.0006945111],"domain_scores_gemma":[0.9974695,0.0007287469,0.0007246399,0.000588214,0.0003973238,0.00009156418],"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.0001676528,0.0005015296,0.0001358631,0.00002461591,0.000120134,0.00001403137,0.0005196912,0.000003089289,0.001518499,0.9944328,0.001350778,0.001211288],"study_design_scores_gemma":[0.0009080459,0.001844128,0.0005336613,0.00004991669,0.00009692369,0.0003376247,0.00009274424,0.00003204935,0.006028514,0.9890749,0.0008783753,0.0001231417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9877918,0.004328092,0.002475783,0.00164849,0.00026615,0.0003222002,0.000001393997,0.00003626626,0.003129833],"genre_scores_gemma":[0.9987525,0.00052811,0.00006566012,0.00003960965,0.0001189261,0.000001617597,4.887218e-7,0.00002668248,0.0004663994],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01096071,"threshold_uncertainty_score":0.5174648,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1554222672","doi":"10.37236/1052","title":"Meta-Fibonacci Sequences, Binary Trees and Extremal Compact Codes","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fibonacci number; Mathematics; Combinatorics; Integer sequence; Integer (computer science); Pisano period; Binary number; Discrete mathematics; Binary tree; Fibonacci polynomials; Generating function; Arithmetic; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01761344840326454,"gpt":0.2302005328627704,"spread":0.2125870844595059,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001655535,0.0001954895,0.0004299058,0.0001254184,0.0002031116,0.0001713602,0.001173992,0.00005150895,0.00001013542],"category_scores_gemma":[0.00002008831,0.0001140434,0.0001932765,0.0004217744,0.0001152602,0.0005245025,0.0001029958,0.0004715313,0.000002906655],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001344379,"about_ca_system_score_gemma":0.000267243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004602653,"about_ca_topic_score_gemma":0.00001268398,"domain_scores_codex":[0.9982108,0.0002451302,0.0004258045,0.0001590905,0.0004458431,0.0005133423],"domain_scores_gemma":[0.9986416,0.0003967682,0.0004244218,0.0003454369,0.0001216852,0.00007006324],"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.00001463297,0.0001006598,0.0003009658,0.000004238156,0.0002897728,0.00003128166,0.00009651956,0.0001912308,0.001163107,0.996044,0.001149848,0.000613743],"study_design_scores_gemma":[0.0005463913,0.0005371402,0.002580268,0.0000142039,0.0002845914,0.0009675261,0.00004648736,0.003865854,0.001857253,0.9849926,0.004132396,0.0001753061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8145937,0.08423422,0.09256503,0.006437563,0.000571633,0.0001686362,0.000002243435,0.0001068245,0.001320126],"genre_scores_gemma":[0.998732,0.0006468323,0.0001505003,0.0001206997,0.00007937579,0.000001073203,5.137352e-7,0.00001079491,0.0002581507],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1841383,"threshold_uncertainty_score":0.4650556,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2950318982","doi":"10.37236/1020","title":"On Directed Triangles in Digraphs","year":2007,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Purdue University; American Institute of Mathematics; National Science Foundation","keywords":"Combinatorics; Digraph; Mathematics; Conjecture; Vertex (graph theory); Directed graph; Discrete mathematics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.01333259802547749,"gpt":0.2875840749563781,"spread":0.2742514769309006,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003518399,0.0001429744,0.0002943361,0.0002836087,0.0001274303,0.0000153829,0.0004848714,0.00008447139,0.00001130903],"category_scores_gemma":[0.0007420416,0.000083431,0.0001643344,0.0005857075,0.00006639655,0.00005991996,0.00003198359,0.0009353145,8.967439e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002089086,"about_ca_system_score_gemma":0.00009821714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001880454,"about_ca_topic_score_gemma":0.00001801125,"domain_scores_codex":[0.9982908,0.0001682304,0.0005383029,0.00008088234,0.0004045538,0.0005172669],"domain_scores_gemma":[0.9973446,0.001876249,0.0003860439,0.0002535536,0.00008512395,0.00005444914],"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.0002999551,0.0001420213,0.000288939,0.000005746329,0.00006015347,0.0000213308,0.0006020244,0.000003900996,0.00003272755,0.997085,0.0004399441,0.001018261],"study_design_scores_gemma":[0.001230168,0.0004787832,0.00108576,0.00003549997,0.00003381324,0.00008131108,0.0001381027,0.000008688366,0.0008055627,0.994861,0.001144073,0.00009724327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9923702,0.001532659,0.001298462,0.0001821118,0.0005875789,0.0001178223,3.108537e-7,0.00002363973,0.003887249],"genre_scores_gemma":[0.999397,0.0002505922,0.00002544761,0.00007369031,0.00007877083,6.772296e-7,1.373849e-7,0.00001984839,0.0001537775],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007026892,"threshold_uncertainty_score":0.4063528,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1884798717","doi":"10.37236/218","title":"Trees and Meta-Fibonacci Sequences","year":2009,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Fibonacci number; Recursion (computer science); Combinatorics; Mathematics; Interpretation (philosophy); Integer (computer science); Tree (set theory); Constraint (computer-aided design); Discrete mathematics; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01110436457372468,"gpt":0.2329692579977299,"spread":0.2218648934240052,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001271431,0.0001187954,0.0002745753,0.00007312673,0.0001229729,0.0001199964,0.001059017,0.00003308378,0.000005366494],"category_scores_gemma":[0.00003550404,0.00006450731,0.0001211142,0.0003051539,0.00004270425,0.0004316675,0.00005390316,0.0003541088,0.000001888493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006288997,"about_ca_system_score_gemma":0.000166306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002420915,"about_ca_topic_score_gemma":0.00000116319,"domain_scores_codex":[0.9988589,0.0001214519,0.0002597866,0.0001033359,0.0003103499,0.0003461949],"domain_scores_gemma":[0.9991608,0.0001710341,0.0002589224,0.0002599278,0.00008917672,0.00006015004],"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.000004938218,0.00003495729,0.00000980836,9.4038e-7,0.0001424887,0.000008508078,0.000178451,0.00001320915,0.0002865151,0.9942255,0.0002195516,0.00487514],"study_design_scores_gemma":[0.0002387783,0.0006055422,0.0004831292,0.00000292528,0.0002218524,0.0004622396,0.00003326746,0.000578021,0.001308687,0.9937408,0.002239949,0.0000848249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4904828,0.1104063,0.353754,0.04149438,0.000833257,0.0002531595,8.324805e-7,0.0001562609,0.00261908],"genre_scores_gemma":[0.9982116,0.0009506134,0.0001689861,0.0004811513,0.00004039623,5.732248e-7,5.288107e-8,0.000003626461,0.0001429779],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5077288,"threshold_uncertainty_score":0.2630532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1521513823","doi":"10.37236/1133","title":"Cycle Lengths in a Permutation are Typically Poisson","year":2006,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Permutation (music); Combinatorics; Poisson distribution; Set (abstract data type); Order (exchange); Parity of a permutation; Prime (order theory); Permutation group; Discrete mathematics; Cyclic permutation; Symmetric group; Statistics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01032394521202556,"gpt":0.2784055045512657,"spread":0.2680815593392402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009297436,0.000130471,0.0003111208,0.0001166954,0.00006872916,0.00003471064,0.0003301534,0.00006415128,0.00001770913],"category_scores_gemma":[0.0006776037,0.00009205253,0.0001036712,0.0003017499,0.00005397146,0.0002124732,0.00003412374,0.0006152221,0.00000957559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004524352,"about_ca_system_score_gemma":0.0001371896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008036529,"about_ca_topic_score_gemma":0.00005818695,"domain_scores_codex":[0.9983637,0.0001162302,0.0005987554,0.0000816951,0.0004260035,0.0004135538],"domain_scores_gemma":[0.9983355,0.0006838806,0.0005551209,0.0001899646,0.0002029459,0.00003252594],"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.00003180864,0.0002541644,0.000171456,0.00003487226,0.00001682172,0.00001404904,0.0001882726,0.000127203,0.000139379,0.998449,0.0005274019,0.00004553914],"study_design_scores_gemma":[0.0007166632,0.0001425692,0.0006792315,0.0000638071,0.00004105374,0.0001067617,0.0003325382,0.0001846522,0.0005701487,0.9967481,0.0003156202,0.00009883923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9680746,0.001544396,0.02541916,0.001683978,0.0001927064,0.0001894591,6.674953e-7,0.00003109218,0.002864006],"genre_scores_gemma":[0.9985607,0.0001093097,0.0001990314,0.00002493623,0.00008743183,0.000003726699,3.090871e-7,0.00002561878,0.0009889432],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03048616,"threshold_uncertainty_score":0.3753793,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139572946","doi":"10.37236/1953","title":"Asymptotics of Generating the Symmetric and Alternating Groups","year":2005,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Symmetric group; Alternating group; Group (periodic table); Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01557213424816992,"gpt":0.2678966998297879,"spread":0.252324565581618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002384065,0.000126042,0.0003042713,0.000195393,0.0001706093,0.00002493804,0.0004828573,0.00005714696,0.000009926198],"category_scores_gemma":[0.001199832,0.00006838902,0.00009790988,0.0007355626,0.0001029317,0.00008362624,0.00009050721,0.000672415,0.000001085194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001211459,"about_ca_system_score_gemma":0.0001427898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004242198,"about_ca_topic_score_gemma":0.000003737574,"domain_scores_codex":[0.998357,0.0001706805,0.0006075355,0.00007715034,0.0003944522,0.0003931817],"domain_scores_gemma":[0.9969983,0.001691487,0.0008440355,0.0002108763,0.00021098,0.00004435772],"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.000007373496,0.00007580865,0.0004369943,0.0000141992,0.0001062598,0.000001404575,0.0004519277,0.00008377067,0.0001269865,0.9933349,0.0001904955,0.005169817],"study_design_scores_gemma":[0.0007939501,0.0004760561,0.0002991826,0.00002127339,0.0001518193,0.0005031404,0.0005159318,0.002024182,0.00149085,0.992611,0.001011782,0.0001008503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9776156,0.007899756,0.01188635,0.001748272,0.0002272419,0.00008992847,3.49892e-7,0.000007653412,0.0005248665],"genre_scores_gemma":[0.9981419,0.0009393592,0.0003615153,0.00008510717,0.0002817356,8.279502e-7,9.54076e-8,0.00001652339,0.000172896],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02052636,"threshold_uncertainty_score":0.2921346,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1497318709","doi":"10.37236/506","title":"On a Generalization of Meyniel's Conjecture on the Cops and Robbers Game","year":2011,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Omega; Graph; Upper and lower bounds; Generalization; Discrete mathematics; Physics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.02718980063096784,"gpt":0.2455228207970944,"spread":0.2183330201661265,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001096923,0.0001375651,0.000239423,0.00007452765,0.0001378767,0.00001153797,0.0003739123,0.00007481525,0.00003884634],"category_scores_gemma":[0.0002902835,0.00006445089,0.000101004,0.0001731298,0.0001298473,0.00003868773,0.00003694377,0.0005646906,3.942535e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006666062,"about_ca_system_score_gemma":0.00008273868,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002728668,"about_ca_topic_score_gemma":0.000001836093,"domain_scores_codex":[0.9987947,0.0002466312,0.0003249204,0.00007411298,0.0003197187,0.0002399593],"domain_scores_gemma":[0.9983468,0.0007052325,0.0005045625,0.0002791944,0.0001289973,0.00003519191],"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.0001459919,0.00006714481,0.00004168835,0.00001209601,0.0001253873,0.000001786067,0.002494226,0.00002008444,0.00007049934,0.9961491,0.0007401661,0.0001318437],"study_design_scores_gemma":[0.0005191781,0.001034268,0.0001555749,0.00003891341,0.00009303597,0.00007149787,0.0001569528,0.00004625902,0.004111922,0.993428,0.0002713241,0.00007308328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9938199,0.0009222102,0.001794282,0.0003965178,0.0003223449,0.0001576292,0.000001089884,0.000007866613,0.002578186],"genre_scores_gemma":[0.9991641,0.0004313953,0.00001976848,0.000217984,0.0000434265,0.000001290638,1.654884e-7,0.00001818838,0.0001037046],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005344203,"threshold_uncertainty_score":0.2628231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1593192935","doi":"10.37236/1763","title":"There Exist Binary Circular $5/2^+$ Power Free Words of Every Length","year":2004,"lang":"en","type":"article","venue":"The Electronic Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"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","keywords":"Mathematics; Combinatorics; Binary number; Power (physics); Discrete mathematics; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.005737579744329706,"gpt":0.2091109374382763,"spread":0.2033733576939466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001643061,0.0001872896,0.0003411277,0.000142086,0.0001304511,0.00005906828,0.002976757,0.00008088326,0.00001074132],"category_scores_gemma":[0.00009230686,0.0001262737,0.0002419767,0.0006770786,0.0001078497,0.0004559585,0.0002776221,0.0007150414,0.000007088213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000337224,"about_ca_system_score_gemma":0.0007675326,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001083278,"about_ca_topic_score_gemma":0.000001079288,"domain_scores_codex":[0.9979572,0.0001572576,0.0005129338,0.0001584568,0.0006675374,0.0005466409],"domain_scores_gemma":[0.998009,0.0001773023,0.000573698,0.0009443949,0.0002140606,0.00008152783],"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.00002276961,0.0002401316,0.00005579397,0.0000108245,0.0001062821,0.00004168871,0.0006367843,0.0002456487,0.001305132,0.9964859,0.0003118057,0.0005372298],"study_design_scores_gemma":[0.001256953,0.0008933551,0.0006229136,0.0000706694,0.00003015831,0.0003655373,0.0001790996,0.0001083213,0.004060698,0.9909824,0.001273482,0.000156409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8440346,0.02321497,0.1259474,0.003322703,0.001159602,0.0001442418,0.000001258363,0.00006132038,0.002113907],"genre_scores_gemma":[0.9988869,0.0006566,0.0001447165,0.0001423957,0.00005905518,0.000001208278,2.193284e-7,0.00001884001,0.00009000946],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1548523,"threshold_uncertainty_score":0.5531605,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}