{"meta":{"query_hash":"1caef02c2311","filters":{"venue":"Journal of Combinatorics"},"cohort_total":21,"direct_labels_cover":0,"predictions_cover":21,"exported":21,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/1caef02c2311","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Combinatorics"},"results":[{"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.018441708194938358,"score_gpt":0.28255513332557425,"score_spread":0.2641134251306359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981391255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8651331,0.00056298607,0.1304257,0.0005377733,0.0010200153,0.00022409445,0.0000011504288,0.000023347422,0.0020718449],"genre_scores_gemma":[0.99338514,0.000053313826,0.0063995146,0.00004039529,0.000016264094,0.0000019911317,1.3694951e-7,0.000008133148,0.000095132455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982137,0.00015107528,0.0004969622,0.00011110685,0.00076744944,0.00025970055],"domain_scores_gemma":[0.9978001,0.00023382636,0.0004639001,0.0003774839,0.00096063013,0.00016403518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007393924,0.00010331047,0.000275529,0.00034771496,0.00007057519,0.000080810605,0.0013673105,0.000037426555,0.000047837388],"category_scores_gemma":[0.00012654054,0.00008463006,0.00015510192,0.0008249538,0.0000791549,0.0009597372,0.0002117899,0.0003057676,0.000022060722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014720321,0.00030898623,0.017222762,0.000031135223,0.000070567155,0.00002490398,0.00037497358,0.00004128441,0.00425074,0.9666323,0.0025249757,0.008502654],"study_design_scores_gemma":[0.0009855946,0.00096075103,0.022443913,0.000034572477,0.0000068647955,0.000063196625,0.00005301849,0.0008811419,0.003950406,0.9691533,0.0013500314,0.00011723772],"about_ca_topic_score_codex":0.000007862224,"about_ca_topic_score_gemma":2.2839055e-7,"teacher_disagreement_score":0.12825203,"about_ca_system_score_codex":0.00004637397,"about_ca_system_score_gemma":0.00009028284,"threshold_uncertainty_score":0.34511137},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics","score_opus":0.09291930515307462,"score_gpt":0.3474541012453438,"score_spread":0.2545347960922692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061413565","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9891684,0.00012179736,0.00046702666,0.0012136438,0.00070771313,0.00012021744,0.000007327001,0.000014238395,0.008179619],"genre_scores_gemma":[0.9991472,0.000027317008,0.00011482785,0.00021219447,0.00012031368,0.000003432107,6.1844236e-7,0.000014854706,0.00035928533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887544,0.00029341324,0.0003134841,0.000045405977,0.00029325808,0.00017902533],"domain_scores_gemma":[0.9966783,0.002370243,0.000391712,0.00025908943,0.00019521562,0.00010542658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023793904,0.00010382123,0.00020022251,0.000038134076,0.0001378935,0.000025411637,0.0002994545,0.0000722682,0.0001449151],"category_scores_gemma":[0.0008511991,0.000060666756,0.00011920008,0.00027835518,0.00004357864,0.00008736172,0.000023860692,0.00041337637,0.000053257903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018531546,0.00031579132,0.007621862,0.0000068123068,0.000040913226,0.0000011837575,0.00030373933,5.7069275e-7,0.00002560952,0.9525897,0.039030492,0.00004479813],"study_design_scores_gemma":[0.0003094661,0.00006929861,0.008769733,0.000022333503,0.00004182086,0.000079542246,0.0001086815,0.0000018190826,0.0007937201,0.9709722,0.01874922,0.00008221196],"about_ca_topic_score_codex":0.000001736224,"about_ca_topic_score_gemma":0.0000010922553,"teacher_disagreement_score":0.020281274,"about_ca_system_score_codex":0.000036114274,"about_ca_system_score_gemma":0.00003494607,"threshold_uncertainty_score":0.24739185},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05795207938737249,"score_gpt":0.3350437176936293,"score_spread":0.27709163830625677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080401458","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96703297,0.0012203553,0.00036218413,0.00013877625,0.02454075,0.00044242092,0.00003006809,0.00004510127,0.006187385],"genre_scores_gemma":[0.9980608,0.00030697515,0.0002218996,0.00007214078,0.000644484,0.0000051151455,0.0000077726345,0.00005388688,0.000626887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751943,0.0002679446,0.00097442383,0.00018416514,0.0008200467,0.00023398675],"domain_scores_gemma":[0.99561006,0.000638173,0.0019820286,0.000573456,0.001035865,0.00016043734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087517936,0.0003353574,0.0008318736,0.00033962063,0.0001331617,0.00015118299,0.0006345869,0.0005344982,0.00006907602],"category_scores_gemma":[0.0006306821,0.00025040234,0.00032787322,0.00014781194,0.000060845923,0.00009929247,0.00029174864,0.0016732835,0.0000148264335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005556529,0.00013985837,0.00010314037,0.00059241353,0.00027171895,0.000061189,0.00059360795,0.00019536642,0.000016514383,0.93256813,0.065339126,0.000063353575],"study_design_scores_gemma":[0.0005445245,0.0004504341,0.00017028842,0.0007307364,0.00017492007,0.0001485114,0.00015303856,0.00013179592,0.00009111322,0.99214256,0.0050020423,0.0002600137],"about_ca_topic_score_codex":0.000004841086,"about_ca_topic_score_gemma":1.3097234e-7,"teacher_disagreement_score":0.06033708,"about_ca_system_score_codex":0.00023234976,"about_ca_system_score_gemma":0.00015916923,"threshold_uncertainty_score":0.9999948},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Adjacency list; Combinatorics; Adjacency matrix; Graph","score_opus":0.009317139015940886,"score_gpt":0.2123947591885158,"score_spread":0.2030776201725749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125110392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917706,0.0004081847,0.0025275752,0.0008428182,0.0026298084,0.000030670068,9.838261e-8,0.00003175453,0.001758447],"genre_scores_gemma":[0.99018323,0.00003275546,0.009547617,0.00007668483,0.000017418639,3.5219702e-7,2.935886e-8,0.000005046071,0.00013687702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991972,0.00002583195,0.00027422913,0.000093107585,0.0002777162,0.00013191809],"domain_scores_gemma":[0.9990514,0.000050488765,0.0002329911,0.0001769708,0.00036757506,0.00012059817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057680625,0.00007612953,0.00014005657,0.000062000254,0.00010842696,0.00018054356,0.00036967333,0.000048210128,0.000004030808],"category_scores_gemma":[0.00033031503,0.00005471767,0.000042026124,0.00020005075,0.00004313482,0.0003928847,0.000113199414,0.00039069497,0.000005430431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004481475,0.00012020803,0.018646523,0.000024241383,0.000014559907,0.00003980663,0.00068581005,0.00000521319,0.011856842,0.96307385,0.0018736272,0.0036548255],"study_design_scores_gemma":[0.0010545464,0.00021993567,0.0063304924,0.00013255778,0.000020904083,0.0010682951,0.00004676009,0.0022459326,0.0062065073,0.9706832,0.01170902,0.00028182825],"about_ca_topic_score_codex":0.000004949022,"about_ca_topic_score_gemma":7.3628127e-7,"teacher_disagreement_score":0.01231603,"about_ca_system_score_codex":0.000006224788,"about_ca_system_score_gemma":0.00005990049,"threshold_uncertainty_score":0.22313218},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Decomposition; Mathematics; Degree (music); Discrete mathematics; Physics","score_opus":0.01095973669627161,"score_gpt":0.22873226548772016,"score_spread":0.21777252879144854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2224352238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9664661,0.0062474236,0.009095682,0.00004864529,0.014102043,0.00021265858,0.000047527574,0.00004924203,0.003730644],"genre_scores_gemma":[0.9991356,0.00045376056,0.00014158215,0.000008049465,0.00013215884,0.000004150514,0.000006195362,0.000033655284,0.0000848359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982819,0.000108295484,0.00094338786,0.00009590602,0.0004110311,0.00015947415],"domain_scores_gemma":[0.99827904,0.00021677348,0.0007000383,0.0002978044,0.00039786915,0.00010845932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005984257,0.00020704984,0.00069129904,0.00046428354,0.000036798436,0.00003549567,0.00033346724,0.00028181222,0.000045509638],"category_scores_gemma":[0.00004485067,0.00020389432,0.00057766365,0.0002358849,0.000030918178,0.00012595014,0.000059005633,0.00090675807,0.000014922642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042045207,0.0013620188,0.012354132,0.0037284954,0.0037852488,0.00020286882,0.0013288041,0.5984731,0.010368865,0.33382928,0.03347346,0.00067329186],"study_design_scores_gemma":[0.0034623172,0.00052440783,0.008825511,0.0023788714,0.00069628714,0.000577441,0.00025145416,0.005649597,0.009661399,0.95305896,0.014024799,0.00088895345],"about_ca_topic_score_codex":0.000002321705,"about_ca_topic_score_gemma":6.323283e-7,"teacher_disagreement_score":0.6192297,"about_ca_system_score_codex":0.00010426008,"about_ca_system_score_gemma":0.00010545005,"threshold_uncertainty_score":0.8314569},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021216610707188912,"score_gpt":0.24872301482640446,"score_spread":0.22750640411921555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2314945607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13773441,0.0076354784,0.81161344,0.023730876,0.01707737,0.00018773883,0.000003921582,0.000060832743,0.0019559353],"genre_scores_gemma":[0.9958108,0.00025480107,0.001551268,0.00034977522,0.0006161986,0.0000012137166,6.904821e-7,0.000010056217,0.0014051988],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857396,0.00010120068,0.00028472583,0.00010993227,0.000608813,0.00032135623],"domain_scores_gemma":[0.99842983,0.00021809417,0.00046934726,0.0004838397,0.00020873173,0.00019013938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009772459,0.00013134055,0.00020080393,0.00008244909,0.00031167528,0.0002469897,0.0012090137,0.00006126253,0.000018898969],"category_scores_gemma":[0.00011190483,0.00006552414,0.000120840254,0.00029696294,0.00003982131,0.00153019,0.0005625233,0.00034038522,0.000017556988],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006758726,0.001590264,0.08343574,0.0001565874,0.00034814375,0.00028863407,0.010846455,0.00015804838,0.0021672875,0.24278277,0.46462417,0.19353433],"study_design_scores_gemma":[0.0017896749,0.00036935273,0.06096164,0.00032570082,0.00007313005,0.001165134,0.0005631698,0.0036300053,0.011657647,0.024355086,0.89446,0.0006494632],"about_ca_topic_score_codex":0.0000020938478,"about_ca_topic_score_gemma":0.0000014745358,"teacher_disagreement_score":0.8580764,"about_ca_system_score_codex":0.00011633015,"about_ca_system_score_gemma":0.000060206108,"threshold_uncertainty_score":0.26719967},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Western Michigan University","keywords":"Mathematics; Combinatorics","score_opus":0.02471838052824164,"score_gpt":0.2767811090525798,"score_spread":0.25206272852433814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2322988435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98751616,0.00018575181,0.0011273728,0.00021122846,0.0013849232,0.000039606533,3.976211e-7,0.000011955461,0.009522585],"genre_scores_gemma":[0.99860436,0.00006300863,0.00089574244,0.00016120987,0.0001486031,2.5357832e-7,6.4024e-8,0.000013919871,0.00011285428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992025,0.00007751265,0.0002794773,0.00006371156,0.00025719524,0.000119600416],"domain_scores_gemma":[0.99850476,0.0008628718,0.00029780949,0.00013510513,0.000111911206,0.000087551096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006746397,0.000098350916,0.00023780794,0.00010905574,0.00014892202,0.000029159564,0.00015177923,0.000067819834,0.0000089590985],"category_scores_gemma":[0.0007451053,0.000070093236,0.00007054545,0.00007893278,0.000045002307,0.000072606534,0.00004122975,0.00027605554,7.35756e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029534604,0.00004356707,0.0018408395,0.00003074753,0.000033197895,0.000007092164,0.00046805487,0.000004205424,0.00004965954,0.99185926,0.0037943497,0.0018395134],"study_design_scores_gemma":[0.0006466296,0.00033797635,0.0017371636,0.00006475,0.00003568751,0.00008109967,0.00008858815,0.000045127643,0.00043883972,0.9914476,0.004987446,0.000089074245],"about_ca_topic_score_codex":2.9914696e-7,"about_ca_topic_score_gemma":1.7608365e-7,"teacher_disagreement_score":0.0110881645,"about_ca_system_score_codex":0.000026367255,"about_ca_system_score_gemma":0.000013278613,"threshold_uncertainty_score":0.28583193},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02443802459285362,"score_gpt":0.2838160518107053,"score_spread":0.2593780272178517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519826203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9402187,0.0017740437,0.011421319,0.001189649,0.037465103,0.003481167,0.00024274547,0.00003792283,0.0041693673],"genre_scores_gemma":[0.9960776,0.000026734262,0.0028700954,0.00002678181,0.00026736446,0.000007842565,0.0000014610084,0.00008976469,0.00063233636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99559534,0.00033132057,0.0020308183,0.00022910655,0.0014865426,0.00032686157],"domain_scores_gemma":[0.98818445,0.0011315392,0.0072970083,0.0019533592,0.0013409902,0.00009265042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012752276,0.00046182208,0.0015743567,0.00014774807,0.00009072042,0.000037436595,0.0028684265,0.00061573775,0.000017038707],"category_scores_gemma":[0.0033299776,0.00026379045,0.0008241027,0.0005473324,0.00021305846,0.000104287705,0.0017948538,0.002230544,7.145881e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022949956,0.0022074375,0.002637711,0.007843645,0.0011487618,0.000010550733,0.0035443911,0.0044059507,0.0016661821,0.9546483,0.021511931,0.00014565024],"study_design_scores_gemma":[0.0014885796,0.00021369736,0.00012742441,0.001921129,0.0005584,0.000091861715,0.000117824595,0.00016606481,0.024655422,0.9687502,0.0016476027,0.00026181224],"about_ca_topic_score_codex":0.0000151762915,"about_ca_topic_score_gemma":0.0000030672736,"teacher_disagreement_score":0.055858936,"about_ca_system_score_codex":0.0003575158,"about_ca_system_score_gemma":0.0017201363,"threshold_uncertainty_score":0.9999814},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02879365904522159,"score_gpt":0.2551754724325314,"score_spread":0.22638181338730984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567969683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98318845,0.0018914589,0.00049018255,0.0019989507,0.008508252,0.0003330334,0.000022231183,0.000011378225,0.0035560608],"genre_scores_gemma":[0.9980932,0.00032806737,0.000089356996,0.00029479258,0.00011734946,0.0000021321885,8.883162e-7,0.00004010471,0.0010341302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760884,0.00040081676,0.0007947488,0.00013710497,0.0008745066,0.00018398238],"domain_scores_gemma":[0.99409467,0.002061024,0.0022724257,0.001008589,0.0005162446,0.00004706889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008962753,0.00028159225,0.00065866706,0.00011411327,0.0002496934,0.000066344706,0.0012602102,0.0003353782,0.0000172687],"category_scores_gemma":[0.001097471,0.00013796268,0.0006034763,0.00014196,0.0002876757,0.000043136093,0.0006267959,0.0017593696,9.919288e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060156435,0.00012507857,0.00021501366,0.00020221336,0.00019756725,0.000009776825,0.00092627807,0.000029237066,0.000028352728,0.8655383,0.13262096,0.000047042773],"study_design_scores_gemma":[0.00038440706,0.00016226262,0.00035878315,0.0005386995,0.0001899001,0.00011167846,0.00017713832,0.00002092777,0.00068198744,0.99337447,0.003848275,0.00015148682],"about_ca_topic_score_codex":0.0000036508507,"about_ca_topic_score_gemma":4.778552e-7,"teacher_disagreement_score":0.12877268,"about_ca_system_score_codex":0.000136833,"about_ca_system_score_gemma":0.00026522763,"threshold_uncertainty_score":0.76436836},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Set (abstract data type); Algorithm; Fullerene; Computer science; Chemistry","score_opus":0.03006367243714537,"score_gpt":0.2987736975752472,"score_spread":0.2687100251381018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588150890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9802652,0.00034158205,0.007781604,0.00082578266,0.00041181355,0.00013686407,0.00021019668,0.000023895765,0.0100030815],"genre_scores_gemma":[0.9933358,0.000058259233,0.0036345825,0.000008567146,0.00041114615,0.000010667857,0.000013042332,0.000023465145,0.0025045038],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99889106,0.00000542236,0.0005069183,0.000120950404,0.00029743006,0.00017823858],"domain_scores_gemma":[0.9976363,0.00012355007,0.00125726,0.00044488083,0.0004152343,0.00012276098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002646748,0.0001359763,0.00034242772,0.00004265219,0.00022270536,0.000049649756,0.000671736,0.00015516415,0.00021021669],"category_scores_gemma":[0.00021465846,0.0001283246,0.00022279704,0.0000480456,0.00005572875,0.00011306735,0.00009876445,0.00026885522,0.0000059173694],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004756586,0.0022689055,0.00209871,0.0015875365,0.001221653,0.00017053244,0.0008618597,0.00014266562,0.8856544,0.0048681106,0.024335587,0.0763144],"study_design_scores_gemma":[0.005212767,0.0002154363,0.00019685595,0.0003456924,0.0002025553,0.00027817092,0.00018226131,0.0043134587,0.9000803,0.048266813,0.04032519,0.00038048677],"about_ca_topic_score_codex":0.0000024109108,"about_ca_topic_score_gemma":1.4138003e-7,"teacher_disagreement_score":0.07593391,"about_ca_system_score_codex":0.000072087714,"about_ca_system_score_gemma":0.0001354371,"threshold_uncertainty_score":0.52329254},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.013092982817670634,"score_gpt":0.27448150736668137,"score_spread":0.26138852454901074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600215958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8215447,0.000413761,0.17543784,0.0014773664,0.00069075474,0.00017361277,0.0000041911735,0.00004474544,0.00021304647],"genre_scores_gemma":[0.99445003,0.00028823808,0.0051015085,0.00006451552,0.000033507564,0.000007851821,6.460786e-7,0.000015439487,0.000038261445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979186,0.00033839917,0.00054583565,0.00028173262,0.00052574516,0.00038967218],"domain_scores_gemma":[0.9975629,0.0011737571,0.0003712672,0.00035465162,0.00029777578,0.00023967207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011133649,0.00017684618,0.00033230468,0.00085916196,0.00019145326,0.0001140636,0.0007994786,0.00009463151,0.0000071532577],"category_scores_gemma":[0.00032301983,0.00013562615,0.000102496386,0.0012363788,0.00013582091,0.0014930809,0.0001836731,0.00039650997,0.000005364472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054111733,0.00036232892,0.024017476,0.000013002482,0.000031777192,0.00014425986,0.00030486952,0.0000043648693,0.005446788,0.9659804,0.00021211599,0.0034285048],"study_design_scores_gemma":[0.0026304715,0.00069191284,0.072574355,0.00011498687,0.0000095592595,0.0002993071,0.000077332006,0.0001066883,0.0009390572,0.9218102,0.00054094195,0.00020515172],"about_ca_topic_score_codex":0.00000777826,"about_ca_topic_score_gemma":0.00003482622,"teacher_disagreement_score":0.17290534,"about_ca_system_score_codex":0.00020151243,"about_ca_system_score_gemma":0.00007255835,"threshold_uncertainty_score":0.5530674},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03985582976514396,"score_gpt":0.2668436785381555,"score_spread":0.22698784877301154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2778252295","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98975706,0.0010803543,0.00058701774,0.00021540423,0.006022596,0.00036079218,0.0000015273339,0.000059208098,0.0019160404],"genre_scores_gemma":[0.9970802,0.00023830569,0.0019789108,0.000038455033,0.00023604624,0.0000033515657,2.5508558e-7,0.000069710484,0.00035476178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973966,0.00013688343,0.0010166976,0.00021160555,0.00086431333,0.00037389158],"domain_scores_gemma":[0.99710065,0.00058203423,0.0009878982,0.0004644794,0.00065230374,0.00021264139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009325884,0.00032379106,0.00089592114,0.00030712038,0.000104858904,0.0000927774,0.0004998861,0.00019403256,0.000022556247],"category_scores_gemma":[0.0010380829,0.00025717643,0.00019560578,0.00045911534,0.000110083194,0.00054679136,0.00016441371,0.000597831,0.000017349685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012653778,0.0004870532,0.003376027,0.0003651826,0.00011587678,0.000029969975,0.0005471579,0.0000036770061,0.003343649,0.99086934,0.00055553776,0.00017998625],"study_design_scores_gemma":[0.00320733,0.00083442166,0.00023682977,0.000307628,0.00010907404,0.00026234324,0.00033903727,0.000074321615,0.0036818313,0.98792195,0.0026992278,0.00032601095],"about_ca_topic_score_codex":0.0000019942506,"about_ca_topic_score_gemma":3.1981673e-7,"teacher_disagreement_score":0.0073231435,"about_ca_system_score_codex":0.000117220385,"about_ca_system_score_gemma":0.00014604091,"threshold_uncertainty_score":0.999988},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04024412573833556,"score_gpt":0.34575451424253767,"score_spread":0.3055103885042021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790566475","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925104,0.00010426579,0.0024439557,0.00023773921,0.0023937747,0.00015122998,0.0000013726411,0.000027303506,0.0021299543],"genre_scores_gemma":[0.9967177,0.00007983945,0.0026513299,0.00004645561,0.0002812092,0.00000247887,2.6965347e-7,0.00003177116,0.00018893676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836606,0.00007867328,0.0007707427,0.0001327974,0.00039934632,0.0002523666],"domain_scores_gemma":[0.99813044,0.00038257535,0.00073428516,0.00021653814,0.00040514272,0.00013101165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008559414,0.00017831141,0.00046891026,0.0003122446,0.0000639219,0.000047496953,0.0002505799,0.000121311896,0.000030307223],"category_scores_gemma":[0.00102022,0.00015870357,0.00007552847,0.0003720639,0.000094667455,0.00038758092,0.00008912951,0.00037181092,0.000009244886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001157413,0.0006319717,0.0039190487,0.0001876686,0.00006512686,0.00009077946,0.004300264,0.0000013269686,0.00050702103,0.987135,0.0018895483,0.0011564809],"study_design_scores_gemma":[0.0015581597,0.00096690044,0.0015456831,0.00016858174,0.00004689775,0.00026363783,0.0004301814,0.0001523553,0.0013129268,0.9912116,0.002167611,0.00017546464],"about_ca_topic_score_codex":0.0000020460157,"about_ca_topic_score_gemma":0.000009946091,"teacher_disagreement_score":0.004207305,"about_ca_system_score_codex":0.00017141571,"about_ca_system_score_gemma":0.00007921737,"threshold_uncertainty_score":0.64717436},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Independence (probability theory); Combinatorics; Star product; Discrete mathematics; Statistics","score_opus":0.005086164802637531,"score_gpt":0.2180778302966756,"score_spread":0.21299166549403806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798961559","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68746305,0.0010354238,0.2956642,0.001218323,0.0053423764,0.000101866935,2.565273e-7,0.00004828876,0.009126226],"genre_scores_gemma":[0.9958934,0.000040140774,0.0033834563,0.00025756154,0.000033257696,1.8266475e-7,4.3741192e-8,0.0000039280367,0.00038803156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989936,0.000032386764,0.00025303403,0.00009639668,0.0004721254,0.00015249243],"domain_scores_gemma":[0.9990217,0.00008049776,0.0002976139,0.00025665597,0.00025295757,0.00009054679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031178814,0.00007526812,0.00016696117,0.0001014947,0.00003018544,0.000055081724,0.0009069185,0.000053093583,0.000016677212],"category_scores_gemma":[0.000050819206,0.00005902878,0.0000736493,0.00031822143,0.00001048285,0.00090772816,0.00011762178,0.00029797928,0.000087823835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055980586,0.00008491235,0.0067837816,0.000007948377,0.0000106130965,0.0000893861,0.0001330411,0.00012757468,0.0006250093,0.9875077,0.00037002945,0.004254399],"study_design_scores_gemma":[0.0009246249,0.0006615666,0.01703543,0.00003450431,0.0000053332083,0.00048536676,0.00003088653,0.0009341977,0.00190966,0.96886826,0.008929452,0.00018073489],"about_ca_topic_score_codex":3.338596e-7,"about_ca_topic_score_gemma":8.1131674e-8,"teacher_disagreement_score":0.30843034,"about_ca_system_score_codex":0.000048249785,"about_ca_system_score_gemma":0.00009788131,"threshold_uncertainty_score":0.24071237},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0689131263917369,"score_gpt":0.3254925588122175,"score_spread":0.2565794324204806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898607378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95173764,0.007188643,0.027605139,0.002177415,0.0069057615,0.0017122702,0.000034260112,0.00005429931,0.0025845573],"genre_scores_gemma":[0.9940151,0.0007648321,0.0050014583,0.000008498796,0.000113158465,0.000014152635,7.0681875e-7,0.000042076164,0.00003999406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960542,0.0004533307,0.0019432651,0.0002724809,0.0009848233,0.00029194987],"domain_scores_gemma":[0.9888551,0.0062503903,0.0030197378,0.0006508273,0.0010452708,0.00017863128],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0028153586,0.00035532066,0.0012836043,0.00062981184,0.000112413974,0.00007802922,0.00071915844,0.0003400253,0.0000020638083],"category_scores_gemma":[0.01591736,0.00026578706,0.00032916275,0.0019438199,0.000164468,0.00014461117,0.0007843545,0.0019811806,0.0000012145414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012228568,0.0011908804,0.0024714032,0.0017144856,0.00020237418,0.000029202996,0.00047087958,0.000050255192,0.000035654506,0.9905531,0.00059154746,0.0025679565],"study_design_scores_gemma":[0.0009376105,0.00041308094,0.0025488643,0.00034149858,0.00021750771,0.000038697162,0.00016035986,0.00026931104,0.00019722406,0.9944404,0.0002240491,0.00021140119],"about_ca_topic_score_codex":0.000007262985,"about_ca_topic_score_gemma":0.0000050859767,"teacher_disagreement_score":0.042277467,"about_ca_system_score_codex":0.00046869513,"about_ca_system_score_gemma":0.00037186214,"threshold_uncertainty_score":0.99997944},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Diagonal; Combinatorics; Pure mathematics; Discrete mathematics; Geometry","score_opus":0.04701194548901836,"score_gpt":0.3067420525034614,"score_spread":0.25973010701444305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963489061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9727419,0.0024195404,0.004772385,0.00060257624,0.01786677,0.00020237966,0.000004051019,0.000053173182,0.0013372214],"genre_scores_gemma":[0.9953985,0.00012233575,0.0022633777,0.00019267334,0.0013570692,0.0000038502876,0.0000017205335,0.000062578365,0.00059786654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715984,0.00019229835,0.0009775243,0.00014105061,0.0009579668,0.00057131395],"domain_scores_gemma":[0.9973051,0.00040987102,0.0010252773,0.00036677474,0.0004700305,0.00042296795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010014611,0.00031581116,0.0007209334,0.00017006589,0.0001427061,0.00007082701,0.0005363711,0.00026448088,0.000269765],"category_scores_gemma":[0.00028302168,0.0002520588,0.0003865486,0.00034082623,0.00004578879,0.0004811609,0.00013372292,0.00062143075,0.000013821413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117506774,0.0006653118,0.0011801211,0.000032805114,0.00020558204,0.000021076195,0.0003059485,0.0000040877558,0.00024957018,0.9879998,0.008733075,0.00048514028],"study_design_scores_gemma":[0.0027885383,0.00028775466,0.0038914457,0.000027578184,0.00021673625,0.00014564637,0.000016274886,0.00003740445,0.0008092199,0.97635543,0.015124922,0.00029904486],"about_ca_topic_score_codex":0.000006280374,"about_ca_topic_score_gemma":1.850167e-7,"teacher_disagreement_score":0.022656625,"about_ca_system_score_codex":0.00023476101,"about_ca_system_score_gemma":0.00013263439,"threshold_uncertainty_score":0.99999315},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Dimension (graph theory); Latin square; Combinatorics; Packing dimension; Minkowski–Bouligand dimension; Mathematical analysis; Biology","score_opus":0.008669537047505128,"score_gpt":0.24530354476894012,"score_spread":0.236634007721435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963914152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99602526,0.0009312577,0.00028449224,0.00012808855,0.001446763,0.000038325856,6.4069525e-7,0.0000258298,0.0011193376],"genre_scores_gemma":[0.99965996,0.000023492385,0.00014431422,0.000034021967,0.00009675821,6.004738e-7,1.736246e-7,0.00001724621,0.000023448305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999044,0.00010766453,0.00040314416,0.00007048516,0.0001999177,0.00017478026],"domain_scores_gemma":[0.9993737,0.00022491976,0.00006122133,0.00010401785,0.00012645345,0.00010970077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069653994,0.000109711684,0.00023318734,0.00023431788,0.00007913129,0.000030533716,0.00009104196,0.000081051396,0.000009042989],"category_scores_gemma":[0.0001693183,0.00009443815,0.000041143725,0.00018242875,0.00005774814,0.00018461615,0.000025219826,0.00037669833,0.0000051476572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001467826,0.0004111856,0.05444205,0.00047327243,0.00012152162,0.0004522506,0.011355166,0.00049951574,0.019550921,0.8982185,0.010314293,0.0040145],"study_design_scores_gemma":[0.004989834,0.0022463403,0.07638163,0.001909758,0.00013965133,0.0013179275,0.0033449929,0.018962698,0.0091947075,0.85883135,0.021512942,0.0011681756],"about_ca_topic_score_codex":0.0000048934207,"about_ca_topic_score_gemma":0.0000027723584,"teacher_disagreement_score":0.039387196,"about_ca_system_score_codex":0.000038064743,"about_ca_system_score_gemma":0.000011270674,"threshold_uncertainty_score":0.3851076},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010756941265392197,"score_gpt":0.2823427095537012,"score_spread":0.27158576828830905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963917402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9903763,0.00038917369,0.00012706465,0.00025656715,0.0007854906,0.000047428755,0.0000074696945,0.0000020452974,0.008008462],"genre_scores_gemma":[0.9991097,0.000013894894,0.00017921669,0.000026493884,0.00037877067,5.7840674e-7,0.000001595661,0.000011903012,0.00027787738],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9990612,0.000072295974,0.00042265342,0.000044222863,0.00018173434,0.0002178932],"domain_scores_gemma":[0.9992296,0.00011494014,0.00026182673,0.0001205867,0.00014420383,0.00012881524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048566796,0.00009291145,0.00027395602,0.000120293145,0.000058618163,0.000017358117,0.0001476029,0.000036964284,0.00015497196],"category_scores_gemma":[0.000028019156,0.00008155281,0.00014228236,0.00023769237,0.000028135213,0.00021809909,0.00004201724,0.00029034744,0.000007745581],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025383042,0.00089747517,0.75466675,0.000012837926,0.00010588475,0.000002722642,0.0015334527,0.000109623186,0.0016621149,0.23894857,0.0012182206,0.00081699376],"study_design_scores_gemma":[0.018311024,0.0025500923,0.42184857,0.0010139634,0.0007998861,0.0002155231,0.06338325,0.0010137116,0.0879078,0.13518122,0.26526546,0.0025095153],"about_ca_topic_score_codex":0.00012871224,"about_ca_topic_score_gemma":0.0000011457063,"teacher_disagreement_score":0.33281818,"about_ca_system_score_codex":0.000048029957,"about_ca_system_score_gemma":0.00012235735,"threshold_uncertainty_score":0.33256269},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015088871495038923,"score_gpt":0.2742597223041571,"score_spread":0.2591708508091182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119325883","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31781828,0.004451291,0.6720901,0.0013405576,0.0018289556,0.000112407986,4.0104896e-7,0.000030880907,0.0023271102],"genre_scores_gemma":[0.9922314,0.0003100072,0.007111156,0.000077966346,0.000021109981,0.0000011784009,1.6379974e-7,0.0000095774785,0.00023739939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981455,0.00026838193,0.0004783542,0.00015925316,0.0006564299,0.00029205205],"domain_scores_gemma":[0.9983037,0.00034920944,0.00024283773,0.00040571063,0.00055929384,0.00013923399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014977743,0.00010229566,0.000311683,0.00040330656,0.000068138565,0.00010302818,0.0008587758,0.000059074544,0.000005822451],"category_scores_gemma":[0.00046131216,0.00009331008,0.0001586865,0.0017521831,0.000039692495,0.0007133702,0.00021028354,0.0005106025,0.0000039166343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045711204,0.00015280655,0.0031093047,0.000016677637,0.000022057076,0.0012765554,0.00026882457,0.00044864783,0.0025559352,0.9884312,0.00034179224,0.0033304668],"study_design_scores_gemma":[0.0028117548,0.00011376215,0.0012623399,0.000071911665,0.000004037342,0.00032754836,0.00004837183,0.00071014627,0.010380358,0.982019,0.0021419409,0.00010882754],"about_ca_topic_score_codex":9.2938706e-7,"about_ca_topic_score_gemma":0.0000010494177,"teacher_disagreement_score":0.67441314,"about_ca_system_score_codex":0.00010110331,"about_ca_system_score_gemma":0.0002930379,"threshold_uncertainty_score":0.38050747},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02611686496365846,"score_gpt":0.25391061871910264,"score_spread":0.2277937537554442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204189941","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9841292,0.0005789664,0.002694151,0.005383388,0.0052139685,0.0001121503,9.580712e-7,0.00026713012,0.0016200929],"genre_scores_gemma":[0.99832475,0.00016143148,0.0008434341,0.00022566383,0.000013735108,0.0000012082108,6.140585e-7,0.0000111276395,0.0004180142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99824953,0.00008102423,0.00041892094,0.00015999391,0.0008455534,0.0002449728],"domain_scores_gemma":[0.9985917,0.0002044863,0.0003472492,0.00034206908,0.0003572203,0.00015724948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097388215,0.00012548955,0.00022249548,0.00056242273,0.00012847963,0.00013686695,0.0007516466,0.000074954936,0.000004120971],"category_scores_gemma":[0.00017235466,0.00009775502,0.0001670321,0.0016212598,0.000024794706,0.0002598063,0.00012771518,0.00031270026,0.000074429954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000118951275,0.00017310452,0.0022425565,0.000019246409,0.000022054417,0.00013831102,0.00033016354,0.0006488224,0.0008894652,0.9560826,0.033005334,0.0064364946],"study_design_scores_gemma":[0.00096976577,0.0009374418,0.009203305,0.00015915779,0.000011265295,0.00004497932,0.00004487802,0.0025996687,0.0019706357,0.97599345,0.007893673,0.00017175595],"about_ca_topic_score_codex":0.0000014572979,"about_ca_topic_score_gemma":2.613705e-7,"teacher_disagreement_score":0.02511166,"about_ca_system_score_codex":0.000031670297,"about_ca_system_score_gemma":0.000072270734,"threshold_uncertainty_score":0.39863342},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Interval (graph theory); Mathematics; Combinatorics","score_opus":0.011817660074200402,"score_gpt":0.2638531070008877,"score_spread":0.25203544692668733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402305041","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55740356,0.0071135066,0.41866806,0.005638995,0.008196132,0.000109555294,0.0000012281491,0.00016166971,0.0027072737],"genre_scores_gemma":[0.99769044,0.00023769174,0.001576389,0.00020583201,0.0000829949,5.006658e-7,1.4429345e-7,0.0000075004555,0.00019852724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991262,0.0000427415,0.00027351666,0.00013841302,0.00028051334,0.00013862102],"domain_scores_gemma":[0.9993589,0.00013505464,0.00011827307,0.00015942953,0.00012317907,0.00010515356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032341125,0.000101109275,0.00016797926,0.0001916118,0.000057880396,0.00019257852,0.0003560377,0.00004656093,0.000004810622],"category_scores_gemma":[0.00007088161,0.00007587309,0.000078680256,0.00034159125,0.000021729384,0.000513798,0.00008509645,0.0003097639,0.000014603719],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007322179,0.00011391295,0.0003334835,0.0000440339,0.000036566835,0.00039888982,0.000529207,0.000067695866,0.00014242572,0.951721,0.003414663,0.043190785],"study_design_scores_gemma":[0.00053406676,0.0010960908,0.00396258,0.00025584927,0.00001677788,0.0004899442,0.00003412061,0.006002263,0.00092076836,0.95910686,0.027399475,0.00018119774],"about_ca_topic_score_codex":2.765603e-7,"about_ca_topic_score_gemma":1.5830989e-7,"teacher_disagreement_score":0.44028684,"about_ca_system_score_codex":0.00006295693,"about_ca_system_score_gemma":0.000056814486,"threshold_uncertainty_score":0.30940148},"labels":[],"label_agreement":null}]}