{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"William McCuaig","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001051207,0.0005519274,0.00135781,0.0006145212,0.002399495,0.004110656,0.001556549,0.001987115,0.02976206],"category_scores_gemma":[0.007964662,0.0005742397,0.0008912041,0.001291919,0.002262318,0.00618673,0.00254262,0.003688105,0.00480897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001431838,"about_ca_system_score_gemma":0.002157921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001693818,"about_ca_topic_score_gemma":0.001738288,"domain_scores_codex":[0.9988928,0.0002082526,0.00005313413,0.0004152035,0.0001786908,0.000251923],"domain_scores_gemma":[0.9964485,0.00203037,0.0002215024,0.000755378,0.0003119895,0.0002322395],"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.0001710391,0.00006507681,0.000336434,0.0001357724,0.00002245158,0.00009211453,0.0001205729,0.01096262,0.0005224669,0.9223806,0.02759467,0.03759609],"study_design_scores_gemma":[0.00005406238,0.00002060198,0.0001378707,0.00002206319,0.00001027321,0.00006374755,0.00008098537,0.02258317,0.0005526827,0.96441,0.0120514,0.00001314113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1559086,0.00233223,0.5329973,0.02009629,0.001513601,0.0002417628,0.004870184,0.002014332,0.2800258],"genre_scores_gemma":[0.7985178,0.001817646,0.09164168,0.001846742,0.0008830068,0.0003834738,0.003475276,0.0007571083,0.1006773],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02976206,"threshold_uncertainty_score":0.09956402,"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","authors":[{"name":"Brendan D. McKay","is_ca":false},{"name":"Nicholas Wormald","is_ca":true},{"name":"Beata Wysocka","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001624446,0.000528106,0.000911802,0.002836004,0.001150422,0.002187401,0.001327506,0.001515461,0.002940649],"category_scores_gemma":[0.01588491,0.0008465596,0.0005882661,0.001500756,0.002771802,0.003682537,0.00145767,0.001136938,0.0004585858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001927478,"about_ca_system_score_gemma":0.0005323082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002014961,"about_ca_topic_score_gemma":0.001908483,"domain_scores_codex":[0.9990188,0.0003562836,0.00003519858,0.0002295346,0.0001882038,0.0001720058],"domain_scores_gemma":[0.9914228,0.00489878,0.001522089,0.0007058156,0.0005834543,0.0008669352],"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.0002301684,0.00005975944,0.005056015,0.0001796988,0.00006891025,0.0004216898,0.0006191691,0.05423522,0.003602169,0.9174119,0.003656074,0.0144593],"study_design_scores_gemma":[0.00005367226,0.00004951806,0.001616507,0.00005853871,0.0000335295,0.0003432898,0.0001616635,0.188336,0.001227917,0.8049098,0.003168047,0.00004153015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8422731,0.003691018,0.1343127,0.002161737,0.0001325273,0.000121619,0.0003832771,0.0006195476,0.01630445],"genre_scores_gemma":[0.9889436,0.001133032,0.006051707,0.0002352683,0.0001124285,0.0001412306,0.0002011919,0.00009425716,0.003087213],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002940649,"threshold_uncertainty_score":0.01398492,"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","authors":[{"name":"Peter J‎. Cameron","is_ca":false},{"name":"Ashley Montanaro","is_ca":false},{"name":"Michael Newman","is_ca":false},{"name":"Simone Severini","is_ca":false},{"name":"Andreas Winter","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002028893,0.0006336467,0.0008061731,0.001918629,0.003001345,0.002599982,0.001561888,0.001529553,0.006166551],"category_scores_gemma":[0.00857051,0.0004842824,0.0006671883,0.001525327,0.008539109,0.008599585,0.00252942,0.00265192,0.0004422514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003810934,"about_ca_system_score_gemma":0.001426765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002712361,"about_ca_topic_score_gemma":0.002125941,"domain_scores_codex":[0.99841,0.000596464,0.00004364342,0.000378739,0.0002452908,0.0003257683],"domain_scores_gemma":[0.9890387,0.007521389,0.000975629,0.001178376,0.0004585902,0.0008272593],"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.00007602891,0.00002672539,0.0004897991,0.00003928876,0.00000927584,0.00003239893,0.0001734885,0.01167659,0.002007487,0.9823124,0.0007868719,0.002369635],"study_design_scores_gemma":[0.00003210983,0.0000326269,0.0004925271,0.00002377156,0.00001341442,0.00007071992,0.0001345832,0.05706206,0.001201523,0.9385074,0.002399192,0.00003005806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6707298,0.001138553,0.2529429,0.005696062,0.0001773188,0.0001544167,0.0006082891,0.000295945,0.0682567],"genre_scores_gemma":[0.9544798,0.0004973051,0.03925455,0.0004222336,0.0001463202,0.0001592801,0.0002117795,0.0001393687,0.004689387],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006166551,"threshold_uncertainty_score":0.02765036,"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","authors":[{"name":"Edward A. Bender","is_ca":true},{"name":"Zhicheng Gao","is_ca":true},{"name":"Nicholas Wormald","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004217055,0.0003461817,0.000407746,0.001650705,0.0007642188,0.001321682,0.001149993,0.001066181,0.004741665],"category_scores_gemma":[0.00663385,0.000382997,0.0003528158,0.0009132191,0.001373804,0.002572044,0.001049545,0.0006150643,0.000431256],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000869582,"about_ca_system_score_gemma":0.000356898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004837271,"about_ca_topic_score_gemma":0.0005349258,"domain_scores_codex":[0.9995635,0.0001010875,0.00001639057,0.0001259256,0.0001211536,0.0000718007],"domain_scores_gemma":[0.9967927,0.001654468,0.000510541,0.000366194,0.0003715725,0.0003043972],"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.0004020278,0.00006951491,0.0110975,0.0003646823,0.00007198599,0.0006188279,0.0004451564,0.08074177,0.04755993,0.802363,0.006509287,0.04975629],"study_design_scores_gemma":[0.00005660473,0.00008728362,0.009230292,0.00007184131,0.00007700248,0.001812421,0.0003326783,0.2912778,0.02468701,0.6632449,0.009044204,0.00007798993],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8953654,0.0004249846,0.07385068,0.0008826755,0.00007283912,0.00003606806,0.0006842645,0.0006025337,0.02808068],"genre_scores_gemma":[0.9735649,0.0005535534,0.01868958,0.0001296629,0.00008970464,0.000108295,0.0008581222,0.0001115212,0.005894723],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004741665,"threshold_uncertainty_score":0.01586246,"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","authors":[{"name":"James D. Currie","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002303916,0.0005082887,0.0004251123,0.0004153584,0.001568767,0.001213297,0.000463633,0.0009999493,0.01336825],"category_scores_gemma":[0.001621733,0.0003767348,0.0006194714,0.0005123695,0.001356618,0.002251999,0.001558387,0.0006881564,0.002731197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005168855,"about_ca_system_score_gemma":0.0006109387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000752075,"about_ca_topic_score_gemma":0.001725741,"domain_scores_codex":[0.9997169,0.00003067185,0.00002247781,0.0000877393,0.00005506668,0.00008706671],"domain_scores_gemma":[0.9984452,0.0006713889,0.0003567215,0.0001435664,0.0001902382,0.0001929841],"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.003747862,0.0003183456,0.02279878,0.00128172,0.0001234913,0.00549442,0.006135843,0.003039332,0.19645,0.5641672,0.0171779,0.1792652],"study_design_scores_gemma":[0.0001910267,0.0004031962,0.02166258,0.0002945458,0.0001679759,0.005351512,0.005146491,0.006263485,0.1165085,0.7081625,0.1355928,0.000255419],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8800553,0.001485838,0.03744588,0.001707979,0.0004001004,0.00005057637,0.000973698,0.0005620379,0.07731848],"genre_scores_gemma":[0.94451,0.00049542,0.03007493,0.0004629964,0.00007880626,0.0001191295,0.0009581378,0.0001268761,0.02317368],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01336825,"threshold_uncertainty_score":0.04472125,"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","authors":[{"name":"Toufik Mansour","is_ca":true},{"name":"Alek Vainshtein","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006503853,0.0006340639,0.0004942568,0.001621886,0.001004398,0.001606301,0.0004885896,0.0006980937,0.003154634],"category_scores_gemma":[0.002872947,0.00027204,0.0005829366,0.001406802,0.002379975,0.002154285,0.0009622803,0.001297399,0.0008099608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001366354,"about_ca_system_score_gemma":0.0006637277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002819088,"about_ca_topic_score_gemma":0.002096745,"domain_scores_codex":[0.9995528,0.0001238421,0.00001855508,0.00007039414,0.0001198799,0.0001144499],"domain_scores_gemma":[0.9993131,0.0003259765,0.000130342,0.00009828682,0.00006940891,0.00006281861],"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.00003452392,0.000008960235,0.0002023582,0.00001817686,0.000003526518,0.00006625474,0.00009232536,0.002458788,0.0009322291,0.9873106,0.0004313176,0.008440932],"study_design_scores_gemma":[0.0000131127,0.00001808326,0.0002856948,0.00001390523,0.000005242563,0.000148734,0.00003347501,0.0132714,0.0007543968,0.9818326,0.003607971,0.00001523638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6670122,0.005702694,0.2105976,0.002122263,0.0003366716,0.00006105135,0.0003220565,0.0003343821,0.1135111],"genre_scores_gemma":[0.9616528,0.002093468,0.01771103,0.0002221624,0.0003736498,0.00007385449,0.000161196,0.00006407099,0.01764783],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003154634,"threshold_uncertainty_score":0.0105533,"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","authors":[{"name":"Tomer Kotek","is_ca":false},{"name":"James Preen","is_ca":true},{"name":"F. Simon","is_ca":false},{"name":"Peter Tittmann","is_ca":false},{"name":"Martin Trinks","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008596421,0.0004973007,0.0004632761,0.001655672,0.0008609589,0.00155367,0.001093377,0.0006781123,0.004247671],"category_scores_gemma":[0.005002142,0.0003475707,0.0009985922,0.001645634,0.001708315,0.002845107,0.001167553,0.002417334,0.0005956991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001568462,"about_ca_system_score_gemma":0.000465611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001584729,"about_ca_topic_score_gemma":0.001741888,"domain_scores_codex":[0.9991434,0.0001311199,0.00006200367,0.0002012731,0.000263621,0.0001985925],"domain_scores_gemma":[0.9967678,0.002212972,0.0002884713,0.000243573,0.0003623337,0.0001248525],"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.00004447693,0.00005037575,0.001402761,0.00007251488,0.00001444355,0.0002579946,0.0006209344,0.004593789,0.00635434,0.961118,0.002166842,0.02330345],"study_design_scores_gemma":[0.00002127421,0.00002569607,0.0008165194,0.00001746078,0.00002084021,0.0003383354,0.0001277734,0.03374343,0.004913169,0.9572486,0.002695378,0.00003145587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5844605,0.001194174,0.3566022,0.001811336,0.0001135484,0.000106424,0.0008237407,0.0005864444,0.05430164],"genre_scores_gemma":[0.9550959,0.0004155791,0.03712263,0.0001975344,0.0001207513,0.0001231376,0.0005875031,0.0001282823,0.00620865],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004247671,"threshold_uncertainty_score":0.01420987,"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","authors":[{"name":"D. de Caen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006955247,0.000635405,0.0004971635,0.00216117,0.002207386,0.002814051,0.001656121,0.001043448,0.01061259],"category_scores_gemma":[0.003859937,0.0007104689,0.0004768833,0.001647299,0.002637093,0.00344861,0.002937748,0.001701949,0.002056459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009917925,"about_ca_system_score_gemma":0.0002383846,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002657406,"about_ca_topic_score_gemma":0.0004924064,"domain_scores_codex":[0.9987867,0.0004461568,0.00006410242,0.0002374357,0.0003066186,0.0001590052],"domain_scores_gemma":[0.9972351,0.001368312,0.0003523875,0.0004670295,0.0003048886,0.0002722912],"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.00006674552,0.00001991171,0.0003883222,0.00005750346,0.000006917885,0.0001162387,0.0002025404,0.002781053,0.002170247,0.981531,0.00201671,0.01064288],"study_design_scores_gemma":[0.0000597668,0.0001160907,0.00064546,0.0001078364,0.00002682631,0.0008735305,0.0005135447,0.03762873,0.01606952,0.9029074,0.04099184,0.00005938364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3508029,0.001062591,0.4979364,0.0009871629,0.0001986704,0.0001357032,0.0004960733,0.00130831,0.1470722],"genre_scores_gemma":[0.826129,0.0005431841,0.1464863,0.0003972788,0.0001248168,0.0003585918,0.0007209897,0.0002564115,0.0249835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01061259,"threshold_uncertainty_score":0.03550261,"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","authors":[{"name":"Chris Godsil","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001989724,0.0004331118,0.0003974699,0.001075747,0.001350213,0.001070267,0.0007135522,0.0006522655,0.01509306],"category_scores_gemma":[0.001482691,0.0002912173,0.0004562874,0.0007519528,0.0008241876,0.001335463,0.001028591,0.0007613907,0.001850009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008032966,"about_ca_system_score_gemma":0.0004199879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001114261,"about_ca_topic_score_gemma":0.001436074,"domain_scores_codex":[0.9996569,0.00006160527,0.00001955221,0.0001146556,0.0000681053,0.00007912258],"domain_scores_gemma":[0.9992579,0.0002095934,0.0001222512,0.000181077,0.0001234949,0.0001057131],"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.00006740614,0.00002736013,0.000532657,0.00009751149,0.00001888537,0.0004114029,0.00021428,0.003471171,0.003009366,0.9588244,0.00922844,0.02409724],"study_design_scores_gemma":[0.00002873301,0.00002906098,0.0007036429,0.00003454983,0.00001683604,0.000665421,0.000174328,0.01358109,0.001404597,0.9348405,0.04850113,0.00002012671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3299216,0.003138616,0.3414827,0.002960619,0.0008404999,0.0004052365,0.005348676,0.001664904,0.3142372],"genre_scores_gemma":[0.8448696,0.00188131,0.07497665,0.0008402399,0.0003781837,0.0003998656,0.004506222,0.0003166844,0.07183123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01509306,"threshold_uncertainty_score":0.05049133,"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)","authors":[{"name":"L. Bruce Richmond","is_ca":true},{"name":"Jeffrey Shallit","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001759659,0.0008424195,0.00142431,0.003629095,0.001848162,0.003710697,0.002820379,0.001508873,0.01553561],"category_scores_gemma":[0.02725983,0.000707926,0.0007875504,0.00331945,0.003150078,0.01264332,0.003991586,0.001929234,0.003142761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001174808,"about_ca_system_score_gemma":0.0008699719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005901252,"about_ca_topic_score_gemma":0.0006523635,"domain_scores_codex":[0.9951349,0.001208659,0.0002713151,0.0009096566,0.001931876,0.0005435889],"domain_scores_gemma":[0.9839236,0.009967291,0.0009603067,0.002427507,0.002069212,0.0006521606],"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.0003350692,0.0001046038,0.005264584,0.0004680009,0.00005271642,0.0004668544,0.0004916547,0.01041697,0.008495782,0.8626038,0.0168373,0.09446274],"study_design_scores_gemma":[0.00003346589,0.00007269767,0.001301337,0.00009960968,0.00004497152,0.001668708,0.0001902088,0.08032284,0.008274298,0.8890015,0.01893906,0.00005131307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2456388,0.00353414,0.6210648,0.002968097,0.0008977989,0.000273102,0.001351644,0.001595758,0.1226758],"genre_scores_gemma":[0.7513624,0.002329544,0.198307,0.001154797,0.001343644,0.0007873754,0.002296759,0.001141843,0.04127675],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01553561,"threshold_uncertainty_score":0.05197185,"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","authors":[{"name":"J Cain","is_ca":false},{"name":"Nicholas Wormald","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00116146,0.0004130487,0.0009079644,0.002062288,0.00148595,0.002620834,0.001212857,0.001050349,0.008470749],"category_scores_gemma":[0.008934707,0.0004732086,0.0006340644,0.0007195844,0.002352849,0.00513362,0.003562646,0.001971438,0.001020881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001334335,"about_ca_system_score_gemma":0.0005480379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001091466,"about_ca_topic_score_gemma":0.001125277,"domain_scores_codex":[0.9988852,0.0002262178,0.00004917891,0.0002860147,0.0002991599,0.0002542536],"domain_scores_gemma":[0.9950153,0.001765239,0.0006063108,0.000700327,0.0009600361,0.0009526649],"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.0000293239,0.0000163745,0.0009416451,0.00004225704,0.000005155915,0.0001120768,0.0001767082,0.001394863,0.001762633,0.9895641,0.0008570289,0.005097824],"study_design_scores_gemma":[0.00001858144,0.00006817265,0.001991335,0.00005526195,0.00001271882,0.0005316193,0.0002404896,0.04527197,0.003489475,0.9406375,0.007658961,0.00002398955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5883706,0.001430885,0.2314762,0.001383516,0.000336371,0.0001269573,0.0004224378,0.0007238616,0.1757293],"genre_scores_gemma":[0.9576555,0.0004116654,0.02160062,0.0003559529,0.0001678043,0.0001330988,0.0001691,0.000241233,0.01926511],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008470749,"threshold_uncertainty_score":0.02833748,"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","authors":[{"name":"Nantel Bergeron","is_ca":true},{"name":"Christophe Hohlweg","is_ca":true},{"name":"Mercedes Rosas","is_ca":true},{"name":"Mike Zabrocki","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006842581,0.0006202852,0.0006394967,0.001727686,0.001709435,0.002365351,0.0009493808,0.0005923796,0.003996509],"category_scores_gemma":[0.001088454,0.0003518451,0.0005571234,0.00149053,0.002985595,0.00425662,0.001677159,0.001728365,0.0008280299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008766413,"about_ca_system_score_gemma":0.0006385366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001233297,"about_ca_topic_score_gemma":0.001629542,"domain_scores_codex":[0.9995036,0.0001227238,0.00002073522,0.00006098589,0.0001690608,0.0001228543],"domain_scores_gemma":[0.9993945,0.0001642014,0.0001282028,0.00006758385,0.00007975727,0.0001657731],"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.00001209002,0.00001432974,0.00009039112,0.00002254837,0.000002751018,0.00006276077,0.0001407499,0.0005576406,0.0006237728,0.9968632,0.0002474388,0.001362345],"study_design_scores_gemma":[0.000007088515,0.000009296074,0.000137247,0.000006179223,0.000003825682,0.00007909549,0.00007385445,0.002865116,0.0006567826,0.9949869,0.001166688,0.000008052943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7854465,0.003972793,0.1250899,0.001711366,0.0004203784,0.00007202163,0.0003209078,0.0001738844,0.08279229],"genre_scores_gemma":[0.9788979,0.000956442,0.0108104,0.0001814699,0.0001959487,0.00005427073,0.0001744049,0.00003098724,0.008698119],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003996509,"threshold_uncertainty_score":0.01336968,"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","authors":[{"name":"József Balogh","is_ca":false},{"name":"Béla Csaba","is_ca":false},{"name":"Martin Pei","is_ca":true},{"name":"Wojciech Samotij","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006044872,0.0002573068,0.0003974809,0.000715333,0.0006219207,0.0006616016,0.0004900019,0.0004811569,0.001799692],"category_scores_gemma":[0.004886642,0.0003262183,0.0003088517,0.0005921826,0.001220164,0.001948261,0.001100926,0.001010775,0.0002517286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003155698,"about_ca_system_score_gemma":0.0001788171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004441633,"about_ca_topic_score_gemma":0.000496601,"domain_scores_codex":[0.9996374,0.0001164134,0.00001035409,0.00008453226,0.00008453451,0.00006683061],"domain_scores_gemma":[0.9957839,0.003087892,0.0003051303,0.0002492675,0.0002660277,0.0003079029],"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.0001506225,0.00004413705,0.002643717,0.0001668961,0.00001963797,0.0005412304,0.0007093686,0.02771614,0.02137933,0.9223047,0.003393587,0.02093061],"study_design_scores_gemma":[0.00003650257,0.000070804,0.002711043,0.00003215914,0.00002197015,0.0007835896,0.0001916701,0.08987882,0.00595111,0.8937843,0.006518054,0.00002006349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7900825,0.001325231,0.1820295,0.0009175361,0.000039786,0.00003324866,0.0002903622,0.0003074611,0.0249744],"genre_scores_gemma":[0.975738,0.0006150395,0.01988616,0.0002445859,0.00007596546,0.0000502283,0.0003086261,0.00007393631,0.003007472],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001799692,"threshold_uncertainty_score":0.006020606,"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","authors":[{"name":"Edward A. Bender","is_ca":true},{"name":"Zhicheng Gao","is_ca":true},{"name":"L. Bruce Richmond","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001050796,0.0005883247,0.0005683549,0.002585457,0.001165669,0.001785605,0.001367797,0.001219351,0.0145044],"category_scores_gemma":[0.01133089,0.0002953944,0.0007915839,0.001001084,0.002656572,0.005326182,0.002084133,0.003260506,0.002023329],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001705975,"about_ca_system_score_gemma":0.0007947061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002637104,"about_ca_topic_score_gemma":0.001721639,"domain_scores_codex":[0.9992576,0.0001197881,0.00002800933,0.0001833932,0.0002603632,0.0001508441],"domain_scores_gemma":[0.996735,0.001561677,0.0002858779,0.0003824366,0.0006990199,0.0003359325],"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.00005816326,0.0000249264,0.001075412,0.0001657108,0.0000141716,0.0001970533,0.0003524938,0.002309925,0.00468673,0.9637856,0.005455527,0.0218743],"study_design_scores_gemma":[0.00001431247,0.00004232615,0.002375173,0.0001130772,0.00003058245,0.0006773854,0.0001756314,0.0394381,0.004503991,0.9405876,0.01198471,0.0000571858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3384291,0.006527657,0.3801954,0.006154964,0.001515219,0.0001135869,0.0006056327,0.002776407,0.2636819],"genre_scores_gemma":[0.9303757,0.002160043,0.02422566,0.001065017,0.001033479,0.0001456494,0.0003932902,0.001051562,0.03954969],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0145044,"threshold_uncertainty_score":0.04852206,"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","authors":[{"name":"Luís Serrano","is_ca":true},{"name":"Christian Stump","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002155855,0.0002888575,0.0003299938,0.0008798435,0.001450263,0.00171702,0.0004785775,0.0005003625,0.005314539],"category_scores_gemma":[0.001214186,0.0003595462,0.0004794364,0.0004981076,0.002209017,0.001934478,0.001830545,0.0008600513,0.0004474577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007415614,"about_ca_system_score_gemma":0.0002584612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001229837,"about_ca_topic_score_gemma":0.002044631,"domain_scores_codex":[0.9996954,0.00004464787,0.00001472273,0.00006395682,0.0000806247,0.0001005728],"domain_scores_gemma":[0.9995282,0.0001567072,0.00008956532,0.00005641234,0.00004383391,0.0001252757],"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.00005893844,0.00001783988,0.001123455,0.00004158543,0.000005449872,0.000291529,0.0006987352,0.002684442,0.003969564,0.9829339,0.000729165,0.007445364],"study_design_scores_gemma":[0.0000245062,0.00007307674,0.002431498,0.00004107678,0.00001631685,0.0009069451,0.001152351,0.01739939,0.00665037,0.9585113,0.01273559,0.00005758495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9320081,0.0001885449,0.03472598,0.0002852752,0.00006431605,0.00002007972,0.0001101071,0.0001357105,0.03246181],"genre_scores_gemma":[0.9852235,0.0001076882,0.007504955,0.000045259,0.0000289474,0.0000250182,0.0001011461,0.00005129211,0.00691219],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005314539,"threshold_uncertainty_score":0.01777887,"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","authors":[{"name":"Luis Goddyn","is_ca":true},{"name":"Pavol Gvozdjak","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004174204,0.0004760664,0.0004015668,0.0005862301,0.0008377039,0.001158416,0.0006568685,0.0008621501,0.003877177],"category_scores_gemma":[0.003792346,0.0003067621,0.0003168683,0.000942884,0.001504241,0.002010179,0.002097836,0.001103628,0.001007398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008455705,"about_ca_system_score_gemma":0.0008950339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001298824,"about_ca_topic_score_gemma":0.00114931,"domain_scores_codex":[0.9992632,0.0001160502,0.00004140098,0.0001297684,0.0002384073,0.0002110996],"domain_scores_gemma":[0.9978841,0.0008138415,0.0004303266,0.0004459671,0.000226817,0.0001989287],"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.0005886378,0.00008524435,0.002127029,0.000166545,0.00002501957,0.001040465,0.000607669,0.03877694,0.03831413,0.8472122,0.00425422,0.0668019],"study_design_scores_gemma":[0.0001239927,0.0002908992,0.001392765,0.0001150475,0.00004840164,0.001163867,0.0001936851,0.1654149,0.04477479,0.7605476,0.02584161,0.00009236352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6456358,0.001814551,0.3052533,0.001312905,0.000204323,0.000114129,0.0003458349,0.0008518401,0.04446732],"genre_scores_gemma":[0.9387666,0.0005959772,0.04886575,0.0003616766,0.0001093482,0.0001736335,0.0002685965,0.0001162513,0.01074224],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003877177,"threshold_uncertainty_score":0.01297039,"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","authors":[{"name":"Béla Bollobás","is_ca":false},{"name":"Dieter Mitsche","is_ca":false},{"name":"Paweł Prałat","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002234725,0.001073758,0.001501782,0.003357992,0.001560558,0.003634191,0.001287622,0.001472272,0.00275329],"category_scores_gemma":[0.01511896,0.0005353714,0.0008535144,0.002720976,0.003530754,0.005892543,0.002459012,0.002355356,0.0004149776],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0026384,"about_ca_system_score_gemma":0.0005565136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001101192,"about_ca_topic_score_gemma":0.0007067419,"domain_scores_codex":[0.9974446,0.001177143,0.0001156498,0.0004999978,0.0004868126,0.0002757796],"domain_scores_gemma":[0.9838594,0.01095264,0.001554233,0.001493032,0.0009094105,0.001231239],"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.00007883496,0.00002833626,0.00173745,0.0001610007,0.00006223602,0.00006013484,0.0002077532,0.01439374,0.001014554,0.9702899,0.0037782,0.008187843],"study_design_scores_gemma":[0.00001557403,0.00003948779,0.001334646,0.00003656453,0.00002146592,0.0001615544,0.00008775867,0.05252695,0.0004507027,0.9394442,0.005848685,0.00003231539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4119771,0.01842133,0.5102054,0.007709044,0.000429315,0.000185208,0.003659169,0.0005172126,0.0468962],"genre_scores_gemma":[0.9388409,0.005479979,0.04835487,0.0006961502,0.0007507964,0.0003080313,0.001404856,0.0001516132,0.004012864],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003634191,"threshold_uncertainty_score":0.01914304,"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","authors":[{"name":"Charles J. Colbourn","is_ca":false},{"name":"Anthony D. Forbes","is_ca":false},{"name":"M. J. Grannell","is_ca":false},{"name":"Terry S. Griggs","is_ca":false},{"name":"Petteri Kaski","is_ca":false},{"name":"Patric R. J. Östergård","is_ca":false},{"name":"David A. Pike","is_ca":true},{"name":"Olli Pottonen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003351823,0.0002831684,0.0003576354,0.0008471677,0.001135751,0.001664496,0.0003359919,0.0003512047,0.009232201],"category_scores_gemma":[0.001431564,0.0003288569,0.000470082,0.0009318015,0.0009420369,0.001125104,0.0007914226,0.0006833643,0.0007736425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007320613,"about_ca_system_score_gemma":0.0007163208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008354205,"about_ca_topic_score_gemma":0.001067213,"domain_scores_codex":[0.9995257,0.00005614974,0.0000445085,0.00007383306,0.0001591156,0.0001407324],"domain_scores_gemma":[0.9987978,0.0003892108,0.0003276806,0.0001394802,0.0001988063,0.0001470064],"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.0003930036,0.0001000561,0.007684063,0.0002130985,0.00005526275,0.0008665334,0.001096885,0.02389219,0.04626786,0.870934,0.004093027,0.04440402],"study_design_scores_gemma":[0.0001825395,0.000706692,0.01064313,0.0001015832,0.00009350776,0.002763411,0.001627555,0.04781714,0.04028283,0.8426514,0.05299905,0.0001310745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9124537,0.0002007801,0.03489489,0.0001959361,0.00003963254,0.0000692637,0.0008911891,0.0001145367,0.05114011],"genre_scores_gemma":[0.9816218,0.0001628389,0.0105957,0.00004204761,0.0000284498,0.00005528092,0.0008806986,0.00003516662,0.006578052],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009232201,"threshold_uncertainty_score":0.03088474,"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","authors":[{"name":"David G. Wagner","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007871775,0.0005035613,0.0003584073,0.001108279,0.0007160017,0.001570811,0.0008991032,0.0007612108,0.008441204],"category_scores_gemma":[0.002657861,0.0002726158,0.0004823812,0.001478645,0.001630681,0.004333643,0.001516131,0.002947352,0.00114351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00176585,"about_ca_system_score_gemma":0.0004483848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001686487,"about_ca_topic_score_gemma":0.001828687,"domain_scores_codex":[0.9993874,0.000110459,0.00003835076,0.000139692,0.0002456649,0.00007837071],"domain_scores_gemma":[0.9988212,0.0005767742,0.00010739,0.0001022053,0.0003167322,0.00007572297],"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.000014913,0.000007211141,0.0001190151,0.00005205353,0.000004456212,0.00002944875,0.00006419373,0.002202599,0.001071288,0.9824785,0.002163342,0.01179288],"study_design_scores_gemma":[0.00000888955,0.00002021697,0.0003096794,0.00002933785,0.000005970382,0.00009833086,0.00005296616,0.01505893,0.001894877,0.9553323,0.02717644,0.00001198958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06951114,0.007711428,0.6473557,0.00690194,0.00070743,0.00008158453,0.001075391,0.0002107443,0.2664446],"genre_scores_gemma":[0.8027811,0.007600487,0.1328387,0.002351166,0.001320605,0.0002980449,0.001247495,0.0001560971,0.05140626],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008441204,"threshold_uncertainty_score":0.02823865,"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","authors":[{"name":"Karen Meagher","is_ca":true},{"name":"Lucia Moura","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00490891,0.0008989761,0.002016864,0.002638964,0.003227851,0.004029648,0.002438466,0.001428939,0.007908099],"category_scores_gemma":[0.01619821,0.0009021887,0.002200225,0.002626562,0.004642163,0.01093411,0.005064177,0.004260267,0.001183328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003028491,"about_ca_system_score_gemma":0.00096506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001263769,"about_ca_topic_score_gemma":0.001157115,"domain_scores_codex":[0.9965501,0.0007357385,0.0002817854,0.0009108226,0.0008750687,0.0006464769],"domain_scores_gemma":[0.988152,0.006361593,0.001373689,0.002204888,0.001069044,0.0008387239],"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.00005583275,0.00001816963,0.0007127731,0.00007307111,0.00002204442,0.00007559863,0.0003031317,0.004365453,0.0007774505,0.9873407,0.001589577,0.00466616],"study_design_scores_gemma":[0.00004460988,0.00004261319,0.0008205971,0.00003763445,0.0000426427,0.0003090002,0.0002078902,0.03061994,0.001691326,0.9587914,0.007353039,0.00003940467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3500411,0.002559972,0.561242,0.003485079,0.0003392814,0.0002462282,0.001173742,0.0005405686,0.08037213],"genre_scores_gemma":[0.8824854,0.002507058,0.09812113,0.001049215,0.0005697152,0.0005181344,0.001165346,0.0002073363,0.01337657],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007908099,"threshold_uncertainty_score":0.02645522,"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","authors":[{"name":"Chris Godsil","is_ca":true},{"name":"Krystal Guo","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003251685,0.000336705,0.0002887908,0.0009641893,0.000584116,0.0007968397,0.0005016472,0.0006967145,0.002388363],"category_scores_gemma":[0.002080386,0.0001897107,0.0002954417,0.0004947452,0.001515121,0.001331682,0.0006443642,0.0006952762,0.0002598431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003794151,"about_ca_system_score_gemma":0.0002443717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009087286,"about_ca_topic_score_gemma":0.0007084552,"domain_scores_codex":[0.9997514,0.00007346171,0.000007413139,0.00003834768,0.00006791564,0.0000614202],"domain_scores_gemma":[0.9989957,0.0005088831,0.0001634078,0.00008285068,0.0001055614,0.0001436031],"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.00003989839,0.00004402078,0.0006401966,0.00003276948,0.000008668163,0.0002166915,0.0002504959,0.01370265,0.004676509,0.9762955,0.0006809747,0.003411662],"study_design_scores_gemma":[0.0000166805,0.00002611053,0.0004899804,0.00001125885,0.00000435209,0.0001155726,0.0001295777,0.1402037,0.001083904,0.857097,0.0008057867,0.00001615407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8778523,0.0004792263,0.09933084,0.0008093699,0.00009190453,0.00002984321,0.00006568435,0.0001807978,0.02116022],"genre_scores_gemma":[0.9911629,0.0001611251,0.006545927,0.00005891438,0.00004725315,0.00002100976,0.00003169255,0.0000237351,0.00194741],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002388363,"threshold_uncertainty_score":0.007989883,"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","authors":[{"name":"E J Janse van Rensburg","is_ca":true},{"name":"Andrew Rechnitzer","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007996663,0.0004766299,0.0007259197,0.001139387,0.00104073,0.001209145,0.001134474,0.001322435,0.004721546],"category_scores_gemma":[0.001783964,0.0002852102,0.0008426681,0.000632152,0.001763936,0.002378389,0.0008512448,0.0007703757,0.0004085777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001128134,"about_ca_system_score_gemma":0.0006757949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001425784,"about_ca_topic_score_gemma":0.001063986,"domain_scores_codex":[0.9995858,0.000105738,0.00001393441,0.0000418309,0.0001373533,0.0001153241],"domain_scores_gemma":[0.9994926,0.0001983957,0.0001027969,0.00007368853,0.00004683432,0.00008565172],"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.00002324704,0.00002492994,0.0001540597,0.00001611255,0.000003747436,0.00009205323,0.00007601699,0.00836435,0.001566252,0.9881175,0.0002423192,0.001319479],"study_design_scores_gemma":[0.00003869662,0.00003475962,0.000372035,0.000005992054,0.000003714396,0.0001570785,0.00006501872,0.1079966,0.001020352,0.8897014,0.0005866185,0.00001778808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8565757,0.0003591819,0.1088485,0.0009294045,0.00008274809,0.00009173952,0.000131609,0.0002166552,0.03276461],"genre_scores_gemma":[0.9828867,0.0001667521,0.008521349,0.0001072222,0.00005094326,0.00008764002,0.00008626352,0.00005157007,0.008041611],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004721546,"threshold_uncertainty_score":0.01579517,"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","authors":[{"name":"Andrew Droll","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003594535,0.0003981685,0.0003438452,0.002111887,0.001349443,0.001764282,0.0007294606,0.0007543162,0.004089295],"category_scores_gemma":[0.001671327,0.0002966382,0.0003932189,0.001544869,0.001422791,0.001586612,0.000800259,0.0008267364,0.0005496534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007624425,"about_ca_system_score_gemma":0.0005309659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001494891,"about_ca_topic_score_gemma":0.001737848,"domain_scores_codex":[0.9994559,0.0001044133,0.0000308264,0.0001168482,0.000167915,0.0001241072],"domain_scores_gemma":[0.9989837,0.0003625197,0.0001388425,0.0001486325,0.0002148431,0.0001514962],"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.0000227725,0.00002228277,0.0007768985,0.00003927698,0.000007631964,0.0001198356,0.0002017009,0.001469597,0.002171593,0.9775001,0.002382245,0.01528611],"study_design_scores_gemma":[0.00001794332,0.00003011226,0.001258195,0.00003268574,0.00001531809,0.0005952581,0.0002567534,0.02478536,0.001618271,0.9576268,0.01373454,0.00002881246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7076442,0.003489129,0.116009,0.001275313,0.0003012844,0.0001516641,0.000601644,0.0005290863,0.1699986],"genre_scores_gemma":[0.9641917,0.001251566,0.0205384,0.0003681739,0.0001916915,0.00009760764,0.0007103196,0.00007179285,0.01257866],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004089295,"threshold_uncertainty_score":0.01368004,"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","authors":[{"name":"Philippe Flajolet","is_ca":false},{"name":"Éric Fusy","is_ca":false},{"name":"Xavier Gourdon","is_ca":false},{"name":"Daniel Panario","is_ca":true},{"name":"Nicolas Pouyanne","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00219593,0.0009325974,0.001499962,0.005715086,0.0008475762,0.001960607,0.001987426,0.001008763,0.004145076],"category_scores_gemma":[0.004549551,0.0005217696,0.00154382,0.001802151,0.002236863,0.002466058,0.002596763,0.002207379,0.001976452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007407816,"about_ca_system_score_gemma":0.0005995387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007218396,"about_ca_topic_score_gemma":0.0007247343,"domain_scores_codex":[0.9989208,0.0004976802,0.00004319615,0.0001117383,0.0003601003,0.00006643352],"domain_scores_gemma":[0.9985833,0.0006795392,0.0000694583,0.0002922653,0.0002566689,0.0001189031],"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.00003866001,0.00006029461,0.0003985559,0.0001635474,0.00004318194,0.0001636219,0.0002891942,0.008310192,0.005809732,0.8672743,0.002555352,0.1148934],"study_design_scores_gemma":[0.00004014981,0.00009880307,0.0004538466,0.00006121555,0.0000273799,0.0005602614,0.00008630677,0.324843,0.004648809,0.6461929,0.02288961,0.00009773676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005175518,0.0002541661,0.9868971,0.0001440341,0.0001247973,0.00004197945,0.00003041299,0.0003102264,0.007021779],"genre_scores_gemma":[0.1398299,0.0009103692,0.8419471,0.0002854146,0.0005167067,0.0003032329,0.0001293029,0.0006907373,0.01538725],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005715086,"threshold_uncertainty_score":0.01386672,"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","authors":[{"name":"Jeffrey H. Dinitz","is_ca":false},{"name":"Peter J. Dukes","is_ca":true},{"name":"Douglas R. Stinson","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00114901,0.0007671144,0.0006262252,0.0007692406,0.001968419,0.001215521,0.0007109159,0.0004936515,0.007291045],"category_scores_gemma":[0.00323115,0.0005165774,0.001116423,0.0006098502,0.002460189,0.004511765,0.001560819,0.001755402,0.0009476854],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009611841,"about_ca_system_score_gemma":0.0008429262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002446639,"about_ca_topic_score_gemma":0.003470529,"domain_scores_codex":[0.9983878,0.0002417459,0.0001070489,0.0006438423,0.0003090724,0.0003105829],"domain_scores_gemma":[0.9967793,0.0008360347,0.0004749842,0.000957111,0.0005529002,0.00039973],"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.0001775858,0.00004328051,0.0006702385,0.0001178093,0.00001412623,0.0002253175,0.0005228755,0.005121406,0.004602483,0.9627639,0.002010068,0.02373091],"study_design_scores_gemma":[0.00003675742,0.0002123243,0.0008618526,0.00007023695,0.00002807039,0.0006802455,0.0003182839,0.01690061,0.005808552,0.9488652,0.02616278,0.00005511084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2631846,0.00143705,0.6620816,0.0006471637,0.0003568519,0.0002279501,0.001019708,0.0004358322,0.07060921],"genre_scores_gemma":[0.7233858,0.0009617009,0.2516498,0.0003921353,0.0002759616,0.000170129,0.001232002,0.0001490811,0.02178345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007291045,"threshold_uncertainty_score":0.024391,"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","authors":[{"name":"Pierre Leroux","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001250337,0.0004768887,0.0009562324,0.002831921,0.001584799,0.001967615,0.00165492,0.001786206,0.005352245],"category_scores_gemma":[0.005523319,0.0003574326,0.001136663,0.001849863,0.00302815,0.005075037,0.001567501,0.002025626,0.0004671782],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002565313,"about_ca_system_score_gemma":0.0008733065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00134111,"about_ca_topic_score_gemma":0.001339881,"domain_scores_codex":[0.999494,0.0001523565,0.0000295989,0.00008965506,0.0001430835,0.00009137228],"domain_scores_gemma":[0.9985449,0.0009472279,0.0001072189,0.0001575527,0.0001531403,0.00008987112],"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.000004883295,0.000005603438,0.0001049497,0.00002715029,0.000003356288,0.00001527714,0.00006019077,0.002555524,0.0001776187,0.9937657,0.0006576001,0.002622108],"study_design_scores_gemma":[0.00000403944,0.00000363398,0.00007007829,0.000009734164,0.000002482821,0.00002768685,0.00002639648,0.02111387,0.0001752674,0.9773071,0.001254621,0.000005123863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2526055,0.004221048,0.6548346,0.006459185,0.0003692143,0.0001633084,0.0006158674,0.0004647138,0.08026667],"genre_scores_gemma":[0.7714905,0.002234157,0.1942075,0.001091723,0.0007689199,0.0003261346,0.0005267636,0.000257006,0.02909718],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005352245,"threshold_uncertainty_score":0.01861268,"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","authors":[{"name":"André Kündgen","is_ca":true},{"name":"Eric Mendelsohn","is_ca":true},{"name":"Vitaly Voloshin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003301556,0.0005764966,0.0003793802,0.001488848,0.0008625559,0.002132636,0.0007652282,0.0006886793,0.006544425],"category_scores_gemma":[0.002108075,0.0005702464,0.0005987934,0.001682368,0.001149688,0.003060652,0.002165163,0.001116107,0.0007411432],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00160571,"about_ca_system_score_gemma":0.0004429574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002575467,"about_ca_topic_score_gemma":0.003060456,"domain_scores_codex":[0.9993457,0.0001337902,0.00002979689,0.000193267,0.0001497277,0.0001476586],"domain_scores_gemma":[0.9988085,0.0005153902,0.0001685373,0.0001858956,0.0001695091,0.0001521471],"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.0003925338,0.0000827098,0.003778146,0.0003302502,0.00008233991,0.0003264642,0.0007960958,0.03702151,0.02914138,0.8554317,0.004510934,0.06810599],"study_design_scores_gemma":[0.0000544806,0.00007388714,0.002738978,0.00007694236,0.00007751543,0.0006260523,0.000518075,0.1095361,0.01044907,0.8564368,0.01936146,0.00005063188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6358649,0.000754456,0.308637,0.000731262,0.00006337011,0.0001094066,0.001173302,0.0008224594,0.05184379],"genre_scores_gemma":[0.8988758,0.0006022772,0.08534126,0.0002632343,0.0000624502,0.0001008963,0.001265147,0.0002197761,0.01326919],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006544425,"threshold_uncertainty_score":0.02189326,"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","authors":[{"name":"Geoffrey Grimmett","is_ca":false},{"name":"Svante Janson","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003199043,0.0003451291,0.0003909475,0.0007457191,0.0005513132,0.000578886,0.0007538465,0.0005645945,0.00285028],"category_scores_gemma":[0.002177764,0.0001960123,0.0003535326,0.0004134296,0.001091123,0.00117711,0.0007157752,0.0005513369,0.0001915085],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006502461,"about_ca_system_score_gemma":0.0003227108,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001643155,"about_ca_topic_score_gemma":0.001918975,"domain_scores_codex":[0.9997424,0.00009917579,0.000005423882,0.00005358169,0.000043351,0.00005588814],"domain_scores_gemma":[0.9991947,0.0003484001,0.000145156,0.0001048188,0.00006219377,0.0001447137],"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.00005849534,0.00002560541,0.001452467,0.00005671661,0.00002452411,0.0003444664,0.0001338417,0.03937031,0.003696471,0.9484234,0.001409653,0.005004077],"study_design_scores_gemma":[0.00003600246,0.00004077085,0.001514836,0.00001710532,0.0000182944,0.0003032974,0.0001432301,0.270379,0.001712551,0.7219737,0.003836346,0.00002485512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7782111,0.000562011,0.1946981,0.001133993,0.00007200665,0.00007018759,0.000280732,0.0002383066,0.02473366],"genre_scores_gemma":[0.982226,0.0001908439,0.01217414,0.000188054,0.0000384185,0.00005213051,0.0002021285,0.00005607752,0.0048722],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00285028,"threshold_uncertainty_score":0.009535193,"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","authors":[{"name":"Robert J. MacG. Dawson","is_ca":true},{"name":"Blair Doyle","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002535774,0.0002218572,0.0003491103,0.0004681984,0.0009942704,0.0008615908,0.0003881051,0.0003472494,0.00463749],"category_scores_gemma":[0.0008051329,0.0002265551,0.000564385,0.0002876483,0.001219473,0.001135085,0.0007753363,0.00058228,0.0005659811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005784671,"about_ca_system_score_gemma":0.0002057864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001933678,"about_ca_topic_score_gemma":0.001660548,"domain_scores_codex":[0.9997018,0.0000534055,0.00002169285,0.0000641003,0.00007741379,0.00008157211],"domain_scores_gemma":[0.9995885,0.00009849748,0.00005024765,0.0001245441,0.00007094838,0.00006720795],"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.0000944908,0.000009726677,0.0006798665,0.00004472548,0.000006913659,0.000258799,0.0005986847,0.006895219,0.01066268,0.9645581,0.001637715,0.014553],"study_design_scores_gemma":[0.00004395481,0.00008265716,0.001713057,0.00003935979,0.00001782471,0.000746016,0.0005225234,0.02951187,0.009569316,0.9241975,0.0335085,0.00004753945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7137063,0.0006139452,0.1541707,0.0003179922,0.0001676494,0.00004161165,0.0003092726,0.0003034022,0.1303692],"genre_scores_gemma":[0.9621763,0.0003145013,0.02390203,0.0001020869,0.00006574537,0.00002831905,0.0003242769,0.0001283075,0.01295854],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00463749,"threshold_uncertainty_score":0.0155139,"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","authors":[{"name":"Peter Horák","is_ca":false},{"name":"Alexander Rosa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001748333,0.0007593022,0.001139057,0.0007994549,0.005340469,0.002702309,0.00157151,0.005260131,0.01013377],"category_scores_gemma":[0.01041709,0.0007002485,0.001157447,0.00181664,0.004624538,0.008122519,0.003637752,0.00676644,0.00188074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002608794,"about_ca_system_score_gemma":0.001640508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004021594,"about_ca_topic_score_gemma":0.002489574,"domain_scores_codex":[0.9985105,0.0006826183,0.00003915914,0.0003364738,0.0002032227,0.0002279879],"domain_scores_gemma":[0.9970348,0.002209679,0.0001298336,0.0001760765,0.0001765793,0.0002730745],"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.00008957346,0.00005334997,0.0001719139,0.0001356681,0.00001388632,0.0001721642,0.0004853558,0.003870987,0.0003173917,0.9271991,0.0539488,0.01354175],"study_design_scores_gemma":[0.00006608076,0.00004145242,0.0001620535,0.00008317334,0.0000136363,0.0001534286,0.00033937,0.008127105,0.0003882501,0.9133708,0.07722566,0.00002891462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.08703065,0.01743099,0.2600804,0.3258221,0.009530995,0.0002795311,0.0007376027,0.0005351074,0.2985527],"genre_scores_gemma":[0.6633484,0.01526033,0.1513039,0.02358775,0.009893518,0.0004851612,0.0009201844,0.0005415023,0.1346592],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01013377,"threshold_uncertainty_score":0.03390086,"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","authors":[{"name":"Frank Ruskey","is_ca":true},{"name":"Joe Sawada","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101016,0.0002582663,0.0002558388,0.0007051065,0.0007059661,0.0008877098,0.0003786904,0.0004360338,0.003019687],"category_scores_gemma":[0.0009509284,0.0003769152,0.0003081659,0.0007387727,0.0008098844,0.0008752813,0.001124769,0.0004277699,0.0003589525],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007607964,"about_ca_system_score_gemma":0.0004250811,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003540854,"about_ca_topic_score_gemma":0.004838537,"domain_scores_codex":[0.9997959,0.00003201316,0.00001891233,0.00004518154,0.00004211447,0.00006591107],"domain_scores_gemma":[0.9995164,0.0001150702,0.0001195413,0.00006454752,0.00006669779,0.0001177818],"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.0002646932,0.00005457557,0.005574693,0.0002208538,0.0000427963,0.001449495,0.000880582,0.03251496,0.02487264,0.8904313,0.004395197,0.03929836],"study_design_scores_gemma":[0.00007555309,0.00007603392,0.003023701,0.0000385381,0.00003359943,0.0008582333,0.0006449856,0.08093999,0.00837961,0.8872023,0.01866383,0.00006357465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8857774,0.0004407259,0.08023239,0.0003635675,0.00005899243,0.00008480534,0.0005397271,0.00029203,0.03221031],"genre_scores_gemma":[0.9663063,0.0003591624,0.02720549,0.0001271886,0.00001619766,0.0001070213,0.0005174452,0.00003925159,0.005321919],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003540854,"threshold_uncertainty_score":0.01010185,"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","authors":[{"name":"Matthew H. J. Fiset","is_ca":true},{"name":"Alexander Kasprzyk","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007436069,0.0006044115,0.0004798524,0.001306424,0.001160505,0.001939902,0.0006601262,0.0006483779,0.009047634],"category_scores_gemma":[0.002179929,0.0003351941,0.0005552682,0.001088483,0.002371994,0.002649653,0.001534368,0.002836399,0.00107194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000577446,"about_ca_system_score_gemma":0.0002866551,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006892935,"about_ca_topic_score_gemma":0.0006600322,"domain_scores_codex":[0.9995912,0.00009707466,0.00002524505,0.00007911323,0.0001267567,0.00008059762],"domain_scores_gemma":[0.999198,0.000430567,0.00009869937,0.00006549763,0.0001036652,0.000103549],"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.00002039175,0.0000115508,0.0002367594,0.00003466102,0.000002771886,0.0001224837,0.0001561393,0.0005867137,0.0008618307,0.9890877,0.0009848956,0.007894083],"study_design_scores_gemma":[0.00001992584,0.0001068114,0.0005962267,0.00002819583,0.000008657484,0.0003742179,0.0003439531,0.005517249,0.002378278,0.9731594,0.01743648,0.0000306015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3905851,0.004154387,0.2999111,0.003629796,0.0007323773,0.0001212193,0.0005450944,0.0004304468,0.2998905],"genre_scores_gemma":[0.9145964,0.002522985,0.05655714,0.0004794333,0.0004819784,0.00009607729,0.0003138267,0.0001203863,0.02483171],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009047634,"threshold_uncertainty_score":0.03026736,"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","authors":[{"name":"Terry I. Visentin","is_ca":true},{"name":"Susana Wieler","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001188127,0.0003834279,0.0005082837,0.003615434,0.00120556,0.001927222,0.0009597807,0.0009983006,0.003862046],"category_scores_gemma":[0.007916675,0.0004409949,0.0003226004,0.001083307,0.003833718,0.003279812,0.001300929,0.0009293354,0.0003386156],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009600725,"about_ca_system_score_gemma":0.0002264573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005338722,"about_ca_topic_score_gemma":0.0004895787,"domain_scores_codex":[0.999597,0.0001044305,0.00001347674,0.00009790782,0.00008742425,0.00009971575],"domain_scores_gemma":[0.9954429,0.00292772,0.0006415203,0.0002734153,0.000269698,0.0004447743],"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.0002913931,0.00006012944,0.01503034,0.0001242267,0.00002424334,0.0007344758,0.001222784,0.02112892,0.01569184,0.91868,0.003897525,0.02311415],"study_design_scores_gemma":[0.00007253217,0.00008821899,0.02555266,0.0001156216,0.00004035033,0.001730673,0.001001515,0.1673884,0.00866681,0.7909108,0.004316097,0.0001163232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9626803,0.0005140423,0.01942092,0.001186325,0.00007091382,0.00001078325,0.000102015,0.0001659251,0.01584889],"genre_scores_gemma":[0.9958181,0.0003309607,0.002097615,0.00006969926,0.00007904674,0.00001719186,0.00008550602,0.00006550887,0.001436441],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003862046,"threshold_uncertainty_score":0.01291984,"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","authors":[{"name":"R.P. Anstee","is_ca":true},{"name":"Ron Ferguson","is_ca":true},{"name":"Attila Sali","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007503476,0.0006515433,0.0007951099,0.001462889,0.002510009,0.002250903,0.002056801,0.001018043,0.01802174],"category_scores_gemma":[0.008156927,0.0006454813,0.0006986959,0.001337993,0.002257164,0.003999439,0.002533369,0.002644341,0.001668021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00109736,"about_ca_system_score_gemma":0.0007997737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001195801,"about_ca_topic_score_gemma":0.002169404,"domain_scores_codex":[0.9982413,0.0004520166,0.00007129816,0.0004271147,0.0004298726,0.0003785012],"domain_scores_gemma":[0.9930118,0.003841853,0.0005533157,0.001275565,0.000653999,0.0006635195],"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.0004600192,0.0001967077,0.003454069,0.0002923007,0.00005643274,0.001013046,0.0006026358,0.02983797,0.01153529,0.8873428,0.009697967,0.05551067],"study_design_scores_gemma":[0.00006302165,0.0001750346,0.001100438,0.00008364704,0.00003509751,0.001436693,0.0003558092,0.06310117,0.00818334,0.9073345,0.0180626,0.0000686693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.374833,0.001720432,0.4725324,0.001348617,0.0005771095,0.0002237269,0.0006327256,0.001363373,0.1467686],"genre_scores_gemma":[0.9258058,0.0005119119,0.058106,0.0004345738,0.0001372228,0.0002428074,0.0005621422,0.0003227523,0.01387679],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01802174,"threshold_uncertainty_score":0.06028873,"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","authors":[{"name":"Joseph D. Novak","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001379209,0.0002955161,0.0006240957,0.001205045,0.000749555,0.001622884,0.0009740057,0.0007695144,0.003912898],"category_scores_gemma":[0.008083371,0.0004106768,0.0005423364,0.000623295,0.001985327,0.002503575,0.001067564,0.0009523328,0.0006026407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001245019,"about_ca_system_score_gemma":0.0004637451,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007264279,"about_ca_topic_score_gemma":0.001122031,"domain_scores_codex":[0.9991615,0.0002312448,0.000043051,0.0001525769,0.0002470341,0.0001646891],"domain_scores_gemma":[0.9971842,0.001319417,0.0003883879,0.0004511579,0.0003271197,0.0003297385],"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.00004175592,0.00001285166,0.0003896446,0.00002077968,0.0000056707,0.0001059117,0.0001023642,0.007267619,0.002346155,0.986005,0.0005742596,0.003128026],"study_design_scores_gemma":[0.00002473495,0.00004576652,0.000921037,0.00002807696,0.000007453785,0.0002241273,0.00007847149,0.1894077,0.002761663,0.8050604,0.001396821,0.00004376043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6923054,0.000602512,0.2824342,0.0005963754,0.0001451245,0.00007372376,0.0002840691,0.0004284283,0.02313028],"genre_scores_gemma":[0.9675803,0.0002377031,0.02219035,0.0001826002,0.00009391031,0.0000919607,0.0001914386,0.0001090108,0.009322741],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003912898,"threshold_uncertainty_score":0.01308995,"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","authors":[{"name":"Frank Van Bussel","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00176482,0.0006773749,0.0007784483,0.00119479,0.001637392,0.002435329,0.001784502,0.00116698,0.003882491],"category_scores_gemma":[0.01047574,0.0006701474,0.001157018,0.001592557,0.002397487,0.005455918,0.002919783,0.002440353,0.0006388909],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001634976,"about_ca_system_score_gemma":0.000676634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00237467,"about_ca_topic_score_gemma":0.002944492,"domain_scores_codex":[0.9973661,0.0007183994,0.0001876475,0.0006790659,0.0005703163,0.0004784378],"domain_scores_gemma":[0.9916855,0.003390115,0.0009723848,0.002533291,0.0006540313,0.0007648209],"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.000531366,0.00007888151,0.002174872,0.0001990421,0.00004348866,0.0002281111,0.001509746,0.06871396,0.01103618,0.8572167,0.004606127,0.05366164],"study_design_scores_gemma":[0.00003082847,0.00009187641,0.0008468504,0.00004387069,0.00003291649,0.0001921441,0.0002806135,0.08108331,0.004372713,0.9035863,0.009391618,0.0000469896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4737597,0.00108269,0.4901664,0.001249355,0.000122763,0.0001522444,0.001556769,0.001206335,0.03070385],"genre_scores_gemma":[0.8351345,0.0006032467,0.1515081,0.000400652,0.0001328233,0.0001820516,0.001629209,0.0003530909,0.01005634],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003882491,"threshold_uncertainty_score":0.01298827,"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","authors":[{"name":"Jean-François Fortin","is_ca":true},{"name":"P. Jacob","is_ca":true},{"name":"Pierre Mathieu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008350382,0.0005550975,0.0006372277,0.001698178,0.001502055,0.001874046,0.001334057,0.0007328801,0.005451358],"category_scores_gemma":[0.003025363,0.000380307,0.0008592129,0.001099025,0.002023789,0.002930845,0.0019737,0.001568516,0.001280694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001016133,"about_ca_system_score_gemma":0.0004888251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004550423,"about_ca_topic_score_gemma":0.0006112436,"domain_scores_codex":[0.9993049,0.0001393876,0.00004581813,0.0001434555,0.0001930432,0.0001734043],"domain_scores_gemma":[0.9987657,0.0004645149,0.0002050745,0.0001980961,0.0001839779,0.0001826738],"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.00003274698,0.00001881852,0.0003320152,0.0000335117,0.000004783956,0.0001657925,0.0002239276,0.001795282,0.002399447,0.9881721,0.0006367138,0.006184801],"study_design_scores_gemma":[0.00002371823,0.00004327523,0.0005653315,0.00002567428,0.00001662814,0.0006500727,0.00009266425,0.02313191,0.004780911,0.9635687,0.007053166,0.00004789867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.66967,0.0005300018,0.2442783,0.0008420852,0.0003188959,0.0001137482,0.000316876,0.0003455797,0.08358448],"genre_scores_gemma":[0.9469753,0.00028386,0.03399786,0.0001950331,0.0002519789,0.0001726163,0.000291571,0.0001452663,0.01768649],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005451358,"threshold_uncertainty_score":0.01823658,"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","authors":[{"name":"Alessandro De Luca","is_ca":true},{"name":"Christophe Reutenauer","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004606626,0.0002983169,0.0003572002,0.001819244,0.001703145,0.001752183,0.0004872931,0.0006893287,0.005626596],"category_scores_gemma":[0.001565155,0.000192226,0.0003377692,0.001367253,0.002349138,0.004434249,0.0009497105,0.00121916,0.0008184919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001149328,"about_ca_system_score_gemma":0.0004887187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009355689,"about_ca_topic_score_gemma":0.0008186256,"domain_scores_codex":[0.9996108,0.00005180702,0.00001700608,0.00008124157,0.0001324886,0.0001066077],"domain_scores_gemma":[0.9993074,0.000302073,0.0001060091,0.00005987932,0.0001151486,0.0001094234],"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.000008293108,0.000003885575,0.00007590161,0.00001089715,0.000001026567,0.00004799951,0.0001531222,0.0002004184,0.0004179682,0.9963189,0.0002963054,0.002465214],"study_design_scores_gemma":[0.000005283404,0.00001131068,0.0002485402,0.00000979336,0.00000354003,0.000143522,0.0001503152,0.001316732,0.0007391271,0.9899401,0.0074194,0.00001233037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6585802,0.003578289,0.169973,0.001941677,0.0004375674,0.00004961292,0.0004097054,0.0003751042,0.1646548],"genre_scores_gemma":[0.9679593,0.0009474921,0.01504915,0.0002332591,0.0003172935,0.00003240143,0.0001413055,0.00007021693,0.01524961],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005626596,"threshold_uncertainty_score":0.01882279,"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","authors":[{"name":"Daniel Kobler","is_ca":true},{"name":"André Kündgen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004322364,0.0005404323,0.0005675347,0.001898169,0.001491333,0.002524125,0.0009022554,0.0007164348,0.005631784],"category_scores_gemma":[0.002429075,0.0004827834,0.0003978913,0.00151939,0.001483159,0.002030213,0.001371017,0.0009039234,0.0005257675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001585261,"about_ca_system_score_gemma":0.0006930818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004305328,"about_ca_topic_score_gemma":0.003084268,"domain_scores_codex":[0.9993007,0.00008143151,0.00002995267,0.0001429627,0.0001737616,0.000271206],"domain_scores_gemma":[0.9984367,0.0006535199,0.0002830859,0.0001819161,0.00015944,0.0002853048],"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.001560942,0.000367446,0.01310227,0.0002202874,0.00008076776,0.001032982,0.002155259,0.06803866,0.04386243,0.8086613,0.01175243,0.04916525],"study_design_scores_gemma":[0.000199387,0.000183063,0.009417188,0.0000872654,0.000060795,0.001244807,0.00157692,0.1960183,0.01241301,0.7677577,0.01095544,0.00008614777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9582565,0.0002519368,0.02409688,0.0003010967,0.00002014127,0.00002923027,0.0005178306,0.0002293814,0.0162971],"genre_scores_gemma":[0.9885212,0.0001906535,0.009003798,0.00007203862,0.00002239475,0.00006660393,0.0005156613,0.0000645356,0.001543074],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005631784,"threshold_uncertainty_score":0.01884013,"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","authors":[{"name":"Thomas Lam","is_ca":false},{"name":"Jacques Verstraëte","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008783771,0.001177494,0.0008962033,0.000936434,0.002256892,0.00203484,0.001774999,0.001028641,0.009056145],"category_scores_gemma":[0.007501157,0.000545227,0.0008539176,0.001688787,0.002526965,0.01276381,0.002653019,0.006497861,0.002891009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001621497,"about_ca_system_score_gemma":0.000764462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004529704,"about_ca_topic_score_gemma":0.005511553,"domain_scores_codex":[0.9990811,0.0002417307,0.00003833755,0.0002423299,0.0002097927,0.00018666],"domain_scores_gemma":[0.9927729,0.004909939,0.0002518182,0.001027502,0.000571031,0.0004668712],"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.0003754539,0.0001184082,0.001872541,0.0008169229,0.00006717938,0.0008980823,0.0005938979,0.01082262,0.00943644,0.7203943,0.1613657,0.09323838],"study_design_scores_gemma":[0.00003885259,0.0001184491,0.001343054,0.0002040183,0.00007398705,0.0006234921,0.0003952319,0.00880636,0.004214739,0.7695243,0.214598,0.00005943888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1403904,0.06397723,0.2090914,0.1451864,0.03010673,0.0001976,0.001565225,0.002129026,0.407356],"genre_scores_gemma":[0.7023335,0.06651382,0.09691208,0.03742015,0.01708451,0.0002473266,0.00124423,0.001658442,0.07658604],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009056145,"threshold_uncertainty_score":0.03029585,"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","authors":[{"name":"Michael Albert","is_ca":true},{"name":"Richard J. Nowakowski","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001158313,0.0006601621,0.0005796382,0.0003880798,0.004205813,0.003728394,0.00158992,0.001846703,0.01698037],"category_scores_gemma":[0.003410903,0.0003389872,0.0007845953,0.0004194587,0.003736641,0.006200925,0.004146163,0.00219143,0.002628146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001487779,"about_ca_system_score_gemma":0.001126243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002552121,"about_ca_topic_score_gemma":0.004689446,"domain_scores_codex":[0.99835,0.0008647281,0.00004466622,0.0002247108,0.0002524877,0.0002633246],"domain_scores_gemma":[0.9993021,0.0002534362,0.00003667297,0.0001446245,0.00007967297,0.0001833344],"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.00006814825,0.00001627028,0.00009941227,0.00001951305,0.000005384827,0.00005004797,0.0003927715,0.0009558334,0.000256398,0.9896742,0.003859271,0.004602745],"study_design_scores_gemma":[0.00003476454,0.0000394928,0.0001501512,0.00003468469,0.000008938563,0.0001136997,0.000577758,0.01216965,0.0006273834,0.9089849,0.07723676,0.00002181522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.05560232,0.000467889,0.2469389,0.004546671,0.0005107788,0.0001805883,0.0003710984,0.0006927823,0.6906888],"genre_scores_gemma":[0.7984808,0.0002679606,0.07957187,0.001396717,0.000124612,0.000331426,0.0003243465,0.0002482036,0.1192541],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01698037,"threshold_uncertainty_score":0.05680501,"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","authors":[{"name":"Claude Laflamme","is_ca":true},{"name":"Lionel Nguyen Van Thé","is_ca":true},{"name":"N. Sauer","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009983225,0.0002848893,0.000422906,0.001319382,0.001152566,0.001815888,0.0008601631,0.000600417,0.003393132],"category_scores_gemma":[0.004108238,0.0003127935,0.000508096,0.0007779374,0.002463473,0.003120843,0.001697577,0.0009157499,0.0002539091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001718133,"about_ca_system_score_gemma":0.0005367156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007262349,"about_ca_topic_score_gemma":0.0008754235,"domain_scores_codex":[0.9991881,0.000157734,0.00005169787,0.000269011,0.0001722703,0.0001611985],"domain_scores_gemma":[0.9940706,0.003726468,0.0006293851,0.0009015582,0.0002052199,0.0004667853],"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.0004271636,0.00008133666,0.01416825,0.000114816,0.00003675747,0.0002623857,0.0007359,0.01636761,0.01127836,0.9337434,0.001995217,0.02078881],"study_design_scores_gemma":[0.00005639956,0.00007064031,0.00457195,0.0000159768,0.0000533217,0.0003482245,0.0001942106,0.05007834,0.01431605,0.9260275,0.004226503,0.00004084197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9614606,0.0001218131,0.02470025,0.0004823299,0.00001273123,0.00001811268,0.0004433338,0.000211038,0.01254983],"genre_scores_gemma":[0.9915615,0.00005133762,0.006821803,0.00003868174,0.00001436241,0.00001585858,0.0002770261,0.0000196599,0.00119975],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003393132,"threshold_uncertainty_score":0.01246601,"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","authors":[{"name":"Edward Dobson","is_ca":true},{"name":"Joy Morris","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005008796,0.0004059304,0.0003112247,0.001212555,0.0008152482,0.001055151,0.0006081707,0.000396713,0.003330861],"category_scores_gemma":[0.001472559,0.0003405728,0.0007269016,0.0005509914,0.001606414,0.001901755,0.001748535,0.0009148185,0.0006145742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005756047,"about_ca_system_score_gemma":0.0003240609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006086621,"about_ca_topic_score_gemma":0.0005120634,"domain_scores_codex":[0.9993956,0.0001081085,0.00003810114,0.0002055882,0.0001324018,0.0001202486],"domain_scores_gemma":[0.9988512,0.0003274772,0.0002022524,0.0002957337,0.0001513914,0.0001719641],"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.00006250122,0.00004008655,0.001162976,0.00003806802,0.00001480217,0.0003596968,0.000775884,0.002904805,0.007177226,0.9719863,0.0003975253,0.01508025],"study_design_scores_gemma":[0.00003533527,0.0001009723,0.001104495,0.00001674822,0.00002393555,0.000445984,0.0002354868,0.01513498,0.009875746,0.9618765,0.01112371,0.00002624743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8290693,0.0002044945,0.129229,0.0002500413,0.0000820339,0.00007477569,0.000171711,0.0003676813,0.04055099],"genre_scores_gemma":[0.9651306,0.0002032701,0.01973708,0.0001047249,0.00007556606,0.00006005211,0.0003629519,0.000074165,0.01425156],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003330861,"threshold_uncertainty_score":0.01114285,"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","authors":[{"name":"Brad Jackson","is_ca":true},{"name":"Frank Ruskey","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003679952,0.0003771506,0.0003233055,0.001215129,0.000686883,0.0009273651,0.0005377721,0.0007108329,0.001880154],"category_scores_gemma":[0.002461394,0.0001753519,0.0002902643,0.0007581934,0.0009846973,0.001418673,0.0004973495,0.0006152487,0.000304611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006205131,"about_ca_system_score_gemma":0.0002110339,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003747349,"about_ca_topic_score_gemma":0.0004976547,"domain_scores_codex":[0.9998072,0.00004032726,0.00001209967,0.00003556575,0.00007111504,0.00003369813],"domain_scores_gemma":[0.9991553,0.0004396322,0.00017221,0.00006442668,0.0000924621,0.00007603157],"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.00003172215,0.00001254643,0.0008508496,0.00004953921,0.000004911609,0.0002723061,0.0001981109,0.007193341,0.004066166,0.9787657,0.0003185978,0.008236217],"study_design_scores_gemma":[0.000009576797,0.00003328221,0.0007072487,0.00004002788,0.000007947276,0.0006723195,0.0001574162,0.05482479,0.003052285,0.9373748,0.0030999,0.00002034621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6944447,0.002870346,0.268674,0.0005061092,0.0001034833,0.00003869499,0.0002535223,0.0001735357,0.03293567],"genre_scores_gemma":[0.9589198,0.0008933039,0.03523249,0.00009214701,0.00009123986,0.00005661506,0.0001464684,0.00003020138,0.004537793],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.001880154,"threshold_uncertainty_score":0.006289721,"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","authors":[{"name":"Peter Hamburger","is_ca":false},{"name":"Penny Haxell","is_ca":true},{"name":"Alexandr Kostochka","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001072404,0.0008840266,0.00112231,0.002337178,0.001854381,0.002326404,0.0018056,0.001487341,0.01384224],"category_scores_gemma":[0.01220776,0.0007678589,0.001151579,0.003182707,0.002167376,0.006119262,0.003751719,0.002692467,0.002245487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001982354,"about_ca_system_score_gemma":0.0007175438,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004866198,"about_ca_topic_score_gemma":0.006539336,"domain_scores_codex":[0.9983359,0.0004687383,0.00008845338,0.0003861615,0.0004498875,0.0002709181],"domain_scores_gemma":[0.9901669,0.006592524,0.0006872726,0.001126788,0.0007488633,0.0006776651],"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.00009589486,0.00004391057,0.000899583,0.0001966012,0.00002016944,0.0003267377,0.0005379755,0.01416709,0.001508276,0.9506037,0.005584211,0.02601597],"study_design_scores_gemma":[0.00003519509,0.00002766647,0.0003166779,0.00005737077,0.00001689,0.0002103467,0.0001117236,0.04631187,0.0006035063,0.9397675,0.01252441,0.00001677122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2356681,0.002937314,0.5752477,0.002815247,0.0006461009,0.000261281,0.001267902,0.0009333473,0.1802231],"genre_scores_gemma":[0.7846181,0.004402093,0.1559241,0.001771151,0.000687276,0.0005176608,0.002878048,0.0005603202,0.04864127],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01384224,"threshold_uncertainty_score":0.04630685,"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","authors":[{"name":"Abraham Isgur","is_ca":true},{"name":"David Reiss","is_ca":true},{"name":"Stephen M. Tanny","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008249898,0.0005353678,0.0004587708,0.001933564,0.001383788,0.002169473,0.001046721,0.001523171,0.004347849],"category_scores_gemma":[0.005490282,0.0003120322,0.0006677274,0.002087455,0.00192164,0.003060472,0.0007588985,0.001540451,0.000852966],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002053941,"about_ca_system_score_gemma":0.0009066115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001438163,"about_ca_topic_score_gemma":0.003117405,"domain_scores_codex":[0.9994088,0.0001951034,0.00003080279,0.0001135065,0.0001331401,0.0001184616],"domain_scores_gemma":[0.9977581,0.001331397,0.0003642515,0.0001819672,0.0002292237,0.0001352215],"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.000009718566,0.000007677995,0.0004731746,0.00002345367,0.000003192762,0.0000463898,0.0001166426,0.003514766,0.0006813682,0.9883355,0.0006189007,0.00616926],"study_design_scores_gemma":[0.000004870556,0.000005773188,0.0002701424,0.00002009872,0.000003136631,0.0001307368,0.00007586219,0.03096591,0.0003642653,0.9656076,0.002541339,0.00001016415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4730758,0.002938974,0.4461922,0.002184846,0.0001644898,0.00008623737,0.0005136126,0.0005021202,0.07434171],"genre_scores_gemma":[0.8817705,0.0008627973,0.1034638,0.0005004951,0.0001459504,0.0001975968,0.0003390129,0.0001145209,0.01260536],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004347849,"threshold_uncertainty_score":0.01490247,"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","authors":[{"name":"Andrew Granville","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001581386,0.0004007547,0.0008484696,0.001839064,0.001255692,0.003037296,0.001261948,0.0007299418,0.003109583],"category_scores_gemma":[0.01221837,0.0005415172,0.0005634868,0.001905351,0.003581038,0.005435985,0.001644448,0.00147922,0.0005055939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001261208,"about_ca_system_score_gemma":0.0006244206,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004120044,"about_ca_topic_score_gemma":0.000346132,"domain_scores_codex":[0.9974689,0.0004138428,0.0001501316,0.0008471428,0.0008425567,0.0002772925],"domain_scores_gemma":[0.9910195,0.004675014,0.001552585,0.001431966,0.00087774,0.0004430995],"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.0001060713,0.00002651172,0.003545317,0.00009130304,0.00004072828,0.0001791581,0.0004183941,0.006424125,0.00439156,0.9645548,0.00201761,0.01820442],"study_design_scores_gemma":[0.00001446892,0.00002857629,0.001382252,0.00002234801,0.0000192125,0.0004707403,0.0001380935,0.02283961,0.002948732,0.9667034,0.005402,0.00003054535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6007503,0.0008903521,0.3590428,0.001472811,0.0001963203,0.00008061827,0.0006284269,0.0006232766,0.03631521],"genre_scores_gemma":[0.9726512,0.0007569905,0.01988021,0.0003538586,0.0003573089,0.0001861996,0.0003958884,0.0001505222,0.005267721],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003109583,"threshold_uncertainty_score":0.01040256,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009392963,0.0006377329,0.001552321,0.002434424,0.001393399,0.002889402,0.002560505,0.00184689,0.01318048],"category_scores_gemma":[0.07068551,0.0008045837,0.001086137,0.001080608,0.005163673,0.006378921,0.003014779,0.002772194,0.001686536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002332627,"about_ca_system_score_gemma":0.00131932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001577544,"about_ca_topic_score_gemma":0.001361299,"domain_scores_codex":[0.9949714,0.002318792,0.0001474272,0.0007812859,0.001121279,0.0006597399],"domain_scores_gemma":[0.946211,0.03919649,0.003531443,0.006048292,0.002883103,0.002129729],"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.0003605319,0.00008771434,0.004332446,0.0001635101,0.00007180472,0.0003159847,0.0005333446,0.02448517,0.002647495,0.9456745,0.006242129,0.01508527],"study_design_scores_gemma":[0.0001231794,0.0001460303,0.004337335,0.0001303085,0.00007921305,0.0008467982,0.0002380202,0.2810538,0.002681107,0.7071009,0.003141265,0.0001220866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.613179,0.002099253,0.2977345,0.005235901,0.0003494368,0.0002742766,0.0009248391,0.00168115,0.07852175],"genre_scores_gemma":[0.9701723,0.0006532099,0.01315064,0.0006138639,0.0004952913,0.0004733493,0.0007558862,0.0002752524,0.01341006],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01318048,"threshold_uncertainty_score":0.04967535,"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","authors":[{"name":"Noga Alon","is_ca":false},{"name":"Abbas Mehrabian","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004241766,0.001774407,0.003189167,0.001854755,0.003828757,0.00445569,0.005468572,0.004541121,0.01666745],"category_scores_gemma":[0.02765026,0.0009728919,0.002444323,0.002451651,0.007382744,0.01971895,0.006007589,0.006800545,0.002193891],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003192058,"about_ca_system_score_gemma":0.002099974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006286356,"about_ca_topic_score_gemma":0.004048081,"domain_scores_codex":[0.9962836,0.000934144,0.0001305938,0.001044113,0.0006604361,0.0009471162],"domain_scores_gemma":[0.9834898,0.01060578,0.0009329211,0.002592694,0.0008968521,0.001481933],"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.0001855293,0.00007109125,0.0004653933,0.0001020631,0.00003199286,0.0001472851,0.0003066122,0.01868225,0.0006926499,0.9595367,0.01218216,0.007596171],"study_design_scores_gemma":[0.00007220294,0.0000393573,0.000199098,0.00002803391,0.00001763552,0.00007999709,0.00008187643,0.04906676,0.000282393,0.9451319,0.004971537,0.00002919608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2744629,0.001299653,0.4526813,0.01705117,0.001172891,0.0004689636,0.001280155,0.0007762112,0.2508069],"genre_scores_gemma":[0.8814798,0.001622701,0.07003188,0.005233723,0.001307711,0.0008009825,0.001225017,0.0004901195,0.03780801],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01666745,"threshold_uncertainty_score":0.05575818,"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","authors":[{"name":"Ali Aberkane","is_ca":true},{"name":"James D. Currie","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003656319,0.0006399817,0.0004370064,0.0005474685,0.001869928,0.001687332,0.0006901796,0.00107192,0.01851542],"category_scores_gemma":[0.002050873,0.0005114234,0.0007420459,0.0006082829,0.001213667,0.003965051,0.002359691,0.00134908,0.003065879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005536458,"about_ca_system_score_gemma":0.0005186225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003788025,"about_ca_topic_score_gemma":0.0004397218,"domain_scores_codex":[0.9995346,0.00005616995,0.00002833273,0.0001204091,0.00009796082,0.0001625325],"domain_scores_gemma":[0.9982628,0.000886213,0.0002329368,0.0001577573,0.0002496174,0.0002106975],"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.0006948857,0.000145863,0.001868978,0.0004885005,0.00003445129,0.001220657,0.001241866,0.00149758,0.02874614,0.9149311,0.008077926,0.04105208],"study_design_scores_gemma":[0.0001270517,0.0002060388,0.001880835,0.0001278706,0.0001061562,0.001386172,0.0008079878,0.008902657,0.03743277,0.8895745,0.05936428,0.00008369634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6908141,0.001187312,0.1558477,0.002527077,0.0006240594,0.0001443646,0.0009547458,0.0009310499,0.1469696],"genre_scores_gemma":[0.8618891,0.0005869898,0.07189095,0.0008550508,0.0002341579,0.0003563794,0.001059063,0.0003260068,0.06280231],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01851542,"threshold_uncertainty_score":0.06194019,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}