{"meta":{"query_hash":"ad4f33e5fcfd","filters":{"venue":"Discrete Mathematics & Theoretical Computer Science"},"cohort_total":246,"direct_labels_cover":0,"predictions_cover":246,"exported":246,"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/ad4f33e5fcfd","api":"https://metacan.xera.ac/api/v1/cohort?venue=Discrete+Mathematics+%26+Theoretical+Computer+Science"},"results":[{"id":"W100764105","doi":"10.46298/dmtcs.3484","title":"Around the root of random multidimensional quadtrees","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arity; Root (linguistics); Mathematics; Point (geometry); Computer science; Statistics; Algorithm; Combinatorics; Geometry","score_opus":0.010048296120503342,"score_gpt":0.2434762852402676,"score_spread":0.23342798911976426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W100764105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016837165,0.00003663074,0.97606474,0.0010433941,0.0003249905,0.0002756991,0.000005854106,0.00009603095,0.005315492],"genre_scores_gemma":[0.6440509,0.0000013006313,0.3557251,0.00007604763,0.000095594754,0.0000071463933,0.00000294763,0.0000068237937,0.000034137847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972073,0.000082469254,0.00051655044,0.00053575885,0.0011729422,0.0004850131],"domain_scores_gemma":[0.99753755,0.00075055927,0.00019337147,0.0012568376,0.00016513141,0.00009652161],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0020704125,0.00022258874,0.00029671268,0.00014257198,0.00041660407,0.0004960223,0.0033037572,0.00003364416,0.000025395306],"category_scores_gemma":[0.00009479919,0.00013050299,0.00013013562,0.00092835363,0.0027592075,0.000726109,0.0017586119,0.00014165213,0.000044409866],"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.0000035572998,0.00010332471,0.000029341903,0.000017198008,0.0000075631183,0.0000047846993,0.00024993467,0.00026719572,0.00038719384,0.9965455,0.00018405724,0.0022003783],"study_design_scores_gemma":[0.00032504485,0.00004943354,0.0002488884,0.000034658227,0.000010874289,0.000010300572,0.000030926858,0.6744703,0.001594629,0.3229311,0.00014335781,0.00015050342],"about_ca_topic_score_codex":0.0000113971155,"about_ca_topic_score_gemma":0.0000027641763,"teacher_disagreement_score":0.6742031,"about_ca_system_score_codex":0.000018496476,"about_ca_system_score_gemma":0.000054430533,"threshold_uncertainty_score":0.9999547},"labels":[],"label_agreement":null},{"id":"W103594606","doi":"10.46298/dmtcs.3625","title":"Affine and toric arrangements","year":2008,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"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":"National Security Agency","keywords":"Hyperplane; Mathematics; Affine transformation; Intersection (aeronautics); Combinatorics; Lattice (music); Affine space; Pure mathematics; Cartography; Geography; Physics","score_opus":0.023670483493034612,"score_gpt":0.28486519984643116,"score_spread":0.2611947163533965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W103594606","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08231687,0.0011091663,0.8900515,0.0018905886,0.0042599267,0.0012082183,0.000033432025,0.00030501906,0.018825317],"genre_scores_gemma":[0.4002204,0.0003046819,0.597197,0.00016517211,0.00073028007,0.000035461828,0.0000026887717,0.000114563205,0.00122978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99377126,0.00017887594,0.0013224473,0.0011891245,0.001957735,0.0015805751],"domain_scores_gemma":[0.994705,0.0017419022,0.00050176086,0.0016839952,0.0005126032,0.0008547288],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0021069068,0.00085008563,0.0011708674,0.0003156364,0.001211647,0.0003767434,0.00172184,0.00027352638,0.00063561316],"category_scores_gemma":[0.0015082038,0.0007659345,0.00022284634,0.001498796,0.010893845,0.0008752424,0.0018903703,0.0006573714,0.00031467545],"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.000013635582,0.0006576103,0.000023049217,0.00085038214,0.000055452456,0.00010321325,0.0063594873,0.000015998354,0.00029294266,0.9878072,0.0005534,0.0032676435],"study_design_scores_gemma":[0.00082709023,0.0003929814,0.000029537321,0.0007006869,0.00015525175,0.00059823017,0.00020671259,0.14024219,0.0009299125,0.85428363,0.00084366516,0.0007901203],"about_ca_topic_score_codex":0.0000038921075,"about_ca_topic_score_gemma":8.150471e-7,"teacher_disagreement_score":0.31790352,"about_ca_system_score_codex":0.00026249117,"about_ca_system_score_gemma":0.00022364217,"threshold_uncertainty_score":0.9994792},"labels":[],"label_agreement":null},{"id":"W10847438","doi":"10.46298/dmtcs.3433","title":"Minor-monotone crossing number","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","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":"Mathematics; Minor (academic); Combinatorics; Monotone polygon; Crossing number (knot theory); Graph; Graph minor; Discrete mathematics; Line graph; Voltage graph; Geometry; Geography","score_opus":0.013274412245565321,"score_gpt":0.28282787796421127,"score_spread":0.26955346571864597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W10847438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04020739,0.000029751001,0.9494058,0.0013139352,0.00037046452,0.00018648685,0.0000017389842,0.00022059181,0.008263865],"genre_scores_gemma":[0.5293097,9.014068e-7,0.46993178,0.0005055004,0.00019752949,0.000006515888,0.0000012622266,0.0000070708406,0.00003973472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711293,0.000058540685,0.00048699608,0.00072628143,0.0010040861,0.0006111717],"domain_scores_gemma":[0.9981653,0.000280368,0.00013500742,0.0008417351,0.00027081702,0.00030674116],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013517801,0.00025290795,0.00025300603,0.00017660572,0.00090396195,0.0019109265,0.0019108759,0.00006132299,0.00014378526],"category_scores_gemma":[0.00011384789,0.00021309438,0.00011133395,0.0013195268,0.0016909759,0.0013170041,0.0009040954,0.00018599999,0.00050072564],"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.0000018661622,0.00009145149,0.000023036158,0.000012239483,0.0000050989474,0.0000039953884,0.0012598614,0.0014807144,0.0006314737,0.9720851,0.000102912694,0.02430226],"study_design_scores_gemma":[0.00017229299,0.00003918131,0.00014725223,0.000029433533,0.000005613063,0.00007999376,0.000010567654,0.7957452,0.0048175026,0.19786067,0.00083115464,0.00026111823],"about_ca_topic_score_codex":0.0000010552359,"about_ca_topic_score_gemma":6.157539e-7,"teacher_disagreement_score":0.7942645,"about_ca_system_score_codex":0.00007465031,"about_ca_system_score_gemma":0.0001942039,"threshold_uncertainty_score":0.9991252},"labels":[],"label_agreement":null},{"id":"W112721313","doi":"10.46298/dmtcs.412","title":"Properties of the extremal infinite smooth words","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; De Bruijn sequence; Alphabet; Fibonacci number; Combinatorics; Mathematics; Graph; De Bruijn graph; Word (group theory); Sequence (biology); Reduction (mathematics); Order (exchange); Construct (python library); Discrete mathematics; Computer science","score_opus":0.01691437624846669,"score_gpt":0.24090651037820063,"score_spread":0.22399213412973393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W112721313","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.16078603,0.000052786032,0.833048,0.00047439773,0.0004585006,0.00022661893,0.0000013738545,0.00012961421,0.0048227133],"genre_scores_gemma":[0.84068924,0.0000018064758,0.15892299,0.00028757085,0.00006466216,0.000003765893,1.4045624e-7,0.0000118652915,0.000017987571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685365,0.00008022534,0.00063141197,0.00053770316,0.0011963114,0.0007006763],"domain_scores_gemma":[0.9973918,0.00033603644,0.00024337816,0.0016393438,0.00019396172,0.00019544593],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0036523815,0.00025776797,0.0003182593,0.00017669551,0.00040752877,0.00035196223,0.0046479194,0.000067029476,0.000024526906],"category_scores_gemma":[0.00023292954,0.00014557861,0.00016943633,0.0015559552,0.0041966983,0.000551652,0.00224115,0.00023982632,0.000021882815],"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.0000042981496,0.00007520634,0.000047374087,0.000043151107,0.000005701876,0.0000034379404,0.0030043656,0.000019924579,0.008013913,0.9807922,0.0000095787545,0.007980839],"study_design_scores_gemma":[0.0002202388,0.000103186016,0.000906953,0.0003465257,0.000013515434,0.00004925359,0.00019744941,0.49451327,0.070254534,0.43296748,0.00007108102,0.00035650964],"about_ca_topic_score_codex":0.0000025626894,"about_ca_topic_score_gemma":0.0000010909441,"teacher_disagreement_score":0.6799032,"about_ca_system_score_codex":0.000036371002,"about_ca_system_score_gemma":0.00014327676,"threshold_uncertainty_score":0.9985133},"labels":[],"label_agreement":null},{"id":"W115542354","doi":"10.46298/dmtcs.291","title":"An Efficient Algorithm for the Maximum Distance Problem","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Time complexity; Scalability; Scheduling (production processes); Preprocessor; Computer science; Artificial intelligence; Mathematical optimization","score_opus":0.010378687990143624,"score_gpt":0.2578276345565877,"score_spread":0.24744894656644406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W115542354","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000337063,0.000018260778,0.99528664,0.0015499698,0.00040961488,0.00068403303,0.0000066294315,0.00023017728,0.0014775886],"genre_scores_gemma":[0.29961258,0.000006174133,0.69999325,0.00025051876,0.00007081545,0.000044083652,0.0000018206185,0.000010223283,0.000010531913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976174,0.00005267347,0.00038620265,0.0006591571,0.0007195211,0.0005650396],"domain_scores_gemma":[0.99779683,0.00046399847,0.0001340574,0.0010897408,0.00027701544,0.0002383287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001530837,0.00022345314,0.00019998805,0.00010943551,0.000917539,0.0010292819,0.002289045,0.00004717733,0.000046406672],"category_scores_gemma":[0.00005458309,0.00014441971,0.00010159302,0.00096408586,0.0016782541,0.000487412,0.00034222574,0.0001433723,0.000021827667],"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.0000021048409,0.00006662066,0.0000055090104,0.0000071224845,0.0000042227084,0.0000020262162,0.0007233671,0.0048801564,0.000031211635,0.82421994,0.00001312346,0.17004457],"study_design_scores_gemma":[0.00019543746,0.000099057834,0.00005442738,0.000022750057,0.000008906734,0.00004808854,0.00006470961,0.8325724,0.00011466613,0.16638216,0.0002452996,0.00019210468],"about_ca_topic_score_codex":0.0000013462709,"about_ca_topic_score_gemma":0.0000012554246,"teacher_disagreement_score":0.8276922,"about_ca_system_score_codex":0.000052711628,"about_ca_system_score_gemma":0.000100375204,"threshold_uncertainty_score":0.9925389},"labels":[],"label_agreement":null},{"id":"W120212917","doi":"10.46298/dmtcs.308","title":"The Cycles of the Multiway Perfect Shuffle Permutation","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Permutation (music); Mathematics; Combinatorics; Deck; Discrete mathematics; Space (punctuation); Algorithm; Computer science","score_opus":0.013691370650729482,"score_gpt":0.2519285687985683,"score_spread":0.2382371981478388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W120212917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018555736,0.00009960022,0.9762758,0.0014417237,0.0004979498,0.0002680295,0.0000045819,0.000074458214,0.0027821297],"genre_scores_gemma":[0.8523432,0.00001545708,0.14744438,0.00009867031,0.000052099575,0.00000878684,3.762141e-7,0.000008019193,0.000028999666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751365,0.00013059918,0.000413109,0.00045136502,0.0010515766,0.0004396849],"domain_scores_gemma":[0.99718684,0.0007215251,0.00020052415,0.0015828174,0.00018523789,0.00012307959],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012688126,0.00018871677,0.00019568828,0.00005941898,0.0011895157,0.0005748364,0.0042260345,0.00004323033,0.000033023567],"category_scores_gemma":[0.00024899357,0.0000897381,0.0001331498,0.00080976996,0.0027986625,0.00053931214,0.001880978,0.00019910237,0.00003759225],"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":[9.746948e-7,0.000057232504,0.000021682372,0.000013134421,0.000004227333,9.857946e-7,0.0018666787,0.00011446059,0.00057043065,0.9760778,0.000119185606,0.021153217],"study_design_scores_gemma":[0.00010912532,0.000054093616,0.0003906705,0.00006119086,0.0000063196553,0.000019193774,0.00005115407,0.88158864,0.002632379,0.11482771,0.00013239328,0.00012714101],"about_ca_topic_score_codex":0.0000027040023,"about_ca_topic_score_gemma":6.7704343e-7,"teacher_disagreement_score":0.8814742,"about_ca_system_score_codex":0.000027538772,"about_ca_system_score_gemma":0.00003743158,"threshold_uncertainty_score":0.9999151},"labels":[],"label_agreement":null},{"id":"W143189219","doi":"10.46298/dmtcs.272","title":"P_4-Colorings and P_4-Bipartite Graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Cograph; Bipartite graph; Strong perfect graph theorem; Indifference graph; Chordal graph; Discrete mathematics; Triangle-free graph; Pathwidth; Split graph; 1-planar graph; Pancyclic graph; Graph; Line graph","score_opus":0.01926560107359048,"score_gpt":0.2934408747580528,"score_spread":0.2741752736844623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W143189219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09199325,0.00009458887,0.8978991,0.001086673,0.0002021413,0.00034107256,0.0000019508755,0.00030701372,0.008074214],"genre_scores_gemma":[0.6751796,0.00004952803,0.32443634,0.00021394018,0.00003498916,0.000024537772,5.272323e-7,0.000018040038,0.000042530442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957457,0.00012182515,0.0004989506,0.0011363892,0.0013001055,0.0011969982],"domain_scores_gemma":[0.99681175,0.00064321025,0.00013355937,0.001506227,0.0002560059,0.00064922293],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0024499441,0.00036416895,0.000409655,0.0004504829,0.00076306897,0.0010086066,0.00334593,0.00008068215,0.00005683827],"category_scores_gemma":[0.00026804322,0.00029074727,0.000118944845,0.002410369,0.005400553,0.0014149753,0.0025159123,0.00038260838,0.00010152986],"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.00000790499,0.00006951632,0.00017342705,0.000025895353,0.000008251721,0.000041255422,0.0009809888,0.000028196544,0.0006046637,0.98806846,0.00001428133,0.009977173],"study_design_scores_gemma":[0.000198745,0.00013940973,0.0002345436,0.000051025254,0.0000058075316,0.00014611163,0.00003813,0.3097387,0.000982862,0.68795365,0.00022077742,0.00029025783],"about_ca_topic_score_codex":0.000001751838,"about_ca_topic_score_gemma":8.471645e-7,"teacher_disagreement_score":0.5831863,"about_ca_system_score_codex":0.000045284927,"about_ca_system_score_gemma":0.0000822692,"threshold_uncertainty_score":0.99995446},"labels":[],"label_agreement":null},{"id":"W1484933608","doi":"10.46298/dmtcs.2084","title":"Toppling numbers of complete and random graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"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":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Random graph; Discrete mathematics; Wheel graph; Graph power; Line graph","score_opus":0.01691383692396501,"score_gpt":0.28482182467055134,"score_spread":0.2679079877465863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484933608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036849465,0.000025470412,0.95759815,0.0002875221,0.00013876513,0.00027085622,0.0000025519587,0.00010532678,0.0047218795],"genre_scores_gemma":[0.6086377,0.000004996301,0.3912442,0.00007738001,0.000016766397,0.0000061844544,3.9175114e-7,0.000008897868,0.0000034963834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698097,0.00016717345,0.0004995567,0.00071205694,0.0009937081,0.0006465644],"domain_scores_gemma":[0.99672097,0.0013677254,0.00016778284,0.0011711133,0.00023565926,0.0003367698],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0034037095,0.00024367568,0.00046693778,0.00029384784,0.00037924922,0.00031639545,0.002507603,0.000051282965,0.0000170746],"category_scores_gemma":[0.00036491142,0.00019039381,0.00011157727,0.001168894,0.00504647,0.0005444368,0.0015439206,0.00022797287,0.00001404326],"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.000009682182,0.00003502154,0.000048773054,0.000057592108,0.000007284431,0.0000017803338,0.0009778265,0.00007744362,0.0019437639,0.9904145,0.0000037920013,0.0064225523],"study_design_scores_gemma":[0.0003235946,0.000080552876,0.000047287504,0.00004797508,0.000004278945,0.000019061083,0.000021765865,0.4514944,0.0012301055,0.54656947,0.00001870116,0.00014282594],"about_ca_topic_score_codex":0.0000016305702,"about_ca_topic_score_gemma":3.8826803e-7,"teacher_disagreement_score":0.57178825,"about_ca_system_score_codex":0.000016102793,"about_ca_system_score_gemma":0.00004351389,"threshold_uncertainty_score":0.99766123},"labels":[],"label_agreement":null},{"id":"W1494929213","doi":"10.46298/dmtcs.6397","title":"Normal Supercharacter Theory","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":1,"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":"Computer science","score_opus":0.06190951221591014,"score_gpt":0.33735622035149315,"score_spread":0.27544670813558303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494929213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06637604,0.000038278522,0.9049384,0.0021659685,0.0010012714,0.0015049803,0.00015102011,0.000675327,0.02314872],"genre_scores_gemma":[0.6739573,0.000015400537,0.32428417,0.00061992765,0.0007085914,0.00010381285,0.000044871813,0.00017441771,0.000091520764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9910154,0.0007840597,0.001418551,0.00200658,0.0030268931,0.0017485131],"domain_scores_gemma":[0.99066144,0.0042058555,0.0004179283,0.0030821566,0.0006162086,0.001016406],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.008836475,0.0010485312,0.0014522454,0.0005053374,0.0006237357,0.0013667566,0.006218035,0.0005107069,0.0015460692],"category_scores_gemma":[0.0035519288,0.00083896954,0.00060345477,0.0010064193,0.008683225,0.00039842282,0.01248861,0.0028449749,0.00067981536],"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.000068054745,0.00023583752,0.000008079422,0.0008749508,0.00008207323,0.00007812066,0.005967125,0.000016337146,0.000502985,0.99080074,0.00033337923,0.0010323414],"study_design_scores_gemma":[0.00025418014,0.00017255913,0.00002188781,0.00045505102,0.000108953085,0.0000504043,0.0001915819,0.17252135,0.0011661778,0.8241743,0.00006332324,0.00082024076],"about_ca_topic_score_codex":0.0000019120873,"about_ca_topic_score_gemma":5.8174953e-7,"teacher_disagreement_score":0.60758126,"about_ca_system_score_codex":0.00019959381,"about_ca_system_score_gemma":0.00052035763,"threshold_uncertainty_score":0.9996699},"labels":[],"label_agreement":null},{"id":"W1496438519","doi":"10.46298/dmtcs.464","title":"Centerpoint theorems for wedges","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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":"Natural Sciences and Engineering Research Council of Canada; Universitat Politècnica de Catalunya","keywords":"Mathematics; Combinatorics; Point (geometry); Set (abstract data type); Discrete mathematics; Geometry; Computer science","score_opus":0.013485989728800706,"score_gpt":0.2728398253834265,"score_spread":0.2593538356546258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1496438519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036765304,0.000033365857,0.9881951,0.0029734836,0.00055106194,0.00042671437,0.0000042639813,0.00020973397,0.003929696],"genre_scores_gemma":[0.535729,0.000002267437,0.4634694,0.00063223025,0.00013181708,0.000010379812,0.0000033687688,0.0000051338925,0.000016425598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975726,0.000046031477,0.00042161284,0.0006893806,0.00069972046,0.0005706323],"domain_scores_gemma":[0.99814403,0.00038892656,0.0001254861,0.00076231745,0.00032518202,0.00025403776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015394798,0.00023890384,0.00026094285,0.00023512216,0.00052234036,0.00077608053,0.0019795764,0.000051840267,0.000019876385],"category_scores_gemma":[0.00018868968,0.00018744644,0.00014970542,0.0009161085,0.00070321007,0.0006836163,0.00035012976,0.00011784966,0.000035312194],"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.0000050556173,0.00010282859,0.0000011516478,0.000012469355,0.0000042171323,0.0000017046381,0.00061383384,0.00037605796,0.0012209204,0.9665625,0.00013642732,0.030962842],"study_design_scores_gemma":[0.0001480268,0.00020057222,0.000054198368,0.000022731727,0.0000041937988,0.000017501863,0.000008214487,0.4995305,0.0031081429,0.49659684,0.00016048258,0.00014859674],"about_ca_topic_score_codex":1.811634e-7,"about_ca_topic_score_gemma":1.0396772e-7,"teacher_disagreement_score":0.53205246,"about_ca_system_score_codex":0.00004399681,"about_ca_system_score_gemma":0.00010872417,"threshold_uncertainty_score":0.7643844},"labels":[],"label_agreement":null},{"id":"W1498272613","doi":"10.46298/dmtcs.1258","title":"List circular backbone colouring","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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":"Pacific Institute for the Mathematical Sciences","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Chromatic scale; Bounded function; Graph; Discrete mathematics","score_opus":0.010712726340983204,"score_gpt":0.2351696714341264,"score_spread":0.2244569450931432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498272613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03472332,0.000029075936,0.9547432,0.0011237842,0.000510944,0.00018139774,8.51236e-7,0.00038565125,0.00830176],"genre_scores_gemma":[0.6243374,0.0000018000798,0.37514672,0.00045923304,0.000024091663,0.0000065425556,6.14535e-7,0.0000116718065,0.000011947661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655545,0.00011564404,0.0005163363,0.000904867,0.0011067053,0.0008010161],"domain_scores_gemma":[0.9971581,0.00037539945,0.00015345417,0.0016020875,0.00026181887,0.00044912475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031198491,0.00029182693,0.0003690121,0.00024595673,0.00066160224,0.00096547883,0.0029509736,0.00007595677,0.000041972096],"category_scores_gemma":[0.0002856081,0.00023057399,0.0001376912,0.0012623701,0.00229887,0.0005312877,0.0014265525,0.00025084638,0.00018080225],"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":[9.4884297e-7,0.00007050846,0.00001750517,0.000035929443,0.0000056243243,0.0000053333656,0.00059153617,0.00013671294,0.002567143,0.99447215,0.000054179232,0.0020424323],"study_design_scores_gemma":[0.00014058073,0.00008051968,0.000028224611,0.000057593057,0.0000057647435,0.000029944884,0.0000075750304,0.51365215,0.0016185369,0.48408374,0.00009277238,0.00020259863],"about_ca_topic_score_codex":0.0000028546333,"about_ca_topic_score_gemma":2.749738e-7,"teacher_disagreement_score":0.5896141,"about_ca_system_score_codex":0.000032384345,"about_ca_system_score_gemma":0.000072357056,"threshold_uncertainty_score":0.94025344},"labels":[],"label_agreement":null},{"id":"W1498880175","doi":"10.46298/dmtcs.486","title":"Cubefree words with many squares","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Construct (python library); Binary number; Square (algebra); Mathematics; Integer (computer science); Semantics (computer science); Discrete mathematics; Automaton; Cellular automaton; Combinatorics; Computer science; Arithmetic; Algorithm; Theoretical computer science; Geometry","score_opus":0.0070838399705147334,"score_gpt":0.23674419756294127,"score_spread":0.22966035759242653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498880175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.086093366,0.000010623026,0.9017039,0.0009050302,0.0005651539,0.0002384791,0.000003162411,0.00046585093,0.01001446],"genre_scores_gemma":[0.57569945,9.679195e-7,0.42388302,0.00027327088,0.00009869666,0.000012061311,7.3958023e-7,0.00001583428,0.0000159415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964244,0.000055398355,0.00042440006,0.0009514201,0.001249548,0.00089482736],"domain_scores_gemma":[0.9965776,0.00043367402,0.00015502916,0.0021919976,0.00020013572,0.00044151346],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018354983,0.00037409939,0.000371428,0.00024075352,0.00055906904,0.0013191216,0.0049862424,0.00009195663,0.00014715768],"category_scores_gemma":[0.00012398437,0.000247899,0.00010755281,0.0012783571,0.0038801848,0.00102285,0.0015328657,0.00051243394,0.0001517216],"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.0000040578184,0.00009236378,0.00003847866,0.000023057053,0.000007745885,0.000026794185,0.001276039,0.000014991057,0.0023854107,0.9878666,0.00003580627,0.008228647],"study_design_scores_gemma":[0.00020316483,0.00016335871,0.00017691674,0.00005798116,0.000008802352,0.00015227425,0.000049603917,0.54276556,0.0033639774,0.4525764,0.00013051719,0.00035146775],"about_ca_topic_score_codex":0.0000021169558,"about_ca_topic_score_gemma":0.0000024869776,"teacher_disagreement_score":0.54275054,"about_ca_system_score_codex":0.000022671156,"about_ca_system_score_gemma":0.0001426207,"threshold_uncertainty_score":0.9999973},"labels":[],"label_agreement":null},{"id":"W1500351217","doi":"10.46298/dmtcs.2859","title":"Counting unicellular maps on non-orientable surfaces","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche; Centre National de la Recherche Scientifique; European Commission","keywords":"Bijection; Mathematics; Combinatorics; Graph; Topology (electrical circuits)","score_opus":0.01580870632626125,"score_gpt":0.28330539012388417,"score_spread":0.2674966837976229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500351217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0796646,0.0000045325964,0.9067418,0.00021248437,0.0008468336,0.00035388907,0.000026764354,0.00014521634,0.012003852],"genre_scores_gemma":[0.610698,0.0000010667687,0.3889924,0.000114274495,0.000111325935,0.000011805461,0.0000025998427,0.00003058241,0.00003795308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647707,0.000030655363,0.00060224085,0.00072179566,0.0012941677,0.00087404373],"domain_scores_gemma":[0.99607915,0.0020042162,0.0002063805,0.000992964,0.0003275688,0.00038973955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022647188,0.00037342444,0.00048538545,0.00013865852,0.00061023183,0.00046773942,0.0013913333,0.00012710862,0.00029774546],"category_scores_gemma":[0.002011605,0.00028048301,0.000103647675,0.000719798,0.0017835469,0.00022327703,0.000542987,0.0006193449,0.00017405178],"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.000009671262,0.000168593,0.0000030888539,0.00013527383,0.000009631731,0.000012805056,0.00056926376,0.000014135196,0.003182538,0.9949623,0.00011908395,0.00081362744],"study_design_scores_gemma":[0.00016721175,0.00011912498,0.0000037086638,0.00009878702,0.000025898295,0.000019009423,0.00008276081,0.37572825,0.0034221704,0.6200265,0.000058105976,0.0002484328],"about_ca_topic_score_codex":0.000002132816,"about_ca_topic_score_gemma":0.0000019676788,"teacher_disagreement_score":0.5310334,"about_ca_system_score_codex":0.000033703687,"about_ca_system_score_gemma":0.00012089713,"threshold_uncertainty_score":0.9999647},"labels":[],"label_agreement":null},{"id":"W1500986313","doi":"10.46298/dmtcs.574","title":"Adaptive Identification of Sets of Vertices in Graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"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":"Identification (biology); Hamming distance; Combinatorics; Computer science; Discrete mathematics; Mathematics; Metric dimension; Chordal graph; Graph; 1-planar graph","score_opus":0.025401469451309618,"score_gpt":0.31525980717988045,"score_spread":0.28985833772857084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1500986313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18319906,0.00006421571,0.8153595,0.0000626065,0.00013819033,0.00022584134,0.0000035983724,0.000029792649,0.0009172063],"genre_scores_gemma":[0.7749598,0.0000049392884,0.22499683,0.000012907942,0.000007833052,0.00000899163,3.9575747e-7,0.0000066872663,0.000001578517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710405,0.00016020809,0.00071552745,0.00039203698,0.0010293184,0.00059888064],"domain_scores_gemma":[0.9976052,0.00063480064,0.00029077745,0.0010040032,0.00027149182,0.00019372157],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0037238628,0.000165978,0.00033179738,0.0005011636,0.000096787764,0.000070630995,0.0024177553,0.000048572485,0.000012386401],"category_scores_gemma":[0.00029526133,0.00013480824,0.000091046255,0.0022261431,0.0031178603,0.0012779776,0.00090714573,0.00016813146,0.000012417051],"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.000008616272,0.00018826577,0.00044657622,0.00005553935,0.000005547181,8.633513e-7,0.0035628916,0.00009449223,0.0060159103,0.9866496,0.0000011403838,0.002970587],"study_design_scores_gemma":[0.00012165222,0.00007854776,0.0018837176,0.00006792058,0.0000042067663,0.000005357201,0.000113125745,0.352016,0.031788968,0.6138028,6.2187064e-7,0.00011712127],"about_ca_topic_score_codex":0.0000019063152,"about_ca_topic_score_gemma":4.025485e-7,"teacher_disagreement_score":0.59176075,"about_ca_system_score_codex":0.000031546588,"about_ca_system_score_gemma":0.00006527284,"threshold_uncertainty_score":0.9995951},"labels":[],"label_agreement":null},{"id":"W1502166895","doi":"10.46298/dmtcs.387","title":"Complexity results on graphs with few cliques","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chordal graph; Split graph; Discrete mathematics; Clique graph; Vertex cover; Clique-sum; Indifference graph; Cograph; Vertex (graph theory); Clique problem; Block graph; Time complexity; Treewidth; Pathwidth; Graph; 1-planar graph; Line graph; Graph power","score_opus":0.03449243138924327,"score_gpt":0.3270042868670117,"score_spread":0.2925118554777685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502166895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022990964,0.000010639328,0.94773984,0.0009867678,0.00018113643,0.00045506287,0.000008461638,0.00042287525,0.027204257],"genre_scores_gemma":[0.5590756,0.000002596575,0.44052863,0.0003153126,0.000038175538,0.000006193249,0.0000016779433,0.000016761045,0.000015055797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99426067,0.00015570909,0.00069226633,0.0013183173,0.0021554895,0.0014175375],"domain_scores_gemma":[0.9948223,0.001533684,0.0002243207,0.0022945467,0.0004564201,0.0006686974],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0064311386,0.00043145297,0.0004540375,0.0005878769,0.00081028324,0.00071539613,0.004576282,0.000084943924,0.000018792489],"category_scores_gemma":[0.00034757884,0.0002946996,0.00013399475,0.002814007,0.008238183,0.0008272029,0.0013449711,0.0005611336,0.000100758516],"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.00011799014,0.00017235485,0.000017081402,0.000023836234,0.000010807905,0.00006436227,0.0010648898,0.00005209654,0.00021900232,0.99298483,0.00002905834,0.0052436697],"study_design_scores_gemma":[0.0005021701,0.0009561367,0.00035791297,0.00014370991,0.0000054424495,0.000071820585,0.000055895813,0.12780574,0.0064978185,0.86311483,0.000064249056,0.00042425955],"about_ca_topic_score_codex":0.0000023439804,"about_ca_topic_score_gemma":0.0000045177107,"teacher_disagreement_score":0.53608465,"about_ca_system_score_codex":0.00008940708,"about_ca_system_score_gemma":0.00012737836,"threshold_uncertainty_score":0.9999505},"labels":[],"label_agreement":null},{"id":"W1503481677","doi":"10.46298/dmtcs.3014","title":"Multi-cluster complexes","year":2012,"lang":"fr","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"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":"Fonds Québécois de la Recherche sur la Nature et les Technologies; Deutsche Forschungsgemeinschaft; Berlin Mathematical School","keywords":"Cluster (spacecraft); Mathematics; Combinatorics; Computer science; Computer network","score_opus":0.03742182775108654,"score_gpt":0.31882682668566587,"score_spread":0.2814049989345793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503481677","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014631152,0.00040332385,0.9631918,0.0013936111,0.008499923,0.0030569357,0.00015624736,0.0006566904,0.008010303],"genre_scores_gemma":[0.28202227,0.000043188753,0.7153523,0.00026385186,0.0013340358,0.00015706454,0.00002569222,0.00030690173,0.0004946934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9856695,0.0006756831,0.0034557043,0.0025851626,0.003830205,0.003783724],"domain_scores_gemma":[0.984579,0.004766082,0.0019511421,0.0054223584,0.0013602688,0.0019211306],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"category_scores_codex":[0.0072309375,0.002406242,0.0031722137,0.0005723099,0.0015198969,0.0016006323,0.0072166957,0.001068225,0.0014040464],"category_scores_gemma":[0.002900119,0.0021093495,0.0010485371,0.0015813198,0.015831847,0.0011251785,0.012737721,0.0028012202,0.002181836],"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.000026543394,0.0023244899,0.000017167495,0.00296445,0.00017586684,0.000024688488,0.0098869,0.00037520062,0.0012437585,0.9814646,0.00030736384,0.0011889425],"study_design_scores_gemma":[0.0008980278,0.00013766342,0.000025678424,0.0018082284,0.00043905486,0.00014960044,0.00026489745,0.37850052,0.0014105089,0.6143676,0.00042329752,0.0015749435],"about_ca_topic_score_codex":0.000009001044,"about_ca_topic_score_gemma":0.000003524355,"teacher_disagreement_score":0.3781253,"about_ca_system_score_codex":0.0008397038,"about_ca_system_score_gemma":0.0005714508,"threshold_uncertainty_score":0.99978},"labels":[],"label_agreement":null},{"id":"W1504799708","doi":"10.46298/dmtcs.566","title":"Monadic Second-Order Classes of Forests with a Monadic Second-Order 0-1 Law","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Order (exchange); Mathematics; Law; Political science; Business","score_opus":0.010491665668105733,"score_gpt":0.24365169020359717,"score_spread":0.23316002453549145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504799708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1563844,0.00015187246,0.8275194,0.00025882962,0.00033683635,0.00036887213,0.000014089202,0.00021566586,0.01475001],"genre_scores_gemma":[0.69867146,0.0000021331205,0.3006309,0.0005096704,0.00008573242,0.00002175839,0.0000026141108,0.000029283623,0.000046450903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99569905,0.00013256623,0.00072470424,0.00082493003,0.0012753747,0.0013433546],"domain_scores_gemma":[0.996137,0.0007073265,0.00033637794,0.001762604,0.00041744052,0.000639209],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001994222,0.00049974635,0.0006497644,0.00027409752,0.00043924135,0.0004903573,0.0032870134,0.00012771864,0.00046051963],"category_scores_gemma":[0.00009796162,0.00035233216,0.00013987179,0.001834176,0.0043926584,0.0018563144,0.0012772749,0.00034417454,0.00008232961],"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.000008316582,0.00021739201,0.00019410868,0.00013439385,0.000029111008,0.000009179343,0.0025600705,0.00003950307,0.00058581686,0.99487627,0.00008108311,0.0012647795],"study_design_scores_gemma":[0.0006368351,0.00043741768,0.00122502,0.00026171352,0.000041009895,0.00026466898,0.0001853876,0.46507788,0.008350001,0.52216816,0.0005138474,0.0008380516],"about_ca_topic_score_codex":0.000008291902,"about_ca_topic_score_gemma":0.000025952935,"teacher_disagreement_score":0.54228705,"about_ca_system_score_codex":0.000058335438,"about_ca_system_score_gemma":0.00022378277,"threshold_uncertainty_score":0.9998929},"labels":[],"label_agreement":null},{"id":"W1509996985","doi":"10.46298/dmtcs.3395","title":"On the Grone-Merris conjecture","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph theory and applications","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":"McMaster University","funders":"University of Minnesota","keywords":"Mathematics; Conjecture; Combinatorics; Vertex (graph theory); Generalization; Graph; Laplace operator; Discrete mathematics; Mathematical analysis","score_opus":0.020331016537558595,"score_gpt":0.28958747060303053,"score_spread":0.26925645406547194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509996985","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.25155997,0.000014479717,0.7007381,0.01098268,0.00015276205,0.0007524822,0.000016046619,0.0002692412,0.03551428],"genre_scores_gemma":[0.8865399,0.00000181952,0.11213681,0.0010409564,0.00014588228,0.00004873838,0.000001175743,0.000024959281,0.00005976294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769264,0.00010935049,0.00042001967,0.00048793873,0.000746383,0.00054367614],"domain_scores_gemma":[0.99579984,0.0024909507,0.00014679888,0.0012631537,0.00010038844,0.00019886543],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0020460428,0.0002855568,0.0002806753,0.00010609584,0.0008583069,0.00026806933,0.0015942758,0.000073956406,0.00068542716],"category_scores_gemma":[0.0005055934,0.00016174765,0.00015718472,0.000685703,0.0033887702,0.0001551659,0.00033783625,0.00036998265,0.00032865017],"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.000004484814,0.00014609472,0.0000010691233,0.000016236012,0.000010949779,0.0000011574787,0.0012525435,0.000027573686,0.00023885141,0.99644166,0.0008949771,0.00096442667],"study_design_scores_gemma":[0.00012610122,0.00007705506,0.000007425866,0.000057733756,0.000026697642,0.000023276814,0.00009762202,0.067248486,0.0026950177,0.9290662,0.0003556041,0.00021882565],"about_ca_topic_score_codex":3.2976737e-7,"about_ca_topic_score_gemma":7.547932e-7,"teacher_disagreement_score":0.63497996,"about_ca_system_score_codex":0.00003657453,"about_ca_system_score_gemma":0.00004245321,"threshold_uncertainty_score":0.9993234},"labels":[],"label_agreement":null},{"id":"W1520749929","doi":"10.46298/dmtcs.550","title":"On the Book Thickness of k-Trees","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"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":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Tree (set theory); Combinatorics; Degree (music); Decomposition; Discrete mathematics; Physics; Ecology; Biology","score_opus":0.02964475841660093,"score_gpt":0.28619845014396084,"score_spread":0.2565536917273599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520749929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008406703,0.000031096075,0.96406376,0.000594518,0.00018268771,0.00033285024,0.0000024820076,0.000113645816,0.026272276],"genre_scores_gemma":[0.77136415,0.0000046361206,0.22810161,0.00045055285,0.000019476602,0.000018061484,1.7094004e-7,0.00001300262,0.000028342007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966765,0.00020099929,0.00044863182,0.0006369528,0.0013642046,0.0006726836],"domain_scores_gemma":[0.9956143,0.0015565638,0.00017882267,0.0021275554,0.00030258766,0.00022019086],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0030747778,0.00025453532,0.00030995542,0.00023740646,0.0004471526,0.00019523414,0.006156279,0.00005565962,0.00022719792],"category_scores_gemma":[0.00046908794,0.00014533095,0.00014095592,0.0013895156,0.0065552085,0.00060814485,0.001754227,0.00034275002,0.000103414524],"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.000009849087,0.00011903707,0.000007908308,0.000017556607,0.000008607406,0.000006577225,0.003233976,0.00001842405,0.00053473096,0.99484736,0.00005387543,0.0011421246],"study_design_scores_gemma":[0.0000894721,0.00023280684,0.000087008826,0.000075579694,0.000004327131,0.00001749305,0.000062734485,0.17474376,0.011932419,0.8125719,0.000016391128,0.00016614218],"about_ca_topic_score_codex":0.000001158555,"about_ca_topic_score_gemma":4.2099592e-7,"teacher_disagreement_score":0.76295745,"about_ca_system_score_codex":0.000024641351,"about_ca_system_score_gemma":0.00010282952,"threshold_uncertainty_score":0.9992209},"labels":[],"label_agreement":null},{"id":"W1532852577","doi":"10.46298/dmtcs.482","title":"On edge-intersection graphs of k-bend paths in grids","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":32,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Pathwidth; 1-planar graph; Indifference graph; Chordal graph; Planar graph; Outerplanar graph; Longest path problem; Discrete mathematics; Grid; Clique-sum; Lattice graph; Line graph; Graph; Voltage graph; Geometry","score_opus":0.012110239712280422,"score_gpt":0.2889517041416278,"score_spread":0.2768414644293474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1532852577","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.2878269,0.0000037785667,0.706123,0.00016535036,0.0005846893,0.0002486719,0.0000027153626,0.000080246304,0.004964645],"genre_scores_gemma":[0.81163013,0.0000018367997,0.18823579,0.000069171874,0.000028647264,0.000014404773,6.0593175e-7,0.000013310188,0.000006090165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99661756,0.00011840156,0.00056674046,0.00080810045,0.0011654957,0.0007237158],"domain_scores_gemma":[0.9969517,0.0008517355,0.00016131028,0.0015279042,0.00023703216,0.00027034312],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0027235548,0.00026927723,0.00036994196,0.00078092085,0.00020964649,0.00024229877,0.0032737695,0.0000944437,0.00005834557],"category_scores_gemma":[0.00047626527,0.00021276502,0.00014079809,0.002288467,0.0035538336,0.0006653706,0.0010473413,0.0006941771,0.00004010502],"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.000012977084,0.00018240826,0.000050517137,0.000031166826,0.0000037934417,0.000011332211,0.0011892347,0.00008939843,0.009273616,0.9840255,0.0000074555073,0.0051226323],"study_design_scores_gemma":[0.00020035815,0.00025107778,0.00018886257,0.000069420996,0.0000018906622,0.000021162929,0.00003312339,0.30392128,0.011546259,0.6835895,0.0000042728257,0.00017277946],"about_ca_topic_score_codex":0.0000027652236,"about_ca_topic_score_gemma":0.000005365926,"teacher_disagreement_score":0.52380323,"about_ca_system_score_codex":0.000038797974,"about_ca_system_score_gemma":0.00010211758,"threshold_uncertainty_score":0.9991579},"labels":[],"label_agreement":null},{"id":"W1539135222","doi":"10.46298/dmtcs.345","title":"Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Maximal independent set; Independent set; Mathematics; Graph; Enhanced Data Rates for GSM Evolution; Set (abstract data type); Discrete mathematics; Chordal graph; 1-planar graph; Computer science; Artificial intelligence","score_opus":0.030404127322679365,"score_gpt":0.3125950203568114,"score_spread":0.28219089303413203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539135222","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039811548,0.00002397611,0.94660336,0.0038750132,0.00013945308,0.0009599155,0.000022411208,0.00035193135,0.008212371],"genre_scores_gemma":[0.47246766,0.0000031581797,0.52612156,0.0012431068,0.000056887657,0.00004485099,0.0000016388955,0.000032533855,0.000028569535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929725,0.00020965602,0.00071127305,0.0017484926,0.0026799687,0.0016781164],"domain_scores_gemma":[0.99534106,0.0006610422,0.00019844544,0.0023391114,0.0004675601,0.0009927853],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.003335277,0.0005577445,0.00059366185,0.00082635257,0.0008879493,0.0013360295,0.0058113276,0.00009878234,0.00016554724],"category_scores_gemma":[0.00018914325,0.00042228543,0.00017287249,0.00309772,0.0027852908,0.0013863214,0.002242861,0.00061613735,0.00059165136],"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.00004432407,0.0001185307,0.0000546267,0.000028498396,0.000023533763,0.000044866825,0.0035688176,0.00022692599,0.001388023,0.9793817,0.00015056772,0.014969589],"study_design_scores_gemma":[0.00057566236,0.00072755164,0.00019048281,0.00017052538,0.000014362148,0.0002870223,0.000098177145,0.32769307,0.008407528,0.66020626,0.00079934805,0.0008299981],"about_ca_topic_score_codex":0.0000022636102,"about_ca_topic_score_gemma":0.0000034386196,"teacher_disagreement_score":0.43265614,"about_ca_system_score_codex":0.00016775854,"about_ca_system_score_gemma":0.0002056394,"threshold_uncertainty_score":0.99992853},"labels":[],"label_agreement":null},{"id":"W1542271501","doi":"10.46298/dmtcs.533","title":"Cycle transversals in bounded degree graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","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":"Simon Fraser University","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Combinatorics; Mathematics; Degree (music); Bounded function; Transversal (combinatorics); Discrete mathematics; Chordal graph; Time complexity; Graph","score_opus":0.04119992193136523,"score_gpt":0.2953425194147365,"score_spread":0.25414259748337126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542271501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039751966,0.000028181907,0.9384754,0.00021315445,0.00022508448,0.00039886136,0.000002671879,0.00023286755,0.020671856],"genre_scores_gemma":[0.58872336,0.0000051473044,0.41108632,0.00013343566,0.000011699529,0.000019014584,3.7511177e-7,0.000014570368,0.000006045032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956684,0.00018767775,0.00061364344,0.0010456439,0.0012505634,0.0012340865],"domain_scores_gemma":[0.9971091,0.0004218355,0.0001171009,0.0017092663,0.000189666,0.00045303343],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0029834085,0.00034714403,0.00043165227,0.0006770123,0.0003735489,0.0004091127,0.0052801925,0.00009182958,0.0001242616],"category_scores_gemma":[0.0001786534,0.00028504326,0.00016459203,0.0029579622,0.004525172,0.0013691641,0.0011914915,0.00042513394,0.0001151566],"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.000015243761,0.00017466815,0.00006546544,0.000024970801,0.0000064048713,0.00004976228,0.0051336517,0.000016528984,0.00037707193,0.989477,0.000005129304,0.004654115],"study_design_scores_gemma":[0.00030197707,0.0001320359,0.0004125778,0.000048732032,0.0000038707317,0.000033568864,0.000061493825,0.22479355,0.0029529524,0.7709499,0.000009089868,0.00030024967],"about_ca_topic_score_codex":0.0000073288065,"about_ca_topic_score_gemma":0.0000056720332,"teacher_disagreement_score":0.5489714,"about_ca_system_score_codex":0.00006982111,"about_ca_system_score_gemma":0.00013848279,"threshold_uncertainty_score":0.9999602},"labels":[],"label_agreement":null},{"id":"W154319015","doi":"10.46298/dmtcs.3564","title":"Distribution of the Number of Encryptions in Revocation Schemes for Stateless Receivers","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":6,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Stateless protocol; Revocation; Broadcast encryption; Limiting; Scheme (mathematics); Set (abstract data type); Encryption; Discrete mathematics; Computer network; Algorithm; Computer science; Public-key cryptography","score_opus":0.01624078492076061,"score_gpt":0.27554257225738804,"score_spread":0.25930178733662745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W154319015","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.25853467,0.000006156709,0.74070716,0.00017091147,0.000098995195,0.0002254521,0.00004041174,0.000016017577,0.00020024188],"genre_scores_gemma":[0.7565341,0.000011116267,0.24341232,0.000014097844,0.000008612914,0.000010146868,0.0000064541205,0.000002626203,5.0595855e-7],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846625,0.000058663172,0.0004301377,0.0003098293,0.00048312664,0.00025198798],"domain_scores_gemma":[0.9983921,0.00032618918,0.0002008682,0.00075475156,0.0002633119,0.000062782805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095172174,0.00011192984,0.0002106177,0.00007367864,0.00022317815,0.00003949737,0.0015676046,0.000040781873,0.0000070115375],"category_scores_gemma":[0.00022068816,0.00007909417,0.000113618065,0.0013849565,0.0024173376,0.00043765063,0.0004473734,0.000099400306,0.0000017219483],"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.000004352984,0.00010541794,0.0007175927,0.000053371677,0.0000029497423,2.8536368e-7,0.0015652855,0.000024875864,0.00032410002,0.99641347,0.000020801665,0.00076749123],"study_design_scores_gemma":[0.00028781677,0.00005036082,0.005887743,0.00013985106,0.000007832261,0.0000174014,0.00008105328,0.2704294,0.009339438,0.71355754,0.000052608855,0.00014893798],"about_ca_topic_score_codex":0.0000048857364,"about_ca_topic_score_gemma":0.0000011110382,"teacher_disagreement_score":0.49799946,"about_ca_system_score_codex":0.000027022994,"about_ca_system_score_gemma":0.000112127986,"threshold_uncertainty_score":0.8906781},"labels":[],"label_agreement":null},{"id":"W1549363509","doi":"10.46298/dmtcs.315","title":"Track Layouts of Graphs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":52,"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":"Natural Sciences and Engineering Research Council of Canada; European Commission; Univerzita Karlova v Praze","keywords":"Combinatorics; Bounded function; Vertex (graph theory); Mathematics; Planar graph; Queue; Graph; Discrete mathematics; Computer science","score_opus":0.012722073503782792,"score_gpt":0.25953466792096674,"score_spread":0.24681259441718395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549363509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056006413,0.000035369078,0.9400747,0.00055252743,0.00031862434,0.00016899292,0.0000026155417,0.000108187276,0.0027326108],"genre_scores_gemma":[0.5839054,0.0000021453436,0.41594577,0.00010624315,0.00002782373,0.0000034042803,0.0000011934708,0.000004546798,0.0000034683671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976819,0.000035566587,0.00045931936,0.00050893036,0.00093052187,0.00038375342],"domain_scores_gemma":[0.99845606,0.00017836329,0.00015316068,0.00071692764,0.00029315375,0.00020232784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082568673,0.00018520169,0.00025415068,0.00028716947,0.00024313499,0.00025429562,0.0017660435,0.000047584428,0.000020979005],"category_scores_gemma":[0.00010688655,0.00015050366,0.00011940864,0.0016869232,0.0013023716,0.000637512,0.0005273754,0.00012561938,0.000038046266],"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.000001791855,0.00011481001,0.000005274077,0.000024282072,0.0000054494567,0.0000038107269,0.0014491339,0.0040508765,0.0014749902,0.98944396,0.000007331132,0.003418269],"study_design_scores_gemma":[0.00022480109,0.00011488608,0.00012651744,0.00004529119,0.0000056996387,0.000031172247,0.00002039733,0.27724695,0.01417246,0.7078428,0.000012304971,0.00015667808],"about_ca_topic_score_codex":0.000001549008,"about_ca_topic_score_gemma":3.6929936e-7,"teacher_disagreement_score":0.527899,"about_ca_system_score_codex":0.0000328102,"about_ca_system_score_gemma":0.00017823075,"threshold_uncertainty_score":0.6137361},"labels":[],"label_agreement":null},{"id":"W1575452258","doi":"10.46298/dmtcs.625","title":"Isomorphism of graph classes related to the circular-ones property","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"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":"","keywords":"Graph isomorphism; Combinatorics; Mathematics; Arc (geometry); Isomorphism (crystallography); Discrete mathematics; Regular polygon; Indifference graph; Graph property; Graph; Line graph; Voltage graph; Geometry; Chemistry","score_opus":0.018041717329907874,"score_gpt":0.2762916424278751,"score_spread":0.2582499250979672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575452258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026457725,0.000043072065,0.96271384,0.00531416,0.0002739845,0.0010838849,0.0000029830774,0.00016716622,0.0039431625],"genre_scores_gemma":[0.75304615,0.000005682544,0.24644765,0.0003331876,0.000020914531,0.00007037465,5.805514e-7,0.000017945775,0.000057499365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99576193,0.00023705781,0.00068480894,0.0008467701,0.0015719569,0.000897452],"domain_scores_gemma":[0.99575245,0.0007045304,0.00018369647,0.00226364,0.0006800361,0.00041566096],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0024618062,0.00031371534,0.00041955456,0.00036572834,0.0005644249,0.0005993091,0.006172975,0.000074551914,0.000100852056],"category_scores_gemma":[0.00047224312,0.00015917388,0.00017548041,0.003318483,0.004553341,0.0009506609,0.0024352819,0.00036111055,0.00034641882],"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.0000025575928,0.00008771315,0.000026619155,0.00003826582,0.000014772505,0.0000042301185,0.0020135287,0.00021895162,0.0041671894,0.98826784,0.00013033193,0.005027985],"study_design_scores_gemma":[0.00012223341,0.00018523181,0.00020913863,0.000076448996,0.000006308269,0.00004391769,0.00009105139,0.28575632,0.003709942,0.7094702,0.00009479864,0.00023441756],"about_ca_topic_score_codex":0.0000070953647,"about_ca_topic_score_gemma":5.295546e-7,"teacher_disagreement_score":0.7265884,"about_ca_system_score_codex":0.000036856974,"about_ca_system_score_gemma":0.0001317084,"threshold_uncertainty_score":0.9992041},"labels":[],"label_agreement":null},{"id":"W1581798618","doi":"10.46298/dmtcs.545","title":"A de Bruijn - Erdos theorem and metric spaces","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"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":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"De Bruijn sequence; Mathematics; Generalization; Metric space; Combinatorics; Plane (geometry); Set (abstract data type); Discrete mathematics; Chen; Metric (unit); Computer science; Mathematical analysis; Geometry","score_opus":0.0191087445210922,"score_gpt":0.2562057253920496,"score_spread":0.2370969808709574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581798618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037346095,0.000073052244,0.9523513,0.00028163646,0.00020497445,0.00018566792,0.0000014741988,0.00014984903,0.009405972],"genre_scores_gemma":[0.5565723,0.000006090779,0.44316074,0.00019375418,0.000041603394,0.000006428536,4.6791436e-7,0.000005899081,0.000012702224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978159,0.00009267076,0.00031696283,0.00061271584,0.00063889514,0.0005228235],"domain_scores_gemma":[0.99842113,0.00035374393,0.00011347702,0.0006057762,0.0001759042,0.00032993968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019044637,0.00021980306,0.00023171522,0.000397789,0.00041283068,0.0007580906,0.0014656184,0.000056723242,0.00006253366],"category_scores_gemma":[0.0002051296,0.0001728079,0.000067590314,0.0016898885,0.0014061071,0.00072644185,0.00092697813,0.00015516735,0.000033929948],"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.0000030858598,0.00006715852,0.00003391367,0.00001999351,0.00000761963,0.000008129797,0.0034842857,0.000051817766,0.00031824713,0.98319286,0.000019328496,0.012793531],"study_design_scores_gemma":[0.00009878614,0.00010524059,0.0005172573,0.000019221961,0.0000079913625,0.000075684664,0.000034115543,0.5063641,0.001932017,0.49065244,0.000031909043,0.00016126141],"about_ca_topic_score_codex":0.0000035196142,"about_ca_topic_score_gemma":3.3916382e-7,"teacher_disagreement_score":0.51922625,"about_ca_system_score_codex":0.00003546936,"about_ca_system_score_gemma":0.00013576406,"threshold_uncertainty_score":0.73102844},"labels":[],"label_agreement":null},{"id":"W1592608789","doi":"10.46298/dmtcs.450","title":"Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences","funders":"","keywords":"Mathematics; Diophantine equation; Correctness; Partition (number theory); Base (topology); Integer (computer science); Combinatorics; Order (exchange); Discrete mathematics; Algorithm; Mathematical analysis; Computer science","score_opus":0.011320149882883795,"score_gpt":0.2691241931922988,"score_spread":0.257804043309415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592608789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038176423,0.000029374723,0.9864708,0.0040201,0.00028735385,0.00046109565,0.0000012704534,0.00021487585,0.004697478],"genre_scores_gemma":[0.500637,0.0000024031708,0.49898484,0.00026646475,0.00008493597,0.000011693993,5.8148544e-7,0.0000051663583,0.000006904844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972706,0.00018453412,0.00052685017,0.0006545935,0.0008580327,0.00050541025],"domain_scores_gemma":[0.99797213,0.00044487967,0.00019060711,0.00092883187,0.00021685805,0.0002466628],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003122692,0.00026499023,0.00039331324,0.000076924305,0.00070614525,0.0013251326,0.0016225019,0.000052007545,0.000010740443],"category_scores_gemma":[0.00011331297,0.00015141495,0.00009869023,0.0010063682,0.0020332246,0.0007064358,0.000493268,0.00020901924,0.00003878947],"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.000014198631,0.000043920838,0.0000030277413,0.000026912847,0.0000045472316,0.0000042409833,0.00078782416,0.000024245817,0.00020516098,0.98149425,0.000009049923,0.017382601],"study_design_scores_gemma":[0.0007361939,0.000059043385,0.000043083448,0.00005659194,0.000011152742,0.00009064047,0.000039022558,0.6791541,0.00128611,0.3183485,0.00001108024,0.00016450293],"about_ca_topic_score_codex":0.0000021198505,"about_ca_topic_score_gemma":4.751289e-8,"teacher_disagreement_score":0.67912984,"about_ca_system_score_codex":0.000032514574,"about_ca_system_score_gemma":0.000050005823,"threshold_uncertainty_score":0.9997116},"labels":[],"label_agreement":null},{"id":"W1593427793","doi":"10.46298/dmtcs.458","title":"Adjoint functors and tree duality","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Mathematics; Homomorphism; Duality (order theory); Functor; Combinatorics; Functor category; Tree (set theory); Adjoint functors; Discrete mathematics; Natural transformation","score_opus":0.020913076198679884,"score_gpt":0.2992496958744759,"score_spread":0.27833661967579604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593427793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026505556,0.00005297447,0.9626805,0.001940616,0.00015934715,0.00028593413,0.0000022313682,0.00026523456,0.00810758],"genre_scores_gemma":[0.6465744,0.000007753115,0.35296655,0.00038204392,0.000041671163,0.0000047544877,4.9810893e-7,0.0000075979315,0.000014724806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962549,0.00014425289,0.0004652952,0.0009960608,0.0012335264,0.00090594473],"domain_scores_gemma":[0.9971117,0.0005006522,0.00011552584,0.0014961847,0.00021677208,0.00055920676],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021899226,0.00031528427,0.00038350184,0.000284267,0.00054371875,0.0007967331,0.0026624142,0.000067347515,0.000029935098],"category_scores_gemma":[0.00032576095,0.0002376555,0.000103842845,0.0014076179,0.00342398,0.0010177513,0.0013209233,0.00032439874,0.00004698693],"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.000005619759,0.00007812053,0.000015578838,0.000015160936,0.0000040486607,0.000013839734,0.001053953,0.00001191574,0.001005746,0.96211773,0.000019598683,0.035658672],"study_design_scores_gemma":[0.00016888826,0.0002655297,0.0007033839,0.00003548161,0.0000042439215,0.000048255457,0.00003098585,0.2880059,0.0016066697,0.70885503,0.000030630425,0.00024503947],"about_ca_topic_score_codex":6.0454175e-7,"about_ca_topic_score_gemma":3.5725125e-7,"teacher_disagreement_score":0.62006885,"about_ca_system_score_codex":0.00004760208,"about_ca_system_score_gemma":0.00008883941,"threshold_uncertainty_score":0.99928814},"labels":[],"label_agreement":null},{"id":"W1622363968","doi":"10.46298/dmtcs.2873","title":"On $k$-crossings and $k$-nestings of permutations","year":2010,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique","keywords":"Combinatorics; Mathematics; Corollary; Permutation (music); Parity of a permutation; Distribution (mathematics); Symmetric group; Physics; Cyclic permutation","score_opus":0.013720992719743795,"score_gpt":0.30015454236672645,"score_spread":0.28643354964698264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1622363968","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.42701384,0.00006782995,0.5587966,0.0012590543,0.0024062116,0.000652515,0.000039182964,0.00012284744,0.009641919],"genre_scores_gemma":[0.5679943,0.0000071043955,0.43152463,0.00007279194,0.00015967524,0.000012643991,0.0000012111177,0.00005903712,0.00016858331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952848,0.00010139947,0.0012885089,0.000884884,0.0014457579,0.0009946316],"domain_scores_gemma":[0.9914579,0.005061034,0.00072626636,0.0014555337,0.00072315603,0.00057614443],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0026670182,0.00062702456,0.0009502036,0.00032132535,0.0007548588,0.00055358076,0.0013754105,0.000297878,0.0003089861],"category_scores_gemma":[0.0057925736,0.0005546823,0.00019717631,0.0011261142,0.016762862,0.0005570995,0.0009507983,0.0010412367,0.00007541336],"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.000012588484,0.00060791045,0.000009888109,0.0010218078,0.000023932895,0.0000127016265,0.007779887,0.000024382993,0.0050336085,0.9824314,0.000069002046,0.0029728927],"study_design_scores_gemma":[0.00046026526,0.00037220496,0.00002044829,0.00088616885,0.00011835513,0.00015719395,0.0002201606,0.1993965,0.0043850257,0.7934534,0.00007255248,0.00045769528],"about_ca_topic_score_codex":0.0000044185444,"about_ca_topic_score_gemma":0.0000018731864,"teacher_disagreement_score":0.19937213,"about_ca_system_score_codex":0.000063292886,"about_ca_system_score_gemma":0.00025971286,"threshold_uncertainty_score":0.9996905},"labels":[],"label_agreement":null},{"id":"W1667592137","doi":"10.46298/dmtcs.3593","title":"A bijective proof of a factorization formula for Macdonald polynomials at roots of unity","year":2008,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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":"Fields Institute for Research in Mathematical Sciences; York University","funders":"","keywords":"Combinatorics; Bijection; Factorization; Lambda; Mathematics; Partition (number theory); Root of unity; Combinatorial proof; Monomial; Physics; Algorithm; Quantum mechanics","score_opus":0.03040621664470079,"score_gpt":0.30330346634977373,"score_spread":0.27289724970507295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1667592137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13800292,0.0001617438,0.8564946,0.0002826142,0.0011414137,0.0023175536,0.00026731665,0.000060613424,0.0012712349],"genre_scores_gemma":[0.64123976,0.000017754855,0.3582568,0.000017616398,0.00015146579,0.000054219723,0.000008338167,0.000072467374,0.00018158885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941462,0.00021076061,0.002121898,0.00080154825,0.0016673856,0.0010521719],"domain_scores_gemma":[0.99025756,0.0044657476,0.0017298155,0.0014161312,0.0017277042,0.00040306072],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0023652997,0.0006783229,0.0016521496,0.00038032862,0.00060571055,0.00006100504,0.0016040446,0.00032944613,0.00018229686],"category_scores_gemma":[0.0039434116,0.00060274394,0.000498037,0.001478205,0.007804746,0.0005777821,0.0012190733,0.0003203349,0.000013677555],"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.000116981275,0.0011737787,0.000035765737,0.0033882265,0.00010340544,0.000004946844,0.007865068,0.00018818653,0.0055762534,0.9806519,0.00009291537,0.0008025436],"study_design_scores_gemma":[0.00092847244,0.00084709766,0.000026085558,0.0009319119,0.00018713958,0.00007155695,0.00015732598,0.18221197,0.10579782,0.7083564,0.00004296708,0.00044127027],"about_ca_topic_score_codex":0.0000063979514,"about_ca_topic_score_gemma":0.0000026806276,"teacher_disagreement_score":0.50323683,"about_ca_system_score_codex":0.00041447912,"about_ca_system_score_gemma":0.00052460737,"threshold_uncertainty_score":0.9996424},"labels":[],"label_agreement":null},{"id":"W1706968406","doi":"10.46298/dmtcs.2825","title":"Combinatorial formulas for double parabolic R-polynomials","year":2010,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Algebraic structures and combinatorial models","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Hecke algebra; Polynomial; Pure mathematics; Simple (philosophy); Combinatorics; Computation; Algebra over a field; Mathematical analysis; Algorithm; Philosophy","score_opus":0.018561700290921274,"score_gpt":0.2948552762722648,"score_spread":0.2762935759813435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1706968406","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.28480202,0.000228504,0.65230316,0.0029918791,0.04545563,0.0032938644,0.00009778043,0.00029110178,0.010536045],"genre_scores_gemma":[0.8090225,0.000012524429,0.18700986,0.0001817733,0.0033035814,0.0001328495,0.000007915319,0.000116481315,0.00021252218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938156,0.00008910942,0.0014130084,0.0012532299,0.0014852158,0.0019438507],"domain_scores_gemma":[0.99374366,0.0021180226,0.0005607945,0.0019374788,0.0007354821,0.000904591],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003420141,0.00085675303,0.0012648444,0.0002390527,0.0012432715,0.0012761591,0.0028683986,0.00062400225,0.0007254139],"category_scores_gemma":[0.0009053941,0.0007353722,0.00059280905,0.000845862,0.0069336076,0.00069865905,0.0011581872,0.0010047805,0.00012117998],"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.000117137286,0.00042584346,0.000004835663,0.0004949726,0.00006690363,0.000005118436,0.002146092,0.000015844447,0.00093847513,0.9932009,0.00048832066,0.002095587],"study_design_scores_gemma":[0.0026774784,0.00042036374,0.0000049607975,0.0001993963,0.00022126049,0.00006550551,0.00007825039,0.13196765,0.007411942,0.85395736,0.0021883314,0.0008075235],"about_ca_topic_score_codex":0.000015493748,"about_ca_topic_score_gemma":0.000004910997,"teacher_disagreement_score":0.52422047,"about_ca_system_score_codex":0.0001162175,"about_ca_system_score_gemma":0.0005471994,"threshold_uncertainty_score":0.9997606},"labels":[],"label_agreement":null},{"id":"W1732011848","doi":"10.46298/dmtcs.3411","title":"Finding a Strong Stable Set or a Meyniel Obstruction in any Graph","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Rogers Communications (Canada); Wilfrid Laurier University","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Chord (peer-to-peer); Clique; Independent set; Discrete mathematics; Computer science","score_opus":0.03194635860705702,"score_gpt":0.31990689398220307,"score_spread":0.28796053537514604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1732011848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05756335,0.000029554663,0.9386707,0.0005835061,0.00020445648,0.00041157685,0.0000054304883,0.00019797498,0.0023334546],"genre_scores_gemma":[0.57549053,0.0000058157616,0.4243001,0.00007988199,0.000054171764,0.000021924268,9.298382e-7,0.000014263305,0.0000323761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99548006,0.00017194435,0.00064591237,0.0010376965,0.0013499542,0.0013144363],"domain_scores_gemma":[0.99726146,0.0006643186,0.0001596554,0.0013441714,0.0001806709,0.00038969872],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030148583,0.0003426939,0.00041936646,0.00075020135,0.00049815566,0.00078788114,0.0034130837,0.00008935851,0.00010845165],"category_scores_gemma":[0.00032736815,0.00026100827,0.00011326408,0.0033932454,0.002160603,0.0020783255,0.0015766048,0.0004921279,0.00006913336],"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.000017156204,0.0000840511,0.00006300721,0.0000345674,0.000006085666,0.000021153883,0.0022995644,0.0013396196,0.00058063667,0.98731613,0.000015296102,0.008222724],"study_design_scores_gemma":[0.00029234332,0.00011036588,0.00009950155,0.000090598565,0.0000032860733,0.000060298782,0.00014517644,0.58640605,0.0016795363,0.41081434,0.000039173236,0.00025932404],"about_ca_topic_score_codex":0.0000030249562,"about_ca_topic_score_gemma":0.000009671202,"teacher_disagreement_score":0.58506644,"about_ca_system_score_codex":0.00018140262,"about_ca_system_score_gemma":0.00019502753,"threshold_uncertainty_score":0.9999842},"labels":[],"label_agreement":null},{"id":"W1766799846","doi":"10.23638/dmtcs-22-4-4","title":"Evacuating Robots from a Disk Using Face-to-Face Communication","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Unit disk; Approx; Upper and lower bounds; Face (sociological concept); Boundary (topology); Computer science; Unit (ring theory); Algorithm; Combinatorics; Mathematics; Artificial intelligence; Mathematical analysis; Operating system","score_opus":0.055592122959191664,"score_gpt":0.3286861245468449,"score_spread":0.2730940015876533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1766799846","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004787519,0.000064100794,0.9861707,0.0055079143,0.00044187126,0.0011447613,0.000039416907,0.00045127847,0.0013924054],"genre_scores_gemma":[0.4118961,0.000011800107,0.58740795,0.0005363208,0.000068290894,0.000026672787,0.000019454512,0.000028906743,0.000004539942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940856,0.00041678635,0.0010014501,0.0017331622,0.0018753747,0.00088762067],"domain_scores_gemma":[0.9941882,0.0007215799,0.00046483747,0.003302927,0.00046575064,0.000856736],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002117051,0.0006017826,0.00077441224,0.00030785447,0.00080123695,0.0031832051,0.009471524,0.00021789235,0.000058315385],"category_scores_gemma":[0.00063608726,0.0005349234,0.00021882882,0.0015211449,0.001439121,0.0006962842,0.018820204,0.0010908325,0.00015807238],"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.0000041866974,0.00008530181,0.0000073819674,0.00009880312,0.00002875412,0.0000062998006,0.013955279,0.14663908,0.00070663134,0.8355038,0.00004515344,0.0029193338],"study_design_scores_gemma":[0.00012295946,0.00004927997,0.000017024584,0.00045653337,0.00001950452,0.0000038137932,0.00009505545,0.6790571,0.00044685826,0.31928387,0.0000093051785,0.00043864755],"about_ca_topic_score_codex":0.000026474365,"about_ca_topic_score_gemma":0.000001490807,"teacher_disagreement_score":0.5324181,"about_ca_system_score_codex":0.00019711691,"about_ca_system_score_gemma":0.0004639497,"threshold_uncertainty_score":0.9997102},"labels":[],"label_agreement":null},{"id":"W1774294075","doi":"10.46298/dmtcs.3429","title":"Directed One-Trees","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Directed graph; Property (philosophy); Class (philosophy); Tree (set theory); Measure (data warehouse); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.020004681116525647,"score_gpt":0.29856820624155356,"score_spread":0.2785635251250279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1774294075","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008476068,0.000050786,0.9744733,0.0020240145,0.00018734354,0.0003272653,0.0000031877396,0.00079789764,0.013660164],"genre_scores_gemma":[0.4992328,0.000006329694,0.5003722,0.00022083428,0.00010002922,0.000014407713,7.152322e-7,0.000014833262,0.000037864822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99537045,0.00014640695,0.00053597335,0.0010551994,0.0017200236,0.0011719448],"domain_scores_gemma":[0.99629444,0.0006723385,0.00013454922,0.0019844736,0.00036274054,0.00055146636],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.002246478,0.0003403576,0.00040020398,0.00041258163,0.0006535597,0.00088768493,0.005427925,0.00007747667,0.00014451178],"category_scores_gemma":[0.00035754303,0.00027767717,0.0001481157,0.0022716678,0.003852198,0.0015338692,0.00236305,0.00038876542,0.00043547453],"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.000004486046,0.00015688241,0.000011146816,0.000014295621,0.000009737332,0.0000068238623,0.0009727565,0.00018087386,0.0018724356,0.9722769,0.000038859715,0.02445475],"study_design_scores_gemma":[0.00015181626,0.00008398169,0.00008583779,0.000041787924,0.0000043940818,0.00002333384,0.000013254203,0.5397966,0.005266294,0.454085,0.00019020721,0.0002574883],"about_ca_topic_score_codex":8.223189e-7,"about_ca_topic_score_gemma":0.0000017152342,"teacher_disagreement_score":0.53961575,"about_ca_system_score_codex":0.000094750365,"about_ca_system_score_gemma":0.00013597707,"threshold_uncertainty_score":0.9999675},"labels":[],"label_agreement":null},{"id":"W1785579362","doi":"10.46298/dmtcs.3514","title":"Complete k-ary trees and generalized meta-Fibonacci sequences","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":10,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fibonacci number; Mathematics; Pisano period; Combinatorics; Integer (computer science); Integer sequence; Fibonacci polynomials; Recurrence relation; Tree (set theory); Discrete mathematics; Generating function","score_opus":0.04098623905400932,"score_gpt":0.30442200912886036,"score_spread":0.26343577007485103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1785579362","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081204295,0.00023824075,0.9075116,0.0007623929,0.00046696703,0.0008641141,0.000042022028,0.00048313523,0.008427214],"genre_scores_gemma":[0.4584406,0.000007840034,0.5411331,0.0001038128,0.0001650447,0.0000461285,0.000004385723,0.0000478327,0.0000512819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954826,0.00016948496,0.0010905927,0.00092154957,0.0013917146,0.00094406],"domain_scores_gemma":[0.9957739,0.0019343361,0.00042020375,0.0011794235,0.00029280616,0.00039931535],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0020060563,0.0006303475,0.0012143769,0.00025091835,0.0006539273,0.0005225584,0.0013938919,0.00012730675,0.00023633955],"category_scores_gemma":[0.0007015381,0.00045079787,0.00029597915,0.0008251385,0.0042704176,0.00053651043,0.00092150294,0.00030864362,0.00003104799],"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.000008181897,0.00016094222,0.000007915838,0.00014085873,0.00009098947,0.000016899396,0.0004425244,0.000039172082,0.0020611922,0.99667835,0.00014134338,0.00021164131],"study_design_scores_gemma":[0.0004430075,0.0001235576,0.000016522536,0.0000706281,0.00042726396,0.00009564676,0.00006561066,0.0994101,0.0014444235,0.89725035,0.00012672924,0.00052613905],"about_ca_topic_score_codex":0.000010224895,"about_ca_topic_score_gemma":0.0000059918725,"teacher_disagreement_score":0.3772363,"about_ca_system_score_codex":0.00007387427,"about_ca_system_score_gemma":0.0001006662,"threshold_uncertainty_score":0.99979436},"labels":[],"label_agreement":null},{"id":"W1786052730","doi":"10.46298/dmtcs.3419","title":"Fast separation in a graph with an excluded minor","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"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; Ministerio de Economía y Competitividad","keywords":"Backslash; Combinatorics; Mathematics; Vertex (graph theory); Order (exchange); Graph; Discrete mathematics","score_opus":0.01874154929046081,"score_gpt":0.3162033184436024,"score_spread":0.2974617691531416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1786052730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111499436,0.0000136497265,0.8842687,0.00059475255,0.000058124417,0.00039172694,0.0000017921152,0.00016926407,0.003002546],"genre_scores_gemma":[0.54898304,0.0000015168458,0.45080128,0.00012791826,0.00003939396,0.000023052131,0.000001175684,0.000011581093,0.000011012734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614275,0.00017220149,0.00046856378,0.0009980433,0.0012922519,0.00092619314],"domain_scores_gemma":[0.99745166,0.00028741662,0.00012008616,0.0014969378,0.00022883741,0.00041508238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021098251,0.00031023507,0.00033825875,0.0005712942,0.00034517242,0.00071064103,0.0032558949,0.00006492993,0.00003659304],"category_scores_gemma":[0.00007679155,0.00022859772,0.00006631268,0.0025502057,0.0026953348,0.0023603486,0.00075386546,0.00032835043,0.00006617656],"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.000021794876,0.0002019982,0.000045104647,0.000015933907,0.00000390041,0.000016718905,0.0028616206,0.0015461727,0.0009932417,0.9841531,0.0000036662193,0.010136784],"study_design_scores_gemma":[0.00031760693,0.00034069206,0.00012585678,0.000049330247,0.0000027445028,0.0000483211,0.000058080634,0.6244558,0.0027515208,0.37158072,0.0000112056705,0.0002580935],"about_ca_topic_score_codex":0.0000018508125,"about_ca_topic_score_gemma":0.000013981819,"teacher_disagreement_score":0.62290967,"about_ca_system_score_codex":0.00008272603,"about_ca_system_score_gemma":0.00014077601,"threshold_uncertainty_score":0.9931073},"labels":[],"label_agreement":null},{"id":"W1824389153","doi":"10.46298/dmtcs.2295","title":"Enumerating Triangulations of Convex Polytopes","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"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 British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Convex hull; Point set triangulation; Triangulation; Polytope; Regular polygon; Convex polytope; Geometric graph theory; Pitteway triangulation; General position; Graph; Convex set; Delaunay triangulation; Geometry; Convex optimization; Line graph; Voltage graph","score_opus":0.01673953264207265,"score_gpt":0.2761587401245396,"score_spread":0.25941920748246694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1824389153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035902936,0.000043091517,0.95780736,0.00070903776,0.00030292224,0.00018474754,0.0000021564967,0.00009508062,0.0049526636],"genre_scores_gemma":[0.61636454,0.0000034650498,0.38342777,0.00010710426,0.00006959921,0.000004650199,0.0000019619893,0.0000045935335,0.000016289903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978466,0.00006930496,0.00052090664,0.0004425726,0.0007695315,0.00035106426],"domain_scores_gemma":[0.99826396,0.0004326211,0.00018503658,0.00062303356,0.00032633904,0.00016899266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012299982,0.00016743163,0.00026637176,0.00027220586,0.00037191663,0.00032550938,0.0012871792,0.000042814558,0.00009325678],"category_scores_gemma":[0.00022513009,0.00013999632,0.00009638305,0.0016770274,0.00087063306,0.0006639153,0.00049055996,0.0001099382,0.000028632949],"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.000002286366,0.00006520637,0.000030101623,0.000012671728,0.000006303034,0.0000032452035,0.00093421835,0.0014042604,0.0021352025,0.98342204,0.000019796911,0.011964695],"study_design_scores_gemma":[0.00016622063,0.00008295577,0.00025500817,0.00003254037,0.0000064771266,0.00004116704,0.000029776304,0.7700212,0.00443176,0.22471812,0.00006817594,0.00014660473],"about_ca_topic_score_codex":0.0000017065936,"about_ca_topic_score_gemma":3.8994614e-7,"teacher_disagreement_score":0.7686169,"about_ca_system_score_codex":0.000024119097,"about_ca_system_score_gemma":0.0001331227,"threshold_uncertainty_score":0.57088846},"labels":[],"label_agreement":null},{"id":"W1846413981","doi":"10.46298/dmtcs.2988","title":"Some exact asymptotics in the counting of walks in the quarter plane","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Enumeration; Planar; Quarter (Canadian coin); Lattice (music); Plane (geometry); Mathematics; Combinatorics; Probability and statistics; Counting problem; Statistical physics; Discrete mathematics; Physics; Computer science; Statistics; Geometry; Geography; Computer graphics (images)","score_opus":0.020639014649784064,"score_gpt":0.2946092653173492,"score_spread":0.27397025066756514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1846413981","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.7193216,0.00011508878,0.2685651,0.0011195526,0.00092708506,0.0017312745,0.0000135711525,0.00009149427,0.008115225],"genre_scores_gemma":[0.91745555,0.0000055170303,0.08199826,0.00022148754,0.00025110983,0.00003551266,0.0000011712104,0.000028832503,0.0000025309591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99541545,0.00036900453,0.0011273312,0.00036039588,0.0017046457,0.0010231733],"domain_scores_gemma":[0.992257,0.0057507674,0.0004070117,0.0013590613,0.00011521618,0.00011093915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008918121,0.00036905654,0.00060732174,0.0002316383,0.00021350363,0.0001919149,0.0026152146,0.00011438648,0.000029746669],"category_scores_gemma":[0.0013653712,0.00020469383,0.00013017582,0.0011829375,0.0018542745,0.0006161932,0.00037829412,0.00057964935,0.00001964598],"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.0000064246833,0.00052025536,0.00020230607,0.0001947781,0.000006259763,0.000006437698,0.022741765,0.000015970027,0.00016652187,0.97598463,0.00006319911,0.000091433554],"study_design_scores_gemma":[0.0003772419,0.00011792792,0.00029689638,0.00025575596,0.000030864154,0.00006367255,0.0029633846,0.03110863,0.0004827638,0.9640077,0.000020843316,0.00027434764],"about_ca_topic_score_codex":0.0000025238435,"about_ca_topic_score_gemma":0.0000019552297,"teacher_disagreement_score":0.19813395,"about_ca_system_score_codex":0.000075466996,"about_ca_system_score_gemma":0.00006132691,"threshold_uncertainty_score":0.8347172},"labels":[],"label_agreement":null},{"id":"W1854930219","doi":"10.46298/dmtcs.3536","title":"The Height of List-tries and TST","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"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":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Mathematics; Combinatorics; Tree (set theory); Core (optical fiber); Ternary operation; Discrete mathematics; Computer science","score_opus":0.008907837914097917,"score_gpt":0.257480629632985,"score_spread":0.2485727917188871,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1854930219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011408312,0.00016025137,0.9843849,0.0005473735,0.00028460962,0.00014530173,0.0000028842207,0.000062577215,0.0030037912],"genre_scores_gemma":[0.6275359,0.000022508508,0.3723002,0.00007378537,0.00004854284,0.0000017796826,4.6542362e-7,0.000005477079,0.000011367289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978029,0.000038774702,0.00044513377,0.00043309724,0.00078816223,0.0004919073],"domain_scores_gemma":[0.99735874,0.0010554474,0.00015762378,0.0010267679,0.00018857703,0.00021282103],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0030537178,0.00017142108,0.0002184258,0.00009471894,0.0007179811,0.0005631249,0.0023415058,0.000043037275,0.0000074417817],"category_scores_gemma":[0.00017318179,0.00009656117,0.000054585336,0.00065589667,0.0040104976,0.000524231,0.0020131983,0.00015026258,0.000006321297],"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.00000352509,0.00002760233,0.00002016569,0.00001600785,0.0000035302064,0.0000039991455,0.0008345912,0.0000024054118,0.00035083236,0.9787834,0.000040483694,0.019913448],"study_design_scores_gemma":[0.0001436988,0.00013052493,0.00047881398,0.000076665,0.000006268642,0.000045648703,0.00009599343,0.48801324,0.005961356,0.5042251,0.0006290926,0.00019365572],"about_ca_topic_score_codex":0.0000027949188,"about_ca_topic_score_gemma":0.000001292387,"teacher_disagreement_score":0.61612755,"about_ca_system_score_codex":0.00001442354,"about_ca_system_score_gemma":0.000055145174,"threshold_uncertainty_score":0.9987},"labels":[],"label_agreement":null},{"id":"W1861169671","doi":"10.46298/dmtcs.2412","title":"Deformations of Weyl's Denominator Formula","year":2014,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"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":"Banff International Research Station for Mathematical Innovation and Discovery; Natural Sciences and Engineering Research Council of Canada; Wilfrid Laurier University","keywords":"Mathematics; Humanities; Pure mathematics; Combinatorics; Algebra over a field","score_opus":0.01349374140014665,"score_gpt":0.28126569699321124,"score_spread":0.2677719555930646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861169671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028247476,0.00016898269,0.9440304,0.00094838394,0.0025864544,0.0009358,0.000046956673,0.00017097309,0.02286458],"genre_scores_gemma":[0.5057947,0.000017695616,0.49354604,0.000071756236,0.0002757183,0.0000255612,0.000003302462,0.00007766475,0.00018755211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931362,0.00028407498,0.0022156346,0.00084355724,0.0020105415,0.0015099392],"domain_scores_gemma":[0.99104136,0.0036751044,0.0011663054,0.002379151,0.0010240816,0.0007140241],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.004782895,0.0007930352,0.0014376017,0.00044766956,0.00067259255,0.00038225405,0.0028276697,0.000339749,0.00043391384],"category_scores_gemma":[0.0038989084,0.0007040776,0.0004542925,0.0016523732,0.008362032,0.0011011626,0.001611768,0.00063449395,0.00032712187],"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.000011369664,0.0006977086,0.000006422646,0.0020449164,0.000051008803,0.000003785058,0.0046941666,0.0001806402,0.00042717904,0.9855139,0.00014877794,0.00622009],"study_design_scores_gemma":[0.000464313,0.0003315639,0.0000047102403,0.0008760196,0.00016215419,0.00006533744,0.000236097,0.39069727,0.0044637015,0.60182315,0.00040554604,0.00047012692],"about_ca_topic_score_codex":0.0000035472317,"about_ca_topic_score_gemma":0.0000015137834,"teacher_disagreement_score":0.47754726,"about_ca_system_score_codex":0.0002668525,"about_ca_system_score_gemma":0.0002949261,"threshold_uncertainty_score":0.99954104},"labels":[],"label_agreement":null},{"id":"W1869370664","doi":"10.46298/dmtcs.12809","title":"Structure and enumeration of $(3+1)$-free posets (extended abstract)","year":2013,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Partially ordered set; Combinatorics; Mathematics; Enumeration; Bipartite graph; Star product; Conjecture","score_opus":0.010712851366337426,"score_gpt":0.2687285048475549,"score_spread":0.25801565348121747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1869370664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3636994,0.0007532382,0.6231578,0.002790166,0.0025465328,0.0021977127,0.00015165788,0.00017456514,0.0045289043],"genre_scores_gemma":[0.58189774,0.000027569886,0.41765496,0.00007702604,0.00018229139,0.000016870208,0.000003808237,0.000058549373,0.000081183585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99471325,0.00013184368,0.0015825426,0.00088252884,0.0016224062,0.0010674142],"domain_scores_gemma":[0.9936761,0.0018971782,0.0008559919,0.0020718903,0.0009224071,0.00057643116],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013772032,0.0007080956,0.0010967071,0.00027231275,0.00042598898,0.0006118116,0.0019588233,0.00035122805,0.001225492],"category_scores_gemma":[0.002332098,0.00060961285,0.00018397931,0.0008615933,0.007180843,0.0012557172,0.001654231,0.0006326654,0.00007424335],"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.000008003203,0.00037527658,0.000008357954,0.0016509561,0.00005116139,0.0000070765927,0.0042699687,0.00001951545,0.006257924,0.980512,0.0003016426,0.006538122],"study_design_scores_gemma":[0.00059391325,0.0002820504,0.00011926722,0.0007736846,0.00012477313,0.00009768377,0.00025662172,0.1738654,0.012292243,0.8110581,0.000023702043,0.000512563],"about_ca_topic_score_codex":0.000012666312,"about_ca_topic_score_gemma":0.0000019646109,"teacher_disagreement_score":0.21819834,"about_ca_system_score_codex":0.00012307576,"about_ca_system_score_gemma":0.00019328653,"threshold_uncertainty_score":0.99968755},"labels":[],"label_agreement":null},{"id":"W1879246310","doi":"10.46298/dmtcs.2132","title":"Packing Plane Perfect Matchings into a Point Set","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Plane (geometry); General position; Point (geometry); Set (abstract data type); Position (finance); Upper and lower bounds; Geometry; Mathematical analysis; Computer science","score_opus":0.01990092037437162,"score_gpt":0.2769995228043913,"score_spread":0.25709860243001964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1879246310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040594593,0.000035783665,0.9542821,0.001583863,0.0006140005,0.00022745665,0.0000023107982,0.0002494872,0.0024104107],"genre_scores_gemma":[0.566182,0.0000011224926,0.43331417,0.00035397534,0.000116388575,0.000007512265,0.0000048565475,0.000008787468,0.000011157558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967324,0.00011725698,0.0004694864,0.00076258037,0.0013479044,0.0005703392],"domain_scores_gemma":[0.99775314,0.0003618365,0.00015254151,0.0008439183,0.00036263594,0.0005259507],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0030046885,0.00028496952,0.00031001473,0.00030304608,0.00045504587,0.0010886529,0.0020556697,0.00006347983,0.000026721978],"category_scores_gemma":[0.0003258113,0.0002291915,0.00009890002,0.0013473018,0.0008781282,0.0011097953,0.0013014047,0.0002322115,0.00017780923],"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.000004619876,0.000054658365,0.00001095636,0.000026001178,0.000007148496,0.000015183635,0.007611844,0.0016690828,0.0006070537,0.9844322,0.00022690376,0.0053343177],"study_design_scores_gemma":[0.00017496725,0.0001399953,0.000017688923,0.000038863218,0.000005363649,0.00009361425,0.00008031552,0.5658732,0.0016543854,0.43161377,0.00009785261,0.00020999297],"about_ca_topic_score_codex":0.0000057218745,"about_ca_topic_score_gemma":9.865511e-7,"teacher_disagreement_score":0.5642041,"about_ca_system_score_codex":0.00010619949,"about_ca_system_score_gemma":0.00026840167,"threshold_uncertainty_score":0.9999483},"labels":[],"label_agreement":null},{"id":"W1879394092","doi":"10.46298/dmtcs.2145","title":"The inapproximability for the $(0,1)$-additive number","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.013001358155591008,"score_gpt":0.2612078213346106,"score_spread":0.24820646317901962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1879394092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021308071,0.000040837775,0.9827862,0.012284037,0.0006230175,0.0005964278,0.000008302954,0.00016221002,0.0013681966],"genre_scores_gemma":[0.7620769,0.000015741285,0.23730053,0.00038851445,0.000036522306,0.00011320405,2.686642e-7,0.000011874618,0.00005643338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971419,0.000104915525,0.0004526752,0.0007045091,0.0008325336,0.0007634869],"domain_scores_gemma":[0.99161166,0.0057604965,0.00015732403,0.0017967715,0.0004724575,0.000201269],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.00463852,0.00023729967,0.00021357056,0.000041327217,0.0019080583,0.000834481,0.0039196224,0.000051951294,0.000020661892],"category_scores_gemma":[0.0009419788,0.00008757456,0.00017456709,0.00071899174,0.0066324063,0.00043298092,0.0012272216,0.00014064634,0.00009047248],"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.0000054018237,0.00003826992,0.000010067649,0.000006920229,0.000009884729,5.214971e-7,0.00045815815,0.0000037000575,0.0001748242,0.96902925,0.00032958822,0.029933423],"study_design_scores_gemma":[0.00020276397,0.00006538622,0.00004539554,0.000038062826,0.0000088074885,0.000015198874,0.000031766256,0.25346774,0.0015120171,0.74387765,0.000585869,0.00014936231],"about_ca_topic_score_codex":0.0000012563656,"about_ca_topic_score_gemma":7.128376e-7,"teacher_disagreement_score":0.7599461,"about_ca_system_score_codex":0.00004069361,"about_ca_system_score_gemma":0.0001265884,"threshold_uncertainty_score":0.9993913},"labels":[],"label_agreement":null},{"id":"W1943297633","doi":"10.46298/dmtcs.2080","title":"Diversities and the Geometry of Hypergraphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Embedding; Metric (unit); Steiner tree problem; Hypergraph; Combinatorics; Set (abstract data type); Distortion (music); Relation (database); Combinatorial optimization; Discrete mathematics; Algorithm; Computer science; Artificial intelligence","score_opus":0.010219233834626421,"score_gpt":0.2556408838133856,"score_spread":0.2454216499787592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943297633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042399667,0.000055306158,0.95157707,0.00078122853,0.000120244826,0.00019261074,0.000001608339,0.00006467403,0.00480758],"genre_scores_gemma":[0.7657966,0.000010593173,0.23401715,0.00013458998,0.000021268437,0.0000048617267,1.6140609e-7,0.0000058806536,0.00000890599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997586,0.00020730608,0.00031749747,0.00046930532,0.0009506143,0.00046925351],"domain_scores_gemma":[0.99644136,0.001929131,0.00012513116,0.001119782,0.00020844219,0.00017617716],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003997669,0.0001786702,0.00033786226,0.00026819672,0.00048908766,0.00030117616,0.0030179955,0.00003747272,0.000012643565],"category_scores_gemma":[0.00045305016,0.000104767336,0.00010256708,0.0012784352,0.013426629,0.00049165706,0.0023872491,0.00019406705,0.000010110147],"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.000009991206,0.000021809003,0.000030190997,0.000032846925,0.000008094579,8.361201e-7,0.0015215683,0.000039245384,0.00018707066,0.9940584,0.000004936971,0.004085063],"study_design_scores_gemma":[0.00027527256,0.00006705073,0.000060508763,0.000023473604,0.0000053156564,0.000013564467,0.00006915626,0.41988978,0.0007951743,0.5786995,0.000012746207,0.00008840428],"about_ca_topic_score_codex":0.0000018229194,"about_ca_topic_score_gemma":1.7488465e-7,"teacher_disagreement_score":0.7233969,"about_ca_system_score_codex":0.000011200852,"about_ca_system_score_gemma":0.000035279216,"threshold_uncertainty_score":0.9892583},"labels":[],"label_agreement":null},{"id":"W2030719845","doi":"10.46298/dmtcs.2720","title":"Words and polynomial invariants of finite groups in non-commutative variables","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Finite Group Theory Research","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":"Université du Québec à Montréal; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subalgebra; Mathematics; Group (periodic table); Algebra homomorphism; Homomorphism; Group algebra; Finite group; Cellular algebra; Algebra over a field; Combinatorics; Pure mathematics; Discrete mathematics; Algebra representation","score_opus":0.026153492971907985,"score_gpt":0.3132956304514048,"score_spread":0.2871421374794968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030719845","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.4754592,0.000015205512,0.5150352,0.0003039377,0.00008345704,0.00049084803,0.0000147508845,0.000044480672,0.008552914],"genre_scores_gemma":[0.78336316,0.0000053059507,0.21647406,0.00008034856,0.0000397374,0.000008166044,0.0000015457083,0.000018507073,0.000009151426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967786,0.00022803656,0.00080039527,0.00055918365,0.0008943435,0.0007394578],"domain_scores_gemma":[0.9950796,0.0035061603,0.00021778795,0.00079112255,0.00015501636,0.00025031922],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.004531042,0.00031697837,0.0006800443,0.0004848952,0.0001923121,0.00020173097,0.0012618725,0.00011685326,0.00009032389],"category_scores_gemma":[0.0017184059,0.00025479638,0.00008083666,0.001303316,0.0034466477,0.00039166847,0.0006995754,0.00042769875,0.00001163826],"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.000056669352,0.00027693307,0.00005997351,0.000116559044,0.0000105121135,0.000017287923,0.010818769,0.000019453359,0.0014655452,0.98548496,0.000017183957,0.0016561551],"study_design_scores_gemma":[0.0005421032,0.0003410734,0.00050477847,0.00027703805,0.000014581466,0.00001859996,0.00043115427,0.22744566,0.0013979299,0.76879734,8.8664694e-7,0.00022888188],"about_ca_topic_score_codex":0.0000041081626,"about_ca_topic_score_gemma":0.0000021228489,"teacher_disagreement_score":0.307904,"about_ca_system_score_codex":0.000057304664,"about_ca_system_score_gemma":0.00010586723,"threshold_uncertainty_score":0.9999904},"labels":[],"label_agreement":null},{"id":"W2048900104","doi":"10.46298/dmtcs.3401","title":"An upper bound for the chromatic number of line graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"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; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Multigraph; Mathematics; Line graph; Discrete mathematics; Graph; Bounded function; Upper and lower bounds; Chromatic polynomial; Chromatic scale; Clique number; Perfect graph; Friendship graph; Bound graph; Critical graph; Graph power","score_opus":0.018968031415611628,"score_gpt":0.33203150706922924,"score_spread":0.3130634756536176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048900104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040256154,0.00004687562,0.9565977,0.0012459577,0.00017602443,0.00066434435,0.000008355222,0.0001248378,0.0008797751],"genre_scores_gemma":[0.5466151,0.00000512058,0.45308658,0.00016408517,0.00006632247,0.000036461497,8.799791e-7,0.000014581494,0.000010835888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649924,0.00011922147,0.000630231,0.00071600114,0.0011998438,0.0008354533],"domain_scores_gemma":[0.9951264,0.0017514658,0.00020224316,0.0021726657,0.0004424487,0.00030475037],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0034071833,0.00029013873,0.00038880223,0.00019021696,0.00069696933,0.00055020396,0.00553726,0.000065397064,0.00008151851],"category_scores_gemma":[0.00027737246,0.00018101052,0.00021012759,0.0014228576,0.005055673,0.0011597616,0.0008750183,0.00023837296,0.00004790722],"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.000009021808,0.00016589045,0.000022419277,0.000051648367,0.000014913167,9.3420704e-7,0.0015747925,0.00040560326,0.0010233464,0.9847762,0.000017648905,0.011937585],"study_design_scores_gemma":[0.00016047657,0.0001156637,0.000034147164,0.00003218006,0.0000093043445,0.000024162358,0.000037993585,0.51099205,0.0029162602,0.48549747,0.000040954794,0.00013929392],"about_ca_topic_score_codex":0.0000010233942,"about_ca_topic_score_gemma":8.967056e-7,"teacher_disagreement_score":0.5105865,"about_ca_system_score_codex":0.0000402164,"about_ca_system_score_gemma":0.00013070233,"threshold_uncertainty_score":0.99984324},"labels":[],"label_agreement":null},{"id":"W205074548","doi":"10.46298/dmtcs.3342","title":"Random Infinite Permutations and the Cyclic Time Random Walk","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":30,"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":"Random walk; Combinatorics; Mathematics; Vertex (graph theory); Random graph; Random regular graph; Heterogeneous random walk in one dimension; Discrete mathematics; Graph; Statistics; Line graph; 1-planar graph","score_opus":0.014157810251837991,"score_gpt":0.27825840659705675,"score_spread":0.26410059634521876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205074548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005711886,0.000060062215,0.9807107,0.0005810127,0.00015247785,0.0006855087,0.00001396298,0.000094710726,0.011989695],"genre_scores_gemma":[0.69120073,0.00001555044,0.3083101,0.00027271177,0.000048478687,0.000057179444,0.0000015195238,0.000028747741,0.00006502135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972559,0.00022542938,0.0006403602,0.0004896625,0.0008105787,0.0005780741],"domain_scores_gemma":[0.9898586,0.008847468,0.00017602034,0.00061730086,0.00022590527,0.0002746866],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0035652895,0.0003100829,0.00061567023,0.000103244696,0.0007609923,0.00044529358,0.0006840096,0.000073547984,0.00026497978],"category_scores_gemma":[0.007953885,0.00017786722,0.00012947479,0.00059454027,0.0042937943,0.00016361146,0.00028093212,0.00027625848,0.00008348203],"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.000065246146,0.00005804394,5.5394844e-7,0.00006917706,0.000020702024,0.0000043004165,0.001935504,0.000010888903,0.00006594532,0.99722207,0.00004299257,0.0005045905],"study_design_scores_gemma":[0.0024607226,0.000049215807,0.0000012399961,0.000058380883,0.000080916565,0.00006933034,0.000097077755,0.3579671,0.00011580385,0.6389082,0.00002292035,0.00016904647],"about_ca_topic_score_codex":8.1582624e-7,"about_ca_topic_score_gemma":3.9957948e-7,"teacher_disagreement_score":0.6854888,"about_ca_system_score_codex":0.000022820921,"about_ca_system_score_gemma":0.00009483844,"threshold_uncertainty_score":0.99841595},"labels":[],"label_agreement":null},{"id":"W2085842155","doi":"10.46298/dmtcs.396","title":"Foreword to the special issue dedicated to the tenth ''Journées montoises d'informatique théorique''","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Czech; Library science; Mathematics; Humanities; Art; Computer science; Philosophy; Linguistics","score_opus":0.009133353797061221,"score_gpt":0.2545103635625403,"score_spread":0.24537700976547908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085842155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009617717,0.000016617278,0.95866585,0.020278689,0.0011096474,0.000878075,0.000007337253,0.00022799126,0.009198087],"genre_scores_gemma":[0.72932357,0.000005567468,0.26267007,0.0059550502,0.0019406226,0.0000427154,0.0000010833772,0.00002146541,0.000039824194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957904,0.00013645428,0.00075262523,0.00068258826,0.0014790732,0.0011588373],"domain_scores_gemma":[0.99584985,0.0010120824,0.00018358437,0.001985946,0.00031544425,0.0006530741],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.006426838,0.00039555447,0.00035033977,0.0003617391,0.0014567049,0.0011789448,0.007794615,0.000082668266,0.00010534073],"category_scores_gemma":[0.00047036548,0.00020598939,0.00021102073,0.003283047,0.001605601,0.0006648026,0.0024797574,0.000447112,0.00038208312],"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.000018996596,0.000055327608,0.000014419575,0.000012617808,0.000012625635,0.000007667549,0.012639509,0.00014562123,0.00005530269,0.9449237,0.0037634359,0.03835076],"study_design_scores_gemma":[0.00029942335,0.00078664586,0.00078286487,0.00025872616,0.00003675336,0.00014658777,0.0015623136,0.29265356,0.0043611648,0.6573764,0.04082883,0.00090670324],"about_ca_topic_score_codex":0.000004828391,"about_ca_topic_score_gemma":0.00003411107,"teacher_disagreement_score":0.7197059,"about_ca_system_score_codex":0.00006228003,"about_ca_system_score_gemma":0.00010954232,"threshold_uncertainty_score":0.9998579},"labels":[],"label_agreement":null},{"id":"W2096264934","doi":"10.46298/dmtcs.3617","title":"The Rees product of the cubical lattice with the chain","year":2008,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"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; Bijection; Combinatorics; Möbius function; Partially ordered set; Lattice (music); Product (mathematics); Generating function; Geometry; Physics","score_opus":0.017726169387557632,"score_gpt":0.2672123173527496,"score_spread":0.24948614796519195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096264934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12954773,0.0018205114,0.79551643,0.05101583,0.0045511867,0.0043692305,0.00004062668,0.00022530383,0.012913167],"genre_scores_gemma":[0.8034518,0.00012515078,0.19388707,0.00026467003,0.00064438663,0.00008164394,6.445321e-7,0.00012383306,0.0014208507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924576,0.0006788367,0.0013592683,0.0008918846,0.0031488186,0.0014635923],"domain_scores_gemma":[0.9858029,0.007791757,0.0010432851,0.004102955,0.0009457424,0.000313394],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0052730306,0.0007461002,0.0009118143,0.0000818139,0.0033701535,0.00038233286,0.00587594,0.00016310827,0.00005955318],"category_scores_gemma":[0.0035110852,0.0003162973,0.00037692513,0.0022953951,0.03817661,0.0004019261,0.0023786556,0.0011854114,0.000058892398],"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.000035411907,0.00040666707,0.000018604012,0.0004039655,0.00008046396,0.00001426236,0.008551501,0.00011589838,0.00014201018,0.9886393,0.0006469501,0.0009449741],"study_design_scores_gemma":[0.00046443765,0.00034497527,0.000061432045,0.0008594947,0.00024985633,0.00053998706,0.000788508,0.10015227,0.003910982,0.8908089,0.001318894,0.0005002746],"about_ca_topic_score_codex":0.000004941776,"about_ca_topic_score_gemma":0.000007353927,"teacher_disagreement_score":0.673904,"about_ca_system_score_codex":0.000158444,"about_ca_system_score_gemma":0.0005946911,"threshold_uncertainty_score":0.9999289},"labels":[],"label_agreement":null},{"id":"W2096790857","doi":"10.46298/dmtcs.2997","title":"Locally Restricted Compositions IV. Nearly Free Large Parts and Gap-Freeness","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Statistics Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Poisson distribution; Combinatorics; Composition (language); Pure mathematics; Statistics","score_opus":0.02657450353774132,"score_gpt":0.29758261620823345,"score_spread":0.27100811267049213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096790857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015154473,0.000069458336,0.98057693,0.00040650825,0.00029091234,0.00040137852,0.00009275446,0.00017211442,0.0028354924],"genre_scores_gemma":[0.6202711,0.000004485179,0.37939107,0.00015559106,0.000116833195,0.000021461463,0.000004002137,0.000025973244,0.000009487463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967389,0.00008259364,0.0005975693,0.00050390477,0.0009739029,0.001103143],"domain_scores_gemma":[0.99603885,0.0018460044,0.000166776,0.0009540207,0.00028933506,0.00070500316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013639022,0.00034718908,0.000491167,0.00013888317,0.00067178195,0.0003662589,0.0010581503,0.000116625626,0.00012793642],"category_scores_gemma":[0.0019317907,0.0002702746,0.00007995301,0.0007158931,0.0016933338,0.00040426094,0.0011371995,0.00030499962,0.000039981638],"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.000011891062,0.00029334126,0.000018308834,0.0001620086,0.00001494328,0.0000073241586,0.0011526044,0.0000019232778,0.00014583296,0.99742174,0.00020177329,0.0005682955],"study_design_scores_gemma":[0.00038979753,0.0001514098,0.00009522206,0.00014536126,0.00006906774,0.00007208966,0.000109811335,0.24384457,0.00017369693,0.7546212,0.000030020192,0.0002977664],"about_ca_topic_score_codex":0.0000016561521,"about_ca_topic_score_gemma":0.0000012284685,"teacher_disagreement_score":0.6051166,"about_ca_system_score_codex":0.000041452033,"about_ca_system_score_gemma":0.000080357626,"threshold_uncertainty_score":0.99997497},"labels":[],"label_agreement":null},{"id":"W2102104245","doi":"10.46298/dmtcs.3016","title":"The Möbius function of generalized subword order","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Partially ordered set; Antichain; Combinatorics; Order (exchange); Möbius function; Homotopy; Pure mathematics","score_opus":0.022732350486594003,"score_gpt":0.29900549181610653,"score_spread":0.27627314132951253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102104245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08171466,0.00009959379,0.9103385,0.00023749063,0.0015564284,0.00055676396,0.000003838312,0.00015867679,0.0053340374],"genre_scores_gemma":[0.6664028,0.000009993332,0.33320233,0.000042698673,0.00023195863,0.00002887096,8.910476e-7,0.000040705385,0.000039705836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99612665,0.00015485604,0.00096752023,0.00037291626,0.0013651113,0.001012951],"domain_scores_gemma":[0.9946632,0.0025607003,0.00049388816,0.0014035222,0.00055352657,0.00032518254],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003688231,0.00036739465,0.0005536334,0.00012424379,0.00069718977,0.00017975875,0.0014216992,0.0001051975,0.00009351912],"category_scores_gemma":[0.0020460153,0.00022846641,0.00017490776,0.0011912585,0.0032645087,0.00046552718,0.0007191074,0.00028901728,0.000046820973],"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.000023086364,0.00022424507,0.000020515301,0.000108943794,0.000028641802,5.5688156e-7,0.001156484,0.000008817028,0.0007792351,0.99610454,0.00011785869,0.0014270958],"study_design_scores_gemma":[0.0003579936,0.00013302783,0.000028479892,0.00008456668,0.000084582156,0.000017738665,0.00018009536,0.03188982,0.0035767455,0.96310794,0.00024683028,0.00029215426],"about_ca_topic_score_codex":8.166657e-7,"about_ca_topic_score_gemma":5.1998796e-7,"teacher_disagreement_score":0.5846882,"about_ca_system_score_codex":0.00007425354,"about_ca_system_score_gemma":0.00010038383,"threshold_uncertainty_score":0.99944806},"labels":[],"label_agreement":null},{"id":"W2104176064","doi":"10.46298/dmtcs.427","title":"On-line Ramsey numbers for paths and stars","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Statistics Canada; Dalhousie University","funders":"","keywords":"Combinatorics; Ramsey's theorem; Clique; Joins; Monochromatic color; Graph; Mathematics; Enhanced Data Rates for GSM Evolution; Upper and lower bounds; Line (geometry); Discrete mathematics; Computer science; Physics; Geometry; Artificial intelligence","score_opus":0.030219040816852144,"score_gpt":0.2993518997009093,"score_spread":0.26913285888405714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104176064","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.40915594,0.000014276321,0.58609074,0.00018520615,0.00029146994,0.00048589113,0.000023160681,0.00010534434,0.0036479658],"genre_scores_gemma":[0.706103,0.000009135956,0.29342833,0.00029274085,0.00008411267,0.000019086496,0.0000016309551,0.000028788156,0.000033111945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975644,0.000057595433,0.000477544,0.00059760624,0.00069236953,0.0006105072],"domain_scores_gemma":[0.9964436,0.002194925,0.00014814902,0.00074758724,0.00017020831,0.00029552245],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0013665278,0.00032443707,0.0004515974,0.00014588943,0.0010981992,0.000118829856,0.0007956492,0.00009653907,0.000062811196],"category_scores_gemma":[0.00088884996,0.00022615114,0.00014734169,0.00033085953,0.004677358,0.0001610235,0.00047373673,0.000222801,0.000006260239],"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.000031682626,0.00008379113,0.000012325808,0.00009649176,0.000017315511,0.000009055257,0.0033500078,0.000013636544,0.000076611184,0.9953329,0.00028445583,0.00069171464],"study_design_scores_gemma":[0.0004388351,0.0003495461,0.00002109407,0.000078203106,0.000026800466,0.00008782714,0.000085415195,0.10294998,0.0006518431,0.8949773,0.00004172072,0.00029145932],"about_ca_topic_score_codex":5.4805093e-7,"about_ca_topic_score_gemma":2.8338636e-7,"teacher_disagreement_score":0.29694712,"about_ca_system_score_codex":0.00002899228,"about_ca_system_score_gemma":0.000051656218,"threshold_uncertainty_score":0.9980313},"labels":[],"label_agreement":null},{"id":"W2104751344","doi":"10.46298/dmtcs.2740","title":"New Hopf Structures on Binary Trees","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":5,"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":"National Science Foundation","keywords":"Polytope; Combinatorics; Mathematics; Hypercube; Hopf algebra; Factorization; Algebraic number; Algebra over a field; Pure mathematics","score_opus":0.018872586472879163,"score_gpt":0.3053697799279685,"score_spread":0.28649719345508934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104751344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0453594,0.000021616985,0.9335866,0.0014044427,0.00081523065,0.000682654,0.0000075598678,0.00057027675,0.017552223],"genre_scores_gemma":[0.51762265,0.0000031675286,0.48163697,0.0003501069,0.00027905754,0.000005134611,0.0000012967739,0.000037659498,0.000063946005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955099,0.0000861443,0.00083774317,0.00086864596,0.0017029942,0.0009945326],"domain_scores_gemma":[0.995849,0.0013133587,0.00032705037,0.0017016213,0.00020056045,0.0006083682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010648816,0.0006070621,0.0007577896,0.00032488746,0.00055277435,0.00041105633,0.0021071718,0.00015412446,0.00025209502],"category_scores_gemma":[0.0011804304,0.00045409423,0.0002299272,0.001063159,0.0013874127,0.00040700712,0.00042607923,0.00047760742,0.00010726517],"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.000025297404,0.0002223721,0.0000010389502,0.000043415046,0.000012817468,0.000020764039,0.0011701242,0.000072046634,0.00094961294,0.99154073,0.001094704,0.0048470837],"study_design_scores_gemma":[0.0005139484,0.000844566,0.00004084843,0.00017868628,0.000044679215,0.00004163639,0.00006907014,0.03175271,0.004164099,0.96170926,0.000090185335,0.0005502962],"about_ca_topic_score_codex":6.1290467e-7,"about_ca_topic_score_gemma":3.0380087e-7,"teacher_disagreement_score":0.47226328,"about_ca_system_score_codex":0.00012171374,"about_ca_system_score_gemma":0.00015943623,"threshold_uncertainty_score":0.9997911},"labels":[],"label_agreement":null},{"id":"W2105454564","doi":"10.46298/dmtcs.388","title":"On the tileability of polygons with colored dominoes","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Colored; Mathematics; Combinatorics; Rectangle; Polygon (computer graphics); Domino; Simple (philosophy); Set (abstract data type); Frame (networking); Computer science; Geometry","score_opus":0.009981600331774546,"score_gpt":0.24900182296748405,"score_spread":0.2390202226357095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105454564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13306014,0.000004339039,0.857592,0.0010561167,0.000057409277,0.0003366609,0.0000030530764,0.00008949589,0.0078007826],"genre_scores_gemma":[0.7590372,3.9324019e-7,0.24075751,0.0001657723,0.000015496305,0.000010354942,5.3177047e-7,0.0000061968863,0.000006565164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779844,0.00004674609,0.00038861934,0.00048667868,0.00082888594,0.00045061467],"domain_scores_gemma":[0.9963409,0.0015978877,0.0001577473,0.0015612814,0.0001733013,0.00016891026],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024887274,0.00018304487,0.00022926024,0.000109048546,0.00039332313,0.00021870948,0.0026479177,0.00003873564,0.00003550368],"category_scores_gemma":[0.00013395929,0.0000975744,0.00008060868,0.001170872,0.003765116,0.00019460433,0.00059534283,0.00016879587,0.000031366522],"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.000007737374,0.00013322478,0.000013068976,0.000012436004,0.000005735833,0.0000023528257,0.0010034742,0.000029856705,0.00139649,0.9958335,0.000019182586,0.001542954],"study_design_scores_gemma":[0.00018189513,0.00026170473,0.00070752716,0.000055843706,0.000011420282,0.000025259884,0.00009344134,0.42006114,0.022440746,0.55593187,0.000031166597,0.00019796325],"about_ca_topic_score_codex":0.0000021374296,"about_ca_topic_score_gemma":0.00000157678,"teacher_disagreement_score":0.62597704,"about_ca_system_score_codex":0.00002923862,"about_ca_system_score_gemma":0.00009262654,"threshold_uncertainty_score":0.9989461},"labels":[],"label_agreement":null},{"id":"W2114421280","doi":"10.46298/dmtcs.3513","title":"The Diameter of the Minimum Spanning Tree of a Complete Graph","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"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; Combinatorics; Spanning tree; Minimum spanning tree; Graph; Independent and identically distributed random variables; Minimum degree spanning tree; Tree (set theory); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Statistics; Random variable","score_opus":0.018335196805992635,"score_gpt":0.27569590814268524,"score_spread":0.2573607113366926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114421280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024670076,0.000072951516,0.96939397,0.0007691047,0.00025892546,0.00038675524,0.000007121547,0.000050132883,0.0043909396],"genre_scores_gemma":[0.75640947,0.000002956594,0.2434654,0.0000449456,0.000031580334,0.000011392177,3.062776e-7,0.000012385335,0.000021561616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960195,0.00025976013,0.00078083755,0.0005563636,0.0016230561,0.0007604894],"domain_scores_gemma":[0.9948206,0.0020573584,0.0003996604,0.0022075283,0.00038914534,0.00012573364],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0028843868,0.00025755074,0.00039414637,0.00019567618,0.0007123595,0.00028112053,0.0066290777,0.00005049714,0.0000075670355],"category_scores_gemma":[0.0003187997,0.00013499134,0.00029311253,0.002339467,0.010863554,0.0003637483,0.0019097555,0.00028363577,0.0000066707034],"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.0000067113892,0.00006566161,0.00009584251,0.000032944023,0.000009600111,0.0000015040249,0.00055252167,0.00016407864,0.008682807,0.9882458,0.00002784109,0.0021147288],"study_design_scores_gemma":[0.0001590881,0.000097114214,0.00070312823,0.00008814477,0.000008313948,0.000013355509,0.000045015873,0.25072956,0.014472507,0.7335119,0.00002908925,0.00014277663],"about_ca_topic_score_codex":0.0000049430205,"about_ca_topic_score_gemma":0.0000033678139,"teacher_disagreement_score":0.7317394,"about_ca_system_score_codex":0.00002611521,"about_ca_system_score_gemma":0.00010910014,"threshold_uncertainty_score":0.99874556},"labels":[],"label_agreement":null},{"id":"W2114920334","doi":"10.46298/dmtcs.282","title":"Sums of Digits, Overlaps, and Palindromes","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":48,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Palindrome; Combinatorics; Word (group theory); Base (topology); Symbol (formal); Arithmetic; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.007898847532994717,"score_gpt":0.23463548952621338,"score_spread":0.22673664199321866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114920334","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.26000607,0.0001025901,0.73013103,0.00037702103,0.00013361788,0.00017693588,0.000006767503,0.00016404022,0.008901941],"genre_scores_gemma":[0.80170757,0.000028777202,0.19802648,0.00016254438,0.000029759036,0.0000037707878,8.4899904e-7,0.0000098005985,0.00003045569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976628,0.000056183973,0.00045622344,0.0006034436,0.0007227789,0.0004985996],"domain_scores_gemma":[0.9981664,0.00038678973,0.00010941001,0.0010047627,0.00008560355,0.00024706],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011425534,0.00023296359,0.0003692225,0.0001328452,0.00022883326,0.00046199097,0.0019945893,0.000057410245,0.00017934963],"category_scores_gemma":[0.00006309705,0.00017375617,0.000085894346,0.00072320015,0.0027163725,0.00071611203,0.00072542997,0.00013298706,0.000040616593],"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.0000024527867,0.000047753743,0.00002830031,0.000037949983,0.000006621374,0.000006377419,0.0010754956,0.00001111296,0.0004270931,0.95479304,0.000018720977,0.04354508],"study_design_scores_gemma":[0.00017613964,0.00012747783,0.00033180875,0.000098482706,0.000007667528,0.00007165282,0.000028842296,0.4661273,0.0030961582,0.5296078,0.000096030286,0.00023068296],"about_ca_topic_score_codex":0.000002284074,"about_ca_topic_score_gemma":1.6075333e-7,"teacher_disagreement_score":0.5417015,"about_ca_system_score_codex":0.000014252177,"about_ca_system_score_gemma":0.000057423033,"threshold_uncertainty_score":0.9999977},"labels":[],"label_agreement":null},{"id":"W2121104987","doi":"10.46298/dmtcs.1264","title":"On the Meyniel condition for hamiltonicity in bipartite digraphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Bipartite graph; Combinatorics; Mathematics; Hamiltonian (control theory); Discrete mathematics; Hamiltonian path; Strongly connected component; Graph","score_opus":0.019441468272439758,"score_gpt":0.3031915034484831,"score_spread":0.28375003517604336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121104987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048405703,0.0000066446064,0.9448325,0.0018308633,0.0001866882,0.00066350447,0.0000050528997,0.00011150389,0.0039575095],"genre_scores_gemma":[0.86276835,0.0000020147206,0.13643001,0.00063861767,0.000036325426,0.0001019957,0.0000013692921,0.000013893248,0.000007443721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967426,0.0002457042,0.0004343473,0.00078154705,0.0009496149,0.000846156],"domain_scores_gemma":[0.99398273,0.0040141856,0.00012575639,0.0014752772,0.00019416118,0.00020788342],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0052692033,0.0002568899,0.00030293764,0.00032114936,0.0005850093,0.00054316764,0.0034428013,0.00006147017,0.00002792219],"category_scores_gemma":[0.001142083,0.00016283328,0.00014189219,0.0015480429,0.0030181352,0.0005270015,0.00074569316,0.0003212247,0.000050445193],"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.000010404895,0.00008473432,0.000009683119,0.000020750758,0.0000037916539,0.0000012476607,0.00079028826,0.0002518317,0.0006053041,0.9965698,0.00003847881,0.0016136855],"study_design_scores_gemma":[0.0001565891,0.00015892542,0.000040702165,0.000047020338,0.0000017617425,0.0000032241592,0.000017469501,0.47610986,0.0031094512,0.5202013,0.00003140816,0.00012223993],"about_ca_topic_score_codex":8.8209555e-7,"about_ca_topic_score_gemma":0.0000015092038,"teacher_disagreement_score":0.81436265,"about_ca_system_score_codex":0.000051672057,"about_ca_system_score_gemma":0.00006260768,"threshold_uncertainty_score":0.99969506},"labels":[],"label_agreement":null},{"id":"W2126679330","doi":"10.46298/dmtcs.459","title":"Ore and Erdős type conditions for long cycles in balanced bipartite graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Akademia Górniczo-Hutnicza im. Stanislawa Staszica","keywords":"Bipartite graph; Conjecture; Combinatorics; Mathematics; Type (biology); Graph; Order (exchange); Discrete mathematics; Geology; Business","score_opus":0.019825292058108228,"score_gpt":0.31279358187684275,"score_spread":0.2929682898187345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126679330","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.80276704,0.00004999918,0.1938258,0.00044680672,0.00022898144,0.0006123616,0.000019122203,0.00010399017,0.0019458922],"genre_scores_gemma":[0.877762,0.0000101714795,0.12191047,0.00023499377,0.000043490956,0.000012187587,0.00000359941,0.000014818257,0.000008230336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818206,0.000049799477,0.00043562433,0.00045015902,0.00036180316,0.0005205618],"domain_scores_gemma":[0.99825996,0.0008086797,0.000112216876,0.0005024734,0.00013764646,0.0001790497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010521279,0.00023792872,0.00037667112,0.0002261937,0.00045219282,0.00017632215,0.0005679213,0.00008312607,0.00003349358],"category_scores_gemma":[0.00046238597,0.00017556011,0.00008791866,0.00062135427,0.0019579467,0.00020802623,0.00019905843,0.00017044638,0.0000023352798],"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.000016903565,0.000066233086,0.00023941603,0.00006733357,0.0000070697465,0.0000045241536,0.0015379087,0.00000937991,0.00030750735,0.9967558,0.00004742335,0.00094051554],"study_design_scores_gemma":[0.0003403193,0.00015829894,0.002781671,0.00013714051,0.000024301084,0.000024258012,0.00007570302,0.06192377,0.00046779367,0.9338245,0.0000070465735,0.00023519823],"about_ca_topic_score_codex":3.2538657e-7,"about_ca_topic_score_gemma":0.0000015200468,"teacher_disagreement_score":0.07499498,"about_ca_system_score_codex":0.00002057121,"about_ca_system_score_gemma":0.000032155123,"threshold_uncertainty_score":0.7214137},"labels":[],"label_agreement":null},{"id":"W2133087912","doi":"10.46298/dmtcs.397","title":"On the critical exponent of generalized Thue-Morse words","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":9,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Infimum and supremum; Exponent; Mathematics; Morse code; Set (abstract data type); Critical exponent; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.01614136682013868,"score_gpt":0.2813352824947019,"score_spread":0.26519391567456324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133087912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10898168,0.00002614278,0.8827314,0.00232872,0.0004918343,0.00023405331,0.0000031574082,0.0001459087,0.0050571105],"genre_scores_gemma":[0.765916,0.000002312487,0.23314102,0.0008356054,0.00007530392,0.000007345201,4.7485625e-7,0.000013472936,0.000008446319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99614483,0.00014619534,0.00070814625,0.00068116107,0.0014682184,0.0008514424],"domain_scores_gemma":[0.99404097,0.0034638846,0.00016916222,0.0018059917,0.00020877479,0.0003111935],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0059119747,0.00030990195,0.00039093668,0.0002183071,0.00045770477,0.00040467613,0.004036618,0.000075887285,0.00014108692],"category_scores_gemma":[0.00079218316,0.00018233982,0.00019266832,0.0011579123,0.0044349656,0.00037085483,0.0013131502,0.00029128717,0.00006947247],"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.00001053187,0.00016622643,0.000003232524,0.000023355959,0.0000075513008,0.000016565582,0.0018913848,0.000021634614,0.002017599,0.99299747,0.000081261685,0.002763203],"study_design_scores_gemma":[0.0001378956,0.0001584115,0.000063719315,0.00009971756,0.000008081042,0.000026279627,0.00009454634,0.3133587,0.01582426,0.67000616,0.000018726472,0.00020352362],"about_ca_topic_score_codex":0.00000203104,"about_ca_topic_score_gemma":3.567873e-7,"teacher_disagreement_score":0.6569343,"about_ca_system_score_codex":0.000044131095,"about_ca_system_score_gemma":0.00008826553,"threshold_uncertainty_score":0.9982744},"labels":[],"label_agreement":null},{"id":"W2135716534","doi":"10.46298/dmtcs.532","title":"On the metric dimension of Grassmann graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":53,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Linear subspace; Vertex (graph theory); Metric dimension; Dimension (graph theory); Graph; Subspace topology; Metric (unit); Grassmannian; Discrete mathematics; Pure mathematics; Pathwidth; Line graph","score_opus":0.01632379254665654,"score_gpt":0.2504834117644909,"score_spread":0.23415961921783437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135716534","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.17134716,0.00009829734,0.82262063,0.001048086,0.0006439723,0.0002745003,0.0000016385089,0.00014027467,0.0038254154],"genre_scores_gemma":[0.85033524,0.000004462734,0.14919324,0.00043249765,0.000010943377,0.000008300214,4.20384e-7,0.000010120336,0.0000047736958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968661,0.00014304645,0.00049507763,0.00046092676,0.0013165396,0.00071831833],"domain_scores_gemma":[0.99644816,0.0012963092,0.00021720341,0.001502355,0.00023507293,0.00030089996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038543285,0.00025010228,0.0003056233,0.00041596463,0.0004726486,0.00021569073,0.002438671,0.000058269365,0.000027412298],"category_scores_gemma":[0.00040618816,0.00013860299,0.00016254392,0.0028029433,0.0023118027,0.00045804484,0.0010107743,0.00023630718,0.00008301363],"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.0000020014168,0.00017089682,0.00004927981,0.000015888714,0.00000816542,8.070961e-7,0.00091741415,0.00007292807,0.0008824537,0.9969203,0.0001271971,0.00083270506],"study_design_scores_gemma":[0.000096375195,0.00012233829,0.00010439556,0.000065238426,0.000010739573,0.000012585485,0.00002922019,0.26379922,0.006276274,0.7293163,0.0000071696295,0.00016014687],"about_ca_topic_score_codex":0.0000017073845,"about_ca_topic_score_gemma":5.0860894e-8,"teacher_disagreement_score":0.6789881,"about_ca_system_score_codex":0.00001870463,"about_ca_system_score_gemma":0.000043477965,"threshold_uncertainty_score":0.85179335},"labels":[],"label_agreement":null},{"id":"W2136786922","doi":"10.46298/dmtcs.2968","title":"Conservation Laws and Invariant Measures in Surjective Cellular Automata","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":9,"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":"Academy of Finland","keywords":"Surjective function; Mathematics; Corollary; Conservation law; Invariant (physics); Cellular automaton; Bernoulli's principle; Discrete mathematics; Markov chain; Probability measure; Invariant measure; Transitive relation; Generalization; Pure mathematics; Bernoulli process; Combinatorics; Mathematical analysis; Algorithm; Mathematical physics; Statistics","score_opus":0.026033746646894236,"score_gpt":0.24102390805502244,"score_spread":0.2149901614081282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136786922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057768777,0.00002566675,0.9353357,0.0004724661,0.00009063136,0.00033233038,0.000002700003,0.00018269889,0.0057890043],"genre_scores_gemma":[0.70347595,0.000005048634,0.29632354,0.00014755364,0.000012814106,0.000021621481,0.0000013305711,0.000007917809,0.0000042069037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978114,0.000095637915,0.00042104165,0.0006790505,0.000551601,0.0004412621],"domain_scores_gemma":[0.9983697,0.00022544415,0.00011747231,0.00095767516,0.0001325922,0.00019715031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017737998,0.00021141995,0.00026294694,0.00022181615,0.00027201968,0.00037496255,0.0015896912,0.00006289338,0.000018508892],"category_scores_gemma":[0.00011130479,0.00017547476,0.000047321795,0.0010428772,0.0015696314,0.0006951118,0.0009687317,0.00017135046,0.000034063323],"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.0000019715512,0.00013705388,0.000111493566,0.000018293409,0.0000040700243,0.000012746489,0.0044011604,0.0000025760037,0.0018731263,0.9913947,0.000010806529,0.0020319796],"study_design_scores_gemma":[0.00020338618,0.000051550105,0.0015341315,0.00004082764,0.0000057295924,0.000025169773,0.000054678672,0.60807043,0.0058075306,0.38399813,0.00002096314,0.00018747256],"about_ca_topic_score_codex":0.00003426603,"about_ca_topic_score_gemma":0.00000925099,"teacher_disagreement_score":0.6457072,"about_ca_system_score_codex":0.00003748591,"about_ca_system_score_gemma":0.00010735247,"threshold_uncertainty_score":0.7155653},"labels":[],"label_agreement":null},{"id":"W2137385627","doi":"10.46298/dmtcs.295","title":"Performance analysis of demodulation with diversity - A combinatorial approach I : Symmetric function theoretical methods","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","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":"Nortel (Canada)","funders":"","keywords":"Diversity (politics); Demodulation; Function (biology); Modulation (music); Computer science; Mathematics; Applied mathematics; Telecommunications; Physics; Political science; Biology","score_opus":0.0135332505756409,"score_gpt":0.22305796636561478,"score_spread":0.2095247157899739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137385627","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.32518724,0.000016183398,0.66426927,0.0000044161234,0.00019180917,0.0001446356,0.0000028317559,0.00009472228,0.010088861],"genre_scores_gemma":[0.91730976,0.0000040702307,0.08261948,0.0000072522416,0.000033358272,0.000007138878,0.0000034538489,0.000013826262,0.0000016577987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980733,0.00014360242,0.00038162703,0.0003460016,0.00069684663,0.0003586439],"domain_scores_gemma":[0.99875855,0.0003250014,0.00009356031,0.0005267985,0.00014174388,0.00015433691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018676729,0.00022219568,0.0004768337,0.0006199272,0.0003359253,0.000078913334,0.00059805665,0.000083668456,0.00011948231],"category_scores_gemma":[0.000051687362,0.00016292832,0.0001470407,0.0040825973,0.0020858317,0.00026888098,0.00025279372,0.00017956369,0.000006421149],"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.000015448748,0.000089780304,0.0006974623,0.00011300408,0.00019443511,5.0489433e-7,0.0012758435,0.012719999,0.00012458327,0.9827306,0.0000020274351,0.0020362884],"study_design_scores_gemma":[0.00020926612,0.00017544121,0.0017351086,0.000028859089,0.00050185365,0.0000056159383,0.00006741069,0.91604996,0.00038540037,0.08063912,0.0000011512573,0.00020079626],"about_ca_topic_score_codex":5.820526e-7,"about_ca_topic_score_gemma":5.4139704e-8,"teacher_disagreement_score":0.90332997,"about_ca_system_score_codex":0.00003992575,"about_ca_system_score_gemma":0.000006206723,"threshold_uncertainty_score":0.7685334},"labels":[],"label_agreement":null},{"id":"W2138435418","doi":"10.46298/dmtcs.2708","title":"The shifted plactic monoid (extended abstract)","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Monoid; Mathematics; Noncommutative geometry; Combinatorics; Schur's theorem; Characterization (materials science); Function (biology); Free monoid; Pure mathematics; Orthogonal polynomials","score_opus":0.018104021209475005,"score_gpt":0.3043896438740988,"score_spread":0.28628562266462376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138435418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07896366,0.00007558077,0.8854818,0.0028357178,0.0013088998,0.0014113833,0.000007761133,0.00082197186,0.029093277],"genre_scores_gemma":[0.73152995,0.000009987741,0.26798788,0.00016752485,0.00018767825,0.000022475479,0.0000010519738,0.000042659387,0.00005079832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99497604,0.00009644047,0.0011298151,0.00076893356,0.0017605312,0.0012682179],"domain_scores_gemma":[0.99295527,0.0036932696,0.0004951051,0.0020042218,0.00039371755,0.00045839386],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0031276888,0.0005586305,0.0006381821,0.00016064613,0.001434843,0.00085211406,0.0027521004,0.00014309287,0.00007772984],"category_scores_gemma":[0.0029427004,0.0003592171,0.00023514105,0.0010704248,0.0030142742,0.0005458277,0.00049968855,0.0006278996,0.00012550056],"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.000024216764,0.0002832592,7.592392e-7,0.000050032362,0.000016914215,0.0000151104,0.0011027403,0.000008142472,0.00049628224,0.99336714,0.00015581341,0.0044795964],"study_design_scores_gemma":[0.00038970716,0.00025699884,0.00006344747,0.00013033641,0.00004965626,0.000055515004,0.00017990319,0.06890869,0.0021099038,0.92730814,0.000092343966,0.0004553626],"about_ca_topic_score_codex":4.6739964e-7,"about_ca_topic_score_gemma":6.241073e-7,"teacher_disagreement_score":0.6525663,"about_ca_system_score_codex":0.0001536381,"about_ca_system_score_gemma":0.00015704095,"threshold_uncertainty_score":0.999886},"labels":[],"label_agreement":null},{"id":"W2138718066","doi":"10.23638/dmtcs-19-1-17","title":"Backbone colouring and algorithms for TDMA scheduling","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada; Ministerul Cercetării şi Inovării; Narodowym Centrum Nauki; China Scholarship Council; National Research Foundation; Ministero dell’Istruzione, dell’Università e della Ricerca; National Natural Science Foundation of China; Austrian Science Fund; Agence Nationale de la Recherche; Danmarks Tekniske Universitet; Centre National de la Recherche Scientifique; Swedish Foundation for International Cooperation in Research and Higher Education; European Commission","keywords":"Computer science; Programming language","score_opus":0.030654670656054407,"score_gpt":0.2937834875819342,"score_spread":0.26312881692587975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138718066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073359623,0.000050142335,0.9877626,0.0007817936,0.00065665186,0.00048343625,0.0000012726571,0.0001448874,0.0027832787],"genre_scores_gemma":[0.56312126,0.0000032166286,0.4366561,0.00005410371,0.000116350275,0.000020206335,3.6834336e-7,0.00000893198,0.000019478724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975717,0.0000366384,0.0003806154,0.00077400194,0.0005562378,0.0006807842],"domain_scores_gemma":[0.99747324,0.00032960472,0.0002711763,0.0014059813,0.00021492854,0.00030509706],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025375283,0.00024487803,0.00037273907,0.000102735314,0.0017914718,0.0029778415,0.002982082,0.000077423094,0.0000052514324],"category_scores_gemma":[0.000396746,0.00018566108,0.00009863061,0.00017265108,0.002366139,0.0008526743,0.0017660037,0.00014982231,0.000020774221],"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.0000020127075,0.00003505788,0.0000445131,0.000077738434,0.000008578624,0.000006175676,0.0009024788,0.000010986499,0.00018353334,0.9833372,0.000007119608,0.015384597],"study_design_scores_gemma":[0.00022534268,0.00011207788,0.00009045004,0.000023694656,0.000007227715,0.000033203607,0.00002845724,0.5619554,0.0007165496,0.43652067,0.00009982979,0.00018712996],"about_ca_topic_score_codex":0.000004209225,"about_ca_topic_score_gemma":8.9878284e-7,"teacher_disagreement_score":0.56194437,"about_ca_system_score_codex":0.000028374547,"about_ca_system_score_gemma":0.00007367976,"threshold_uncertainty_score":0.9995081},"labels":[],"label_agreement":null},{"id":"W2139825306","doi":"10.46298/dmtcs.2738","title":"Enumeration of derangements with descents in prescribed positions","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":16,"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":"Derangement; Mathematics; Enumeration; Permutation (music); Combinatorics; Generating function; Set (abstract data type); Euler's formula; Combinatorial proof; Point (geometry); Function (biology); Discrete mathematics; Mathematical analysis; Computer science; Geometry","score_opus":0.017328141364187175,"score_gpt":0.2982260312454947,"score_spread":0.2808978898813075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139825306","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21565746,0.0000075614635,0.7803487,0.00018374863,0.00009851623,0.0006308773,0.0000043742193,0.000077972836,0.002990778],"genre_scores_gemma":[0.6149335,0.0000013890161,0.3849746,0.00003913645,0.000021127924,0.0000107587575,0.0000014346493,0.000013723856,0.00000436242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730957,0.000072390896,0.00071635895,0.00042036446,0.0009828634,0.00049846264],"domain_scores_gemma":[0.99813676,0.00042141482,0.0002761149,0.0007349548,0.0002763329,0.00015440154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009201877,0.00027203845,0.00047044872,0.00025021928,0.00016818292,0.000112800844,0.0007707275,0.000065422544,0.0000343578],"category_scores_gemma":[0.0003958265,0.00020919423,0.00006786084,0.00093608163,0.0009275589,0.00042060323,0.00016135529,0.0001966799,0.000007226864],"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.000024839317,0.00059414166,0.000035237445,0.000095942094,0.000008729021,0.0000068693066,0.0018245413,0.000061269035,0.0018833069,0.9948138,0.000010036346,0.0006413043],"study_design_scores_gemma":[0.000684418,0.000411838,0.00017683319,0.00046943166,0.00003392288,0.000016404621,0.00008843908,0.065647006,0.0076333354,0.9245985,0.0000014759141,0.00023835641],"about_ca_topic_score_codex":8.3209943e-7,"about_ca_topic_score_gemma":0.0000013548931,"teacher_disagreement_score":0.39927602,"about_ca_system_score_codex":0.000085214044,"about_ca_system_score_gemma":0.00007333223,"threshold_uncertainty_score":0.8530693},"labels":[],"label_agreement":null},{"id":"W2140299153","doi":"10.46298/dmtcs.3426","title":"Pairwise Intersections and Forbidden Configurations","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Intersection (aeronautics); Bar (unit); Stability theorem; Mathematical analysis; Physics","score_opus":0.019685718830021712,"score_gpt":0.2905213732298639,"score_spread":0.27083565439984214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140299153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2174613,0.000023685445,0.755322,0.0009890284,0.00028973253,0.0003575997,0.000011846925,0.00020030467,0.025344515],"genre_scores_gemma":[0.7643785,0.000004401539,0.2352014,0.0001936426,0.00015051037,0.000012491366,8.859374e-7,0.000016917218,0.000041242936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982162,0.000058602425,0.00042132306,0.0004206845,0.00045769685,0.0004255089],"domain_scores_gemma":[0.9982066,0.00069124723,0.00010832731,0.0006084026,0.00014285509,0.00024255055],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010220852,0.000228973,0.00027561514,0.0001756436,0.0009168018,0.00025611694,0.0006080017,0.00007016879,0.00027715942],"category_scores_gemma":[0.00038190372,0.00016673814,0.0000976503,0.00035978976,0.00329579,0.00033582165,0.00052095274,0.00022398097,0.000017522809],"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.000003830277,0.000050676805,0.000011870129,0.00003255654,0.000013786656,0.0000015723055,0.0043607666,0.0000044277376,0.0002615205,0.9923724,0.00015426624,0.0027323442],"study_design_scores_gemma":[0.00017493506,0.000072062096,0.00006558066,0.000053577874,0.000035033372,0.000075510994,0.0002932256,0.1187637,0.00074545783,0.8793339,0.00017095206,0.00021606318],"about_ca_topic_score_codex":8.325736e-7,"about_ca_topic_score_gemma":0.0000028448521,"teacher_disagreement_score":0.5469172,"about_ca_system_score_codex":0.000033695367,"about_ca_system_score_gemma":0.000034915225,"threshold_uncertainty_score":0.99941665},"labels":[],"label_agreement":null},{"id":"W2143668983","doi":"10.46298/dmtcs.317","title":"On Linear Layouts of Graphs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":116,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Partition (number theory); Disjoint sets; Discrete mathematics; Mathematical proof","score_opus":0.00802119738390963,"score_gpt":0.2237613964525075,"score_spread":0.21574019906859787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143668983","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.4399654,0.00002566502,0.546449,0.00003688031,0.00037037267,0.00016575286,0.0000071790587,0.00018782167,0.01279195],"genre_scores_gemma":[0.96967304,0.0000022747877,0.030234752,0.000034814308,0.000028302462,0.0000051216534,8.838245e-7,0.000018676552,0.0000021205701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986316,0.00001978468,0.00032991823,0.00022370237,0.00046457016,0.0003304276],"domain_scores_gemma":[0.9991177,0.00013653997,0.00004416515,0.0004975153,0.00006029474,0.00014379548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051320135,0.00017798707,0.00025443005,0.0001602751,0.000102781865,0.000048503458,0.00064679247,0.00005109513,0.000034156095],"category_scores_gemma":[0.000044827426,0.00013560319,0.00010402389,0.0005798976,0.0014167961,0.00010863654,0.000086947766,0.00014263988,0.000060194056],"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.0000032859955,0.000042520907,0.000002652775,0.000083372644,0.000008623246,0.0000033300082,0.0012293844,0.011299633,0.0014472706,0.98571056,0.000004681467,0.00016471019],"study_design_scores_gemma":[0.00018779431,0.00010945236,0.000015781647,0.00018536008,0.000008456031,0.000011629878,0.00006656185,0.15540785,0.013898341,0.82994217,0.0000045828915,0.00016200483],"about_ca_topic_score_codex":4.882962e-7,"about_ca_topic_score_gemma":1.4087857e-7,"teacher_disagreement_score":0.5297077,"about_ca_system_score_codex":0.000019578194,"about_ca_system_score_gemma":0.000017522105,"threshold_uncertainty_score":0.5529737},"labels":[],"label_agreement":null},{"id":"W2148592822","doi":"10.46298/dmtcs.2072","title":"Coloring and Guarding Arrangements","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ministerio de Ciencia e Innovación; European Social Fund; Fonds De La Recherche Scientifique - FNRS; Generalitat de Catalunya; European Commission","keywords":"Hypergraph; Combinatorics; Vertex (graph theory); Chromatic scale; Mathematics; Bounded function; Monochromatic color; Discrete mathematics; Graph; Physics","score_opus":0.014122451922976868,"score_gpt":0.25474507892729725,"score_spread":0.24062262700432038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148592822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092321515,0.000023657278,0.90231854,0.00071995816,0.00028856192,0.0002526081,4.9103187e-7,0.00011099234,0.003963688],"genre_scores_gemma":[0.604691,0.000002765597,0.3950281,0.00018847999,0.00005510776,0.000016083639,5.8782416e-7,0.000004346878,0.000013452237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815154,0.000038448827,0.00028525825,0.0005113798,0.00061400735,0.00039939382],"domain_scores_gemma":[0.9988418,0.00022242502,0.00007812419,0.00044015938,0.00019400928,0.00022347586],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008410607,0.00016519711,0.00017688899,0.00018803061,0.0004489041,0.0010845285,0.00097390777,0.000032034382,0.00005357437],"category_scores_gemma":[0.00009077661,0.00013511092,0.000042190157,0.0007643828,0.00068289915,0.0011302496,0.00091923133,0.00010632705,0.000099420555],"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":[4.3412925e-7,0.000025038818,0.000026879567,0.00001683511,0.000005044323,0.0000015230058,0.00067302166,0.0001666516,0.0017353984,0.9795534,0.00005218864,0.017743565],"study_design_scores_gemma":[0.000105349696,0.00005349996,0.00048589357,0.000026309124,0.000003488674,0.000019185893,0.000024743635,0.69551057,0.0013464232,0.3022365,0.000043381737,0.00014468083],"about_ca_topic_score_codex":0.0000018191782,"about_ca_topic_score_gemma":1.183297e-7,"teacher_disagreement_score":0.6953439,"about_ca_system_score_codex":0.00002821231,"about_ca_system_score_gemma":0.000041901232,"threshold_uncertainty_score":0.99995244},"labels":[],"label_agreement":null},{"id":"W2149179012","doi":"10.46298/dmtcs.6390","title":"Asymptotics of lattice walks via analytic combinatorics in several variables","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lattice (music); Combinatorics; Mathematics; Statistical physics; Discrete mathematics; Physics","score_opus":0.021444550765058704,"score_gpt":0.2852786532059251,"score_spread":0.2638341024408664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149179012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055103563,0.000018730176,0.93853813,0.0005313856,0.00038864865,0.000635161,0.000010673259,0.00017476482,0.0045989444],"genre_scores_gemma":[0.6578457,0.0000042471097,0.34188604,0.00012337713,0.0000730531,0.00000967068,0.0000015772745,0.000050079892,0.0000062741856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99493855,0.00016377697,0.0015441882,0.0008077613,0.0016178541,0.0009278672],"domain_scores_gemma":[0.9949262,0.0024107846,0.0005790527,0.0011130831,0.00046201184,0.0005088434],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020434393,0.0005304896,0.0012016766,0.00027796204,0.00019399068,0.00015272098,0.0020343561,0.00018268274,0.00009658685],"category_scores_gemma":[0.0029097942,0.00046316232,0.00020452832,0.0025454317,0.0021424955,0.00046063558,0.0010989652,0.00057182246,0.00003345609],"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.000021672913,0.00042315145,0.00005595883,0.0006587451,0.000028657703,0.000021826758,0.004047665,0.00046121905,0.00045990644,0.99363595,0.0000289897,0.00015622542],"study_design_scores_gemma":[0.00048654943,0.00019582403,0.000011296149,0.00015992399,0.000054860757,0.000013029302,0.00012649842,0.42849222,0.001255312,0.56889975,0.000006499806,0.00029822494],"about_ca_topic_score_codex":0.0000022586523,"about_ca_topic_score_gemma":6.9728867e-7,"teacher_disagreement_score":0.60274214,"about_ca_system_score_codex":0.00014916007,"about_ca_system_score_gemma":0.00018826227,"threshold_uncertainty_score":0.999782},"labels":[],"label_agreement":null},{"id":"W2156308991","doi":"10.46298/dmtcs.346","title":"Stacks, Queues and Tracks: Layouts of Graph Subdivisions","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":78,"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":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad","keywords":"Combinatorics; Subdivision; Vertex (graph theory); Queue; Mathematics; Bounded function; Graph; Discrete mathematics; Planar graph; Computer science; Geography","score_opus":0.011698854125213405,"score_gpt":0.267115975801654,"score_spread":0.2554171216764406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156308991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084407344,0.000137934,0.91288954,0.0008481061,0.00013537401,0.00015764395,0.0000050664316,0.00008383332,0.0013351769],"genre_scores_gemma":[0.6177095,0.000011769115,0.38210166,0.00011019494,0.000049824677,0.0000032250964,0.0000013682532,0.0000045764964,0.000007841006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790204,0.000058608184,0.00044462518,0.00050313293,0.00074455404,0.00034701911],"domain_scores_gemma":[0.9984488,0.00037516723,0.00013669604,0.0005603219,0.00025483564,0.00022416073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094028504,0.00018360639,0.00025503014,0.00028192016,0.0002870877,0.00032573263,0.0011077153,0.000045966844,0.000025720778],"category_scores_gemma":[0.00011841747,0.00014665381,0.00007447212,0.0010391534,0.0013286418,0.0007826084,0.0006292932,0.0001218876,0.000015284717],"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.0000018062713,0.00008768157,0.000016016951,0.000022996737,0.000005718937,0.000001229722,0.0018475926,0.0008591644,0.00090201176,0.9779512,0.00003280392,0.018271752],"study_design_scores_gemma":[0.00014563114,0.000108672575,0.0002836942,0.0000424071,0.0000075042935,0.000023247983,0.00003834966,0.713289,0.0048918533,0.28093252,0.000073349,0.00016374423],"about_ca_topic_score_codex":0.0000013021969,"about_ca_topic_score_gemma":0.0000011715613,"teacher_disagreement_score":0.7124299,"about_ca_system_score_codex":0.000019910352,"about_ca_system_score_gemma":0.000096171716,"threshold_uncertainty_score":0.5980369},"labels":[],"label_agreement":null},{"id":"W2156882907","doi":"10.46298/dmtcs.2126","title":"A randomized algorithm for finding a maximum clique in the visibility graph of a simple polygon","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","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":"Toronto Metropolitan University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; European Social Fund; Fonds De La Recherche Scientifique - FNRS; European Science Foundation","keywords":"Combinatorics; Mathematics; Clique graph; Randomized algorithm; Algorithm; Clique; Block graph; Hamiltonian path; Graph; Polygon (computer graphics); Simple polygon; Clique problem; Discrete mathematics; Graph power; Chordal graph; Monotone polygon; Line graph; Computer science; 1-planar graph","score_opus":0.02834525095212346,"score_gpt":0.31036754161977864,"score_spread":0.28202229066765516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156882907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024448201,0.000032021955,0.9731909,0.0006514297,0.00020038168,0.0009838714,0.000006584147,0.00003923685,0.00044734185],"genre_scores_gemma":[0.53140694,0.0000010548852,0.4683402,0.00015533608,0.0000377281,0.000050229934,0.0000031465477,0.0000039819347,0.0000013606308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997215,0.00033718612,0.0006727865,0.0005102103,0.0008618418,0.00040299917],"domain_scores_gemma":[0.99657863,0.0020182845,0.00021223818,0.0006875457,0.0003585182,0.00014479303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010714979,0.0001878537,0.0004635826,0.00030005357,0.00017763885,0.00031464838,0.0018165642,0.000052570384,0.00000344709],"category_scores_gemma":[0.00082865526,0.00012043252,0.00019030701,0.001641702,0.0012439302,0.0004346012,0.00042397025,0.00013802307,0.0000028808288],"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.00013821623,0.00012269207,0.0000034298678,0.000025553161,0.0000062799513,0.000001665699,0.004101998,0.0006892413,0.00005791613,0.9821106,0.000021003389,0.012721407],"study_design_scores_gemma":[0.004321287,0.00008712448,0.000009259167,0.000017650864,0.00000597695,0.000010021787,0.000062417465,0.5120723,0.00048639864,0.48283988,0.000006207421,0.000081477505],"about_ca_topic_score_codex":0.0000059468216,"about_ca_topic_score_gemma":0.0000013861721,"teacher_disagreement_score":0.51138306,"about_ca_system_score_codex":0.00003905402,"about_ca_system_score_gemma":0.00021696965,"threshold_uncertainty_score":0.49110958},"labels":[],"label_agreement":null},{"id":"W2160494352","doi":"10.46298/dmtcs.353","title":"Connectedness of number theoretical tilings","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":29,"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":"Japan Society for the Promotion of Science","keywords":"Social connectedness; Mathematics; Degree (music); Combinatorics; Discrete mathematics; Matrix (chemical analysis); Affine transformation; Pure mathematics","score_opus":0.01625733296930064,"score_gpt":0.3013194107869862,"score_spread":0.28506207781768556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160494352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20547667,0.000011884751,0.7401799,0.0007208194,0.00017512689,0.00047878578,0.00002209264,0.00018033481,0.052754395],"genre_scores_gemma":[0.6421705,0.0000044844264,0.35750395,0.000118558244,0.00011495243,0.000013234432,0.0000020327673,0.000039505438,0.00003276599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99552405,0.00010888496,0.0012836029,0.0007105605,0.0014734984,0.0008994227],"domain_scores_gemma":[0.99494386,0.0024606022,0.00038133818,0.0012554541,0.0004977617,0.0004609792],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0030017463,0.00045875052,0.00091125764,0.00016724312,0.00027830128,0.00021509698,0.0016474382,0.00017670637,0.002698497],"category_scores_gemma":[0.0017570476,0.00033696528,0.00029322697,0.0008368942,0.0077043856,0.00033774888,0.00077606406,0.0003840759,0.00021257563],"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.000014737639,0.00047457128,0.00001629434,0.0002514365,0.0000261132,0.0000049928103,0.0014157873,0.000009495683,0.00067140884,0.99486196,0.00007920109,0.0021739816],"study_design_scores_gemma":[0.00023778617,0.0000660425,0.000007848338,0.00016082075,0.000046959904,0.00004777356,0.00007416443,0.36249146,0.0025888185,0.63395315,0.0000415946,0.0002835803],"about_ca_topic_score_codex":8.443239e-7,"about_ca_topic_score_gemma":5.971252e-7,"teacher_disagreement_score":0.43669385,"about_ca_system_score_codex":0.00005771647,"about_ca_system_score_gemma":0.000108397646,"threshold_uncertainty_score":0.9999082},"labels":[],"label_agreement":null},{"id":"W2178583511","doi":"10.46298/dmtcs.2852","title":"Criteria for rational smoothness of some symmetric orbit closures","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":3,"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; Combinatorics; Bruhat order; Weyl group; Algebraic group; Orbit (dynamics); Schubert variety; Reductive group; Algebraic number; Mathematical analysis","score_opus":0.023043199229767674,"score_gpt":0.32945787980383084,"score_spread":0.3064146805740632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178583511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25420576,0.000013252304,0.74305105,0.0002840758,0.0005902768,0.00042248028,0.00003719971,0.0000702409,0.0013256465],"genre_scores_gemma":[0.6032597,8.311864e-7,0.39643604,0.00005871899,0.00018365178,0.000022587412,0.0000034390212,0.000020365656,0.000014698613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746376,0.00003511234,0.0006731392,0.00048406434,0.0008150298,0.00052890554],"domain_scores_gemma":[0.99638325,0.0019418126,0.00026862524,0.00074570125,0.00045196997,0.00020864671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001872656,0.0002642906,0.0004902943,0.0003696844,0.00029573689,0.0001523552,0.0010880921,0.000107501524,0.00023481812],"category_scores_gemma":[0.002166457,0.00020088686,0.00018175329,0.0009954019,0.0025650247,0.0004086018,0.00035172125,0.00024581532,0.00001176623],"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.000013193956,0.00017410135,0.000018507055,0.00026256838,0.000013216246,0.000001192821,0.00038929982,0.0000040373966,0.007636075,0.9905225,0.00008707508,0.00087824353],"study_design_scores_gemma":[0.0003107217,0.00013163558,0.000065989254,0.0000578565,0.00003334815,0.000016233542,0.00004874431,0.07670166,0.016723922,0.9056375,0.000029286117,0.00024308325],"about_ca_topic_score_codex":2.3528895e-7,"about_ca_topic_score_gemma":6.3688907e-7,"teacher_disagreement_score":0.34905392,"about_ca_system_score_codex":0.000017176986,"about_ca_system_score_gemma":0.00010781839,"threshold_uncertainty_score":0.945094},"labels":[],"label_agreement":null},{"id":"W2182624740","doi":"10.46298/dmtcs.3023","title":"Symmetries of the k-bounded partition lattice","year":2012,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University","funders":"","keywords":"Bounded function; Homogeneous space; Combinatorics; Lattice (music); Partition (number theory); Morse code; Mathematics; Physics; Geometry; Mathematical analysis; Computer science","score_opus":0.024808093326107703,"score_gpt":0.2985127857343379,"score_spread":0.2737046924082302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182624740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07996847,0.0011007064,0.8878625,0.0030149205,0.009233346,0.0014262537,0.000056941575,0.00015913336,0.017177703],"genre_scores_gemma":[0.6642256,0.000026511992,0.33473137,0.00015276493,0.0005200851,0.0000230193,0.0000011958318,0.00006794072,0.00025152083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935692,0.00040140038,0.0015520845,0.0005707133,0.002260389,0.0016462321],"domain_scores_gemma":[0.99186116,0.0034248186,0.0010118211,0.0022535375,0.00089588884,0.00055274443],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.004813631,0.00063769834,0.0009824553,0.00020874086,0.00079831464,0.00031950418,0.0025019483,0.00027946,0.00037832267],"category_scores_gemma":[0.0053397254,0.00045721213,0.00043418797,0.0024971897,0.012322449,0.0011868507,0.001963605,0.000668528,0.0001812916],"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.000010105279,0.0009698285,0.00006807509,0.0013379785,0.000056998604,0.00000149278,0.0068900855,0.00001701465,0.0003496826,0.98910785,0.00020639492,0.0009844683],"study_design_scores_gemma":[0.0003900171,0.00015399899,0.00006509239,0.0012486957,0.0003519178,0.000081275284,0.00055300747,0.05048273,0.01597305,0.9297623,0.00042745526,0.00051044044],"about_ca_topic_score_codex":0.0000035391329,"about_ca_topic_score_gemma":9.249876e-7,"teacher_disagreement_score":0.5842571,"about_ca_system_score_codex":0.0002622294,"about_ca_system_score_gemma":0.00025531583,"threshold_uncertainty_score":0.999788},"labels":[],"label_agreement":null},{"id":"W2183593302","doi":"10.46298/dmtcs.3068","title":"Triangulations of cyclic polytopes","year":2012,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polytope; Combinatorics; Diagonal; Mathematics; Lamination; Polygon (computer graphics); Cover (algebra); Geometry; Computer science; Materials science","score_opus":0.025435379388184305,"score_gpt":0.31399694226421204,"score_spread":0.28856156287602774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183593302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044877343,0.001272527,0.92886376,0.0011254116,0.0047109323,0.001051092,0.000063420375,0.00017214687,0.017863382],"genre_scores_gemma":[0.54710484,0.000026709158,0.45183864,0.000050094844,0.0006106737,0.000019422207,0.0000025907418,0.00007253998,0.00027447834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99342865,0.00028635233,0.0019073819,0.00064595445,0.0018940917,0.0018375744],"domain_scores_gemma":[0.9921619,0.0034069356,0.0009570447,0.0020010509,0.00058054196,0.0008924873],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0042813756,0.00070954376,0.0013090966,0.00041209755,0.0005312202,0.00023763812,0.0019958895,0.00030964368,0.0009165356],"category_scores_gemma":[0.002931828,0.0006311766,0.0004401321,0.0020093787,0.0083475495,0.0012878494,0.0013262829,0.0005572854,0.00030326494],"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.00001240128,0.0013709137,0.00004693823,0.0010119493,0.00006828692,0.0000034866791,0.008124318,0.00004221155,0.0010024636,0.9850038,0.00015776769,0.0031554177],"study_design_scores_gemma":[0.0005986089,0.00022402382,0.000053771582,0.0009224842,0.00031475487,0.00009210205,0.0004955399,0.08172871,0.0080958335,0.9064484,0.00037445308,0.0006512768],"about_ca_topic_score_codex":0.0000043881205,"about_ca_topic_score_gemma":5.598274e-7,"teacher_disagreement_score":0.5022275,"about_ca_system_score_codex":0.00021658023,"about_ca_system_score_gemma":0.0002358919,"threshold_uncertainty_score":0.9999968},"labels":[],"label_agreement":null},{"id":"W2183879331","doi":"10.46298/dmtcs.628","title":"The Erdős-Sós conjecture for geometric graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","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 Waterloo","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Combinatorics; Mathematics; Conjecture; General position; Graph; Planar graph; Regular polygon; Discrete mathematics; Geometry","score_opus":0.010941072128076173,"score_gpt":0.25271982659157555,"score_spread":0.24177875446349936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183879331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00796689,0.00010071374,0.9857351,0.0032015957,0.0007674336,0.0008206087,0.000003489306,0.00014984103,0.0012542972],"genre_scores_gemma":[0.60973763,0.0000075349844,0.38960212,0.0003854228,0.00010715546,0.00009854078,0.0000030443869,0.000009958294,0.000048588383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972137,0.00006624741,0.00046847336,0.0006479358,0.00089634006,0.00070726895],"domain_scores_gemma":[0.99629307,0.001804141,0.0001620221,0.00093051366,0.00053997146,0.000270301],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001756598,0.00025263312,0.0002371362,0.00032082343,0.0014005991,0.0019860934,0.0027662052,0.00006482175,0.000034640703],"category_scores_gemma":[0.00043763695,0.00015656423,0.00016421622,0.002564726,0.0013819631,0.00075812364,0.00071222166,0.00017443854,0.00010186695],"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.0000014245365,0.00003560563,0.000004541704,0.000015797017,0.000009044358,5.889119e-7,0.00026482323,0.00039338102,0.00020305111,0.96857566,0.00065446855,0.029841645],"study_design_scores_gemma":[0.00012277467,0.00008794929,0.00010771188,0.000009950567,0.0000048915954,0.000015948313,0.000014076863,0.49823067,0.00078999967,0.5000777,0.00039424826,0.00014404862],"about_ca_topic_score_codex":0.0000017483208,"about_ca_topic_score_gemma":4.805187e-7,"teacher_disagreement_score":0.60177076,"about_ca_system_score_codex":0.000039876682,"about_ca_system_score_gemma":0.0001353699,"threshold_uncertainty_score":0.99989945},"labels":[],"label_agreement":null},{"id":"W2184313932","doi":"10.46298/dmtcs.2346","title":"Some simple varieties of trees arising in permutation analysis","year":2013,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Arity; Permutation (music); Tree (set theory); Philosophy","score_opus":0.008859976454495487,"score_gpt":0.2535330054201947,"score_spread":0.2446730289656992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184313932","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.49814793,0.0010009405,0.4990088,0.00059328834,0.00017955333,0.00033853084,0.000015623507,0.00000885822,0.00070646126],"genre_scores_gemma":[0.9128287,0.00008925878,0.0867627,0.000057435616,0.00012706347,0.000014682189,0.00003099023,0.000016928729,0.00007227517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975631,0.00012260396,0.0006321655,0.00056315464,0.00054690416,0.0005720345],"domain_scores_gemma":[0.99862576,0.00010850339,0.00021019192,0.0006270197,0.00026371292,0.00016483486],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010251022,0.00026189705,0.00045697385,0.00034348818,0.00012176263,0.00023394189,0.00070314837,0.00014798585,0.0002255951],"category_scores_gemma":[0.00014323262,0.00023756527,0.00021342681,0.0011957308,0.0030271662,0.00006042894,0.00051560224,0.00014282548,0.000028757231],"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.000007899311,0.00033695664,0.0014484978,0.00023905677,0.00024364004,0.0000038645585,0.003220595,0.004090326,0.03990327,0.9444295,0.000044225304,0.0060321675],"study_design_scores_gemma":[0.00025105858,0.00025874935,0.0041206866,0.000057832993,0.00021932046,0.000005149453,0.0005135554,0.65673697,0.011397251,0.32609624,0.0000328774,0.00031030818],"about_ca_topic_score_codex":0.000046509347,"about_ca_topic_score_gemma":0.000014584809,"teacher_disagreement_score":0.65264666,"about_ca_system_score_codex":0.000043047807,"about_ca_system_score_gemma":0.0000971573,"threshold_uncertainty_score":0.999686},"labels":[],"label_agreement":null},{"id":"W2186670902","doi":"10.46298/dmtcs.610","title":"Connectivity for line-of-sight networks in higher dimensions","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"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; Queen's University; McGill University","keywords":"Mathematics; Combinatorics; Graph; Line-of-sight; Line (geometry); Discrete mathematics; Integer (computer science); Random geometric graph; Random graph; Norm (philosophy); Line graph; Geometry; Physics; Voltage graph; Computer science","score_opus":0.018431229348205444,"score_gpt":0.25904175825019093,"score_spread":0.24061052890198548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186670902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013327299,0.000046750905,0.98197806,0.0008226113,0.00067739433,0.0010153586,0.0000019402996,0.00011563346,0.0020149737],"genre_scores_gemma":[0.67401206,0.000003428305,0.32558516,0.00018022202,0.00008557266,0.00010410026,9.539511e-7,0.000013723634,0.000014779396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697423,0.000101426296,0.00068214105,0.0008044607,0.00059514266,0.0008426154],"domain_scores_gemma":[0.9961613,0.0016881909,0.00021513773,0.0013168296,0.00033317576,0.00028540535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015839133,0.00029421735,0.00051589723,0.00019854285,0.00021967757,0.00035314425,0.0024969315,0.00011966636,0.00010130977],"category_scores_gemma":[0.00015964647,0.00022742455,0.00014757825,0.0013635176,0.0016791247,0.0007802539,0.0012623486,0.00027157302,0.00002595195],"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.0000028906431,0.00013687622,0.00003242069,0.000030353021,0.000006376162,0.0000023868392,0.00036114425,0.0038374336,0.00025816017,0.99000454,0.00009237778,0.0052350303],"study_design_scores_gemma":[0.00022300532,0.00013634308,0.00023753694,0.00008073454,0.0000051005704,0.0000051421453,0.0000063932453,0.6683436,0.0006803954,0.33005872,0.000024687826,0.00019831715],"about_ca_topic_score_codex":0.0000055181704,"about_ca_topic_score_gemma":0.0000019749593,"teacher_disagreement_score":0.6645062,"about_ca_system_score_codex":0.000051493553,"about_ca_system_score_gemma":0.00008304434,"threshold_uncertainty_score":0.92741036},"labels":[],"label_agreement":null},{"id":"W2186988542","doi":"10.46298/dmtcs.2857","title":"Generalized Ehrhart polynomials","year":2010,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Toronto Metropolitan University","funders":"National Defense Science and Engineering Graduate; National Science Foundation","keywords":"Mathematics; Combinatorics; Conjecture; Polytope; Diophantine equation; Lattice (music); Polynomial; Diophantine approximation; Mathematical analysis","score_opus":0.018400183380904434,"score_gpt":0.301137542326428,"score_spread":0.28273735894552354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186988542","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12531175,0.00027359073,0.82459956,0.0048173703,0.018667664,0.0017965486,0.00009817418,0.0005832328,0.02385208],"genre_scores_gemma":[0.27413487,0.000034850116,0.72221506,0.00033198812,0.0018859021,0.000060232633,0.000005967138,0.00019239412,0.0011387549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9908993,0.0002854632,0.0021887084,0.001625491,0.0025211074,0.002479934],"domain_scores_gemma":[0.9902728,0.002991428,0.00090509176,0.0035540666,0.0008996412,0.0013769487],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0056026787,0.0012199038,0.0017142388,0.0004458451,0.0011572121,0.0013551136,0.004132336,0.0006525353,0.0033419253],"category_scores_gemma":[0.004106744,0.0010970304,0.00058491353,0.0018352092,0.013454165,0.0011196916,0.0023548144,0.001889931,0.0013311642],"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.000020006904,0.0008644186,0.0000059189006,0.0006817306,0.00006624357,0.00004913617,0.0028943282,0.000021683878,0.011157628,0.9795515,0.0010507244,0.0036366868],"study_design_scores_gemma":[0.0008900637,0.0002348502,0.0000048807533,0.00045348142,0.0002174765,0.00028046445,0.00012030418,0.19307442,0.011340949,0.7898753,0.0024421264,0.0010656856],"about_ca_topic_score_codex":0.000007788822,"about_ca_topic_score_gemma":0.0000059632066,"teacher_disagreement_score":0.19305274,"about_ca_system_score_codex":0.00020897953,"about_ca_system_score_gemma":0.00058278965,"threshold_uncertainty_score":0.9996816},"labels":[],"label_agreement":null},{"id":"W2198855630","doi":"10.46298/dmtcs.591","title":"On quadratic threshold CSPs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"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":"European Commission","keywords":"Rounding; Mathematics; Predicate (mathematical logic); Constraint satisfaction problem; Discrete mathematics; Quadratic equation; Hyperplane; Combinatorics; Semidefinite programming; Algorithm; Mathematical optimization; Computer science","score_opus":0.022172371833810458,"score_gpt":0.27425426295176975,"score_spread":0.2520818911179593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2198855630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015956854,0.000041213614,0.96112055,0.00074424024,0.0010645834,0.00025328767,0.0000026225262,0.00030960585,0.020507025],"genre_scores_gemma":[0.66263163,0.0000020237019,0.3365577,0.0006249142,0.00014575708,0.000011743695,7.280314e-7,0.000012101997,0.000013427336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962534,0.00007635719,0.00047071194,0.0006782397,0.0013598741,0.0011614446],"domain_scores_gemma":[0.99682695,0.000648213,0.00012933949,0.001694877,0.00012411545,0.0005765095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021682656,0.00035034743,0.0003596165,0.00028893584,0.000698663,0.00076206663,0.0036198194,0.000073005715,0.00012252398],"category_scores_gemma":[0.00017342539,0.0002651041,0.00016994089,0.0014202162,0.002388696,0.0011517288,0.0014510059,0.0003572247,0.000390182],"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.0000021085668,0.00023630449,0.000021929509,0.000022034465,0.000007094212,0.00000447033,0.0016531217,0.000041221738,0.000098262375,0.9945404,0.00011897947,0.0032540623],"study_design_scores_gemma":[0.00010813155,0.0001234851,0.00008721194,0.00005407065,0.000005665872,0.000033859702,0.000020372592,0.45001343,0.00086150033,0.54838353,0.00005077038,0.00025795962],"about_ca_topic_score_codex":8.3691435e-7,"about_ca_topic_score_gemma":1.8749952e-7,"teacher_disagreement_score":0.64667475,"about_ca_system_score_codex":0.00005520764,"about_ca_system_score_gemma":0.00006909032,"threshold_uncertainty_score":0.9999801},"labels":[],"label_agreement":null},{"id":"W2206108380","doi":"10.46298/dmtcs.2378","title":"Number of cycles in the graph of $312$-avoiding permutations","year":2014,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"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":"National Security Agency; National Science Foundation","keywords":"Combinatorics; De Bruijn sequence; Mathematics; De Bruijn graph; Enumeration; Permutation (music); Graph; Discrete mathematics; Physics","score_opus":0.01900292398031813,"score_gpt":0.31320700211745683,"score_spread":0.2942040781371387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2206108380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18806496,0.0000913183,0.79801625,0.00083879015,0.00079212076,0.00065929885,0.000022897435,0.00003833044,0.011476056],"genre_scores_gemma":[0.6940879,0.000019491365,0.3056564,0.000048216196,0.00010505741,0.000019903408,0.0000014891899,0.000040287825,0.000021250913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941039,0.00075338566,0.0018806471,0.00059616496,0.0017821873,0.0008837024],"domain_scores_gemma":[0.9876571,0.009043543,0.0009208466,0.001660265,0.000527946,0.00019024385],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.007567384,0.00050015154,0.0010945805,0.00029965126,0.00036365876,0.00016931532,0.0025939087,0.00019536683,0.0001650901],"category_scores_gemma":[0.004317051,0.000371196,0.00033474417,0.0022098436,0.008169378,0.0004483186,0.00069107674,0.00066475006,0.000044418586],"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.000007943042,0.0007733963,0.00008192912,0.0014717057,0.00002581647,0.000004019004,0.019973785,0.00029892672,0.0004317353,0.97587436,0.00002912682,0.0010272429],"study_design_scores_gemma":[0.00039756278,0.00015580932,0.000048442507,0.0012432802,0.00011782594,0.00006236886,0.0019362806,0.20694235,0.0021610237,0.786612,0.000019141018,0.00030395278],"about_ca_topic_score_codex":0.000008140463,"about_ca_topic_score_gemma":0.0000028566346,"teacher_disagreement_score":0.50602293,"about_ca_system_score_codex":0.000075830285,"about_ca_system_score_gemma":0.00014471372,"threshold_uncertainty_score":0.999874},"labels":[],"label_agreement":null},{"id":"W2207885168","doi":"10.23638/dmtcs-19-1-20","title":"Equivalence of the filament and overlap graphs of subtrees of limited trees","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Equivalence (formal languages); Combinatorics; Mathematics; Discrete mathematics","score_opus":0.024863027125050858,"score_gpt":0.3021602226932132,"score_spread":0.27729719556816235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2207885168","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.46328712,0.000059582082,0.5345458,0.000358653,0.00013519308,0.00029706897,0.000014356942,0.000020584623,0.0012816831],"genre_scores_gemma":[0.8688897,0.00002156963,0.13104738,0.000016146118,0.0000071774916,0.000004476055,1.5103095e-7,0.000007256527,0.0000061334795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971556,0.0001144524,0.000570688,0.00048746236,0.0012487092,0.00042306675],"domain_scores_gemma":[0.99552566,0.0007034312,0.000632908,0.0026343467,0.00035752333,0.00014612143],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018484131,0.00020023313,0.0004376351,0.00018754604,0.00043371617,0.00018068719,0.005939024,0.000048768616,0.00000953899],"category_scores_gemma":[0.0006735106,0.00012606215,0.00015720418,0.00062145677,0.01165291,0.000586196,0.0039205574,0.0001649568,8.878874e-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.000009348359,0.000087219,0.0015557525,0.00011989866,0.000012117816,0.0000011339497,0.0011061901,0.000033011598,0.012579263,0.9816831,0.0000022071208,0.0028107963],"study_design_scores_gemma":[0.00020277743,0.00021780498,0.009120409,0.00030511888,0.0000112884845,0.000008576102,0.000062530846,0.17200197,0.06384317,0.7540926,0.0000015029892,0.00013227016],"about_ca_topic_score_codex":0.0000045466995,"about_ca_topic_score_gemma":0.0000015173727,"teacher_disagreement_score":0.4056026,"about_ca_system_score_codex":0.000012702122,"about_ca_system_score_gemma":0.00008804992,"threshold_uncertainty_score":0.9994393},"labels":[],"label_agreement":null},{"id":"W2216546603","doi":"10.46298/dmtcs.2876","title":"Harmonics for deformed Steenrod operators (Extended Abstract)","year":2010,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; National Science Foundation","keywords":"Mathematical proof; Harmonics; Mathematics; Pure mathematics; Physics; Geometry; Quantum mechanics","score_opus":0.023090317678395533,"score_gpt":0.30928844391780297,"score_spread":0.28619812623940744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216546603","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06342813,0.00013137009,0.91126204,0.0051215435,0.0026873618,0.0029655031,0.00031466596,0.00026226064,0.013827128],"genre_scores_gemma":[0.36519426,0.000024206187,0.6330239,0.00022358492,0.0005441238,0.00023218217,0.000015940968,0.00011584603,0.0006259461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938007,0.000051765062,0.0017036762,0.0012572405,0.0014131647,0.0017734409],"domain_scores_gemma":[0.9924944,0.0025173957,0.0006295886,0.0024033736,0.0009719738,0.0009832412],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["sts"],"category_scores_codex":[0.004647812,0.000845813,0.0010485032,0.00027704003,0.0013673326,0.0013875265,0.0029049437,0.00045510358,0.0013770667],"category_scores_gemma":[0.0016781404,0.0007063307,0.0005185318,0.0010463899,0.0066409945,0.0006006876,0.0009282653,0.0010919482,0.00036490877],"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.000010505584,0.0010301241,0.000002261872,0.0012497363,0.000060466766,0.000005293385,0.002707555,0.000013141072,0.003925604,0.98214704,0.0027595614,0.006088696],"study_design_scores_gemma":[0.0005202226,0.00016088622,0.000012203491,0.00029459465,0.00018060688,0.00007955378,0.00027011434,0.3726743,0.005094083,0.615367,0.0046778144,0.0006685969],"about_ca_topic_score_codex":0.000004437602,"about_ca_topic_score_gemma":0.000012284756,"teacher_disagreement_score":0.37266117,"about_ca_system_score_codex":0.00011644484,"about_ca_system_score_gemma":0.0005871659,"threshold_uncertainty_score":0.99993277},"labels":[],"label_agreement":null},{"id":"W2225693392","doi":"10.46298/dmtcs.3648","title":"From Bruhat intervals to intersection lattices and a conjecture of Postnikov","year":2008,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":5,"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":"Knut och Alice Wallenbergs Stiftelse; Royal Swedish Academy of Sciences; National Science Foundation","keywords":"Mathematics; Combinatorics; Bruhat order; Conjecture; Hyperplane; Permutation (music); Symmetric group; Order (exchange); Coxeter group; Physics","score_opus":0.02074761227501073,"score_gpt":0.29506457276922654,"score_spread":0.27431696049421583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2225693392","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.40313035,0.00030256767,0.5911851,0.0012349817,0.0018638581,0.0007174086,0.00006942934,0.000093516486,0.001402813],"genre_scores_gemma":[0.60649025,0.000035844976,0.392869,0.0001261532,0.00029360634,0.000014100825,0.0000023427272,0.000056821897,0.00011187103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99515855,0.00022287265,0.0014247871,0.0010067321,0.0012873893,0.00089966087],"domain_scores_gemma":[0.9940062,0.0028280043,0.0006462612,0.0013379641,0.0005230652,0.0006584709],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001464779,0.0006747526,0.0012920485,0.00035056073,0.00041846762,0.00025292163,0.0014608464,0.0002767171,0.00031469576],"category_scores_gemma":[0.0019106448,0.0005918275,0.00023673124,0.0011078542,0.006786075,0.00065476075,0.0017963748,0.00053409516,0.0000949912],"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.000042281295,0.00042602775,0.00002078979,0.0007507293,0.00008440468,0.000038419483,0.0371632,0.00003787576,0.0021643636,0.9567426,0.0001465578,0.002382735],"study_design_scores_gemma":[0.0005858579,0.0008493845,0.000041137762,0.0022171477,0.00018704626,0.00027452645,0.0010685105,0.095986165,0.011308181,0.886785,0.000098241755,0.00059884915],"about_ca_topic_score_codex":0.000029575778,"about_ca_topic_score_gemma":0.0000044040767,"teacher_disagreement_score":0.20335992,"about_ca_system_score_codex":0.00017107687,"about_ca_system_score_gemma":0.00016904628,"threshold_uncertainty_score":0.99965334},"labels":[],"label_agreement":null},{"id":"W2229869095","doi":"10.46298/dmtcs.2381","title":"Poset topology and homological invariants of algebras arising in algebraic combinatorics","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"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":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; United States-Israel Binational Science Foundation; City University of New York; Carnegie Corporation of New York","keywords":"Partially ordered set; Mathematics; Algebraic combinatorics; Algebraic number; Algebraic topology; Algebra over a field; Combinatorics; Discrete mathematics; Pure mathematics; Topology (electrical circuits)","score_opus":0.01863313526806276,"score_gpt":0.29186406208265586,"score_spread":0.2732309268145931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2229869095","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.45940632,0.00001825993,0.5370344,0.00021291671,0.00031750926,0.00034524887,0.0000030445956,0.000076177035,0.0025861508],"genre_scores_gemma":[0.7533362,0.000005541913,0.24650796,0.00006520121,0.00004020755,0.000010415172,9.944331e-7,0.000028717055,0.0000047707736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964166,0.0002576032,0.0010809081,0.00067780423,0.00081446156,0.0007526165],"domain_scores_gemma":[0.99484056,0.003331848,0.00040343925,0.0009418272,0.00021339548,0.00026893837],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0032609848,0.00038912226,0.0009674721,0.00033806145,0.00020889034,0.00011931173,0.0011594141,0.00020166166,0.000043895805],"category_scores_gemma":[0.0032492892,0.00031587994,0.000093594026,0.000981856,0.004049724,0.000282307,0.0010903946,0.0004260519,0.000009338479],"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.000010901757,0.00031200485,0.00016472812,0.00021946774,0.000009444708,0.000009413581,0.0014263457,0.0000062808354,0.0004808347,0.99677485,0.000009741526,0.0005760013],"study_design_scores_gemma":[0.0006466069,0.00036121788,0.00018717677,0.00019913538,0.00002874959,0.000072929106,0.00013504582,0.0822622,0.0016037492,0.9141747,0.000004237797,0.0003242588],"about_ca_topic_score_codex":0.000002497849,"about_ca_topic_score_gemma":0.00000157254,"teacher_disagreement_score":0.29392987,"about_ca_system_score_codex":0.00007018209,"about_ca_system_score_gemma":0.00007193498,"threshold_uncertainty_score":0.9999293},"labels":[],"label_agreement":null},{"id":"W2232191914","doi":"10.46298/dmtcs.1302","title":"Asymptotic Density of Zimin Words","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Word (group theory); Alphabet; Combinatorics; Homomorphism; Limit (mathematics); Mathematics; Physics; Discrete mathematics; Philosophy; Geometry; Mathematical analysis; Linguistics","score_opus":0.01017574878256319,"score_gpt":0.2404286828056132,"score_spread":0.23025293402305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2232191914","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094022825,0.000013711456,0.90187246,0.00093980064,0.00033636432,0.00015581712,0.0000033916638,0.00018866366,0.0024669438],"genre_scores_gemma":[0.7076866,0.0000036603192,0.29210618,0.0001286841,0.000043123942,0.0000040067657,1.9819645e-7,0.000010046242,0.000017505328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996979,0.000096107266,0.00055606297,0.00071071927,0.0010018058,0.0006563216],"domain_scores_gemma":[0.996835,0.00084164215,0.00021550096,0.0016044894,0.00021558834,0.00028780635],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021004116,0.00026554902,0.0004131961,0.00021509438,0.00022339198,0.00022990082,0.003473851,0.000068545254,0.000084621744],"category_scores_gemma":[0.00029297228,0.00015682618,0.00015016877,0.0009357307,0.0033588435,0.000730219,0.001700877,0.000111238405,0.00010641127],"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.000002962163,0.00007897883,0.000068387526,0.000027238459,0.000007805489,0.0000074980685,0.00074219686,0.0000033196657,0.007875489,0.97118276,0.000025637462,0.01997772],"study_design_scores_gemma":[0.00024811813,0.00014166987,0.0004630846,0.00021859654,0.000010490728,0.000049236518,0.000025415477,0.22267537,0.03304535,0.742827,0.000014988284,0.00028069416],"about_ca_topic_score_codex":0.0000011540776,"about_ca_topic_score_gemma":2.856154e-7,"teacher_disagreement_score":0.61366373,"about_ca_system_score_codex":0.000047821082,"about_ca_system_score_gemma":0.00012866018,"threshold_uncertainty_score":0.99935347},"labels":[],"label_agreement":null},{"id":"W2232613001","doi":"10.46298/dmtcs.2377","title":"An equivariant rim hook rule for quantum cohomology of Grassmannians","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"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":"Division of Mathematical Sciences","keywords":"Schubert calculus; Mathematics; Equivariant map; Schubert variety; Quantum cohomology; Quantum; Combinatorics; Cohomology; Pure mathematics; Grassmannian; Equivariant cohomology; Physics; Quantum mechanics","score_opus":0.0238169511318562,"score_gpt":0.32337489700656236,"score_spread":0.29955794587470613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2232613001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058216322,0.0000062378176,0.9373778,0.00018982984,0.00065907923,0.0008366834,0.000022723498,0.0002073811,0.0024839598],"genre_scores_gemma":[0.5416574,9.2713435e-7,0.45803913,0.000051824514,0.00014794969,0.000042581494,0.0000032249527,0.000049120325,0.000007842795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99593526,0.00019163777,0.0011572706,0.0007908686,0.00096632325,0.0009586517],"domain_scores_gemma":[0.99337864,0.0032034325,0.0005983741,0.0018284122,0.00059441995,0.0003967068],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.003881455,0.00046020118,0.0010209818,0.00024611678,0.00039457603,0.00016001548,0.0022338987,0.00017570033,0.000053560223],"category_scores_gemma":[0.002443355,0.00037200697,0.0002358975,0.0005808909,0.0034299528,0.0003813289,0.0005115515,0.0002538748,0.00001933052],"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.000024368095,0.00048909977,0.000006752487,0.00041827705,0.000022688886,0.0000021226688,0.0014964524,0.00004718499,0.0035455164,0.9933307,0.000054744738,0.00056206837],"study_design_scores_gemma":[0.00045364324,0.0006592169,0.0000054952993,0.000108939574,0.000060214305,0.000020782467,0.00008860269,0.36331236,0.0041983724,0.63077784,0.00002228921,0.0002922742],"about_ca_topic_score_codex":0.0000014030132,"about_ca_topic_score_gemma":6.5382625e-7,"teacher_disagreement_score":0.48344108,"about_ca_system_score_codex":0.000068104855,"about_ca_system_score_gemma":0.00012773993,"threshold_uncertainty_score":0.99987316},"labels":[],"label_agreement":null},{"id":"W2244023066","doi":"10.46298/dmtcs.2839","title":"Crystals from categorified quantum groups","year":2010,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":8,"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 British Columbia","funders":"National Science Foundation","keywords":"Mathematics; Quotient; Grothendieck group; Quantum; Pure mathematics; Quantum group; Algebra over a field; Humanities; Physics; Philosophy; Quantum mechanics","score_opus":0.01534059310465425,"score_gpt":0.2675785840521044,"score_spread":0.25223799094745014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244023066","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.44556358,0.00021564186,0.5328029,0.001991435,0.013428914,0.00064717827,0.00007095615,0.00020931938,0.005070106],"genre_scores_gemma":[0.8361348,0.000018944835,0.16157447,0.00023055535,0.0017643524,0.000023049623,0.000010657467,0.0000967851,0.00014638554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99352336,0.00018857581,0.0013245756,0.001399496,0.0019340774,0.00162993],"domain_scores_gemma":[0.9935463,0.0020977613,0.00050301064,0.0024160596,0.0004887853,0.0009480531],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0023036762,0.0008603706,0.0011186157,0.00020731262,0.00089671067,0.0013375414,0.0031931486,0.0005718844,0.0030902647],"category_scores_gemma":[0.0010286513,0.0007190294,0.00041619095,0.0009921353,0.008938155,0.0006731438,0.0015953173,0.0015190522,0.00035535576],"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.000018996818,0.00032590714,0.000010387845,0.0001870858,0.00006414831,0.000031404623,0.004518143,0.000011105079,0.0028814774,0.9900163,0.00030023835,0.0016348428],"study_design_scores_gemma":[0.00046200442,0.00015661518,0.0000299914,0.00019827222,0.00015588485,0.000052222516,0.00024375139,0.24792124,0.0019816614,0.7478107,0.00029484974,0.0006928066],"about_ca_topic_score_codex":0.000066636836,"about_ca_topic_score_gemma":0.000010461038,"teacher_disagreement_score":0.39057124,"about_ca_system_score_codex":0.0000994534,"about_ca_system_score_gemma":0.00036267136,"threshold_uncertainty_score":0.9996992},"labels":[],"label_agreement":null},{"id":"W2245840520","doi":"10.46298/dmtcs.3417","title":"Labeling planar graphs with a condition at distance two","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":20,"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":"Ministrstvo za visoko šolstvo, znanost in tehnologijo; Technische Universität Berlin","keywords":"Combinatorics; Mathematics; Planar graph; Conjecture; Graph; Degree (music); Planar; Delta; Physics; Computer science","score_opus":0.00933332684692764,"score_gpt":0.24531112560698753,"score_spread":0.2359777987600599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245840520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05811948,0.00009424657,0.9365994,0.0014433971,0.00016819623,0.00023747515,0.0000061427586,0.00036680646,0.0029648826],"genre_scores_gemma":[0.56720537,0.0000034348934,0.43230417,0.00042930042,0.000014587537,0.0000108159875,0.0000027216788,0.000011609962,0.000017961824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966063,0.00006486553,0.0004783361,0.00091574056,0.0011613874,0.0007733751],"domain_scores_gemma":[0.9977306,0.00026216017,0.0001925917,0.0011762922,0.00025237375,0.00038595757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001276552,0.00032637818,0.00033199452,0.00023913124,0.00082589855,0.0005866671,0.0018680296,0.000051651008,0.000039230046],"category_scores_gemma":[0.000047272708,0.00023001675,0.00009023955,0.0013026682,0.0024624758,0.00079913356,0.0005675198,0.0002225168,0.0001479688],"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.000007729048,0.00008379389,0.000040533952,0.00002182812,0.00000964282,0.000012719769,0.0010186497,0.00049521733,0.0012783402,0.9950844,0.00007522025,0.0018719468],"study_design_scores_gemma":[0.00041067545,0.00013068196,0.000016576352,0.00012546388,0.000011692593,0.000091016365,0.00001606169,0.52005893,0.003045769,0.47570652,0.00009031639,0.0002963136],"about_ca_topic_score_codex":0.0000022651557,"about_ca_topic_score_gemma":0.00000612047,"teacher_disagreement_score":0.5195637,"about_ca_system_score_codex":0.000073613715,"about_ca_system_score_gemma":0.00007864069,"threshold_uncertainty_score":0.9379811},"labels":[],"label_agreement":null},{"id":"W2253259020","doi":"10.46298/dmtcs.3465","title":"Cycles intersecting edge-cuts of prescribed sizes","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Cubic graph; Planar graph; Graph; Disjoint sets; Disjoint union (topology); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Line graph; Voltage graph","score_opus":0.01957421339543206,"score_gpt":0.3028969954445915,"score_spread":0.2833227820491594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253259020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062249627,0.00004071356,0.92889154,0.00063110364,0.0002212869,0.00030075494,0.0000032670891,0.0002091275,0.007452575],"genre_scores_gemma":[0.5733049,0.0000032131065,0.42651346,0.000072465,0.000068746784,0.000008290708,3.601714e-7,0.000012645447,0.000015925949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99611515,0.00015218665,0.0006942771,0.0008367289,0.0013078297,0.00089381257],"domain_scores_gemma":[0.99648046,0.0010187861,0.00023586351,0.001537691,0.000384051,0.0003431611],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002518711,0.0003065361,0.00044955412,0.00039289866,0.00037909893,0.00039168826,0.004630398,0.00006910508,0.00006142529],"category_scores_gemma":[0.0005833428,0.00024329404,0.00017437505,0.0015026844,0.004103161,0.0013037284,0.00256926,0.0003394618,0.00006475519],"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.000008582892,0.00011835699,0.000032372664,0.000051138835,0.000011868355,0.0000045869147,0.0033657087,0.000292377,0.0052769617,0.9739176,0.000022249606,0.01689817],"study_design_scores_gemma":[0.00019891135,0.00014269569,0.000074451644,0.0001219901,0.000006143017,0.000032515243,0.00011181688,0.5514235,0.032184582,0.41542396,0.000035354595,0.00024406602],"about_ca_topic_score_codex":0.0000012625433,"about_ca_topic_score_gemma":0.0000010263917,"teacher_disagreement_score":0.5584937,"about_ca_system_score_codex":0.00006490562,"about_ca_system_score_gemma":0.00011884502,"threshold_uncertainty_score":0.9986071},"labels":[],"label_agreement":null},{"id":"W2261830810","doi":"10.46298/dmtcs.2866","title":"QSym over Sym has a stable basis","year":2010,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Analytic and geometric function theory","field":"Mathematics","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":"Toronto Metropolitan University","funders":"National Science Foundation","keywords":"Mathematics; Combinatorics; Constructive; Dimension (graph theory); Basis (linear algebra); Space (punctuation); Base (topology); Geometry; Mathematical analysis; Computer science","score_opus":0.02002039268807179,"score_gpt":0.2679081265939573,"score_spread":0.2478877339058855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2261830810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035690766,0.00026353382,0.89925975,0.0038648644,0.0046447846,0.0006214494,0.000069593414,0.00023416526,0.055351082],"genre_scores_gemma":[0.61494344,0.00003363903,0.3764904,0.0006933357,0.0010310406,0.00002658381,0.000006185929,0.000112282294,0.0066630486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932843,0.00018272726,0.0013012246,0.001285093,0.0021394733,0.0018072263],"domain_scores_gemma":[0.9926075,0.002906539,0.0004935948,0.0022747878,0.0006606208,0.001056959],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0062110936,0.0007884798,0.0010503562,0.0006966935,0.0012897287,0.0015189718,0.0023175424,0.00045046472,0.016148668],"category_scores_gemma":[0.0029458296,0.00066046504,0.00050050195,0.0033699942,0.015327066,0.000796628,0.0014292793,0.0014268236,0.0016299598],"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.000019216552,0.0006397535,0.000056253564,0.00046059245,0.00008934914,0.00003288921,0.0019940815,0.000027150709,0.00036576018,0.98766994,0.0036623327,0.004982665],"study_design_scores_gemma":[0.00040714713,0.00018006096,0.00003997593,0.00022854707,0.00023245145,0.00011567276,0.00027990818,0.3566829,0.00091688574,0.6355554,0.00476085,0.0006002244],"about_ca_topic_score_codex":0.000021476857,"about_ca_topic_score_gemma":0.000005712203,"teacher_disagreement_score":0.5792527,"about_ca_system_score_codex":0.00015242571,"about_ca_system_score_gemma":0.0005643701,"threshold_uncertainty_score":0.9995847},"labels":[],"label_agreement":null},{"id":"W2274875244","doi":"10.46298/dmtcs.2097","title":"Bounding the monomial index and (1,l)-weight choosability of a graph","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Graph; Vertex (graph theory); Monomial; Upper and lower bounds; Bound graph; Discrete mathematics; Graph power; Line graph","score_opus":0.013370642156780903,"score_gpt":0.27961273395916114,"score_spread":0.26624209180238023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274875244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11956856,0.000021549125,0.87729645,0.0006922855,0.0001753621,0.00028444035,0.0000015310849,0.00007142496,0.0018884016],"genre_scores_gemma":[0.8231796,0.0000045113134,0.17664678,0.00009133564,0.000051836047,0.0000129814,2.0511249e-7,0.000009648369,0.0000031199058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968946,0.0002625563,0.0004909842,0.0007270683,0.0009776931,0.00064711564],"domain_scores_gemma":[0.99616015,0.0015674435,0.00017644314,0.0016160758,0.0002073918,0.00027250306],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0049866815,0.0002400689,0.00036417897,0.00022514892,0.0006226774,0.00047770498,0.0034362222,0.000058511163,0.000013372086],"category_scores_gemma":[0.00058341736,0.00014966106,0.00011054415,0.0013207666,0.008688982,0.0006342007,0.0021216664,0.00031891983,0.0000076206065],"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.0000079020265,0.000045969813,0.00028317765,0.000038636055,0.000006799416,7.2155285e-7,0.0012571089,0.00006178023,0.00048449571,0.9905338,0.000004260617,0.0072753313],"study_design_scores_gemma":[0.00013530828,0.00008497322,0.0005275597,0.000026977707,0.000003754709,0.000013368765,0.000023539786,0.43054482,0.0012073572,0.56729925,0.000018157336,0.00011492022],"about_ca_topic_score_codex":0.0000022436514,"about_ca_topic_score_gemma":7.319349e-7,"teacher_disagreement_score":0.703611,"about_ca_system_score_codex":0.0000299594,"about_ca_system_score_gemma":0.00007509325,"threshold_uncertainty_score":0.9940088},"labels":[],"label_agreement":null},{"id":"W2284354567","doi":"10.46298/dmtcs.2972","title":"Orbits of the Bernoulli measure in single-transition asynchronous cellular automata","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":10,"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":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Bernoulli's principle; Measure (data warehouse); Mathematics; Cellular automaton; Bernoulli scheme; Binary number; Asynchronous communication; Stochastic cellular automaton; Orbit (dynamics); Automaton; Statistical physics; Combinatorics; Algorithm; Physics; Computer science; Theoretical computer science","score_opus":0.01841264001235938,"score_gpt":0.22390970690966802,"score_spread":0.20549706689730865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2284354567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074590035,0.000026675412,0.9186918,0.00038126454,0.00017519812,0.0003690949,0.000004411335,0.00011998339,0.005641543],"genre_scores_gemma":[0.7961495,0.0000014028254,0.2037295,0.00007373586,0.000017815446,0.000013746993,0.000001028634,0.000010505017,0.0000028110599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744445,0.00010295049,0.0005470681,0.00056997105,0.000864508,0.0004710264],"domain_scores_gemma":[0.9977422,0.00012626465,0.00018669413,0.0016506197,0.00015404551,0.00014017962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012149233,0.00022122395,0.0002939357,0.00015685036,0.00024735116,0.00016199061,0.0034701591,0.00007524928,0.0000345779],"category_scores_gemma":[0.00006096869,0.00015438139,0.00013232311,0.0015441757,0.0018869162,0.00044456148,0.0008880675,0.00020763082,0.00003115835],"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.0000016321454,0.00031656146,0.000021444259,0.00004326906,0.000004470376,0.0000047787416,0.005385306,0.0000384663,0.012852143,0.97885036,0.0000050956514,0.0024764938],"study_design_scores_gemma":[0.00022079344,0.00009372983,0.0006214363,0.00018620405,0.000014357933,0.000030786374,0.000055647746,0.6607698,0.07682328,0.26093838,0.000008844712,0.00023670933],"about_ca_topic_score_codex":0.000010272644,"about_ca_topic_score_gemma":0.0000036019385,"teacher_disagreement_score":0.7215594,"about_ca_system_score_codex":0.000054683827,"about_ca_system_score_gemma":0.00012667612,"threshold_uncertainty_score":0.69524217},"labels":[],"label_agreement":null},{"id":"W2286047733","doi":"10.46298/dmtcs.3595","title":"Minimal Factorizations of Permutations into Star Transpositions","year":2008,"lang":"fr","type":"book-chapter","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","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":"Saint Mary's University; St. Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Permutation (music); Combinatorics; Mathematics; Star (game theory); Simple (philosophy); Symmetry (geometry); Parity of a permutation; Factorization; Symmetric group; Discrete mathematics; Cyclic permutation; Algorithm; Physics","score_opus":0.013641827223859806,"score_gpt":0.22867255934584396,"score_spread":0.21503073212198415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286047733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016086018,0.00022453083,0.9177947,0.00019707577,0.0008832508,0.0006164184,0.00039987054,0.0001606106,0.06363751],"genre_scores_gemma":[0.8358155,0.00009789229,0.16350286,0.000015966765,0.00014900757,0.000019803143,0.000054787033,0.00008317162,0.00026100758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963531,0.000077364384,0.0012698562,0.00065725285,0.0010099369,0.00063250033],"domain_scores_gemma":[0.9972276,0.00069373776,0.0002670662,0.00093713304,0.00044171416,0.00043276043],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006028076,0.000658638,0.0008658434,0.0004903188,0.00086771394,0.00014397212,0.0012517394,0.000314987,0.0008460525],"category_scores_gemma":[0.00006375728,0.0006297091,0.0004716104,0.00053064973,0.009795874,0.00036840892,0.00018472053,0.00052103447,0.0001581783],"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.000005252157,0.00009591167,0.0000054248017,0.0006386875,0.00010344078,0.000017526534,0.013117202,0.002459783,0.002136142,0.98104084,0.000012318433,0.00036749188],"study_design_scores_gemma":[0.00025665178,0.00029802602,0.00006531998,0.0013343117,0.00028220288,0.00012595003,0.0002887441,0.3221381,0.001766659,0.67208296,0.0005002325,0.0008608131],"about_ca_topic_score_codex":0.000007189224,"about_ca_topic_score_gemma":0.0000036564643,"teacher_disagreement_score":0.8197295,"about_ca_system_score_codex":0.00012014139,"about_ca_system_score_gemma":0.00017773894,"threshold_uncertainty_score":0.99961543},"labels":[],"label_agreement":null},{"id":"W2289169217","doi":"10.46298/dmtcs.2530","title":"A Baxter class of a different kind, and other bijective results using tableau sequences ending with a row shape","year":2015,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Bijection, injection and surjection; Antipodal point; Conjecture; Young tableau; Combinatorics; Mathematics; Bounded function; Mathematical proof; Class (philosophy); Symmetry (geometry); Generating function; Set (abstract data type); Computer science; Geometry","score_opus":0.052289998594641986,"score_gpt":0.32797683535277156,"score_spread":0.27568683675812955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289169217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37547764,0.000049830687,0.61841106,0.000117691656,0.0005268984,0.0015365098,0.00013775105,0.00017379758,0.003568818],"genre_scores_gemma":[0.61027545,0.000003441264,0.389449,0.000026910518,0.00011624522,0.000035437104,0.0000024978883,0.000083433384,0.0000076007573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99379987,0.0002531449,0.0014866702,0.0014306243,0.0020643172,0.0009653554],"domain_scores_gemma":[0.9935745,0.0019164323,0.0014912571,0.0017448125,0.0007955845,0.00047743964],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0028652472,0.00096871593,0.0017603874,0.00045717868,0.00030111647,0.00049680413,0.0017930712,0.0003494747,0.000032508997],"category_scores_gemma":[0.0014851746,0.0006579385,0.0001904414,0.00073264306,0.0053250934,0.0003041127,0.0034584077,0.00092713867,0.0000033367926],"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.00011797954,0.00028574563,0.000023834598,0.001296333,0.00011365953,0.000018172805,0.008941061,0.00029262307,0.0005099842,0.98818696,0.000010573276,0.00020310559],"study_design_scores_gemma":[0.0005810673,0.00028648516,0.0000024144836,0.0021906798,0.00017942121,0.0000664433,0.00042395643,0.385244,0.001448481,0.60905874,0.0000036002596,0.0005147121],"about_ca_topic_score_codex":0.000009746475,"about_ca_topic_score_gemma":0.0000043875084,"teacher_disagreement_score":0.38495138,"about_ca_system_score_codex":0.00031949676,"about_ca_system_score_gemma":0.00043728424,"threshold_uncertainty_score":0.9995872},"labels":[],"label_agreement":null},{"id":"W2295471604","doi":"10.46298/dmtcs.2154","title":"Edge-partitioning graphs into regular and locally irregular components","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"European Commission","keywords":"Mathematics; Combinatorics; Conjecture; Bipartite graph; Partition (number theory); Upper and lower bounds; Prime (order theory); Graph; Discrete mathematics","score_opus":0.010474687591296827,"score_gpt":0.23086652874578822,"score_spread":0.2203918411544914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2295471604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09900626,0.00008100982,0.8966211,0.0029839242,0.0003147804,0.00019371632,0.0000014183314,0.00026185715,0.00053592876],"genre_scores_gemma":[0.6477915,0.000010388113,0.3519137,0.0002389971,0.000010522643,0.000008884756,5.850285e-7,0.0000114598315,0.0000139993335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967293,0.00010412236,0.0005258396,0.0009696876,0.0009832475,0.00068778085],"domain_scores_gemma":[0.997486,0.00038029067,0.00015237505,0.0012217227,0.00027903763,0.00048055913],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018872455,0.00030385703,0.0003438534,0.00029068466,0.00071544363,0.00064578705,0.0018064466,0.00007959178,0.000023713517],"category_scores_gemma":[0.00017954997,0.0001927822,0.00010018072,0.00090153905,0.0044722105,0.00082730944,0.0014840908,0.0001377067,0.000070219816],"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.0000028874306,0.000058564605,0.000040230367,0.000029076797,0.000009128616,0.000009521758,0.00077542086,0.000011341535,0.013658877,0.9783992,0.00005010408,0.0069556283],"study_design_scores_gemma":[0.00032011047,0.0000987488,0.000098040495,0.0002797055,0.00000932558,0.000050158018,0.000015019142,0.22030896,0.004799328,0.7737008,0.000043938126,0.00027591927],"about_ca_topic_score_codex":0.0000025366514,"about_ca_topic_score_gemma":5.4204423e-7,"teacher_disagreement_score":0.5487852,"about_ca_system_score_codex":0.00003194681,"about_ca_system_score_gemma":0.00006517412,"threshold_uncertainty_score":0.9982371},"labels":[],"label_agreement":null},{"id":"W2306909249","doi":"10.46298/dmtcs.3504","title":"Random assignment and shortest path problems","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"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; Combinatorics; Shortest path problem; Mathematical proof; Path (computing); Discrete mathematics; Random assignment; Random graph; Assignment problem; Limit (mathematics); Similarity (geometry); Distance; Graph; Computer science; Statistics; Artificial intelligence","score_opus":0.012975761289917552,"score_gpt":0.25492737676690247,"score_spread":0.2419516154769849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2306909249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15615147,0.00006890779,0.82571673,0.0002062586,0.00026224926,0.0005935492,0.000010043433,0.00016724944,0.016823541],"genre_scores_gemma":[0.812032,0.0000058742535,0.18766934,0.00007771711,0.00013287611,0.00002039459,0.0000017564416,0.000026541144,0.00003351626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971721,0.0000926717,0.000600755,0.0006068358,0.0008947461,0.00063287636],"domain_scores_gemma":[0.9978398,0.00093733857,0.00016729646,0.00072019483,0.00011979226,0.00021559252],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0020768195,0.0003399682,0.0004672066,0.00013653819,0.0007500113,0.00035104956,0.0007642848,0.000088846915,0.00009642481],"category_scores_gemma":[0.0002072655,0.00022717637,0.00011583229,0.00038123268,0.0037331623,0.00020444287,0.0007415911,0.00022928989,0.0000065036675],"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.000008606218,0.00010170181,0.00009480739,0.000074132084,0.000011238453,0.0000074469353,0.0009927503,0.000035991867,0.00038631336,0.997557,0.000114610375,0.00061539246],"study_design_scores_gemma":[0.00049796957,0.00010201285,0.00014049599,0.000113801216,0.000042378826,0.000057449477,0.000057135177,0.102921456,0.00053133833,0.89517885,0.00005231874,0.00030480413],"about_ca_topic_score_codex":0.000002421551,"about_ca_topic_score_gemma":8.8218707e-7,"teacher_disagreement_score":0.6558805,"about_ca_system_score_codex":0.000034613884,"about_ca_system_score_gemma":0.000034729714,"threshold_uncertainty_score":0.9989781},"labels":[],"label_agreement":null},{"id":"W2311329553","doi":"10.46298/dmtcs.2879","title":"Unitary Matrix Integrals, Primitive Factorizations, and Jucys-Murphy Elements","year":2010,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"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":"","keywords":"Mathematics; Combinatorics; Factorization; Permutation (music); Unitary state; Permutation group; Hierarchy; Unique factorization domain; Symmetric group; Algebra over a field; Pure mathematics; Algorithm","score_opus":0.0078064844100120745,"score_gpt":0.24448053424556881,"score_spread":0.23667404983555673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2311329553","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.35994774,0.00043640842,0.6270497,0.0005917739,0.0037969318,0.00058871636,0.00010419612,0.00020037846,0.0072841793],"genre_scores_gemma":[0.8441656,0.000046531157,0.15525709,0.00005311627,0.0002619692,0.000016398948,0.000011845633,0.0000472703,0.00014018003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701095,0.00013696181,0.0007331779,0.00061075453,0.00065766874,0.00085051154],"domain_scores_gemma":[0.99788046,0.00049488066,0.00013870522,0.0007523633,0.00021671261,0.00051686674],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0018266692,0.00048118323,0.00048137357,0.00026995543,0.00051918527,0.00058472337,0.0009922704,0.00021506686,0.00041218937],"category_scores_gemma":[0.00020988879,0.0004193292,0.00012502659,0.00089261436,0.004525666,0.0006156312,0.000517337,0.00078246905,0.00012283184],"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.000004083333,0.00009070816,0.00014344054,0.00033585122,0.000044854758,0.000011446251,0.0034729652,0.000058704296,0.0043132375,0.9874273,0.000071361144,0.004026055],"study_design_scores_gemma":[0.0002784166,0.00013846227,0.00029773454,0.0004222241,0.00008931875,0.00010718637,0.0007904718,0.41727325,0.0026924948,0.5766327,0.0007008895,0.0005768877],"about_ca_topic_score_codex":0.000010274015,"about_ca_topic_score_gemma":0.0000052720475,"teacher_disagreement_score":0.48421785,"about_ca_system_score_codex":0.000050944655,"about_ca_system_score_gemma":0.0000791689,"threshold_uncertainty_score":0.99982584},"labels":[],"label_agreement":null},{"id":"W2330539116","doi":"10.46298/dmtcs.2830","title":"The Hodge Structure of the Coloring Complex of a Hypergraph (Extended Abstract)","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Topological and Geometric Data Analysis","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Hypergraph; Graph","score_opus":0.012580934970896985,"score_gpt":0.2546729614437122,"score_spread":0.24209202647281522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2330539116","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.4439307,0.000022890086,0.55143744,0.001575993,0.00063762936,0.00028085473,0.00003528396,0.000056262736,0.0020229649],"genre_scores_gemma":[0.88044417,0.0000035831436,0.11943666,0.000069919144,0.000032414344,0.0000021712408,7.290673e-7,0.0000046057253,0.000005757802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737424,0.000059758047,0.000593428,0.0004447061,0.0010713255,0.0004565734],"domain_scores_gemma":[0.9963791,0.00103485,0.0003680636,0.0017799224,0.0002909777,0.00014712394],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012745894,0.00019663524,0.000352132,0.00014963276,0.00059751567,0.0002769921,0.0061715627,0.00007001877,0.00006953267],"category_scores_gemma":[0.0006008422,0.0000898537,0.00022082358,0.0027327023,0.006197892,0.00025582116,0.0020362472,0.0003775554,0.0000041054077],"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.0000022721024,0.000054374686,0.00006556962,0.000015670885,0.000015116032,9.617372e-7,0.00028578955,0.000025109652,0.02349966,0.97207355,0.000019516154,0.003942413],"study_design_scores_gemma":[0.00015525108,0.00009884716,0.01247445,0.00002642237,0.00002961894,0.00003018899,0.00006308729,0.20493849,0.022078622,0.7597749,0.00012997702,0.00020015435],"about_ca_topic_score_codex":0.0000068130876,"about_ca_topic_score_gemma":0.000008300305,"teacher_disagreement_score":0.43651345,"about_ca_system_score_codex":0.000008893292,"about_ca_system_score_gemma":0.0000781637,"threshold_uncertainty_score":0.9992055},"labels":[],"label_agreement":null},{"id":"W2338247781","doi":"10.46298/dmtcs.2516","title":"Dyck path triangulations and extendability (extended abstract)","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"York University","funders":"","keywords":"Combinatorics; Simplex; Mathematics; Triangulation; Matroid; Path (computing); Geometry; Computer science","score_opus":0.038850995886471604,"score_gpt":0.3292025958975816,"score_spread":0.29035160001111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338247781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15333143,0.000039922776,0.83400244,0.00061386375,0.0006589359,0.00091142295,0.00001657257,0.00039294103,0.010032491],"genre_scores_gemma":[0.59596443,0.000002030538,0.4037948,0.0000497108,0.00010900203,0.000023011982,0.000001622058,0.00003429248,0.000021132457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960196,0.000101985934,0.0009450464,0.0007927317,0.0013833034,0.0007573248],"domain_scores_gemma":[0.99528265,0.0016926916,0.00034082233,0.0013654355,0.00054806325,0.0007703652],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0036717353,0.00043919144,0.0006789371,0.00018185766,0.00041211554,0.00037918903,0.0010245979,0.00013254599,0.000081437865],"category_scores_gemma":[0.004306724,0.00034549454,0.00012793762,0.0007621798,0.0033532926,0.00057581405,0.00083223137,0.00035907328,0.000048077178],"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.000015374375,0.0002985632,0.0000113780525,0.00012983698,0.000012992051,0.00000946353,0.0027597353,0.000010229566,0.00014714955,0.99503475,0.00009812311,0.0014724247],"study_design_scores_gemma":[0.000681289,0.00017219131,0.00010117917,0.00011206387,0.000049326256,0.000057908026,0.00038248615,0.09176616,0.0004146225,0.9058252,0.000043012784,0.00039457198],"about_ca_topic_score_codex":0.000001525643,"about_ca_topic_score_gemma":7.8062897e-7,"teacher_disagreement_score":0.44263297,"about_ca_system_score_codex":0.00014433995,"about_ca_system_score_gemma":0.00021108752,"threshold_uncertainty_score":0.9998997},"labels":[],"label_agreement":null},{"id":"W2338798372","doi":"10.46298/dmtcs.2679","title":"Hopf algebras and the logarithm of the S-transform in free probability ― Extended abstract","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Random Matrices and Applications","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Multiplicative function; Logarithm; Convolution (computer science); Hopf algebra; Free probability; Algebraic number; Pure mathematics; Algebra over a field; Mathematical analysis","score_opus":0.01484911520000599,"score_gpt":0.2778221053427741,"score_spread":0.2629729901427681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338798372","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.5885329,0.00018426779,0.35650855,0.027173474,0.00016965214,0.0032410412,0.000024466626,0.00009385823,0.02407175],"genre_scores_gemma":[0.91490346,0.000013329604,0.084881365,0.00013453075,0.000026099779,0.000022250193,2.2914239e-7,0.000007205676,0.00001152891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998127,0.00006920462,0.0005781089,0.00031754246,0.00057521526,0.00033294188],"domain_scores_gemma":[0.997414,0.0011625682,0.0001778598,0.0010689229,0.000096428135,0.00008020512],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0029283683,0.00017520395,0.00035530826,0.000056809888,0.0002713298,0.00012876322,0.0013698514,0.00005839944,0.000027294675],"category_scores_gemma":[0.0005154441,0.00008522007,0.00012799294,0.00064520707,0.004327767,0.00015296198,0.00026966224,0.00024891415,0.0000017858044],"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.000018505854,0.00015906876,0.000007745391,0.00006841906,0.000004004252,4.5791182e-7,0.001629111,0.0000059881095,0.000049341495,0.9947621,0.000033910157,0.0032613394],"study_design_scores_gemma":[0.001008079,0.000036418864,0.0012284082,0.000089849054,0.00002712036,0.000015868243,0.000083388586,0.040437635,0.00047531878,0.956478,0.000011140644,0.00010877043],"about_ca_topic_score_codex":0.0000063865727,"about_ca_topic_score_gemma":0.0000068796526,"teacher_disagreement_score":0.3263705,"about_ca_system_score_codex":0.000022263133,"about_ca_system_score_gemma":0.000054330143,"threshold_uncertainty_score":0.9983819},"labels":[],"label_agreement":null},{"id":"W2339763958","doi":"10.46298/dmtcs.2870","title":"Words and Noncommutative Invariants of the Hyperoctahedral Group","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":1,"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":"Mathematics; Combinatorics; Permutation group; Symmetric group; Morphism; Subalgebra; Permutation (music); Algebra over a field; Pure mathematics; Physics","score_opus":0.013484681940819507,"score_gpt":0.27329457899629717,"score_spread":0.25980989705547763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339763958","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.8572752,0.000005809932,0.1381371,0.000282705,0.0007722048,0.0002942597,0.0000043428145,0.00003591489,0.003192492],"genre_scores_gemma":[0.87654847,9.0255014e-7,0.12326869,0.00006961137,0.00008279552,0.0000069411954,2.4804203e-7,0.00001639915,0.0000059206636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811214,0.00006987817,0.00041835004,0.0003435891,0.0007001782,0.0003558521],"domain_scores_gemma":[0.9979026,0.0007986866,0.0002090498,0.00081211334,0.00012282301,0.00015478219],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010443755,0.00021847582,0.00035011768,0.00006362429,0.00035688322,0.00014031741,0.0012667022,0.00008956176,0.00006886796],"category_scores_gemma":[0.0005721329,0.00012699884,0.00009942911,0.00045584736,0.004483018,0.00018196269,0.0010857031,0.00040498018,0.0000020988452],"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.000005901445,0.00005440457,0.000067630885,0.000042246556,0.0000102222775,7.8246444e-7,0.0032517673,7.784508e-7,0.0016632521,0.9944135,0.000007351471,0.00048214238],"study_design_scores_gemma":[0.00025877592,0.0000776008,0.00029565973,0.00006476465,0.000030054374,0.00003293956,0.0001786801,0.025795158,0.0021518117,0.97094434,0.0000049153296,0.0001652707],"about_ca_topic_score_codex":0.0000030863878,"about_ca_topic_score_gemma":0.0000033137972,"teacher_disagreement_score":0.02579438,"about_ca_system_score_codex":0.000012526929,"about_ca_system_score_gemma":0.000075251985,"threshold_uncertainty_score":0.9982262},"labels":[],"label_agreement":null},{"id":"W2340243354","doi":"10.46298/dmtcs.2967","title":"Supercharacters, symmetric functions in noncommuting variables (extended abstract)","year":2011,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","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":"York University","funders":"National Defense Science and Engineering Graduate; Universidade de Lisboa; York University; Pomona College; Concordia University of Edmonton; Bard College; National Science Foundation; University of Washington; Pennsylvania State University; University of Wisconsin-Madison; Natural Sciences and Engineering Research Council of Canada; Drexel University; American Institute of Mathematics; California Institute of Technology; University of Aberdeen; University of Pennsylvania; University of Southern California","keywords":"Hopf algebra; Mathematics; Unipotent; Pure mathematics; Field (mathematics); Ring (chemistry); Algebra over a field; Combinatorics","score_opus":0.03465641868717312,"score_gpt":0.28368081745807616,"score_spread":0.24902439877090304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2340243354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07593988,0.00038123468,0.83648974,0.0006773921,0.005398378,0.0015257986,0.00006883768,0.00037618115,0.07914253],"genre_scores_gemma":[0.57327104,0.00003384885,0.42597857,0.00006985659,0.00027250548,0.00004590608,0.000005355572,0.00010899491,0.00021390172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918837,0.00030331037,0.0023842687,0.0013738123,0.0017721772,0.002282731],"domain_scores_gemma":[0.991712,0.0038054183,0.0007272997,0.002364121,0.00061204634,0.00077912],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0051974272,0.0010160699,0.0014494321,0.0011097405,0.0007694379,0.0005572195,0.003013319,0.00047734528,0.0016419138],"category_scores_gemma":[0.0034309211,0.00095998397,0.000373556,0.0042724297,0.0058181263,0.0015348883,0.0019037165,0.001547403,0.000618875],"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.000027065285,0.0021417462,0.000073472154,0.0010009131,0.000056684796,0.00013162916,0.01174296,0.000019144925,0.00025469682,0.98053414,0.00006003932,0.003957511],"study_design_scores_gemma":[0.00074915105,0.0003184039,0.00031136125,0.0016576494,0.00017207768,0.0002132343,0.0013025049,0.15389273,0.00088790845,0.8394844,0.00007718351,0.00093341985],"about_ca_topic_score_codex":0.000043118816,"about_ca_topic_score_gemma":0.000009257707,"teacher_disagreement_score":0.49733117,"about_ca_system_score_codex":0.00059085316,"about_ca_system_score_gemma":0.00043477982,"threshold_uncertainty_score":0.99928504},"labels":[],"label_agreement":null},{"id":"W2341383368","doi":"10.46298/dmtcs.3556","title":"Point process stabilization methods and dimension estimation","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Point processes and geometric inequalities","field":"Mathematics","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":"National Science Foundation","keywords":"Mathematics; Dimension (graph theory); Estimation; Point process; Point (geometry); Process (computing); Statistics; Applied mathematics; Combinatorics; Geometry; Computer science; Economics","score_opus":0.04144402936412108,"score_gpt":0.36539619951748153,"score_spread":0.3239521701533605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341383368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21656577,0.000031718122,0.78135806,0.00018401521,0.00009105755,0.00025700798,0.0000026992277,0.000120544624,0.0013891155],"genre_scores_gemma":[0.5197055,0.000009484705,0.48017117,0.00005168902,0.000024592775,0.000010374002,0.0000016965885,0.000013301523,0.0000121881785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976582,0.00010899942,0.0005619053,0.00048794373,0.00075043156,0.00043251287],"domain_scores_gemma":[0.99753606,0.001226482,0.00020261921,0.0004540866,0.00038585791,0.00019487318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027373163,0.0002445805,0.00037658794,0.00027322947,0.0005904127,0.00016341441,0.00040910396,0.00007099116,0.000070062015],"category_scores_gemma":[0.0023332925,0.00018030229,0.00005570572,0.0011171334,0.002041402,0.00058227184,0.00032172684,0.0001537369,0.000008602749],"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.000006124002,0.000083863306,0.000016608716,0.0003270745,0.0000058650685,0.0000031817872,0.0060499413,0.000055639506,0.00020272187,0.99064213,0.00001636318,0.0025904994],"study_design_scores_gemma":[0.00011943921,0.00008582827,0.000023803386,0.00007210143,0.000015794729,0.00008486828,0.00023951773,0.4133218,0.0036305988,0.5822428,0.000003051825,0.00016042091],"about_ca_topic_score_codex":0.0000011689948,"about_ca_topic_score_gemma":1.7892309e-7,"teacher_disagreement_score":0.41326615,"about_ca_system_score_codex":0.000036680347,"about_ca_system_score_gemma":0.00008835201,"threshold_uncertainty_score":0.7521631},"labels":[],"label_agreement":null},{"id":"W2346193990","doi":"10.23638/dmtcs-21-4-9","title":"$(2/2/3)$-SAT problem and its applications in dominating set problems","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Set (abstract data type); Computer science; Dominating set; Mathematics; Programming language; Theoretical computer science; Graph","score_opus":0.01667766956551976,"score_gpt":0.29466171826498233,"score_spread":0.2779840486994626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346193990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08343504,0.00007210246,0.90962654,0.00031137315,0.00006281554,0.0014344326,0.0000038370345,0.00013981447,0.00491403],"genre_scores_gemma":[0.7200454,0.0000065758136,0.27975577,0.000051886,0.000015225012,0.00008385394,0.0000014976247,0.000014140461,0.000025643012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666476,0.00011488859,0.0004969054,0.0010045676,0.00089012284,0.0008287727],"domain_scores_gemma":[0.99748534,0.00089662755,0.00013832025,0.001000216,0.00019953915,0.00027997102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026165987,0.00027426024,0.00035559988,0.0004011763,0.00030394635,0.0005654591,0.0025886302,0.00006831253,0.000024859997],"category_scores_gemma":[0.00010264651,0.00021701677,0.000058027672,0.0020247637,0.0011968116,0.0010798059,0.0020741634,0.00035648653,0.00011593544],"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.000001815525,0.000054946777,0.00019309994,0.00016315654,0.0000030042065,0.0000024381604,0.0026134893,0.00024211378,0.0017651224,0.99281806,8.6494504e-7,0.0021419118],"study_design_scores_gemma":[0.00018391217,0.00007035827,0.00007387391,0.000115343864,0.0000016694635,0.000017101615,0.000079763704,0.48256612,0.00071993814,0.5159758,0.000016166801,0.0001799768],"about_ca_topic_score_codex":7.8857187e-7,"about_ca_topic_score_gemma":7.696913e-7,"teacher_disagreement_score":0.6366104,"about_ca_system_score_codex":0.000060147086,"about_ca_system_score_gemma":0.00008786718,"threshold_uncertainty_score":0.8849687},"labels":[],"label_agreement":null},{"id":"W2390088041","doi":"10.46298/dmtcs.12816","title":"Schubert polynomials and $k$-Schur functions (Extended abstract)","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Schur algebra; Schur polynomial; Combinatorics; Bruhat order; Schur's lemma; Schur's theorem; Affine transformation; Grassmannian; Pure mathematics; Macdonald polynomials; Coxeter group; Orthogonal polynomials; Difference polynomials; Gegenbauer polynomials; Classical orthogonal polynomials","score_opus":0.018260643456893457,"score_gpt":0.28726613859377553,"score_spread":0.2690054951368821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2390088041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26265576,0.000043363463,0.7122765,0.0008724746,0.00087626616,0.001403456,0.000012262381,0.0005295247,0.021330368],"genre_scores_gemma":[0.66021806,0.0000051913153,0.339271,0.00010742882,0.00015817951,0.000073120646,0.0000014937642,0.000051280855,0.00011421601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961608,0.000064210515,0.00096077926,0.0008086363,0.0010622306,0.00094334],"domain_scores_gemma":[0.99560755,0.0017683404,0.00033845837,0.0012705266,0.00043017624,0.00058493466],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014706539,0.0005053612,0.00070145616,0.00025367131,0.0006779455,0.0006859042,0.0011251179,0.00015254755,0.0005739343],"category_scores_gemma":[0.0015540959,0.0003958078,0.00014534246,0.0006964359,0.00323755,0.000919831,0.0009022974,0.00042250444,0.0003288754],"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.0000044698286,0.00021445926,0.000009870676,0.00014862018,0.000023091663,0.0000040652453,0.00082825904,0.0000029751507,0.0020273519,0.9939012,0.00046284124,0.002372797],"study_design_scores_gemma":[0.00038977055,0.00014086641,0.00014592265,0.00015888002,0.000053263448,0.000073280484,0.00027966197,0.04206002,0.0014985807,0.95464545,0.00006426102,0.00049004686],"about_ca_topic_score_codex":0.000006054771,"about_ca_topic_score_gemma":8.9447377e-7,"teacher_disagreement_score":0.39756233,"about_ca_system_score_codex":0.000087133376,"about_ca_system_score_gemma":0.00010544511,"threshold_uncertainty_score":0.9998494},"labels":[],"label_agreement":null},{"id":"W2401129216","doi":"10.46298/dmtcs.2971","title":"Product decomposition for surjective 2-block NCCA","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Surjective function; Injective function; Mathematics; Product (mathematics); Block (permutation group theory); Uniqueness; Decomposition; Pure mathematics; Combinatorics; Mathematical analysis; Chemistry; Geometry","score_opus":0.01964220524179911,"score_gpt":0.27471379124091,"score_spread":0.2550715859991109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401129216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008903338,0.000015765369,0.9821634,0.000368381,0.00025149703,0.0007291197,0.000007527039,0.0003053343,0.0072555835],"genre_scores_gemma":[0.53234535,9.734435e-7,0.46744707,0.00007674583,0.00004686321,0.00006304872,0.0000023759108,0.000009346946,0.00000821318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769807,0.0000417758,0.0003832151,0.0008297035,0.00048882136,0.00055839925],"domain_scores_gemma":[0.9978749,0.00023137787,0.00013661994,0.001226905,0.00030361995,0.00022656561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011131472,0.00023104096,0.0002520964,0.00016213964,0.0005708351,0.00037048114,0.002344387,0.00004255014,0.000023216215],"category_scores_gemma":[0.00008029547,0.00018843939,0.00013286501,0.00086447824,0.0012195259,0.00061286584,0.00070848264,0.00012193262,0.00007393613],"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.0000034179448,0.00016024579,0.0000069276907,0.00002627295,0.000007882677,0.000001750393,0.002251038,0.000008377341,0.0021396428,0.9923922,0.000055875815,0.002946389],"study_design_scores_gemma":[0.0001371582,0.00011949323,0.0001594588,0.000026031867,0.000012722877,0.00004014114,0.000021914786,0.51374316,0.025474297,0.4599746,0.00006460341,0.00022641227],"about_ca_topic_score_codex":0.0000024201895,"about_ca_topic_score_gemma":5.372942e-7,"teacher_disagreement_score":0.5324176,"about_ca_system_score_codex":0.000043948552,"about_ca_system_score_gemma":0.000103098675,"threshold_uncertainty_score":0.7684335},"labels":[],"label_agreement":null},{"id":"W2401158721","doi":"10.46298/dmtcs.604","title":"Cyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","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 Winnipeg","funders":"","keywords":"Combinatorics; Hypergraph; Partition (number theory); Mathematics; Multipartite; Vertex (graph theory); Permutation (music); Discrete mathematics; Graph; Physics","score_opus":0.01190850429495624,"score_gpt":0.21350294115809273,"score_spread":0.2015944368631365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401158721","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.79739195,0.00009485859,0.19330108,0.00009986814,0.00028471995,0.0005298632,0.00004943504,0.00024275099,0.00800546],"genre_scores_gemma":[0.96762246,0.000017632365,0.03218923,0.00005168999,0.00003401105,0.000047830275,0.000004931567,0.000028014081,0.000004179772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979911,0.00005309363,0.0005952052,0.00034848182,0.00044731385,0.0005648016],"domain_scores_gemma":[0.9985298,0.00029852343,0.00008805373,0.0006263836,0.00014285096,0.00031439666],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00057923264,0.00029053242,0.00045759426,0.00024948758,0.00029068053,0.00019538755,0.00064554845,0.00006773184,0.00013346171],"category_scores_gemma":[0.000038258957,0.00023399823,0.000133449,0.0007212046,0.0032891391,0.0003736262,0.00020752496,0.00018157736,0.000089304514],"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.0000020787977,0.000046009725,0.00015821561,0.00018656705,0.000029587076,0.0000015317299,0.0010315714,0.00047411877,0.030081978,0.9674153,0.000037483776,0.0005355619],"study_design_scores_gemma":[0.00026949195,0.00009585335,0.0013135625,0.00016622449,0.00002997766,0.000041318464,0.00021891299,0.62631065,0.001990179,0.36913002,0.00008595635,0.00034785926],"about_ca_topic_score_codex":0.000006645597,"about_ca_topic_score_gemma":0.000001877848,"teacher_disagreement_score":0.62583655,"about_ca_system_score_codex":0.000013139678,"about_ca_system_score_gemma":0.000011323269,"threshold_uncertainty_score":0.9994233},"labels":[],"label_agreement":null},{"id":"W2410782219","doi":"10.46298/dmtcs.2727","title":"Universal cycles for permutation classes","year":2009,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","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":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Permutation (music); Class (philosophy); Parity of a permutation; Cyclic permutation; Symmetric group; Physics","score_opus":0.018646532285511847,"score_gpt":0.2787453586999372,"score_spread":0.2600988264144254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2410782219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010128137,0.00043430764,0.96841836,0.0127809355,0.0017217653,0.0006447193,0.00003436923,0.0002898008,0.0055476255],"genre_scores_gemma":[0.5570691,0.00002674464,0.44151875,0.0008407808,0.000331804,0.000007628729,0.0000058551386,0.000019206753,0.00018013154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956702,0.00014982461,0.0006954538,0.0011688126,0.00103514,0.0012805616],"domain_scores_gemma":[0.996412,0.001114406,0.000282308,0.0011853501,0.00050596026,0.0005000132],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023640112,0.0005061249,0.0005497024,0.00028054242,0.0009127517,0.001900029,0.0030485326,0.00018314923,0.00010627252],"category_scores_gemma":[0.00033690195,0.00045172632,0.0002994647,0.0012493347,0.004370576,0.0019914028,0.0006217198,0.00029557166,0.000113239694],"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.000012035403,0.00025325987,0.0000023627795,0.000102047,0.000013852442,0.000020256133,0.0037869562,0.00023443582,0.00087232434,0.9283366,0.00035675464,0.06600907],"study_design_scores_gemma":[0.0002565894,0.0004023039,0.00008610155,0.000211271,0.00003428347,0.000063863634,0.00015607831,0.51006866,0.001100983,0.48691216,0.00037788835,0.00032984035],"about_ca_topic_score_codex":0.0000032918415,"about_ca_topic_score_gemma":6.34311e-7,"teacher_disagreement_score":0.546941,"about_ca_system_score_codex":0.00014922177,"about_ca_system_score_gemma":0.00034907696,"threshold_uncertainty_score":0.99979347},"labels":[],"label_agreement":null},{"id":"W2411941568","doi":"10.23638/dmtcs-20-1-6","title":"A Study of $k$-dipath Colourings of Oriented Graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Combinatorics; Mathematics","score_opus":0.020189179021580617,"score_gpt":0.3130555463560788,"score_spread":0.29286636733449817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2411941568","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.43821698,0.00000519379,0.5597229,0.000036307527,0.00013272018,0.00037797567,0.0000022411696,0.00006236044,0.0014433241],"genre_scores_gemma":[0.75152,0.0000010343501,0.24840532,0.000022309305,0.000020987713,0.000012919988,2.1799974e-7,0.0000118139415,0.0000054003735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958835,0.00018382499,0.0007673593,0.0007884319,0.0016932973,0.00068356],"domain_scores_gemma":[0.99600387,0.00052811735,0.00034531162,0.0018628557,0.000985333,0.00027454444],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002744486,0.00026142137,0.0005271836,0.00056027033,0.00032631747,0.00011812491,0.004139055,0.000052460768,0.000033638604],"category_scores_gemma":[0.00036312419,0.00020171877,0.000118552896,0.0034868254,0.00741315,0.00055674836,0.0024531707,0.00021213229,0.000016894857],"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.000020531006,0.0006683959,0.00025105214,0.00004136163,0.000018876191,0.00000841292,0.009804854,0.00001420251,0.002170738,0.98592573,0.000005155608,0.0010706809],"study_design_scores_gemma":[0.00065385894,0.002755616,0.0005034627,0.00011279596,0.0000164153,0.000024515079,0.0006898756,0.21454105,0.022092799,0.7583295,0.0000057037873,0.00027440098],"about_ca_topic_score_codex":0.0000036212143,"about_ca_topic_score_gemma":0.0000015532326,"teacher_disagreement_score":0.31330302,"about_ca_system_score_codex":0.000027140693,"about_ca_system_score_gemma":0.00012294283,"threshold_uncertainty_score":0.9952881},"labels":[],"label_agreement":null},{"id":"W2513478778","doi":"10.46298/dmtcs.2151","title":"Connected Tropical Subgraphs in Vertex-Colored Graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"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":"Université Paris-Sud; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Mathematics; Distance-hereditary graph; Induced subgraph isomorphism problem; Graph factorization; Discrete mathematics; Vertex (graph theory); Colored; Vertex connectivity; Graph; Line graph; Graph power; Voltage graph","score_opus":0.014897976962016534,"score_gpt":0.27965574467572957,"score_spread":0.264757767713713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513478778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17342167,0.00002175083,0.8221879,0.0014894581,0.00029679728,0.00041521346,0.00000468691,0.00026682406,0.0018957029],"genre_scores_gemma":[0.80834454,0.000012710041,0.19137584,0.00017065565,0.000019390704,0.00003989916,5.146558e-7,0.000021085709,0.000015384996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99474376,0.00029092256,0.0007220947,0.0013123673,0.0014805467,0.0014502814],"domain_scores_gemma":[0.99535084,0.0018067694,0.0001405393,0.0018470703,0.0002987026,0.00055606366],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0018147394,0.00040309408,0.0005387421,0.0008549923,0.000351579,0.00042745523,0.0049691834,0.00012312758,0.000116213916],"category_scores_gemma":[0.00081620977,0.00025462447,0.00019045689,0.0036006474,0.005863239,0.0012149039,0.0017522424,0.0003466296,0.00014421892],"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.000022808677,0.00014436232,0.000556741,0.00001772385,0.000008092655,0.0000497118,0.000650066,0.0000067468636,0.0047081728,0.9870759,0.000018934012,0.006740731],"study_design_scores_gemma":[0.00078651134,0.0002262379,0.002036322,0.0001477837,0.000004075339,0.00004394201,0.00002952475,0.12109009,0.0044112974,0.8708114,0.000020173604,0.0003926457],"about_ca_topic_score_codex":0.0000015281778,"about_ca_topic_score_gemma":0.000004442917,"teacher_disagreement_score":0.63492286,"about_ca_system_score_codex":0.0001157877,"about_ca_system_score_gemma":0.00017263976,"threshold_uncertainty_score":0.9999906},"labels":[],"label_agreement":null},{"id":"W2521876311","doi":"10.46298/dmtcs.2463","title":"Walks in the Quarter Plane with Multiple Steps","year":2015,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Austrian Science Fund","keywords":"Mathematics; Combinatorics; Nearest neighbour; Quarter (Canadian coin); Cover (algebra); Humanities; Plane (geometry); Geometry; Geography; Art; Artificial intelligence","score_opus":0.013173340214985573,"score_gpt":0.2220642555682592,"score_spread":0.20889091535327364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521876311","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.22267649,0.0005158777,0.7491011,0.0021046945,0.0015552551,0.00084006257,0.000026827596,0.00013615628,0.023043526],"genre_scores_gemma":[0.95903826,0.000004025212,0.040521573,0.00013257998,0.0002017288,0.00003089792,0.0000036239114,0.00003265969,0.000034624987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967246,0.0002995111,0.00054462545,0.00048073137,0.0010464208,0.0009041103],"domain_scores_gemma":[0.99772066,0.0007631714,0.00008748319,0.00096322095,0.00011678167,0.00034871313],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0039577824,0.00039551576,0.00043613443,0.00016792875,0.00019321531,0.00052758044,0.0015855461,0.00012622886,0.00005912169],"category_scores_gemma":[0.00010312859,0.00024180328,0.00008603835,0.0010624871,0.0033237152,0.00039638646,0.00018174178,0.00050879153,0.00022559667],"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.00002187082,0.00013421441,0.00023302768,0.00019679316,0.000017768438,0.000080968595,0.02702826,0.0024421306,0.000051879422,0.96883947,0.00026250226,0.0006911218],"study_design_scores_gemma":[0.0007339094,0.0004230844,0.00023903768,0.00059443957,0.00003511601,0.0003391386,0.0048534595,0.69857115,0.0001849888,0.29312462,0.00044595517,0.00045510003],"about_ca_topic_score_codex":0.000019385505,"about_ca_topic_score_gemma":0.000021426005,"teacher_disagreement_score":0.7363618,"about_ca_system_score_codex":0.00008299996,"about_ca_system_score_gemma":0.00008528854,"threshold_uncertainty_score":0.9993887},"labels":[],"label_agreement":null},{"id":"W2522852672","doi":"10.23638/dmtcs-20-1-4","title":"A Variation on Chip-Firing: the diffusion game","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Theoretical and Computational Physics","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Mount Allison University; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Variation (astronomy); Diffusion; Chip; Computer science; Telecommunications; Physics; Thermodynamics","score_opus":0.00820786253064712,"score_gpt":0.2452658126663422,"score_spread":0.23705795013569508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522852672","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.18512625,0.0000013323797,0.7856203,0.0007609893,0.00024191741,0.00018692887,0.0000061884457,0.00004932977,0.02800681],"genre_scores_gemma":[0.9865259,1.2934332e-7,0.012210878,0.0003426992,0.00086397654,0.000012963083,0.000003832395,0.000015393922,0.000024232233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817723,0.00006295782,0.00027668453,0.0004066643,0.0006759768,0.000400509],"domain_scores_gemma":[0.99860495,0.00043995795,0.00010432331,0.00052398833,0.00017711644,0.00014966696],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00059822307,0.00020752662,0.00017938294,0.000053144166,0.0005909293,0.0003168546,0.00085894077,0.000025066187,0.00043004716],"category_scores_gemma":[0.00003197201,0.000121092824,0.000106044776,0.00049031625,0.0031384444,0.00013607182,0.0003973249,0.00019620455,0.00035918786],"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.000010403011,0.00013900123,0.000021697695,0.0000041624367,0.000009490894,2.8486184e-7,0.0013758988,0.00008124351,0.00040153725,0.9920983,0.000019075535,0.005838932],"study_design_scores_gemma":[0.000119751894,0.00013496124,0.0006382739,0.000031556912,0.000011415377,0.0000010223026,0.00003330826,0.3287261,0.0007625175,0.6693756,0.00004099713,0.00012447481],"about_ca_topic_score_codex":0.0000025663232,"about_ca_topic_score_gemma":7.7724245e-8,"teacher_disagreement_score":0.80139965,"about_ca_system_score_codex":0.00001813031,"about_ca_system_score_gemma":0.000055586916,"threshold_uncertainty_score":0.9995744},"labels":[],"label_agreement":null},{"id":"W2524615825","doi":"10.46298/dmtcs.3603","title":"Quivers and the Euclidean algebra (Extended abstract)","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Algebraic structures and combinatorial models","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":"Wilfrid Laurier University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quiver; Mathematics; Moduli space; Representation theory; Indecomposable module; Type (biology); Pure mathematics; Algebra over a field; Combinatorics","score_opus":0.018327225709659778,"score_gpt":0.26710470049648377,"score_spread":0.248777474786824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2524615825","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.80790734,0.00007705021,0.17940103,0.0011650801,0.00067683344,0.0006740839,0.0000037740797,0.00019510766,0.009899726],"genre_scores_gemma":[0.9576139,0.00002528151,0.04189539,0.00024399746,0.00015179467,0.000013236459,5.806774e-7,0.000026237412,0.000029590565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731904,0.00007705946,0.0005125523,0.00052968436,0.0009935384,0.0005681408],"domain_scores_gemma":[0.9971037,0.0014491254,0.00019421078,0.0008415924,0.00015367252,0.00025773078],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015657528,0.00031022553,0.00047712305,0.00009134782,0.000979916,0.00022403103,0.0011591436,0.00008714435,0.00014022563],"category_scores_gemma":[0.00056259526,0.00017917895,0.00015331454,0.00041336584,0.00938004,0.00024169181,0.0006826283,0.000327159,0.000018823112],"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.000027666872,0.00004106539,0.000006781989,0.0000323189,0.000019380328,0.000011682701,0.0037070785,0.0000019273978,0.000031730582,0.99557036,0.00009430629,0.00045568356],"study_design_scores_gemma":[0.0008989189,0.000060758888,0.00015611966,0.00004414204,0.000038316273,0.00014940457,0.00018817931,0.0307313,0.00027815453,0.96718633,0.000016704109,0.0002516574],"about_ca_topic_score_codex":0.00000435507,"about_ca_topic_score_gemma":5.096503e-7,"teacher_disagreement_score":0.14970657,"about_ca_system_score_codex":0.000032124288,"about_ca_system_score_gemma":0.00008490757,"threshold_uncertainty_score":0.9933159},"labels":[],"label_agreement":null},{"id":"W2525265242","doi":"10.46298/dmtcs.6371","title":"Some results on counting roots of polynomials and the Sylvester resultant.","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Sylvester matrix; Diophantine equation; Polynomial; Modulo; Ring (chemistry); Computation; Reciprocal polynomial; Matrix polynomial; Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics; Polynomial matrix; Mathematical analysis; Algorithm","score_opus":0.015241295437855285,"score_gpt":0.24798357154008427,"score_spread":0.23274227610222897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525265242","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.08215239,0.00007655278,0.8929062,0.021736877,0.00034140237,0.00046330778,0.0000123966765,0.00013724699,0.00217365],"genre_scores_gemma":[0.9365892,0.000008670849,0.0613201,0.0018401928,0.00022233858,0.00000493934,8.511474e-7,0.00000921585,0.0000045069096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722815,0.0001439562,0.0007091336,0.0006639903,0.00083649263,0.0004182637],"domain_scores_gemma":[0.9971247,0.0015326106,0.00031205337,0.00065936515,0.00013171323,0.00023958588],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0023080383,0.00023209491,0.0004171646,0.00009403413,0.0003402058,0.00053315575,0.0019157615,0.000048105714,0.000002574356],"category_scores_gemma":[0.00081835623,0.00013928906,0.000095177296,0.0007320064,0.0029980075,0.00055841403,0.0012269992,0.0002122962,0.000019772131],"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.000077572746,0.000025726871,0.0000016596913,0.00003342943,0.000007916174,0.0000031025352,0.0032509884,0.00016327442,0.00084446295,0.99145204,0.00006107969,0.00407876],"study_design_scores_gemma":[0.0010321495,0.00019541846,0.00012980329,0.000096442745,0.000010028595,0.000009610721,0.00003443089,0.7312463,0.0030583276,0.26398763,0.000032318654,0.0001675466],"about_ca_topic_score_codex":0.0000031188326,"about_ca_topic_score_gemma":1.8307063e-7,"teacher_disagreement_score":0.8544368,"about_ca_system_score_codex":0.00001732655,"about_ca_system_score_gemma":0.00008693389,"threshold_uncertainty_score":0.99971527},"labels":[],"label_agreement":null},{"id":"W2525505959","doi":"10.46298/dmtcs.2744","title":"Refinements of the Littlewood-Richardson rule","year":2009,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","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":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Schur polynomial; Product (mathematics); Pure mathematics; Combinatorics; Macdonald polynomials; Geometry","score_opus":0.01616321636509368,"score_gpt":0.29127376795310267,"score_spread":0.275110551588009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525505959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07656301,0.0007382203,0.8681394,0.008745134,0.0065084915,0.002006699,0.00008569249,0.00022990021,0.036983468],"genre_scores_gemma":[0.5936781,0.000037874783,0.4048689,0.00031448025,0.00036690178,0.00001335121,0.000001576183,0.00006414451,0.0006546567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929353,0.00028254135,0.0018168045,0.0009117234,0.0026526474,0.0014009904],"domain_scores_gemma":[0.99349505,0.0012974245,0.0010855034,0.0029198956,0.0007517225,0.00045038233],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.003078073,0.0007562472,0.0011693272,0.0002122214,0.00067781506,0.00032413064,0.0039852764,0.00028932682,0.00041086995],"category_scores_gemma":[0.0023975573,0.0005395098,0.0005134271,0.0022295308,0.0064924923,0.00052655704,0.0015326163,0.00076446944,0.00012974025],"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.000012372382,0.0010622343,0.000009335941,0.00064093026,0.00003926885,0.000006880929,0.0032931098,0.000049516137,0.0013661981,0.9868018,0.00035779882,0.0063605225],"study_design_scores_gemma":[0.0005812812,0.0004329969,0.000072008916,0.0017333423,0.00021402573,0.00005687719,0.00017994498,0.083696246,0.010978957,0.90122914,0.0002820931,0.00054308824],"about_ca_topic_score_codex":0.0000024938784,"about_ca_topic_score_gemma":5.41877e-7,"teacher_disagreement_score":0.5171151,"about_ca_system_score_codex":0.00025798482,"about_ca_system_score_gemma":0.00032480148,"threshold_uncertainty_score":0.9997057},"labels":[],"label_agreement":null},{"id":"W2529588972","doi":"10.46298/dmtcs.1343","title":"Most Complex Regular Ideal Languages","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quotient; Ideal (ethics); Alphabet; Class (philosophy); Regular language; Quotient algebra","score_opus":0.012728167214424515,"score_gpt":0.2622929057545596,"score_spread":0.24956473854013508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529588972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011966905,0.00003414031,0.97537327,0.0031909703,0.00026233497,0.00020875767,0.000010109613,0.00051045994,0.008443068],"genre_scores_gemma":[0.6609452,0.000005231167,0.33824608,0.0006261061,0.00010708523,0.000009018168,0.0000012362293,0.000016684919,0.00004338699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965027,0.00010981678,0.00049972144,0.00090795563,0.0010914521,0.00088838494],"domain_scores_gemma":[0.99677205,0.0006594546,0.00016095462,0.0017966776,0.00022110107,0.00038974697],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018376582,0.00033480205,0.00038474207,0.00016066806,0.00044687313,0.00065624557,0.0041976045,0.0000744667,0.00020370615],"category_scores_gemma":[0.00025692527,0.0001975963,0.00011269162,0.0011160502,0.003118792,0.0008972873,0.0018949609,0.0001337157,0.00030244773],"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.0000021942678,0.000054352233,0.00001623366,0.00001703557,0.0000078298945,0.00002417895,0.00047381196,0.0000029929624,0.010884319,0.9609605,0.00035942163,0.027197115],"study_design_scores_gemma":[0.000343012,0.00012898269,0.00033049178,0.00015220871,0.000008878539,0.00011113744,0.000059314152,0.29464623,0.0074527115,0.6959817,0.00034006996,0.00044527862],"about_ca_topic_score_codex":0.0000022684626,"about_ca_topic_score_gemma":4.0267813e-7,"teacher_disagreement_score":0.6489783,"about_ca_system_score_codex":0.00006179658,"about_ca_system_score_gemma":0.00011168773,"threshold_uncertainty_score":0.99959415},"labels":[],"label_agreement":null},{"id":"W2540058515","doi":"10.46298/dmtcs.3599","title":"Delannoy numbers and Legendre polytopes","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"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":"Mathematics; Polytope; Combinatorics; Legendre polynomials; Quadrant (abdomen); Triangulation; Humanities; Geometry; Mathematical analysis","score_opus":0.02331329170674692,"score_gpt":0.29165414769524034,"score_spread":0.26834085598849344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2540058515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2657631,0.000050232356,0.71647954,0.00032147852,0.00045937343,0.00050798117,0.000008595358,0.00034525877,0.016064448],"genre_scores_gemma":[0.59850365,0.000015163779,0.40115973,0.00008408487,0.00011079565,0.000014609727,8.7151443e-7,0.000041891646,0.00006921673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965261,0.000075263626,0.00071168627,0.00071595673,0.0011424293,0.0008285434],"domain_scores_gemma":[0.99685484,0.0011541403,0.00024411539,0.0010436615,0.0002464363,0.00045680927],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011060683,0.00044263186,0.0006401792,0.00018820257,0.0008176479,0.00018207694,0.0011353662,0.000118175725,0.000089735324],"category_scores_gemma":[0.00085801096,0.0003540624,0.00012526923,0.0007334656,0.0049155164,0.00048459176,0.0008995362,0.00033999825,0.000061840154],"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.0000074159952,0.0001357716,0.000036605557,0.000115343566,0.000016726597,0.00004015996,0.0031999548,0.0000036364079,0.00028402568,0.9956054,0.00014435222,0.00041058112],"study_design_scores_gemma":[0.0003942229,0.00014185887,0.000029333436,0.00012167826,0.000037119313,0.00056891,0.00022513731,0.031869642,0.0018049667,0.96424806,0.000090368994,0.000468674],"about_ca_topic_score_codex":0.0000019654924,"about_ca_topic_score_gemma":8.181737e-7,"teacher_disagreement_score":0.33274052,"about_ca_system_score_codex":0.00006779303,"about_ca_system_score_gemma":0.00011055831,"threshold_uncertainty_score":0.99989116},"labels":[],"label_agreement":null},{"id":"W2551475233","doi":"10.46298/dmtcs.2503","title":"Negative $q$-Stirling numbers","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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":"Toronto Metropolitan University","funders":"National Security Agency; Princeton University; Simons Foundation","keywords":"Mathematics; Stirling numbers of the first kind; Stirling number; Partially ordered set; Combinatorics; Binomial coefficient; Stirling numbers of the second kind; Binomial (polynomial); Bijection; Statistics","score_opus":0.03782610600975795,"score_gpt":0.3254781697518571,"score_spread":0.2876520637420992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551475233","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045360457,0.000012717279,0.9165928,0.00030696703,0.0011077552,0.00061876705,0.000006477695,0.00047308856,0.035520993],"genre_scores_gemma":[0.48692444,0.0000011256055,0.512701,0.00007723916,0.00018131686,0.000021728372,8.7790175e-7,0.000049758713,0.000042563755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952395,0.00012763012,0.0009059626,0.0007923243,0.0019131115,0.0010214477],"domain_scores_gemma":[0.9947134,0.0019923456,0.00038160465,0.0013624097,0.0007142924,0.0008359038],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0031277242,0.0005092324,0.0007316327,0.00022546778,0.00042071202,0.00039754898,0.0018478185,0.00013053742,0.00008890246],"category_scores_gemma":[0.0052704085,0.00041002143,0.00017415498,0.0012765494,0.003472276,0.00064818485,0.0010801234,0.0004425526,0.00021574505],"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.000013451645,0.00018715355,0.000007270606,0.00008645405,0.00001890103,0.000016419623,0.00601385,0.00005829444,0.00013241185,0.99284524,0.00025217922,0.0003684012],"study_design_scores_gemma":[0.0005827844,0.00017114534,0.0000018056023,0.00016808558,0.000045784174,0.00005721658,0.00092592294,0.13603565,0.0023121445,0.8591888,0.000044292537,0.00046636665],"about_ca_topic_score_codex":0.0000024455255,"about_ca_topic_score_gemma":9.932644e-7,"teacher_disagreement_score":0.441564,"about_ca_system_score_codex":0.00023322173,"about_ca_system_score_gemma":0.0002627587,"threshold_uncertainty_score":0.9998352},"labels":[],"label_agreement":null},{"id":"W2554218253","doi":"10.46298/dmtcs.2841","title":"Equivalence Relations of Permutations Generated by Constrained Transpositions","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":7,"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":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Fibonacci number; Permutation (music); Equivalence relation; Discrete mathematics","score_opus":0.016227557597542644,"score_gpt":0.29808619695502653,"score_spread":0.2818586393574839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2554218253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17527837,0.000007040285,0.8174952,0.00034826208,0.00039819544,0.0004806008,0.00010118301,0.00018222485,0.0057089035],"genre_scores_gemma":[0.5902485,0.0000013338365,0.40959892,0.000021519136,0.000040831357,0.000024414432,0.0000086983155,0.000027046557,0.000028717659],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968916,0.000074118056,0.0009802966,0.0005208397,0.0009616441,0.00057149207],"domain_scores_gemma":[0.9959204,0.0017621866,0.0003659066,0.0010146815,0.0006192114,0.00031757605],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011909283,0.00033732582,0.0005177897,0.00020824459,0.0005603318,0.00013829632,0.0011688834,0.0001450005,0.00045133996],"category_scores_gemma":[0.0013226497,0.00029177472,0.00016773478,0.0011706896,0.005270439,0.0004102349,0.00020506048,0.0005089145,0.000032362314],"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.0000037248474,0.0003066828,0.0000058099026,0.00008448878,0.000017089453,0.0000021405333,0.0015903846,0.000030374767,0.08229617,0.91541773,0.00009813341,0.0001472926],"study_design_scores_gemma":[0.00033953245,0.000105941595,0.0000065677145,0.00009606651,0.00007762995,0.000037475394,0.00013489873,0.12922464,0.021668356,0.84799993,0.000014293604,0.00029468536],"about_ca_topic_score_codex":0.0000010857237,"about_ca_topic_score_gemma":0.0000015966617,"teacher_disagreement_score":0.41497016,"about_ca_system_score_codex":0.000038997405,"about_ca_system_score_gemma":0.00019870885,"threshold_uncertainty_score":0.99995345},"labels":[],"label_agreement":null},{"id":"W2556487649","doi":"10.46298/dmtcs.2906","title":"Path tableaux and combinatorial interpretations of immanants for class functions on $S_n$","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":5,"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; Combinatorics; Monomial; Partition (number theory); Conjecture; Partition function (quantum field theory); Interpretation (philosophy); Symmetric function; Physics","score_opus":0.03076486646991696,"score_gpt":0.29767861347139485,"score_spread":0.2669137470014779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556487649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051738665,0.00000947542,0.9370927,0.00007532585,0.0012332285,0.00096983195,0.000043640208,0.0001269956,0.008710106],"genre_scores_gemma":[0.68112534,0.0000023311438,0.31865883,0.000029096149,0.000065305096,0.000062947634,0.0000019483437,0.00003740638,0.000016765789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972716,0.00006594623,0.00085444486,0.000565784,0.0006880507,0.0005541608],"domain_scores_gemma":[0.9959229,0.002056397,0.0004101911,0.00090282486,0.00045600385,0.0002516753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013417733,0.0003519318,0.0006329901,0.00023260151,0.00039567254,0.000095568284,0.0008454179,0.000113521484,0.000052660493],"category_scores_gemma":[0.0017117012,0.0002823187,0.0001550086,0.00054379157,0.0023446535,0.00029795367,0.00042760352,0.00022401402,0.000011559825],"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.000053418247,0.00045192853,0.000007371434,0.00033941277,0.00003171373,0.0000014935565,0.0035953042,0.0000031646764,0.0002858085,0.99467534,0.00007538178,0.00047968575],"study_design_scores_gemma":[0.0006886087,0.00076402293,0.000012697125,0.0003223398,0.00009362619,0.0000106339585,0.00037871214,0.08067214,0.0028530487,0.9138978,0.000017556173,0.00028878768],"about_ca_topic_score_codex":0.0000012630571,"about_ca_topic_score_gemma":4.9052204e-7,"teacher_disagreement_score":0.6293867,"about_ca_system_score_codex":0.000057618363,"about_ca_system_score_gemma":0.00009433957,"threshold_uncertainty_score":0.9999629},"labels":[],"label_agreement":null},{"id":"W2558084593","doi":"10.46298/dmtcs.2540","title":"Diameters and geodesic properties of generalizations of the associahedron","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Agence Nationale de la Recherche; York University; Ministerio de Ciencia e Innovación; Government of Canada","keywords":"Combinatorics; Polytope; Mathematics; Convex polytope; Geodesic; Graph; Uniform k 21 polytope; Regular polygon; Geometry; Convex set","score_opus":0.04544480959108728,"score_gpt":0.287961220983196,"score_spread":0.24251641139210872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558084593","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.56969947,0.000045687324,0.42831454,0.00019986035,0.00030359143,0.00044501657,0.0000059200697,0.000044180044,0.0009417436],"genre_scores_gemma":[0.7884279,0.0000027007823,0.21147941,0.000021077605,0.000025844613,0.0000096602935,1.9174696e-7,0.000020214598,0.00001303783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767196,0.000117074,0.00065162964,0.0002757479,0.00096563436,0.00031793822],"domain_scores_gemma":[0.9976981,0.00045103888,0.00044181253,0.00079459563,0.00045448446,0.00015993493],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0015271443,0.00020777521,0.00046614604,0.000095442796,0.00013345195,0.000060702812,0.0009475263,0.00006317578,0.0000052895525],"category_scores_gemma":[0.0023454302,0.00012685647,0.000096911055,0.0006625538,0.0038879323,0.00019910507,0.0007686886,0.00013043401,0.000001419827],"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.0000041042667,0.00011259012,0.000054708402,0.00022211752,0.000014736031,2.576058e-7,0.004850951,0.0000517038,0.003023406,0.9915322,0.00002090191,0.000112316455],"study_design_scores_gemma":[0.00024970146,0.000087823944,0.00001619399,0.0002644607,0.000054047912,0.000008535515,0.00032109686,0.074183434,0.02688666,0.89777625,0.0000036720796,0.00014815056],"about_ca_topic_score_codex":0.000002042914,"about_ca_topic_score_gemma":6.9121404e-7,"teacher_disagreement_score":0.21872841,"about_ca_system_score_codex":0.000052426585,"about_ca_system_score_gemma":0.00014227013,"threshold_uncertainty_score":0.9988229},"labels":[],"label_agreement":null},{"id":"W2580678407","doi":"10.46298/dmtcs.12794","title":"Cuts and Flows of Cell Complexes","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Topological and Geometric Data Analysis","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":"Toronto Metropolitan University","funders":"National Security Agency","keywords":"Mathematics; Pure mathematics; Flow (mathematics); Discriminant; Torsion (gastropod); Homology (biology); Combinatorics; Geometry","score_opus":0.01191059948671902,"score_gpt":0.23921361371173153,"score_spread":0.2273030142250125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2580678407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092200145,0.00004176034,0.9024031,0.0005626192,0.000077908764,0.00016267195,0.0000051249867,0.00006831991,0.0044783186],"genre_scores_gemma":[0.59220135,0.0000065853123,0.4076521,0.00010326989,0.000014201382,0.000004712793,8.387876e-7,0.000003072579,0.000013881508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978223,0.000052698255,0.000436136,0.00056540384,0.000674241,0.00044921422],"domain_scores_gemma":[0.99804324,0.00044850283,0.00014181051,0.0008766709,0.00020174484,0.00028803045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000747767,0.00019291445,0.00037857532,0.00028015408,0.00021556078,0.0004586579,0.002241248,0.00004727404,0.00019881756],"category_scores_gemma":[0.00012844922,0.00012693007,0.00008832274,0.0016852439,0.0022201277,0.00067970355,0.0018369094,0.000122056255,0.0000938508],"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":[4.6916307e-7,0.0000845382,0.00004205444,0.000029768225,0.0000057122415,0.0000017864684,0.00037197061,0.000014058002,0.0035368921,0.9905072,0.00006183469,0.005343759],"study_design_scores_gemma":[0.000097967575,0.00011303426,0.00051115564,0.000015838319,0.000009815045,0.000010314017,0.000033139448,0.5869595,0.0032469155,0.40881595,0.000029642704,0.00015676153],"about_ca_topic_score_codex":0.000012952436,"about_ca_topic_score_gemma":3.651622e-7,"teacher_disagreement_score":0.5869454,"about_ca_system_score_codex":0.000010157579,"about_ca_system_score_gemma":0.000029876584,"threshold_uncertainty_score":0.81801534},"labels":[],"label_agreement":null},{"id":"W2595222024","doi":"10.46298/dmtcs.2502","title":"On Schubert calculus in elliptic cohomology","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Cohomology; Equivariant cohomology; Schubert calculus; Pure mathematics; Formal group; Lie algebra; Algebra over a field; Number theory","score_opus":0.030761850069041162,"score_gpt":0.3189037736076154,"score_spread":0.28814192353857426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2595222024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19281797,0.00002156343,0.78080505,0.0004687723,0.0010826658,0.0007829746,0.0000043874606,0.00027818987,0.023738412],"genre_scores_gemma":[0.73694694,0.0000016418091,0.26264623,0.00017255847,0.00009976587,0.000037516544,0.0000012190934,0.0000531663,0.000040992636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954404,0.00018790689,0.00096585765,0.00082224084,0.0015166772,0.0010669102],"domain_scores_gemma":[0.99512887,0.002253947,0.00026566614,0.0014252283,0.00033436122,0.0005919243],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.003268851,0.00048508972,0.000814676,0.00041099158,0.00019088153,0.00019989026,0.0017020586,0.0001722246,0.000076392775],"category_scores_gemma":[0.0043334826,0.00038594473,0.00012797352,0.0012882171,0.002753069,0.00031703166,0.00076461624,0.00054979284,0.00028530933],"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.000027995888,0.00044855964,0.000012394526,0.000083615625,0.000009260469,0.000058241523,0.0020366656,0.00015729266,0.00007069577,0.99665356,0.00015329487,0.00028844905],"study_design_scores_gemma":[0.0007592714,0.00037915693,0.0000054042644,0.00020039472,0.000019610445,0.00006653438,0.00015387493,0.19351412,0.0007635096,0.80373627,0.000022177566,0.00037966704],"about_ca_topic_score_codex":0.0000022133158,"about_ca_topic_score_gemma":0.0000019813003,"teacher_disagreement_score":0.54412895,"about_ca_system_score_codex":0.00031941952,"about_ca_system_score_gemma":0.00022954002,"threshold_uncertainty_score":0.99996084},"labels":[],"label_agreement":null},{"id":"W2597000358","doi":"10.46298/dmtcs.2352","title":"Counting strings over $\\mathbb{Z}2^d$ with Given Elementary Symmetric Function Evaluations","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Quantum chaos and dynamical systems","field":"Physics and Astronomy","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; University of Victoria","keywords":"Combinatorics; Kernel (algebra); Mathematics; Homomorphism; Polynomial; Physics; Mathematical analysis","score_opus":0.008365295530547165,"score_gpt":0.24751693901446936,"score_spread":0.2391516434839222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597000358","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.35156962,0.00000469529,0.64071965,0.00012857316,0.000106518906,0.00037906805,0.00000809376,0.00004244717,0.0070412992],"genre_scores_gemma":[0.9724585,2.1624844e-7,0.027176708,0.000077655546,0.0001814997,0.000051376723,0.000013136032,0.000018166655,0.000022739843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782383,0.000041912164,0.00038927863,0.00042483478,0.00083083444,0.0004892777],"domain_scores_gemma":[0.9987847,0.00022291223,0.00016859257,0.000397555,0.00022436075,0.00020183041],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007228693,0.0002179874,0.00025083977,0.00013826539,0.00041552214,0.00052325096,0.00045712249,0.000027216429,0.0012610615],"category_scores_gemma":[0.000015278958,0.00014714053,0.00007934736,0.0008122024,0.000747031,0.00048729934,0.00023052181,0.0001648883,0.00016923998],"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.0000026888063,0.000084227424,0.0017297437,0.000023171666,0.000024597253,3.1485587e-7,0.00023266222,0.000112489644,0.00030731634,0.99403286,0.000060574897,0.0033893757],"study_design_scores_gemma":[0.0002564913,0.00014399207,0.0022472045,0.00008008293,0.000039297483,0.0000018324469,0.00023107149,0.7079872,0.00010277498,0.28866738,0.000031168143,0.00021148233],"about_ca_topic_score_codex":0.000074713585,"about_ca_topic_score_gemma":6.100794e-7,"teacher_disagreement_score":0.7078747,"about_ca_system_score_codex":0.0000422516,"about_ca_system_score_gemma":0.000054204924,"threshold_uncertainty_score":0.9996519},"labels":[],"label_agreement":null},{"id":"W2597540427","doi":"10.46298/dmtcs.2894","title":"The Murnaghan―Nakayama rule for k-Schur functions","year":2011,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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":"York University","funders":"Drexel University; National Science Foundation","keywords":"Mathematics; Schur's theorem; Noncommutative geometry; Schur algebra; Symmetric function; Schur polynomial; Affine transformation; Schur complement; Schur's lemma; Pure mathematics; Combinatorics; Algebra over a field; Macdonald polynomials; Eigenvalues and eigenvectors; Orthogonal polynomials; Physics","score_opus":0.032280275616043914,"score_gpt":0.2892858517904384,"score_spread":0.2570055761743945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597540427","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003494518,0.000548905,0.95657533,0.0016894438,0.008354377,0.002141289,0.00008568164,0.0002966895,0.026813788],"genre_scores_gemma":[0.11540394,0.000091769645,0.8791811,0.00019095832,0.0011171408,0.00035097272,0.000005706933,0.00021922695,0.003439197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99289465,0.00024022882,0.0018095328,0.0011759648,0.0016303608,0.0022492479],"domain_scores_gemma":[0.98842996,0.0059437607,0.0008334338,0.0027924522,0.0012114234,0.00078898354],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0055671693,0.00091628195,0.0010095672,0.0002253418,0.0031462503,0.0009954688,0.0037560628,0.00034425294,0.00049319677],"category_scores_gemma":[0.0038302129,0.0006645397,0.0006184224,0.0013973069,0.011353257,0.00082790817,0.0015672621,0.0007896657,0.0005608667],"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.000049786715,0.0007318038,0.0000032302962,0.00062069413,0.000107239306,0.000010576852,0.0061555277,0.000011966482,0.00011439827,0.9830625,0.0012052266,0.007927024],"study_design_scores_gemma":[0.0006623102,0.0005235776,0.0000062084355,0.0005244212,0.00031309895,0.00010262992,0.0010130549,0.17595749,0.0015405107,0.8156974,0.0029518944,0.0007074545],"about_ca_topic_score_codex":0.0000042850475,"about_ca_topic_score_gemma":0.000003879038,"teacher_disagreement_score":0.17594552,"about_ca_system_score_codex":0.00028611196,"about_ca_system_score_gemma":0.0004047574,"threshold_uncertainty_score":0.99958056},"labels":[],"label_agreement":null},{"id":"W2597829530","doi":"10.46298/dmtcs.2339","title":"Arc-Coloured Permutations","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Capilano University; Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.01986828211828589,"score_gpt":0.30219582162685704,"score_spread":0.28232753950857115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597829530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09300134,0.000014331594,0.8884558,0.00080949493,0.00059557514,0.0011188523,0.0000060518196,0.00045536968,0.015543187],"genre_scores_gemma":[0.59288144,0.0000028482661,0.4066595,0.000113502545,0.000117612915,0.000105183055,0.0000016315491,0.000048159454,0.0000700819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99592125,0.00009917079,0.00090395,0.0007190927,0.0013603336,0.0009961908],"domain_scores_gemma":[0.9953353,0.0018202063,0.00031562048,0.0014013516,0.00062642084,0.0005011367],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012512503,0.00046030173,0.00062005845,0.00025772827,0.0006666044,0.0005896849,0.0017665286,0.00012414748,0.0008757633],"category_scores_gemma":[0.001970748,0.00036194487,0.0001941266,0.0011093916,0.0030846144,0.00074774853,0.0007903399,0.00038799483,0.0006685281],"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.0000022223608,0.0002357568,0.000005972487,0.00010703869,0.0000169204,0.000005105294,0.002066413,0.000011497233,0.0011594001,0.99536437,0.00048942474,0.00053586415],"study_design_scores_gemma":[0.00030448366,0.00011977724,0.000026274127,0.0001078835,0.00003898199,0.00004482515,0.00029183703,0.13875294,0.0014889324,0.8583785,0.000036445632,0.00040909424],"about_ca_topic_score_codex":0.0000021516707,"about_ca_topic_score_gemma":4.6501785e-7,"teacher_disagreement_score":0.4998801,"about_ca_system_score_codex":0.00012301323,"about_ca_system_score_gemma":0.00013085456,"threshold_uncertainty_score":0.99988323},"labels":[],"label_agreement":null},{"id":"W2597958425","doi":"10.46298/dmtcs.3050","title":"Generating trees for partitions and permutations with no k-nestings","year":2012,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","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":"Capilano University; Simon Fraser University","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Mathematics; Permutation (music); Partition (number theory); Tree (set theory); Enumeration; Discrete mathematics; Physics","score_opus":0.024344442012921814,"score_gpt":0.30068656223153517,"score_spread":0.2763421202186134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597958425","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05436382,0.0003414601,0.93887043,0.0010870057,0.0012684438,0.0012742698,0.00006709042,0.00016729996,0.0025601971],"genre_scores_gemma":[0.35491198,0.000011977095,0.6438288,0.00010448019,0.00069678435,0.0001429037,0.0000057699644,0.00007734933,0.0002199016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958869,0.00011782367,0.0009250532,0.0006711378,0.0008990696,0.0014999734],"domain_scores_gemma":[0.99322563,0.0037656173,0.00058609695,0.00086278655,0.00080841256,0.00075146713],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.002285945,0.00060543546,0.00074508385,0.00017412411,0.0013897938,0.0006336303,0.0006945451,0.0001694994,0.00012655089],"category_scores_gemma":[0.0031398013,0.00049193634,0.00014564853,0.00075190695,0.0056007025,0.0011654804,0.00051430834,0.0003581209,0.00007601565],"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.000011619545,0.00050912035,0.000029714789,0.0009518906,0.00004427961,0.000002798168,0.0077487687,0.0002190208,0.000587253,0.9884277,0.00013733562,0.0013304711],"study_design_scores_gemma":[0.00047322072,0.00036064186,0.00000907497,0.0007068912,0.00025634328,0.00015072752,0.0004979049,0.37843522,0.0005670053,0.61778796,0.0002548578,0.00050016464],"about_ca_topic_score_codex":0.0000017948671,"about_ca_topic_score_gemma":0.0000020048833,"teacher_disagreement_score":0.3782162,"about_ca_system_score_codex":0.00012999128,"about_ca_system_score_gemma":0.0001731921,"threshold_uncertainty_score":0.99991024},"labels":[],"label_agreement":null},{"id":"W2598459039","doi":"10.46298/dmtcs.2527","title":"A categorification of the chromatic symmetric polynomial","year":2015,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"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":"Simons Foundation","keywords":"Mathematics; Combinatorics; Khovanov homology; Symmetric function; Chromatic polynomial; Categorification; Homology (biology); Chromatic scale; Graph; Pure mathematics; Chemistry","score_opus":0.02843274781170447,"score_gpt":0.2912701560805996,"score_spread":0.2628374082688951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598459039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08113166,0.0008574797,0.88301635,0.003434701,0.009672316,0.0022462774,0.000051219016,0.0001961592,0.019393839],"genre_scores_gemma":[0.734008,0.000014204903,0.2649912,0.00007079035,0.00044857262,0.000033215878,0.000001810065,0.0000853535,0.000346826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9926572,0.00043988586,0.0019553965,0.00084964506,0.0028837118,0.0012141693],"domain_scores_gemma":[0.991756,0.0020403438,0.001366074,0.0029096685,0.0012081835,0.000719724],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.004931399,0.00070214306,0.0011730281,0.00039937499,0.00048234488,0.0003379556,0.0038960774,0.0003116122,0.000109938446],"category_scores_gemma":[0.0064171883,0.00050737726,0.00041739794,0.004295605,0.009666067,0.00065430306,0.0019165134,0.00068191264,0.00019696115],"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.000014350211,0.0007606872,0.000013465629,0.0010347659,0.000049157356,0.000004689532,0.0065483763,0.00013407657,0.00048457296,0.9886032,0.00061431574,0.0017383649],"study_design_scores_gemma":[0.0006531716,0.00026832466,0.000017648195,0.00075667136,0.00024002387,0.00009659614,0.00056210853,0.2628508,0.0060154786,0.72792655,0.00017603637,0.00043659427],"about_ca_topic_score_codex":0.0000138725445,"about_ca_topic_score_gemma":0.0000015770696,"teacher_disagreement_score":0.6528764,"about_ca_system_score_codex":0.00055890554,"about_ca_system_score_gemma":0.0010303601,"threshold_uncertainty_score":0.9997378},"labels":[],"label_agreement":null},{"id":"W2598582088","doi":"10.46298/dmtcs.2719","title":"$m$-noncrossing partitions and $m$-clusters","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":4,"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 New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd","keywords":"Bijection, injection and surjection; Catalan number; Mathematics; Combinatorics; Bijection; Catalan; Integer (computer science); Cluster algebra; Generalization; Humanities; Physics","score_opus":0.018652209796805874,"score_gpt":0.2931584082203317,"score_spread":0.2745061984235258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598582088","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.42602456,0.000027005504,0.56586874,0.0010456559,0.00034112553,0.00027215862,0.0000025207694,0.00016792941,0.0062503],"genre_scores_gemma":[0.8477567,0.000002691574,0.1518115,0.0002881781,0.00011284416,0.0000041291974,5.817482e-7,0.000012379936,0.0000110435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998022,0.0000398074,0.00038338045,0.0004525305,0.00058529025,0.0005169975],"domain_scores_gemma":[0.9986103,0.00035627073,0.00010952269,0.00054053444,0.00010744814,0.00027590335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074240955,0.00023552508,0.00031580223,0.000097653836,0.0006589239,0.0005358019,0.000555149,0.00006960119,0.000058313504],"category_scores_gemma":[0.00023697522,0.00017870845,0.00008078936,0.000391654,0.002097818,0.0002849694,0.00026423566,0.00018590767,0.000007845144],"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.0000042056236,0.000043059066,0.000004263015,0.00002131627,0.0000048838806,0.00000344961,0.001354272,0.0000066265616,0.00015627359,0.99668,0.000048377588,0.0016732807],"study_design_scores_gemma":[0.00021875423,0.00013231131,0.00007229758,0.00008067281,0.000025731686,0.000041340096,0.00008574605,0.06742689,0.00043225687,0.93124133,0.00001399967,0.00022865928],"about_ca_topic_score_codex":5.7915594e-7,"about_ca_topic_score_gemma":1.8896058e-7,"teacher_disagreement_score":0.42173213,"about_ca_system_score_codex":0.00003324234,"about_ca_system_score_gemma":0.000051111718,"threshold_uncertainty_score":0.7729498},"labels":[],"label_agreement":null},{"id":"W2599056076","doi":"10.46298/dmtcs.2798","title":"Asymptotics of Decomposable Combinatorial Structures of Alg-Log Type With Positive Log Exponent","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Statistics Canada","funders":"","keywords":"Multiset; Mathematics; Combinatorics; Exponent; Type (biology); BETA (programming language); Function (biology); Discrete mathematics","score_opus":0.011019532128026708,"score_gpt":0.2825178286364755,"score_spread":0.2714982965084488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599056076","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.5939127,0.0000086919235,0.400103,0.0000733596,0.0015171804,0.0006899212,0.000022791699,0.000097209384,0.0035750957],"genre_scores_gemma":[0.5978037,0.0000015168422,0.40204552,0.000011973801,0.00008429338,0.0000055545293,0.0000025230977,0.000040396648,0.0000044789444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958656,0.00009492419,0.0011207709,0.00061056187,0.0016048979,0.0007032646],"domain_scores_gemma":[0.9941446,0.0020729916,0.0008255708,0.0014592573,0.0011845772,0.00031298152],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014088221,0.00049102446,0.0010490274,0.00024539803,0.00024117611,0.00010628897,0.0017391538,0.00019173576,0.000111582965],"category_scores_gemma":[0.0013261288,0.00035687548,0.00015586575,0.001043945,0.0051170224,0.00030127092,0.00075403764,0.000557102,0.000007882125],"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.00008094958,0.0004805818,0.00004895825,0.00030592765,0.00005428326,0.0000071661048,0.0017093418,0.000042516323,0.012222461,0.98487043,0.00001957115,0.00015783514],"study_design_scores_gemma":[0.0007994016,0.0008249869,0.000051023253,0.00022530211,0.00010954113,0.00005181268,0.00015082728,0.018023845,0.08779177,0.8915827,0.000004989639,0.00038375243],"about_ca_topic_score_codex":0.0000028098718,"about_ca_topic_score_gemma":0.0000016649531,"teacher_disagreement_score":0.09328766,"about_ca_system_score_codex":0.000051198687,"about_ca_system_score_gemma":0.00025863826,"threshold_uncertainty_score":0.9998883},"labels":[],"label_agreement":null},{"id":"W2599281378","doi":"10.46298/dmtcs.2364","title":"The Gaussian free field and strict plane partitions","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Pfaffian; Gaussian free field; Mathematical analysis; Laplace operator; Gaussian; Method of steepest descent; Measure (data warehouse); Gaussian measure; Combinatorics; Physics","score_opus":0.0180107109727221,"score_gpt":0.27984347886003574,"score_spread":0.26183276788731363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599281378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005172323,0.000031207415,0.9851924,0.0030652487,0.00017503089,0.00038011977,0.000014731919,0.00008259779,0.0058862986],"genre_scores_gemma":[0.70659506,0.000013272836,0.29296955,0.00024251551,0.000076646036,0.000053843574,8.98978e-7,0.000015857813,0.000032374275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980484,0.00004650848,0.00040506912,0.0003535498,0.0005925005,0.00055395236],"domain_scores_gemma":[0.9933869,0.0053184745,0.0001016081,0.0007359854,0.00015724346,0.00029975295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094793603,0.00020263852,0.00024140929,0.000051717878,0.0008243043,0.00064004806,0.0009826171,0.00006046989,0.000222204],"category_scores_gemma":[0.0037083395,0.0001173522,0.00004787502,0.00033360533,0.0014962528,0.00017185113,0.0006216159,0.0002230239,0.000056407807],"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.0000033573276,0.000036592548,0.0000016401206,0.000046896166,0.000007709042,0.000002416429,0.00031196428,5.4755236e-7,0.000041838965,0.9950243,0.0010826928,0.0034400253],"study_design_scores_gemma":[0.000120409364,0.00015572694,0.000021828253,0.000056125176,0.000021938948,0.000028202754,0.00014182921,0.1808556,0.00021982992,0.8181947,0.000036553636,0.00014727244],"about_ca_topic_score_codex":0.0000036738995,"about_ca_topic_score_gemma":0.0000024566905,"teacher_disagreement_score":0.7014227,"about_ca_system_score_codex":0.000015971877,"about_ca_system_score_gemma":0.00004539843,"threshold_uncertainty_score":0.63399655},"labels":[],"label_agreement":null},{"id":"W2599487098","doi":"10.46298/dmtcs.2336","title":"Gale-Robinson Sequences and Brane Tilings","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":15,"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":"National Science Foundation","keywords":"Mathematics; Cluster (spacecraft); Cluster algebra; Combinatorics; Brane; Principal (computer security); Mathematical physics; Statistical physics; Physics; Computer science","score_opus":0.015198092366820097,"score_gpt":0.2694502442087206,"score_spread":0.25425215184190053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599487098","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.8053413,0.000050198552,0.18532713,0.0006478126,0.0003907804,0.0005425497,0.0000021052983,0.0001755907,0.0075225015],"genre_scores_gemma":[0.8715031,0.000009026686,0.12812561,0.00016173595,0.00011637695,0.000021463886,5.8281773e-7,0.000023008759,0.000039060393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997596,0.000050618775,0.0004561485,0.0005646844,0.00075223896,0.0005803009],"domain_scores_gemma":[0.99811834,0.00061523187,0.00014544006,0.0006067607,0.00019852238,0.00031569376],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00074340036,0.00029778868,0.00040837776,0.00010728728,0.00038387347,0.0005658773,0.00087479275,0.00009523629,0.00036770655],"category_scores_gemma":[0.00029996576,0.00020952121,0.00008463187,0.0003886381,0.0028392735,0.00043355496,0.0005452738,0.00022358734,0.000038339374],"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.0000023096768,0.000032992204,0.0000130378,0.00007866016,0.000008767718,0.0000021662663,0.0011197937,0.0000021660926,0.0007300193,0.996841,0.00011006946,0.001058985],"study_design_scores_gemma":[0.00018865863,0.00010483856,0.000046043522,0.00009475674,0.000021370268,0.000044217446,0.00012796318,0.08402664,0.0011884274,0.91387117,0.000017051367,0.00026884122],"about_ca_topic_score_codex":0.000009222316,"about_ca_topic_score_gemma":4.4615112e-7,"teacher_disagreement_score":0.084024474,"about_ca_system_score_codex":0.000030704537,"about_ca_system_score_gemma":0.00006868861,"threshold_uncertainty_score":0.9998744},"labels":[],"label_agreement":null},{"id":"W2600390700","doi":"10.46298/dmtcs.3087","title":"Computing Tutte Polynomials","year":2012,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Markov Chains and Monte Carlo Methods","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":"Simon Fraser University","funders":"","keywords":"Humanities; Tutte polynomial; Combinatorics; Maple; Mathematics; Graph; Art; Botany; Line graph","score_opus":0.03727354755222738,"score_gpt":0.33609643840926046,"score_spread":0.29882289085703306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600390700","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043995988,0.001678356,0.901667,0.0021187332,0.0059595783,0.00076864543,0.00003947715,0.00021097895,0.043561246],"genre_scores_gemma":[0.43702924,0.000032829626,0.55999887,0.00046316275,0.0017622163,0.000008291532,0.0000027954052,0.0000794158,0.00062317995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99229604,0.00068852614,0.0015290324,0.0009583892,0.0016346582,0.002893327],"domain_scores_gemma":[0.99238366,0.0033564991,0.00058090594,0.0017937098,0.00040936045,0.0014758817],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.013851817,0.0008493578,0.001255648,0.00032963726,0.0009883578,0.0007904447,0.0020446123,0.00034911733,0.00059294916],"category_scores_gemma":[0.0018958728,0.0007317603,0.0004995377,0.0012863663,0.0077484255,0.00091322354,0.002248302,0.0007935885,0.000041442672],"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.00001004848,0.00055551203,0.00007504384,0.00071790075,0.000057974936,0.000013570801,0.009388312,0.00001836568,0.0007934242,0.9649237,0.0010988475,0.02234731],"study_design_scores_gemma":[0.000795051,0.00031435952,0.00005932731,0.0016744814,0.00042257708,0.00045188717,0.0011672643,0.67142,0.006247325,0.31018135,0.005551883,0.0017145269],"about_ca_topic_score_codex":0.000009605249,"about_ca_topic_score_gemma":9.799295e-7,"teacher_disagreement_score":0.6714016,"about_ca_system_score_codex":0.0002660606,"about_ca_system_score_gemma":0.00023241415,"threshold_uncertainty_score":0.9995133},"labels":[],"label_agreement":null},{"id":"W2601059909","doi":"10.46298/dmtcs.2797","title":"The distribution of the number of small cuts in a random planar triangulation","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","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":"Statistics Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Triangulation; Mathematics; Planar; Distribution (mathematics); Variance (accounting); Point set triangulation; Geometry; Mathematical analysis; Delaunay triangulation; Computer science","score_opus":0.009718011929313474,"score_gpt":0.2556642338228638,"score_spread":0.2459462218935503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601059909","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.26614118,0.0000057813113,0.7321897,0.00054384273,0.00034845024,0.00021507553,0.000003877407,0.000012685683,0.00053937867],"genre_scores_gemma":[0.9179173,0.000001687876,0.08199263,0.000025859728,0.00003994163,0.0000075800062,0.0000027670055,0.000003314983,0.000008933383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825937,0.00011307199,0.0005132708,0.00026113397,0.0006164286,0.00023673894],"domain_scores_gemma":[0.9979083,0.0008864509,0.00024271099,0.0006653584,0.00023677743,0.000060395083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002363573,0.000115796596,0.00018716854,0.00005790144,0.00026856692,0.00014387834,0.0015766321,0.000048030983,0.000006233322],"category_scores_gemma":[0.00047842573,0.00006482095,0.00009669195,0.0012515464,0.0012818282,0.000205856,0.00034446045,0.00018824355,0.0000036434974],"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.00001043971,0.000050090843,0.00020030812,0.000012887916,0.0000030861063,3.0570513e-7,0.0005323129,0.0007129137,0.0016357993,0.9929841,0.000008673694,0.0038490763],"study_design_scores_gemma":[0.00033354052,0.000019448184,0.0041610138,0.000030948144,0.0000046575024,0.000012723017,0.000011737304,0.6599062,0.0046086395,0.33080947,0.00003207802,0.00006950214],"about_ca_topic_score_codex":0.000004027605,"about_ca_topic_score_gemma":0.0000074020654,"teacher_disagreement_score":0.66217464,"about_ca_system_score_codex":0.000017165683,"about_ca_system_score_gemma":0.00015543035,"threshold_uncertainty_score":0.47229493},"labels":[],"label_agreement":null},{"id":"W2601196922","doi":"10.46298/dmtcs.2478","title":"Factoring peak polynomials","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Toronto Metropolitan University","funders":"University of Washington; National Science Foundation","keywords":"Pi; Combinatorics; Mathematics; Permutation (music); Integer (computer science); Binomial coefficient; Conjecture; Discrete mathematics; Physics; Geometry","score_opus":0.04977607377244855,"score_gpt":0.3295222375344969,"score_spread":0.27974616376204836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601196922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07218638,0.000025760597,0.9026164,0.00039066793,0.001596399,0.00062717905,0.000007991894,0.0005389859,0.022010252],"genre_scores_gemma":[0.585974,0.0000013821548,0.41352722,0.00006990311,0.00029770512,0.00002096662,0.0000010629359,0.000057617784,0.00005017775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951987,0.00010739903,0.0009751909,0.0007763368,0.0018743091,0.0010680497],"domain_scores_gemma":[0.9952538,0.001383041,0.00037399944,0.0015745237,0.0005416398,0.00087301846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003205778,0.0005157426,0.00078746316,0.00025700606,0.00038269008,0.00046219252,0.0020555514,0.00013474398,0.000092386195],"category_scores_gemma":[0.003611458,0.0004105875,0.00018391277,0.0009898305,0.0024049522,0.0006428773,0.0012650627,0.00038552727,0.00019613934],"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.000010275268,0.00018162267,0.000008602883,0.000091436996,0.000016011003,0.000013047176,0.0044544213,0.000021557073,0.00057075376,0.99393857,0.00020089943,0.0004928089],"study_design_scores_gemma":[0.0005442927,0.00019203541,0.0000049650776,0.00014982223,0.000044030025,0.000058597598,0.00041443872,0.05057108,0.0042208666,0.94307905,0.00020295917,0.00051784323],"about_ca_topic_score_codex":0.0000015787645,"about_ca_topic_score_gemma":3.496254e-7,"teacher_disagreement_score":0.51378757,"about_ca_system_score_codex":0.00024406807,"about_ca_system_score_gemma":0.0002540455,"threshold_uncertainty_score":0.9998346},"labels":[],"label_agreement":null},{"id":"W2601518043","doi":"10.46298/dmtcs.2808","title":"Enumeration of inscribed polyominos","year":2010,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Inscribed figure; Mathematics; Rectangle; Combinatorics; Enumeration; Geometry","score_opus":0.014745557560843288,"score_gpt":0.28907964793699514,"score_spread":0.27433409037615186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2601518043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13937427,0.00013061368,0.8391594,0.0013633836,0.007407243,0.0010957929,0.000057318866,0.00017334272,0.0112385815],"genre_scores_gemma":[0.52592367,0.000012167103,0.47329122,0.00005755095,0.00044519667,0.000018865512,0.000003137419,0.00006962029,0.00017857099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99359703,0.00018254865,0.0019524315,0.0009570243,0.0020223348,0.0012886059],"domain_scores_gemma":[0.9924679,0.0024797139,0.0010058227,0.002370129,0.0010356426,0.00064081355],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003624881,0.0007453261,0.0012348043,0.0003899114,0.00051931734,0.00041805796,0.0024958833,0.00044528508,0.0009999595],"category_scores_gemma":[0.0037659828,0.0006810874,0.0003714149,0.0015671786,0.01067402,0.0009164625,0.0012706656,0.001213794,0.00022014945],"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.000017056787,0.0009229126,0.000011380727,0.0010251114,0.00004474987,0.000012076836,0.0048174667,0.000018811304,0.026397293,0.9618092,0.00012232826,0.0048015905],"study_design_scores_gemma":[0.00053907477,0.00029720063,0.000011382012,0.0005215009,0.00015717736,0.00009297787,0.00018419886,0.20579088,0.037978448,0.75366783,0.00020755896,0.0005517904],"about_ca_topic_score_codex":0.000006800327,"about_ca_topic_score_gemma":0.0000048177176,"teacher_disagreement_score":0.38654938,"about_ca_system_score_codex":0.00010811405,"about_ca_system_score_gemma":0.00044570604,"threshold_uncertainty_score":0.9999133},"labels":[],"label_agreement":null},{"id":"W2602236496","doi":"10.46298/dmtcs.3055","title":"Cayley and Tutte polytopes","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Toronto Metropolitan University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; National Science Foundation","keywords":"Combinatorics; Mathematics; Polytope; Cayley graph; Bijection; Humanities; Graph; Art","score_opus":0.021211927073800364,"score_gpt":0.3019900796177031,"score_spread":0.2807781525439027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602236496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2041337,0.000104715014,0.7820768,0.0003443621,0.0008344112,0.00054534146,0.000006594243,0.00032118856,0.011632893],"genre_scores_gemma":[0.60258615,0.000005750162,0.39702007,0.00009052091,0.00021464632,0.00001601663,5.4811267e-7,0.00003789264,0.000028404893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99659806,0.000084693114,0.0006521067,0.0005115049,0.0010218428,0.0011317906],"domain_scores_gemma":[0.9965272,0.0013996557,0.00023517107,0.0010272623,0.00017808107,0.0006326062],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002368288,0.00041965002,0.00058171054,0.00018353885,0.00049266557,0.00027449537,0.0009714273,0.00010795474,0.00010855805],"category_scores_gemma":[0.0012811787,0.00032343046,0.00010554393,0.0006372555,0.0029954324,0.0007700085,0.0010692381,0.0003103033,0.00007592204],"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.0000046442324,0.00018776799,0.000065066146,0.0001469784,0.000013805309,0.0000028177171,0.002963712,9.818382e-7,0.0005897733,0.9949802,0.00006810671,0.0009761013],"study_design_scores_gemma":[0.00028181204,0.000090653346,0.000053250576,0.00013250603,0.000055676745,0.0001069124,0.00022252808,0.020919273,0.0032416848,0.9743499,0.000104376275,0.0004414121],"about_ca_topic_score_codex":9.115551e-7,"about_ca_topic_score_gemma":2.3578234e-7,"teacher_disagreement_score":0.39845243,"about_ca_system_score_codex":0.00006958302,"about_ca_system_score_gemma":0.00005243355,"threshold_uncertainty_score":0.9999218},"labels":[],"label_agreement":null},{"id":"W2602309351","doi":"10.46298/dmtcs.3052","title":"The down operator and expansions of near rectangular k-Schur functions","year":2012,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University","funders":"","keywords":"Mathematics; Affine transformation; Conjecture; Combinatorics; Operator (biology); Pure mathematics","score_opus":0.015557212808279777,"score_gpt":0.2819984001065467,"score_spread":0.26644118729826693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602309351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13230363,0.0047985194,0.8456212,0.0025001515,0.0059148776,0.0014721742,0.000074211566,0.00016828212,0.0071469345],"genre_scores_gemma":[0.56894207,0.00019084099,0.42982018,0.00007150758,0.00045535198,0.00004808396,0.0000019272554,0.00008510836,0.00038492092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947004,0.00033224726,0.0013818261,0.00060760207,0.0014425755,0.0015353758],"domain_scores_gemma":[0.99158275,0.004558516,0.00054923486,0.0018754388,0.00062336226,0.00081070594],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0048318505,0.0006094731,0.0008724081,0.0001300382,0.0020611202,0.00063833786,0.0014850391,0.00024380819,0.00018132236],"category_scores_gemma":[0.003225662,0.00042469063,0.0002433892,0.001296358,0.013707202,0.0008715321,0.0015981139,0.00064551365,0.00012874343],"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.000013105581,0.0005011005,0.000025646817,0.0004630762,0.00006424853,0.0000028322236,0.0075392625,0.000021621443,0.0007848705,0.98710227,0.0003170886,0.0031648937],"study_design_scores_gemma":[0.00043404504,0.0002983886,0.000024006958,0.0008338052,0.00029356946,0.00014074513,0.0016812448,0.12378298,0.0022764408,0.8676826,0.0019972052,0.0005549932],"about_ca_topic_score_codex":0.000004449392,"about_ca_topic_score_gemma":0.0000013626882,"teacher_disagreement_score":0.43663844,"about_ca_system_score_codex":0.00013244254,"about_ca_system_score_gemma":0.00026795437,"threshold_uncertainty_score":0.9998205},"labels":[],"label_agreement":null},{"id":"W2603634199","doi":"10.46298/dmtcs.2726","title":"Enumeration of alternating sign matrices of even size (quasi)-invariant under a quarter-turn rotation","year":2009,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Enumeration; Invariant (physics); Combinatorics; Sign (mathematics); Quarter (Canadian coin); Mathematical analysis; Mathematical physics; Geography","score_opus":0.015036996465266222,"score_gpt":0.2921706979592916,"score_spread":0.2771337014940254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603634199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09054795,0.00026657034,0.903397,0.0014701659,0.0010489562,0.0010451517,0.000035501573,0.00009404544,0.0020946572],"genre_scores_gemma":[0.5901849,0.000024587718,0.40946558,0.00005509571,0.0001898773,0.000009541394,0.0000024320022,0.000037069647,0.00003085236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9931666,0.00037489703,0.0025095623,0.00081468566,0.0021805272,0.0009536769],"domain_scores_gemma":[0.9905241,0.004608707,0.0021151716,0.0013716235,0.0010430465,0.00033734224],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035530175,0.00067129196,0.0013559683,0.00032741376,0.00032763867,0.0002963595,0.0017039808,0.00027740828,0.00019043733],"category_scores_gemma":[0.002706544,0.0006097062,0.0003496791,0.0015446412,0.002568498,0.0009789024,0.00038985323,0.00047996765,0.00003261754],"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.00003376684,0.0012973764,0.0000045115717,0.0012822219,0.000061145176,0.000008997393,0.009177629,0.00096442807,0.009213042,0.97373825,0.000029134857,0.004189501],"study_design_scores_gemma":[0.0005482574,0.000981279,0.000027170126,0.0014590279,0.00017591461,0.000036192843,0.00069576065,0.3427187,0.012077682,0.64089274,0.0000024874487,0.00038478462],"about_ca_topic_score_codex":0.000007795672,"about_ca_topic_score_gemma":0.0000011493096,"teacher_disagreement_score":0.499637,"about_ca_system_score_codex":0.00020263407,"about_ca_system_score_gemma":0.00030120698,"threshold_uncertainty_score":0.99963546},"labels":[],"label_agreement":null},{"id":"W2603743251","doi":"10.46298/dmtcs.2730","title":"Brauer-Schur functions","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Algebraic structures and combinatorial models","field":"Mathematics","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Schur algebra; Schur's theorem; Schur's lemma; Schur complement; Schur polynomial; Schur product theorem; Pure mathematics; Schur decomposition; Eigenvalues and eigenvectors; Macdonald polynomials","score_opus":0.017449121516691687,"score_gpt":0.28142609859823053,"score_spread":0.26397697708153883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603743251","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.16064538,0.000023711647,0.8137335,0.0010254189,0.00088622235,0.0003605736,0.000004003698,0.0003231374,0.022998035],"genre_scores_gemma":[0.8717782,0.0000017273766,0.12752046,0.00033482158,0.00026682988,0.0000070629394,0.0000013533007,0.000019592551,0.00006994555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99719924,0.000049162016,0.0005148877,0.00058227906,0.0009789158,0.00067550875],"domain_scores_gemma":[0.9979262,0.00041386118,0.00014758213,0.0009807382,0.00020201501,0.00032962285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008862185,0.0003160253,0.0004043312,0.00015043045,0.0005818851,0.00036547618,0.0011673837,0.000100842575,0.00030735135],"category_scores_gemma":[0.0003599792,0.00023505138,0.00017676379,0.00075351674,0.0013696726,0.0002915924,0.0002937824,0.0002880142,0.00007604514],"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.0000066916327,0.00010921968,0.000005246796,0.000017430499,0.0000095687765,0.000004100789,0.0005698468,0.000009790728,0.00018141359,0.996448,0.00023705002,0.0024016588],"study_design_scores_gemma":[0.00025095453,0.00021981884,0.000082956314,0.0000551353,0.00003875249,0.000027722795,0.0000697903,0.045059882,0.0005504699,0.95326746,0.00007059691,0.00030648956],"about_ca_topic_score_codex":8.9394916e-7,"about_ca_topic_score_gemma":3.1224224e-7,"teacher_disagreement_score":0.7111328,"about_ca_system_score_codex":0.000053126616,"about_ca_system_score_gemma":0.0000847085,"threshold_uncertainty_score":0.9585117},"labels":[],"label_agreement":null},{"id":"W2603952837","doi":"10.46298/dmtcs.2340","title":"Number of standard strong marked tableaux","year":2013,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Toronto Metropolitan University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; National Science Foundation","keywords":"Young tableau; Mathematics; Schur's lemma; Schur's theorem; Schur algebra; Combinatorics; Humanities; Art","score_opus":0.01454390602228617,"score_gpt":0.2964129269082251,"score_spread":0.28186902088593896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603952837","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046406012,0.00019165954,0.90357155,0.0012226417,0.0027737855,0.0017371302,0.00008241403,0.00019484233,0.04381996],"genre_scores_gemma":[0.39026707,0.00003201176,0.6085461,0.000058151836,0.00026943377,0.000056026114,0.000003100887,0.00011662227,0.00065146666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9915704,0.00031000198,0.0022895494,0.0011094017,0.002785824,0.0019347799],"domain_scores_gemma":[0.9908353,0.0030738749,0.0011034615,0.0024742663,0.0016626957,0.0008503917],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0033192115,0.0009497829,0.0017786503,0.00025533885,0.00051307614,0.000700221,0.0028922078,0.00037073108,0.00731321],"category_scores_gemma":[0.002275635,0.00083515793,0.00044248006,0.0017668768,0.010805764,0.0014054872,0.0020415452,0.0008100623,0.0011017075],"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.000021904436,0.0006176726,0.0000338064,0.0019395794,0.00009278713,0.000012122631,0.0025865661,0.00005039343,0.00044101672,0.98882174,0.000844119,0.0045383116],"study_design_scores_gemma":[0.000693109,0.0002884547,0.0000110018,0.0013821498,0.00017799539,0.000094521805,0.0005868713,0.21802928,0.0030471862,0.77480227,0.00019033274,0.000696823],"about_ca_topic_score_codex":0.000016183047,"about_ca_topic_score_gemma":8.786784e-7,"teacher_disagreement_score":0.34386107,"about_ca_system_score_codex":0.00035087878,"about_ca_system_score_gemma":0.0004577664,"threshold_uncertainty_score":0.99967605},"labels":[],"label_agreement":null},{"id":"W2604916992","doi":"10.46298/dmtcs.2092","title":"Complexity of conditional colouring with given template","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","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; Statistics Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Template; Vertex (graph theory); Graph; Induced subgraph; Time complexity; Discrete mathematics; Computer science","score_opus":0.027875562355967724,"score_gpt":0.29527200499150835,"score_spread":0.26739644263554063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604916992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026299879,0.000004512777,0.96703064,0.00055764714,0.00007370169,0.00025476632,0.000007699473,0.00012356372,0.0056475652],"genre_scores_gemma":[0.572357,4.6087362e-7,0.42753935,0.00005901551,0.000021498567,0.000007643869,0.0000014745821,0.0000086483615,0.000004909323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99671966,0.00015925705,0.00043388098,0.0006660558,0.0013616377,0.0006595278],"domain_scores_gemma":[0.99714917,0.0007840519,0.00020814994,0.0011444351,0.00040618383,0.00030801338],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002229682,0.00024184595,0.00040121208,0.00026343353,0.000438545,0.0002554833,0.0030028042,0.00004557735,0.000054642023],"category_scores_gemma":[0.00018065705,0.00017682146,0.00007288663,0.0011715374,0.009589703,0.0006545273,0.0012211138,0.00025110826,0.000033731703],"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.000012288173,0.00007918767,0.000044415,0.00005318071,0.000011088398,0.000005000886,0.00050306984,0.00043063896,0.0012022608,0.9968635,0.000009040737,0.00078634603],"study_design_scores_gemma":[0.00020988323,0.00029959666,0.00023588674,0.00006084272,0.0000039588945,0.00003897631,0.00001423935,0.40957227,0.0046887505,0.5847021,0.000018032986,0.0001554682],"about_ca_topic_score_codex":0.0000011926502,"about_ca_topic_score_gemma":7.044069e-7,"teacher_disagreement_score":0.5460571,"about_ca_system_score_codex":0.00003671526,"about_ca_system_score_gemma":0.00010400051,"threshold_uncertainty_score":0.99310565},"labels":[],"label_agreement":null},{"id":"W2612312215","doi":"10.46298/dmtcs.2385","title":"Quasisymmetric Schur functions and modules of the $0$-Hecke algebra","year":2014,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Hecke algebra; Indecomposable module; Schur algebra; Combinatorics; Pure mathematics; Algebra over a field; Orthogonal polynomials","score_opus":0.014756096302496854,"score_gpt":0.26413437219997926,"score_spread":0.2493782758974824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612312215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07657146,0.0004189908,0.9072695,0.0020057396,0.0028960349,0.0008294455,0.000034833327,0.000100436526,0.009873566],"genre_scores_gemma":[0.6763339,0.000034062785,0.32273632,0.00008744243,0.00026891998,0.000020067308,9.134306e-7,0.00006433652,0.00045403405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9944239,0.00041540727,0.001421693,0.0008955004,0.001781221,0.0010622776],"domain_scores_gemma":[0.9918601,0.0038835765,0.00082804036,0.002329489,0.000632829,0.0004659867],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0037579604,0.00065627904,0.0010740901,0.00036104515,0.0008880885,0.00038674078,0.002253334,0.00026762803,0.00016462822],"category_scores_gemma":[0.0052468376,0.0004694149,0.0003426745,0.002682289,0.011553314,0.0005131573,0.002259039,0.0006740683,0.000100523306],"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.0000068759664,0.00046672203,0.000029963772,0.0011325406,0.000048533653,0.0000012018797,0.0017191963,0.0000696914,0.00030491932,0.98754376,0.00015683542,0.008519755],"study_design_scores_gemma":[0.00038078972,0.00022499281,0.0000640046,0.0007769815,0.00021093404,0.00006055624,0.00027928854,0.30899736,0.0017006362,0.6867242,0.00020792604,0.00037233336],"about_ca_topic_score_codex":0.000004355987,"about_ca_topic_score_gemma":0.0000017197237,"teacher_disagreement_score":0.59976244,"about_ca_system_score_codex":0.00012418564,"about_ca_system_score_gemma":0.00013817739,"threshold_uncertainty_score":0.99977577},"labels":[],"label_agreement":null},{"id":"W2616191523","doi":"10.46298/dmtcs.2424","title":"A simple recurrence formula for the number of rooted maps on surfaces by edges and genus","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"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":"Agence Nationale de la Recherche","keywords":"Combinatorics; Bijection; Mathematics; Simple (philosophy); Genus; Bipartite graph; Interpretation (philosophy); Generating function; Philosophy","score_opus":0.020408002046493005,"score_gpt":0.31081022219212984,"score_spread":0.2904022201456368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616191523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09537054,0.000029799834,0.9017521,0.0002750872,0.00027898393,0.000828875,0.000047055702,0.000080221056,0.0013373063],"genre_scores_gemma":[0.77415985,0.000008758435,0.22560392,0.00006137044,0.00006355656,0.000047439295,0.0000027778008,0.000036173784,0.000016138338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997308,0.00009041397,0.00068412046,0.00052376505,0.0008149203,0.0005787691],"domain_scores_gemma":[0.99007845,0.0080254,0.00039115397,0.0010169802,0.0003070504,0.0001809585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024140503,0.00035153262,0.0005824317,0.000062509665,0.0004523652,0.00017944216,0.0012380668,0.00009325965,0.000022823531],"category_scores_gemma":[0.002878627,0.00022223764,0.0001222903,0.00042917466,0.0024827132,0.00018937049,0.00048058943,0.00021352936,0.000009255875],"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.000019308345,0.0001393591,0.000015157377,0.0002921493,0.00001774149,2.407621e-7,0.00093694107,0.000019215098,0.00026426182,0.9944664,0.0003715105,0.003457718],"study_design_scores_gemma":[0.00035952392,0.0001999611,0.000007871171,0.00015355529,0.000047543588,0.000009547667,0.00009411376,0.21447742,0.0044766106,0.7797269,0.00021802142,0.0002288875],"about_ca_topic_score_codex":0.0000011499466,"about_ca_topic_score_gemma":4.5809713e-7,"teacher_disagreement_score":0.6787893,"about_ca_system_score_codex":0.000032560045,"about_ca_system_score_gemma":0.000040257164,"threshold_uncertainty_score":0.914766},"labels":[],"label_agreement":null},{"id":"W2625544043","doi":"10.46298/dmtcs.2429","title":"A product formula for the TASEP on a ring","year":2014,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Bayesian Methods and Mixture Models","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":"Toronto Metropolitan University","funders":"Vetenskapsrådet","keywords":"Mathematics; Combinatorics; Conjecture; Permutation (music); Order (exchange); Product (mathematics); Ring (chemistry); Geometry; Physics","score_opus":0.027018339656616354,"score_gpt":0.29958761489255353,"score_spread":0.27256927523593716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625544043","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022485112,0.0004065538,0.9672396,0.018827073,0.002884056,0.0013091728,0.000016482121,0.00012570927,0.008966503],"genre_scores_gemma":[0.21129149,0.000018269693,0.7855946,0.001741333,0.0009195594,0.00008275462,0.0000010928785,0.00003847417,0.00031242744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99482924,0.00032955548,0.0007238693,0.001429978,0.001208822,0.0014785569],"domain_scores_gemma":[0.99258655,0.0036949497,0.000277337,0.0025429612,0.0004293206,0.00046885214],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.009394513,0.0005648665,0.00059792475,0.00017087224,0.0014726283,0.0018738052,0.004355552,0.00012370695,0.0000411226],"category_scores_gemma":[0.001307157,0.00035638802,0.00035881117,0.0011294755,0.0047351304,0.0006845501,0.0013659797,0.00052653736,0.00008744209],"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.000010736637,0.00013045463,4.5006948e-7,0.00016652515,0.000018615558,0.000002541814,0.002260938,0.00018476944,0.000104496874,0.7930097,0.00032135253,0.20378943],"study_design_scores_gemma":[0.0002183094,0.00032074263,0.0000065879244,0.00024949873,0.000041533138,0.000042422704,0.000008814356,0.52092355,0.0011317016,0.4740181,0.0027626168,0.00027614334],"about_ca_topic_score_codex":0.0000044894696,"about_ca_topic_score_gemma":0.0000011547709,"teacher_disagreement_score":0.5207388,"about_ca_system_score_codex":0.00007851642,"about_ca_system_score_gemma":0.00020626141,"threshold_uncertainty_score":0.99988884},"labels":[],"label_agreement":null},{"id":"W2642860650","doi":"10.46298/dmtcs.3017","title":"Combinatorial Hopf algebra of supercharacters of type D","year":2012,"lang":"es","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hopf algebra; Mathematics; Type (biology); Unipotent; Humanities; Pure mathematics; Combinatorics; Algebra over a field; Philosophy","score_opus":0.03343970624677227,"score_gpt":0.3187556100263758,"score_spread":0.28531590377960353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2642860650","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.91791,0.0001490719,0.06990848,0.00018621921,0.0019308566,0.000887114,0.00008233018,0.000071960305,0.008873987],"genre_scores_gemma":[0.93400925,0.00003321568,0.06547549,0.000030373203,0.00034385498,0.000007933006,0.000006953615,0.00007940273,0.0000135067085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932019,0.00049869984,0.0015922682,0.0006073196,0.0025709395,0.0015288327],"domain_scores_gemma":[0.9920929,0.003710807,0.00061409606,0.0018684128,0.00103719,0.0006766047],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.008211376,0.00056498154,0.0013246682,0.00054799684,0.00025833238,0.00021263429,0.0027003968,0.00028006005,0.0007153188],"category_scores_gemma":[0.002713595,0.000463288,0.00034752957,0.0020264974,0.011632805,0.00070015265,0.0019757312,0.00063351984,0.00017224524],"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.00010957428,0.0012267418,0.0005907435,0.0017768505,0.00009125901,0.0000033470144,0.00762962,0.0000019791305,0.009517336,0.9784883,0.000041268035,0.00052297476],"study_design_scores_gemma":[0.0008362357,0.0010248388,0.00046013255,0.0011042679,0.00022149467,0.00003685067,0.0005681524,0.04375879,0.03163341,0.91966563,0.000047279846,0.00064292765],"about_ca_topic_score_codex":0.0000036348563,"about_ca_topic_score_gemma":6.593647e-8,"teacher_disagreement_score":0.058822688,"about_ca_system_score_codex":0.000101261125,"about_ca_system_score_gemma":0.0003101105,"threshold_uncertainty_score":0.9997819},"labels":[],"label_agreement":null},{"id":"W2726469502","doi":"10.46298/dmtcs.3410","title":"Infinite limits and folding","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Gene Regulatory Network Analysis","field":"Biochemistry, Genetics and Molecular Biology","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":"Statistics Canada; Dalhousie University; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Induced subgraph isomorphism problem; Isomorphism (crystallography); Combinatorics; Homomorphism; Vertex (graph theory); Induced subgraph; Discrete mathematics; Subgraph isomorphism problem; Graph isomorphism; Graph; Line graph; Voltage graph","score_opus":0.009301348971610265,"score_gpt":0.2479846557950595,"score_spread":0.23868330682344924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2726469502","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.7039127,0.00015785095,0.29320914,0.000383118,0.000052642754,0.00009728066,0.0000016491754,0.0000218428,0.002163804],"genre_scores_gemma":[0.8824815,0.000028917755,0.116989024,0.00022690618,0.00022653364,0.000003968135,0.0000032377873,0.000013297858,0.000026606687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986325,0.000032880005,0.00023370924,0.00044365946,0.0002992319,0.00035802808],"domain_scores_gemma":[0.9991249,0.000039363655,0.00006628599,0.00048624448,0.00008539004,0.0001978375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006713489,0.00016562708,0.0001717654,0.0000761283,0.0002192876,0.00014686114,0.00043981534,0.00006447669,0.000026183965],"category_scores_gemma":[0.000075283344,0.00013628021,0.000072772666,0.0002721602,0.0013144948,0.000012488732,0.00042006545,0.00007346001,0.000013682281],"study_design_candidate":"simulation_or_modeling","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.000014341203,0.00009805736,0.00055364985,0.000045479726,0.000067269386,0.0000030947826,0.00070194056,0.001283336,0.15295704,0.8253902,0.00026742744,0.018618144],"study_design_scores_gemma":[0.00047147018,0.0003170546,0.00082994363,0.00007822592,0.000096617354,0.000099741206,0.000092006936,0.8662817,0.0899379,0.03801646,0.0030515927,0.00072732475],"about_ca_topic_score_codex":1.9414286e-7,"about_ca_topic_score_gemma":0.0000010426644,"teacher_disagreement_score":0.86499834,"about_ca_system_score_codex":0.000010135468,"about_ca_system_score_gemma":0.00003492984,"threshold_uncertainty_score":0.5557346},"labels":[],"label_agreement":null},{"id":"W2727783766","doi":"10.46298/dmtcs.2874","title":"A preorder-free construction of the Kazhdan-Lusztig representations of Hecke algebras $H_n(q)$ of symmetric groups","year":2010,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Algebraic structures and combinatorial models","field":"Mathematics","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Ring (chemistry); Polynomial ring; Hecke algebra; Combinatorics; Polynomial; Quantum; Algebra over a field; Quantum group; Pure mathematics; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.01195767815291523,"score_gpt":0.2684178252998392,"score_spread":0.256460147146924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727783766","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.7485385,0.00016801128,0.23910277,0.0009709791,0.004663666,0.00093913684,0.00008345983,0.000034928642,0.005498572],"genre_scores_gemma":[0.7780962,0.000014669737,0.22162092,0.000020837884,0.00015282618,0.000011030472,0.000001320482,0.00003231572,0.00004990288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99500763,0.00023567307,0.0017238476,0.00063284585,0.0017770863,0.0006229344],"domain_scores_gemma":[0.99264836,0.0019428325,0.0014125631,0.0027754751,0.0009858682,0.00023487823],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00187899,0.0004289257,0.00096295844,0.00032503146,0.00033954653,0.00011216463,0.0031719746,0.00029206584,0.00039967496],"category_scores_gemma":[0.0032535198,0.00031200264,0.0004894885,0.002676501,0.015500825,0.00032831595,0.0018691204,0.0006782031,0.000005587898],"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.000018692957,0.00036555267,0.00019886949,0.0009164095,0.0000809585,0.0000010089171,0.0029548437,0.000037104513,0.0027325987,0.99140567,0.00006308711,0.0012251851],"study_design_scores_gemma":[0.00060803187,0.0002204998,0.00034037782,0.00049599656,0.00026444267,0.00007587362,0.00046069658,0.058559697,0.029049994,0.90964264,0.000010179521,0.0002715669],"about_ca_topic_score_codex":0.000037653364,"about_ca_topic_score_gemma":0.000006203445,"teacher_disagreement_score":0.081763044,"about_ca_system_score_codex":0.000042108008,"about_ca_system_score_gemma":0.0003831374,"threshold_uncertainty_score":0.9999332},"labels":[],"label_agreement":null},{"id":"W2731914969","doi":"10.46298/dmtcs.2806","title":"Constant term evaluation for summation of C-finite sequences","year":2010,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":1,"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; Combinatorics; Term (time); Constant (computer programming); Physics; Quantum mechanics","score_opus":0.054875320138476506,"score_gpt":0.37176155154766916,"score_spread":0.31688623140919264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2731914969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094719134,0.00010386671,0.88744843,0.0014476391,0.0014934802,0.0021528034,0.00014046094,0.000059203474,0.012434985],"genre_scores_gemma":[0.66516465,0.000011240654,0.33426544,0.0000343619,0.00023234972,0.0000655472,0.000012114225,0.00003923906,0.0001750599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99376684,0.0003469856,0.001412805,0.0008242258,0.0025835868,0.0010655717],"domain_scores_gemma":[0.9892052,0.006070817,0.0006751879,0.0013972636,0.0022222209,0.0004293064],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.017005667,0.0004545516,0.00082230335,0.00036401677,0.0005122195,0.00045119552,0.0018446969,0.00027137878,0.0018284435],"category_scores_gemma":[0.005969622,0.0003825412,0.00031729488,0.0010700021,0.014954321,0.0006186083,0.00059459906,0.0005949945,0.00007502452],"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.000032211403,0.0003448399,0.00004381219,0.001143768,0.000063264204,0.0000029238752,0.0034108507,0.00006374672,0.008008716,0.9753473,0.00007091049,0.011467704],"study_design_scores_gemma":[0.0003761383,0.00017495893,0.000008842356,0.00036408033,0.00017908736,0.00002471738,0.00026108374,0.4774009,0.006090026,0.5148562,0.00003452343,0.00022940646],"about_ca_topic_score_codex":0.0000054360057,"about_ca_topic_score_gemma":0.000009341721,"teacher_disagreement_score":0.57044554,"about_ca_system_score_codex":0.00013391559,"about_ca_system_score_gemma":0.00090137054,"threshold_uncertainty_score":0.9998627},"labels":[],"label_agreement":null},{"id":"W2732943595","doi":"10.46298/dmtcs.3062","title":"Hecke algebra and quantum chromatic symmetric functions","year":2012,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Symmetric function; Hecke algebra; Pure mathematics; Algebra over a field","score_opus":0.021336950943807668,"score_gpt":0.2855060151864406,"score_spread":0.2641690642426329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732943595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07353532,0.0030266878,0.9031225,0.001718656,0.0066969977,0.0013214502,0.0000500711,0.0003800902,0.0101482645],"genre_scores_gemma":[0.64231473,0.00009624536,0.35598493,0.0001280559,0.0008812862,0.000054127715,0.000004510925,0.00013624362,0.0003998785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99215066,0.00034597446,0.0017416524,0.0010627641,0.0020891342,0.0026097915],"domain_scores_gemma":[0.99089056,0.0042448575,0.0007238929,0.0020472733,0.0004898117,0.0016036272],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004176201,0.0010557073,0.0014221141,0.00069792505,0.0012455971,0.000844463,0.0016531153,0.00039814418,0.00065253966],"category_scores_gemma":[0.0035235705,0.0009359577,0.0003254826,0.0032070617,0.008822039,0.0018445485,0.002056172,0.0009301551,0.0009138504],"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.000008323926,0.0011630333,0.000040634754,0.0018601922,0.000087914384,0.000014742881,0.005175348,0.000008095899,0.0001818496,0.9874834,0.00037439246,0.0036021036],"study_design_scores_gemma":[0.00050380646,0.00031016907,0.00004554682,0.0008903985,0.0003891667,0.00054935785,0.0007157908,0.25993422,0.00037648226,0.735046,0.000392643,0.0008463685],"about_ca_topic_score_codex":0.0000046282144,"about_ca_topic_score_gemma":6.0723835e-7,"teacher_disagreement_score":0.5687794,"about_ca_system_score_codex":0.0003688064,"about_ca_system_score_gemma":0.00022496503,"threshold_uncertainty_score":0.99986404},"labels":[],"label_agreement":null},{"id":"W2736557199","doi":"10.46298/dmtcs.3437","title":"Chromatic Turán problems and a new upper bound for the Turán density of $\\mathcal{K}_4^-$","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Hypergraph; Graph; Upper and lower bounds; Chromatic scale; Integer (computer science); Discrete mathematics; Mathematical analysis","score_opus":0.02749814079494463,"score_gpt":0.28490334829153824,"score_spread":0.2574052074965936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736557199","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.33423606,0.00019255967,0.662132,0.0011506082,0.000227765,0.0010568452,0.000011533856,0.000080772894,0.0009118565],"genre_scores_gemma":[0.68710387,0.000013482553,0.31241515,0.00018848962,0.00018682671,0.000020127049,7.465071e-7,0.000027929551,0.00004335764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972075,0.000071364964,0.0007665519,0.0005379381,0.0007888843,0.00062772917],"domain_scores_gemma":[0.9953771,0.0027792614,0.0003061366,0.0010428947,0.00022093976,0.00027366236],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0023690555,0.0003656998,0.00059047074,0.0001315651,0.00083262095,0.00028229886,0.00126729,0.000117887656,0.000074607815],"category_scores_gemma":[0.0008369365,0.00020906622,0.00021941184,0.0004088802,0.0043850215,0.00025830802,0.00080226426,0.0002535646,0.000004494726],"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.000014784413,0.00007315301,0.00002577103,0.0003422151,0.000043645432,6.486187e-7,0.00842684,0.000021649006,0.0004602685,0.986791,0.00015147729,0.0036485216],"study_design_scores_gemma":[0.0003606337,0.00012915382,0.00013304967,0.00018056958,0.00010941274,0.00006263268,0.00015065276,0.1879961,0.0017555619,0.80874753,0.00013135225,0.00024335802],"about_ca_topic_score_codex":0.0000032284124,"about_ca_topic_score_gemma":0.00000430738,"teacher_disagreement_score":0.3528678,"about_ca_system_score_codex":0.000036244408,"about_ca_system_score_gemma":0.00009052409,"threshold_uncertainty_score":0.99832445},"labels":[],"label_agreement":null},{"id":"W2736876508","doi":"10.46298/dmtcs.3396","title":"The Windy Postman Problem on Series-Parallel Graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"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":"University of Waterloo; Universidad Autónoma Metropolitana","keywords":"Mathematics; Combinatorics; Eulerian path; Conjecture; Polyhedron; Graph; Discrete mathematics; Pure mathematics","score_opus":0.013783356894273988,"score_gpt":0.28233515400538395,"score_spread":0.26855179711110994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736876508","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00440365,0.00005268867,0.96502024,0.008666486,0.00025149496,0.00069053017,0.000003427779,0.0003507522,0.02056076],"genre_scores_gemma":[0.4665778,0.000020675932,0.53255725,0.0005338366,0.00009770105,0.0000467896,8.6405254e-7,0.000025857742,0.00013920272],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947194,0.00022174977,0.0006156672,0.0010720459,0.001955064,0.0014161081],"domain_scores_gemma":[0.9955021,0.0010466368,0.00017978014,0.0024488522,0.0003263518,0.00049625745],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0036474338,0.00042161148,0.00034555228,0.00028473386,0.0019223137,0.0015206806,0.0070498926,0.0000791923,0.000031180913],"category_scores_gemma":[0.00022713559,0.00025996054,0.00019244388,0.0019510793,0.005849677,0.0013623055,0.0020224163,0.0005773097,0.0003395493],"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.000022829641,0.00010640213,0.000005233152,0.000012809402,0.000011203717,0.000009358783,0.0009845562,0.00051043014,0.0002097744,0.9816616,0.00010587537,0.016359895],"study_design_scores_gemma":[0.00019708509,0.0003179365,0.000033851968,0.00004706056,0.0000039855645,0.000064784654,0.000038017846,0.27098364,0.0009466883,0.72621596,0.00085820217,0.00029279792],"about_ca_topic_score_codex":5.649608e-7,"about_ca_topic_score_gemma":0.0000020118546,"teacher_disagreement_score":0.46217415,"about_ca_system_score_codex":0.00008909971,"about_ca_system_score_gemma":0.00014863405,"threshold_uncertainty_score":0.9999853},"labels":[],"label_agreement":null},{"id":"W2739858278","doi":"10.46298/dmtcs.3526","title":"The Size of the rth Smallest Component in Decomposable Structures with a Restricted Pattern","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","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":"Carleton University; Statistics Canada","funders":"","keywords":"Mathematics; Combinatorics; Component (thermodynamics); Class (philosophy); Combinatorial analysis; Combinatorial method; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.0071796406325237245,"score_gpt":0.23238279958540722,"score_spread":0.2252031589528835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739858278","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.34770688,0.000028856146,0.6501309,0.00062947255,0.00020336831,0.00030500224,0.0000020734276,0.000051445626,0.0009419944],"genre_scores_gemma":[0.897865,0.000004018893,0.10190107,0.00017614852,0.000030507836,0.0000057733846,3.3088864e-7,0.000011846057,0.0000052945543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99679273,0.00013448054,0.00064900506,0.00053505634,0.0011211042,0.0007675981],"domain_scores_gemma":[0.99553126,0.0022533087,0.00029041874,0.0016023635,0.00015968295,0.00016299305],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024784063,0.00026997077,0.00031832443,0.0001099949,0.00055797945,0.0004388055,0.004750046,0.00005672602,0.000011677109],"category_scores_gemma":[0.00019348858,0.00012719893,0.000096423675,0.0016329541,0.003290879,0.0002191669,0.0015198598,0.00031725346,0.00000388891],"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.000013038689,0.00006705757,0.00060146104,0.000020703157,0.000008276393,0.000012025431,0.00123738,0.00015922457,0.000895539,0.99200964,0.000010089065,0.0049655726],"study_design_scores_gemma":[0.0005544173,0.00019638591,0.034159057,0.00024165282,0.000011533878,0.00009900291,0.0002590567,0.46049237,0.008194837,0.49541402,0.000028101322,0.00034956547],"about_ca_topic_score_codex":0.000018366509,"about_ca_topic_score_gemma":0.00003115037,"teacher_disagreement_score":0.55015814,"about_ca_system_score_codex":0.00005496335,"about_ca_system_score_gemma":0.00012939822,"threshold_uncertainty_score":0.9994216},"labels":[],"label_agreement":null},{"id":"W2740563568","doi":"10.46298/dmtcs.3597","title":"A generalization of $(q,t)$-Catalan and nabla operators","year":2008,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","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":"Fields Institute for Research in Mathematical Sciences; York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Nabla symbol; Mathematics; Schur algebra; Combinatorics; Operator (biology); Schur's lemma; Generalization; Commutative property; Pure mathematics; Orthogonal polynomials; Mathematical analysis; Classical orthogonal polynomials; Omega","score_opus":0.018628750444578148,"score_gpt":0.2777405158156227,"score_spread":0.2591117653710446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740563568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2437431,0.0006590173,0.7500885,0.0005154395,0.0013060416,0.00073605997,0.00003758257,0.000106963416,0.0028072784],"genre_scores_gemma":[0.5360384,0.00020541681,0.46318963,0.00006344915,0.00020397353,0.000015613528,0.0000039369984,0.00007006832,0.00020953489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951148,0.00019623761,0.0014185299,0.0008465246,0.0014629364,0.00096095464],"domain_scores_gemma":[0.99567646,0.0011271042,0.0006038989,0.0013468141,0.00069421146,0.0005515145],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0018176427,0.00062262884,0.001097488,0.00030892834,0.00067520456,0.0001907805,0.0012746708,0.00025456783,0.00018593705],"category_scores_gemma":[0.0013887841,0.0005565978,0.00018235281,0.0014197804,0.011994991,0.00071749714,0.0012320668,0.00039153063,0.00004802597],"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.000010205301,0.00046199735,0.00005032021,0.0011665254,0.000042617743,0.00003116692,0.0103239855,0.00008597858,0.0011039403,0.9858362,0.00012650354,0.0007605656],"study_design_scores_gemma":[0.0005090766,0.00030248295,0.000021128675,0.0006898237,0.00011319498,0.00037542527,0.00021913994,0.25956234,0.0069167176,0.73068553,0.000102231774,0.0005029067],"about_ca_topic_score_codex":0.000006353555,"about_ca_topic_score_gemma":8.384934e-7,"teacher_disagreement_score":0.29229528,"about_ca_system_score_codex":0.0001237638,"about_ca_system_score_gemma":0.00029994082,"threshold_uncertainty_score":0.99968857},"labels":[],"label_agreement":null},{"id":"W2741277981","doi":"10.46298/dmtcs.3605","title":"Quasisymmetric Schur functions","year":2008,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Schur's lemma; Schur algebra; Combinatorics; Schur's theorem; Schur polynomial; Symmetric function; Pure mathematics; Macdonald polynomials; Orthogonal polynomials; Jacobi polynomials; Classical orthogonal polynomials","score_opus":0.02841310466928626,"score_gpt":0.28941307631282365,"score_spread":0.2609999716435374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741277981","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02283625,0.0008194744,0.9319161,0.0018711594,0.006624497,0.0011273148,0.000059783906,0.0004573514,0.03428805],"genre_scores_gemma":[0.39547765,0.00015250915,0.5997924,0.00018778688,0.0009567516,0.000058518333,0.000005753618,0.00015289192,0.003215719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907873,0.0003217479,0.0019935744,0.0015541251,0.0030453173,0.0022979192],"domain_scores_gemma":[0.99018747,0.0038026606,0.00077230687,0.0029026393,0.0011230104,0.0012119081],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.003226527,0.0011099281,0.0015105882,0.00089986954,0.002274683,0.0005324106,0.0030262242,0.000450376,0.0016288438],"category_scores_gemma":[0.0043593114,0.0010217677,0.0005953725,0.005379252,0.014776381,0.0012659824,0.001917307,0.0012304059,0.0034469499],"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.000014826404,0.0014186637,0.000021250624,0.00069833826,0.00008360169,0.0001235839,0.0037158087,0.00009553774,0.00014432168,0.98851955,0.0021475218,0.00301697],"study_design_scores_gemma":[0.00071327854,0.0004681961,0.000020907948,0.0006356181,0.00022874433,0.00090878695,0.00037200146,0.21500488,0.0007891776,0.77850646,0.0013562979,0.0009956579],"about_ca_topic_score_codex":0.000005441256,"about_ca_topic_score_gemma":9.893195e-7,"teacher_disagreement_score":0.3726414,"about_ca_system_score_codex":0.0005108629,"about_ca_system_score_gemma":0.00056345685,"threshold_uncertainty_score":0.9992838},"labels":[],"label_agreement":null},{"id":"W2748666773","doi":"10.46298/dmtcs.2518","title":"Sign variation, the Grassmannian, and total positivity","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Linear subspace; Grassmannian; Sign (mathematics); Algebraic number; Pure mathematics; Mathematical analysis","score_opus":0.02706167935752997,"score_gpt":0.28974784394197023,"score_spread":0.2626861645844403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2748666773","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.20428999,0.0000137335,0.7866651,0.001937156,0.00011941481,0.00041520345,0.000008263713,0.00011715042,0.006434014],"genre_scores_gemma":[0.87697124,9.504305e-7,0.1227236,0.00015015992,0.00007871579,0.000029783843,0.0000010759786,0.000014961938,0.000029522877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981107,0.00015123829,0.00033759224,0.00040284765,0.0006163957,0.00038120977],"domain_scores_gemma":[0.99745834,0.0011477635,0.00012934039,0.0007395208,0.0002355679,0.0002894805],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003413578,0.00020585826,0.00023715106,0.000075880685,0.0006042777,0.00035876938,0.0007089447,0.00005494976,0.000024705365],"category_scores_gemma":[0.00060184737,0.00012796983,0.000066079985,0.0005971477,0.003037359,0.00025228696,0.00046937857,0.00019801821,0.0000313525],"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.0000045744987,0.00008650735,0.000013641038,0.000017316588,0.000009494342,0.0000014860691,0.0035417932,0.000007930147,0.00023931428,0.9954936,0.00014156234,0.0004427915],"study_design_scores_gemma":[0.00016277509,0.00007216796,0.00030851777,0.000025984706,0.000038171063,0.00007043426,0.00021778629,0.07941346,0.0003249292,0.9191666,0.000025460362,0.00017370727],"about_ca_topic_score_codex":0.000001729563,"about_ca_topic_score_gemma":6.102131e-7,"teacher_disagreement_score":0.6726812,"about_ca_system_score_codex":0.000025774138,"about_ca_system_score_gemma":0.00007065315,"threshold_uncertainty_score":0.9996758},"labels":[],"label_agreement":null},{"id":"W2755348373","doi":"10.46298/dmtcs.3550","title":"Hamming distance from irreducible polynomials over $\\mathbb {F}_2$","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","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":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Hamming distance; Polynomial; Degree (music); Conjecture; Irreducible polynomial; Discrete mathematics; Matrix polynomial; Mathematical analysis","score_opus":0.01240369567851942,"score_gpt":0.2623634053157415,"score_spread":0.24995970963722206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755348373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07296696,0.00008571483,0.91639066,0.0003243644,0.00092897034,0.0002450737,0.0000104248675,0.0003871629,0.008660654],"genre_scores_gemma":[0.6350238,0.000003068672,0.36445788,0.0002975459,0.00018147471,0.000005513297,0.0000018463792,0.000017569106,0.0000113344195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953763,0.000094535746,0.00080520066,0.0012623027,0.0012516923,0.0012099874],"domain_scores_gemma":[0.99575233,0.0012279077,0.00026631472,0.0020373564,0.00016434572,0.0005517563],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0043970477,0.00043584534,0.00049506756,0.00036939833,0.00078632316,0.0012329908,0.0043096663,0.000112473295,0.00014547676],"category_scores_gemma":[0.00021745077,0.00036225913,0.00026096983,0.0019544146,0.0027511958,0.0011113029,0.0016102826,0.00034372188,0.00011292612],"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.000013960373,0.000112513604,0.00007610175,0.000018208548,0.000015331654,0.000025659252,0.0024391348,0.0000121278745,0.0033151675,0.9805519,0.000054034757,0.013365835],"study_design_scores_gemma":[0.00029007666,0.00011479174,0.0005254775,0.00014963519,0.000018467983,0.000022256896,0.0000983235,0.17058754,0.011272817,0.81590813,0.00045443972,0.0005580299],"about_ca_topic_score_codex":0.000008817699,"about_ca_topic_score_gemma":0.000003205346,"teacher_disagreement_score":0.56205684,"about_ca_system_score_codex":0.000078132936,"about_ca_system_score_gemma":0.00010744964,"threshold_uncertainty_score":0.99996275},"labels":[],"label_agreement":null},{"id":"W2755434175","doi":"10.46298/dmtcs.2512","title":"Fan realizations of type $A$ subword complexes and multi-associahedra of rank 3","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"York University; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Combinatorics; Type (biology); Coxeter group; Rank (graph theory); Simplicial complex; Regular polygon; Mathematics; Geometry","score_opus":0.05282849603734631,"score_gpt":0.3403097483533654,"score_spread":0.2874812523160191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755434175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13015987,0.000039800045,0.8665563,0.000101367055,0.00029637275,0.00044267738,0.000018179726,0.00008811623,0.002297295],"genre_scores_gemma":[0.56603247,0.000005471466,0.43388945,0.00001034224,0.000023631103,0.000004108553,0.0000016879509,0.000022627572,0.000010220357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972064,0.000113048874,0.0009163957,0.0003870198,0.00096305803,0.0004140701],"domain_scores_gemma":[0.9960017,0.0012451787,0.00053498824,0.0008289518,0.0010798374,0.00030934942],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019527443,0.00027543146,0.00075053977,0.00018932146,0.0001454039,0.00007335421,0.00086817023,0.000099086355,0.000024381963],"category_scores_gemma":[0.0036099057,0.00022369288,0.000087426735,0.0009867238,0.0033831783,0.00026735393,0.0006596797,0.00016603553,0.0000049398573],"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.000013259218,0.00027998697,0.00007136113,0.000281334,0.00002108893,0.0000014852199,0.0042801485,0.00001936978,0.0011379756,0.99363005,0.00005217241,0.0002117392],"study_design_scores_gemma":[0.00059021625,0.0002161125,0.00002235923,0.00019836189,0.00005678152,0.000012935583,0.00040755208,0.15336747,0.0039899284,0.8409219,0.000008331947,0.00020809351],"about_ca_topic_score_codex":0.000003865203,"about_ca_topic_score_gemma":0.0000016820612,"teacher_disagreement_score":0.43587258,"about_ca_system_score_codex":0.00005148699,"about_ca_system_score_gemma":0.00016480092,"threshold_uncertainty_score":0.99932903},"labels":[],"label_agreement":null},{"id":"W2760877405","doi":"10.46298/dmtcs.2896","title":"Primitive orthogonal idempotents for R-trivial monoids","year":2011,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monoid; Mathematics; Equivalence (formal languages); Semigroup; Syntactic monoid; Combinatorics; Free monoid; Pure mathematics; Algebra over a field; Discrete mathematics","score_opus":0.04291743966476476,"score_gpt":0.28343176844877943,"score_spread":0.24051432878401469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760877405","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010638817,0.0002964347,0.9716911,0.0011775678,0.0032567238,0.0010907936,0.00005438717,0.00020367745,0.011590515],"genre_scores_gemma":[0.4423209,0.000018836368,0.55655324,0.0004955887,0.0003475939,0.00004928128,0.0000035268808,0.00003270671,0.0001783416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939662,0.00018157302,0.001024167,0.0016682525,0.0012733777,0.0018864088],"domain_scores_gemma":[0.9957165,0.00085441757,0.0004050376,0.0014236283,0.0007590388,0.00084135344],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0025208811,0.0006947786,0.0007678687,0.0002669279,0.0010073463,0.00071578694,0.0040931813,0.000251627,0.00027085506],"category_scores_gemma":[0.0005369348,0.00059045025,0.00043667716,0.0013665487,0.008487006,0.0018510915,0.0021676272,0.000506738,0.0002325787],"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.000032469165,0.00044583957,0.000028830902,0.0001413677,0.000034930894,0.000041678966,0.006568123,0.000042500444,0.00019409427,0.967082,0.00007704409,0.02531111],"study_design_scores_gemma":[0.00039808755,0.0005796483,0.000266885,0.00017923527,0.000048933816,0.00008153886,0.000070509304,0.4207968,0.0014380189,0.5754613,0.00017794094,0.0005010811],"about_ca_topic_score_codex":0.000003995303,"about_ca_topic_score_gemma":0.0000012178007,"teacher_disagreement_score":0.43168208,"about_ca_system_score_codex":0.0001254476,"about_ca_system_score_gemma":0.0004381946,"threshold_uncertainty_score":0.9996547},"labels":[],"label_agreement":null},{"id":"W2765746319","doi":"10.23638/dmtcs-20-1-20","title":"Permutation complexity of images of Sturmian words by marked morphisms","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Morphism; Permutation (music); Mathematics; Combinatorics; Pure mathematics; Art","score_opus":0.019732605636758344,"score_gpt":0.276199733789977,"score_spread":0.25646712815321865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765746319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06723645,0.000091706344,0.9278624,0.00044504539,0.00065874145,0.0004988219,0.00012668245,0.00016610074,0.0029140709],"genre_scores_gemma":[0.6187712,0.0000090851445,0.38104513,0.000060104674,0.000058426005,0.000011709704,0.000016328548,0.000019771469,0.0000082172755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99489933,0.00026057527,0.0012480839,0.0012254115,0.0016959729,0.00067065225],"domain_scores_gemma":[0.9949251,0.00053449476,0.0010287975,0.0025217638,0.0007122335,0.00027760997],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0033005867,0.00054850144,0.0010373527,0.000359844,0.0002333434,0.0004885957,0.0063467277,0.0002204088,0.000102322454],"category_scores_gemma":[0.00026280404,0.00044683655,0.00031366298,0.0009083296,0.013191651,0.00051406096,0.0062087155,0.00046870325,0.000017235321],"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.0000098353285,0.00023005372,0.000016991436,0.0004625878,0.000036959183,0.000003931372,0.0026972997,0.000054056134,0.0042111953,0.98929894,0.0002957728,0.0026823774],"study_design_scores_gemma":[0.0001400846,0.00013209604,0.00012775128,0.00037757735,0.000025311685,0.000010026333,0.00004678087,0.43974203,0.020154553,0.53893834,0.000003842726,0.00030162098],"about_ca_topic_score_codex":0.000011692008,"about_ca_topic_score_gemma":4.5034855e-7,"teacher_disagreement_score":0.5515348,"about_ca_system_score_codex":0.000071942486,"about_ca_system_score_gemma":0.00026075487,"threshold_uncertainty_score":0.99979836},"labels":[],"label_agreement":null},{"id":"W2766367798","doi":"10.23638/dmtcs-20-2-4","title":"Complexity of locally-injective homomorphisms to tournaments","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tournament; Homomorphism; Injective function; Mathematics; Neighbourhood (mathematics); Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.04145060192530764,"score_gpt":0.3299344338413944,"score_spread":0.2884838319160868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766367798","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021347769,0.000026608108,0.9701828,0.0006920331,0.0009751089,0.0012954943,0.00005735662,0.00022732267,0.005195502],"genre_scores_gemma":[0.49630365,0.0000036385204,0.50335085,0.00016495031,0.000098803335,0.000037721387,0.000002963189,0.000027920196,0.0000095192645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920354,0.00034268055,0.0011876205,0.0020608548,0.0029769528,0.0013965187],"domain_scores_gemma":[0.9921464,0.00064229063,0.0005857574,0.0040865,0.001607436,0.0009316429],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0041248645,0.0007278239,0.0011782513,0.0009077682,0.0005208816,0.0008672911,0.012525999,0.00023823745,0.00011270113],"category_scores_gemma":[0.0006428977,0.0006124375,0.0003587612,0.0022734483,0.015243999,0.00052386586,0.02172864,0.0010157967,0.00017141397],"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.000025291245,0.00023970785,0.000010480346,0.00018109025,0.000045037665,0.000019445099,0.0027312117,0.00049378106,0.00044753923,0.993356,0.000066474,0.0023839276],"study_design_scores_gemma":[0.00015986853,0.0004231294,0.00006731699,0.00045317571,0.000013923699,0.000022606751,0.00003597067,0.34249648,0.0063659544,0.6495081,0.000007829864,0.00044564012],"about_ca_topic_score_codex":0.000006616105,"about_ca_topic_score_gemma":0.0000014352962,"teacher_disagreement_score":0.4749559,"about_ca_system_score_codex":0.00025569185,"about_ca_system_score_gemma":0.0005629954,"threshold_uncertainty_score":0.9996327},"labels":[],"label_agreement":null},{"id":"W2795132552","doi":"10.23638/dmtcs-21-3-23","title":"On the multipacking number of grid graphs","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Thompson Rivers University","funders":"Agence Nationale de la Recherche; Thompson Rivers University","keywords":"Mathematics; Grid; Combinatorics; Computer science; Geometry","score_opus":0.017292022634676753,"score_gpt":0.30150910850861823,"score_spread":0.28421708587394146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795132552","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.18627949,0.000006478893,0.79796976,0.0005920867,0.00041530226,0.00046302224,0.0000039108604,0.000100621575,0.014169319],"genre_scores_gemma":[0.82702005,0.0000023501575,0.1726542,0.00025080022,0.00002424925,0.000012129806,4.3427096e-7,0.00001537985,0.000020423906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962489,0.00018581534,0.00046408334,0.0007347002,0.0016197189,0.00074676506],"domain_scores_gemma":[0.99461454,0.0025085304,0.00019318676,0.0021916216,0.00028898104,0.0002031228],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0030298997,0.00027071632,0.00035502118,0.00020697954,0.00034175877,0.00033823165,0.0050291717,0.000055714376,0.00023742893],"category_scores_gemma":[0.00039921212,0.00016178774,0.00018306488,0.0018714899,0.0033759044,0.0005377191,0.0016660484,0.0003912169,0.000423106],"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.0000074028303,0.00007851334,0.000121531295,0.000031397052,0.000009312275,0.0000031802153,0.001056036,0.00014512708,0.0009214232,0.9965286,0.000023059429,0.0010744195],"study_design_scores_gemma":[0.00013088583,0.000086643384,0.000067270325,0.00009078483,0.000002573482,0.000016539121,0.000047699366,0.3316335,0.0037920782,0.6639657,0.000010911392,0.00015543717],"about_ca_topic_score_codex":9.658532e-7,"about_ca_topic_score_gemma":1.1799797e-7,"teacher_disagreement_score":0.6407406,"about_ca_system_score_codex":0.0000326517,"about_ca_system_score_gemma":0.00007920165,"threshold_uncertainty_score":0.99933636},"labels":[],"label_agreement":null},{"id":"W2798587433","doi":"10.46298/dmtcs.2936","title":"Skew quantum Murnaghan-Nakayama rule","year":2011,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":3,"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; Skew; Symmetric function; Combinatorics; Mathematical proof; Pure mathematics; Algebra over a field; Physics; Geometry","score_opus":0.038444573241547195,"score_gpt":0.2973633402862285,"score_spread":0.2589187670446813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798587433","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016824974,0.0007362218,0.87216026,0.0008797958,0.002979793,0.0010578089,0.00006167856,0.0004786126,0.10482083],"genre_scores_gemma":[0.20020193,0.00013198997,0.79499763,0.0002521742,0.0005551404,0.00006520901,0.000004424954,0.00021173681,0.003579758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907272,0.00029346644,0.0021871724,0.0016134074,0.0025191745,0.002659611],"domain_scores_gemma":[0.9924305,0.0018373203,0.0007918482,0.0028337291,0.00080839713,0.0012982144],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.004124078,0.0012093205,0.0016165606,0.00050644006,0.0010770537,0.0009484791,0.0039052637,0.00043997637,0.0063114027],"category_scores_gemma":[0.002296678,0.0010610829,0.0006260129,0.0017167117,0.017759437,0.0017428104,0.002722419,0.0010903057,0.0029443237],"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.000021771932,0.0012478798,0.000008369907,0.0017205898,0.00009315599,0.0001437248,0.0129468655,0.000005676876,0.00025812475,0.9809898,0.0005426277,0.0020213749],"study_design_scores_gemma":[0.00045807788,0.00036416602,0.000022154934,0.0016045838,0.00029895312,0.00030118207,0.0008952279,0.17191665,0.003809657,0.8189762,0.00027150149,0.0010816309],"about_ca_topic_score_codex":0.000019035693,"about_ca_topic_score_gemma":0.0000038100222,"teacher_disagreement_score":0.18337695,"about_ca_system_score_codex":0.0003068599,"about_ca_system_score_gemma":0.00034730052,"threshold_uncertainty_score":0.99918395},"labels":[],"label_agreement":null},{"id":"W2808874216","doi":"10.46298/dmtcs.12797","title":"Double-dimers and the hexahedron recurrence","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Algebraic structures and combinatorial models","field":"Mathematics","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":"Toronto Metropolitan University","funders":"National Science Foundation","keywords":"Mathematics; Monomial; Hexahedron; Recurrence relation; Ising model; Cluster algebra; Pure mathematics; Combinatorics; Statistical physics; Physics","score_opus":0.017599921238278107,"score_gpt":0.2741595302144708,"score_spread":0.25655960897619273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808874216","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.4928759,0.00012605364,0.4873898,0.0033175824,0.0011681012,0.0017546437,0.0000019858069,0.00020746449,0.013158483],"genre_scores_gemma":[0.93952453,0.000009569497,0.06003864,0.0002000836,0.000117659285,0.00006037794,4.061368e-7,0.00002065559,0.000028060253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759316,0.00009031777,0.00045826662,0.00050221913,0.0008008924,0.0005551251],"domain_scores_gemma":[0.99741656,0.0011643932,0.00016332007,0.0008301834,0.00018632578,0.00023923455],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0014820092,0.0002841616,0.00040879927,0.000071552095,0.0005506841,0.0005972031,0.001197665,0.00007476368,0.0002272762],"category_scores_gemma":[0.00028984578,0.00015505531,0.000105402556,0.00042800992,0.0062783896,0.00033089268,0.0007879884,0.00028415336,0.000034268855],"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.00001815828,0.000023846185,0.000005321036,0.000039090875,0.000011491347,6.825602e-7,0.0019519307,0.000002991301,0.000018734883,0.99656564,0.00010488961,0.0012572054],"study_design_scores_gemma":[0.00092377426,0.000053476753,0.000018191733,0.00006230059,0.000028963914,0.000025429475,0.00015950506,0.10537329,0.00022626783,0.89290404,0.000013843867,0.00021092591],"about_ca_topic_score_codex":0.000012775268,"about_ca_topic_score_gemma":4.628453e-7,"teacher_disagreement_score":0.44664866,"about_ca_system_score_codex":0.000026739237,"about_ca_system_score_gemma":0.000051834035,"threshold_uncertainty_score":0.9964259},"labels":[],"label_agreement":null},{"id":"W2883406596","doi":"10.23638/dmtcs-21-3-1","title":"Binding Number, Toughness and General Matching Extendability in Graphs","year":2019,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Matching (statistics); Graph; Discrete mathematics","score_opus":0.02073836180585886,"score_gpt":0.3185557908663956,"score_spread":0.29781742906053676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883406596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32707936,0.000045319375,0.66953,0.0002817005,0.0006361287,0.000694911,0.000012924778,0.00015544638,0.001564248],"genre_scores_gemma":[0.5994388,0.000024990028,0.40034163,0.00006569359,0.00004313823,0.000038166145,0.0000035260118,0.00002864984,0.000015428086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99302334,0.0004334266,0.000981993,0.0024003792,0.001730188,0.001430663],"domain_scores_gemma":[0.9948632,0.0011227621,0.00032457197,0.0029546553,0.00026411656,0.0004706923],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0060575106,0.0006943059,0.0009885185,0.00068707665,0.000423714,0.0017523633,0.0060768053,0.0002786256,0.000037714595],"category_scores_gemma":[0.0002925294,0.00059077493,0.00022326027,0.0017331924,0.0042753113,0.0010065556,0.0146200545,0.0015938431,0.000064638014],"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.0000082629085,0.00010596841,0.00054621964,0.0003951439,0.000011250781,0.00003102079,0.0025370307,0.0012292028,0.00026546227,0.9913109,0.000003243009,0.0035563074],"study_design_scores_gemma":[0.00016500129,0.000029706714,0.00031720762,0.0003054541,0.0000053163412,0.00003902247,0.00004354684,0.41825536,0.00025095427,0.58016515,0.0000025318725,0.00042075655],"about_ca_topic_score_codex":0.000013517938,"about_ca_topic_score_gemma":0.0000025735983,"teacher_disagreement_score":0.41702613,"about_ca_system_score_codex":0.00018743786,"about_ca_system_score_gemma":0.00032417366,"threshold_uncertainty_score":0.99965435},"labels":[],"label_agreement":null},{"id":"W2898970722","doi":"10.23638/dmtcs-21-3-17","title":"Number of orbits of Discrete Interval Exchanges","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Mathematical Dynamics and Fractals","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":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interval (graph theory); Mathematics; Combinatorics","score_opus":0.019343280024340503,"score_gpt":0.30670093353431105,"score_spread":0.28735765350997056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898970722","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.502527,0.000010418979,0.46367306,0.00014325097,0.0002340677,0.0005150962,0.000033226002,0.00005800194,0.03280585],"genre_scores_gemma":[0.7416896,0.0000042335632,0.25810894,0.000028988057,0.00003442977,0.000008283156,0.0000021216072,0.000033675606,0.000089726294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963186,0.000087121494,0.001166336,0.00054602145,0.0012783874,0.00060354115],"domain_scores_gemma":[0.9960673,0.0014906442,0.0005743824,0.0012423709,0.0003842491,0.00024105284],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021501328,0.00036085027,0.0010306195,0.00017140662,0.00008540756,0.000088585984,0.0014727124,0.00012269721,0.0014671554],"category_scores_gemma":[0.0006403626,0.00025874283,0.00031111602,0.0006953385,0.0025723174,0.0002671629,0.0009698087,0.00024468565,0.000114890005],"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.000015458572,0.00024628872,0.00016581033,0.0011173687,0.00003531194,0.0000023278028,0.0017425962,0.0000045295155,0.001978539,0.99412835,0.000027008078,0.0005364416],"study_design_scores_gemma":[0.00026628928,0.0001727098,0.00006190189,0.0005744376,0.00004814106,0.000027004018,0.00018725121,0.20959118,0.0044113696,0.7843806,0.000009250358,0.0002698745],"about_ca_topic_score_codex":0.0000025608153,"about_ca_topic_score_gemma":7.4916215e-7,"teacher_disagreement_score":0.2391626,"about_ca_system_score_codex":0.000030877913,"about_ca_system_score_gemma":0.00006777082,"threshold_uncertainty_score":0.99998647},"labels":[],"label_agreement":null},{"id":"W2899644482","doi":"10.46298/dmtcs.12799","title":"Euler flag enumeration of Whitney stratified spaces","year":2013,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","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":"Toronto Metropolitan University","funders":"Defense Advanced Research Projects Agency; National Science Foundation","keywords":"Flag (linear algebra); Enumeration; Euler's formula; Mathematics; Computer science; Pure mathematics; Combinatorics; Algebra over a field; Mathematical analysis","score_opus":0.016806442284092227,"score_gpt":0.2789452452704025,"score_spread":0.26213880298631026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899644482","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.26638559,0.00028483683,0.6998229,0.0074753896,0.0023383778,0.0010417532,0.00002537235,0.000108429565,0.022517312],"genre_scores_gemma":[0.74793434,0.00002375126,0.2508756,0.00018570898,0.00025128646,0.000041673702,0.0000048384018,0.000036743386,0.0006460252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99536616,0.00040206287,0.0013282107,0.0008086313,0.0009902634,0.0011046841],"domain_scores_gemma":[0.99508816,0.0019919442,0.000557672,0.0013027545,0.00063259463,0.0004268809],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002190051,0.0005326651,0.0009383258,0.00024729624,0.0004336373,0.00044873208,0.0015884385,0.0004191582,0.0066199983],"category_scores_gemma":[0.0010360769,0.0004492712,0.00024204435,0.0008257347,0.013590306,0.00071814074,0.00069123955,0.00055981684,0.00078216806],"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.0000074809896,0.00043465928,0.000035055808,0.00048991974,0.00006640677,0.000010938282,0.0061658043,0.000022650067,0.002726144,0.9849902,0.0005710384,0.0044797515],"study_design_scores_gemma":[0.0003058234,0.0004145025,0.00007887008,0.00032313357,0.00011590934,0.000102744634,0.00056312344,0.17703469,0.009452698,0.8111287,0.000072992196,0.00040684134],"about_ca_topic_score_codex":0.00002877582,"about_ca_topic_score_gemma":0.0000061878427,"teacher_disagreement_score":0.4815488,"about_ca_system_score_codex":0.00006887689,"about_ca_system_score_gemma":0.0002881184,"threshold_uncertainty_score":0.9999958},"labels":[],"label_agreement":null},{"id":"W2921221051","doi":"10.46298/dmtcs.8383","title":"Token Swapping on Trees","year":2023,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"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":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Security token; Vertex (graph theory); Combinatorics; Swap (finance); Conjecture; Graph; Computer science; Mathematics; Approximation algorithm; Discrete mathematics; Computer network","score_opus":0.02295515797936839,"score_gpt":0.28151294631101326,"score_spread":0.2585577883316449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921221051","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.16039869,0.00009478662,0.8238065,0.0010324667,0.0016397393,0.001028096,0.000075387026,0.00021505667,0.011709259],"genre_scores_gemma":[0.8821378,0.000069230344,0.11623807,0.00024640156,0.00070411037,0.00007255786,0.000111583504,0.00009007817,0.00033018333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684656,0.00006892322,0.00044133986,0.0011545419,0.00083045405,0.00065819087],"domain_scores_gemma":[0.9978648,0.000077725796,0.00017712024,0.0014870052,0.00015746056,0.00023590433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012509644,0.00043631718,0.00039416092,0.00020152978,0.00023480147,0.00037707743,0.0018796974,0.00023892483,0.000053799155],"category_scores_gemma":[0.00019865792,0.00036509815,0.00022947202,0.000288836,0.00159226,0.0000053348904,0.0038395235,0.0003850668,0.00025564453],"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.00006248918,0.00051439414,0.0000941794,0.0008555146,0.00036206868,0.0000640165,0.0024372488,0.006333715,0.06533155,0.91370964,0.0028253547,0.007409806],"study_design_scores_gemma":[0.00074485753,0.001118724,0.00075674744,0.0011183592,0.00014680806,0.00003011349,0.0002463978,0.44353965,0.0357406,0.51322955,0.0011535566,0.0021746543],"about_ca_topic_score_codex":0.0000018295419,"about_ca_topic_score_gemma":0.0000013452254,"teacher_disagreement_score":0.7217391,"about_ca_system_score_codex":0.00004015547,"about_ca_system_score_gemma":0.00014006207,"threshold_uncertainty_score":0.9998801},"labels":[],"label_agreement":null},{"id":"W2922654736","doi":"10.23638/dmtcs-22-1-3","title":"A Characterization of Morphic Words with Polynomial Growth","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","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 Waterloo","funders":"","keywords":"Zigzag; Multilinear map; Word (group theory); Morphism; Mathematics; String (physics); Combinatorics; Characterization (materials science); Polynomial; Type (biology); Discrete mathematics; Pure mathematics; Physics","score_opus":0.012555062082393343,"score_gpt":0.23269367976107758,"score_spread":0.22013861767868423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922654736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09417795,0.000012162186,0.90174156,0.0015775779,0.00048743005,0.0005121058,0.000035530935,0.000304823,0.0011508361],"genre_scores_gemma":[0.6990397,0.0000071220193,0.30047163,0.00025399314,0.00015683551,0.000023145334,0.000014193023,0.000029462988,0.0000039293077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99556345,0.00013381224,0.0008229529,0.001362902,0.0014595329,0.00065734296],"domain_scores_gemma":[0.9965193,0.00024823647,0.0006738649,0.0018024753,0.00036943468,0.0003866796],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012524732,0.00056868786,0.0008766008,0.00032468585,0.0002251041,0.0008744391,0.0055742525,0.00018905524,0.000039960316],"category_scores_gemma":[0.000121450066,0.0004228303,0.00020355434,0.0012598477,0.0029627604,0.0005696684,0.0056557856,0.00063403806,0.00002388364],"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.000016537011,0.00010920591,0.000014264777,0.00034768382,0.0000323368,0.000021594627,0.0031783688,0.00003653988,0.010414018,0.98455757,0.000013288615,0.0012585977],"study_design_scores_gemma":[0.00021516,0.00022476091,0.00016384912,0.0005204567,0.000037091537,0.00003438002,0.00002213802,0.67508566,0.013938386,0.30926,0.000005564684,0.0004925622],"about_ca_topic_score_codex":0.0000041971034,"about_ca_topic_score_gemma":2.3383674e-7,"teacher_disagreement_score":0.67529756,"about_ca_system_score_codex":0.00005969045,"about_ca_system_score_gemma":0.00044835123,"threshold_uncertainty_score":0.9998224},"labels":[],"label_agreement":null},{"id":"W2938551310","doi":"10.46298/dmtcs.2686","title":"A bijection between noncrossing and nonnesting partitions of types A and B","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Toronto Metropolitan University","funders":"Centro de Matemática, Universidade de Coimbra; Universidade de Coimbra","keywords":"Bijection; Combinatorics; Mathematics; Binomial coefficient; Type (biology); Catalan number; Biology","score_opus":0.02629903949336873,"score_gpt":0.31898385772257154,"score_spread":0.2926848182292028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2938551310","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.4537583,0.000018590097,0.5445411,0.00015666694,0.00006100554,0.00020076394,0.0000033244667,0.000075287775,0.0011849795],"genre_scores_gemma":[0.6389402,0.0000025170868,0.3609736,0.000014616402,0.00005359324,0.0000027272042,3.5975614e-7,0.000010116586,0.0000022725546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828655,0.00004290676,0.00052256364,0.0003536805,0.00044476226,0.00034951448],"domain_scores_gemma":[0.99787754,0.0011461291,0.00024161875,0.00038812973,0.00017180789,0.00017478343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010811329,0.00020728086,0.00043212957,0.00014326886,0.00038399795,0.00018785972,0.00028738606,0.00006512745,0.000006763726],"category_scores_gemma":[0.0010255083,0.00016900046,0.00004634602,0.0005143377,0.0019640606,0.0002941323,0.00023824068,0.00016012111,0.000001830922],"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.0000029840162,0.000057644364,0.000068586094,0.00013418814,0.0000067446304,0.0000014793933,0.001887006,0.0000043758646,0.0012161313,0.9937433,0.000002456102,0.0028751204],"study_design_scores_gemma":[0.0002123565,0.00021470276,0.00024854095,0.00031174548,0.00005616861,0.000035761874,0.00011152817,0.050280195,0.0024628253,0.94587916,0.0000020130062,0.0001849935],"about_ca_topic_score_codex":6.315429e-7,"about_ca_topic_score_gemma":2.1873375e-7,"teacher_disagreement_score":0.18518193,"about_ca_system_score_codex":0.000023277507,"about_ca_system_score_gemma":0.000037869373,"threshold_uncertainty_score":0.72366637},"labels":[],"label_agreement":null},{"id":"W2940975645","doi":"10.46298/dmtcs.6340","title":"Parking functions, tree depth and factorizations of the full cycle into transpositions","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","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":"Saint Mary's University","funders":"","keywords":"Factorization; Bijection; Combinatorics; Sequence (biology); Mathematics; Set (abstract data type); Upper and lower bounds; Tree (set theory); Simple (philosophy); Discrete mathematics; Computer science; Algorithm; Biology","score_opus":0.008808573795939184,"score_gpt":0.20529652663098608,"score_spread":0.1964879528350469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940975645","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.19197874,0.000033180142,0.8050004,0.00024009234,0.00016079884,0.00014049433,0.000009548846,0.000088573455,0.002348153],"genre_scores_gemma":[0.98954666,0.0000030420915,0.010352867,0.000037205482,0.000038830643,0.00000720685,0.0000013746037,0.000011716591,0.0000010708344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912065,0.00003742328,0.00024976477,0.0001727909,0.0002447809,0.00017461099],"domain_scores_gemma":[0.999427,0.00012258526,0.00003504637,0.00024822517,0.00004060052,0.00012650107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021866267,0.00011872696,0.00015636034,0.000041827734,0.0002775555,0.00007871124,0.00039606434,0.000032811975,0.00001839881],"category_scores_gemma":[0.00003292503,0.000081916536,0.00006674726,0.0005777056,0.0010477953,0.00013254088,0.000083069666,0.0001132307,0.000004986249],"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.0000022474783,0.000014610861,0.000100923964,0.00012573625,0.000013037799,3.775256e-7,0.005827581,0.001958425,0.010602087,0.98026174,0.000008585398,0.0010846725],"study_design_scores_gemma":[0.00012758301,0.00006397057,0.0006512469,0.0001070993,0.000040824183,0.00000971505,0.0004344605,0.84436786,0.0049041254,0.14908755,0.000037863265,0.00016767747],"about_ca_topic_score_codex":5.87865e-7,"about_ca_topic_score_gemma":0.0000019607874,"teacher_disagreement_score":0.8424095,"about_ca_system_score_codex":0.000009316639,"about_ca_system_score_gemma":0.000013165055,"threshold_uncertainty_score":0.38606456},"labels":[],"label_agreement":null},{"id":"W2945681362","doi":"10.46298/dmtcs.503","title":"Asymptotics of Smallest Component Sizes in Decomposable Combinatorial Structures of Alg-Log Type","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Analytic Number Theory Research","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":"Statistics Canada","funders":"","keywords":"Combinatorics; Type (biology); Factorization; Mathematics; Component (thermodynamics); Generating function; Class (philosophy); Function (biology); Alpha (finance); Combinatorial method; Discrete mathematics; Physics; Algorithm; Computer science; Statistics","score_opus":0.022324471499581985,"score_gpt":0.3202114814258752,"score_spread":0.2978870099262932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945681362","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.92184097,0.000008928304,0.07121043,0.000103862956,0.0005935054,0.0004503937,0.000012357096,0.000039028924,0.005740547],"genre_scores_gemma":[0.8040422,0.0000024897513,0.19584294,0.000011164558,0.00006067085,0.0000033006718,0.0000025295067,0.00002574049,0.000008955018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99630785,0.00014578922,0.0010539008,0.00048380723,0.0013533524,0.00065530604],"domain_scores_gemma":[0.99540514,0.00230404,0.000365345,0.0011185866,0.00055592554,0.00025094306],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0033344864,0.00030404676,0.0008269673,0.0003229967,0.00013444124,0.00008960649,0.0019008813,0.00015095253,0.00040023943],"category_scores_gemma":[0.0016394547,0.00023727924,0.00014157656,0.0010430354,0.005548228,0.00013070957,0.00094343576,0.00056564383,0.0000117958825],"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.00005002976,0.0003418619,0.0005831636,0.00022874218,0.000024432233,0.000006386599,0.0010682964,0.000041534833,0.012268003,0.9852377,0.000028438633,0.00012141329],"study_design_scores_gemma":[0.0005668422,0.0002048162,0.0003081072,0.00010395839,0.000030268659,0.00001994601,0.0001438411,0.101992786,0.016275119,0.8801276,0.0000045606284,0.00022215088],"about_ca_topic_score_codex":0.000011013785,"about_ca_topic_score_gemma":0.000010005709,"teacher_disagreement_score":0.1246325,"about_ca_system_score_codex":0.00004058171,"about_ca_system_score_gemma":0.00022700906,"threshold_uncertainty_score":0.9971581},"labels":[],"label_agreement":null},{"id":"W2949488644","doi":"10.46298/dmtcs.3606","title":"Invariant and coinvariant spaces for the algebra of symmetric polynomials in non-commuting variables","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Invariant (physics); Mathematics; Algebra over a field; Pure mathematics; Mathematical physics","score_opus":0.026321810884568673,"score_gpt":0.2859250469567149,"score_spread":0.2596032360721462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949488644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1536488,0.00008447981,0.8430821,0.00039575552,0.00029530705,0.0012594416,0.000012422165,0.000054657346,0.0011670603],"genre_scores_gemma":[0.6236319,0.00002311199,0.37616605,0.000037149322,0.000061728715,0.000044135566,5.196813e-7,0.000029294924,0.000006085786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99679524,0.00010727703,0.0010974044,0.00052559935,0.0007736761,0.0007008217],"domain_scores_gemma":[0.9868118,0.01123535,0.0005216598,0.0010046047,0.00025394565,0.0001726399],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0043313457,0.00036656533,0.0008532906,0.0003443582,0.00057889306,0.00015335271,0.0013903368,0.00011350814,0.000016034028],"category_scores_gemma":[0.0043820874,0.00024312215,0.00012640975,0.0013838313,0.0033249028,0.0002916747,0.0008880234,0.00027883498,0.0000026416342],"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.000017910386,0.00018408948,0.00003438057,0.00032410744,0.00002468275,0.0000066111284,0.0041043134,0.000041613603,0.0008543398,0.99411285,0.000027327465,0.00026776647],"study_design_scores_gemma":[0.0005853788,0.00014213884,0.00006364154,0.0002518157,0.00004888329,0.000073666095,0.0003692902,0.26436046,0.0027113815,0.7311544,0.000005361891,0.00023357665],"about_ca_topic_score_codex":0.000009545764,"about_ca_topic_score_gemma":0.0000018952231,"teacher_disagreement_score":0.46998313,"about_ca_system_score_codex":0.00006250156,"about_ca_system_score_gemma":0.00015297873,"threshold_uncertainty_score":0.9993875},"labels":[],"label_agreement":null},{"id":"W2949805496","doi":"10.46298/dmtcs.2395","title":"Quasisymmetric (k,l)-hook Schur functions","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Toronto Metropolitan University","funders":"","keywords":"Hook; Mathematics; Generalization; Combinatorics; Schur's theorem; Schur's lemma; Cauchy distribution; Identity (music); Pure mathematics; Mathematical analysis","score_opus":0.019736219242553314,"score_gpt":0.2917916800896966,"score_spread":0.27205546084714327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949805496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0180504,0.000012655546,0.9429179,0.0003424948,0.0010888915,0.0005380268,0.000006004613,0.0004911225,0.036552545],"genre_scores_gemma":[0.5568508,0.0000019767801,0.44253287,0.00011404109,0.00027274355,0.00003609749,0.0000017038434,0.000056070807,0.00013371925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950313,0.00018004086,0.0010266952,0.00092715485,0.0017277088,0.0011070933],"domain_scores_gemma":[0.993374,0.0032262804,0.0003946125,0.001951307,0.00049564056,0.0005581699],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.003487584,0.0005474126,0.00079432264,0.00054550596,0.000837785,0.0004545769,0.0019772453,0.00015539194,0.0002996287],"category_scores_gemma":[0.004892369,0.0004399055,0.00026048184,0.002369592,0.0027700253,0.0005290671,0.00095006445,0.00049580913,0.00064904074],"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.0000060929638,0.00029616087,0.000010305413,0.00014512104,0.000019295676,0.0000028286515,0.0005572945,0.000021683616,0.000259084,0.9954571,0.0003546845,0.0028703187],"study_design_scores_gemma":[0.0003907824,0.00023089991,0.000011051904,0.00012474903,0.0000652808,0.000039236867,0.00011433255,0.18797083,0.00089988904,0.8093613,0.00032461758,0.00046702908],"about_ca_topic_score_codex":7.400805e-7,"about_ca_topic_score_gemma":4.7961646e-7,"teacher_disagreement_score":0.53880036,"about_ca_system_score_codex":0.00014156067,"about_ca_system_score_gemma":0.00009380995,"threshold_uncertainty_score":0.99994385},"labels":[],"label_agreement":null},{"id":"W2950555606","doi":"10.46298/dmtcs.2909","title":"Critical Groups of Simplicial Complexes","year":2011,"lang":"fr","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Topological and Geometric Data Analysis","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","funders":"","keywords":"Simplicial complex; Abstract simplicial complex; h-vector; Mathematics; Simplicial approximation theorem; Sketch; Simplicial manifold; Simplicial homology; Abelian group; Interpretation (philosophy); Combinatorics; Simplicial set; Graph; Pure mathematics; Computer science; Algorithm","score_opus":0.04055166733370223,"score_gpt":0.300638903574668,"score_spread":0.26008723624096575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950555606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009892041,0.00026707648,0.96939313,0.0023247965,0.0019744642,0.0004839697,0.00021539566,0.00017447837,0.015274662],"genre_scores_gemma":[0.596144,0.000039394057,0.403178,0.0002416571,0.00030023154,0.000017194943,0.000016238446,0.000024314875,0.00003890907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9900862,0.00046537563,0.0022695712,0.002588503,0.0026767745,0.0019135942],"domain_scores_gemma":[0.9899972,0.0029058058,0.00080011174,0.0036845766,0.0014881272,0.0011241612],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0043131136,0.001049585,0.0021590297,0.00085529976,0.00082003267,0.0013559409,0.011249269,0.00053313735,0.0016591214],"category_scores_gemma":[0.002618017,0.0008208185,0.000932479,0.0042894906,0.02797391,0.0011000092,0.016407741,0.0012500181,0.0004006025],"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.000015082156,0.0009105972,0.000042129137,0.00039089614,0.000088656394,0.00004736578,0.0023354944,0.00012625114,0.000314703,0.98738825,0.000110676934,0.008229902],"study_design_scores_gemma":[0.00015046263,0.0004254273,0.0005712074,0.00031461724,0.00019298695,0.00006424637,0.00006098314,0.3335372,0.0010277927,0.6628462,0.00012939185,0.0006794974],"about_ca_topic_score_codex":0.00010233223,"about_ca_topic_score_gemma":0.000005000828,"teacher_disagreement_score":0.586252,"about_ca_system_score_codex":0.00010814199,"about_ca_system_score_gemma":0.00042501988,"threshold_uncertainty_score":0.99968076},"labels":[],"label_agreement":null},{"id":"W2951641332","doi":"10.46298/dmtcs.3054","title":"Skew Pieri Rules for Hall-Littlewood Functions","year":2012,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Mathematical Identities","field":"Mathematics","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":"Toronto Metropolitan University","funders":"Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Skew; Mathematics; Computer science; Telecommunications","score_opus":0.03196847759100617,"score_gpt":0.3131581412541407,"score_spread":0.2811896636631345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951641332","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046769297,0.0015427205,0.9597574,0.002718116,0.004188218,0.0017095865,0.00029568915,0.0003516304,0.024759717],"genre_scores_gemma":[0.1343326,0.00006199568,0.8573662,0.0002174859,0.0017044251,0.00024267811,0.000023882356,0.0001854668,0.005865264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99259704,0.00018889752,0.0016406166,0.001027749,0.0016814126,0.0028642514],"domain_scores_gemma":[0.9907938,0.0047294656,0.00055666553,0.0019064274,0.0007271027,0.0012865051],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.0044766865,0.00094960106,0.0012840083,0.0003557495,0.0013569151,0.000939829,0.0019792614,0.0003674963,0.0015987145],"category_scores_gemma":[0.0034101366,0.00083595567,0.0006475532,0.0009667179,0.010385978,0.0020113322,0.0014312407,0.0006351138,0.0014874146],"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.000016220107,0.0012155862,0.000010081064,0.0023158698,0.00010512852,0.0000039157426,0.0044514462,0.000016873717,0.00021029114,0.9875123,0.0018516377,0.0022906838],"study_design_scores_gemma":[0.00051095395,0.000274425,0.000013244943,0.0009585142,0.00048332385,0.00014939123,0.00086770934,0.11292368,0.0010194612,0.8787774,0.0031067333,0.0009151765],"about_ca_topic_score_codex":0.0000037950228,"about_ca_topic_score_gemma":0.0000020580821,"teacher_disagreement_score":0.12965566,"about_ca_system_score_codex":0.00032594852,"about_ca_system_score_gemma":0.00023887855,"threshold_uncertainty_score":0.9999432},"labels":[],"label_agreement":null},{"id":"W2951814084","doi":"10.46298/dmtcs.2942","title":"Row-strict quasisymmetric Schur functions","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"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; Combinatorics; Schur's theorem; Basis (linear algebra); Schur's lemma; Base (topology); Function (biology); Pure mathematics; Orthogonal polynomials; Geometry; Mathematical analysis; Classical orthogonal polynomials","score_opus":0.041564760828424134,"score_gpt":0.2938282461647619,"score_spread":0.25226348533633774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951814084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025639057,0.000023982355,0.9146901,0.0000913228,0.0010828619,0.0006247243,0.000011079249,0.0004926604,0.05734421],"genre_scores_gemma":[0.5294504,0.00000388942,0.47016898,0.000054953918,0.00013394377,0.000038102255,0.0000013323704,0.000052999738,0.000095409814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950804,0.00016312377,0.0011002654,0.0009228354,0.0015800677,0.0011532815],"domain_scores_gemma":[0.9946498,0.0019328903,0.00043640795,0.0018791967,0.0005270542,0.0005746519],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0029617622,0.0005729639,0.00076104334,0.00064902386,0.0007424431,0.00027186755,0.0021896162,0.00016892496,0.0007112406],"category_scores_gemma":[0.0033677588,0.0004600275,0.00028251938,0.003151549,0.002811122,0.0006577224,0.0010374215,0.00051760435,0.00055809534],"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.000015817315,0.0005522462,0.000023542207,0.00012236294,0.00003092828,0.000014773482,0.0019910545,0.0000028401503,0.00014067402,0.9955404,0.00023242908,0.0013329283],"study_design_scores_gemma":[0.00041189347,0.00030566278,0.000046444122,0.00012974441,0.00010660364,0.00007037378,0.00034146744,0.040047392,0.0021222304,0.9557776,0.00006549554,0.00057509606],"about_ca_topic_score_codex":0.0000021733958,"about_ca_topic_score_gemma":5.9273674e-7,"teacher_disagreement_score":0.50381136,"about_ca_system_score_codex":0.00015063366,"about_ca_system_score_gemma":0.00013311226,"threshold_uncertainty_score":0.99990267},"labels":[],"label_agreement":null},{"id":"W2951823908","doi":"10.46298/dmtcs.2930","title":"The Incidence Hopf Algebra of Graphs","year":2011,"lang":"fr","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"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":"Hopf algebra; Mathematics; Incidence algebra; Representation theory of Hopf algebras; Graph algebra; Coproduct; Incidence (geometry); Cellular algebra; Division algebra; Combinatorics; Commutative property; Algebra over a field; Graph; Discrete mathematics; Filtered algebra; Pure mathematics; Algebra representation; Line graph; Voltage graph","score_opus":0.02220357333048012,"score_gpt":0.28666240421640715,"score_spread":0.26445883088592703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951823908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044952646,0.0006463256,0.9267585,0.00076326006,0.0057277977,0.0025282076,0.00006202955,0.0002823446,0.018278837],"genre_scores_gemma":[0.51162356,0.0002953392,0.48730105,0.00006023102,0.0002545831,0.00011950334,0.0000039088386,0.00016148188,0.00018031984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98758215,0.00061221886,0.003766554,0.0019391925,0.0037863443,0.0023135506],"domain_scores_gemma":[0.9794831,0.008696123,0.0029879662,0.0060404167,0.0019247899,0.0008675489],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["metaepi_narrow","sts","open_science"],"category_scores_codex":[0.009057201,0.0016047045,0.0023924594,0.00040373908,0.0016977474,0.00083734305,0.010374805,0.0007094005,0.00030489662],"category_scores_gemma":[0.005460539,0.001134514,0.001018151,0.0020646206,0.028868286,0.0006069012,0.010026383,0.0021347934,0.00025679867],"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.000041400403,0.00067759294,0.000014274046,0.0017148579,0.00016376293,0.000022843395,0.008069122,0.00007076485,0.00031128293,0.9864591,0.000102790706,0.0023522282],"study_design_scores_gemma":[0.00039954222,0.00035634942,0.000024013838,0.0025879904,0.0003978938,0.000097634795,0.00047411918,0.108200915,0.0050962283,0.88116807,0.0001008035,0.0010964562],"about_ca_topic_score_codex":0.000016663867,"about_ca_topic_score_gemma":0.0000061636065,"teacher_disagreement_score":0.46667093,"about_ca_system_score_codex":0.00031435504,"about_ca_system_score_gemma":0.0008643356,"threshold_uncertainty_score":0.9996701},"labels":[],"label_agreement":null},{"id":"W2952321143","doi":"10.23638/dmtcs-21-3-20","title":"Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McMaster University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Face (sociological concept); Wireless; Mathematics; Robot; Fetch; Computer science; Artificial intelligence; Telecommunications; Sociology; Geology; Social science","score_opus":0.019253888759540833,"score_gpt":0.26933908011555946,"score_spread":0.25008519135601864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952321143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10731695,0.00001427896,0.8862096,0.0029120324,0.000035790184,0.00063444016,0.0000023403004,0.00010827955,0.0027662911],"genre_scores_gemma":[0.6731232,0.000018410272,0.32646996,0.00032689242,0.0000054662964,0.000012085663,0.0000011101554,0.000011504765,0.000031381627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973952,0.00013724137,0.00027529642,0.0007271445,0.00093635084,0.0005287658],"domain_scores_gemma":[0.9977042,0.000362743,0.000060214043,0.0012552172,0.0001827541,0.00043485727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013751698,0.00023694555,0.00029186177,0.00019677587,0.0003789246,0.0009951339,0.0018427898,0.000051464835,0.000012755769],"category_scores_gemma":[0.000028047445,0.00016698247,0.000029526174,0.0008080191,0.0013329127,0.000798734,0.0017654684,0.00026754942,0.000056720564],"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.000008856099,0.00005282806,0.000023027937,0.000038061502,0.000005500901,0.000001261742,0.00600694,0.036036804,0.00010275903,0.9542358,0.0000048606453,0.003483277],"study_design_scores_gemma":[0.0002801031,0.0003469088,0.000081634695,0.00018730335,0.0000034849847,0.000016996148,0.00015040807,0.911315,0.00031820082,0.087059446,0.0000044456037,0.00023603585],"about_ca_topic_score_codex":0.0000037845186,"about_ca_topic_score_gemma":8.712982e-7,"teacher_disagreement_score":0.87527823,"about_ca_system_score_codex":0.000034780092,"about_ca_system_score_gemma":0.00007699693,"threshold_uncertainty_score":0.9596099},"labels":[],"label_agreement":null},{"id":"W2953434422","doi":"10.46298/dmtcs.6330","title":"Asymptotics of polygons in restricted geometries subject to a force","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Geometric and Algebraic Topology","field":"Mathematics","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 Regina","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Vertex (graph theory); Geometry; Asymptote; Hamiltonian (control theory); Graph","score_opus":0.025967794231911874,"score_gpt":0.2893095730497538,"score_spread":0.26334177881784193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953434422","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.41076773,0.000015500405,0.58459127,0.0018607859,0.00009168856,0.00036949158,0.00001223776,0.000075182725,0.0022161214],"genre_scores_gemma":[0.7931893,0.0000027077426,0.20638159,0.0003341039,0.0000497084,0.000007669109,0.0000010386742,0.000020766654,0.000013145781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969551,0.00007447684,0.0008457645,0.0005614728,0.0008525796,0.00071062206],"domain_scores_gemma":[0.9966558,0.0018864691,0.00020246183,0.0006046882,0.00020192162,0.00044865065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010170667,0.00027508315,0.00068167987,0.00075401476,0.00012399557,0.00008975426,0.0013450295,0.000099459554,0.00012416636],"category_scores_gemma":[0.005821405,0.00022226147,0.000121291814,0.006315662,0.0018019923,0.00014424512,0.0008591563,0.00027087142,0.00003691885],"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.00002136292,0.00011852015,0.0002243099,0.00012577676,0.00001084712,0.000010777928,0.0036847522,0.00004663605,0.00087693933,0.99428767,0.00008336049,0.0005090398],"study_design_scores_gemma":[0.00053687766,0.000767383,0.0007924292,0.0001316199,0.000037232567,0.000020765921,0.0006413871,0.06695586,0.006361669,0.92333204,0.00002408415,0.00039867684],"about_ca_topic_score_codex":0.0000046490773,"about_ca_topic_score_gemma":0.0000017623515,"teacher_disagreement_score":0.38242152,"about_ca_system_score_codex":0.000042630312,"about_ca_system_score_gemma":0.00014143996,"threshold_uncertainty_score":0.906356},"labels":[],"label_agreement":null},{"id":"W2953557773","doi":"10.46298/dmtcs.6338","title":"Factorial Characters and Tokuyama's Identity for Classical Groups","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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 Waterloo","funders":"Nankai University; Natural Sciences and Engineering Research Council of Canada; University of Tokyo; Wilfrid Laurier University","keywords":"Mathematics; Factorial; Symplectic geometry; Mathematical proof; Classical group; Combinatorics; Pure mathematics; Generating function; Identity (music); Lattice (music); Factorial experiment; Algebra over a field; Geometry; Mathematical analysis; Statistics; Lie group","score_opus":0.03286937093139549,"score_gpt":0.311670759752705,"score_spread":0.2788013888213095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953557773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07803534,0.0000096538215,0.91785645,0.0015329322,0.0008963837,0.0009278501,0.000022192267,0.0002590859,0.00046011125],"genre_scores_gemma":[0.65770715,0.0000033152937,0.34126982,0.0002518405,0.0006699579,0.000040964456,0.0000021237959,0.00005035682,0.000004445934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964455,0.000069311696,0.000779189,0.00084206456,0.0010931584,0.0007708209],"domain_scores_gemma":[0.9959974,0.0020701152,0.00030469,0.00064796075,0.000308267,0.000671537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012567731,0.000439971,0.0007549165,0.00009591926,0.00046667003,0.0005992524,0.0012744754,0.00014207255,0.000032813743],"category_scores_gemma":[0.0035914716,0.00036002803,0.00019176689,0.00056517194,0.0022915425,0.00095884217,0.00094053574,0.00034097774,0.000024294852],"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.000037384547,0.00011536778,0.0000054445964,0.00036021363,0.000021169553,0.000004360474,0.002505379,0.0000015755942,0.001447013,0.9950398,0.00010444852,0.00035782193],"study_design_scores_gemma":[0.0007198612,0.00033283833,0.000014910482,0.000081017446,0.000069122725,0.000010748963,0.00011996186,0.118964136,0.0012766403,0.87792766,0.000078948884,0.000404133],"about_ca_topic_score_codex":2.2595229e-7,"about_ca_topic_score_gemma":2.5578066e-7,"teacher_disagreement_score":0.57967186,"about_ca_system_score_codex":0.000071655464,"about_ca_system_score_gemma":0.00008200336,"threshold_uncertainty_score":0.99988514},"labels":[],"label_agreement":null},{"id":"W2955177825","doi":"10.46298/dmtcs.6399","title":"The facial weak order in finite Coxeter groups","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Partially ordered set; Coxeter group; Mathematics; Lattice (music); Combinatorics; Congruence (geometry); Bruhat order; Pure mathematics; Coset; Discrete mathematics; Geometry; Physics","score_opus":0.02437137117570248,"score_gpt":0.2912438422239577,"score_spread":0.26687247104825523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955177825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025277358,0.00002516873,0.96064174,0.003370252,0.00067078957,0.0008963623,0.000009002056,0.00026002614,0.008849282],"genre_scores_gemma":[0.74611586,0.000009228695,0.2530812,0.000396545,0.00026341763,0.000048571663,0.0000012908338,0.00006206064,0.000021809203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955619,0.0001602882,0.0010789696,0.00075051526,0.0013985151,0.0010498104],"domain_scores_gemma":[0.993975,0.0039376984,0.0003051324,0.0010469042,0.00030028124,0.00043498626],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0020007724,0.00047121302,0.0006428737,0.000114438735,0.0006585806,0.0005325111,0.0023657093,0.00012476585,0.00009201036],"category_scores_gemma":[0.005326285,0.00031272607,0.00015859665,0.0017240185,0.0031388674,0.00038919988,0.0012502354,0.00061690825,0.0001516164],"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.000024935292,0.000111966634,0.00001357914,0.000104146624,0.000011474589,0.000013441535,0.004039647,0.0000682375,0.0001525826,0.99424,0.00010671775,0.0011132885],"study_design_scores_gemma":[0.00043078978,0.0001388871,0.0000068616273,0.00008105185,0.00001795252,0.000008877234,0.0003357516,0.28457603,0.00034868484,0.713467,0.00027307266,0.000315045],"about_ca_topic_score_codex":6.380721e-7,"about_ca_topic_score_gemma":0.0000022900679,"teacher_disagreement_score":0.72083855,"about_ca_system_score_codex":0.000089609035,"about_ca_system_score_gemma":0.00013699211,"threshold_uncertainty_score":0.99993247},"labels":[],"label_agreement":null},{"id":"W2955232156","doi":"10.46298/dmtcs.6329","title":"Asymptotic laws for knot diagrams","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":1,"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":"University of Georgia; University of Saskatchewan; National Science Foundation","keywords":"Knot (papermaking); Mathematics; Combinatorics; Conjecture; Knot invariant; Knot theory","score_opus":0.035397707436227006,"score_gpt":0.2984304149216633,"score_spread":0.2630327074854363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955232156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029528826,0.000020192092,0.9611932,0.0040333346,0.00027027854,0.0006246519,0.000014063816,0.00022288553,0.004092584],"genre_scores_gemma":[0.6596817,0.0000016800396,0.3393608,0.0006532114,0.00022271373,0.000028013677,0.0000023104017,0.000027617061,0.00002199738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972287,0.000055959797,0.0005805692,0.0006777245,0.00066043,0.0007966614],"domain_scores_gemma":[0.9965289,0.002018357,0.00017496356,0.0005777337,0.00019657124,0.0005034723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011823697,0.0003080917,0.00055341155,0.00013587203,0.00036286796,0.00022281229,0.0013409018,0.00010017963,0.0002503328],"category_scores_gemma":[0.002574129,0.00023145661,0.00021156501,0.0011072946,0.0024686577,0.00017199825,0.0005636639,0.00021618047,0.0001148875],"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.000009163614,0.000095130876,0.000019636938,0.00016620393,0.000016567405,0.000004205063,0.0013461555,0.000005781988,0.00016019143,0.99569017,0.00050274853,0.0019840377],"study_design_scores_gemma":[0.00035353066,0.00033266665,0.000018587105,0.00003270583,0.000045479774,0.000015155641,0.0001277873,0.2114423,0.000762727,0.78636754,0.00023153427,0.0002699853],"about_ca_topic_score_codex":4.449448e-7,"about_ca_topic_score_gemma":2.3424427e-7,"teacher_disagreement_score":0.6301528,"about_ca_system_score_codex":0.000030081896,"about_ca_system_score_gemma":0.00008317427,"threshold_uncertainty_score":0.94385266},"labels":[],"label_agreement":null},{"id":"W2955577855","doi":"10.46298/dmtcs.6359","title":"A Hopf algebra of subword complexes (Extended abstract)","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Algebraic structures and combinatorial models","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":"York University","funders":"Austrian Science Fund; York University; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Hopf algebra; Mathematics; Representation theory of Hopf algebras; Algebra over a field; Pure mathematics; Filtered algebra; Division algebra","score_opus":0.027647728721726144,"score_gpt":0.28687176519668234,"score_spread":0.2592240364749562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955577855","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.5460253,0.000029928698,0.44699472,0.0012748901,0.00037409563,0.00050623517,0.000012910771,0.00020929826,0.0045726215],"genre_scores_gemma":[0.8774474,0.0000026284847,0.122075565,0.00025885072,0.00017034516,0.000007657275,0.0000017167957,0.00003304262,0.0000027718331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99673754,0.00005052325,0.0008220318,0.0006095816,0.0011851724,0.00059514807],"domain_scores_gemma":[0.9974766,0.0007477538,0.00033769457,0.00074476295,0.0002606424,0.00043256307],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007463166,0.00035196292,0.0006977138,0.00009595637,0.00024099692,0.00022383832,0.0016190875,0.00010001952,0.00040280266],"category_scores_gemma":[0.0006288637,0.0002682139,0.00022473608,0.00073842116,0.002690195,0.0002961792,0.00073194434,0.00029410436,0.000025366902],"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.000024139368,0.00009982889,0.000007251275,0.00021070703,0.000025173214,0.000005926573,0.0026812505,0.000009639967,0.0012763888,0.9948783,0.000094801144,0.00068657205],"study_design_scores_gemma":[0.0003668197,0.00022436949,0.0000900013,0.000092838454,0.000043818858,0.000011654447,0.00018865375,0.05502372,0.005814856,0.93782026,0.000016996059,0.00030599872],"about_ca_topic_score_codex":0.000002332971,"about_ca_topic_score_gemma":3.199141e-7,"teacher_disagreement_score":0.33142212,"about_ca_system_score_codex":0.000027454918,"about_ca_system_score_gemma":0.00012250208,"threshold_uncertainty_score":0.999977},"labels":[],"label_agreement":null},{"id":"W2955954078","doi":"10.46298/dmtcs.6380","title":"On intervals of the consecutive pattern poset","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","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","funders":"Bucknell University; Simons Foundation","keywords":"Partially ordered set; Combinatorics; Mathematics; Subsequence; Rank (graph theory); Order (exchange); Generating function; Hasse diagram; Set (abstract data type); Function (biology); Discrete mathematics; Computer science; Biology","score_opus":0.015109162470780112,"score_gpt":0.2509598280722007,"score_spread":0.23585066560142057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955954078","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.05855837,0.000009576966,0.93311334,0.004928591,0.00029065832,0.00025063782,0.000014266664,0.000114657974,0.0027199266],"genre_scores_gemma":[0.9561525,0.0000010406739,0.0397848,0.0039990903,0.00004254252,0.0000051047423,4.9248894e-7,0.000011325269,0.0000030841718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745655,0.00014942625,0.00046449198,0.00059556664,0.0009077514,0.00042623593],"domain_scores_gemma":[0.9975825,0.0006876104,0.00022453154,0.0011334481,0.00013816486,0.00023374366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009333859,0.00023766076,0.00033959682,0.00006793909,0.0002317917,0.00027616817,0.0045810435,0.000047625996,0.00006214689],"category_scores_gemma":[0.00035290807,0.00014096912,0.00018269183,0.0009171549,0.0026679703,0.00027857348,0.0021497798,0.00024249041,0.00006863443],"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.000003728624,0.000058119756,0.000016560249,0.000034713463,0.0000090932,0.0000046538617,0.0043011312,0.00003651145,0.00093578117,0.99071896,0.0001398576,0.0037409004],"study_design_scores_gemma":[0.0001525718,0.00022171678,0.00012850632,0.00013759198,0.00000725055,0.000013063961,0.00007025117,0.60080725,0.012544569,0.38573828,0.000013087339,0.00016586838],"about_ca_topic_score_codex":0.0000011875949,"about_ca_topic_score_gemma":1.16982704e-7,"teacher_disagreement_score":0.89759415,"about_ca_system_score_codex":0.00002194836,"about_ca_system_score_gemma":0.00008477658,"threshold_uncertainty_score":0.9830248},"labels":[],"label_agreement":null},{"id":"W2962929143","doi":"10.46298/dmtcs.3634","title":"Combinatorial Hopf Algebras and Towers of Algebras","year":2008,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Hopf algebra; Mathematics; Dual polyhedron; Tower; Combinatorics; Quasitriangular Hopf algebra; Axiom; Pure mathematics; Algebra over a field; Geometry; Division algebra; Subalgebra; Geography","score_opus":0.017420213945366886,"score_gpt":0.27368162430694076,"score_spread":0.2562614103615739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962929143","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.3676941,0.0013699449,0.6083488,0.0012586426,0.0072587645,0.0015646274,0.0000655579,0.00026239577,0.012177149],"genre_scores_gemma":[0.6518613,0.0002577727,0.34708443,0.000084374966,0.00043653793,0.000021741998,0.0000029011533,0.000113327,0.00013758165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99240935,0.00028668327,0.0020331228,0.0012435166,0.002442359,0.0015849663],"domain_scores_gemma":[0.99196875,0.0032929624,0.0009899487,0.001972616,0.00086012087,0.0009156032],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0028065348,0.0009733049,0.0018047603,0.0004134285,0.0010196435,0.00024991523,0.0021688498,0.00044080257,0.00038258167],"category_scores_gemma":[0.0026872766,0.00090078847,0.00037017462,0.0016823948,0.02093798,0.00088788255,0.0020989168,0.0008183069,0.00009774352],"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.000036766203,0.00095570507,0.000032725377,0.0013166921,0.0000939423,0.00007566799,0.009638297,0.000016601578,0.00050360715,0.98537505,0.00024724702,0.001707694],"study_design_scores_gemma":[0.0013921771,0.00076159154,0.000022559569,0.0010122298,0.00023112803,0.00050201255,0.00041217782,0.07430939,0.004864764,0.9153787,0.00023267207,0.000880636],"about_ca_topic_score_codex":0.000008835695,"about_ca_topic_score_gemma":5.462806e-7,"teacher_disagreement_score":0.2841672,"about_ca_system_score_codex":0.00020410423,"about_ca_system_score_gemma":0.00048480352,"threshold_uncertainty_score":0.9993443},"labels":[],"label_agreement":null},{"id":"W2963014173","doi":"10.46298/dmtcs.635","title":"Sequence variations of the 1-2-3 conjecture and irregularity strength","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Vertex (graph theory); Graph; Upper and lower bounds; Sequence (biology); Weighting; Discrete mathematics","score_opus":0.007904307775328885,"score_gpt":0.21123517022535293,"score_spread":0.20333086245002405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963014173","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.61652106,0.00003643681,0.37872267,0.00020678554,0.00032615516,0.00037002438,0.0000159675,0.00009936574,0.0037015348],"genre_scores_gemma":[0.980316,0.0000018926761,0.019609919,0.000024827787,0.000022849723,0.000010899184,5.475239e-7,0.000008680844,0.0000044278027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990205,0.000046467183,0.00024317234,0.00017158139,0.00029101563,0.00022724217],"domain_scores_gemma":[0.9991466,0.00018036421,0.000047853602,0.0004611205,0.00006895789,0.00009512553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045628802,0.00013075443,0.00017240435,0.000045924822,0.00017924613,0.00012634705,0.0005745075,0.000046955105,0.00006382981],"category_scores_gemma":[0.000054985936,0.00007993824,0.00005093602,0.00039236582,0.0019816149,0.00017110255,0.00018029613,0.00013775536,0.000008215853],"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":[2.2064867e-7,0.000010676975,0.000048156457,0.00006780405,0.0000072312255,1.8936846e-7,0.0009530612,0.00015254495,0.0031046276,0.9950898,0.000014058559,0.00055159425],"study_design_scores_gemma":[0.000052253417,0.000015016401,0.000647294,0.000058191043,0.000009515046,0.000014502587,0.00005829984,0.46643937,0.0026342473,0.52997565,0.0000062985678,0.00008935005],"about_ca_topic_score_codex":0.0000030545173,"about_ca_topic_score_gemma":5.7067047e-7,"teacher_disagreement_score":0.46628684,"about_ca_system_score_codex":0.000011529888,"about_ca_system_score_gemma":0.000017571201,"threshold_uncertainty_score":0.73013425},"labels":[],"label_agreement":null},{"id":"W2963518267","doi":"10.46298/dmtcs.2486","title":"Upper bounds on the growth rates of hard squares and related models via corner transfer matrices","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Theoretical and Computational Physics","field":"Physics and Astronomy","cited_by":0,"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":"Western Canada Research Grid","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Eigenvalues and eigenvectors; Transfer matrix; Transfer (computing); Lattice (music); Matrix (chemical analysis); Linear algebra; Discrete mathematics; Geometry; Mathematical analysis; Quantum mechanics","score_opus":0.015881225040040074,"score_gpt":0.24257679441947563,"score_spread":0.22669556937943555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963518267","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.36957386,0.000016795726,0.6181664,0.00077581435,0.00008385589,0.00017979827,0.0000144377445,0.00002396599,0.011165102],"genre_scores_gemma":[0.9910757,8.998571e-7,0.008719741,0.00009594555,0.000060630868,0.000010182581,0.0000043061855,0.0000150106725,0.000017577155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983611,0.000079379606,0.00034694403,0.00032857826,0.000586737,0.0002972411],"domain_scores_gemma":[0.99861807,0.000582418,0.00006696275,0.0002946776,0.00024808908,0.00018980702],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00061256625,0.0002093359,0.00026592397,0.000059842274,0.00020618932,0.00019089553,0.00055691024,0.000031648615,0.000097402255],"category_scores_gemma":[0.000020513633,0.000120202,0.00010070253,0.00040172378,0.0029870786,0.00022297892,0.00018072942,0.00017686859,0.00002398565],"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.000016582688,0.000107012194,0.00006889601,0.000015504947,0.000022741446,4.4926495e-7,0.0015918926,0.0005424715,0.00012649783,0.9969455,0.000027726945,0.0005347234],"study_design_scores_gemma":[0.0001465835,0.00009019228,0.00007711688,0.000038688657,0.000019199393,0.0000016907512,0.00013200167,0.35801417,0.0012758798,0.64009154,0.0000014909257,0.000111457986],"about_ca_topic_score_codex":0.0000040689706,"about_ca_topic_score_gemma":2.416281e-8,"teacher_disagreement_score":0.62150186,"about_ca_system_score_codex":0.000009722072,"about_ca_system_score_gemma":0.000056447127,"threshold_uncertainty_score":0.99972624},"labels":[],"label_agreement":null},{"id":"W2963804823","doi":"10.46298/dmtcs.3088","title":"Asymptotical behaviour of roots of infinite Coxeter groups I","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Coxeter group; Mathematics; Combinatorics; Coxeter element; Countable set; Rank (graph theory); Dihedral group; Intersection (aeronautics); Pure mathematics; Group (periodic table); Physics","score_opus":0.02294801817507042,"score_gpt":0.30473802238905334,"score_spread":0.2817900042139829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963804823","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.40696093,0.000020328458,0.58820164,0.00004576683,0.000517109,0.00040358325,0.000013536978,0.00008387146,0.0037532419],"genre_scores_gemma":[0.64873195,0.0000017266093,0.3510894,0.000018440169,0.00010107525,0.000011409739,0.0000010525046,0.000038809325,0.000006188074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99543786,0.00012939845,0.0014310358,0.00042663404,0.0016171589,0.00095793826],"domain_scores_gemma":[0.9946724,0.0023293165,0.0006714582,0.001354336,0.000508187,0.00046428022],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002857569,0.00042593223,0.000962464,0.00027743584,0.00016244555,0.000061074876,0.0014440676,0.00016624444,0.00016713202],"category_scores_gemma":[0.0018775616,0.00033660157,0.00026610552,0.0009057884,0.003940637,0.0005375934,0.0010182101,0.00034485853,0.000028319075],"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.000014322521,0.00078234985,0.00048588152,0.00041068002,0.000025505997,0.000001934574,0.0026347237,0.0000059829126,0.002192061,0.99320793,0.000015138225,0.00022347693],"study_design_scores_gemma":[0.00044616175,0.0002760849,0.0004459785,0.00033498293,0.00012905305,0.000040430903,0.00023188266,0.017778542,0.015874995,0.96405184,0.0000048005313,0.00038525974],"about_ca_topic_score_codex":8.3120494e-7,"about_ca_topic_score_gemma":1.6807027e-7,"teacher_disagreement_score":0.24177098,"about_ca_system_score_codex":0.00006294889,"about_ca_system_score_gemma":0.000086538406,"threshold_uncertainty_score":0.9999086},"labels":[],"label_agreement":null},{"id":"W2963906392","doi":"10.46298/dmtcs.6416","title":"Counting quadrant walks via Tutte's invariant method (extended abstract)","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Agence Nationale de la Recherche; National Science Foundation","keywords":"Enumeration; Mathematical proof; Algebraic number; Mathematics; Invariant (physics); Quadrant (abdomen); Algebraic function; Discrete mathematics; Combinatorics; Mathematical analysis; Geometry","score_opus":0.0298702935328634,"score_gpt":0.3198436684039755,"score_spread":0.2899733748711121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963906392","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007985354,0.00001844891,0.98095727,0.0016810113,0.0005429359,0.0008599493,0.00001254421,0.0005622563,0.007380212],"genre_scores_gemma":[0.45727205,0.0000023436614,0.54190063,0.0004579962,0.000260678,0.00002380819,0.0000020743528,0.00007408152,0.000006301821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99358386,0.00016399319,0.0015658865,0.0012452519,0.0021306903,0.0013103245],"domain_scores_gemma":[0.9936058,0.0029482557,0.00069188897,0.0014093176,0.0005052244,0.0008395125],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003767866,0.00072780036,0.0011687645,0.00018241392,0.0006766926,0.0005918824,0.0025763703,0.00020125973,0.00035716876],"category_scores_gemma":[0.0034343791,0.00058931584,0.0003063134,0.0013752455,0.002005405,0.0006977812,0.0014011316,0.0008001033,0.0002264523],"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.00002250835,0.0002450125,0.0000019496379,0.00046376832,0.00003962794,0.000051438616,0.004659719,0.000053183736,0.0054184203,0.98686546,0.00010718357,0.0020717164],"study_design_scores_gemma":[0.0004034852,0.00014957681,0.0000064477463,0.00015417543,0.00006943532,0.000059445058,0.00019444582,0.3610029,0.004492753,0.63291854,0.000052694802,0.0004961256],"about_ca_topic_score_codex":0.000002657442,"about_ca_topic_score_gemma":6.188458e-7,"teacher_disagreement_score":0.4492867,"about_ca_system_score_codex":0.0001341865,"about_ca_system_score_gemma":0.00019979881,"threshold_uncertainty_score":0.99965584},"labels":[],"label_agreement":null},{"id":"W2964068676","doi":"10.46298/dmtcs.3636","title":"Nested Hilbert Schemes and the nested $q,t$-Catalan series","year":2008,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Sheaf; Combinatorics; Euler characteristic; Hilbert scheme; Catalan; Polynomial; Tangent space; Humanities; Pure mathematics; Mathematical analysis","score_opus":0.016603009089837365,"score_gpt":0.25336874722250163,"score_spread":0.23676573813266427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964068676","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.43934003,0.0028097932,0.5165053,0.018797688,0.0021625329,0.0018266159,0.000047421836,0.00037440902,0.018136194],"genre_scores_gemma":[0.8763326,0.00031782017,0.11935422,0.000664765,0.0004814072,0.000045192428,0.000008390414,0.00008769842,0.0027079016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945925,0.00057580177,0.0011350331,0.0009990155,0.0013775034,0.0013201798],"domain_scores_gemma":[0.9929447,0.003932098,0.000421166,0.0017301732,0.00038373363,0.0005880881],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0046712505,0.00076447485,0.0011171735,0.0002199115,0.0020386802,0.00058049615,0.0019679863,0.00027730042,0.00057942764],"category_scores_gemma":[0.0019148188,0.00050494325,0.00029615522,0.0016908265,0.044685364,0.0009647393,0.0017786392,0.0007659047,0.00025939406],"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.000106650004,0.00023911263,0.000069309106,0.0004759915,0.00008591454,0.000069535556,0.015117261,0.000005449952,0.000054774548,0.9822646,0.00027064665,0.0012407501],"study_design_scores_gemma":[0.0013974402,0.00019286331,0.00011531751,0.00053606974,0.0002288808,0.0031912494,0.0010303531,0.07629406,0.0011561759,0.9142012,0.0009523341,0.0007040418],"about_ca_topic_score_codex":0.000011037624,"about_ca_topic_score_gemma":0.0000016950867,"teacher_disagreement_score":0.4369926,"about_ca_system_score_codex":0.000067288616,"about_ca_system_score_gemma":0.00024386428,"threshold_uncertainty_score":0.99974024},"labels":[],"label_agreement":null},{"id":"W2964304491","doi":"10.46298/dmtcs.524","title":"Symmetric monochromatic subsets in colorings of the Lobachevsky plane","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Topology and Set Theory","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":"Canada Research Chairs; University of Toronto","funders":"Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Monochromatic color; Partition (number theory); Combinatorics; Mathematics; Plane (geometry); Physics; Geometry; Optics","score_opus":0.015820420117436628,"score_gpt":0.2868289105072758,"score_spread":0.2710084903898392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964304491","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.90556854,0.00001145432,0.079745576,0.00030622314,0.0003861435,0.00045287595,0.000007454635,0.00006004209,0.01346169],"genre_scores_gemma":[0.8735625,0.0000016148119,0.12628707,0.0000655402,0.000028775665,0.00001348507,6.074624e-7,0.00001824826,0.000022140062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99758804,0.00011012753,0.0006878621,0.00040816373,0.00064266595,0.00056314375],"domain_scores_gemma":[0.99647164,0.001922505,0.0002872941,0.0010701407,0.00010706215,0.00014132838],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0023045281,0.00025505584,0.00048657728,0.000250978,0.00023378892,0.000052122017,0.0017473754,0.00014154552,0.00014117429],"category_scores_gemma":[0.0017122048,0.00016332399,0.00012472914,0.0014034094,0.00533661,0.0001916767,0.000651353,0.000614758,0.000023773982],"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.000009532265,0.00016038987,0.00023762365,0.00011033919,0.0000074347577,0.000005553503,0.0010894394,0.00000985936,0.0025652554,0.9955006,0.00000835379,0.00029560667],"study_design_scores_gemma":[0.00028862618,0.000060605893,0.0007755169,0.000109789995,0.000023510169,0.00006290241,0.00012351504,0.031575777,0.0095645245,0.95720416,0.000007754587,0.00020332969],"about_ca_topic_score_codex":0.0000022340257,"about_ca_topic_score_gemma":0.0000097557195,"teacher_disagreement_score":0.04654149,"about_ca_system_score_codex":0.000034693156,"about_ca_system_score_gemma":0.000093249124,"threshold_uncertainty_score":0.9973703},"labels":[],"label_agreement":null},{"id":"W2964924495","doi":"10.23638/dmtcs-22-1-6","title":"The repetition threshold for binary rich words","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Repetition (rhetorical device); Binary number; Psychology; Linguistics; Mathematics; Natural language processing; Arithmetic; Computer science; Philosophy","score_opus":0.017334118239021163,"score_gpt":0.25899928604030886,"score_spread":0.2416651678012877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964924495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077622817,0.000072223986,0.97596514,0.012304493,0.00043187407,0.00047001048,0.0000055743185,0.00034628622,0.002642127],"genre_scores_gemma":[0.7160529,0.000011181814,0.28212225,0.0015256527,0.0002110239,0.000044943758,0.00000202231,0.000017217813,0.000012833245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715734,0.000060829516,0.00047519288,0.00078782503,0.0008087539,0.0007100701],"domain_scores_gemma":[0.99722266,0.00096156955,0.00015954657,0.00114128,0.00018347909,0.0003314906],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0021382407,0.0002605324,0.00027133749,0.00006710931,0.0011469313,0.0012623701,0.0040596146,0.000059734342,0.000017691527],"category_scores_gemma":[0.0003308859,0.0001632786,0.00015392844,0.0010734946,0.0019667088,0.00062357466,0.0014045873,0.00020807957,0.00006064932],"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.000008740746,0.0000340331,0.0000037320538,0.000033118333,0.000007261897,0.0000046668542,0.001590606,0.00006126256,0.0008031181,0.9921845,0.00037067183,0.00489828],"study_design_scores_gemma":[0.00012596404,0.00017029989,0.000013893612,0.000029673502,0.000006413846,0.000010189736,0.00007166194,0.5858919,0.0012048567,0.41203743,0.0002759405,0.00016178245],"about_ca_topic_score_codex":2.4921138e-7,"about_ca_topic_score_gemma":1.2860997e-7,"teacher_disagreement_score":0.7082906,"about_ca_system_score_codex":0.000036141064,"about_ca_system_score_gemma":0.00010900561,"threshold_uncertainty_score":0.9997744},"labels":[],"label_agreement":null},{"id":"W2993701604","doi":"10.46298/dmtcs.570","title":"Vertex-colouring edge-weightings with two edge weights","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":21,"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":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Weighting; Discrete mathematics","score_opus":0.01134346464713837,"score_gpt":0.24126704247485,"score_spread":0.22992357782771164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2993701604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16548008,0.00009240876,0.82292694,0.0005770214,0.0007634778,0.00027617905,0.0000011920632,0.00040449298,0.0094781965],"genre_scores_gemma":[0.60029733,0.0000020582938,0.39932728,0.00028604592,0.00003882574,0.000011960331,6.7770986e-7,0.000017388214,0.00001843387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99583566,0.00009457232,0.00053184555,0.00084407296,0.0013011812,0.0013926864],"domain_scores_gemma":[0.9968777,0.00042195283,0.00020694248,0.0014458852,0.00028981327,0.0007577391],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023638827,0.0004179581,0.00042958988,0.00031110973,0.0008524631,0.00077327987,0.0026929958,0.00007399078,0.000040331466],"category_scores_gemma":[0.0000917802,0.00027642213,0.00012300297,0.0015359025,0.0024168422,0.0014129708,0.0013803141,0.00033830124,0.00022663173],"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.000004131759,0.00016684002,0.00016323754,0.000033334123,0.000012596073,0.000008192294,0.0025613136,0.000037376707,0.0005897119,0.9947489,0.00005961547,0.001614746],"study_design_scores_gemma":[0.00047314295,0.00018875542,0.00012914644,0.00021053209,0.000024710836,0.00015339607,0.000038687624,0.40074486,0.0066570533,0.5907594,0.000095291136,0.0005250073],"about_ca_topic_score_codex":0.0000034058385,"about_ca_topic_score_gemma":4.100012e-7,"teacher_disagreement_score":0.43481725,"about_ca_system_score_codex":0.00005353553,"about_ca_system_score_gemma":0.00011913115,"threshold_uncertainty_score":0.99996877},"labels":[],"label_agreement":null},{"id":"W3008959219","doi":"10.46298/dmtcs.6178","title":"Bounded affine permutations I. Pattern avoidance and enumeration","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; York University","keywords":"Enumeration; Affine transformation; Bounded function; Permutation (music); Monotone polygon; Boundary (topology); Focus (optics)","score_opus":0.018031238331398247,"score_gpt":0.298582444919961,"score_spread":0.28055120658856275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008959219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10476908,0.00004029736,0.8902127,0.0007316349,0.00038848075,0.00031385387,0.000010245048,0.00017909166,0.0033545815],"genre_scores_gemma":[0.63576746,0.000008683222,0.3638358,0.00015466142,0.00011885693,0.000023506542,0.0000043651876,0.000033995846,0.000052652773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997004,0.00011455617,0.0006748585,0.00070127245,0.0009250723,0.00058028445],"domain_scores_gemma":[0.996761,0.0012862448,0.000227409,0.00093888224,0.0005074757,0.0002789464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001046719,0.000344157,0.0004941251,0.000120809615,0.00065026124,0.0005771508,0.0005810273,0.0000931512,0.00017569715],"category_scores_gemma":[0.001759398,0.0003024006,0.00009800853,0.0007534585,0.0017760299,0.00047885178,0.00064732105,0.00029395142,0.000037579124],"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.0000021881706,0.00017307504,0.0000104542505,0.00017502291,0.000014839282,0.000021854285,0.0029013534,0.000010050728,0.0018409706,0.9926728,0.000037884452,0.0021394908],"study_design_scores_gemma":[0.00033972066,0.00006490176,0.000024326804,0.00015424787,0.000044796714,0.0001270379,0.00026988832,0.15158424,0.0054220185,0.8416113,0.000039545706,0.0003179723],"about_ca_topic_score_codex":6.7026843e-7,"about_ca_topic_score_gemma":0.0000028594302,"teacher_disagreement_score":0.5309984,"about_ca_system_score_codex":0.00008218725,"about_ca_system_score_gemma":0.00015871497,"threshold_uncertainty_score":0.99994284},"labels":[],"label_agreement":null},{"id":"W3013102369","doi":"10.23638/dmtcs-22-1-1","title":"Vertex ordering with optimal number of adjacent predecessors","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Guelph","funders":"Agence Nationale de la Recherche","keywords":"Vertex (graph theory); Combinatorics; Mathematics; Computer science; Graph","score_opus":0.009019497210736761,"score_gpt":0.22111733288742005,"score_spread":0.2120978356766833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013102369","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.39487672,0.000014198654,0.5972764,0.000058556518,0.00010156355,0.00014587896,0.000004261073,0.00014613825,0.007376328],"genre_scores_gemma":[0.93127096,0.0000025312731,0.06862958,0.00003398262,0.000030336387,0.0000056672748,8.412322e-7,0.000024233608,0.0000018748417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853164,0.000025941035,0.0003244254,0.00027308072,0.00048704742,0.00035786215],"domain_scores_gemma":[0.9992231,0.000086316,0.000053267082,0.00032682077,0.00007282021,0.00023766617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035710074,0.0002002855,0.00030850235,0.000041014897,0.00008427847,0.00009541789,0.0006773969,0.000039774102,0.00013479784],"category_scores_gemma":[0.000033127762,0.00014603756,0.00006276085,0.00059551647,0.0011486349,0.00018633693,0.00016488777,0.00014245391,0.000045212786],"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.000015284853,0.000026810156,0.00008062129,0.00031980712,0.000026881498,0.0000063067055,0.004012532,0.013215315,0.0017045798,0.9802026,0.000019172516,0.00037008515],"study_design_scores_gemma":[0.0002186191,0.00011694087,0.00003523822,0.00018889327,0.000021341373,0.000028700098,0.0002889449,0.9710822,0.009381864,0.01836295,0.000029722283,0.00024459508],"about_ca_topic_score_codex":3.3770735e-7,"about_ca_topic_score_gemma":9.2896336e-8,"teacher_disagreement_score":0.9618397,"about_ca_system_score_codex":0.000013401927,"about_ca_system_score_gemma":0.000020861125,"threshold_uncertainty_score":0.5955239},"labels":[],"label_agreement":null},{"id":"W3033569001","doi":"10.46298/dmtcs.6325","title":"A non-partitionable Cohen–Macaulay simplicial complex","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Commutative Algebra and Its Applications","field":"Mathematics","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":"Toronto Metropolitan University","funders":"","keywords":"Conjecture; Monomial; Mathematics; Monomial ideal; Counterexample; Partition (number theory); Combinatorics; Simplicial complex; Ideal (ethics); Polynomial; Mathematical analysis; Polynomial ring","score_opus":0.046837311544493755,"score_gpt":0.32627805932824433,"score_spread":0.27944074778375055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033569001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058858946,0.0000046673986,0.9175088,0.0049288757,0.000062258245,0.00061331334,0.000029915926,0.00022019215,0.017773053],"genre_scores_gemma":[0.77428234,0.000001260674,0.22418804,0.0012535296,0.00018249605,0.00004395585,0.000008075681,0.000029683712,0.000010612665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997258,0.00005245602,0.00060354837,0.0006266821,0.0008383988,0.0006209198],"domain_scores_gemma":[0.9976059,0.0007116599,0.00018102901,0.00071870885,0.00028316767,0.00049951026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007088018,0.00030779655,0.00046532656,0.000089291054,0.0006653456,0.0003249823,0.0013612274,0.00006288724,0.00090663595],"category_scores_gemma":[0.00039385856,0.00025171135,0.00015206728,0.0010467619,0.0023500682,0.00027202265,0.0008052973,0.00027344524,0.0003270925],"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.000007985442,0.00012377872,0.000014419035,0.000076052595,0.00001559178,0.0000036995577,0.002704824,0.000019103734,0.0031629475,0.99159753,0.0018989893,0.00037506077],"study_design_scores_gemma":[0.0002235955,0.000120497905,0.00009256495,0.00002843131,0.0000309291,0.000010149245,0.00012827206,0.33614585,0.0015618586,0.66108596,0.000323401,0.00024846374],"about_ca_topic_score_codex":0.0000014051147,"about_ca_topic_score_gemma":7.1601715e-7,"teacher_disagreement_score":0.7154234,"about_ca_system_score_codex":0.000043796477,"about_ca_system_score_gemma":0.00010765679,"threshold_uncertainty_score":0.9999935},"labels":[],"label_agreement":null},{"id":"W3035941941","doi":"10.46298/dmtcs.6367","title":"A noncommutative geometric LR rule","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Noncommutative geometry; Mathematics; Grassmannian; Variety (cybernetics); Pure mathematics; Geometric mean; Combinatorics; Algebra over a field; Geometry; Statistics","score_opus":0.030566037867974342,"score_gpt":0.31249203804469866,"score_spread":0.2819260001767243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035941941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03066589,0.000024913285,0.9519251,0.0013315872,0.0003776141,0.0006808348,0.00001538882,0.00049922394,0.014479461],"genre_scores_gemma":[0.5350234,0.000002917963,0.46435878,0.00034107332,0.000182173,0.000024654135,0.0000015520134,0.00005493732,0.000010505126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995214,0.00013410846,0.0010020722,0.0009007861,0.0017369568,0.0010120968],"domain_scores_gemma":[0.9946311,0.0025556495,0.00042422005,0.0011383508,0.00044929291,0.0008013535],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015941809,0.00055185903,0.0008988539,0.00029896531,0.00053899834,0.00039317302,0.0024541055,0.00012686916,0.00029603267],"category_scores_gemma":[0.0045205154,0.0004450787,0.00024344784,0.003238583,0.0028987632,0.00054576225,0.0015386099,0.0005695155,0.00033115366],"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.000014389956,0.00021092851,0.0000065062627,0.00023246295,0.000026341471,0.000022510627,0.0047415597,0.000027591146,0.00042308433,0.99290085,0.00020586656,0.0011879],"study_design_scores_gemma":[0.0004929619,0.00030364475,0.0000057457414,0.000105384184,0.00005611946,0.00002834213,0.00034434264,0.16573696,0.0036792443,0.82869303,0.00006914899,0.00048508163],"about_ca_topic_score_codex":6.1897754e-7,"about_ca_topic_score_gemma":1.3075365e-7,"teacher_disagreement_score":0.5043575,"about_ca_system_score_codex":0.00012084626,"about_ca_system_score_gemma":0.00015196361,"threshold_uncertainty_score":0.99981475},"labels":[],"label_agreement":null},{"id":"W3042919926","doi":"10.46298/dmtcs.6700","title":"Further results on Hendry's Conjecture","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","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; Dawson College; Université de Montréal; Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Montréal; Sharif University of Technology","keywords":"Conjecture; Mathematics; Chordal graph; Combinatorics; Intersection (aeronautics); Collatz conjecture; Graph; Hamiltonian (control theory); Hamiltonian path; Point (geometry); Interval graph; Discrete mathematics; Geometry; 1-planar graph; Mathematical optimization","score_opus":0.017748012630023367,"score_gpt":0.2910877435517327,"score_spread":0.2733397309217094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042919926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007088707,0.000023891254,0.9694947,0.0043101194,0.00059944624,0.00048917666,0.000033610744,0.00036114012,0.01759918],"genre_scores_gemma":[0.80342996,0.0000018033656,0.1955104,0.0008174187,0.00007245621,0.000054228356,0.0000034640002,0.000026074877,0.00008416962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942195,0.00036586268,0.00054482225,0.0013023482,0.0024800287,0.0010874592],"domain_scores_gemma":[0.99585515,0.0010324913,0.00018655213,0.0023633037,0.0001550025,0.00040749196],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.003910468,0.00035722464,0.00037134724,0.0004597657,0.0014221242,0.00057033385,0.006231075,0.000048304682,0.00021932849],"category_scores_gemma":[0.0003127615,0.00028542755,0.00016764287,0.0024307407,0.002669332,0.0004855083,0.004315979,0.0008078548,0.00014854436],"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.00003869497,0.000160126,0.0000022354945,0.0000114156255,0.000009102642,0.000054750813,0.0028523365,0.0017793754,0.00031192933,0.9899018,0.00016098795,0.0047172387],"study_design_scores_gemma":[0.00040726198,0.00062843825,0.000014086388,0.000019907948,0.0000034716084,0.00008742347,0.000118661235,0.3590143,0.0011056479,0.6377069,0.00058504986,0.00030883515],"about_ca_topic_score_codex":9.1312336e-7,"about_ca_topic_score_gemma":2.2083758e-7,"teacher_disagreement_score":0.7963413,"about_ca_system_score_codex":0.0001476023,"about_ca_system_score_gemma":0.000176003,"threshold_uncertainty_score":0.99995977},"labels":[],"label_agreement":null},{"id":"W3081802541","doi":"10.46298/dmtcs.6773","title":"On the existence and non-existence of improper homomorphisms of oriented and $2$-edge-coloured graphs to reflexive targets","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Convexity; Chromatic scale; Planar graph; Reflexivity; Graph; Indifference graph; Graph homomorphism","score_opus":0.018729579448650727,"score_gpt":0.29148177294934074,"score_spread":0.27275219350069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3081802541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29727986,0.00006782843,0.6997408,0.000866397,0.000116192656,0.00042592775,0.00001000461,0.000029858287,0.0014631205],"genre_scores_gemma":[0.69828606,0.000013644541,0.301439,0.00021300181,0.000007547727,0.000016748076,4.84065e-7,0.000010085198,0.000013464654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966676,0.00018945115,0.00053671555,0.00089439645,0.0011261207,0.00058568746],"domain_scores_gemma":[0.9958903,0.0013373841,0.00020199027,0.0014616842,0.0007569411,0.00035165282],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0021652523,0.00027757365,0.00048538388,0.00023640112,0.00037177635,0.00018682769,0.001989907,0.000061532905,0.000018774226],"category_scores_gemma":[0.00092194957,0.00017673588,0.00008896154,0.0020981259,0.0060594436,0.00033328493,0.002390825,0.00028060313,0.000006184756],"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.000024530433,0.00009560342,0.000018791368,0.000074744385,0.000012798826,0.000021540545,0.0028780336,0.000014704904,0.01131501,0.98418653,0.0000071600625,0.0013505706],"study_design_scores_gemma":[0.00022688934,0.0006166189,0.00031855603,0.0002542525,0.000010052613,0.000056562138,0.0002358876,0.10737086,0.05073889,0.8399435,0.0000056032377,0.00022228555],"about_ca_topic_score_codex":0.0000015458022,"about_ca_topic_score_gemma":6.98675e-7,"teacher_disagreement_score":0.4010062,"about_ca_system_score_codex":0.000023256089,"about_ca_system_score_gemma":0.00014443677,"threshold_uncertainty_score":0.9966455},"labels":[],"label_agreement":null},{"id":"W3088175442","doi":"10.46298/dmtcs.6411","title":"Staircase diagrams and the enumeration of smooth Schubert varieties","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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 Waterloo","funders":"","keywords":"Enumeration; Mathematics; Bijection; Schubert polynomial; Combinatorics; Type (biology); Schubert calculus; Pure mathematics; Biology","score_opus":0.01972300270078232,"score_gpt":0.27747858626868654,"score_spread":0.25775558356790423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088175442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054026756,0.000043646483,0.9408044,0.0021998957,0.00018026457,0.00070212106,0.0000064459996,0.00012119208,0.0019152454],"genre_scores_gemma":[0.74907625,0.000010335849,0.25057566,0.00019487998,0.00009042014,0.000020677893,8.0769513e-7,0.000026553105,0.0000044235876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997173,0.00015998511,0.0007817609,0.0004571628,0.0010068822,0.00042118915],"domain_scores_gemma":[0.9958018,0.0025567578,0.00036630066,0.00072246545,0.00029478892,0.0002579027],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018945595,0.00030773054,0.00064666575,0.00006541327,0.00036694686,0.00025284168,0.0009756453,0.00007488606,0.000042575426],"category_scores_gemma":[0.0030960173,0.00019027558,0.00012424582,0.00065930764,0.006237941,0.00032241942,0.0007853025,0.00028561748,0.000009319869],"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.000042542524,0.0000761489,0.0000056321655,0.0002817629,0.000018530232,0.0000029467815,0.008818554,0.000015622232,0.0002630808,0.98953265,0.000032410513,0.0009100924],"study_design_scores_gemma":[0.00067741814,0.00012787664,0.000004169474,0.00006309644,0.000056613328,0.000010541759,0.00035026524,0.24780706,0.0018031093,0.74890655,0.000016516406,0.00017678767],"about_ca_topic_score_codex":0.0000012987041,"about_ca_topic_score_gemma":3.1640153e-7,"teacher_disagreement_score":0.69504946,"about_ca_system_score_codex":0.00002443616,"about_ca_system_score_gemma":0.0000770267,"threshold_uncertainty_score":0.9964665},"labels":[],"label_agreement":null},{"id":"W3096500228","doi":"10.46298/dmtcs.6915","title":"Graphs containing finite induced paths of unbounded length","year":2022,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","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":"Royal Military College of Canada; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Lyon; Agence Nationale de la Recherche; Canadian Defence Academy","keywords":"Antichain; Mathematics; Combinatorics; Lexicographical order; Induced subgraph; Comparability graph; Pairwise comparison; Discrete mathematics; Graph; Finite set; Path (computing); Partially ordered set; Pathwidth; Line graph; Computer science","score_opus":0.023524839367688503,"score_gpt":0.27372617276941025,"score_spread":0.25020133340172174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096500228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089423016,0.000077686556,0.90168804,0.00029807293,0.0015958118,0.0006413512,0.000042996777,0.0004128567,0.005820145],"genre_scores_gemma":[0.7513931,0.000011757118,0.24816655,0.00025294887,0.000060966522,0.000056930654,0.000012617464,0.00003750616,0.000007668231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932641,0.00037656943,0.0013381606,0.0017337723,0.002231784,0.0010556238],"domain_scores_gemma":[0.993167,0.0016455081,0.00093353185,0.0035053801,0.0003557123,0.00039287715],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0049170004,0.0007165667,0.001163291,0.0006980112,0.00069312647,0.0010506953,0.009588621,0.0002402908,0.00020568683],"category_scores_gemma":[0.00047896992,0.0006196654,0.00047254073,0.0016747253,0.0028628383,0.0005329852,0.015877511,0.0013473834,0.000018633835],"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.000008837,0.0001761801,0.000012077868,0.00021104707,0.000044450146,0.00003147529,0.0061925333,0.0005365479,0.00046360763,0.98720616,0.000010528353,0.0051065423],"study_design_scores_gemma":[0.00017975406,0.00023725007,0.000030287541,0.00021832532,0.000024058863,0.000015205858,0.00023306368,0.46140638,0.0010340838,0.53617144,0.000011299555,0.00043887747],"about_ca_topic_score_codex":0.00001175375,"about_ca_topic_score_gemma":5.506821e-7,"teacher_disagreement_score":0.66197,"about_ca_system_score_codex":0.00013699707,"about_ca_system_score_gemma":0.0006272637,"threshold_uncertainty_score":0.9999863},"labels":[],"label_agreement":null},{"id":"W3129089473","doi":"10.46298/dmtcs.7158","title":"Domination in Kn\\\"odel Graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Concordia University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Dominating set; Graph; Upper and lower bounds; Discrete mathematics; Domination analysis; Vertex (graph theory)","score_opus":0.016350692049110136,"score_gpt":0.29461141545501224,"score_spread":0.2782607234059021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129089473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03282952,0.00003032099,0.96024024,0.0009199096,0.00031264676,0.00042669228,0.0000049772448,0.00016455645,0.005071149],"genre_scores_gemma":[0.7383382,0.0000028984482,0.26132202,0.00020535193,0.000015888174,0.00008029357,0.0000016137916,0.000013955446,0.00001982438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954167,0.00031409267,0.00051876856,0.0009438193,0.0018919325,0.00091469166],"domain_scores_gemma":[0.99751127,0.00059388473,0.00013519304,0.0013534555,0.00015394289,0.00025227526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047570406,0.00024950926,0.0003150709,0.00086260954,0.00087926287,0.00041129076,0.004960365,0.0000358295,0.00013052729],"category_scores_gemma":[0.00020172636,0.00022541355,0.000115854695,0.0040941495,0.0020702763,0.0009247632,0.0041095545,0.00056136464,0.000038027116],"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.000008154749,0.00015393876,0.00003710501,0.000015522168,0.0000028706586,0.000029735225,0.002088754,0.0013416635,0.0005552004,0.9897216,0.000016011152,0.006029427],"study_design_scores_gemma":[0.00019094955,0.00009059598,0.0000651363,0.000011250827,0.0000013272512,0.00003301528,0.00008315293,0.47571185,0.00033336546,0.5232888,0.000028314253,0.00016224026],"about_ca_topic_score_codex":0.0000020646605,"about_ca_topic_score_gemma":8.7612216e-7,"teacher_disagreement_score":0.70550865,"about_ca_system_score_codex":0.00017402311,"about_ca_system_score_gemma":0.00015645238,"threshold_uncertainty_score":0.92176753},"labels":[],"label_agreement":null},{"id":"W3157433688","doi":"10.46298/dmtcs.8729","title":"Makespan Trade-offs for Visiting Triangle Edges","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Scheduling and Optimization Algorithms","field":"Engineering","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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","score_opus":0.01200064964833383,"score_gpt":0.25756470903106093,"score_spread":0.2455640593827271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157433688","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035089157,0.000055147455,0.9880272,0.0005062028,0.0005755419,0.0002594884,0.0000073170704,0.00034152926,0.006718643],"genre_scores_gemma":[0.43573108,0.0000027229728,0.56399584,0.000123221,0.00008811331,0.000019049836,0.0000029787193,0.000015410023,0.000021587244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987577,0.000016545502,0.0003243619,0.00027424068,0.0002422965,0.00038483262],"domain_scores_gemma":[0.9990453,0.0004272839,0.00003244933,0.00032178863,0.00006258467,0.0001105878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079674943,0.00016923295,0.0002482209,0.00016594747,0.0002592998,0.00029145868,0.0005345688,0.00005766145,0.000025380587],"category_scores_gemma":[0.00018982025,0.00014407773,0.000096772106,0.0006092688,0.0005614249,0.00011884069,0.00009244023,0.00011583501,0.000009482783],"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.000002228866,0.000022330245,0.0000031778627,0.00012021297,0.0000137748975,7.8130523e-7,0.00057236437,0.009859803,0.00024478577,0.9748295,0.00009477817,0.014236285],"study_design_scores_gemma":[0.00026032954,0.000027297485,0.000012955814,0.00011075804,0.000018874276,0.0000029794649,0.00011201965,0.9033693,0.004451147,0.09139927,0.00007628157,0.00015879463],"about_ca_topic_score_codex":1.0321014e-7,"about_ca_topic_score_gemma":7.186243e-8,"teacher_disagreement_score":0.8935095,"about_ca_system_score_codex":0.000035595815,"about_ca_system_score_gemma":0.00003703383,"threshold_uncertainty_score":0.5875319},"labels":[],"label_agreement":null},{"id":"W3157507042","doi":"10.46298/dmtcs.6402","title":"The configuration space of a robotic arm in a tunnel of width 2","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"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":"Austrian Science Fund; York University; Universidad del Valle; National Science Foundation; Government of Canada; San Francisco State University","keywords":"Configuration space; Robotic arm; Position (finance); Space (punctuation); Mathematics; Motion (physics); Robot; Property (philosophy); Geometry; Topology (electrical circuits); Combinatorics; Artificial intelligence; Computer science; Physics","score_opus":0.01749619517794802,"score_gpt":0.2652316864787973,"score_spread":0.2477354913008493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157507042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003889525,0.00003424585,0.9881666,0.002424991,0.000055582437,0.00023684787,9.4649243e-7,0.0000950738,0.005096218],"genre_scores_gemma":[0.66648597,0.0000031728944,0.33340964,0.00007925929,0.000008872466,0.0000050947656,1.9826349e-7,0.00000557766,0.0000022481863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789953,0.000058441627,0.0005821331,0.00039971553,0.0007232355,0.00033691936],"domain_scores_gemma":[0.99820364,0.0004754881,0.00027820846,0.0006507213,0.00025773837,0.00013420336],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011428951,0.00016269392,0.00031354264,0.00010201543,0.00010824306,0.00040828384,0.0027188195,0.00003557373,0.0000036118618],"category_scores_gemma":[0.0006061415,0.00010915319,0.00007092296,0.0013977347,0.00274328,0.0006997889,0.0008907321,0.0001457839,0.000005449723],"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.0000045540482,0.000070397175,0.00000897036,0.00007893161,0.0000029012058,0.0000028266393,0.0027140595,0.00012644062,0.004056459,0.9888151,0.0000102767235,0.004109074],"study_design_scores_gemma":[0.000071756665,0.00015304035,0.000026995413,0.00010151954,0.0000027933088,0.0000042630854,0.000041145402,0.5573185,0.033550467,0.40864244,0.0000031246627,0.00008395388],"about_ca_topic_score_codex":0.000001572402,"about_ca_topic_score_gemma":4.4795846e-7,"teacher_disagreement_score":0.6625964,"about_ca_system_score_codex":0.00001979643,"about_ca_system_score_gemma":0.00014272962,"threshold_uncertainty_score":0.9999707},"labels":[],"label_agreement":null},{"id":"W3157628167","doi":"10.46298/dmtcs.7437","title":"On the Boolean dimension of a graph and other related parameters","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"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 Calgary","funders":"Université de Lyon; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Université Claude Bernard Lyon 1; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Discrete mathematics; Graph; Dimension (graph theory); Two-element Boolean algebra; Boolean expression; Boolean algebras canonically defined; Boolean function; Algebra over a field; Pure mathematics","score_opus":0.017964657912783323,"score_gpt":0.2741195652994549,"score_spread":0.25615490738667157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157628167","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.24993506,0.000030214518,0.7458303,0.0012757708,0.00015231485,0.00042556695,0.0000066672724,0.000087855835,0.002256254],"genre_scores_gemma":[0.90928525,0.0000018278772,0.090121426,0.0005340631,0.0000040799578,0.00002749533,2.9446775e-7,0.000014458737,0.000011134967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99679524,0.00036222689,0.00039099657,0.00062327227,0.00132619,0.0005020835],"domain_scores_gemma":[0.9965579,0.0017213882,0.00017132897,0.0012988405,0.00008398039,0.00016656815],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0035720433,0.00020222265,0.00025830386,0.0002888877,0.0008770905,0.00017602392,0.0026856582,0.000027429753,0.000074271455],"category_scores_gemma":[0.00025039655,0.00012902165,0.00010144933,0.001707781,0.004202985,0.0002083565,0.0025898647,0.00042202248,0.000009426863],"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.0000120719305,0.00007773899,0.000011556784,0.000011024054,0.0000103743005,0.000005465068,0.0021857778,0.00061727344,0.0007679205,0.99513805,0.000020887197,0.0011418342],"study_design_scores_gemma":[0.000118517164,0.0003111458,0.000015191665,0.000025367526,0.0000038570465,0.000030680414,0.000118316915,0.33801112,0.001257749,0.65998065,0.0000112135285,0.000116195704],"about_ca_topic_score_codex":0.0000013975883,"about_ca_topic_score_gemma":9.702389e-8,"teacher_disagreement_score":0.65935016,"about_ca_system_score_codex":0.000032244992,"about_ca_system_score_gemma":0.000049427388,"threshold_uncertainty_score":0.998507},"labels":[],"label_agreement":null},{"id":"W3159348138","doi":"10.46298/dmtcs.7458","title":"Separating layered treewidth and row treewidth","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"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 Ottawa; Carleton University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Treewidth; Partial k-tree; Combinatorics; Mathematics; Tree-depth; 1-planar graph; Bounded function; Clique-sum; Tree decomposition; Pathwidth; Discrete mathematics; Graph; Chordal graph; Line graph","score_opus":0.019348290710912194,"score_gpt":0.29801633726400634,"score_spread":0.27866804655309413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159348138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029592365,0.00007993883,0.96157277,0.0009821446,0.00024329207,0.00039835286,0.000010220603,0.00026918802,0.006851702],"genre_scores_gemma":[0.6776737,0.0000034916745,0.32189396,0.00026564274,0.000038564103,0.000049670853,0.0000014740657,0.000018868705,0.00005462014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99520683,0.00032515175,0.0005070316,0.0011503294,0.0017670733,0.0010435646],"domain_scores_gemma":[0.9969697,0.0007971253,0.00017471598,0.0014506188,0.00014922494,0.00045860378],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0034504952,0.00033522793,0.00041299048,0.00039015833,0.0019173827,0.0008056661,0.0039482974,0.000039681014,0.00014965606],"category_scores_gemma":[0.00021566222,0.0002879916,0.00011308837,0.002181513,0.0027362315,0.00088429527,0.0058315643,0.00055240234,0.000023846167],"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.000008780686,0.000089046574,0.000038283342,0.000022236904,0.000009696861,0.000029631648,0.0028313375,0.0005957239,0.0010716005,0.98589325,0.000038838698,0.009371583],"study_design_scores_gemma":[0.00022009927,0.00024179593,0.000042213545,0.000014156331,0.000003508432,0.00011200221,0.00016356689,0.53142244,0.0005570716,0.46686843,0.0001072732,0.00024744202],"about_ca_topic_score_codex":0.0000018422236,"about_ca_topic_score_gemma":7.046898e-7,"teacher_disagreement_score":0.64808136,"about_ca_system_score_codex":0.00010012912,"about_ca_system_score_gemma":0.0001553652,"threshold_uncertainty_score":0.99997777},"labels":[],"label_agreement":null},{"id":"W3162098251","doi":"10.46298/dmtcs.2816","title":"The Frobenius Complex","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Commutative Algebra and Its Applications","field":"Mathematics","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":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Partially ordered set; Lambda; Homotopy; Order (exchange); Physics; Pure mathematics","score_opus":0.02855633506720398,"score_gpt":0.32078643269534185,"score_spread":0.2922300976281379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162098251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12668942,0.0000086772,0.83562064,0.003147805,0.00037630292,0.00055921986,0.000010484137,0.00022266833,0.033364814],"genre_scores_gemma":[0.7141765,0.0000022207587,0.28548157,0.00012930304,0.000115453506,0.000033044867,0.0000013845871,0.000020922595,0.000039628332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769247,0.000059666207,0.00048738223,0.0004208453,0.00074779417,0.00059187016],"domain_scores_gemma":[0.9951513,0.0026870556,0.00016338674,0.0014587974,0.00028852574,0.00025097225],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0019728474,0.00024192066,0.0002629695,0.00007386664,0.0016647046,0.00060067646,0.002140302,0.000058807487,0.00034699138],"category_scores_gemma":[0.00081005425,0.00014343575,0.00012361679,0.0006384685,0.0059290375,0.00017309115,0.0007860925,0.00048152113,0.0001479644],"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.0000026175308,0.000070677925,0.0000088832985,0.000012361299,0.000008960164,9.500161e-7,0.0007928471,5.5736973e-7,0.0042952537,0.99107176,0.00058585225,0.0031492526],"study_design_scores_gemma":[0.00012543051,0.00004048208,0.0001925054,0.000013013125,0.000019629404,0.000027933034,0.00010746134,0.10816473,0.0013244319,0.8885043,0.0012823358,0.00019771469],"about_ca_topic_score_codex":0.000001295218,"about_ca_topic_score_gemma":0.000010141692,"teacher_disagreement_score":0.58748704,"about_ca_system_score_codex":0.000019488258,"about_ca_system_score_gemma":0.00007842073,"threshold_uncertainty_score":0.999635},"labels":[],"label_agreement":null},{"id":"W3164421671","doi":"10.46298/dmtcs.7515","title":"Leaf multiplicity in a Bienaym\\'e-Galton-Watson tree","year":2022,"lang":"en","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","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":"McGill University","funders":"","keywords":"Multiplicity (mathematics); Mathematics; Combinatorics; Tree (set theory); Discrete mathematics; Mathematical analysis","score_opus":0.03684927566698827,"score_gpt":0.32574237850358706,"score_spread":0.2888931028365988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164421671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018482821,0.00005485069,0.9714375,0.00046581856,0.0009818078,0.0012729268,0.00015308126,0.00026096706,0.0068901875],"genre_scores_gemma":[0.517249,0.000013036435,0.48210406,0.00015301646,0.00013635661,0.00021254351,0.000015623738,0.00007994305,0.000036422596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99287564,0.00020368975,0.0014849255,0.0017784346,0.002282087,0.0013752169],"domain_scores_gemma":[0.9936547,0.003037119,0.0005412082,0.0019756847,0.00028479396,0.00050648436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037343837,0.0008339349,0.0013872109,0.0005438813,0.0005116969,0.0005322646,0.0035232685,0.00031667482,0.00071067776],"category_scores_gemma":[0.0037263576,0.00070566894,0.00031928462,0.0012321027,0.002123396,0.0001645647,0.0074069635,0.0019696704,0.00004030306],"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.000029451081,0.00047449334,0.000007615559,0.0009587772,0.000021636173,0.00006463771,0.002775601,0.00022832482,0.000062995445,0.99246633,0.00008038895,0.002829773],"study_design_scores_gemma":[0.0002610511,0.000134495,0.000013348743,0.00032341896,0.00004510898,0.000017515895,0.00015588604,0.45338437,0.00011077036,0.5450664,0.000018385532,0.0004692396],"about_ca_topic_score_codex":0.000015465372,"about_ca_topic_score_gemma":0.000013908273,"teacher_disagreement_score":0.49876615,"about_ca_system_score_codex":0.00038555195,"about_ca_system_score_gemma":0.0004693283,"threshold_uncertainty_score":0.99953943},"labels":[],"label_agreement":null},{"id":"W3186837486","doi":"10.46298/dmtcs.10296","title":"The Variance and the Asymptotic Distribution of the Length of Longest $k$-alternating Subsequences","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Random Matrices and Applications","field":"Mathematics","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":"Queen's University","funders":"","keywords":"Mathematics; Longest increasing subsequence; Permutation (music); Random permutation; Combinatorics; Subsequence; Statistic; Variance (accounting); Limit (mathematics); Distribution (mathematics); Statistics; Symmetric group; Mathematical analysis; Bounded function","score_opus":0.018049983104820817,"score_gpt":0.28833385507581816,"score_spread":0.27028387197099735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186837486","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.712017,0.000075922115,0.28159502,0.003937052,0.00019978477,0.0008008286,0.000027007723,0.000056123008,0.0012912576],"genre_scores_gemma":[0.9928295,0.000057586243,0.0069913156,0.000016478467,0.00004444041,0.000029443796,9.4915555e-7,0.000009025909,0.00002127306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810106,0.00014103875,0.0005414363,0.00023266199,0.0006883798,0.00029545405],"domain_scores_gemma":[0.99395823,0.004674627,0.00040139348,0.0007420537,0.00017197261,0.00005172644],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0038727985,0.00013769799,0.00026833266,0.000028287895,0.0007775407,0.0001663322,0.0013928177,0.000031196185,0.0000038717517],"category_scores_gemma":[0.001163477,0.000056912322,0.00011036506,0.0010339787,0.0068584783,0.00009331567,0.0005791598,0.00014984519,0.0000033038657],"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.000007955085,0.00001890191,0.00005656592,0.000071221104,0.000012173511,1.9718571e-7,0.0011602946,0.000038727983,0.0001255446,0.99787945,0.000024381141,0.00060457055],"study_design_scores_gemma":[0.00028080062,0.00001851224,0.0006573233,0.000092930706,0.000038735405,0.0000078185285,0.00025345257,0.2598906,0.0006531835,0.73803157,0.000011573259,0.000063539155],"about_ca_topic_score_codex":0.0000061723094,"about_ca_topic_score_gemma":0.0000022112536,"teacher_disagreement_score":0.2808125,"about_ca_system_score_codex":0.000013697927,"about_ca_system_score_gemma":0.000047225734,"threshold_uncertainty_score":0.9958443},"labels":[],"label_agreement":null},{"id":"W3195158593","doi":"10.46298/dmtcs.6381","title":"Monodromy and K-theory of Schubert curves via generalized jeu de taquin","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"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":"Fonds de recherche du Québec – Nature et technologies; National Science Foundation","keywords":"Mathematics; Schubert calculus; Monodromy; Bijection; Osculating circle; Schubert polynomial; Young tableau; Combinatorics; Combinatorial proof; Skew; Moduli space; Algebraic geometry; Locus (genetics); Pure mathematics; Geometry; Grassmannian","score_opus":0.02641977658470942,"score_gpt":0.29297258782877705,"score_spread":0.26655281124406766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195158593","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07191144,0.00017495158,0.92437965,0.00093345623,0.00012935282,0.00056755857,0.000009235693,0.00018253771,0.0017118216],"genre_scores_gemma":[0.49432123,0.000036266672,0.5050778,0.0004184246,0.00007529397,0.000017715534,0.0000010647835,0.000043465654,0.000008752081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966248,0.0002190231,0.0009168539,0.0006277307,0.0009386004,0.00067295803],"domain_scores_gemma":[0.99622613,0.0017506502,0.00040190792,0.0008099072,0.00026724392,0.00054413226],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0023061314,0.00041050857,0.0008689829,0.00011485135,0.00021692117,0.00011348329,0.0012720334,0.000108353415,0.00011714982],"category_scores_gemma":[0.0025802539,0.00033453814,0.00015338672,0.00075658335,0.0031205188,0.00032026225,0.00096146116,0.00030778372,0.000015068645],"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.000025323565,0.0001286997,0.000012221727,0.0012531889,0.000029955252,0.000008092761,0.0028760761,0.000009938047,0.004123583,0.9905804,0.00010001439,0.000852516],"study_design_scores_gemma":[0.00044879405,0.00021434708,0.0000059215113,0.00046532776,0.00008743667,0.000038747075,0.00010475757,0.14935546,0.010554695,0.8383797,0.000016756765,0.0003280999],"about_ca_topic_score_codex":7.8030877e-7,"about_ca_topic_score_gemma":1.1338751e-7,"teacher_disagreement_score":0.4224098,"about_ca_system_score_codex":0.000047021484,"about_ca_system_score_gemma":0.00010767108,"threshold_uncertainty_score":0.99991065},"labels":[],"label_agreement":null},{"id":"W344896498","doi":"10.46298/dmtcs.2073","title":"Uniquely monopolar-partitionable block graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Statistics Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Beijing Postdoctoral Science Foundation","keywords":"Combinatorics; Mathematics; Chordal graph; Bipartite graph; Indifference graph; Cograph; Pathwidth; Partition (number theory); Discrete mathematics; Maximal independent set; 1-planar graph; Modular decomposition; Vertex (graph theory); Block graph; Graph; Line graph","score_opus":0.01466658074978645,"score_gpt":0.2808183078698894,"score_spread":0.266151727120103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W344896498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013217893,0.000021387059,0.9687964,0.0009611241,0.0002697321,0.00032668552,0.0000031035916,0.0004141423,0.015989577],"genre_scores_gemma":[0.58895886,0.0000040112404,0.41062933,0.00030220443,0.000033544755,0.000021800264,0.0000010687955,0.000017186123,0.000031991123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99541515,0.00025304433,0.000536499,0.0010816612,0.0015253659,0.0011882955],"domain_scores_gemma":[0.99594474,0.00081144145,0.00015210811,0.0020732754,0.00042067288,0.0005977393],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0037454152,0.00035580312,0.00040131315,0.00044290855,0.00085815875,0.0009184926,0.004785634,0.00008713604,0.00006146912],"category_scores_gemma":[0.000446397,0.00028933142,0.00016780084,0.0022863094,0.004153962,0.0012326174,0.0019624315,0.00040251316,0.00023932668],"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.0000037901416,0.0000916354,0.000023770493,0.000028585282,0.000007130392,0.0000058083106,0.00044428394,0.00021186951,0.0010265023,0.9957051,0.000053774525,0.0023977382],"study_design_scores_gemma":[0.00012937671,0.000115458766,0.000034722085,0.000033823333,0.0000037593031,0.00003134379,0.000011671984,0.42590192,0.0031835844,0.57018536,0.0001408888,0.0002280823],"about_ca_topic_score_codex":0.0000016752058,"about_ca_topic_score_gemma":5.295647e-7,"teacher_disagreement_score":0.575741,"about_ca_system_score_codex":0.00005918197,"about_ca_system_score_gemma":0.00012451413,"threshold_uncertainty_score":0.9999559},"labels":[],"label_agreement":null},{"id":"W34927876","doi":"10.46298/dmtcs.618","title":"Surjective cellular automata far from the Garden of Eden","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":8,"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":"European Regional Development Fund; Academy of Finland","keywords":"Mathematics; Surjective function; Cellular automaton; Garden of Eden; Automaton; Von Neumann architecture; Measure (data warehouse); Discrete mathematics; Dimension (graph theory); Pure mathematics; Algorithm; Theoretical computer science; Computer science","score_opus":0.011880386457423038,"score_gpt":0.23743855476493883,"score_spread":0.2255581683075158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34927876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027915046,0.000058252037,0.96120423,0.0021695553,0.0006127911,0.0007732942,0.00001339584,0.00027552235,0.0069778846],"genre_scores_gemma":[0.6158844,0.0000029246514,0.3837527,0.00019906077,0.000111862035,0.000023183655,0.00000190689,0.000014208063,0.000009741989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99531466,0.00029176543,0.0008043814,0.0011148266,0.0016548486,0.0008195264],"domain_scores_gemma":[0.9936586,0.0021963427,0.00030958996,0.0029343085,0.00058871426,0.00031245386],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0021504879,0.0004107993,0.0005831873,0.00013267001,0.00046581766,0.0009930064,0.007722107,0.000102162754,0.0002917812],"category_scores_gemma":[0.00043507834,0.00025955614,0.00023589635,0.0012949145,0.004284853,0.0008022512,0.004431124,0.00035295382,0.0002628382],"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.0000020324783,0.00018480507,0.000050374867,0.000024365478,0.000028697477,0.000006606136,0.0051149162,0.00015741168,0.0015728686,0.9823087,0.000162548,0.010386662],"study_design_scores_gemma":[0.00015044502,0.0001131031,0.00064563873,0.00004166449,0.000013313041,0.000009265443,0.00020894683,0.628412,0.0029856462,0.3671543,0.000026233613,0.00023945996],"about_ca_topic_score_codex":0.000048965696,"about_ca_topic_score_gemma":0.0000020807822,"teacher_disagreement_score":0.6282546,"about_ca_system_score_codex":0.00008041257,"about_ca_system_score_gemma":0.00018440117,"threshold_uncertainty_score":0.9999857},"labels":[],"label_agreement":null},{"id":"W372230892","doi":"10.46298/dmtcs.6351","title":"Cataland: Why the Fuss?","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":11,"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":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Coxeter group; Catalan number; Combinatorics; Generalization; Cluster algebra; Catalan; Perspective (graphical); Monoid; Algebra over a field; Pure mathematics; Humanities; Geometry","score_opus":0.026727711625889897,"score_gpt":0.2918522601424824,"score_spread":0.2651245485165925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W372230892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012332249,0.000025875079,0.96924263,0.008796039,0.0005069443,0.00075604056,0.000011114572,0.00040471103,0.007924402],"genre_scores_gemma":[0.7003594,0.000004296908,0.29689616,0.0022110995,0.00041149283,0.000035523477,0.0000019070383,0.00006507197,0.000015035242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99599606,0.00012079006,0.0007931672,0.00072788965,0.0015135955,0.00084848417],"domain_scores_gemma":[0.99489594,0.0026271702,0.00031095376,0.0013698281,0.0002735693,0.0005225141],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016116567,0.0004524265,0.0005995619,0.00007823378,0.0006986017,0.00046532045,0.002876864,0.00009515679,0.00019482576],"category_scores_gemma":[0.0032438366,0.00027629125,0.00020343166,0.0012147157,0.0034762186,0.0003819159,0.001345283,0.0005048605,0.00019623635],"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.000009806098,0.00009353986,0.0000038537137,0.00014141883,0.00001783459,0.000010786759,0.0049987477,0.000016516182,0.00030015182,0.99267375,0.0012999466,0.00043364294],"study_design_scores_gemma":[0.00029266105,0.0001557206,0.0000024692677,0.0000731331,0.000051708437,0.000034673336,0.00028940165,0.1511563,0.0016830256,0.84537506,0.0005429458,0.00034291708],"about_ca_topic_score_codex":8.708767e-7,"about_ca_topic_score_gemma":4.3952582e-7,"teacher_disagreement_score":0.68802714,"about_ca_system_score_codex":0.00005768051,"about_ca_system_score_gemma":0.00010580249,"threshold_uncertainty_score":0.99996895},"labels":[],"label_agreement":null},{"id":"W4212769937","doi":"10.46298/dmtcs.639","title":"List circular backbone colouring","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Pacific Institute for the Mathematical Sciences","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Chromatic scale; Bounded function; Graph; Discrete mathematics","score_opus":0.010712726340983204,"score_gpt":0.2351696714341264,"score_spread":0.2244569450931432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212769937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03472332,0.000029075936,0.9547432,0.0011237842,0.000510944,0.00018139774,8.51236e-7,0.00038565125,0.00830176],"genre_scores_gemma":[0.6243374,0.0000018000798,0.37514672,0.00045923304,0.000024091663,0.0000065425556,6.14535e-7,0.0000116718065,0.000011947661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655545,0.00011564404,0.0005163363,0.000904867,0.0011067053,0.0008010161],"domain_scores_gemma":[0.9971581,0.00037539945,0.00015345417,0.0016020875,0.00026181887,0.00044912475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031198491,0.00029182693,0.0003690121,0.00024595673,0.00066160224,0.00096547883,0.0029509736,0.00007595677,0.000041972096],"category_scores_gemma":[0.0002856081,0.00023057399,0.0001376912,0.0012623701,0.00229887,0.0005312877,0.0014265525,0.00025084638,0.00018080225],"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":[9.4884297e-7,0.00007050846,0.00001750517,0.000035929443,0.0000056243243,0.0000053333656,0.00059153617,0.00013671294,0.002567143,0.99447215,0.000054179232,0.0020424323],"study_design_scores_gemma":[0.00014058073,0.00008051968,0.000028224611,0.000057593057,0.0000057647435,0.000029944884,0.0000075750304,0.51365215,0.0016185369,0.48408374,0.00009277238,0.00020259863],"about_ca_topic_score_codex":0.0000028546333,"about_ca_topic_score_gemma":2.749738e-7,"teacher_disagreement_score":0.5896141,"about_ca_system_score_codex":0.000032384345,"about_ca_system_score_gemma":0.000072357056,"threshold_uncertainty_score":0.94025344},"labels":[],"label_agreement":null},{"id":"W4214806699","doi":"10.46298/dmtcs.3402","title":"Improper colouring of (random) unit disk graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"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":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Conseil Régional Provence-Alpes-Côte d'Azur; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Commonwealth Scholarship Commission","keywords":"Combinatorics; Chromatic scale; Unit disk graph; Mathematics; Unit disk; Clique number; Graph; Induced subgraph; Random graph; Unit (ring theory); Discrete mathematics; Computer science; Vertex (graph theory)","score_opus":0.01955281987293713,"score_gpt":0.28368061165432396,"score_spread":0.26412779178138684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214806699","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.6611561,0.000043636737,0.32246223,0.00020253916,0.00027528434,0.00044583288,0.000013090977,0.00013187343,0.01526941],"genre_scores_gemma":[0.7539969,0.0000073164574,0.24575642,0.00008316565,0.00008964361,0.000009103761,7.378692e-7,0.000027749333,0.000028975026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99699926,0.000109730434,0.00078673835,0.000499651,0.00096004806,0.00064458523],"domain_scores_gemma":[0.9971951,0.0009836224,0.00027112218,0.0010293231,0.0002645294,0.00025629287],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0022499105,0.00033255733,0.00058700994,0.00025397568,0.00055792567,0.00012766599,0.0015214062,0.00010151633,0.0002735938],"category_scores_gemma":[0.0004894086,0.00022157318,0.00024348998,0.0007282902,0.0045624217,0.0002888027,0.0009070272,0.00029475382,0.000013394353],"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.00002709964,0.00012237339,0.000066266235,0.00012833436,0.000027213084,0.0000027143099,0.0030520367,0.000029835212,0.00086424284,0.9935383,0.000031756186,0.002109825],"study_design_scores_gemma":[0.0005568913,0.000108505184,0.0000810846,0.00013328662,0.000059576305,0.000030004416,0.00012796378,0.07298857,0.00687838,0.918681,0.000055148525,0.0002995819],"about_ca_topic_score_codex":0.0000011053386,"about_ca_topic_score_gemma":0.0000010039544,"teacher_disagreement_score":0.0928408,"about_ca_system_score_codex":0.000026619673,"about_ca_system_score_gemma":0.000055895845,"threshold_uncertainty_score":0.9981466},"labels":[],"label_agreement":null},{"id":"W4255048748","doi":"10.46298/dmtcs.2910","title":"The topology of restricted partition posets","year":2011,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"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":"National Science Foundation","keywords":"Mathematics; Combinatorics; Partition (number theory); Homotopy; Homology (biology); Symmetric group; Pure mathematics; Chemistry","score_opus":0.029988247147105088,"score_gpt":0.29552969945726004,"score_spread":0.26554145231015497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255048748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03601964,0.0006196551,0.92631614,0.0014405058,0.005037874,0.0012116269,0.00003879778,0.00017671965,0.029139029],"genre_scores_gemma":[0.59042144,0.0001287213,0.40885824,0.00005277081,0.00021617595,0.000033617904,0.000001918129,0.000065365595,0.00022176844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99431604,0.00039693504,0.0017828465,0.00072322553,0.001403702,0.0013772551],"domain_scores_gemma":[0.9918902,0.0036588379,0.0010040487,0.002139564,0.00087652757,0.00043085028],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0029394736,0.0005698818,0.00088616984,0.00020083756,0.0009068954,0.00020741652,0.0027149073,0.00029407162,0.00042048516],"category_scores_gemma":[0.0031244464,0.00041063386,0.00029511977,0.001511296,0.016314013,0.00047046095,0.001337689,0.0006013352,0.00015199209],"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.000039746752,0.0006515115,0.000008698115,0.00044019523,0.000058507954,0.000019425099,0.006726108,0.000005693441,0.00035871362,0.9883662,0.0001824072,0.003142795],"study_design_scores_gemma":[0.000401701,0.0006407197,0.0000391195,0.00053312903,0.00017978202,0.00009736901,0.00059155707,0.07063816,0.008091336,0.9181778,0.000190116,0.0004192245],"about_ca_topic_score_codex":0.000010112628,"about_ca_topic_score_gemma":0.0000036728393,"teacher_disagreement_score":0.55440176,"about_ca_system_score_codex":0.00014852743,"about_ca_system_score_gemma":0.0002866455,"threshold_uncertainty_score":0.99983454},"labels":[],"label_agreement":null},{"id":"W4280516049","doi":"10.46298/dmtcs.9557","title":"Series acceleration formulas obtained from experimentally discovered hypergeometric recursions","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":5,"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":"Mathematics; Ramanujan's sum; Hypergeometric function; Series (stratigraphy); Catalan number; Dirichlet series; Generating function; Type (biology); Dirichlet distribution; Hypergeometric distribution; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.03822131541635377,"score_gpt":0.32477095865951594,"score_spread":0.2865496432431622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280516049","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.32646155,0.000026459338,0.6613747,0.00065877766,0.00058965303,0.0007883492,0.000087090324,0.00080510176,0.009208341],"genre_scores_gemma":[0.6810927,0.000017423923,0.31816292,0.000055497017,0.00015075527,0.00006614425,0.000036424542,0.000063596206,0.00035458818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995687,0.00008789189,0.0009190551,0.00081642106,0.0015333466,0.00095627265],"domain_scores_gemma":[0.9959949,0.0019405439,0.00026947632,0.0011790197,0.00024830157,0.0003677372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012065548,0.00046841527,0.00065909646,0.0005721081,0.0008211844,0.0007145107,0.0014094653,0.00012206323,0.00049599644],"category_scores_gemma":[0.0021562635,0.00037203138,0.00021591528,0.0028079783,0.0022823806,0.0014859581,0.0012508123,0.00023711238,0.00034133426],"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.000015916134,0.00015828315,0.000009443703,0.0000912015,0.000027799135,0.000014906795,0.0030052217,0.00003290581,0.0043798,0.9915357,0.00049229147,0.00023651731],"study_design_scores_gemma":[0.00031988122,0.00013756243,0.00004623131,0.00017682789,0.00004896081,0.000015428845,0.0013327334,0.08189445,0.013439372,0.9021153,0.000030514255,0.00044274208],"about_ca_topic_score_codex":0.000003392501,"about_ca_topic_score_gemma":0.0000030504998,"teacher_disagreement_score":0.3546311,"about_ca_system_score_codex":0.00014845864,"about_ca_system_score_gemma":0.00009921007,"threshold_uncertainty_score":0.99987316},"labels":[],"label_agreement":null},{"id":"W4281744548","doi":"10.46298/dmtcs.9399","title":"Gossiping with interference in radio ring networks","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Petri Nets in System Modeling","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 the Fraser Valley","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Gossip; Node (physics); Computer network; Ring network; Message passing; Upper and lower bounds; Ring (chemistry); Communication source; Distributed computing; Mathematics; Network topology","score_opus":0.020888612373302078,"score_gpt":0.26413598649820597,"score_spread":0.24324737412490388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281744548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03228082,0.000027874154,0.9629931,0.00028926428,0.00043913838,0.00027234398,6.825418e-7,0.0005233397,0.0031734726],"genre_scores_gemma":[0.75056946,0.000006311081,0.24923453,0.00007181046,0.00006908324,0.000021381915,6.7772413e-7,0.000018121345,0.000008622994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99615514,0.0001107797,0.0006364482,0.0010347053,0.0009379111,0.0011250423],"domain_scores_gemma":[0.9974264,0.0006175659,0.0001606651,0.0013761829,0.00014365184,0.00027555146],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0032913124,0.0003292819,0.0004466703,0.00062151323,0.00035058698,0.0010410405,0.0039953445,0.00007761222,0.000008151628],"category_scores_gemma":[0.00014791933,0.0002490242,0.00006964235,0.0049295872,0.0013592698,0.00096734054,0.0020747555,0.00040698255,0.00007392857],"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.0000040552527,0.000027293378,0.00014503956,0.00004313089,0.0000056538165,0.00006985904,0.0026709405,0.03825137,0.000107221815,0.9540017,0.000009787039,0.004663921],"study_design_scores_gemma":[0.00023966776,0.00009121883,0.00017248072,0.00061695575,0.000003536776,0.00007747611,0.00008889117,0.93829596,0.0001871723,0.059881378,0.00000417448,0.00034110405],"about_ca_topic_score_codex":0.0000032647827,"about_ca_topic_score_gemma":0.0000028559443,"teacher_disagreement_score":0.90004456,"about_ca_system_score_codex":0.00012443642,"about_ca_system_score_gemma":0.00012973635,"threshold_uncertainty_score":0.9999962},"labels":[],"label_agreement":null},{"id":"W4287826244","doi":"10.23638/dmtcs-22-1-8","title":"A method for eternally dominating strong grids","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"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; Dawson College; McGill University","funders":"Université de Montréal; Mitacs","keywords":"Computer science; Mathematics; Economics","score_opus":0.02819944101800446,"score_gpt":0.3007906537627427,"score_spread":0.27259121274473824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287826244","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003823845,0.000018026469,0.9911522,0.0028775113,0.00031528543,0.0004600681,0.000009158361,0.00024439848,0.004540954],"genre_scores_gemma":[0.37372074,0.0000011504677,0.6248886,0.0011299456,0.00021746471,0.000018565092,0.0000015710764,0.000014669113,0.0000073168253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965733,0.00009150227,0.0006337696,0.00096300413,0.00090674363,0.00083162455],"domain_scores_gemma":[0.99706984,0.0010655116,0.00022519438,0.0007271866,0.0002722654,0.0006399895],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002201615,0.00032368838,0.00047915836,0.00009546739,0.0004964985,0.00095543265,0.0031980108,0.00008149183,0.000032549346],"category_scores_gemma":[0.00010040223,0.0002571495,0.00020221007,0.0007784887,0.00093329453,0.00058902445,0.0013566442,0.00027552154,0.000028267323],"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.000008754389,0.00003297675,0.0000034582147,0.000056873243,0.000010966916,0.000013483033,0.0017475598,0.000133664,0.0002264821,0.9233092,0.0001070171,0.07434955],"study_design_scores_gemma":[0.0003326613,0.0002652594,0.0000029454768,0.0000611573,0.00001815213,0.000031134186,0.000047891364,0.82524824,0.0003473918,0.17321959,0.00013398998,0.00029156526],"about_ca_topic_score_codex":8.781184e-7,"about_ca_topic_score_gemma":1.2470885e-7,"teacher_disagreement_score":0.8251146,"about_ca_system_score_codex":0.000032612654,"about_ca_system_score_gemma":0.00017311402,"threshold_uncertainty_score":0.9999881},"labels":[],"label_agreement":null},{"id":"W4292258317","doi":"10.46298/dmtcs.7660","title":"Tuza's Conjecture for Threshold Graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Deutscher Akademischer Austauschdienst; European Commission","keywords":"Clique-sum; Mathematics; Combinatorics; Treewidth; Pathwidth; Cograph; Chordal graph; Conjecture; 1-planar graph; Indifference graph; Discrete mathematics; Planar graph; Split graph; Graph; Disjoint sets; Line graph","score_opus":0.019202324987098087,"score_gpt":0.2970529105084879,"score_spread":0.27785058552138986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292258317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069844015,0.000059178463,0.9869222,0.00152167,0.0005714731,0.0008964043,0.000028827812,0.0003103272,0.0027054898],"genre_scores_gemma":[0.6267555,0.0000018649074,0.37249875,0.0004520852,0.000044052435,0.00018890359,0.000003664952,0.000023591128,0.000031635886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99527514,0.00013856623,0.00048528585,0.0011618164,0.0017628402,0.001176357],"domain_scores_gemma":[0.9965101,0.0008984138,0.00016047987,0.0018093692,0.0002327046,0.00038895657],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.0035774722,0.0003386016,0.00040692074,0.00046073878,0.002006979,0.0006307984,0.006498931,0.000048768678,0.00014350889],"category_scores_gemma":[0.00018347474,0.0002831344,0.00025478975,0.002381939,0.0029120892,0.0006298566,0.004113272,0.0005276201,0.0000205307],"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.00001407108,0.0001092644,0.000011684065,0.000033621018,0.000011607653,0.000013632625,0.0011346847,0.00087219896,0.00063472014,0.99456286,0.00014454567,0.00245712],"study_design_scores_gemma":[0.00024300507,0.00026715518,0.0000067885044,0.000009577705,0.000005056636,0.000059560927,0.000056731555,0.42078185,0.00077715906,0.57728595,0.00027338197,0.00023377624],"about_ca_topic_score_codex":5.359179e-7,"about_ca_topic_score_gemma":2.3533853e-7,"teacher_disagreement_score":0.61977106,"about_ca_system_score_codex":0.00010180914,"about_ca_system_score_gemma":0.00020099015,"threshold_uncertainty_score":0.9999621},"labels":[],"label_agreement":null},{"id":"W4292811792","doi":"10.46298/dmtcs.12812","title":"Partition algebra and Kronecker product","year":2013,"lang":"fr","type":"preprint","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"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":"Banff International Research Station for Mathematical Innovation and Discovery; Agence Nationale de la Recherche; National Science Foundation","keywords":"Kronecker product; Partition (number theory); Computer science; Kronecker delta; Algebra over a field; Mathematics; Combinatorics; Pure mathematics; Physics","score_opus":0.0252433464969743,"score_gpt":0.28784616247088246,"score_spread":0.26260281597390817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292811792","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11738343,0.0003317577,0.85553235,0.0063126716,0.00083238166,0.0033090091,0.00009929246,0.00022034053,0.015978793],"genre_scores_gemma":[0.38232225,0.00014051635,0.6159744,0.00014389523,0.00044121215,0.00033097184,0.000024049612,0.00009870478,0.0005239462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99291086,0.00020186888,0.0017924198,0.0020156966,0.0016731261,0.001406035],"domain_scores_gemma":[0.99339503,0.0012181305,0.0008878483,0.0028838702,0.0007317556,0.000883393],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0035359652,0.001080309,0.0013607658,0.00027938292,0.0010092901,0.001838292,0.0021080668,0.0003648184,0.0019310418],"category_scores_gemma":[0.00081011216,0.0008947689,0.0003120682,0.00078147114,0.009110304,0.00048475302,0.003993349,0.0010904841,0.0011569337],"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.000003233665,0.0005947112,0.000008653689,0.0017025842,0.000068255256,0.000004985306,0.00395005,0.00003500612,0.0005654801,0.98587865,0.0019230127,0.005265365],"study_design_scores_gemma":[0.00016868814,0.00007815051,0.000038542228,0.00091272546,0.00019877635,0.00007522614,0.00012879966,0.3854035,0.00081400067,0.61060655,0.00089631084,0.00067873707],"about_ca_topic_score_codex":0.000011389428,"about_ca_topic_score_gemma":0.0000020612922,"teacher_disagreement_score":0.3853685,"about_ca_system_score_codex":0.0001516464,"about_ca_system_score_gemma":0.00027299358,"threshold_uncertainty_score":0.9996208},"labels":[],"label_agreement":null},{"id":"W4301387240","doi":"10.46298/dmtcs.2317","title":"Singularity analysis via the iterated kernel method","year":2013,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Kernel (algebra); Iterated function; Singularity; Computer science; Mathematics; Applied mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.02512541658036955,"score_gpt":0.32952734175285003,"score_spread":0.3044019251724805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301387240","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008581211,0.00040020715,0.97044486,0.0065801567,0.001184421,0.0012329208,0.00003317915,0.00015265834,0.011390372],"genre_scores_gemma":[0.17610785,0.000020569594,0.82139194,0.0008391333,0.00035043512,0.00006592497,0.000007696332,0.000064993656,0.0011514667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99217916,0.0015746517,0.0014944245,0.001313584,0.0017766787,0.0016615283],"domain_scores_gemma":[0.9899818,0.004715771,0.0005807463,0.0027808493,0.0011693517,0.000771503],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.011623103,0.0008253232,0.0013947149,0.00045672056,0.0012012214,0.002203296,0.0029527328,0.00034064555,0.001808235],"category_scores_gemma":[0.0016068256,0.00053575216,0.00091142004,0.0048285685,0.007347688,0.0006494123,0.0017677441,0.00095702405,0.000034799632],"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.000005974194,0.000355285,0.00002713361,0.00029432712,0.0004894004,0.000016236914,0.005829983,0.00017933184,0.00065350335,0.96852005,0.00044085312,0.023187913],"study_design_scores_gemma":[0.00015989036,0.000085674765,0.00003810712,0.00012579423,0.0010032776,0.000051969462,0.00026142845,0.5778471,0.00067213346,0.4190885,0.00024108017,0.00042501447],"about_ca_topic_score_codex":0.0001184746,"about_ca_topic_score_gemma":0.00001201825,"teacher_disagreement_score":0.5776678,"about_ca_system_score_codex":0.00018393462,"about_ca_system_score_gemma":0.00018058067,"threshold_uncertainty_score":0.9997094},"labels":[],"label_agreement":null},{"id":"W4307260506","doi":"10.46298/dmtcs.8877","title":"Improved product structure for graphs on surfaces","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"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":"Australian Research Council; Banff International Research Station for Mathematical Innovation and Discovery; Australian Government","keywords":"Treewidth; Combinatorics; Mathematics; Planar graph; 1-planar graph; Graph; Pathwidth; Partial k-tree; Graph minor; Outerplanar graph; Discrete mathematics; Chordal graph; Line graph; Graph power","score_opus":0.016088019632851162,"score_gpt":0.29082658547601,"score_spread":0.2747385658431588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307260506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03546138,0.000030086414,0.96022946,0.0014660964,0.0006731866,0.0011811483,0.000060078302,0.0002583024,0.00064029207],"genre_scores_gemma":[0.6563263,0.0000010216112,0.3432312,0.00025667157,0.000040717496,0.00009416829,0.0000037966345,0.000021258646,0.000024862002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954731,0.00019312298,0.0004394775,0.0013256688,0.0015180388,0.001050602],"domain_scores_gemma":[0.99651766,0.0008584536,0.0001763898,0.0018719527,0.0002728825,0.00030266686],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0026735628,0.00034506354,0.00037617126,0.00040986526,0.0017638872,0.0005688724,0.005506197,0.000033757966,0.00008724207],"category_scores_gemma":[0.00032048038,0.0002740586,0.00017525458,0.0021008474,0.0022041935,0.0005403595,0.0026839655,0.00050225604,0.000007381595],"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.000029033092,0.000111263595,0.0000045909214,0.000038814716,0.000011311121,0.0000043038817,0.00095031597,0.0013955375,0.0060688695,0.9869791,0.000059528247,0.0043472927],"study_design_scores_gemma":[0.00019527726,0.0004626945,0.00000946155,0.000009270009,0.000003771559,0.000021115127,0.000042217467,0.44975626,0.005643046,0.54355204,0.00008485101,0.00021999866],"about_ca_topic_score_codex":7.144774e-7,"about_ca_topic_score_gemma":3.551037e-7,"teacher_disagreement_score":0.6208649,"about_ca_system_score_codex":0.00009830836,"about_ca_system_score_gemma":0.00017594318,"threshold_uncertainty_score":0.99997115},"labels":[],"label_agreement":null},{"id":"W4308104409","doi":"10.46298/dmtcs.9242","title":"The 2-colouring problem for $(m,n)$-mixed graphs with switching is polynomial","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Nuclear Receptors and Signaling","field":"Neuroscience","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":"University of Victoria; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Mixed graph; Vertex (graph theory); Homomorphism; Graph; Discrete mathematics; Graph homomorphism; Line graph; Graph power; Voltage graph","score_opus":0.014383660655838508,"score_gpt":0.24727143901508372,"score_spread":0.2328877783592452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308104409","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.5066307,0.000015830869,0.48571137,0.0023203124,0.00068045076,0.0012883238,0.000020527366,0.00018817108,0.0031442584],"genre_scores_gemma":[0.94804347,0.000001937969,0.0511762,0.00055003626,0.000062387895,0.00009640474,3.9192855e-7,0.00003511288,0.00003405269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971915,0.000113165144,0.00034971998,0.00063902553,0.0009880445,0.0007185274],"domain_scores_gemma":[0.9981026,0.0010066106,0.00017079733,0.00049218076,0.000059681588,0.00016814472],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0018748383,0.00021416186,0.00022272475,0.00010266327,0.004316667,0.0007339996,0.0016577891,0.00002272845,0.00008958199],"category_scores_gemma":[0.00013907657,0.00013021828,0.00012194505,0.0007078279,0.0015105513,0.000196882,0.0009394978,0.0003243917,0.000008785557],"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.00005047253,0.000053677042,0.0000064636824,0.000021196345,0.0000045701595,0.0000036899576,0.0023489604,0.00022089857,0.024508331,0.96996194,0.00015042584,0.0026693917],"study_design_scores_gemma":[0.00052777864,0.0006729756,0.000006547991,0.000049795457,0.000023791112,0.00009721096,0.0005794897,0.5676003,0.049153704,0.37919584,0.0016790344,0.00041353793],"about_ca_topic_score_codex":0.0000014294251,"about_ca_topic_score_gemma":4.3622876e-7,"teacher_disagreement_score":0.5907661,"about_ca_system_score_codex":0.00005883794,"about_ca_system_score_gemma":0.000091933995,"threshold_uncertainty_score":0.9969796},"labels":[],"label_agreement":null},{"id":"W4386476920","doi":"10.46298/dmtcs.10063","title":"Antisquares and Critical Exponents","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","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":"Thompson Rivers University; University of Winnipeg; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Word (group theory); Binary number; Complement (music); Combinatorics; Repetition (rhetorical device); Word length; Exponential function; Exponent; Polynomial; Discrete mathematics; Arithmetic; Mathematical analysis; Linguistics; Geometry","score_opus":0.01649650406576732,"score_gpt":0.2822118731444805,"score_spread":0.2657153690787132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386476920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090426035,0.000035340523,0.9045629,0.0018368295,0.00045440329,0.0001487549,0.000004356637,0.00070453546,0.0018268687],"genre_scores_gemma":[0.80386156,0.000012830968,0.19575998,0.0002669907,0.00006315859,0.000010046975,0.0000012109637,0.000013531603,0.000010698404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707586,0.000079721474,0.00036857458,0.00079413695,0.0008849455,0.00079675013],"domain_scores_gemma":[0.997494,0.0009796009,0.0000592366,0.0009819785,0.000113778646,0.00037143604],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019079868,0.00024712516,0.00029611491,0.00030095835,0.0005616147,0.0010154638,0.0021210583,0.00006187766,0.000036291913],"category_scores_gemma":[0.00040443565,0.00019230285,0.000073035895,0.0014834747,0.0032585314,0.00085499074,0.0022778348,0.000173166,0.00024145524],"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.0000012168108,0.000036695397,0.000026628992,0.000043408243,0.0000037382367,0.000037594877,0.0011961841,0.000005805823,0.0010392914,0.9900414,0.00010952436,0.007458517],"study_design_scores_gemma":[0.00008474077,0.00006324434,0.00041903154,0.000057306275,0.0000038735016,0.000049113027,0.000055076613,0.52481073,0.0008556998,0.47340092,0.00002419079,0.00017607537],"about_ca_topic_score_codex":0.0000010329355,"about_ca_topic_score_gemma":9.011306e-8,"teacher_disagreement_score":0.71343553,"about_ca_system_score_codex":0.000017681446,"about_ca_system_score_gemma":0.000048824095,"threshold_uncertainty_score":0.999454},"labels":[],"label_agreement":null},{"id":"W4387258707","doi":"10.46298/dmtcs.9957","title":"Homomorphically Full Oriented Graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","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 Victoria","funders":"Syddansk Universitet","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.018584024645807756,"score_gpt":0.2938300156535539,"score_spread":0.2752459910077461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387258707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026500624,0.0000139882795,0.96541506,0.0016222298,0.0005074606,0.00042371496,0.000007799813,0.0011769239,0.0043322113],"genre_scores_gemma":[0.6056179,0.00001268374,0.39396414,0.00022586422,0.00005536794,0.000040292332,0.0000044437334,0.00002986464,0.00004948925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99418515,0.00018125228,0.00061591616,0.0012869011,0.0021750506,0.0015557384],"domain_scores_gemma":[0.9954438,0.0009767407,0.00014453435,0.0022678608,0.0004777647,0.0006893051],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0038264878,0.00039184335,0.00044475662,0.0008762415,0.0008905409,0.0007756834,0.0056365593,0.00010011712,0.00008274098],"category_scores_gemma":[0.00058516173,0.00031117158,0.00020909472,0.008225241,0.00533385,0.001010567,0.003558574,0.00048822217,0.0009447949],"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.000008658106,0.00007596121,0.000017443848,0.000031387153,0.000010627439,0.0000737769,0.0008780412,0.00010194869,0.0022500854,0.99262124,0.00012555967,0.0038052495],"study_design_scores_gemma":[0.00016775279,0.00014008328,0.00006574121,0.00003899333,0.0000038311296,0.000048325535,0.000034466575,0.44105232,0.0008000939,0.55730474,0.00009182983,0.0002518498],"about_ca_topic_score_codex":7.066394e-7,"about_ca_topic_score_gemma":4.832668e-7,"teacher_disagreement_score":0.57911724,"about_ca_system_score_codex":0.00005650062,"about_ca_system_score_gemma":0.00017443261,"threshold_uncertainty_score":0.999934},"labels":[],"label_agreement":null},{"id":"W4387672295","doi":"10.46298/dmtcs.9919","title":"Pseudoperiodic Words and a Question of Shevelev","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo","keywords":"Mathematics; Word (group theory); Exponent; Combinatorics; Linguistics; Philosophy","score_opus":0.01141992789671988,"score_gpt":0.2606217039301331,"score_spread":0.24920177603341323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387672295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17741743,0.00002847214,0.8201673,0.00054352835,0.00019965266,0.00014454877,0.000002875163,0.00030740214,0.0011888116],"genre_scores_gemma":[0.78247005,0.000015394202,0.21736217,0.00009236676,0.000030770665,0.000007650329,0.0000010019471,0.000009104413,0.000011513551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978032,0.000077445795,0.00039778458,0.0005508394,0.0006949978,0.00047573028],"domain_scores_gemma":[0.99837947,0.0003790169,0.000120445715,0.00081675674,0.00010450433,0.00019981866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024603826,0.00019347474,0.00029915053,0.00029545178,0.0002550953,0.0003771545,0.0016402656,0.00005315054,0.000019383806],"category_scores_gemma":[0.00017615159,0.0001477276,0.000065248736,0.0017426733,0.0024278108,0.00054459,0.001398639,0.00012742354,0.0000537734],"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.0000016214718,0.000027548325,0.000029091316,0.0000530596,0.0000042986826,0.0000072408498,0.0025649483,0.000020139436,0.0016996138,0.98257905,0.000022701353,0.012990657],"study_design_scores_gemma":[0.00009053727,0.00007477621,0.00035069895,0.00009220409,0.000004314634,0.00002830105,0.0000676014,0.5779083,0.0015771498,0.41966438,0.000009196247,0.00013259755],"about_ca_topic_score_codex":0.0000018700983,"about_ca_topic_score_gemma":1.7774494e-7,"teacher_disagreement_score":0.6050526,"about_ca_system_score_codex":0.000017495535,"about_ca_system_score_gemma":0.00007242302,"threshold_uncertainty_score":0.89453703},"labels":[],"label_agreement":null},{"id":"W4388906444","doi":"10.46298/dmtcs.11478","title":"Proving exact values for the $2$-limited broadcast domination number on grid graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Square (algebra); Mathematics; Square tiling; Combinatorics; Grid; Discrete mathematics; Geometry","score_opus":0.026306557541697813,"score_gpt":0.3233868965664962,"score_spread":0.2970803390247984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388906444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011742915,0.000011241297,0.98130065,0.0023339964,0.0007237916,0.0011551743,0.000012864767,0.00050787395,0.0022114746],"genre_scores_gemma":[0.7799994,0.00001527281,0.21911895,0.0003362397,0.00017704323,0.00021074332,0.0000065890795,0.00004036445,0.00009540196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995685,0.0001791968,0.00048114496,0.0009940772,0.0015761107,0.0010844733],"domain_scores_gemma":[0.9929248,0.0045824633,0.00017061798,0.0016687536,0.00039942007,0.00025395423],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.005046352,0.00034089887,0.00032035867,0.0004067439,0.0014215981,0.0011564307,0.004243841,0.00007239682,0.000026198899],"category_scores_gemma":[0.0009172102,0.00021484306,0.00022273682,0.0034919025,0.0031847402,0.0008887517,0.0014043166,0.00033547642,0.00022634007],"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.000018306953,0.00006751343,0.000011564088,0.00004634983,0.000014003678,0.0000060287853,0.0014404339,0.00048763948,0.0004042029,0.97722423,0.0002986883,0.019981043],"study_design_scores_gemma":[0.00018788784,0.00013225764,0.000114914415,0.000056495654,0.0000069722805,0.000012255213,0.000068753754,0.51117975,0.0011122186,0.4868674,0.00008578101,0.00017533824],"about_ca_topic_score_codex":8.831355e-7,"about_ca_topic_score_gemma":3.1814469e-7,"teacher_disagreement_score":0.7682565,"about_ca_system_score_codex":0.00006743138,"about_ca_system_score_gemma":0.00009991986,"threshold_uncertainty_score":0.9998805},"labels":[],"label_agreement":null},{"id":"W4390632701","doi":"10.46298/dmtcs.12810","title":"Immaculate basis of the non-commutative symmetric functions","year":2013,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Symmetric function; Schur algebra; Basis (linear algebra); Schur's lemma; Commutative property; Combinatorics; Base (topology); Pure mathematics; Mathematical analysis; Geometry; Orthogonal polynomials","score_opus":0.014734045158475855,"score_gpt":0.27494075823007624,"score_spread":0.26020671307160037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390632701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06289291,0.0002320199,0.90228945,0.0035153185,0.0043568793,0.0024705979,0.000066744324,0.000118320044,0.024057759],"genre_scores_gemma":[0.7010921,0.00001816317,0.29759222,0.00010039972,0.00020032183,0.00009146883,0.0000017479085,0.00009200352,0.00081155635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932629,0.00038147383,0.0018673219,0.00089356635,0.0021873063,0.0014074299],"domain_scores_gemma":[0.98988813,0.0041206204,0.001176124,0.0028504832,0.0014399363,0.0005247193],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020578636,0.000811533,0.0012699882,0.00043186915,0.0010021304,0.000516256,0.003639414,0.00029288814,0.0011547765],"category_scores_gemma":[0.0028505924,0.0005652257,0.00065266015,0.0047190054,0.011635676,0.0009445924,0.0027588627,0.0009410711,0.00069585844],"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.0000052335763,0.0007267142,0.000022482829,0.0009140608,0.00010870125,0.000004047436,0.004693485,0.00016439571,0.00069971144,0.98876375,0.0004228342,0.0034745655],"study_design_scores_gemma":[0.00038823774,0.00019348096,0.00008391928,0.0009207658,0.0002452127,0.00006349188,0.00067620235,0.3254396,0.004614439,0.66689193,0.000041329804,0.00044138252],"about_ca_topic_score_codex":0.000026461785,"about_ca_topic_score_gemma":0.0000014175881,"teacher_disagreement_score":0.6381992,"about_ca_system_score_codex":0.0003044539,"about_ca_system_score_gemma":0.00035178364,"threshold_uncertainty_score":0.9997583},"labels":[],"label_agreement":null},{"id":"W4406215708","doi":"10.46298/dmtcs.6848","title":"Colourings of $(m, n)$-coloured mixed graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics","score_opus":0.01252100145226509,"score_gpt":0.29307219231010706,"score_spread":0.28055119085784197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406215708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0439609,0.000044470937,0.9444458,0.0008153443,0.0004128793,0.00042531238,0.0000036807432,0.00019150811,0.0097001465],"genre_scores_gemma":[0.6403137,0.0000046482087,0.35948223,0.00012443274,0.000009170257,0.000018200173,4.668939e-7,0.000008536508,0.000038632657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962937,0.00016046353,0.0006702827,0.00085877586,0.0011636307,0.00085313176],"domain_scores_gemma":[0.99630284,0.0009656549,0.00019816139,0.001757437,0.0005117346,0.00026418417],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0028024607,0.00029614987,0.0005102047,0.00075516413,0.00044516326,0.00034270712,0.005378251,0.000090247755,0.000029218376],"category_scores_gemma":[0.0004966463,0.0002409872,0.00019675089,0.0039438065,0.005519449,0.0006173933,0.002652359,0.00032487966,0.000024229696],"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.000011371578,0.0001323687,0.000052026542,0.000089371,0.000018767589,0.000007437828,0.0006018263,0.00006603745,0.0030631402,0.9921974,0.000061071085,0.0036991925],"study_design_scores_gemma":[0.00025130538,0.00011054955,0.00020236419,0.0001173507,0.00000903172,0.000008721876,0.000040642608,0.25136515,0.019834284,0.7278427,0.000034441466,0.00018349722],"about_ca_topic_score_codex":0.0000013910603,"about_ca_topic_score_gemma":6.0300795e-7,"teacher_disagreement_score":0.59635276,"about_ca_system_score_codex":0.000056476067,"about_ca_system_score_gemma":0.00025520613,"threshold_uncertainty_score":0.99942183},"labels":[],"label_agreement":null},{"id":"W4406372334","doi":"10.46298/dmtcs.13438","title":"Eulerian $k$-dominating reconfiguration graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada; Mount Allison University; Universities Space Research Association","keywords":"Eulerian path; Combinatorics; Mathematics; Vertex (graph theory); Dominating set; Graph; Discrete mathematics; Lagrangian; Mathematical analysis","score_opus":0.01472033709827064,"score_gpt":0.30093745814633094,"score_spread":0.2862171210480603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406372334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069970037,0.00003020801,0.95505583,0.0013930941,0.00051326375,0.0003993737,0.000001972369,0.00028637235,0.0353229],"genre_scores_gemma":[0.59684575,0.000004090035,0.40277746,0.00025626644,0.000024083572,0.00002470927,0.0000010299534,0.000009368792,0.00005724622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99645287,0.00017829565,0.0005866449,0.00097124896,0.00094925944,0.00086166005],"domain_scores_gemma":[0.9968066,0.000808229,0.0001495395,0.0015742662,0.00040314483,0.0002582265],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0031446824,0.00029649292,0.0003544782,0.00067723694,0.00087553763,0.0010841128,0.0040044757,0.000078813195,0.00005461881],"category_scores_gemma":[0.0006071344,0.00024665295,0.0001416542,0.0033146234,0.0029317657,0.0011959304,0.0014830733,0.00035007295,0.000068350375],"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.0000048000347,0.000055921766,0.000016556996,0.000040841132,0.000009078637,0.000006627201,0.0006750716,0.000049605438,0.00243699,0.97253823,0.00003293554,0.024133319],"study_design_scores_gemma":[0.00015113031,0.000047088357,0.00006014372,0.000089250105,0.0000041757808,0.000010535328,0.00004388771,0.40724096,0.005482288,0.58666205,0.00003932569,0.00016914046],"about_ca_topic_score_codex":0.0000010711661,"about_ca_topic_score_gemma":6.757714e-7,"teacher_disagreement_score":0.58984876,"about_ca_system_score_codex":0.00007827879,"about_ca_system_score_gemma":0.00020113958,"threshold_uncertainty_score":0.99999857},"labels":[],"label_agreement":null},{"id":"W4410527555","doi":"10.46298/dmtcs.12743","title":"On Separating Path and Tree Systems in Graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"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":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; National Science Foundation","keywords":"Mathematics; Combinatorics; Path (computing); Tree (set theory); Computer science","score_opus":0.010106605733822108,"score_gpt":0.26072299739890475,"score_spread":0.25061639166508265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410527555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012544487,0.00005216343,0.9669975,0.0004586335,0.0003963633,0.000297328,0.000002241655,0.00010848038,0.019142775],"genre_scores_gemma":[0.81298184,0.000009111755,0.1866398,0.00029010576,0.000016131164,0.000017580467,0.0000012133324,0.000005639493,0.00003856132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978762,0.00006875699,0.0003793925,0.0006852596,0.0005294508,0.00046091567],"domain_scores_gemma":[0.9985288,0.00039899265,0.000077555036,0.00082946895,0.00005264117,0.00011256496],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012865079,0.0002061137,0.00027201787,0.00042480463,0.0002492922,0.0012426967,0.0018504261,0.000038477905,0.0000029653309],"category_scores_gemma":[0.000105397594,0.00015811206,0.00004104897,0.0014755095,0.0008729379,0.0006276327,0.0013595126,0.00016855808,0.000014619259],"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.0000014336921,0.00005181714,0.000031412743,0.00005347264,0.0000040882533,0.0000118787475,0.0003826717,0.00007720517,0.000038003374,0.98911524,0.0000749569,0.010157844],"study_design_scores_gemma":[0.0001441247,0.000047844722,0.00014809876,0.0001800526,0.0000030768826,0.0000028111838,0.00003594288,0.6040877,0.000042925887,0.39516965,0.000020960291,0.00011680106],"about_ca_topic_score_codex":0.0000036424842,"about_ca_topic_score_gemma":8.397476e-7,"teacher_disagreement_score":0.8004374,"about_ca_system_score_codex":0.000029745419,"about_ca_system_score_gemma":0.000040607065,"threshold_uncertainty_score":0.9997941},"labels":[],"label_agreement":null},{"id":"W4413306205","doi":"10.46298/dmtcs.15222","title":"The Price of Upwardness","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Combinatorics; Statistics","score_opus":0.009311488017264506,"score_gpt":0.2696363289331886,"score_spread":0.2603248409159241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413306205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004864828,0.000078800185,0.9813295,0.0016643212,0.0006756267,0.0001921424,9.4169775e-7,0.00006716839,0.01112668],"genre_scores_gemma":[0.724263,0.000007589582,0.2754477,0.00016797043,0.000031054245,0.000009216711,5.1403714e-7,0.0000030684364,0.000069880676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808717,0.00007064446,0.0004280109,0.0003874883,0.0006829076,0.00034377322],"domain_scores_gemma":[0.9976253,0.0009077337,0.00013014769,0.000846501,0.00039898462,0.00009135568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019866081,0.00014025695,0.00018499588,0.00017907069,0.0006532493,0.0004563951,0.002545685,0.000034345056,0.0000069212942],"category_scores_gemma":[0.0002986618,0.00009007504,0.00008308195,0.0020809313,0.0016370933,0.00033654162,0.0010208482,0.00011703175,0.000012406576],"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.0000023120856,0.00004150691,0.000005873188,0.00002428582,0.000007832674,6.625411e-7,0.0003442824,0.00043796832,0.00044728687,0.98368657,0.000091591646,0.014909807],"study_design_scores_gemma":[0.00007338392,0.000031712592,0.00013087876,0.00003436265,0.0000041733024,0.0000041415137,0.000017256636,0.53869945,0.0044205543,0.4562158,0.00029716775,0.000071140945],"about_ca_topic_score_codex":6.187437e-7,"about_ca_topic_score_gemma":2.5560772e-7,"teacher_disagreement_score":0.7193982,"about_ca_system_score_codex":0.000029591138,"about_ca_system_score_gemma":0.00024239873,"threshold_uncertainty_score":0.6031938},"labels":[],"label_agreement":null},{"id":"W4414520187","doi":"10.46298/dmtcs.13421","title":"The Fagnano Triangle Patrolling Problem","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","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":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Patrolling; Trajectory; Property (philosophy); Optimization problem; Inscribed figure; Dynamical billiards; Artifact (error)","score_opus":0.011503274239149344,"score_gpt":0.2645188535859136,"score_spread":0.2530155793467643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414520187","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047345945,0.00012441966,0.9776165,0.0033322023,0.0009164224,0.0004396142,0.0000015536381,0.00032668235,0.01676917],"genre_scores_gemma":[0.18743876,0.000008972373,0.8119312,0.00035417828,0.000072208655,0.000037371414,6.2837756e-7,0.000011556616,0.00014515559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637246,0.00015206252,0.00067685446,0.0008222093,0.0010116099,0.0009648271],"domain_scores_gemma":[0.9960585,0.0015540777,0.00018273403,0.0017225537,0.0002645167,0.00021761993],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.003989664,0.00030599386,0.00038428564,0.00022554309,0.0016088111,0.0018589079,0.005473241,0.00007618837,0.0000057899797],"category_scores_gemma":[0.0004236465,0.00018997479,0.0001610553,0.0020709275,0.0023897847,0.0004998558,0.0018016342,0.00033485447,0.00007572231],"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.0000027056803,0.000044436936,0.000011398701,0.000023216635,0.000013631911,0.000009351609,0.0007106798,0.00054250436,0.00013196157,0.9790546,0.00015670153,0.019298833],"study_design_scores_gemma":[0.00018126184,0.000054642023,0.00002630948,0.000116013296,0.0000091240945,0.000013709055,0.0000331848,0.6073071,0.00051820045,0.39138207,0.00020264427,0.00015575967],"about_ca_topic_score_codex":0.0000017921773,"about_ca_topic_score_gemma":2.253449e-7,"teacher_disagreement_score":0.6067646,"about_ca_system_score_codex":0.00007855584,"about_ca_system_score_gemma":0.00030441154,"threshold_uncertainty_score":0.9999076},"labels":[],"label_agreement":null},{"id":"W4415350706","doi":"10.46298/dmtcs.15939","title":"Low complexity binary words avoiding $(5/2)^+$-powers","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Coding theory and cryptography","field":"Computer Science","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 Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Binary number; Cover (algebra); Word (group theory); Structured program theorem; Feature (linguistics)","score_opus":0.016745601426225484,"score_gpt":0.2703264039003534,"score_spread":0.2535808024741279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415350706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026981963,0.000039472117,0.94791144,0.001319325,0.0009939121,0.00028887732,0.0000032469245,0.0005035047,0.021958267],"genre_scores_gemma":[0.71945244,0.000004130384,0.27980512,0.000644903,0.000045576744,0.000012748936,0.0000011371438,0.000010372696,0.000023544006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99628997,0.00023495458,0.00058326975,0.0010624179,0.0008860467,0.00094332686],"domain_scores_gemma":[0.9966617,0.0008618185,0.00014652056,0.0018047366,0.00020642394,0.00031878767],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["sts"],"category_scores_codex":[0.0034219185,0.0003943636,0.00045254463,0.0006220944,0.001375538,0.0011428754,0.0048916275,0.00009412567,0.00008004031],"category_scores_gemma":[0.00026124794,0.00033048622,0.00025267052,0.0035630313,0.0049480456,0.0008242896,0.00268765,0.00049610436,0.0000732859],"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.000008466028,0.00015928039,0.000023933853,0.00008373463,0.000014830157,0.000012719399,0.0016279478,0.000046480236,0.00091894384,0.98966616,0.00011163016,0.0073258528],"study_design_scores_gemma":[0.00017092786,0.000095598574,0.00008024965,0.0002030782,0.00001164148,0.0000113078995,0.00009089436,0.35450047,0.0023346292,0.6421557,0.00006849211,0.0002770237],"about_ca_topic_score_codex":0.0000013224385,"about_ca_topic_score_gemma":4.7096563e-7,"teacher_disagreement_score":0.6924705,"about_ca_system_score_codex":0.00007653423,"about_ca_system_score_gemma":0.00018373063,"threshold_uncertainty_score":0.99992454},"labels":[],"label_agreement":null},{"id":"W4415937484","doi":"10.46298/dmtcs.15140","title":"On the conjugates of Christoffel words","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Christoffel symbols; Graph; Conjugate; Integer (computer science); Algebra over a field","score_opus":0.008876415764861333,"score_gpt":0.25009222166563855,"score_spread":0.2412158059007772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415937484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030146593,0.00004513294,0.9459367,0.00330235,0.0004043515,0.0002468923,0.0000029999626,0.00013512251,0.019779855],"genre_scores_gemma":[0.9158942,0.000004143025,0.08281284,0.0012103277,0.00002359107,0.000013100106,3.8969532e-7,0.0000071399722,0.000034270804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771965,0.00010983827,0.00045906467,0.0005326656,0.0007205773,0.00045821271],"domain_scores_gemma":[0.99599004,0.002021294,0.00015243905,0.0015835098,0.00014842548,0.00010429395],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0023192533,0.00022979811,0.00032027045,0.00020732451,0.00040322013,0.0003904135,0.004261029,0.000052945565,0.00005790921],"category_scores_gemma":[0.0003987329,0.00013335221,0.00013207027,0.0014322025,0.0034872382,0.00025711433,0.0013274722,0.0002216184,0.000043310312],"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.0000035628018,0.00008169874,0.000004739518,0.00003232333,0.000010871097,0.000002142694,0.00084635837,0.00003349622,0.0007335948,0.9947509,0.00024555455,0.003254749],"study_design_scores_gemma":[0.00008441791,0.00006478315,0.00004052231,0.00014866494,0.0000057533,0.0000034490802,0.000046572524,0.39726317,0.0077804686,0.5944326,0.000028760043,0.00010082201],"about_ca_topic_score_codex":0.0000014632002,"about_ca_topic_score_gemma":1.462177e-7,"teacher_disagreement_score":0.8857476,"about_ca_system_score_codex":0.000029700897,"about_ca_system_score_gemma":0.00013637832,"threshold_uncertainty_score":0.9992247},"labels":[],"label_agreement":null},{"id":"W49365848","doi":"10.46298/dmtcs.279","title":"Defect Effect of Bi-infinite Words in the Two-element Case","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"semigroups and automata theory","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":"Word (group theory); Element (criminal law); Sharpening; Set (abstract data type); Alphabet; Mathematics; Word problem (mathematics education); Maximal element; Closure (psychology); Discrete mathematics; Combinatorics; Pure mathematics; Algebra over a field; Arithmetic; Computer science; Artificial intelligence; Linguistics; Geometry","score_opus":0.010857745900750023,"score_gpt":0.2739245430268805,"score_spread":0.2630667971261305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49365848","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.3265932,0.000047194913,0.6695109,0.00052036584,0.00017163067,0.00036139524,0.0000020279185,0.000074305746,0.00271897],"genre_scores_gemma":[0.9212937,0.000006823807,0.07815937,0.0004542563,0.000042705848,0.000028269427,6.879804e-7,0.000011697544,0.0000025235877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965184,0.00044078074,0.0006335622,0.0006492148,0.0010378932,0.00072018034],"domain_scores_gemma":[0.9958286,0.0021410014,0.00019001884,0.0016051824,0.000079004196,0.00015616973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074385637,0.0003173102,0.00044130548,0.0003017716,0.00029297578,0.0004548375,0.003373149,0.000044556717,0.000042207314],"category_scores_gemma":[0.0002140936,0.00018403158,0.0002083201,0.0021853833,0.0017569456,0.00046919953,0.0010551104,0.00027671125,0.00003303973],"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.000008736429,0.00010031517,0.00014166877,0.00003930015,0.000008485756,0.0005229422,0.0033052145,0.00017877498,0.0002360572,0.9804767,0.000021834687,0.014959993],"study_design_scores_gemma":[0.00053809525,0.00046590972,0.00006647716,0.00012747604,0.000018499646,0.0017589307,0.000136494,0.82091516,0.0013871082,0.1742607,0.000065178836,0.00025994016],"about_ca_topic_score_codex":0.0000116367155,"about_ca_topic_score_gemma":0.0000036012261,"teacher_disagreement_score":0.8207364,"about_ca_system_score_codex":0.000040455187,"about_ca_system_score_gemma":0.000055135995,"threshold_uncertainty_score":0.750459},"labels":[],"label_agreement":null},{"id":"W50494007","doi":"10.46298/dmtcs.3432","title":"Color critical hypergraphs and forbidden configurations","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund; Fonds National de la Recherche Luxembourg","keywords":"Combinatorics; Mathematics; Simple (philosophy); Matrix (chemical analysis); Permutation (music); Upper and lower bounds; Generalization; Discrete mathematics; Mathematical analysis","score_opus":0.008544014444155194,"score_gpt":0.23904298060786963,"score_spread":0.23049896616371443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W50494007","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.24340743,0.00013342394,0.72480106,0.00058965234,0.00036255785,0.0002670801,0.000013277672,0.000360474,0.030065017],"genre_scores_gemma":[0.9469234,0.0000064650535,0.052832387,0.000092101494,0.000102282094,0.000017654049,0.0000010897342,0.000016939148,0.000007675474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987018,0.000030383391,0.00029687685,0.00025953952,0.00031455513,0.00039680648],"domain_scores_gemma":[0.9989826,0.0003509951,0.000019240604,0.00033206612,0.00007379027,0.000241285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061637274,0.00017772162,0.00021634462,0.00011553912,0.00029232784,0.00027208927,0.0003990491,0.00005811404,0.000105598876],"category_scores_gemma":[0.000091629256,0.00014400386,0.00005686393,0.000332509,0.0023794947,0.00030397502,0.000100428144,0.00013989786,0.00006362987],"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.0000014504037,0.000020594558,0.0000055296696,0.000052109164,0.0000070416277,0.0000020054172,0.0008453641,0.0001995726,0.0027192098,0.9949685,0.00005280483,0.0011258186],"study_design_scores_gemma":[0.00010871321,0.00005051555,0.000047528953,0.000054013937,0.000017170061,0.00006272757,0.00013160355,0.73342884,0.0021875277,0.2634576,0.00024654437,0.00020721037],"about_ca_topic_score_codex":2.3840809e-7,"about_ca_topic_score_gemma":6.6100864e-7,"teacher_disagreement_score":0.7332293,"about_ca_system_score_codex":0.000016662974,"about_ca_system_score_gemma":0.000014913847,"threshold_uncertainty_score":0.87673473},"labels":[],"label_agreement":null},{"id":"W580162482","doi":"10.46298/dmtcs.2817","title":"$n!$ matchings, $n!$ posets (extended abstract)","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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":"Toronto Metropolitan University","funders":"Knut och Alice Wallenbergs Stiftelse; Royal Swedish Academy of Sciences","keywords":"Bijection, injection and surjection; Combinatorics; Conjecture; Mathematics; Bijection; Discrete mathematics","score_opus":0.014897216252439555,"score_gpt":0.30379931709292535,"score_spread":0.2889021008404858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W580162482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37427142,0.000008250567,0.5932114,0.0006168986,0.0025118738,0.0008921123,0.000017441565,0.0007865633,0.027684053],"genre_scores_gemma":[0.56343466,0.0000014589806,0.4361116,0.00009240867,0.00023560505,0.00002285457,0.0000019354459,0.00006539363,0.00003409444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947222,0.000051515355,0.0011368027,0.0009861952,0.0018548453,0.0012484643],"domain_scores_gemma":[0.9943767,0.0018764371,0.00048329344,0.002140356,0.0004664654,0.0006567402],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0029527696,0.00063860364,0.0007954328,0.00029292615,0.00073297287,0.00060050795,0.0027251968,0.0002333218,0.0006056342],"category_scores_gemma":[0.0024712845,0.000511159,0.00025656848,0.00093392236,0.003809092,0.0006965598,0.001112038,0.0011468558,0.0002722612],"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.0000095806245,0.00039556358,0.000005212417,0.00016721121,0.000018545237,0.000023624509,0.0014605464,0.000002632969,0.011775086,0.98440033,0.00014249035,0.0015991624],"study_design_scores_gemma":[0.0004304834,0.00011477341,0.000055220113,0.00013025242,0.000048198766,0.00014934776,0.00011264689,0.028611599,0.009141152,0.96044433,0.00012147197,0.00064050494],"about_ca_topic_score_codex":0.0000015794437,"about_ca_topic_score_gemma":0.0000025483266,"teacher_disagreement_score":0.18916324,"about_ca_system_score_codex":0.00007228465,"about_ca_system_score_gemma":0.00018149731,"threshold_uncertainty_score":0.999734},"labels":[],"label_agreement":null},{"id":"W58556464","doi":"10.46298/dmtcs.322","title":"On Locating-Dominating Codes in Binary Hamming Spaces","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":27,"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":"Academy of Finland","keywords":"Hypercube; Hamming code; Computer science; Hamming(7,4); Hamming distance; Multiprocessing; Binary number; Hamming graph; Hamming space; Parallel computing; Theoretical computer science; Mathematics; Block code; Arithmetic; Algorithm; Decoding methods","score_opus":0.011940022561228078,"score_gpt":0.25787279695283344,"score_spread":0.24593277439160535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58556464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12477569,0.000016428705,0.8686999,0.0008023278,0.0005502097,0.00022692553,6.198769e-7,0.00013539847,0.0047924854],"genre_scores_gemma":[0.7820869,0.0000012200118,0.21755952,0.00024188274,0.00007665011,0.000014120962,3.9980094e-7,0.000011430636,0.000007878979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971008,0.00009639657,0.00057461695,0.0007464028,0.0008002206,0.00068159366],"domain_scores_gemma":[0.99808645,0.00060544815,0.0001777949,0.00080583565,0.00013916542,0.00018527538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024712216,0.00026971952,0.00036193177,0.00035137904,0.00043825354,0.0009127285,0.0019437228,0.000070892034,0.000013939125],"category_scores_gemma":[0.00027321687,0.00021024741,0.00009256655,0.0013186431,0.0010283535,0.0006029977,0.00070170953,0.00030795118,0.00006688873],"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.0000030974677,0.00009389124,0.00001149674,0.000031618067,0.0000031633624,0.000027976903,0.0035563153,0.012638278,0.00032012985,0.9813452,0.000008965728,0.0019598918],"study_design_scores_gemma":[0.0002515595,0.0001997006,0.000029437633,0.0004686864,0.0000017820298,0.000038678765,0.00017238522,0.6754814,0.0010898925,0.32204965,0.0000049362316,0.00021190153],"about_ca_topic_score_codex":0.00001245103,"about_ca_topic_score_gemma":0.000005175366,"teacher_disagreement_score":0.6628431,"about_ca_system_score_codex":0.000149582,"about_ca_system_score_gemma":0.000103506056,"threshold_uncertainty_score":0.8801462},"labels":[],"label_agreement":null},{"id":"W601140154","doi":"10.46298/dmtcs.2788","title":"The height of scaled attachment random recursive trees","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":4,"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":"Combinatorics; Mathematics; Bounded function; Random walk; Preferential attachment; Random tree; Sequence (biology); Random variable; Tree (set theory); Random graph; Discrete mathematics; Random binary tree; Class (philosophy); Branching (polymer chemistry); Binary logarithm; Binary tree; Mathematical analysis; Statistics; Graph; Computer science","score_opus":0.014974971682421357,"score_gpt":0.3028794344697585,"score_spread":0.28790446278733717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W601140154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015568018,0.00002277641,0.9782708,0.0006053332,0.00061048573,0.0004795902,0.000018364255,0.000061769286,0.004362825],"genre_scores_gemma":[0.6557866,0.00000603971,0.34401727,0.000039634444,0.00008465233,0.000024709403,8.398071e-7,0.000018467606,0.000021847656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702996,0.00006125088,0.00074178353,0.00044331027,0.0011103791,0.0006133074],"domain_scores_gemma":[0.9927856,0.0052908408,0.00029018536,0.00092967006,0.0004290849,0.00027466295],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002489465,0.00027573959,0.0004913988,0.00007589012,0.00060611113,0.00022225227,0.0015364473,0.00008830211,0.00014217703],"category_scores_gemma":[0.0031502605,0.00015535695,0.00015320329,0.0004382015,0.004030714,0.00011403902,0.00050342566,0.00038611938,0.000026614145],"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.000039635976,0.00012211634,0.0000020425164,0.00006988321,0.000018815004,0.0000031905324,0.0007163454,0.0000018012407,0.0011013518,0.994752,0.000086013024,0.003086799],"study_design_scores_gemma":[0.00045387432,0.0001630004,0.000010177848,0.00007865737,0.000051065723,0.000023734028,0.00010844171,0.16951832,0.0038045396,0.825563,0.000045350913,0.00017980274],"about_ca_topic_score_codex":7.726746e-7,"about_ca_topic_score_gemma":0.0000045081324,"teacher_disagreement_score":0.64021856,"about_ca_system_score_codex":0.000019970124,"about_ca_system_score_gemma":0.00010917801,"threshold_uncertainty_score":0.99867976},"labels":[],"label_agreement":null},{"id":"W644202785","doi":"10.46298/dmtcs.2824","title":"On extensions of the Newton-Raphson iterative scheme to arbitrary orders","year":2010,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":6,"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":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Newton's method; Convergence (economics); Enumeration; Applied mathematics; Scheme (mathematics); Series (stratigraphy); Pure mathematics; Combinatorics; Mathematical analysis; Nonlinear system; Physics","score_opus":0.013663764389732356,"score_gpt":0.2650734282298485,"score_spread":0.2514096638401161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W644202785","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.28921968,0.00003420663,0.68273747,0.019587182,0.0042505166,0.000596808,0.000018164164,0.00006871634,0.0034872396],"genre_scores_gemma":[0.7119233,0.0000018461473,0.285835,0.0018670992,0.00020177146,0.000011074909,8.570597e-7,0.000020016707,0.00013899757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956676,0.000185017,0.00078131736,0.0010364646,0.0014076264,0.00092201465],"domain_scores_gemma":[0.9956508,0.0011757987,0.00030289564,0.0017725736,0.0005038733,0.0005940183],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015633312,0.00047175246,0.0005093056,0.0002829108,0.00079750165,0.000713979,0.0036878346,0.00015477338,0.00015511234],"category_scores_gemma":[0.00082837744,0.00032480023,0.0003027055,0.0026704292,0.0057001295,0.0006652726,0.0022569988,0.00088895,0.00014914028],"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.000010840674,0.0002731411,0.0000112721755,0.000054886976,0.0000145722515,0.0000067644996,0.004700795,0.0003781649,0.0070929686,0.9795311,0.0004950696,0.0074304305],"study_design_scores_gemma":[0.00017520372,0.00027736052,0.0003944898,0.00040639428,0.00001552991,0.000036718753,0.000030827086,0.52500117,0.0071077924,0.4660248,0.00023945261,0.00029028524],"about_ca_topic_score_codex":0.00001871963,"about_ca_topic_score_gemma":0.000008639461,"teacher_disagreement_score":0.52462304,"about_ca_system_score_codex":0.000048079804,"about_ca_system_score_gemma":0.0004911528,"threshold_uncertainty_score":0.9999204},"labels":[],"label_agreement":null},{"id":"W798479687","doi":"10.46298/dmtcs.2085","title":"On the number of regular edge labelings","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Lemma (botany); Triangulation; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Geometry","score_opus":0.010468270792305142,"score_gpt":0.24401975632452738,"score_spread":0.23355148553222224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W798479687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08011873,0.000008230088,0.906268,0.002198657,0.00030526952,0.00016450451,0.0000010736443,0.00012949611,0.010806071],"genre_scores_gemma":[0.73999244,0.0000013061656,0.25921223,0.0007496177,0.0000125488605,0.0000060350844,2.9133005e-7,0.000009565514,0.000015978314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720764,0.00014365153,0.00048013512,0.000585734,0.0010850092,0.0004978223],"domain_scores_gemma":[0.99643666,0.0011732678,0.00019411703,0.0017102528,0.00029520132,0.00019049362],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0036879068,0.00022812825,0.00030205311,0.000111803005,0.00041990523,0.00032062246,0.0030517834,0.000058245434,0.0000549159],"category_scores_gemma":[0.00053285237,0.0001319791,0.00012608168,0.0010727785,0.0028690363,0.00022184278,0.0009182905,0.0002212303,0.00016494471],"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.0000017498947,0.00007197262,0.000008325558,0.000020157868,0.0000054346997,7.993632e-7,0.0006573858,0.00007272563,0.0007605415,0.9968264,0.00015883386,0.001415656],"study_design_scores_gemma":[0.00008802791,0.000067293506,0.000010581738,0.00008041612,0.0000047619974,0.000010380294,0.000008330091,0.40808645,0.0036234842,0.58788097,0.00002668008,0.000112638285],"about_ca_topic_score_codex":0.0000015559801,"about_ca_topic_score_gemma":6.646516e-8,"teacher_disagreement_score":0.6598737,"about_ca_system_score_codex":0.000013195382,"about_ca_system_score_gemma":0.00004473068,"threshold_uncertainty_score":0.9998446},"labels":[],"label_agreement":null},{"id":"W957038697","doi":"10.46298/dmtcs.2846","title":"On joint distribution of adjacencies, descents and some Mahonian statistics","year":2010,"lang":"fr","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"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; Distribution (mathematics); Combinatorics; Euler's formula; Humanities; Joint probability distribution; Statistics; Philosophy; Mathematical analysis","score_opus":0.01580369162920817,"score_gpt":0.27428691747423123,"score_spread":0.25848322584502303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W957038697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17650439,0.00010938681,0.81686187,0.00074080203,0.0035141485,0.00088645495,0.0005283394,0.000099388635,0.0007552299],"genre_scores_gemma":[0.55864453,0.00004406856,0.4408623,0.00006374707,0.0002112499,0.000013728212,0.000015087028,0.000065442786,0.00007983935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99430424,0.00016108657,0.0015408171,0.00092657655,0.001844004,0.0012232705],"domain_scores_gemma":[0.993686,0.002391865,0.0008356774,0.0016552596,0.0006958171,0.0007353872],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002675857,0.0007302317,0.0011343663,0.00021431154,0.0005417624,0.0003904821,0.0012829197,0.00034496927,0.0002316073],"category_scores_gemma":[0.0043867477,0.0006486217,0.00017258311,0.0007765257,0.010885203,0.0005666263,0.001184308,0.0011171862,0.00008972352],"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.00002193919,0.00091041485,0.000008952763,0.0015191111,0.000036638492,0.000019389205,0.0017684441,0.000018119224,0.0021197405,0.98982644,0.00030939098,0.0034414358],"study_design_scores_gemma":[0.0005833325,0.0005280884,0.000059139984,0.0009968012,0.00014101982,0.00007475857,0.00011163901,0.19349654,0.0055858884,0.7978127,0.00007739602,0.0005326885],"about_ca_topic_score_codex":0.000004682754,"about_ca_topic_score_gemma":0.0000024968867,"teacher_disagreement_score":0.38214016,"about_ca_system_score_codex":0.00017633218,"about_ca_system_score_gemma":0.00030535148,"threshold_uncertainty_score":0.9995965},"labels":[],"label_agreement":null}]}