{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":21,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":21,"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":"1caef02c2311","filters":{"venue":"Journal of Combinatorics"}},"results":[{"id":"W2963489061","doi":"10.4310/joc.2012.v3.n3.a4","title":"Higher trivariate diagonal harmonics via generalized Tamari posets","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":83,"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; Diagonal; Combinatorics; Pure mathematics; Discrete mathematics; Geometry","authors":[{"name":"François Bergeron","is_ca":true},{"name":"Louis-François Préville-Ratelle","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04701194548901836,"gpt":0.3067420525034614,"spread":0.259730107014443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003616283,0.000415166,0.0003584693,0.001393605,0.000727288,0.001808724,0.0004680592,0.0003526465,0.008512241],"category_scores_gemma":[0.0006266799,0.0002352365,0.000543177,0.0006390166,0.002135717,0.003171713,0.001890489,0.000860166,0.0007768229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005670278,"about_ca_system_score_gemma":0.0002748954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004831336,"about_ca_topic_score_gemma":0.0006919279,"domain_scores_codex":[0.9996883,0.00005326948,0.00001444881,0.00005980465,0.00008613109,0.00009814056],"domain_scores_gemma":[0.9996718,0.00006306666,0.00006573141,0.00003855335,0.00003762418,0.0001231321],"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.00002482664,0.00002486166,0.0003489351,0.00002030257,0.000006170381,0.0001946631,0.0003378901,0.0009811209,0.002423948,0.9901541,0.000335728,0.005147507],"study_design_scores_gemma":[0.00002740799,0.00008866261,0.001054864,0.00001348171,0.00001282007,0.0004402194,0.0004483434,0.008587625,0.003552702,0.9820237,0.003718124,0.00003214867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8879308,0.0002337753,0.05757178,0.000293268,0.0001047327,0.00004502793,0.0001082575,0.0002004642,0.05351205],"genre_scores_gemma":[0.9871974,0.0001534539,0.004341578,0.00007286414,0.00008817335,0.00002057553,0.00005659813,0.00003390857,0.008035569],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008512241,"threshold_uncertainty_score":0.02847624,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061413565","doi":"10.4310/joc.2012.v3.n2.a6","title":"Meyniel’s conjecture on the cop number: A survey","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":49,"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":"Mathematics; Conjecture; Combinatorics","authors":[{"name":"William Baird","is_ca":true},{"name":"Anthony Bonato","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09291930515307462,"gpt":0.3474541012453438,"spread":0.2545347960922692,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003075264,0.001006468,0.001961863,0.004624989,0.002393344,0.005557641,0.001986376,0.00297416,0.006963344],"category_scores_gemma":[0.01026993,0.001002374,0.0009014163,0.006796853,0.007163789,0.01843905,0.002922174,0.004524274,0.001806681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004492492,"about_ca_system_score_gemma":0.002071545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003474781,"about_ca_topic_score_gemma":0.001409718,"domain_scores_codex":[0.9982121,0.0002326026,0.0001116247,0.0007050736,0.0004790985,0.0002595028],"domain_scores_gemma":[0.9936013,0.004463285,0.0003129477,0.0004738207,0.0008320311,0.0003165557],"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.0000687321,0.00006814391,0.001500793,0.0007505763,0.00002869982,0.0001130518,0.0003356238,0.003143441,0.0004075727,0.8780615,0.01596816,0.09955363],"study_design_scores_gemma":[0.00002205514,0.00006359956,0.001176054,0.0003911332,0.00002267697,0.00037746,0.0004125194,0.005766827,0.0008679054,0.8467316,0.1440946,0.0000734296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.09276263,0.4208777,0.1179954,0.04550217,0.003663455,0.0001325554,0.00110547,0.0004037398,0.3175569],"genre_scores_gemma":[0.6384676,0.2746434,0.0349665,0.005920156,0.01059389,0.0002778417,0.00202017,0.0003829373,0.03272751],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.006963344,"threshold_uncertainty_score":0.03259546,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963917402","doi":"10.4310/joc.2012.v3.n3.a8","title":"Macdonald polynomials in superspace as eigenfunctions of commuting operators","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Nonlinear Waves and Solitons","field":"Physics and Astronomy","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"Fonds de recherche du Québec – Nature et technologies; Comisión Nacional de Investigación Científica y Tecnológica; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Pure mathematics; Conjecture; Eigenfunction; Symmetrization; Monomial; Macdonald polynomials; Symmetric function; Orthogonal polynomials; Invariant (physics); Combinatorics; Classical orthogonal polynomials; Eigenvalues and eigenvectors; Mathematical physics","authors":[{"name":"Olivier Blondeau-Fournier","is_ca":true},{"name":"Patrick Desrosiers","is_ca":false},{"name":"Luc Lapointe","is_ca":false},{"name":"Pierre Mathieu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0107569412653922,"gpt":0.2823427095537012,"spread":0.271585768288309,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001250217,0.0006208461,0.0005173528,0.00157241,0.001009897,0.002042066,0.0008911628,0.001039015,0.004365123],"category_scores_gemma":[0.00216593,0.0004417308,0.0009547762,0.001058987,0.003012583,0.003155777,0.001509203,0.001717156,0.000781883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001076857,"about_ca_system_score_gemma":0.001009387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008915543,"about_ca_topic_score_gemma":0.0009581192,"domain_scores_codex":[0.9990311,0.0002806614,0.00005435979,0.0001451492,0.0002843559,0.0002044589],"domain_scores_gemma":[0.9991209,0.000213561,0.0001739061,0.000167516,0.0001632873,0.0001608641],"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.00001434612,0.000008458376,0.00008586175,0.00001911642,0.000002892022,0.0001018815,0.0001560244,0.001163116,0.002255257,0.9938041,0.0003030866,0.002085897],"study_design_scores_gemma":[0.00001291402,0.00001680464,0.0001746461,0.00001425286,0.000003216506,0.000152882,0.00007900186,0.02432569,0.001042171,0.9725453,0.001615677,0.00001732026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5585926,0.001053406,0.3801636,0.001270758,0.000491859,0.0001110386,0.0002582802,0.0003213047,0.057737],"genre_scores_gemma":[0.9301416,0.0007117696,0.05169249,0.0003526392,0.00037171,0.0001147336,0.0001292081,0.0001658765,0.01631994],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004365123,"threshold_uncertainty_score":0.01460278,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2778252295","doi":"10.4310/joc.2019.v10.n3.a4","title":"Hypergraphic polytopes: combinatorial properties and antipode","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Polytope; Bijection; Hypergraph; Interpretation (philosophy); Combinatorics; Characterization (materials science); Mathematics; Hopf algebra; Simple (philosophy); Discrete mathematics; Algebra over a field; Pure mathematics; Computer science; Physics","authors":[{"name":"Carolina Benedetti","is_ca":false},{"name":"Nantel Bergeron","is_ca":true},{"name":"John Machacek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03985582976514396,"gpt":0.2668436785381555,"spread":0.2269878487730115,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002553682,0.0002571555,0.0002617288,0.001234369,0.0009323046,0.002178932,0.000302715,0.0003833375,0.006208876],"category_scores_gemma":[0.0009069666,0.0002808178,0.0003566118,0.0009301614,0.002127146,0.002284299,0.001033038,0.001041996,0.0005433505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005932692,"about_ca_system_score_gemma":0.0003272154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008196095,"about_ca_topic_score_gemma":0.00095158,"domain_scores_codex":[0.9996642,0.00004568941,0.00001925998,0.00007864702,0.0001148502,0.00007730686],"domain_scores_gemma":[0.9992549,0.0001873154,0.000143577,0.00009667574,0.0001456128,0.0001719944],"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.00002038647,0.00001316331,0.0006057268,0.00003849249,0.000004859356,0.0001723877,0.0001950194,0.0009646838,0.002729242,0.9861458,0.0005537489,0.008556521],"study_design_scores_gemma":[0.00001684066,0.000038412,0.002117858,0.00003709717,0.00001531241,0.0008048257,0.0005463443,0.008448252,0.005203015,0.9608549,0.02188198,0.00003531367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6348467,0.001285094,0.2384355,0.0007152634,0.0002535398,0.0001185966,0.0004256445,0.000184162,0.1237355],"genre_scores_gemma":[0.9525346,0.001066288,0.02723788,0.0001323676,0.0001988424,0.00008569797,0.0002474912,0.00007044034,0.01842648],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006208876,"threshold_uncertainty_score":0.02077073,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2519826203","doi":"10.4310/joc.2019.v10.n4.a1","title":"A proof of the 4-variable Catalan polynomial of the Delta conjecture","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Conjecture; Catalan; Combinatorics; Mathematics; Catalan number; Polynomial; Variable (mathematics); Nabla symbol; Physics; Mathematical analysis; Philosophy; Humanities; Quantum mechanics","authors":[{"name":"Mike Zabrocki","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02443802459285362,"gpt":0.2838160518107053,"spread":0.2593780272178517,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001418689,0.0009815791,0.000825781,0.001311545,0.001748094,0.001704792,0.001492958,0.0009871437,0.01268867],"category_scores_gemma":[0.005045079,0.0005762478,0.001213944,0.001669897,0.003779395,0.003414656,0.004695804,0.004501751,0.002154422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002123291,"about_ca_system_score_gemma":0.001601773,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003111559,"about_ca_topic_score_gemma":0.003183872,"domain_scores_codex":[0.9991744,0.0001646363,0.00002836333,0.0001363796,0.0003556357,0.0001405612],"domain_scores_gemma":[0.9981274,0.0008036022,0.0001282548,0.0003058907,0.0004007611,0.000234155],"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.00004711328,0.00003192024,0.0004018744,0.00007451977,0.000009084559,0.0001556316,0.0002022335,0.001825427,0.0009492046,0.9843312,0.004141547,0.007830348],"study_design_scores_gemma":[0.00003460242,0.00002395352,0.0004301864,0.00003594512,0.00001297952,0.00009851071,0.00007887631,0.009073727,0.0009838927,0.976325,0.01288168,0.00002063156],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3101772,0.002268078,0.3027828,0.01325742,0.00269451,0.0001646972,0.001095481,0.0008026588,0.3667572],"genre_scores_gemma":[0.903939,0.001086427,0.05113274,0.002492289,0.0009398665,0.0001558434,0.0007722156,0.0002299741,0.03925171],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01268867,"threshold_uncertainty_score":0.04244781,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2322988435","doi":"10.4310/joc.2014.v5.n1.a6","title":"Cops and Robbers playing on edges","year":2014,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"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; Western Michigan University","keywords":"Mathematics; Combinatorics","authors":[{"name":"Andrzej Dudek","is_ca":false},{"name":"Przemysław Gordinowicz","is_ca":false},{"name":"Paweł Prałat","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02471838052824164,"gpt":0.2767811090525798,"spread":0.2520627285243381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001235212,0.0008014747,0.001104906,0.0008614931,0.001695224,0.002289933,0.001573317,0.001876663,0.00831966],"category_scores_gemma":[0.007993316,0.0005693595,0.0007016413,0.0005894104,0.003513775,0.005010562,0.00195572,0.001834445,0.0005563457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001103819,"about_ca_system_score_gemma":0.0005248621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009733968,"about_ca_topic_score_gemma":0.0008216434,"domain_scores_codex":[0.9981461,0.0005599916,0.00008677137,0.0005197687,0.0002482397,0.0004392143],"domain_scores_gemma":[0.9968429,0.001428757,0.0005061289,0.0004173515,0.0001772728,0.0006276799],"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.0003783153,0.00007771641,0.001515628,0.00009088941,0.00005116212,0.0003149034,0.0003132727,0.02582614,0.004634637,0.9520881,0.002226109,0.01248311],"study_design_scores_gemma":[0.00008161722,0.0002071022,0.001845608,0.00005515602,0.00003714109,0.0005132105,0.0005571219,0.1495429,0.003898533,0.8359306,0.007268229,0.00006281966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6530854,0.0003598037,0.2829788,0.001064505,0.0001292521,0.0001763603,0.0003052617,0.000221971,0.06167869],"genre_scores_gemma":[0.9594005,0.0001666518,0.03127204,0.0001716285,0.0000412172,0.0001339018,0.0001349513,0.0000881965,0.008590866],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00831966,"threshold_uncertainty_score":0.02783197,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2224352238","doi":"10.4310/joc.2019.v10.n2.a5","title":"Fractional triangle decompositions of dense $3$-partite graphs","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Decomposition; Mathematics; Degree (music); Discrete mathematics; Physics","authors":[{"name":"Flora C. Bowditch","is_ca":true},{"name":"Peter J. Dukes","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01095973669627161,"gpt":0.2287322654877202,"spread":0.2177725287914485,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002883663,0.0003822877,0.0004813543,0.0008394767,0.0007196574,0.00135044,0.0006692309,0.0006263112,0.007527184],"category_scores_gemma":[0.002512986,0.0003728047,0.0004698108,0.0006370057,0.0007511571,0.001391744,0.0009002352,0.0008807167,0.0005462794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005606557,"about_ca_system_score_gemma":0.0002216614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001573039,"about_ca_topic_score_gemma":0.002379243,"domain_scores_codex":[0.9997169,0.00004156532,0.00001028958,0.00005698855,0.00006277523,0.000111379],"domain_scores_gemma":[0.9987541,0.0005659079,0.000177875,0.0002167459,0.0001045305,0.0001808218],"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.0006469457,0.0001431148,0.005559454,0.000234796,0.0000454235,0.0006901501,0.0008408474,0.3324377,0.03392544,0.5701287,0.00767538,0.04767207],"study_design_scores_gemma":[0.00004141927,0.00008464435,0.001522911,0.00003219841,0.00001924618,0.0003022121,0.0003299855,0.6419219,0.01044396,0.341419,0.003863347,0.00001910141],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7907935,0.0002914044,0.1836662,0.000396512,0.00005810117,0.00004196008,0.0006107559,0.0003483897,0.02379326],"genre_scores_gemma":[0.9667106,0.0001309527,0.02882912,0.00006910335,0.00003196741,0.00003181336,0.0005765433,0.00007845685,0.003541457],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007527184,"threshold_uncertainty_score":0.02518088,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2125110392","doi":"10.4310/joc.2010.v1.n2.a4","title":"Distinguishing number and adjacency properties","year":2010,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"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":"Mathematics; Adjacency list; Combinatorics; Adjacency matrix; Graph","authors":[{"name":"Anthony Bonato","is_ca":true},{"name":"Dejan Delić","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009317139015940886,"gpt":0.2123947591885158,"spread":0.2030776201725749,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001095889,0.0003721934,0.0004365903,0.001728691,0.00118709,0.001963648,0.001005301,0.001071123,0.006325618],"category_scores_gemma":[0.009345784,0.0003321787,0.0004613536,0.001338644,0.003029651,0.0048332,0.002070978,0.001593887,0.0005512063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00114913,"about_ca_system_score_gemma":0.0004741681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002985178,"about_ca_topic_score_gemma":0.0003081791,"domain_scores_codex":[0.9985361,0.0003075214,0.00008786302,0.0004903332,0.0003607097,0.0002175224],"domain_scores_gemma":[0.9778599,0.01584309,0.002107765,0.002047804,0.000726164,0.001415297],"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.0003035341,0.00007549007,0.006378202,0.0001172134,0.00001990023,0.0001772721,0.0003002978,0.01098561,0.008143553,0.9512058,0.002580871,0.01971229],"study_design_scores_gemma":[0.00003681732,0.00005742707,0.002193502,0.00001753859,0.00002628491,0.0004806614,0.00009690029,0.03462546,0.007676982,0.9507269,0.004034075,0.00002747027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8657907,0.0003561641,0.09084508,0.001195565,0.0001123518,0.00004438418,0.0009512518,0.0004771481,0.04022729],"genre_scores_gemma":[0.9890735,0.00007649491,0.008519708,0.00008268242,0.00006179867,0.00003466865,0.0003526466,0.00002752271,0.00177107],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006325618,"threshold_uncertainty_score":0.02116138,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2600215958","doi":"10.4310/joc.2016.v7.n2.a1","title":"Group-colouring, group-connectivity, claw-decompositions, and orientations in 5-edge-connected planar graphs","year":2016,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"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":"Danmarks Tekniske Universitet","keywords":"Combinatorics; Group (periodic table); Claw; Enhanced Data Rates for GSM Evolution; Mathematics; Planar; Computer science; Physics; Telecommunications; Engineering; Structural engineering; Computer graphics (images)","authors":[{"name":"R. Bruce Richter","is_ca":true},{"name":"Carsten Thomassen","is_ca":false},{"name":"D. H. Younger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01309298281767063,"gpt":0.2744815073666814,"spread":0.2613885245490107,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000422247,0.0008207033,0.0005685206,0.00184257,0.001298994,0.002052228,0.001098936,0.0012421,0.005175456],"category_scores_gemma":[0.003073166,0.0008830732,0.001108228,0.002018581,0.003481654,0.003443495,0.001876708,0.002765095,0.0005567457],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00125872,"about_ca_system_score_gemma":0.0005163564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002971369,"about_ca_topic_score_gemma":0.003192327,"domain_scores_codex":[0.9995323,0.00007050759,0.00002689065,0.0001550612,0.00009921643,0.000115883],"domain_scores_gemma":[0.9970733,0.001485717,0.0006230935,0.0002652671,0.0001779296,0.0003747333],"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.0004333743,0.0002755362,0.01140246,0.0005634463,0.00008192893,0.0009953004,0.003231817,0.02916649,0.01727559,0.8656384,0.006106113,0.06482942],"study_design_scores_gemma":[0.00007682689,0.0001145667,0.00569059,0.00007142039,0.00009548176,0.0008231423,0.0008228237,0.02146115,0.004520893,0.9569765,0.009284179,0.00006248627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8339665,0.001249977,0.1351251,0.001707647,0.00009814603,0.0001428765,0.0006464237,0.0003616851,0.02670157],"genre_scores_gemma":[0.93633,0.001339354,0.05407013,0.0004029285,0.0001225595,0.0001443927,0.00133637,0.0001261909,0.006128117],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005175456,"threshold_uncertainty_score":0.0173136,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2314945607","doi":"10.4310/joc.2012.v3.n1.a5","title":"Chipping away at the edges: How long does it take?","year":2012,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"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":"Vertex (graph theory); Combinatorics; Mathematics; TRAC; Enhanced Data Rates for GSM Evolution; Graph; Discrete mathematics; Computer science; Telecommunications","authors":[{"name":"O-Yeat Chan","is_ca":false},{"name":"Paweł Prałat","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02121661070718891,"gpt":0.2487230148264045,"spread":0.2275064041192155,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002106064,0.001052781,0.001856938,0.001201817,0.002388672,0.003887805,0.001761481,0.003967313,0.01382981],"category_scores_gemma":[0.02569593,0.0008834415,0.001091853,0.002256272,0.003162798,0.01089647,0.002791106,0.005266252,0.004794999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001562528,"about_ca_system_score_gemma":0.001687325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004219517,"about_ca_topic_score_gemma":0.006178465,"domain_scores_codex":[0.9981084,0.0005494283,0.00008766556,0.0004137799,0.0004325779,0.0004080491],"domain_scores_gemma":[0.9890593,0.005836067,0.0005675473,0.002039016,0.001822157,0.000675858],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001637946,0.0003872498,0.008970133,0.000729018,0.0002263239,0.0006534165,0.0006770989,0.03067425,0.008224987,0.2689554,0.1458587,0.5330054],"study_design_scores_gemma":[0.0001790847,0.000322401,0.002394679,0.0003288971,0.0002431859,0.0008689575,0.001955341,0.1449715,0.01240445,0.7690697,0.06697644,0.0002853039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1678767,0.06608571,0.5433508,0.133887,0.008819839,0.0002844867,0.001195258,0.00263921,0.07586101],"genre_scores_gemma":[0.6946647,0.02433702,0.1722126,0.02360962,0.002475265,0.0003598829,0.001805771,0.001523676,0.07901146],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01382981,"threshold_uncertainty_score":0.0462653,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2798961559","doi":"10.4310/joc.2019.v10.n3.a5","title":"Independence posets","year":2019,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"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; Independence (probability theory); Combinatorics; Star product; Discrete mathematics; Statistics","authors":[{"name":"Hugh Thomas","is_ca":true},{"name":"Nathan Williams","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005086164802637531,"gpt":0.2180778302966756,"spread":0.2129916654940381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008576718,0.0007056866,0.000435874,0.00159362,0.002117053,0.002293338,0.0008007521,0.000559032,0.01817836],"category_scores_gemma":[0.001654649,0.0005135415,0.0008731917,0.00101684,0.002837843,0.005263563,0.002801404,0.002022013,0.001975698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009989252,"about_ca_system_score_gemma":0.0007073925,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009250569,"about_ca_topic_score_gemma":0.001179351,"domain_scores_codex":[0.9986802,0.0002418458,0.00008979762,0.0003582847,0.0003733555,0.0002566052],"domain_scores_gemma":[0.9983203,0.0005874043,0.0002122478,0.0002440119,0.0002941034,0.0003419915],"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.00002920444,0.00003187099,0.0004638425,0.00002899403,0.000007638256,0.0001344756,0.0002985063,0.0006170548,0.001314933,0.9888124,0.001350543,0.006910455],"study_design_scores_gemma":[0.00001930879,0.00003286309,0.000499077,0.00001548839,0.00001317734,0.000342405,0.0002882921,0.003931011,0.002140804,0.9731945,0.01950134,0.00002177965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2752202,0.0008221368,0.4575805,0.001814375,0.0003892632,0.0003601229,0.002945918,0.001259787,0.2596077],"genre_scores_gemma":[0.8795047,0.0005435936,0.06459853,0.0004680331,0.0004119585,0.0003889186,0.003385101,0.0001986263,0.05050049],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01817836,"threshold_uncertainty_score":0.06081271,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963914152","doi":"10.4310/joc.2018.v9.n1.a2","title":"Teaching dimension, VC dimension, and critical sets in Latin squares","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Dimension (graph theory); Latin square; Combinatorics; Packing dimension; Minkowski–Bouligand dimension; Mathematical analysis; Biology","authors":[{"name":"Hamed Hatami","is_ca":true},{"name":"Yingjie Qian","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008669537047505128,"gpt":0.2453035447689401,"spread":0.236634007721435,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008536311,0.0005808934,0.0007334058,0.001689696,0.001682908,0.002784054,0.001078377,0.0009812771,0.004955718],"category_scores_gemma":[0.01217331,0.0004991809,0.0006474328,0.001172002,0.004919727,0.004011371,0.002114646,0.002280577,0.0004978281],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002041783,"about_ca_system_score_gemma":0.0008066288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001170649,"about_ca_topic_score_gemma":0.001735444,"domain_scores_codex":[0.9989022,0.0002607722,0.00004462631,0.0002587944,0.000224491,0.000309053],"domain_scores_gemma":[0.980135,0.01520283,0.001406092,0.001589052,0.0006337313,0.001033342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003193686,0.0001195135,0.008205936,0.0002655465,0.00004358872,0.0002001312,0.0007774662,0.02537951,0.01058373,0.9203178,0.005127314,0.02866015],"study_design_scores_gemma":[0.00005407866,0.00009101765,0.003279118,0.00009358572,0.00003701968,0.0003563526,0.0002491146,0.08373786,0.009397791,0.897185,0.005458875,0.00006019366],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.8026364,0.001750565,0.1451687,0.002823351,0.0001258946,0.00008403265,0.0006193944,0.000523065,0.04626855],"genre_scores_gemma":[0.976934,0.0004409035,0.01907789,0.0002238912,0.0001388765,0.0001036331,0.0002436935,0.00006630436,0.002770816],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.004955718,"threshold_uncertainty_score":0.0165785,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3119325883","doi":"10.4310/joc.2021.v12.n1.a4","title":"Zero-forcing in random regular graphs","year":2021,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University; University of Toronto","funders":"","keywords":"Mathematics; Zero (linguistics); Forcing (mathematics); Combinatorics; Random graph; Discrete mathematics; Graph; Mathematical analysis","authors":[{"name":"Deepak Bal","is_ca":false},{"name":"Patrick Bennett","is_ca":false},{"name":"Sean English","is_ca":false},{"name":"Calum MacRury","is_ca":true},{"name":"Paweł Prałat","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01508887149503892,"gpt":0.2742597223041571,"spread":0.2591708508091182,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001736691,0.0005481638,0.00082579,0.001743113,0.001076647,0.00145747,0.001827687,0.0009512745,0.00309015],"category_scores_gemma":[0.01254335,0.0005981156,0.001027784,0.0007039423,0.003684146,0.002422759,0.001874819,0.001440049,0.0004943739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001445733,"about_ca_system_score_gemma":0.0009144694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001681011,"about_ca_topic_score_gemma":0.001917714,"domain_scores_codex":[0.9989387,0.0003569328,0.00004242473,0.000255512,0.0002070222,0.0001994208],"domain_scores_gemma":[0.9866992,0.01023854,0.0008583638,0.001023769,0.0005357498,0.0006442234],"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.0001272859,0.00004333238,0.00120845,0.000118433,0.00003092956,0.0002531817,0.0002528931,0.1207696,0.003905633,0.8626868,0.001375829,0.009227599],"study_design_scores_gemma":[0.00003244284,0.00003592037,0.0003432327,0.00002965672,0.00001566355,0.0001121881,0.00005093317,0.4598175,0.001889451,0.5364022,0.001245209,0.00002560763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2493398,0.0004732877,0.73817,0.0006400734,0.00007250834,0.0001239208,0.0002319853,0.0006540013,0.01029444],"genre_scores_gemma":[0.9066923,0.0004249283,0.08553128,0.0002086998,0.0000744233,0.0002154266,0.0002069448,0.0002094288,0.006436505],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00309015,"threshold_uncertainty_score":0.01048952,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981391255","doi":"10.4310/joc.2013.v4.n3.a2","title":"Complements of nearly perfect graphs","year":2013,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Hungarian Scientific Research Fund; Fonds Québécois de la Recherche sur la Nature et les Technologies; Agence Nationale de la Recherche","keywords":"Class (philosophy); Bounded function; Trivially perfect graph; Chordal graph; Indifference graph; Function (biology); Clique-sum","authors":[],"retraction":null,"screen_n_in":null,"score":{"opus":0.01844170819493836,"gpt":0.2825551333255742,"spread":0.2641134251306359,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007208232,0.0003934775,0.0006447315,0.001662739,0.001420139,0.002654315,0.0007772738,0.0006901675,0.005375711],"category_scores_gemma":[0.004194172,0.0004349018,0.0005745591,0.001002407,0.002617039,0.003546797,0.002102313,0.0009410931,0.0003480104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001257769,"about_ca_system_score_gemma":0.0006894262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003725473,"about_ca_topic_score_gemma":0.002302943,"domain_scores_codex":[0.9990306,0.0001888788,0.00003988311,0.0002406583,0.0003021299,0.0001978939],"domain_scores_gemma":[0.9967649,0.001235965,0.0005599956,0.000349758,0.0004947166,0.0005947089],"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.0001484921,0.00002324249,0.002172802,0.00005652007,0.00001886547,0.0002208493,0.0004032614,0.00460929,0.002229453,0.979427,0.001706843,0.008983334],"study_design_scores_gemma":[0.00002873806,0.00006205344,0.004187341,0.00007208224,0.0000356241,0.0006801183,0.0008143166,0.03062402,0.002864852,0.9423704,0.01822132,0.00003912908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8696059,0.0009819041,0.06969776,0.0006976938,0.0001276336,0.00007750426,0.001146719,0.0002788878,0.05738603],"genre_scores_gemma":[0.9827474,0.000376229,0.009943775,0.0001497132,0.00008532972,0.00006927348,0.001069647,0.00007371858,0.005484943],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005375711,"threshold_uncertainty_score":0.01798356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2790566475","doi":"10.4310/joc.2018.v9.n2.a5","title":"Chains in shard intersection lattices and parabolic support posets","year":2018,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"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":"Agence Nationale de la Recherche","keywords":"Intersection (aeronautics); Star product; Combinatorics; Computer science; Mathematics; Geography; Cartography","authors":[{"name":"Pierre Baumann","is_ca":false},{"name":"Frédéric Chapoton","is_ca":false},{"name":"Christophe Hohlweg","is_ca":true},{"name":"Hugh Thomas","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04024412573833556,"gpt":0.3457545142425377,"spread":0.3055103885042021,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002697167,0.0006146914,0.0006624805,0.001672213,0.002758987,0.004486408,0.0007740157,0.0008444155,0.03518405],"category_scores_gemma":[0.0009212721,0.0007778365,0.0006869998,0.002393141,0.002092148,0.005807899,0.003323499,0.001695894,0.004612945],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008481757,"about_ca_system_score_gemma":0.0006149462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001547508,"about_ca_topic_score_gemma":0.001819541,"domain_scores_codex":[0.9994747,0.00007379214,0.00003204676,0.0001052366,0.0001565693,0.0001577053],"domain_scores_gemma":[0.9992917,0.0001835893,0.0001150325,0.00008247516,0.0001005358,0.0002265811],"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.0002751223,0.00006096044,0.0007487947,0.00009991739,0.00001234447,0.0003441555,0.0006498368,0.002159905,0.002520072,0.9741917,0.003998085,0.01493911],"study_design_scores_gemma":[0.00005274308,0.00004826868,0.0004248286,0.00004020004,0.00001659771,0.0002645628,0.0009196399,0.00743618,0.002309319,0.9657555,0.02270677,0.00002541122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5653198,0.0008743196,0.1787467,0.002064415,0.0005112586,0.0001585076,0.002011232,0.001588373,0.2487255],"genre_scores_gemma":[0.8980266,0.0005559791,0.0293353,0.0002156858,0.000204283,0.0001109451,0.001625979,0.0004205717,0.06950478],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03518405,"threshold_uncertainty_score":0.1177024,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2567969683","doi":"10.4310/joc.2019.v10.n2.a1","title":"On the boundary of the region defined by homomorphism densities","year":2019,"lang":"en","type":"preprint","venue":"Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Homomorphism; Boundary (topology); Differentiable function; Countable set; Combinatorics; Discrete mathematics; Algebraic number; Pure mathematics; Mathematical analysis","authors":[{"name":"Hamed Hatami","is_ca":true},{"name":"Sergey Norin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02879365904522159,"gpt":0.2551754724325314,"spread":0.2263818133873098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001032687,0.0003050105,0.0007374858,0.001931288,0.001369974,0.002663517,0.0007769053,0.0006321318,0.003259347],"category_scores_gemma":[0.0047724,0.0003585957,0.0005393388,0.0007514424,0.003531621,0.004092722,0.002928483,0.00130915,0.0005667374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001059413,"about_ca_system_score_gemma":0.0004190357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001139887,"about_ca_topic_score_gemma":0.0004562482,"domain_scores_codex":[0.9991887,0.0002277201,0.00003625087,0.0002043857,0.000198711,0.0001442636],"domain_scores_gemma":[0.9977267,0.001147953,0.000350323,0.0001778433,0.0002696445,0.0003275506],"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.0001267872,0.00002166459,0.0008911537,0.0000586622,0.00001061749,0.0001465913,0.0007237739,0.001553259,0.003434115,0.9885387,0.0003741886,0.004120472],"study_design_scores_gemma":[0.00006420245,0.00007114207,0.002431194,0.00006795153,0.00002570501,0.0004608682,0.0005113353,0.01605918,0.003578497,0.9728097,0.003882764,0.00003747833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.850165,0.001311687,0.09991458,0.0007250534,0.0000368366,0.00003738359,0.0004001114,0.000273641,0.04713572],"genre_scores_gemma":[0.984098,0.000424628,0.011056,0.0001082766,0.00007080765,0.00006900012,0.000321513,0.00008241601,0.003769345],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003259347,"threshold_uncertainty_score":0.01090366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2588150890","doi":"10.4310/joc.2017.v8.n2.a2","title":"A linear time algorithm for finding a maximum independent set of a fullerene","year":2017,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Fullerene Chemistry and Applications","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Set (abstract data type); Algorithm; Fullerene; Computer science; Chemistry","authors":[{"name":"Sean Daugherty","is_ca":true},{"name":"Wendy Myrvold","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03006367243714537,"gpt":0.2987736975752472,"spread":0.2687100251381018,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006625979,0.001713409,0.001864008,0.001991251,0.001860549,0.002345906,0.002791233,0.00201715,0.01483181],"category_scores_gemma":[0.002867119,0.001028641,0.002561962,0.003287472,0.0008979504,0.002959827,0.002586284,0.001718064,0.002714767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002134959,"about_ca_system_score_gemma":0.003052571,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004982402,"about_ca_topic_score_gemma":0.009615921,"domain_scores_codex":[0.9990786,0.0001072724,0.00005381375,0.0003280094,0.0002805862,0.0001516588],"domain_scores_gemma":[0.9987146,0.000757445,0.0001008453,0.0002037533,0.0001263522,0.00009703912],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001516764,0.0007946969,0.002296801,0.001270339,0.0004253175,0.0003962445,0.0004792204,0.1331778,0.032765,0.03211167,0.02980419,0.7649619],"study_design_scores_gemma":[0.0009555776,0.000491354,0.002362225,0.00009321394,0.0003170055,0.0005342696,0.0004482002,0.8258969,0.02029982,0.1334445,0.01505246,0.000104467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1009999,0.0009870316,0.8621365,0.001463271,0.0002093203,0.001076863,0.00268675,0.007078058,0.02336231],"genre_scores_gemma":[0.1645361,0.0002274795,0.8246334,0.0001968491,0.00006538801,0.0004544021,0.003076267,0.0003296646,0.006480527],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01483181,"threshold_uncertainty_score":0.04961735,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3204189941","doi":"10.4310/joc.2023.v14.n4.a4","title":"Pursuit-evasion games on Latin square graphs","year":2023,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; McMaster University; Toronto Metropolitan University","funders":"","keywords":"Latin square; Mathematics; Combinatorics; Circulant matrix; Upper and lower bounds; Dimension (graph theory); Square (algebra); Discrete mathematics; Graph; Geometry; Mathematical analysis","authors":[{"name":"Shreya Ahirwar","is_ca":false},{"name":"Anthony Bonato","is_ca":true},{"name":"Leanna Gittins","is_ca":true},{"name":"Alice Huang","is_ca":true},{"name":"Trent G. Marbach","is_ca":true},{"name":"Tomer Zaidman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02611686496365846,"gpt":0.2539106187191026,"spread":0.2277937537554442,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000736595,0.0009802287,0.0009632807,0.0009901871,0.001151438,0.00190743,0.001072341,0.001217381,0.003841695],"category_scores_gemma":[0.006547817,0.0004463507,0.0005377618,0.001058031,0.002159576,0.002969726,0.002007335,0.001288508,0.0004925597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001954239,"about_ca_system_score_gemma":0.0006541184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001983563,"about_ca_topic_score_gemma":0.001650602,"domain_scores_codex":[0.9991416,0.0003655638,0.0000276285,0.0001579157,0.0001170578,0.0001901653],"domain_scores_gemma":[0.9937429,0.004212505,0.0008544694,0.0002859879,0.0002508573,0.000653259],"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.0006455744,0.0001534546,0.002632875,0.0002696752,0.00009897973,0.0005101562,0.000687296,0.3164716,0.01054566,0.6391752,0.005574073,0.02323546],"study_design_scores_gemma":[0.00008212752,0.0001186184,0.0005820852,0.00003319791,0.00001907341,0.0001651256,0.000291954,0.7250095,0.002093088,0.26873,0.002842084,0.00003309915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7619226,0.0008232601,0.1993302,0.002044807,0.00009502086,0.0001554778,0.0004216617,0.000285725,0.03492134],"genre_scores_gemma":[0.9677205,0.0005093669,0.02357585,0.0002618347,0.00004910439,0.0001351133,0.0002590836,0.00006578812,0.007423322],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003841695,"threshold_uncertainty_score":0.01417911,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080401458","doi":"10.4310/joc.2013.v4.n4.a4","title":"A Sidon-type condition on set systems","year":2013,"lang":"en","type":"preprint","venue":"Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"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":"Mathematics; Lambda; Constant (computer programming); Combinatorics; Type (biology); Upper and lower bounds; Closure (psychology); Probabilistic logic; Set (abstract data type); Value (mathematics); Discrete mathematics; Physics; Statistics; Mathematical analysis; Computer science; Quantum mechanics","authors":[{"name":"Peter J. Dukes","is_ca":true},{"name":"Jane Wodlinger","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05795207938737249,"gpt":0.3350437176936293,"spread":0.2770916383062568,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00281178,0.0005649407,0.001308787,0.00185693,0.003757334,0.00343908,0.001386272,0.002842158,0.02038769],"category_scores_gemma":[0.01355107,0.00054562,0.001317912,0.001685807,0.003817543,0.008548468,0.004092433,0.002996204,0.001822835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002019227,"about_ca_system_score_gemma":0.001437432,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001072498,"about_ca_topic_score_gemma":0.001197228,"domain_scores_codex":[0.9974933,0.000419162,0.0002850382,0.0006482043,0.0006373823,0.0005169847],"domain_scores_gemma":[0.9906533,0.004702603,0.0006089571,0.001365098,0.001442909,0.001227325],"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.0001133034,0.00003792656,0.001138321,0.00009659898,0.00001048392,0.0001942923,0.0002351831,0.001193487,0.002644634,0.9841495,0.002072247,0.008114082],"study_design_scores_gemma":[0.00007472648,0.0001307686,0.0008881681,0.00007035035,0.00001595697,0.0006772199,0.0002962352,0.01566808,0.004590963,0.9679387,0.009606764,0.00004199866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5110801,0.001157259,0.2633702,0.005380924,0.0009010583,0.0002450818,0.001943643,0.001178632,0.2147431],"genre_scores_gemma":[0.9307368,0.0003828231,0.04881443,0.0007567676,0.0002859918,0.0003782483,0.0009332907,0.0001656806,0.01754596],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02038769,"threshold_uncertainty_score":0.06820357,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2898607378","doi":"10.4310/joc.2020.v11.n3.a3","title":"The probability of positivity in symmetric and quasisymmetric functions","year":2020,"lang":"en","type":"preprint","venue":"Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"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; Université du Québec à Montréal","funders":"Canada Research Chairs; Centre de Recherches Mathématiques","keywords":"Mathematics; Basis (linear algebra); Vector space; Combinatorics; Infinity; Zero (linguistics); Function (biology); Space (punctuation); Symmetric function; Degree (music); Pure mathematics; Discrete mathematics; Mathematical analysis; Computer science; Geometry","authors":[{"name":"Rebecca Patrias","is_ca":true},{"name":"Stephanie van Willigenburg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0689131263917369,"gpt":0.3254925588122175,"spread":0.2565794324204806,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004185094,0.000569149,0.0007912393,0.001966125,0.0007146833,0.002763647,0.001293025,0.001093877,0.004455705],"category_scores_gemma":[0.02660115,0.0004842906,0.0005867684,0.0007712726,0.004413456,0.004106123,0.002012048,0.001331879,0.0003927336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00105045,"about_ca_system_score_gemma":0.00056934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000712125,"about_ca_topic_score_gemma":0.0004769274,"domain_scores_codex":[0.9984463,0.0006051105,0.00006155109,0.0002580662,0.0003352267,0.000293827],"domain_scores_gemma":[0.9759206,0.01802155,0.001715348,0.001550288,0.001356926,0.001435373],"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.0008505231,0.0001251387,0.02440475,0.0001702275,0.00005789721,0.0005256157,0.0003652351,0.08798976,0.008654663,0.8490803,0.003286583,0.02448935],"study_design_scores_gemma":[0.00006645492,0.0001413842,0.007541329,0.00007521673,0.00003465599,0.0005464773,0.0002422786,0.4886915,0.009411284,0.4917157,0.001405126,0.0001286059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8577921,0.0002445347,0.1316573,0.0008264064,0.00007580152,0.00003484252,0.0002516473,0.0002292339,0.008888178],"genre_scores_gemma":[0.9913082,0.0001570352,0.005827697,0.00008189931,0.0000743146,0.00004612376,0.0002027231,0.00007130174,0.002230789],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004455705,"threshold_uncertainty_score":0.02213317,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402305041","doi":"10.4310/joc.240906223550","title":"Toggling, rowmotion, and homomesy on interval-closed sets","year":2024,"lang":"en","type":"article","venue":"Journal of Combinatorics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Interval (graph theory); Mathematics; Combinatorics","authors":[{"name":"Jennifer Elder","is_ca":false},{"name":"Nadia Lafrenière","is_ca":true},{"name":"Erin McNicholas","is_ca":false},{"name":"Jessica Striker","is_ca":false},{"name":"Amanda Welch","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0118176600742004,"gpt":0.2638531070008877,"spread":0.2520354469266873,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005122801,0.0003882254,0.0007662117,0.001894726,0.002188073,0.001982319,0.0008873474,0.0007918042,0.009775748],"category_scores_gemma":[0.003259559,0.0003775503,0.001055491,0.001552747,0.003002331,0.005129386,0.002575667,0.001800062,0.0005935509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008461383,"about_ca_system_score_gemma":0.000475367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001720532,"about_ca_topic_score_gemma":0.001373135,"domain_scores_codex":[0.9995484,0.00009239911,0.00002812571,0.000119811,0.00009694756,0.0001142492],"domain_scores_gemma":[0.9986941,0.000576192,0.0001663546,0.0002052071,0.000163211,0.0001949678],"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.00003034379,0.000009457177,0.0002006495,0.0000145333,0.000003913146,0.00007741484,0.0002709446,0.0006638654,0.0004701125,0.9932929,0.0006555698,0.004310231],"study_design_scores_gemma":[0.00001242791,0.00001936804,0.0002528668,0.000009031972,0.000005360179,0.0001047275,0.0001852642,0.00378078,0.0002572357,0.9931804,0.002180683,0.00001179887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6650323,0.001385127,0.2352634,0.002180466,0.0002802986,0.0000590874,0.0005159613,0.0003246313,0.09495869],"genre_scores_gemma":[0.9547794,0.0004186946,0.02193796,0.0002375556,0.0001221095,0.00005743251,0.0002560972,0.000101367,0.0220893],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009775748,"threshold_uncertainty_score":0.03270316,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}