{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001001461,0.0003158112,0.0007209334,0.0001700659,0.0001427061,0.00007082701,0.0005363711,0.0002644809,0.000269765],"category_scores_gemma":[0.0002830217,0.0002520588,0.0003865486,0.0003408262,0.00004578879,0.0004811609,0.0001337229,0.0006214308,0.00001382141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000234761,"about_ca_system_score_gemma":0.0001326344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006280374,"about_ca_topic_score_gemma":1.850167e-7,"domain_scores_codex":[0.9971598,0.0001922984,0.0009775243,0.0001410506,0.0009579668,0.000571314],"domain_scores_gemma":[0.9973051,0.000409871,0.001025277,0.0003667747,0.0004700305,0.0004229679],"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.0001175068,0.0006653118,0.001180121,0.00003280511,0.000205582,0.0000210762,0.0003059485,0.000004087756,0.0002495702,0.9879998,0.008733075,0.0004851403],"study_design_scores_gemma":[0.002788538,0.0002877547,0.003891446,0.00002757818,0.0002167363,0.0001456464,0.00001627489,0.00003740445,0.0008092199,0.9763554,0.01512492,0.0002990449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9727419,0.00241954,0.004772385,0.0006025762,0.01786677,0.0002023797,0.000004051019,0.00005317318,0.001337221],"genre_scores_gemma":[0.9953985,0.0001223358,0.002263378,0.0001926733,0.001357069,0.000003850288,0.000001720534,0.00006257837,0.0005978665],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02265663,"threshold_uncertainty_score":0.9999931,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00237939,0.0001038212,0.0002002225,0.00003813408,0.0001378935,0.00002541164,0.0002994545,0.0000722682,0.0001449151],"category_scores_gemma":[0.0008511991,0.00006066676,0.0001192001,0.0002783552,0.00004357864,0.00008736172,0.00002386069,0.0004133764,0.0000532579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003611427,"about_ca_system_score_gemma":0.00003494607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001736224,"about_ca_topic_score_gemma":0.000001092255,"domain_scores_codex":[0.9988754,0.0002934132,0.0003134841,0.00004540598,0.0002932581,0.0001790253],"domain_scores_gemma":[0.9966783,0.002370243,0.000391712,0.0002590894,0.0001952156,0.0001054266],"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.00001853155,0.0003157913,0.007621862,0.000006812307,0.00004091323,0.000001183757,0.0003037393,5.706927e-7,0.00002560952,0.9525897,0.03903049,0.00004479813],"study_design_scores_gemma":[0.0003094661,0.00006929861,0.008769733,0.0000223335,0.00004182086,0.00007954225,0.0001086815,0.000001819083,0.0007937201,0.9709722,0.01874922,0.00008221196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9891684,0.0001217974,0.0004670267,0.001213644,0.0007077131,0.0001202174,0.000007327001,0.0000142384,0.008179619],"genre_scores_gemma":[0.9991472,0.00002731701,0.0001148279,0.0002121945,0.0001203137,0.000003432107,6.184424e-7,0.00001485471,0.0003592853],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02028127,"threshold_uncertainty_score":0.2473918,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000485668,0.00009291145,0.000273956,0.0001202931,0.00005861816,0.00001735812,0.0001476029,0.00003696428,0.000154972],"category_scores_gemma":[0.00002801916,0.00008155281,0.0001422824,0.0002376924,0.00002813521,0.0002180991,0.00004201724,0.0002903474,0.000007745581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004802996,"about_ca_system_score_gemma":0.0001223573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001287122,"about_ca_topic_score_gemma":0.000001145706,"domain_scores_codex":[0.9990612,0.00007229597,0.0004226534,0.00004422286,0.0001817343,0.0002178932],"domain_scores_gemma":[0.9992296,0.0001149401,0.0002618267,0.0001205867,0.0001442038,0.0001288152],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00002538304,0.0008974752,0.7546667,0.00001283793,0.0001058847,0.000002722642,0.001533453,0.0001096232,0.001662115,0.2389486,0.001218221,0.0008169938],"study_design_scores_gemma":[0.01831102,0.002550092,0.4218486,0.001013963,0.0007998861,0.0002155231,0.06338325,0.001013712,0.0879078,0.1351812,0.2652655,0.002509515],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9903763,0.0003891737,0.0001270646,0.0002565671,0.0007854906,0.00004742876,0.000007469695,0.000002045297,0.008008462],"genre_scores_gemma":[0.9991097,0.00001389489,0.0001792167,0.00002649388,0.0003787707,5.784067e-7,0.000001595661,0.00001190301,0.0002778774],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3328182,"threshold_uncertainty_score":0.3325627,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009325884,0.0003237911,0.0008959211,0.0003071204,0.0001048589,0.0000927774,0.0004998861,0.0001940326,0.00002255625],"category_scores_gemma":[0.001038083,0.0002571764,0.0001956058,0.0004591153,0.0001100832,0.0005467914,0.0001644137,0.000597831,0.00001734968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001172204,"about_ca_system_score_gemma":0.0001460409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001994251,"about_ca_topic_score_gemma":3.198167e-7,"domain_scores_codex":[0.9973966,0.0001368834,0.001016698,0.0002116056,0.0008643133,0.0003738916],"domain_scores_gemma":[0.9971007,0.0005820342,0.0009878982,0.0004644794,0.0006523037,0.0002126414],"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.0001265378,0.0004870532,0.003376027,0.0003651826,0.0001158768,0.00002996998,0.0005471579,0.000003677006,0.003343649,0.9908693,0.0005555378,0.0001799863],"study_design_scores_gemma":[0.00320733,0.0008344217,0.0002368298,0.000307628,0.000109074,0.0002623432,0.0003390373,0.00007432162,0.003681831,0.987922,0.002699228,0.000326011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9897571,0.001080354,0.0005870177,0.0002154042,0.006022596,0.0003607922,0.000001527334,0.0000592081,0.00191604],"genre_scores_gemma":[0.9970802,0.0002383057,0.001978911,0.00003845503,0.0002360462,0.000003351566,2.550856e-7,0.00006971048,0.0003547618],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007323144,"threshold_uncertainty_score":0.999988,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001275228,0.0004618221,0.001574357,0.0001477481,0.00009072042,0.0000374366,0.002868426,0.0006157378,0.00001703871],"category_scores_gemma":[0.003329978,0.0002637905,0.0008241027,0.0005473324,0.0002130585,0.0001042877,0.001794854,0.002230544,7.145881e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003575158,"about_ca_system_score_gemma":0.001720136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001517629,"about_ca_topic_score_gemma":0.000003067274,"domain_scores_codex":[0.9955953,0.0003313206,0.002030818,0.0002291065,0.001486543,0.0003268616],"domain_scores_gemma":[0.9881845,0.001131539,0.007297008,0.001953359,0.00134099,0.00009265042],"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.0002294996,0.002207438,0.002637711,0.007843645,0.001148762,0.00001055073,0.003544391,0.004405951,0.001666182,0.9546483,0.02151193,0.0001456502],"study_design_scores_gemma":[0.00148858,0.0002136974,0.0001274244,0.001921129,0.0005584,0.00009186172,0.0001178246,0.0001660648,0.02465542,0.9687502,0.001647603,0.0002618122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9402187,0.001774044,0.01142132,0.001189649,0.0374651,0.003481167,0.0002427455,0.00003792283,0.004169367],"genre_scores_gemma":[0.9960776,0.00002673426,0.002870095,0.00002678181,0.0002673645,0.000007842565,0.000001461008,0.00008976469,0.0006323364],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05585894,"threshold_uncertainty_score":0.9999814,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006746397,0.00009835092,0.0002378079,0.0001090557,0.000148922,0.00002915956,0.0001517792,0.00006781983,0.000008959099],"category_scores_gemma":[0.0007451053,0.00007009324,0.00007054545,0.00007893278,0.00004500231,0.00007260653,0.00004122975,0.0002760555,7.35756e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002636726,"about_ca_system_score_gemma":0.00001327861,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.99147e-7,"about_ca_topic_score_gemma":1.760836e-7,"domain_scores_codex":[0.9992025,0.00007751265,0.0002794773,0.00006371156,0.0002571952,0.0001196004],"domain_scores_gemma":[0.9985048,0.0008628718,0.0002978095,0.0001351051,0.0001119112,0.0000875511],"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.0000295346,0.00004356707,0.00184084,0.00003074753,0.0000331979,0.000007092164,0.0004680549,0.000004205424,0.00004965954,0.9918593,0.00379435,0.001839513],"study_design_scores_gemma":[0.0006466296,0.0003379764,0.001737164,0.00006475,0.00003568751,0.00008109967,0.00008858815,0.00004512764,0.0004388397,0.9914476,0.004987446,0.00008907424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9875162,0.0001857518,0.001127373,0.0002112285,0.001384923,0.00003960653,3.976211e-7,0.00001195546,0.009522585],"genre_scores_gemma":[0.9986044,0.00006300863,0.0008957424,0.0001612099,0.0001486031,2.535783e-7,6.4024e-8,0.00001391987,0.0001128543],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01108816,"threshold_uncertainty_score":0.2858319,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005984257,0.0002070498,0.000691299,0.0004642835,0.00003679844,0.00003549567,0.0003334672,0.0002818122,0.00004550964],"category_scores_gemma":[0.00004485067,0.0002038943,0.0005776637,0.0002358849,0.00003091818,0.0001259501,0.00005900563,0.0009067581,0.00001492264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001042601,"about_ca_system_score_gemma":0.0001054501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002321705,"about_ca_topic_score_gemma":6.323283e-7,"domain_scores_codex":[0.9982819,0.0001082955,0.0009433879,0.00009590602,0.0004110311,0.0001594741],"domain_scores_gemma":[0.998279,0.0002167735,0.0007000383,0.0002978044,0.0003978692,0.0001084593],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004204521,0.001362019,0.01235413,0.003728495,0.003785249,0.0002028688,0.001328804,0.5984731,0.01036886,0.3338293,0.03347346,0.0006732919],"study_design_scores_gemma":[0.003462317,0.0005244078,0.008825511,0.002378871,0.0006962871,0.000577441,0.0002514542,0.005649597,0.009661399,0.953059,0.0140248,0.0008889535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9664661,0.006247424,0.009095682,0.00004864529,0.01410204,0.0002126586,0.00004752757,0.00004924203,0.003730644],"genre_scores_gemma":[0.9991356,0.0004537606,0.0001415821,0.000008049465,0.0001321588,0.000004150514,0.000006195362,0.00003365528,0.0000848359],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6192297,"threshold_uncertainty_score":0.8314569,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005768063,0.00007612953,0.0001400566,0.00006200025,0.000108427,0.0001805436,0.0003696733,0.00004821013,0.000004030808],"category_scores_gemma":[0.000330315,0.00005471767,0.00004202612,0.0002000508,0.00004313482,0.0003928847,0.0001131994,0.000390695,0.000005430431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006224788,"about_ca_system_score_gemma":0.00005990049,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004949022,"about_ca_topic_score_gemma":7.362813e-7,"domain_scores_codex":[0.9991972,0.00002583195,0.0002742291,0.00009310758,0.0002777162,0.0001319181],"domain_scores_gemma":[0.9990514,0.00005048876,0.0002329911,0.0001769708,0.0003675751,0.0001205982],"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.000004481475,0.000120208,0.01864652,0.00002424138,0.00001455991,0.00003980663,0.0006858101,0.00000521319,0.01185684,0.9630738,0.001873627,0.003654826],"study_design_scores_gemma":[0.001054546,0.0002199357,0.006330492,0.0001325578,0.00002090408,0.001068295,0.00004676009,0.002245933,0.006206507,0.9706832,0.01170902,0.0002818283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9917706,0.0004081847,0.002527575,0.0008428182,0.002629808,0.00003067007,9.838261e-8,0.00003175453,0.001758447],"genre_scores_gemma":[0.9901832,0.00003275546,0.009547617,0.00007668483,0.00001741864,3.52197e-7,2.935886e-8,0.000005046071,0.000136877],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01231603,"threshold_uncertainty_score":0.2231322,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001113365,0.0001768462,0.0003323047,0.000859162,0.0001914533,0.0001140636,0.0007994786,0.00009463151,0.000007153258],"category_scores_gemma":[0.0003230198,0.0001356261,0.0001024964,0.001236379,0.0001358209,0.001493081,0.0001836731,0.00039651,0.000005364472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002015124,"about_ca_system_score_gemma":0.00007255835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000777826,"about_ca_topic_score_gemma":0.00003482622,"domain_scores_codex":[0.9979186,0.0003383992,0.0005458356,0.0002817326,0.0005257452,0.0003896722],"domain_scores_gemma":[0.9975629,0.001173757,0.0003712672,0.0003546516,0.0002977758,0.0002396721],"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.00005411173,0.0003623289,0.02401748,0.00001300248,0.00003177719,0.0001442599,0.0003048695,0.000004364869,0.005446788,0.9659804,0.000212116,0.003428505],"study_design_scores_gemma":[0.002630471,0.0006919128,0.07257435,0.0001149869,0.00000955926,0.0002993071,0.00007733201,0.0001066883,0.0009390572,0.9218102,0.000540942,0.0002051517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8215447,0.000413761,0.1754378,0.001477366,0.0006907547,0.0001736128,0.000004191174,0.00004474544,0.0002130465],"genre_scores_gemma":[0.99445,0.0002882381,0.005101508,0.00006451552,0.00003350756,0.000007851821,6.460786e-7,0.00001543949,0.00003826145],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1729053,"threshold_uncertainty_score":0.5530674,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009772459,0.0001313406,0.0002008039,0.00008244909,0.0003116753,0.0002469897,0.001209014,0.00006126253,0.00001889897],"category_scores_gemma":[0.0001119048,0.00006552414,0.0001208403,0.0002969629,0.00003982131,0.00153019,0.0005625233,0.0003403852,0.00001755699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001163301,"about_ca_system_score_gemma":0.00006020611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002093848,"about_ca_topic_score_gemma":0.000001474536,"domain_scores_codex":[0.998574,0.0001012007,0.0002847258,0.0001099323,0.000608813,0.0003213562],"domain_scores_gemma":[0.9984298,0.0002180942,0.0004693473,0.0004838397,0.0002087317,0.0001901394],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006758726,0.001590264,0.08343574,0.0001565874,0.0003481437,0.0002886341,0.01084645,0.0001580484,0.002167288,0.2427828,0.4646242,0.1935343],"study_design_scores_gemma":[0.001789675,0.0003693527,0.06096164,0.0003257008,0.00007313005,0.001165134,0.0005631698,0.003630005,0.01165765,0.02435509,0.89446,0.0006494632],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1377344,0.007635478,0.8116134,0.02373088,0.01707737,0.0001877388,0.000003921582,0.00006083274,0.001955935],"genre_scores_gemma":[0.9958108,0.0002548011,0.001551268,0.0003497752,0.0006161986,0.000001213717,6.904821e-7,0.00001005622,0.001405199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8580764,"threshold_uncertainty_score":0.2671997,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003117881,0.00007526812,0.0001669612,0.0001014947,0.00003018544,0.00005508172,0.0009069185,0.00005309358,0.00001667721],"category_scores_gemma":[0.00005081921,0.00005902878,0.0000736493,0.0003182214,0.00001048285,0.0009077282,0.0001176218,0.0002979793,0.00008782384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004824979,"about_ca_system_score_gemma":0.00009788131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.338596e-7,"about_ca_topic_score_gemma":8.113167e-8,"domain_scores_codex":[0.9989936,0.00003238676,0.000253034,0.00009639668,0.0004721254,0.0001524924],"domain_scores_gemma":[0.9990217,0.00008049776,0.0002976139,0.000256656,0.0002529576,0.00009054679],"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.000005598059,0.00008491235,0.006783782,0.000007948377,0.0000106131,0.0000893861,0.0001330411,0.0001275747,0.0006250093,0.9875077,0.0003700294,0.004254399],"study_design_scores_gemma":[0.0009246249,0.0006615666,0.01703543,0.00003450431,0.000005333208,0.0004853668,0.00003088653,0.0009341977,0.00190966,0.9688683,0.008929452,0.0001807349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.687463,0.001035424,0.2956642,0.001218323,0.005342376,0.0001018669,2.565273e-7,0.00004828876,0.009126226],"genre_scores_gemma":[0.9958934,0.00004014077,0.003383456,0.0002575615,0.0000332577,1.826647e-7,4.374119e-8,0.000003928037,0.0003880316],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3084303,"threshold_uncertainty_score":0.2407124,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006965399,0.0001097117,0.0002331873,0.0002343179,0.00007913129,0.00003053372,0.00009104196,0.0000810514,0.000009042989],"category_scores_gemma":[0.0001693183,0.00009443815,0.00004114372,0.0001824287,0.00005774814,0.0001846161,0.00002521983,0.0003766983,0.000005147657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003806474,"about_ca_system_score_gemma":0.00001127067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004893421,"about_ca_topic_score_gemma":0.000002772358,"domain_scores_codex":[0.999044,0.0001076645,0.0004031442,0.00007048516,0.0001999177,0.0001747803],"domain_scores_gemma":[0.9993737,0.0002249198,0.00006122133,0.0001040178,0.0001264535,0.0001097008],"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.0001467826,0.0004111856,0.05444205,0.0004732724,0.0001215216,0.0004522506,0.01135517,0.0004995157,0.01955092,0.8982185,0.01031429,0.0040145],"study_design_scores_gemma":[0.004989834,0.00224634,0.07638163,0.001909758,0.0001396513,0.001317927,0.003344993,0.0189627,0.009194707,0.8588313,0.02151294,0.001168176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9960253,0.0009312577,0.0002844922,0.0001280885,0.001446763,0.00003832586,6.406952e-7,0.0000258298,0.001119338],"genre_scores_gemma":[0.99966,0.00002349238,0.0001443142,0.00003402197,0.00009675821,6.004738e-7,1.736246e-7,0.00001724621,0.00002344831],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0393872,"threshold_uncertainty_score":0.3851076,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001497774,0.0001022957,0.000311683,0.0004033066,0.00006813856,0.0001030282,0.0008587758,0.00005907454,0.000005822451],"category_scores_gemma":[0.0004613122,0.00009331008,0.0001586865,0.001752183,0.0000396925,0.0007133702,0.0002102835,0.0005106025,0.000003916634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001011033,"about_ca_system_score_gemma":0.0002930379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.293871e-7,"about_ca_topic_score_gemma":0.000001049418,"domain_scores_codex":[0.9981455,0.0002683819,0.0004783542,0.0001592532,0.0006564299,0.000292052],"domain_scores_gemma":[0.9983037,0.0003492094,0.0002428377,0.0004057106,0.0005592938,0.000139234],"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.0000457112,0.0001528065,0.003109305,0.00001667764,0.00002205708,0.001276555,0.0002688246,0.0004486478,0.002555935,0.9884312,0.0003417922,0.003330467],"study_design_scores_gemma":[0.002811755,0.0001137622,0.00126234,0.00007191167,0.000004037342,0.0003275484,0.00004837183,0.0007101463,0.01038036,0.982019,0.002141941,0.0001088275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3178183,0.004451291,0.6720901,0.001340558,0.001828956,0.000112408,4.01049e-7,0.00003088091,0.00232711],"genre_scores_gemma":[0.9922314,0.0003100072,0.007111156,0.00007796635,0.00002110998,0.000001178401,1.637997e-7,0.000009577479,0.0002373994],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6744131,"threshold_uncertainty_score":0.3805075,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007393924,0.0001033105,0.000275529,0.000347715,0.00007057519,0.00008081061,0.001367311,0.00003742655,0.00004783739],"category_scores_gemma":[0.0001265405,0.00008463006,0.0001551019,0.0008249538,0.0000791549,0.0009597372,0.0002117899,0.0003057676,0.00002206072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004637397,"about_ca_system_score_gemma":0.00009028284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007862224,"about_ca_topic_score_gemma":2.283905e-7,"domain_scores_codex":[0.9982137,0.0001510753,0.0004969622,0.0001111068,0.0007674494,0.0002597006],"domain_scores_gemma":[0.9978001,0.0002338264,0.0004639001,0.0003774839,0.0009606301,0.0001640352],"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.00001472032,0.0003089862,0.01722276,0.00003113522,0.00007056716,0.00002490398,0.0003749736,0.00004128441,0.00425074,0.9666323,0.002524976,0.008502654],"study_design_scores_gemma":[0.0009855946,0.000960751,0.02244391,0.00003457248,0.000006864796,0.00006319662,0.00005301849,0.0008811419,0.003950406,0.9691533,0.001350031,0.0001172377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8651331,0.0005629861,0.1304257,0.0005377733,0.001020015,0.0002240944,0.000001150429,0.00002334742,0.002071845],"genre_scores_gemma":[0.9933851,0.00005331383,0.006399515,0.00004039529,0.00001626409,0.000001991132,1.369495e-7,0.000008133148,0.00009513245],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.128252,"threshold_uncertainty_score":0.3451114,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008559414,0.0001783114,0.0004689103,0.0003122446,0.0000639219,0.00004749695,0.0002505799,0.0001213119,0.00003030722],"category_scores_gemma":[0.00102022,0.0001587036,0.00007552847,0.0003720639,0.00009466746,0.0003875809,0.00008912951,0.0003718109,0.000009244886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001714157,"about_ca_system_score_gemma":0.00007921737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002046016,"about_ca_topic_score_gemma":0.000009946091,"domain_scores_codex":[0.9983661,0.00007867328,0.0007707427,0.0001327974,0.0003993463,0.0002523666],"domain_scores_gemma":[0.9981304,0.0003825754,0.0007342852,0.0002165381,0.0004051427,0.0001310116],"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.0001157413,0.0006319717,0.003919049,0.0001876686,0.00006512686,0.00009077946,0.004300264,0.000001326969,0.000507021,0.987135,0.001889548,0.001156481],"study_design_scores_gemma":[0.00155816,0.0009669004,0.001545683,0.0001685817,0.00004689775,0.0002636378,0.0004301814,0.0001523553,0.001312927,0.9912116,0.002167611,0.0001754646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9925104,0.0001042658,0.002443956,0.0002377392,0.002393775,0.00015123,0.000001372641,0.00002730351,0.002129954],"genre_scores_gemma":[0.9967177,0.00007983945,0.00265133,0.00004645561,0.0002812092,0.00000247887,2.696535e-7,0.00003177116,0.0001889368],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004207305,"threshold_uncertainty_score":0.6471744,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008962753,0.0002815922,0.0006586671,0.0001141133,0.0002496934,0.00006634471,0.00126021,0.0003353782,0.0000172687],"category_scores_gemma":[0.001097471,0.0001379627,0.0006034763,0.00014196,0.0002876757,0.00004313609,0.0006267959,0.00175937,9.919288e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000136833,"about_ca_system_score_gemma":0.0002652276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003650851,"about_ca_topic_score_gemma":4.778552e-7,"domain_scores_codex":[0.9976088,0.0004008168,0.0007947488,0.000137105,0.0008745066,0.0001839824],"domain_scores_gemma":[0.9940947,0.002061024,0.002272426,0.001008589,0.0005162446,0.00004706889],"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.00006015644,0.0001250786,0.0002150137,0.0002022134,0.0001975672,0.000009776825,0.0009262781,0.00002923707,0.00002835273,0.8655383,0.132621,0.00004704277],"study_design_scores_gemma":[0.0003844071,0.0001622626,0.0003587831,0.0005386995,0.0001899001,0.0001116785,0.0001771383,0.00002092777,0.0006819874,0.9933745,0.003848275,0.0001514868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9831885,0.001891459,0.0004901825,0.001998951,0.008508252,0.0003330334,0.00002223118,0.00001137823,0.003556061],"genre_scores_gemma":[0.9980932,0.0003280674,0.000089357,0.0002947926,0.0001173495,0.000002132188,8.883162e-7,0.00004010471,0.00103413],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1287727,"threshold_uncertainty_score":0.7643684,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002646748,0.0001359763,0.0003424277,0.00004265219,0.0002227054,0.00004964976,0.000671736,0.0001551641,0.0002102167],"category_scores_gemma":[0.0002146585,0.0001283246,0.000222797,0.0000480456,0.00005572875,0.0001130673,0.00009876445,0.0002688552,0.000005917369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007208771,"about_ca_system_score_gemma":0.0001354371,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002410911,"about_ca_topic_score_gemma":1.4138e-7,"domain_scores_codex":[0.9988911,0.00000542236,0.0005069183,0.0001209504,0.0002974301,0.0001782386],"domain_scores_gemma":[0.9976363,0.0001235501,0.00125726,0.0004448808,0.0004152343,0.000122761],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004756586,0.002268906,0.00209871,0.001587537,0.001221653,0.0001705324,0.0008618597,0.0001426656,0.8856544,0.004868111,0.02433559,0.0763144],"study_design_scores_gemma":[0.005212767,0.0002154363,0.000196856,0.0003456924,0.0002025553,0.0002781709,0.0001822613,0.004313459,0.9000803,0.04826681,0.04032519,0.0003804868],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9802652,0.0003415821,0.007781604,0.0008257827,0.0004118136,0.0001368641,0.0002101967,0.00002389577,0.01000308],"genre_scores_gemma":[0.9933358,0.00005825923,0.003634583,0.000008567146,0.0004111461,0.00001066786,0.00001304233,0.00002346515,0.002504504],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07593391,"threshold_uncertainty_score":0.5232925,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009738822,0.0001254895,0.0002224955,0.0005624227,0.0001284796,0.0001368669,0.0007516466,0.00007495494,0.000004120971],"category_scores_gemma":[0.0001723547,0.00009775502,0.0001670321,0.00162126,0.00002479471,0.0002598063,0.0001277152,0.0003127003,0.00007442995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000316703,"about_ca_system_score_gemma":0.00007227073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001457298,"about_ca_topic_score_gemma":2.613705e-7,"domain_scores_codex":[0.9982495,0.00008102423,0.0004189209,0.0001599939,0.0008455534,0.0002449728],"domain_scores_gemma":[0.9985917,0.0002044863,0.0003472492,0.0003420691,0.0003572203,0.0001572495],"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.00001189513,0.0001731045,0.002242557,0.00001924641,0.00002205442,0.000138311,0.0003301635,0.0006488224,0.0008894652,0.9560826,0.03300533,0.006436495],"study_design_scores_gemma":[0.0009697658,0.0009374418,0.009203305,0.0001591578,0.0000112653,0.00004497932,0.00004487802,0.002599669,0.001970636,0.9759935,0.007893673,0.0001717559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9841292,0.0005789664,0.002694151,0.005383388,0.005213968,0.0001121503,9.580712e-7,0.0002671301,0.001620093],"genre_scores_gemma":[0.9983248,0.0001614315,0.0008434341,0.0002256638,0.00001373511,0.000001208211,6.140585e-7,0.00001112764,0.0004180142],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02511166,"threshold_uncertainty_score":0.3986334,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008751794,0.0003353574,0.0008318736,0.0003396206,0.0001331617,0.000151183,0.0006345869,0.0005344982,0.00006907602],"category_scores_gemma":[0.0006306821,0.0002504023,0.0003278732,0.0001478119,0.00006084592,0.00009929247,0.0002917486,0.001673284,0.00001482643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002323498,"about_ca_system_score_gemma":0.0001591692,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004841086,"about_ca_topic_score_gemma":1.309723e-7,"domain_scores_codex":[0.9975194,0.0002679446,0.0009744238,0.0001841651,0.0008200467,0.0002339867],"domain_scores_gemma":[0.9956101,0.000638173,0.001982029,0.000573456,0.001035865,0.0001604373],"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.00005556529,0.0001398584,0.0001031404,0.0005924135,0.0002717189,0.000061189,0.000593608,0.0001953664,0.00001651438,0.9325681,0.06533913,0.00006335357],"study_design_scores_gemma":[0.0005445245,0.0004504341,0.0001702884,0.0007307364,0.0001749201,0.0001485114,0.0001530386,0.0001317959,0.00009111322,0.9921426,0.005002042,0.0002600137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.967033,0.001220355,0.0003621841,0.0001387762,0.02454075,0.0004424209,0.00003006809,0.00004510127,0.006187385],"genre_scores_gemma":[0.9980608,0.0003069752,0.0002218996,0.00007214078,0.000644484,0.000005115146,0.000007772634,0.00005388688,0.000626887],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06033708,"threshold_uncertainty_score":0.9999948,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002815359,0.0003553207,0.001283604,0.0006298118,0.000112414,0.00007802922,0.0007191584,0.0003400253,0.000002063808],"category_scores_gemma":[0.01591736,0.0002657871,0.0003291628,0.00194382,0.000164468,0.0001446112,0.0007843545,0.001981181,0.000001214541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004686951,"about_ca_system_score_gemma":0.0003718621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007262985,"about_ca_topic_score_gemma":0.000005085977,"domain_scores_codex":[0.9960542,0.0004533307,0.001943265,0.0002724809,0.0009848233,0.0002919499],"domain_scores_gemma":[0.9888551,0.00625039,0.003019738,0.0006508273,0.001045271,0.0001786313],"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.0001222857,0.00119088,0.002471403,0.001714486,0.0002023742,0.000029203,0.0004708796,0.00005025519,0.00003565451,0.9905531,0.0005915475,0.002567956],"study_design_scores_gemma":[0.0009376105,0.0004130809,0.002548864,0.0003414986,0.0002175077,0.00003869716,0.0001603599,0.000269311,0.0001972241,0.9944404,0.0002240491,0.0002114012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9517376,0.007188643,0.02760514,0.002177415,0.006905762,0.00171227,0.00003426011,0.00005429931,0.002584557],"genre_scores_gemma":[0.9940151,0.0007648321,0.005001458,0.000008498796,0.0001131585,0.00001415264,7.068188e-7,0.00004207616,0.00003999406],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04227747,"threshold_uncertainty_score":0.9999794,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003234113,0.0001011093,0.0001679793,0.0001916118,0.0000578804,0.0001925785,0.0003560377,0.00004656093,0.000004810622],"category_scores_gemma":[0.00007088161,0.00007587309,0.00007868026,0.0003415913,0.00002172938,0.000513798,0.00008509645,0.0003097639,0.00001460372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006295693,"about_ca_system_score_gemma":0.00005681449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.765603e-7,"about_ca_topic_score_gemma":1.583099e-7,"domain_scores_codex":[0.9991262,0.0000427415,0.0002735167,0.000138413,0.0002805133,0.000138621],"domain_scores_gemma":[0.9993589,0.0001350546,0.0001182731,0.0001594295,0.0001231791,0.0001051536],"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.000007322179,0.000113913,0.0003334835,0.0000440339,0.00003656683,0.0003988898,0.000529207,0.00006769587,0.0001424257,0.951721,0.003414663,0.04319078],"study_design_scores_gemma":[0.0005340668,0.001096091,0.00396258,0.0002558493,0.00001677788,0.0004899442,0.00003412061,0.006002263,0.0009207684,0.9591069,0.02739947,0.0001811977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5574036,0.007113507,0.4186681,0.005638995,0.008196132,0.0001095553,0.000001228149,0.0001616697,0.002707274],"genre_scores_gemma":[0.9976904,0.0002376917,0.001576389,0.000205832,0.0000829949,5.006658e-7,1.442935e-7,0.000007500455,0.0001985272],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4402868,"threshold_uncertainty_score":0.3094015,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}