{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8667239,0.00085525756,0.12951644,0.00030685886,0.00003539097,0.0000218703,0.00023453755,0.00027303759,0.0020326928],"genre_scores_gemma":[0.98772174,0.0002517434,0.010745155,0.000045181612,0.000026002988,0.000027059,0.00027157203,0.00009341951,0.00081815175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944085,0.00017481828,0.00001891604,0.00013180832,0.00012420009,0.00010940548],"domain_scores_gemma":[0.98626167,0.009044,0.0019275096,0.00083066314,0.0013493818,0.0005868244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016178595,0.00027014746,0.0005542313,0.0013911314,0.00053543336,0.0011211444,0.0011975562,0.0007707554,0.0017427763],"category_scores_gemma":[0.016463295,0.0004502218,0.00039781432,0.00091572595,0.0018152108,0.0018548311,0.0010786349,0.0010083781,0.00028881122],"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.0008221993,0.000099728015,0.048606608,0.00045784411,0.000116205774,0.0021467905,0.0011782798,0.43189016,0.057866346,0.4154854,0.0060932552,0.035237305],"study_design_scores_gemma":[0.00005342439,0.00010667006,0.009470437,0.00006825151,0.000028495995,0.00089664926,0.0002851629,0.8666974,0.005749533,0.115190886,0.0013982769,0.00005479594],"about_ca_topic_score_codex":0.0011016075,"about_ca_topic_score_gemma":0.0010796351,"teacher_disagreement_score":0.0017427763,"about_ca_system_score_codex":0.0007548256,"about_ca_system_score_gemma":0.000300803,"threshold_uncertainty_score":0.008556187},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40219718,0.0032271435,0.23401183,0.0007114712,0.00048919476,0.00013943107,0.00067486544,0.00041974516,0.3581292],"genre_scores_gemma":[0.9090445,0.002139592,0.046185493,0.00017829583,0.00024910035,0.000098461125,0.0005105269,0.000068608446,0.041525383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992834,0.00008875848,0.000045030694,0.00021102959,0.00018991405,0.00018196675],"domain_scores_gemma":[0.9992907,0.0001339151,0.00017069347,0.0001262723,0.00014858009,0.00012980263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028721997,0.0004461497,0.00039336705,0.0010839135,0.0012135122,0.0016338285,0.0005220822,0.0002561097,0.010799217],"category_scores_gemma":[0.0011893519,0.00023586173,0.00034823472,0.00095176144,0.0021444499,0.0022400059,0.0017716103,0.00097061717,0.001306753],"study_design_candidate":"not_applicable","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.000036307363,0.0000109835655,0.0004624644,0.000057650617,0.000006316686,0.00011349749,0.00030246776,0.0021022363,0.0020968642,0.9674942,0.0012576362,0.026059387],"study_design_scores_gemma":[0.000024357225,0.00012397255,0.0027616022,0.00005616657,0.000029750405,0.0010276759,0.0007821517,0.0071198205,0.00633694,0.8895225,0.0921698,0.000045352615],"about_ca_topic_score_codex":0.0013719217,"about_ca_topic_score_gemma":0.0014775117,"teacher_disagreement_score":0.010799217,"about_ca_system_score_codex":0.0007526485,"about_ca_system_score_gemma":0.00039881768,"threshold_uncertainty_score":0.03612703},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.685274,0.0020584455,0.22809324,0.00083292107,0.00021699096,0.00009105977,0.0012033499,0.0011539045,0.08107612],"genre_scores_gemma":[0.9780247,0.00056886557,0.016952096,0.000100671925,0.00012385432,0.00005689575,0.00034891252,0.0001587978,0.0036651832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992906,0.00008671063,0.000027010434,0.00022338697,0.00020020861,0.00017202435],"domain_scores_gemma":[0.9972209,0.0011122155,0.00046693237,0.0004007742,0.00037521898,0.00042395078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073157693,0.0005904467,0.0005756447,0.002091586,0.00065769407,0.0010833157,0.0009105496,0.00054951926,0.006807848],"category_scores_gemma":[0.00434199,0.0002934688,0.00067452504,0.000892014,0.0017287066,0.0022911832,0.0011441855,0.0011138943,0.0006292663],"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.00033518177,0.00008259803,0.008553622,0.00034747354,0.00006105098,0.00047551104,0.0004946169,0.031272452,0.059982676,0.83985394,0.0071708914,0.051370017],"study_design_scores_gemma":[0.00005075774,0.00037427997,0.021645056,0.00009112298,0.00007570046,0.0041325297,0.0004110532,0.20176908,0.0339431,0.714771,0.022609355,0.00012695178],"about_ca_topic_score_codex":0.000555927,"about_ca_topic_score_gemma":0.00049299817,"teacher_disagreement_score":0.006807848,"about_ca_system_score_codex":0.0010438741,"about_ca_system_score_gemma":0.00028080147,"threshold_uncertainty_score":0.022774458},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96229506,0.00028459396,0.022660758,0.00011979288,0.00002923372,0.000021785696,0.00015169314,0.00014812435,0.014289004],"genre_scores_gemma":[0.9913449,0.00010994335,0.0042610746,0.000024103374,0.000038807626,0.000029153682,0.0001813619,0.000039403723,0.0039713643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974793,0.000035277255,0.00002528853,0.000062654806,0.000066344815,0.00006248904],"domain_scores_gemma":[0.9992028,0.0003467021,0.00016435243,0.000066131295,0.00010895174,0.000111034315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024637306,0.00032079488,0.00044970986,0.0014269432,0.0011557004,0.0021556108,0.00039011898,0.00059215917,0.004691307],"category_scores_gemma":[0.0018486257,0.0004632569,0.00039817454,0.00065446546,0.0018079369,0.0016378133,0.00093487574,0.0007007773,0.00047867265],"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.0002372833,0.000046875513,0.0035519477,0.00018021771,0.000027086706,0.0009976743,0.0009611886,0.0032981704,0.028424518,0.94591427,0.00065998617,0.015700694],"study_design_scores_gemma":[0.000047940684,0.00015907534,0.004900356,0.000076628734,0.00006185571,0.0012836361,0.0007406874,0.018328598,0.016736208,0.9510281,0.006553228,0.00008371065],"about_ca_topic_score_codex":0.0003334472,"about_ca_topic_score_gemma":0.00038007417,"teacher_disagreement_score":0.004691307,"about_ca_system_score_codex":0.0005001375,"about_ca_system_score_gemma":0.00029943557,"threshold_uncertainty_score":0.015693963},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065828944,0.00045255024,0.9738515,0.0014856555,0.00021113893,0.0004264434,0.00068004,0.0026940708,0.013615647],"genre_scores_gemma":[0.06647897,0.00033569243,0.9206738,0.00050766015,0.00015391804,0.00056751736,0.0025563417,0.0006765558,0.008049588],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956507,0.00093716604,0.0003259445,0.0011979451,0.0012915721,0.0005966507],"domain_scores_gemma":[0.99498296,0.0029510295,0.00024949538,0.0009278926,0.00066266494,0.00022598186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021921508,0.002415905,0.002110724,0.0022641507,0.0020720942,0.0037844994,0.0046565374,0.0037681854,0.027113652],"category_scores_gemma":[0.011375375,0.0011637649,0.0027255944,0.003963354,0.0015620139,0.008259591,0.005619581,0.004718647,0.0082092155],"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.000766568,0.0006640968,0.0011986231,0.0010592258,0.00016791301,0.0002759633,0.0005058119,0.0869085,0.007994423,0.19530362,0.06996761,0.63518775],"study_design_scores_gemma":[0.00048376265,0.00020878186,0.00040494886,0.000109648885,0.00008159626,0.00050199026,0.00032258118,0.4851712,0.004854044,0.469837,0.037945695,0.000078691504],"about_ca_topic_score_codex":0.0036623944,"about_ca_topic_score_gemma":0.00500811,"teacher_disagreement_score":0.027113652,"about_ca_system_score_codex":0.0028556325,"about_ca_system_score_gemma":0.0039140224,"threshold_uncertainty_score":0.0907042},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33632302,0.001203189,0.6267328,0.0005469534,0.00018482955,0.0003831197,0.0011585471,0.0011242782,0.032343164],"genre_scores_gemma":[0.7555978,0.00076951535,0.2171167,0.00023173823,0.000086001535,0.00032743163,0.0012427067,0.00034936282,0.02427869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996444,0.0000697266,0.000024369318,0.00010458752,0.00008647949,0.00007044425],"domain_scores_gemma":[0.9995443,0.00012620765,0.00007867052,0.00012870498,0.00007420427,0.000047807225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020095835,0.0004199094,0.00030383366,0.0009520053,0.000772899,0.0012444301,0.00043404053,0.00055079296,0.0043450776],"category_scores_gemma":[0.0016565117,0.0004111771,0.00045242172,0.0008625671,0.0010290674,0.0022281522,0.0009753547,0.00061078294,0.0012805875],"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.0006394678,0.00007821586,0.0027073105,0.00027191342,0.000038404934,0.00044391063,0.0009326776,0.04257584,0.019719442,0.67021513,0.007679617,0.25469816],"study_design_scores_gemma":[0.000055233475,0.00017496907,0.0013217647,0.000097659315,0.000027439652,0.00047693378,0.00024809703,0.096435085,0.03204905,0.81793916,0.051095724,0.00007902623],"about_ca_topic_score_codex":0.0017298639,"about_ca_topic_score_gemma":0.0021245426,"teacher_disagreement_score":0.0043450776,"about_ca_system_score_codex":0.00066014635,"about_ca_system_score_gemma":0.0009930417,"threshold_uncertainty_score":0.014535785},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63204557,0.000938387,0.29839018,0.00339936,0.00019829397,0.00013359173,0.0011373048,0.00069558056,0.06306173],"genre_scores_gemma":[0.9552527,0.00038367114,0.037215102,0.00036478695,0.00012046974,0.00009661413,0.00081893324,0.000050163733,0.0056975223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914074,0.00021066368,0.00004577519,0.00027562512,0.00014660036,0.00018054592],"domain_scores_gemma":[0.9975776,0.0012040513,0.0004303963,0.00046665996,0.00014912518,0.00017214446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007699681,0.0003599512,0.00027718136,0.0005518108,0.0011903096,0.0014222703,0.00063945435,0.00078278134,0.003876731],"category_scores_gemma":[0.0026622023,0.00042071237,0.000564506,0.00098721,0.0024409147,0.0026364466,0.0012692079,0.0012335248,0.00038031593],"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.00018981572,0.00007094451,0.0034077892,0.00015143375,0.00003445239,0.0003702323,0.00049775344,0.018060977,0.0048708417,0.9371673,0.0056092623,0.029569143],"study_design_scores_gemma":[0.000024611662,0.00003853502,0.0013917496,0.000019913803,0.000014671423,0.00032847858,0.00021023591,0.02834974,0.0027492857,0.95772326,0.00913235,0.000017117856],"about_ca_topic_score_codex":0.0017601588,"about_ca_topic_score_gemma":0.0014599145,"teacher_disagreement_score":0.003876731,"about_ca_system_score_codex":0.0009862516,"about_ca_system_score_gemma":0.0006370024,"threshold_uncertainty_score":0.012969017},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7243162,0.00067724,0.24277638,0.0008385558,0.00007158823,0.000099005374,0.00030420686,0.00032824228,0.030588532],"genre_scores_gemma":[0.980113,0.00023402247,0.014171425,0.00008586952,0.000041143558,0.00006539129,0.00012881595,0.000055005097,0.005105419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881685,0.00048859755,0.000029986053,0.00020356047,0.00026821287,0.00019271523],"domain_scores_gemma":[0.9884964,0.007967549,0.001197421,0.0006295612,0.0004984403,0.0012105806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014398256,0.0006540153,0.0007484148,0.0017046187,0.00087366765,0.0016946879,0.001490945,0.0012351596,0.0052048825],"category_scores_gemma":[0.015784517,0.0005642341,0.0006159569,0.00077172037,0.0032560502,0.0032255922,0.0012063638,0.0014305231,0.00036942074],"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.00019797726,0.00007652478,0.0019474879,0.00013043499,0.00005486799,0.0003101078,0.00031906803,0.23792058,0.004848389,0.743648,0.0018639769,0.008682615],"study_design_scores_gemma":[0.0000247677,0.000062275074,0.0011535299,0.000022458187,0.000014003215,0.00016320233,0.000114228205,0.5676233,0.001061257,0.42851844,0.0012125819,0.000029893958],"about_ca_topic_score_codex":0.0013718911,"about_ca_topic_score_gemma":0.0012611197,"teacher_disagreement_score":0.0052048825,"about_ca_system_score_codex":0.0016139429,"about_ca_system_score_gemma":0.00054472545,"threshold_uncertainty_score":0.017412066},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5152832,0.0016963463,0.16400136,0.0018033505,0.0006925001,0.0001622056,0.0003609815,0.00062457577,0.31537542],"genre_scores_gemma":[0.95430446,0.00040587242,0.015545769,0.0003144809,0.00028208495,0.000073772455,0.0002797152,0.00010908614,0.0286848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987803,0.00022317753,0.000055588785,0.00028808115,0.00041561917,0.0002372081],"domain_scores_gemma":[0.9990073,0.00017594945,0.00007463375,0.00027801134,0.00024676617,0.00021738982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007996141,0.00066957826,0.0007343863,0.0020108998,0.0019326583,0.0028087078,0.0013031556,0.0007178221,0.0056094723],"category_scores_gemma":[0.0012133515,0.00030928903,0.0008596793,0.0006657337,0.005544622,0.0038304524,0.0024973894,0.0016744552,0.0010506054],"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.000008995212,0.000012118287,0.00020164678,0.000017337037,0.0000042395172,0.00005908452,0.00023827667,0.00037097433,0.0006205311,0.9959572,0.00035320251,0.0021564094],"study_design_scores_gemma":[0.000006206119,0.000022318678,0.00015696317,0.000012331659,0.0000048785746,0.00012525001,0.00018084726,0.002177341,0.0011760787,0.98904955,0.007079454,0.000008897557],"about_ca_topic_score_codex":0.0011188271,"about_ca_topic_score_gemma":0.0007576531,"teacher_disagreement_score":0.0056094723,"about_ca_system_score_codex":0.0020530713,"about_ca_system_score_gemma":0.0009336304,"threshold_uncertainty_score":0.018765569},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024102237,0.0017685709,0.9421299,0.0006169617,0.00015058032,0.00011101986,0.00044556012,0.0010301708,0.029644912],"genre_scores_gemma":[0.5435796,0.0040374696,0.41418257,0.001667881,0.0008186897,0.0007599294,0.0023141487,0.0016234493,0.031016208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997349,0.00041668033,0.00017032055,0.0006368169,0.0010446232,0.00038248478],"domain_scores_gemma":[0.9897126,0.006229021,0.0007457057,0.0014883742,0.0013695027,0.00045475672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031885356,0.0013570918,0.0016868768,0.0034899984,0.0013535898,0.0030143159,0.0027753515,0.0011846625,0.016902572],"category_scores_gemma":[0.014315523,0.00075101963,0.0019962986,0.0026202218,0.0032056903,0.009319257,0.0053640925,0.004397116,0.0038094688],"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.00013319052,0.000048746693,0.00054647285,0.00022268167,0.00003357389,0.00016604892,0.00022352465,0.011958299,0.0032470906,0.9310097,0.007949378,0.044461355],"study_design_scores_gemma":[0.00007357942,0.00011426709,0.000318135,0.00007991893,0.00004182972,0.00043879144,0.00015892247,0.058703166,0.006826747,0.9045645,0.028646544,0.000033663895],"about_ca_topic_score_codex":0.0014947604,"about_ca_topic_score_gemma":0.0006931277,"teacher_disagreement_score":0.016902572,"about_ca_system_score_codex":0.0014628627,"about_ca_system_score_gemma":0.0007145008,"threshold_uncertainty_score":0.05654472},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19125539,0.00071494724,0.71964514,0.0027071624,0.00020440882,0.00017891091,0.00089170976,0.001739949,0.082662374],"genre_scores_gemma":[0.8408603,0.00061501394,0.13706595,0.0008534667,0.00014124931,0.000157823,0.001260561,0.00044904934,0.018596591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987984,0.00026775763,0.000061506944,0.0003274989,0.00028918,0.0002555877],"domain_scores_gemma":[0.99456835,0.0024768165,0.0005287714,0.0014608201,0.0006408907,0.00032428215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010708944,0.00043044687,0.00048099732,0.0007558445,0.0016098936,0.0025852742,0.0019132893,0.0012468938,0.014123351],"category_scores_gemma":[0.005011019,0.00037789758,0.00057114335,0.0012638782,0.002917507,0.005523389,0.0034688243,0.0015263684,0.002082502],"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.00034358256,0.00009977552,0.0015381702,0.0002709933,0.000020608859,0.00012661592,0.00039470452,0.03890656,0.015296498,0.87482774,0.011270356,0.056904376],"study_design_scores_gemma":[0.00007879068,0.00018088782,0.0009117926,0.00005470589,0.000030778374,0.00042020314,0.00027941342,0.15894246,0.021481043,0.7889228,0.02864069,0.000056522054],"about_ca_topic_score_codex":0.0014808676,"about_ca_topic_score_gemma":0.0018830416,"teacher_disagreement_score":0.014123351,"about_ca_system_score_codex":0.0024608593,"about_ca_system_score_gemma":0.0012125382,"threshold_uncertainty_score":0.04724729},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4201548,0.0016187718,0.52314585,0.001844818,0.00038025217,0.0000923353,0.0005756396,0.0010181259,0.05116943],"genre_scores_gemma":[0.8839407,0.00053339836,0.09584576,0.00057988847,0.00012842004,0.00016825224,0.00037423274,0.00016499039,0.018264288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994522,0.0001217998,0.000050038576,0.00013403756,0.0001422628,0.00009969084],"domain_scores_gemma":[0.99806243,0.0010302666,0.00018769289,0.00024572742,0.0003215096,0.00015236043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004775476,0.0005277965,0.00058074365,0.0004831635,0.001065606,0.0018579882,0.0006756639,0.0006370176,0.0052383123],"category_scores_gemma":[0.0022021981,0.0003579195,0.0005969893,0.0006179225,0.0022633215,0.0048510185,0.0024205004,0.0013700878,0.0010746553],"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.0001594648,0.000029376157,0.00055733905,0.00009752165,0.000008379433,0.00025753025,0.00041649494,0.0057146046,0.010667702,0.9671294,0.0015742622,0.013387814],"study_design_scores_gemma":[0.000031416672,0.00006666677,0.00027470937,0.00003962836,0.000016896944,0.00035014606,0.0001834035,0.024795994,0.012221667,0.9488065,0.013173255,0.000039676346],"about_ca_topic_score_codex":0.0007747296,"about_ca_topic_score_gemma":0.0010654564,"teacher_disagreement_score":0.0052383123,"about_ca_system_score_codex":0.00088481494,"about_ca_system_score_gemma":0.00063595024,"threshold_uncertainty_score":0.017523944},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7241081,0.0011488607,0.23966047,0.00031337017,0.000115550894,0.000043171214,0.00007865081,0.00026093106,0.034270797],"genre_scores_gemma":[0.94101274,0.000667541,0.04352794,0.000065403336,0.00010276503,0.000072907744,0.00013850482,0.00013198439,0.014280356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995552,0.000073130395,0.00003218856,0.00008797854,0.0001789585,0.00007258759],"domain_scores_gemma":[0.999033,0.00044801665,0.00014464982,0.00009933998,0.0001824276,0.000092562914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003762756,0.00037972507,0.00037443635,0.0020386076,0.00063351565,0.0014967367,0.0009798341,0.00068881083,0.0031308075],"category_scores_gemma":[0.0031022867,0.00025040057,0.000391442,0.00090191886,0.0012973845,0.0025748254,0.0009833688,0.0007263179,0.00034750215],"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.000047230875,0.000026942489,0.0026295288,0.00013594833,0.000010968533,0.00042537352,0.0007276009,0.009635296,0.014196822,0.9384951,0.0009606806,0.032708433],"study_design_scores_gemma":[0.000013464208,0.00006846968,0.0039864895,0.00006952484,0.000035587997,0.001065387,0.0007018333,0.19285874,0.022812173,0.7640634,0.014275204,0.000049628678],"about_ca_topic_score_codex":0.0010557128,"about_ca_topic_score_gemma":0.0013993977,"teacher_disagreement_score":0.0031308075,"about_ca_system_score_codex":0.0010817193,"about_ca_system_score_gemma":0.00021642804,"threshold_uncertainty_score":0.010473549},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0781604,0.00023335879,0.9146781,0.0003380644,0.00007773112,0.000077071505,0.00015479451,0.00040095273,0.005879485],"genre_scores_gemma":[0.57864594,0.00047046467,0.40971774,0.00029547617,0.000112780544,0.00023088665,0.00045240475,0.00027957998,0.009794714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978795,0.00062715536,0.00013815457,0.0007341853,0.00042226582,0.00019877135],"domain_scores_gemma":[0.99316484,0.0035693287,0.00063996733,0.0016888654,0.00061985006,0.0003172715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013671195,0.0006849878,0.0009061823,0.002465716,0.001385726,0.0025293315,0.0018140449,0.0012341246,0.0038135557],"category_scores_gemma":[0.009137222,0.00068842527,0.0011473425,0.0018334623,0.0033612684,0.0054511563,0.0028544283,0.0024529977,0.0008105418],"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.00019395401,0.000070451046,0.0023200165,0.00018751253,0.000052043095,0.0003039107,0.00046727402,0.11210199,0.0076323105,0.81620365,0.0016423344,0.05882465],"study_design_scores_gemma":[0.000023761468,0.000045884317,0.0005545227,0.000035671,0.000029903631,0.00029166587,0.00022838642,0.24730581,0.005117814,0.7397023,0.006627161,0.00003711586],"about_ca_topic_score_codex":0.0012201982,"about_ca_topic_score_gemma":0.0013768558,"teacher_disagreement_score":0.0038135557,"about_ca_system_score_codex":0.0014957022,"about_ca_system_score_gemma":0.000777818,"threshold_uncertainty_score":0.012757659},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2884974,0.015699835,0.5503227,0.019627945,0.00052757486,0.00046156498,0.00560249,0.0017466939,0.11751381],"genre_scores_gemma":[0.83850133,0.007654346,0.12226771,0.0018959708,0.0020883852,0.00055554917,0.005973315,0.00079823274,0.020265158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961817,0.0008807333,0.00016955803,0.00092995015,0.0012067254,0.00063122815],"domain_scores_gemma":[0.9607934,0.03177384,0.0017013876,0.0034609905,0.0011713747,0.0010990339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00196497,0.001427969,0.00183868,0.0027763783,0.0019967773,0.0049209925,0.0028383378,0.0018059718,0.012261228],"category_scores_gemma":[0.015487732,0.0009060554,0.0021066875,0.004319302,0.0033657728,0.011443162,0.0032068992,0.0045685354,0.0011178363],"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.00061984005,0.00049087073,0.00566614,0.0014496737,0.00030510584,0.00034038382,0.0008994428,0.17527036,0.0054245284,0.71309733,0.033926997,0.06250943],"study_design_scores_gemma":[0.00007168805,0.000038895392,0.0018126471,0.000053379612,0.000067238994,0.00023177231,0.000132565,0.14700508,0.00086718524,0.84172297,0.007967737,0.000028763316],"about_ca_topic_score_codex":0.004427579,"about_ca_topic_score_gemma":0.004026035,"teacher_disagreement_score":0.012261228,"about_ca_system_score_codex":0.004281332,"about_ca_system_score_gemma":0.0015881781,"threshold_uncertainty_score":0.04101795},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5143044,0.0021768035,0.25633934,0.0015828308,0.0004216802,0.0002253245,0.0010058768,0.0004718556,0.2234719],"genre_scores_gemma":[0.9290291,0.00048488594,0.039141826,0.00022681848,0.00011338398,0.0001408297,0.00059383415,0.00011030156,0.030158967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992004,0.00007481259,0.00003260907,0.00022604033,0.00032991334,0.00013619832],"domain_scores_gemma":[0.9990532,0.00013861274,0.00015068297,0.00014317583,0.00028449652,0.00022987084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003771691,0.000488769,0.0004241426,0.0018396667,0.0018554659,0.0028205505,0.00087271875,0.0007440556,0.01271581],"category_scores_gemma":[0.0012974994,0.00029128478,0.00048441603,0.000983411,0.0015948829,0.00312114,0.0031247507,0.0011899179,0.0013731655],"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.00003277262,0.000012041343,0.0015616167,0.00006803856,0.00001399794,0.00021899052,0.00033690457,0.0009065243,0.0055390312,0.9807304,0.0015885126,0.008991156],"study_design_scores_gemma":[0.000037422444,0.0001193118,0.008254535,0.00012331137,0.00006365329,0.00401865,0.0017002522,0.026400873,0.01975154,0.7188411,0.22058447,0.00010498277],"about_ca_topic_score_codex":0.0009920208,"about_ca_topic_score_gemma":0.00088722986,"teacher_disagreement_score":0.01271581,"about_ca_system_score_codex":0.0011176047,"about_ca_system_score_gemma":0.0005446806,"threshold_uncertainty_score":0.042538643},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36412174,0.0029495666,0.51899165,0.0029171193,0.0003774464,0.00012787888,0.00081375864,0.0012142366,0.108486675],"genre_scores_gemma":[0.9254458,0.00046282983,0.057424236,0.00046028104,0.0003923486,0.00015215327,0.00037618057,0.00013420783,0.015152027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982153,0.00031296804,0.000112138834,0.00039878712,0.00056041137,0.00040052304],"domain_scores_gemma":[0.996557,0.0016095819,0.00036753571,0.00044883284,0.0005705685,0.0004465076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002082171,0.00041565165,0.00064643833,0.002413588,0.0020141064,0.0046931924,0.0009153451,0.000975791,0.0032082333],"category_scores_gemma":[0.004012564,0.00043424763,0.001745674,0.0013317798,0.0052218544,0.0074274903,0.0020441632,0.0022261613,0.000416847],"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.0000098715445,0.0000059607196,0.00031942822,0.000010947058,0.0000026813416,0.000034412715,0.00019369886,0.0003262846,0.00036501736,0.9970023,0.00026172487,0.0014676485],"study_design_scores_gemma":[0.000019084031,0.00001975332,0.0010797245,0.000018761662,0.000014821894,0.0002190487,0.00014292932,0.009030505,0.0011634831,0.97556585,0.0127012385,0.000024652687],"about_ca_topic_score_codex":0.0071786456,"about_ca_topic_score_gemma":0.0075280895,"teacher_disagreement_score":0.0071786456,"about_ca_system_score_codex":0.004136002,"about_ca_system_score_gemma":0.0012352673,"threshold_uncertainty_score":0.030008912},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62713087,0.0022262179,0.08288906,0.016225439,0.00078061386,0.000036670364,0.00029426895,0.00062342524,0.26979342],"genre_scores_gemma":[0.9776725,0.0006888661,0.0062980824,0.001176161,0.0005391946,0.00002836235,0.00020556457,0.00008229246,0.013308992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993191,0.000120566736,0.000019425295,0.00021904997,0.0001942675,0.00012759244],"domain_scores_gemma":[0.99818605,0.0009111032,0.00016849118,0.00026599457,0.00021072268,0.00025764268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082449825,0.00032100783,0.0005791423,0.0011419969,0.001483002,0.0019328338,0.00088228774,0.0017164119,0.0077298745],"category_scores_gemma":[0.0054629706,0.00033099356,0.00046099728,0.0009205386,0.0031584352,0.0045609456,0.0023377312,0.002031019,0.0010724952],"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.00005331602,0.000017903836,0.0004992227,0.000022164102,0.000004636332,0.000095555224,0.00020183776,0.0013811918,0.0007653324,0.9888237,0.0031417778,0.0049932846],"study_design_scores_gemma":[0.000017796892,0.000009897256,0.0005245762,0.0000120120085,0.0000035185208,0.00011973255,0.00010473329,0.006353986,0.00035218598,0.9889291,0.0035640425,0.000008433187],"about_ca_topic_score_codex":0.00094381795,"about_ca_topic_score_gemma":0.00086407986,"teacher_disagreement_score":0.0077298745,"about_ca_system_score_codex":0.00079878623,"about_ca_system_score_gemma":0.00042365975,"threshold_uncertainty_score":0.025859058},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5116165,0.009907889,0.3399754,0.010084067,0.00057487236,0.00018618503,0.002285735,0.0022377367,0.1231316],"genre_scores_gemma":[0.78435695,0.005522164,0.16231312,0.0012959407,0.00072131614,0.00019855122,0.0021157032,0.001922173,0.041554056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980065,0.0005249175,0.00011575309,0.00046011465,0.00049860793,0.00039406525],"domain_scores_gemma":[0.98137707,0.011719451,0.0013151129,0.0033667677,0.0010955324,0.0011261337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020715138,0.0011616439,0.0015008986,0.0016164745,0.0017541877,0.004064133,0.0030750292,0.0016967756,0.012739284],"category_scores_gemma":[0.019988796,0.0016513412,0.000889323,0.0032769234,0.0025964454,0.017487258,0.004197374,0.0038188307,0.0037999754],"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.0020285747,0.00028023458,0.012744504,0.0008863641,0.000242033,0.0006091066,0.001993034,0.15256833,0.022981385,0.5440187,0.046781264,0.21486655],"study_design_scores_gemma":[0.00013958525,0.00021839669,0.0039125257,0.00021413859,0.00019069252,0.0009370492,0.0007040864,0.1675955,0.014337199,0.76690054,0.044749036,0.000101255566],"about_ca_topic_score_codex":0.0014713577,"about_ca_topic_score_gemma":0.0015928084,"teacher_disagreement_score":0.012739284,"about_ca_system_score_codex":0.0019585867,"about_ca_system_score_gemma":0.00066786323,"threshold_uncertainty_score":0.042617083},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60535496,0.0006475612,0.33561277,0.0010424023,0.000082366976,0.00017725438,0.0012167357,0.00060215377,0.055263855],"genre_scores_gemma":[0.8896769,0.00094074535,0.097679,0.00036397896,0.00007808508,0.00020186159,0.0019336891,0.00025606947,0.008869625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991357,0.0002571422,0.000044107535,0.00020595227,0.00017507785,0.00018212596],"domain_scores_gemma":[0.99677724,0.0016145995,0.000594456,0.00042163694,0.00034779625,0.00024420468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004344733,0.00065421325,0.0006248221,0.001320352,0.001619049,0.0017631516,0.001107263,0.00078385964,0.008464288],"category_scores_gemma":[0.004224874,0.0005469293,0.00079475576,0.0027235097,0.0017886627,0.004731258,0.002028582,0.0016395155,0.000726562],"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.0005155268,0.0001569319,0.003025627,0.0002669876,0.000055096792,0.0005985562,0.0012961336,0.08346001,0.007039092,0.84341246,0.0051991986,0.0549744],"study_design_scores_gemma":[0.00005964373,0.000114591494,0.0018082985,0.000121384495,0.000047774218,0.0005276409,0.0009068626,0.115333,0.0032854476,0.8621261,0.015625041,0.00004418831],"about_ca_topic_score_codex":0.0027377282,"about_ca_topic_score_gemma":0.0017830967,"teacher_disagreement_score":0.008464288,"about_ca_system_score_codex":0.0010957312,"about_ca_system_score_gemma":0.00047819284,"threshold_uncertainty_score":0.028315842},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5915115,0.0009772037,0.3730075,0.0075554517,0.00016893489,0.00039228596,0.0036072985,0.0025945355,0.02018521],"genre_scores_gemma":[0.8168098,0.00055882987,0.16682217,0.0006621104,0.00017806765,0.00023644301,0.0062806373,0.00035845203,0.0080934055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976388,0.00037455306,0.00022540613,0.0009812379,0.00035265923,0.0004274207],"domain_scores_gemma":[0.9812402,0.013306542,0.0016987065,0.0022599255,0.0007603141,0.0007342846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011855334,0.0008652948,0.0013545692,0.0010118888,0.001822777,0.004116809,0.0032561293,0.0024211486,0.005470769],"category_scores_gemma":[0.0084987255,0.000937153,0.0019730313,0.0022066191,0.002906536,0.011889831,0.0022092368,0.0036925548,0.00064916286],"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.0021800043,0.0011541657,0.015331774,0.0024393664,0.00039281862,0.0017066413,0.002835528,0.26479018,0.030883998,0.4464117,0.031038888,0.20083497],"study_design_scores_gemma":[0.00010432545,0.00014914872,0.0034742784,0.00010102375,0.00015901876,0.0017736839,0.0013373527,0.2513788,0.03196782,0.6944162,0.015018364,0.00011995493],"about_ca_topic_score_codex":0.0033012864,"about_ca_topic_score_gemma":0.0045383866,"teacher_disagreement_score":0.005470769,"about_ca_system_score_codex":0.0017302955,"about_ca_system_score_gemma":0.001473301,"threshold_uncertainty_score":0.018301606},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5187869,0.0019250808,0.4632167,0.0019910007,0.000076277596,0.00034820053,0.001161526,0.0015382019,0.010956135],"genre_scores_gemma":[0.72472125,0.0011567688,0.26490307,0.00025610736,0.00007889131,0.00017670791,0.0028877961,0.00029387954,0.005525539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987863,0.00030332876,0.00008148605,0.00035854874,0.00023679883,0.00023358673],"domain_scores_gemma":[0.99477404,0.0032375325,0.0006023866,0.0007163772,0.00031964027,0.00035010665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009543015,0.0007758622,0.0010734868,0.0011891695,0.0011214376,0.0024971303,0.0017175849,0.0010732781,0.0048323213],"category_scores_gemma":[0.006437291,0.00074436335,0.0011600576,0.002088975,0.0014096985,0.00472882,0.0018494459,0.0017978633,0.00059698196],"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.0011725201,0.00036291243,0.00541121,0.0009127317,0.00017904458,0.00035636208,0.0008882889,0.60175246,0.021878894,0.25069323,0.007541172,0.108851105],"study_design_scores_gemma":[0.00013346881,0.00010019898,0.0008655178,0.000059188424,0.00005957942,0.00032443748,0.00041063994,0.6715659,0.008454408,0.3135145,0.004479499,0.000032743363],"about_ca_topic_score_codex":0.005037395,"about_ca_topic_score_gemma":0.006522913,"teacher_disagreement_score":0.005037395,"about_ca_system_score_codex":0.0020984935,"about_ca_system_score_gemma":0.00128759,"threshold_uncertainty_score":0.016165733},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7630267,0.0008041405,0.22805846,0.0018063112,0.0000587178,0.0002271555,0.00044706778,0.00051395217,0.0050574243],"genre_scores_gemma":[0.9736139,0.00040270473,0.02287363,0.00010280655,0.00007062691,0.00020797322,0.00029550106,0.00012282422,0.0023098506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99418795,0.0025150336,0.00031408356,0.0008048518,0.0012792405,0.00089885807],"domain_scores_gemma":[0.89943534,0.07318065,0.010190382,0.009344132,0.0045746337,0.0032748447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009715044,0.000823802,0.0015145304,0.0015884119,0.001232972,0.002569158,0.0029879042,0.0020493008,0.003673348],"category_scores_gemma":[0.06949862,0.00090107915,0.0010883891,0.0010307638,0.0033912577,0.008518718,0.0020303377,0.0032220127,0.00067185576],"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.0043749325,0.0006468565,0.014839426,0.0005397186,0.00016661572,0.00081427797,0.0018746612,0.28745833,0.043568037,0.5943146,0.0050182072,0.046384506],"study_design_scores_gemma":[0.0001956449,0.0005208338,0.002855615,0.00005507971,0.000050354032,0.000690123,0.0003290128,0.8497525,0.0099054305,0.13439494,0.0011595916,0.00009078372],"about_ca_topic_score_codex":0.00048426643,"about_ca_topic_score_gemma":0.0004132383,"teacher_disagreement_score":0.009715044,"about_ca_system_score_codex":0.003868946,"about_ca_system_score_gemma":0.001449315,"threshold_uncertainty_score":0.051378727},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05128995,0.0010592161,0.901528,0.00051499583,0.00031321953,0.00018859972,0.0017252131,0.0022952058,0.04108568],"genre_scores_gemma":[0.4427691,0.0018062909,0.5143231,0.0004115748,0.00029837972,0.00030633542,0.0025371893,0.0010123575,0.036535602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985501,0.00028251574,0.00012211107,0.00043753345,0.0003605559,0.0002471508],"domain_scores_gemma":[0.99697864,0.0010409203,0.0005009106,0.0007595821,0.00049079966,0.00022910863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063990394,0.0007481816,0.00049287884,0.0017205554,0.0015358472,0.0038568566,0.0012850887,0.0010969328,0.016001036],"category_scores_gemma":[0.0050567705,0.00087899837,0.00097292714,0.0026624443,0.001887439,0.0041903844,0.0017203842,0.001307807,0.0025898372],"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.00013602286,0.000036863603,0.0006576597,0.00022291127,0.000027193575,0.00014667434,0.00033134889,0.036071755,0.009067875,0.8757959,0.0073733325,0.07013237],"study_design_scores_gemma":[0.00008117419,0.00014578368,0.00089169596,0.00009220057,0.000039211784,0.0006010346,0.00027174098,0.08228307,0.008322716,0.8135882,0.093618125,0.00006504484],"about_ca_topic_score_codex":0.0018740249,"about_ca_topic_score_gemma":0.0023755447,"teacher_disagreement_score":0.016001036,"about_ca_system_score_codex":0.0021329832,"about_ca_system_score_gemma":0.00082540815,"threshold_uncertainty_score":0.053528845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27403468,0.00013046936,0.7078245,0.000634542,0.000064240856,0.0002369876,0.000454688,0.0024744086,0.014145428],"genre_scores_gemma":[0.8287872,0.00007185645,0.16546519,0.00015537253,0.00003669921,0.000112452726,0.0010179003,0.00028178448,0.004071601],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838126,0.0003205302,0.00011429762,0.0005696888,0.00037568138,0.00023851242],"domain_scores_gemma":[0.99210536,0.003222799,0.0007475367,0.0026919637,0.00088520884,0.00034709985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083395786,0.00040200955,0.00041835278,0.00091559463,0.0009768783,0.0015080258,0.0009936539,0.00065588474,0.0067738947],"category_scores_gemma":[0.006993466,0.00041806532,0.00064674765,0.0010962109,0.0014997163,0.003880543,0.0023170898,0.0012179543,0.0007246079],"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.0013017558,0.00049337663,0.014442147,0.00036934766,0.00012776956,0.000554594,0.0013571425,0.03653876,0.041421153,0.43669805,0.01109429,0.45560166],"study_design_scores_gemma":[0.00015430481,0.00021407827,0.003907041,0.000034502704,0.000067810615,0.00073628617,0.0005745786,0.19729091,0.053451948,0.7296635,0.013818552,0.0000864495],"about_ca_topic_score_codex":0.0014573954,"about_ca_topic_score_gemma":0.0013811646,"teacher_disagreement_score":0.0067738947,"about_ca_system_score_codex":0.0009854978,"about_ca_system_score_gemma":0.0011115951,"threshold_uncertainty_score":0.022660911},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16884112,0.017269531,0.48946223,0.021460518,0.0017604176,0.00013336376,0.0015115878,0.0005605156,0.2990008],"genre_scores_gemma":[0.8494344,0.007989572,0.09969607,0.0019304982,0.001171147,0.00022585227,0.0008163953,0.00021493934,0.03852108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978707,0.00052019133,0.00012348547,0.0005828006,0.00059102,0.00031183823],"domain_scores_gemma":[0.9914035,0.005038842,0.00062328915,0.0012473412,0.0010404328,0.0006466763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025526115,0.001033367,0.0011221435,0.0023341451,0.0031356988,0.0033000924,0.0014566781,0.0015208871,0.008970855],"category_scores_gemma":[0.010346607,0.00067797076,0.00131527,0.0024469772,0.0064122216,0.008400075,0.003825281,0.0037202805,0.0015220816],"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.000031168678,0.000013504324,0.00026306615,0.000055008255,0.0000121592775,0.000074855685,0.00010095446,0.0025016654,0.00055134675,0.98458004,0.003528506,0.008287678],"study_design_scores_gemma":[0.000013655569,0.000018060817,0.00023257245,0.000018709165,0.000006348431,0.00013219278,0.000059119477,0.0024157257,0.0005390398,0.9790141,0.017536433,0.000013974856],"about_ca_topic_score_codex":0.0016342168,"about_ca_topic_score_gemma":0.0010641874,"teacher_disagreement_score":0.008970855,"about_ca_system_score_codex":0.0025684554,"about_ca_system_score_gemma":0.0007494186,"threshold_uncertainty_score":0.030010521},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31944537,0.0010183274,0.65798575,0.00082559255,0.00010160987,0.00010407018,0.00019164431,0.0011441854,0.019183468],"genre_scores_gemma":[0.6952468,0.0004047742,0.2945656,0.00012653181,0.000074910015,0.0001648392,0.00027992908,0.00025857895,0.0088780755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990834,0.00023215229,0.000049618357,0.00015601031,0.00032843358,0.00015026849],"domain_scores_gemma":[0.9976494,0.0014764807,0.0002173823,0.0004291558,0.00015154152,0.00007612897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012543155,0.0005809067,0.000817373,0.0008090625,0.00073397387,0.0016436568,0.0010390843,0.00056812953,0.0032386912],"category_scores_gemma":[0.0069561666,0.0002501894,0.00046075234,0.0011506343,0.0015931042,0.0024002176,0.0010842186,0.001345321,0.0009238859],"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.0008972399,0.00014373154,0.0022190895,0.00021865283,0.00004386479,0.00011741771,0.00041917473,0.2385216,0.01363132,0.6218288,0.0033136185,0.118645534],"study_design_scores_gemma":[0.00010869389,0.000111810805,0.0004554406,0.000037054804,0.000025802268,0.00008881308,0.000055906174,0.6353218,0.00925714,0.34934416,0.0051570837,0.00003614448],"about_ca_topic_score_codex":0.001614567,"about_ca_topic_score_gemma":0.0014077491,"teacher_disagreement_score":0.0032386912,"about_ca_system_score_codex":0.0019602692,"about_ca_system_score_gemma":0.0012956156,"threshold_uncertainty_score":0.014222741},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19218424,0.0021307403,0.7243893,0.0042256797,0.0002839167,0.00008360496,0.00040838058,0.0010269086,0.07526717],"genre_scores_gemma":[0.91447836,0.00069433625,0.07092456,0.00063668005,0.00018032877,0.00010580641,0.00035201025,0.00020175749,0.012426066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800533,0.000585955,0.00013231143,0.00045565615,0.00048066475,0.00034012247],"domain_scores_gemma":[0.9966363,0.0016521198,0.00027315086,0.0005992433,0.00045787104,0.00038134726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001948893,0.00041862184,0.00054176495,0.0017803769,0.001630534,0.003360829,0.00072028453,0.0011500628,0.0043449514],"category_scores_gemma":[0.0043927096,0.00044372556,0.0010899294,0.0012236789,0.0048898794,0.007975814,0.004172899,0.0026442294,0.00044299036],"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.000012732115,0.000013786879,0.00023307445,0.000019294072,0.000004039859,0.000040453473,0.00021222742,0.0010046209,0.00034254955,0.99220884,0.0003546336,0.0055536865],"study_design_scores_gemma":[0.0000062346558,0.000013619481,0.00017914792,0.000011834097,0.0000057056254,0.00009086614,0.00008387066,0.004194863,0.00044219565,0.98795265,0.0070106382,0.000008268948],"about_ca_topic_score_codex":0.0013417574,"about_ca_topic_score_gemma":0.0011065518,"teacher_disagreement_score":0.0043449514,"about_ca_system_score_codex":0.0020076546,"about_ca_system_score_gemma":0.0013625019,"threshold_uncertainty_score":0.0145666},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5515025,0.0015447632,0.40021953,0.00062605826,0.0001179862,0.00006881425,0.0007211431,0.00038053392,0.044818543],"genre_scores_gemma":[0.91419494,0.0014894431,0.06853291,0.00032549928,0.00020634732,0.00014340365,0.00071782526,0.00021044041,0.014179197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841046,0.0002916276,0.00011552518,0.0004582821,0.00032906985,0.00039491546],"domain_scores_gemma":[0.9942439,0.0028722696,0.0010625665,0.00071514037,0.00045865285,0.00064745283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014614431,0.00064420514,0.00074000476,0.0021774461,0.0014314314,0.0021385949,0.0008541002,0.0007783463,0.0051561687],"category_scores_gemma":[0.0064919833,0.0005301996,0.0010012201,0.0023794386,0.002966021,0.0037333532,0.0018636386,0.0016540334,0.0009445281],"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.0001732487,0.000085864005,0.010667692,0.00014030481,0.00003519224,0.00047586358,0.0011389494,0.016280394,0.013078933,0.9052803,0.002212947,0.050430313],"study_design_scores_gemma":[0.000024961835,0.00008931047,0.008732385,0.00008195308,0.00003416489,0.0015593375,0.00036505522,0.064702466,0.0057503786,0.9054268,0.013154402,0.000078875695],"about_ca_topic_score_codex":0.001552269,"about_ca_topic_score_gemma":0.0015091103,"teacher_disagreement_score":0.0051561687,"about_ca_system_score_codex":0.0015647358,"about_ca_system_score_gemma":0.0007581262,"threshold_uncertainty_score":0.017249048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052645456,0.001921336,0.79400575,0.0033810372,0.0017802838,0.00023143146,0.00045996945,0.0006850624,0.14488964],"genre_scores_gemma":[0.56811297,0.0029981018,0.3629418,0.0023867895,0.0017020273,0.00060301664,0.0006604022,0.0008899005,0.059704985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910647,0.00012985348,0.00004960588,0.00014932382,0.00042196253,0.00014278054],"domain_scores_gemma":[0.99885917,0.0005122957,0.00008701251,0.00012042887,0.00032999887,0.000091151895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011708807,0.0013642638,0.000986284,0.0016871482,0.0022654708,0.0018399566,0.0015235048,0.001199457,0.018076804],"category_scores_gemma":[0.0037807599,0.0007767832,0.0024274173,0.0014689818,0.0026888368,0.0042149355,0.003251456,0.004727833,0.0035570678],"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.00002662594,0.000053680826,0.00013806159,0.00017623235,0.000018263843,0.00042273,0.0005301021,0.0011447226,0.0044218153,0.9696993,0.0047058733,0.018662572],"study_design_scores_gemma":[0.00005070831,0.000088518704,0.00039875932,0.00009750932,0.000042025516,0.00068432133,0.00016593032,0.007073438,0.0059743808,0.94862,0.03674025,0.00006416186],"about_ca_topic_score_codex":0.0022279953,"about_ca_topic_score_gemma":0.0026017185,"teacher_disagreement_score":0.018076804,"about_ca_system_score_codex":0.0018162748,"about_ca_system_score_gemma":0.0012422783,"threshold_uncertainty_score":0.060472965},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5598397,0.0017885215,0.26745862,0.002423143,0.00029701868,0.000119376986,0.0005748892,0.00035666738,0.16714194],"genre_scores_gemma":[0.9256438,0.0010991374,0.047866784,0.00032745447,0.00023989203,0.000092456285,0.000315842,0.00012341015,0.02429115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993625,0.00010246492,0.000047110243,0.0001415851,0.00026018202,0.000086186075],"domain_scores_gemma":[0.99886656,0.00046627558,0.00020792309,0.00015525536,0.00021998429,0.0000840987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005793309,0.0004567883,0.00043002982,0.0017481135,0.0012425594,0.0037742604,0.0011600262,0.0007639319,0.0072368635],"category_scores_gemma":[0.002773883,0.0004499961,0.0007888197,0.0019917656,0.002735231,0.0067498917,0.0015897616,0.0017574045,0.00076880923],"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.000012472604,0.000008757048,0.0002684904,0.00003531265,0.000002355945,0.00016543975,0.00033789675,0.00046477313,0.0008416348,0.9935323,0.00041752224,0.0039130417],"study_design_scores_gemma":[0.00001377618,0.000017138276,0.0005200586,0.000025601035,0.00001394934,0.00043140943,0.00036274845,0.0056697805,0.001644182,0.98259073,0.008684193,0.000026462514],"about_ca_topic_score_codex":0.001250438,"about_ca_topic_score_gemma":0.0014134377,"teacher_disagreement_score":0.0072368635,"about_ca_system_score_codex":0.0018384587,"about_ca_system_score_gemma":0.0005927902,"threshold_uncertainty_score":0.024209738},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6000346,0.0002748197,0.37821507,0.0018612557,0.00009242895,0.00045229506,0.0010431821,0.001664368,0.01636197],"genre_scores_gemma":[0.7722263,0.00018267657,0.2171512,0.00025282486,0.0000398529,0.00019622983,0.0014945294,0.00026767855,0.008188788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995272,0.00006464211,0.000034582547,0.00015068347,0.00009669084,0.00012622801],"domain_scores_gemma":[0.99889934,0.00054500427,0.00011514102,0.0001744224,0.00009278056,0.0001733113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051526056,0.00066793576,0.00072373764,0.00079205737,0.0014697138,0.0012518163,0.00096462347,0.0010636305,0.00710075],"category_scores_gemma":[0.0030188893,0.00040639058,0.0010993435,0.000664655,0.00103543,0.0033004205,0.002951041,0.0010706766,0.0010654797],"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.0033374508,0.00086289033,0.022952823,0.0016897256,0.0003330634,0.00226018,0.0038248212,0.060153887,0.1388747,0.40368667,0.022648416,0.33937547],"study_design_scores_gemma":[0.00039853275,0.001212438,0.009572414,0.00017917015,0.000270837,0.0012905258,0.0021799018,0.21774843,0.07052233,0.64976287,0.046686146,0.00017641742],"about_ca_topic_score_codex":0.0015503383,"about_ca_topic_score_gemma":0.0032938845,"teacher_disagreement_score":0.00710075,"about_ca_system_score_codex":0.00074998016,"about_ca_system_score_gemma":0.0011157299,"threshold_uncertainty_score":0.023754418},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11419894,0.00054277445,0.8544178,0.003494052,0.0002525101,0.00029294507,0.00036661953,0.002726493,0.023707962],"genre_scores_gemma":[0.51587325,0.00040090873,0.46923578,0.00068719126,0.00005913962,0.00025152322,0.00058162864,0.0002560671,0.0126545215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990953,0.00021709612,0.000052324354,0.00023646471,0.00022389118,0.00017498915],"domain_scores_gemma":[0.9974879,0.001255122,0.00021921397,0.0006286869,0.00025383543,0.00015508468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085762155,0.0009450178,0.0008479951,0.00043480002,0.0014622778,0.0009446038,0.0029232732,0.0019917437,0.007655576],"category_scores_gemma":[0.00506429,0.0003972402,0.00086393906,0.00056096946,0.0013949071,0.0032607676,0.0032526597,0.0019370025,0.002881036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030436928,0.00034790608,0.0045973863,0.001370149,0.00013576448,0.0017169645,0.0020651307,0.5317238,0.036643907,0.12884903,0.042817675,0.24668866],"study_design_scores_gemma":[0.00021491709,0.00048141467,0.0012384799,0.00013287285,0.000046644578,0.0012366257,0.001300269,0.8405063,0.053398322,0.06584866,0.03548817,0.00010727706],"about_ca_topic_score_codex":0.002655329,"about_ca_topic_score_gemma":0.0037337008,"teacher_disagreement_score":0.007655576,"about_ca_system_score_codex":0.00092139153,"about_ca_system_score_gemma":0.0008191948,"threshold_uncertainty_score":0.025610507},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13757353,0.0022171582,0.7881178,0.0009971091,0.00028184496,0.00015218525,0.0016910989,0.0010643394,0.06790482],"genre_scores_gemma":[0.6989494,0.0017792179,0.2734954,0.0010407254,0.00025882208,0.00024168809,0.0029450743,0.00046023563,0.020829462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993198,0.000082011116,0.00003570184,0.00028981979,0.00016182732,0.00011091512],"domain_scores_gemma":[0.9977235,0.00093905476,0.0003055777,0.00037708413,0.0003473789,0.00030735676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036673286,0.0004972339,0.00061944267,0.0012598803,0.0010698598,0.0017821684,0.0012210138,0.00070824113,0.007543246],"category_scores_gemma":[0.0029374368,0.0003054092,0.00056684733,0.0011338687,0.0008537735,0.0039838385,0.001722673,0.0015453509,0.001563161],"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.0001249723,0.00007511352,0.0017187404,0.00035258074,0.000032655083,0.00019379581,0.00031995375,0.0077409507,0.009517311,0.8400709,0.007737556,0.13211541],"study_design_scores_gemma":[0.000014837092,0.000041727057,0.0010789342,0.000077443336,0.000032958775,0.00077084714,0.00018346428,0.041338008,0.0065764184,0.9106453,0.03921235,0.000027745018],"about_ca_topic_score_codex":0.00061215565,"about_ca_topic_score_gemma":0.0009904702,"teacher_disagreement_score":0.007543246,"about_ca_system_score_codex":0.00061810925,"about_ca_system_score_gemma":0.00039125848,"threshold_uncertainty_score":0.02523464},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6495317,0.0012392645,0.3219839,0.0002754177,0.0000841587,0.000073830255,0.0003795854,0.00028643594,0.026145611],"genre_scores_gemma":[0.93065965,0.0005459059,0.06206606,0.00011708796,0.000097590615,0.0001529673,0.00029929954,0.000061347506,0.006000014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965215,0.000054633354,0.00002749292,0.00007660943,0.000121410354,0.00006769804],"domain_scores_gemma":[0.99884486,0.0004655612,0.00025530483,0.00015383092,0.00018125592,0.00009916767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041138058,0.00043670472,0.00049687334,0.0013319168,0.00081343093,0.0011805856,0.0007365766,0.00068817905,0.002065426],"category_scores_gemma":[0.0025631727,0.0002740308,0.0006170286,0.0011612307,0.000995817,0.002034998,0.00064636435,0.0007288158,0.00034867387],"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.000041565756,0.000012270784,0.0011486819,0.00008021039,0.000011215795,0.00044875953,0.00035130646,0.00682334,0.0080131795,0.9697262,0.00048311,0.012860162],"study_design_scores_gemma":[0.000016157075,0.00004293631,0.0015798791,0.00004241917,0.000021374683,0.0012191908,0.00015648876,0.048257668,0.0046369648,0.93832713,0.0056649614,0.000034808243],"about_ca_topic_score_codex":0.00051170593,"about_ca_topic_score_gemma":0.00085818564,"teacher_disagreement_score":0.002065426,"about_ca_system_score_codex":0.000666547,"about_ca_system_score_gemma":0.00033473587,"threshold_uncertainty_score":0.0069094896},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37126362,0.0005651825,0.60968363,0.001565019,0.00012561501,0.00040012383,0.001484974,0.0065187956,0.008393069],"genre_scores_gemma":[0.4606038,0.00029847526,0.5210889,0.00045758983,0.000085710875,0.00026324316,0.0040114764,0.0009086931,0.012282085],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999121,0.0001242614,0.00005647041,0.0003097047,0.00018009439,0.00020844943],"domain_scores_gemma":[0.9974916,0.0010791508,0.0002797507,0.00061295775,0.00023176713,0.00030478643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062916527,0.0014171482,0.0011997621,0.0010328783,0.0016460159,0.0015308135,0.0018186605,0.0011997541,0.005450875],"category_scores_gemma":[0.0032337676,0.0009246749,0.0015043075,0.0013996504,0.0012320692,0.0043261955,0.0039111753,0.0019730502,0.0022448397],"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.007461011,0.0012967396,0.006837225,0.001907531,0.00037312845,0.0016790517,0.0032403914,0.16032055,0.19808476,0.16383094,0.04349008,0.4114786],"study_design_scores_gemma":[0.0006869351,0.00083962537,0.0018280974,0.000091106835,0.00021684176,0.0011310036,0.0006410708,0.5354088,0.06855833,0.3656575,0.024821086,0.00011967262],"about_ca_topic_score_codex":0.003360412,"about_ca_topic_score_gemma":0.0055516833,"teacher_disagreement_score":0.005450875,"about_ca_system_score_codex":0.0012909416,"about_ca_system_score_gemma":0.0014892948,"threshold_uncertainty_score":0.018234968},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5568163,0.0010598295,0.4235568,0.00068651116,0.00010299243,0.00021717686,0.0028959622,0.0013381653,0.013326214],"genre_scores_gemma":[0.55126214,0.0009741718,0.43389305,0.00010538086,0.000037532016,0.00015987403,0.007480926,0.00036132502,0.0057256813],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995652,0.000078341836,0.000035865418,0.00008760258,0.00015825471,0.00007474746],"domain_scores_gemma":[0.9973907,0.001380844,0.00033086966,0.00037580723,0.00036916105,0.00015265554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028263568,0.00045483178,0.00082550885,0.0022510204,0.00092797104,0.001474105,0.0010842418,0.0011041289,0.0052459734],"category_scores_gemma":[0.005035614,0.0005421583,0.0006654134,0.0027560347,0.000988144,0.0024242003,0.0015083805,0.0009816132,0.0008523709],"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.00038401783,0.00019683495,0.018048678,0.0013016971,0.00014272383,0.0009957997,0.0012797476,0.2879666,0.023003435,0.28599322,0.021303158,0.3593841],"study_design_scores_gemma":[0.00007297855,0.00012643293,0.005097728,0.0002111322,0.00008202453,0.000850952,0.0012156831,0.5726679,0.014100571,0.3861571,0.01936244,0.000055089364],"about_ca_topic_score_codex":0.002670188,"about_ca_topic_score_gemma":0.0046363194,"teacher_disagreement_score":0.0052459734,"about_ca_system_score_codex":0.0008195189,"about_ca_system_score_gemma":0.00055007,"threshold_uncertainty_score":0.017549574},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.497471,0.0050719366,0.43861338,0.002456055,0.0003359234,0.0000708702,0.0005734667,0.0011903909,0.05421696],"genre_scores_gemma":[0.94483423,0.0021591145,0.041915845,0.0005069904,0.00050797267,0.00017664151,0.0007346556,0.0003745036,0.00878999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988839,0.00034680354,0.00006470187,0.00016463814,0.00036555878,0.00017447027],"domain_scores_gemma":[0.9948979,0.0028727038,0.00054692826,0.0005315275,0.0007393519,0.0004116326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002087688,0.0007945237,0.001008811,0.0037028205,0.0011708857,0.0024186622,0.002483642,0.0012777628,0.004375647],"category_scores_gemma":[0.019029412,0.0005286756,0.0008971504,0.0022433077,0.0030739594,0.0066927113,0.0017894359,0.002422334,0.00077389134],"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.00007404229,0.000071652226,0.0016913437,0.00018643864,0.000022490069,0.00022333114,0.00025285216,0.021122374,0.0027710681,0.9572909,0.0021090584,0.014184486],"study_design_scores_gemma":[0.000013550359,0.0000283831,0.0011892206,0.00007239292,0.000016008367,0.00022092168,0.00010846673,0.21750161,0.0011844684,0.7782569,0.0013747087,0.000033348522],"about_ca_topic_score_codex":0.0020969491,"about_ca_topic_score_gemma":0.0016010077,"teacher_disagreement_score":0.004375647,"about_ca_system_score_codex":0.0017889496,"about_ca_system_score_gemma":0.0006604896,"threshold_uncertainty_score":0.014637947},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6338466,0.0064047333,0.26573625,0.0056266063,0.00042936322,0.00009741364,0.0017151099,0.0018020412,0.08434193],"genre_scores_gemma":[0.9704752,0.0017769948,0.018264195,0.00052185013,0.0005333888,0.00014001601,0.000742103,0.00041482737,0.0071312985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860173,0.00021540334,0.000048695158,0.00020196867,0.0005192942,0.00041291962],"domain_scores_gemma":[0.982777,0.011734104,0.0014196235,0.0014004889,0.0013191573,0.0013496052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018716092,0.00055438187,0.0007816408,0.0028137912,0.0014797907,0.0036631708,0.0019200048,0.001309988,0.009885501],"category_scores_gemma":[0.02563597,0.0006908255,0.0007065201,0.002551127,0.0039667273,0.0068171397,0.0036231258,0.0034249364,0.0016254823],"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.00018834768,0.000040111598,0.00355917,0.00020630095,0.00002992165,0.00019401891,0.00060935476,0.016373876,0.0031452563,0.94865286,0.005469359,0.021531306],"study_design_scores_gemma":[0.000043448206,0.00007831604,0.0025290626,0.00009410122,0.000042409887,0.0005062811,0.0003250335,0.09134198,0.0031109203,0.89751446,0.0043648053,0.00004916378],"about_ca_topic_score_codex":0.0013325631,"about_ca_topic_score_gemma":0.0014434418,"teacher_disagreement_score":0.009885501,"about_ca_system_score_codex":0.0021085176,"about_ca_system_score_gemma":0.0013723426,"threshold_uncertainty_score":0.033070266},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.634178,0.00076660514,0.14280319,0.0041491855,0.0013356609,0.00009182734,0.00016581688,0.0005284977,0.21598132],"genre_scores_gemma":[0.96096563,0.00033273577,0.01711678,0.00036731295,0.00018685435,0.000034328386,0.0000842209,0.00010856544,0.020803634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993048,0.00007949482,0.00003160337,0.00013716519,0.00030262035,0.0001443931],"domain_scores_gemma":[0.9995097,0.000084629784,0.00007861589,0.00015688094,0.0000926858,0.00007744558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007328148,0.00039807038,0.00056315714,0.0007234894,0.0019337586,0.0017274176,0.0009751516,0.0013688704,0.0046424055],"category_scores_gemma":[0.002317449,0.00029400142,0.0007392439,0.0005846257,0.0028753472,0.005009823,0.0018108512,0.0025016135,0.0007602362],"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.00001752139,0.000014327625,0.00036366063,0.000015437465,0.0000023413845,0.00020320137,0.00028466657,0.00087579136,0.0021302148,0.9908291,0.0007733654,0.004490505],"study_design_scores_gemma":[0.000021793654,0.000040901472,0.00043802644,0.000023628176,0.0000060247967,0.000494734,0.00028350716,0.010028869,0.0026663886,0.9748062,0.011159495,0.000030443896],"about_ca_topic_score_codex":0.0016905593,"about_ca_topic_score_gemma":0.0012452672,"teacher_disagreement_score":0.0046424055,"about_ca_system_score_codex":0.0014828142,"about_ca_system_score_gemma":0.0009159004,"threshold_uncertainty_score":0.015530348},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60612375,0.0012120404,0.2991585,0.001060213,0.00027610714,0.00018211259,0.0019593714,0.0007649617,0.089262985],"genre_scores_gemma":[0.8541828,0.00088942744,0.08652595,0.00057369564,0.00023133596,0.00031880915,0.0042745625,0.00039576372,0.05260761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947876,0.00008469709,0.000034821987,0.0001319065,0.00013742542,0.00013253902],"domain_scores_gemma":[0.9989643,0.00052995194,0.00013926832,0.00011821477,0.0001396575,0.000108600456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047053632,0.00064023066,0.000456794,0.0014494936,0.0012478301,0.0020792573,0.0008547389,0.00055018114,0.014553717],"category_scores_gemma":[0.001448256,0.00043424184,0.0012880162,0.0016224827,0.0015499331,0.0024336805,0.001646838,0.0012051074,0.002052037],"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.00021557862,0.00020035259,0.0038048604,0.00029606832,0.000033317694,0.0005278894,0.0015732223,0.011358175,0.019607382,0.87346715,0.01022561,0.078690365],"study_design_scores_gemma":[0.000036698264,0.00009870468,0.0026488604,0.00006004661,0.000037060312,0.0006188683,0.00031887644,0.01930773,0.013243721,0.940888,0.022677869,0.000063587744],"about_ca_topic_score_codex":0.0021350912,"about_ca_topic_score_gemma":0.0029601553,"teacher_disagreement_score":0.014553717,"about_ca_system_score_codex":0.000860316,"about_ca_system_score_gemma":0.0004745452,"threshold_uncertainty_score":0.04868704},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6437455,0.000937341,0.31976888,0.0012897096,0.00014493833,0.00016204451,0.0016543892,0.00090238545,0.031394828],"genre_scores_gemma":[0.81202304,0.0011360851,0.17106095,0.00039197475,0.00014169008,0.00018667274,0.0025260341,0.00027323308,0.01226028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842775,0.000290151,0.0001525769,0.00040294672,0.00034156005,0.00038501862],"domain_scores_gemma":[0.99624544,0.0016098223,0.000652168,0.00093815156,0.00021226068,0.0003422538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010749246,0.0011450605,0.0021623063,0.0013309942,0.0018129997,0.0028340777,0.002090392,0.0020203718,0.011086527],"category_scores_gemma":[0.008306067,0.0011803473,0.0012887255,0.004210713,0.0017238978,0.0069825007,0.004375711,0.0016257152,0.002195908],"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.001956349,0.00040038273,0.009078757,0.0007245878,0.00041639135,0.0012440507,0.00082149485,0.34327483,0.024239648,0.45565417,0.0159509,0.1462385],"study_design_scores_gemma":[0.0001911193,0.0004964382,0.0025213498,0.00011515514,0.00017710387,0.0011595835,0.0006507206,0.4395299,0.020069642,0.51862836,0.016360022,0.000100685415],"about_ca_topic_score_codex":0.0015634685,"about_ca_topic_score_gemma":0.00108334,"teacher_disagreement_score":0.011086527,"about_ca_system_score_codex":0.0010957845,"about_ca_system_score_gemma":0.0005730374,"threshold_uncertainty_score":0.037088096},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45767596,0.0067160665,0.2791085,0.07078787,0.0022548756,0.0003521436,0.0081658475,0.0037126923,0.1712261],"genre_scores_gemma":[0.8380877,0.0026692303,0.09341116,0.010771144,0.004159261,0.000976654,0.0076159774,0.0011587241,0.04115023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920032,0.0019477075,0.00036361272,0.0028504776,0.0015434799,0.001291579],"domain_scores_gemma":[0.96435857,0.029041935,0.0017988301,0.0023426581,0.0010956584,0.0013623901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038444698,0.0037426066,0.0035630544,0.0021266988,0.0030973062,0.00950766,0.0056086057,0.004695314,0.015631802],"category_scores_gemma":[0.021782946,0.0019307019,0.0045145582,0.0028515905,0.007709635,0.015099751,0.004858079,0.011930324,0.004656197],"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.0028290034,0.00068806607,0.004720398,0.0018420743,0.0005331377,0.0005288713,0.0010883288,0.07206119,0.00786613,0.74944884,0.0927461,0.06564784],"study_design_scores_gemma":[0.00037796234,0.00020490415,0.0009877529,0.00014340607,0.00021705379,0.0006362844,0.00015946891,0.094212666,0.0030632282,0.89064276,0.009233703,0.00012079399],"about_ca_topic_score_codex":0.0019336694,"about_ca_topic_score_gemma":0.0015682053,"teacher_disagreement_score":0.015631802,"about_ca_system_score_codex":0.005494288,"about_ca_system_score_gemma":0.002781364,"threshold_uncertainty_score":0.05229354},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6609171,0.015676493,0.18418412,0.00891033,0.001090278,0.000095250034,0.0013165807,0.00037382732,0.12743595],"genre_scores_gemma":[0.9632854,0.0050868182,0.01497924,0.00046373616,0.0013566406,0.00009049089,0.0006060073,0.00012753364,0.014004134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992224,0.0002321848,0.00003604504,0.00021961903,0.00022277138,0.000066906476],"domain_scores_gemma":[0.99766004,0.0009849282,0.0005569095,0.00015817558,0.00021366199,0.0004261749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056731136,0.00074417534,0.00086824363,0.0026026196,0.0015895679,0.0048702057,0.00065248465,0.0008945177,0.0054402426],"category_scores_gemma":[0.0036565266,0.00064021937,0.0005735218,0.0024177432,0.003420982,0.004749805,0.003708431,0.002430093,0.0007661106],"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.00003486746,0.00001401221,0.0013504635,0.00006758602,0.000024161222,0.0001319706,0.00021873598,0.008132986,0.00074292073,0.97129726,0.0037733738,0.014211651],"study_design_scores_gemma":[0.000005842695,0.000029959465,0.00096650183,0.000031640422,0.000010550747,0.00028639057,0.00014497257,0.01202648,0.0002627,0.9757117,0.010509177,0.00001411928],"about_ca_topic_score_codex":0.00086033077,"about_ca_topic_score_gemma":0.0006024767,"teacher_disagreement_score":0.0054402426,"about_ca_system_score_codex":0.001982267,"about_ca_system_score_gemma":0.0003356359,"threshold_uncertainty_score":0.018199384},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90985626,0.00075040373,0.056825377,0.0005205395,0.00016785161,0.00003830876,0.00020025436,0.00018242271,0.03145853],"genre_scores_gemma":[0.98458904,0.00026866217,0.005763827,0.00008097068,0.00012748089,0.00003273993,0.00017975837,0.000041158382,0.008916468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954444,0.00007825083,0.000024288043,0.00009831847,0.00009642648,0.0001582238],"domain_scores_gemma":[0.99960405,0.00007789274,0.00011003343,0.000032184245,0.00006893548,0.00010686714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003812265,0.00053887424,0.00043142852,0.0018735202,0.00090551464,0.0021737837,0.0007100357,0.0004392605,0.0040154806],"category_scores_gemma":[0.00082862185,0.00024803067,0.00050349755,0.0010455826,0.0023830386,0.0027121878,0.0011890308,0.00094448944,0.0005395737],"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.000047763097,0.00002559431,0.0004596954,0.00002193609,0.000007531483,0.00011238065,0.000503622,0.0013561519,0.002183859,0.9891584,0.00029189017,0.005831188],"study_design_scores_gemma":[0.000021907214,0.000080233964,0.0013134623,0.000016687727,0.000014694277,0.00010129908,0.00035349303,0.007812502,0.0025966754,0.98370093,0.003963114,0.00002493274],"about_ca_topic_score_codex":0.0018763238,"about_ca_topic_score_gemma":0.0016419151,"teacher_disagreement_score":0.0040154806,"about_ca_system_score_codex":0.0014446663,"about_ca_system_score_gemma":0.00047989265,"threshold_uncertainty_score":0.013433099},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24896847,0.0045359135,0.6302558,0.004838462,0.0003601855,0.00021434773,0.0015864698,0.0060311323,0.103209116],"genre_scores_gemma":[0.811545,0.0019787662,0.16210571,0.0011637072,0.0004196732,0.00034831668,0.0015996154,0.0010062186,0.019832911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789196,0.0002501184,0.000062083425,0.0007535231,0.00050800707,0.0005343299],"domain_scores_gemma":[0.98876023,0.0073370016,0.000607557,0.0019439062,0.0007711101,0.00058026175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011353138,0.0011840402,0.0010270219,0.002196097,0.001971829,0.003195299,0.0029661888,0.001851566,0.018785454],"category_scores_gemma":[0.008318988,0.00081466354,0.0010232467,0.002186809,0.0026793694,0.006995245,0.0025423984,0.0039159507,0.003208886],"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.0025227007,0.00063369324,0.010308429,0.0009871166,0.00021444549,0.00085835723,0.0012355912,0.17833565,0.12297567,0.4614407,0.03680919,0.18367857],"study_design_scores_gemma":[0.00020988876,0.00045202015,0.0055496553,0.00023926976,0.00015690795,0.0010949163,0.00023981322,0.50816643,0.04689321,0.3885009,0.048313763,0.00018324972],"about_ca_topic_score_codex":0.003884462,"about_ca_topic_score_gemma":0.0048809126,"teacher_disagreement_score":0.018785454,"about_ca_system_score_codex":0.0029803638,"about_ca_system_score_gemma":0.0010713026,"threshold_uncertainty_score":0.06284356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21246713,0.008144046,0.59711516,0.007253959,0.0011578683,0.00017906252,0.0008900998,0.00057424785,0.1722184],"genre_scores_gemma":[0.92491335,0.0031825881,0.03607895,0.0010392758,0.0009028971,0.00026572304,0.00046202546,0.00012722421,0.033027902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911946,0.00031898267,0.000033903867,0.00014185648,0.0002373149,0.00014849442],"domain_scores_gemma":[0.9975049,0.0012913244,0.00037941814,0.0003116939,0.00025076309,0.00026190624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010273351,0.00048694047,0.0005655535,0.0010809468,0.00085516134,0.0015390781,0.0008270655,0.0013919306,0.005805919],"category_scores_gemma":[0.005491477,0.00024418414,0.00059340603,0.0009892997,0.0030037586,0.0028839346,0.0012001519,0.0014258226,0.0008401201],"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.000009280883,0.00000545775,0.00009712105,0.000010555504,0.0000028138415,0.000049166243,0.00003113482,0.004454267,0.00011908068,0.99259573,0.0006543385,0.001971118],"study_design_scores_gemma":[0.000008361649,0.00000826916,0.00009302832,0.0000077441755,0.0000024519538,0.00006239804,0.000012780743,0.023861123,0.00007245758,0.97235286,0.0035101576,0.000008387125],"about_ca_topic_score_codex":0.002438921,"about_ca_topic_score_gemma":0.001568306,"teacher_disagreement_score":0.005805919,"about_ca_system_score_codex":0.0009914718,"about_ca_system_score_gemma":0.0008620732,"threshold_uncertainty_score":0.01942271},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006230874,0.021942837,0.0027761061,0.062904105,0.7532823,0.00022308073,0.0018628531,0.0009167448,0.15546893],"genre_scores_gemma":[0.0030813743,0.011178747,0.0011219432,0.014282575,0.24199402,0.00016303385,0.0024181937,0.0012059169,0.72455424],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99845636,0.00020615009,0.00009578508,0.00032368372,0.00073616486,0.0001818713],"domain_scores_gemma":[0.9943768,0.0012244539,0.0004040355,0.0003204351,0.0023132176,0.0013611681],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014927783,0.0016666229,0.0018588675,0.0028050186,0.0026459328,0.007987236,0.0014984217,0.0031928108,0.34897825],"category_scores_gemma":[0.0053091445,0.00063198234,0.0014142906,0.002011012,0.0011681714,0.004336389,0.0022137845,0.004854141,0.23987791],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014186567,0.0000065094887,0.000021076688,0.000057295,0.0000025583,0.000013213589,0.00001376711,0.000012828785,0.00012638791,0.0006914235,0.992388,0.0066528786],"study_design_scores_gemma":[0.0000051109087,0.000013310934,0.00022965994,0.00007346459,0.0000033381816,0.000032436095,0.000029301002,0.00003547251,0.00007383903,0.0007064131,0.99879175,0.0000059412328],"about_ca_topic_score_codex":0.0016864672,"about_ca_topic_score_gemma":0.0025206928,"teacher_disagreement_score":0.34897825,"about_ca_system_score_codex":0.0030637109,"about_ca_system_score_gemma":0.0020920448,"threshold_uncertainty_score":0.92860353},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89846796,0.00037464447,0.040082067,0.00027296416,0.00007613912,0.00003666594,0.00017452119,0.00013601838,0.060378987],"genre_scores_gemma":[0.96743715,0.00027156255,0.014713122,0.000058347334,0.00008650787,0.000035950037,0.00019316521,0.00006091449,0.01714317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973506,0.000040851464,0.000010293438,0.000043479693,0.00010184986,0.00006842821],"domain_scores_gemma":[0.9993936,0.00016407199,0.00013747298,0.00006849178,0.00011576373,0.00012060228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002985391,0.00029767794,0.00034531724,0.001130542,0.0010136913,0.0012366051,0.0005212941,0.00034306917,0.006497556],"category_scores_gemma":[0.0012543298,0.00018397428,0.00033431555,0.0006566431,0.0013569541,0.001597415,0.0008690316,0.0006427189,0.00068533816],"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.00007927651,0.000034202054,0.0014504348,0.00007805608,0.000010012276,0.00035273342,0.00041941155,0.0025321266,0.005323313,0.979026,0.000894038,0.0098004695],"study_design_scores_gemma":[0.00004924257,0.0002376418,0.0033129207,0.000047120324,0.000026033535,0.0016473924,0.0009523339,0.039463658,0.011892368,0.9209293,0.021376036,0.00006584377],"about_ca_topic_score_codex":0.003545226,"about_ca_topic_score_gemma":0.0038771366,"teacher_disagreement_score":0.006497556,"about_ca_system_score_codex":0.0006094879,"about_ca_system_score_gemma":0.00044867344,"threshold_uncertainty_score":0.021736503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3074744,0.0016590515,0.6503143,0.0011687232,0.00015842871,0.00009351369,0.00031167665,0.00081840623,0.03800162],"genre_scores_gemma":[0.93749714,0.00048012912,0.05104949,0.0003672045,0.00019324852,0.00016552485,0.00018192477,0.00033301135,0.009732421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981261,0.00036313385,0.000106722575,0.00050022686,0.0006173387,0.00028653143],"domain_scores_gemma":[0.99404365,0.0029827347,0.0009097751,0.0010290754,0.0004462054,0.0005886307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002022852,0.00067079853,0.0008029745,0.001624165,0.0013900064,0.0023611395,0.0011701672,0.0010435237,0.0073078964],"category_scores_gemma":[0.010996144,0.00057715416,0.0010557199,0.0009880983,0.004597609,0.0050765583,0.0031933584,0.0024917545,0.0010064619],"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.00010089864,0.000022443215,0.0014982276,0.00007346954,0.000022973536,0.00026066668,0.00026698035,0.010136515,0.006099846,0.9698444,0.0006440888,0.011029453],"study_design_scores_gemma":[0.0000147031205,0.0000398881,0.0008923637,0.000032133015,0.000019531224,0.0006374839,0.00013794066,0.04739343,0.005088911,0.9425901,0.0031196806,0.00003388392],"about_ca_topic_score_codex":0.0008039105,"about_ca_topic_score_gemma":0.0005586109,"teacher_disagreement_score":0.0073078964,"about_ca_system_score_codex":0.0013280439,"about_ca_system_score_gemma":0.0007609976,"threshold_uncertainty_score":0.024447322},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69303584,0.0021252173,0.20925665,0.0008156029,0.0004351633,0.000069419126,0.00047195822,0.00053563534,0.09325446],"genre_scores_gemma":[0.9531776,0.0010282404,0.022058595,0.00017235897,0.000360593,0.00010279409,0.0003382496,0.00022591602,0.022535726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994241,0.00007641153,0.000034926044,0.000120594006,0.00015531047,0.00018868582],"domain_scores_gemma":[0.99909246,0.00029782587,0.00012886807,0.000098011384,0.00020159384,0.00018120647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005655427,0.00071266637,0.000602834,0.0026327067,0.0010612918,0.00220852,0.0006369976,0.0004370206,0.005817494],"category_scores_gemma":[0.0020626797,0.00032202792,0.00077314326,0.000983604,0.0024430566,0.0041495506,0.0015024974,0.0010186,0.0012859103],"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.00008412371,0.000013188635,0.0010366465,0.00006131522,0.0000109621515,0.00013212737,0.00061126496,0.0014381573,0.0038276964,0.97368354,0.0010270812,0.01807386],"study_design_scores_gemma":[0.000015024618,0.00007468242,0.0017304028,0.000040250474,0.000020365642,0.00029483295,0.0004423773,0.016890168,0.005477529,0.9600726,0.014893964,0.000047829948],"about_ca_topic_score_codex":0.0019406102,"about_ca_topic_score_gemma":0.001131017,"teacher_disagreement_score":0.005817494,"about_ca_system_score_codex":0.0013849444,"about_ca_system_score_gemma":0.00063712173,"threshold_uncertainty_score":0.019461513},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6520419,0.0016058747,0.28904113,0.0017645756,0.000089633264,0.0001480535,0.00041556306,0.000478822,0.054414395],"genre_scores_gemma":[0.94996285,0.0005218043,0.041186705,0.00018446549,0.00010678721,0.00016561656,0.00021203578,0.000109834575,0.007549871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982741,0.0007972216,0.0000645021,0.00032578793,0.00033948838,0.00019894041],"domain_scores_gemma":[0.9914944,0.005466744,0.0012362697,0.0008581347,0.0003905313,0.0005538735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018005583,0.00066530687,0.0007254076,0.0013039856,0.0009975615,0.0022816446,0.0017214508,0.0012799376,0.008151552],"category_scores_gemma":[0.014256226,0.00056000816,0.00070465007,0.00096312835,0.0024790566,0.008664584,0.0018039485,0.002086703,0.0005118047],"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.00019407629,0.00011188504,0.0019043608,0.00013058724,0.000033234344,0.00008832049,0.00037866272,0.05274135,0.0025483053,0.9252027,0.0028530469,0.0138134565],"study_design_scores_gemma":[0.000030507426,0.00006474259,0.0005736937,0.000029779985,0.000011577945,0.00016316521,0.00014107932,0.16235901,0.0012143833,0.83300346,0.0023879388,0.000020701582],"about_ca_topic_score_codex":0.00070347346,"about_ca_topic_score_gemma":0.00077393523,"teacher_disagreement_score":0.008151552,"about_ca_system_score_codex":0.0020365994,"about_ca_system_score_gemma":0.0006133368,"threshold_uncertainty_score":0.027269661},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55740434,0.0022286081,0.11100264,0.0014002796,0.00059054047,0.0001230829,0.0005431433,0.0005693537,0.3261381],"genre_scores_gemma":[0.9098957,0.0010523096,0.024001952,0.0004408515,0.00041125927,0.00009021829,0.00039141419,0.00014105,0.063575126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948883,0.00006586727,0.000025011033,0.000087734836,0.00019996264,0.00013263922],"domain_scores_gemma":[0.9996228,0.00006969632,0.000054201795,0.000038674447,0.00008905873,0.00012560481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033678964,0.0003390483,0.0002535825,0.0021315548,0.0017650872,0.0026795748,0.00038586563,0.0006726313,0.01056323],"category_scores_gemma":[0.00083074893,0.0003273686,0.00042044892,0.0010849667,0.0017010228,0.003329813,0.0025323818,0.0011771825,0.0017083456],"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.000011338521,0.000010866332,0.00016851457,0.000019808838,0.0000020275681,0.00010273795,0.00042553313,0.0003041782,0.0015193411,0.990497,0.00066123554,0.006277422],"study_design_scores_gemma":[0.000009334838,0.000027417365,0.0006106415,0.000030037683,0.000006191383,0.00024115697,0.0003762299,0.0033549126,0.0018897245,0.9766539,0.016782107,0.000018448094],"about_ca_topic_score_codex":0.00087704364,"about_ca_topic_score_gemma":0.0013139879,"teacher_disagreement_score":0.01056323,"about_ca_system_score_codex":0.0012930396,"about_ca_system_score_gemma":0.0004181929,"threshold_uncertainty_score":0.035337508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45288187,0.0007786433,0.5239401,0.0006019586,0.00005132223,0.00023233282,0.0005322784,0.0007081076,0.020273428],"genre_scores_gemma":[0.8492777,0.000569386,0.14466666,0.00013191353,0.000060034534,0.00020423337,0.0009900122,0.00020412859,0.0038958814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984946,0.0003844236,0.0001007528,0.00033767745,0.0002901903,0.00039237147],"domain_scores_gemma":[0.9878335,0.009205267,0.00091577944,0.0011156407,0.0005283561,0.00040143137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013444057,0.00067464745,0.0009621424,0.0010297097,0.0011124404,0.0032081082,0.0014291417,0.0010346969,0.0043126913],"category_scores_gemma":[0.015575259,0.0005769597,0.0015738066,0.0014946643,0.0021887368,0.0036757414,0.0019023853,0.00087721244,0.00043427042],"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.0009038887,0.00014259052,0.008313957,0.0004939529,0.00012587613,0.0003913506,0.00068359624,0.6611791,0.014109444,0.24513663,0.0035084358,0.065011136],"study_design_scores_gemma":[0.00008180567,0.000118800424,0.0007624451,0.000050168594,0.00004895286,0.00020924963,0.00018139675,0.819951,0.005335138,0.17036486,0.00287427,0.00002194008],"about_ca_topic_score_codex":0.0033197762,"about_ca_topic_score_gemma":0.0018868983,"teacher_disagreement_score":0.0043126913,"about_ca_system_score_codex":0.0017430128,"about_ca_system_score_gemma":0.0009487845,"threshold_uncertainty_score":0.0144274235},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90314263,0.0011402433,0.084205866,0.0021129758,0.000076864126,0.000030358851,0.0014789022,0.00017433264,0.0076377993],"genre_scores_gemma":[0.9730978,0.0010235688,0.021721937,0.00018201543,0.00017970831,0.00012364193,0.0012378524,0.00010676446,0.0023267486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992588,0.00022736503,0.00004210622,0.00021349356,0.00013260187,0.00012564436],"domain_scores_gemma":[0.99077725,0.0061544217,0.0010044159,0.0005415325,0.00053550996,0.0009869073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001364742,0.00040714556,0.00079730176,0.0008747631,0.0008494132,0.0018257769,0.0012071369,0.0008977725,0.0015319064],"category_scores_gemma":[0.010707605,0.00076500827,0.0003667932,0.0007149146,0.0012821137,0.0027631328,0.0011802994,0.0008305669,0.00034563374],"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.0030349584,0.00023297124,0.052191097,0.0009924605,0.0005238969,0.0012211826,0.002216189,0.23358718,0.084517255,0.49653423,0.029025445,0.095923096],"study_design_scores_gemma":[0.00018062454,0.00031291734,0.021932714,0.000099121346,0.00014407169,0.0020309936,0.000551069,0.48569682,0.014910671,0.46461764,0.009447921,0.00007542869],"about_ca_topic_score_codex":0.0008896688,"about_ca_topic_score_gemma":0.0007903757,"teacher_disagreement_score":0.0018257769,"about_ca_system_score_codex":0.0010826354,"about_ca_system_score_gemma":0.00043431058,"threshold_uncertainty_score":0.007855058},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.820321,0.001854072,0.11814364,0.000502483,0.00024257672,0.000040556926,0.00024306534,0.00046184016,0.058190607],"genre_scores_gemma":[0.967208,0.00041752687,0.020623075,0.00015373612,0.00020540057,0.00006595086,0.00022348709,0.000105250365,0.010997609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991967,0.00011629059,0.0001032026,0.00022085171,0.00020492836,0.0001581104],"domain_scores_gemma":[0.9984376,0.00073154,0.00029221544,0.00020089344,0.00015258437,0.0001851529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005151898,0.000423517,0.00039784348,0.0012013018,0.0012804766,0.0016425147,0.0005271736,0.00045991398,0.003328187],"category_scores_gemma":[0.0022411763,0.00048673723,0.0004872495,0.0006441876,0.0024838392,0.0026964443,0.0022497901,0.00086365064,0.0006988239],"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.00034833842,0.000055057302,0.0023258233,0.00015233213,0.00002232703,0.0010975945,0.001438145,0.0022032312,0.018206855,0.93787926,0.0012339463,0.03503713],"study_design_scores_gemma":[0.00003603711,0.00016897157,0.0015736708,0.000060211903,0.0000377999,0.0016722284,0.00047968165,0.007864724,0.013266013,0.96116114,0.013622721,0.000056659414],"about_ca_topic_score_codex":0.00029660566,"about_ca_topic_score_gemma":0.00037351635,"teacher_disagreement_score":0.003328187,"about_ca_system_score_codex":0.00035259774,"about_ca_system_score_gemma":0.00029185216,"threshold_uncertainty_score":0.01113385},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49904385,0.0009510135,0.4045242,0.0034928145,0.00018485649,0.00028140674,0.0013262571,0.0004567643,0.08973873],"genre_scores_gemma":[0.95638514,0.00037697697,0.033380926,0.0005252052,0.00012731257,0.00026688597,0.00047976518,0.00007804699,0.008379628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999316,0.0001703431,0.00005384235,0.00015277806,0.00013817794,0.00016891018],"domain_scores_gemma":[0.9969735,0.001723663,0.00027142756,0.00020096036,0.00044934047,0.00038107144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095300085,0.00044028737,0.0006091377,0.0016008911,0.0012347643,0.0013088732,0.00081140886,0.0010605842,0.009307308],"category_scores_gemma":[0.0056751473,0.00037582178,0.0006654251,0.0008676937,0.0019497807,0.002818702,0.0015767209,0.0015333184,0.0010295523],"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.00006830153,0.00003195308,0.0010518664,0.0000767934,0.000012165694,0.00017903786,0.00029982137,0.003850455,0.004052593,0.9827238,0.0016391141,0.006014056],"study_design_scores_gemma":[0.00006152295,0.00007909972,0.0010621859,0.00003905535,0.000014994829,0.00014551579,0.000264827,0.02767735,0.0024107457,0.9627259,0.00549393,0.000024890734],"about_ca_topic_score_codex":0.0022016703,"about_ca_topic_score_gemma":0.0027387335,"teacher_disagreement_score":0.009307308,"about_ca_system_score_codex":0.0013755457,"about_ca_system_score_gemma":0.0007847052,"threshold_uncertainty_score":0.031135976},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70841426,0.0012723709,0.21962646,0.002857253,0.00018314018,0.00026462704,0.0018505096,0.0005962144,0.06493513],"genre_scores_gemma":[0.95250523,0.0006442357,0.03515114,0.0004802946,0.00023782773,0.00027427264,0.0011274241,0.00010781897,0.009471701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979444,0.00051594607,0.00021445137,0.00036273652,0.00057750876,0.00038500308],"domain_scores_gemma":[0.9894694,0.005654971,0.0014019465,0.0009853574,0.0013787261,0.0011094864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023612743,0.0005534996,0.0012745612,0.0023801348,0.0012891502,0.0026773545,0.0015356153,0.0017292645,0.009173288],"category_scores_gemma":[0.0148795005,0.0007737022,0.0008467961,0.0019505584,0.0025569992,0.006724168,0.002792926,0.0017168574,0.00079975696],"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.00080703845,0.00014564805,0.0059364163,0.00032498734,0.000051908446,0.00034380544,0.0007565217,0.023886705,0.007727686,0.93353903,0.0058476194,0.020632632],"study_design_scores_gemma":[0.00011394654,0.00008383562,0.0013861356,0.00004645446,0.000020827458,0.00017855856,0.00027958053,0.04215965,0.0028830098,0.9483456,0.0044543934,0.000048082267],"about_ca_topic_score_codex":0.0012657986,"about_ca_topic_score_gemma":0.0016589115,"teacher_disagreement_score":0.009173288,"about_ca_system_score_codex":0.0017284638,"about_ca_system_score_gemma":0.00092247856,"threshold_uncertainty_score":0.03068763},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9482401,0.0006542462,0.043795414,0.00019419748,0.000036332058,0.000031578424,0.00008184527,0.00012516002,0.0068412498],"genre_scores_gemma":[0.986684,0.00024226755,0.011752184,0.00003371872,0.000050362592,0.000024958721,0.00007059196,0.000037404177,0.0011045125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997546,0.000041247462,0.000021819147,0.00005657168,0.00005619089,0.00006966882],"domain_scores_gemma":[0.99839824,0.00093443075,0.00019073497,0.000117782605,0.0002026102,0.00015621528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057938613,0.000488957,0.00064412283,0.0019912159,0.0007614455,0.0020211278,0.0004598351,0.0004378381,0.0021556662],"category_scores_gemma":[0.004149462,0.0002167903,0.0004786439,0.00081458624,0.0023148982,0.0027771508,0.0010926994,0.00075096986,0.00026958916],"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.00042633727,0.000052202195,0.009580777,0.00018060798,0.000030889278,0.0013483843,0.0020016013,0.01641551,0.017222492,0.93083304,0.0008263704,0.02108184],"study_design_scores_gemma":[0.000043427484,0.00006628162,0.001942766,0.000069825175,0.000029481991,0.000509486,0.0004971508,0.08005125,0.007910257,0.90562904,0.0032083762,0.00004266097],"about_ca_topic_score_codex":0.00093471276,"about_ca_topic_score_gemma":0.00089680817,"teacher_disagreement_score":0.0021556662,"about_ca_system_score_codex":0.00076527335,"about_ca_system_score_gemma":0.00030282323,"threshold_uncertainty_score":0.007211387},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6098542,0.026672158,0.14819142,0.026825497,0.0031460633,0.00012176469,0.0021838788,0.000562386,0.18244265],"genre_scores_gemma":[0.956033,0.0054112556,0.023975061,0.0013144681,0.0021933839,0.00011870638,0.00064364605,0.00018064381,0.0101297945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891067,0.00028825813,0.000057485653,0.0002449826,0.00030574822,0.0001928374],"domain_scores_gemma":[0.9966815,0.0017234327,0.00032025197,0.00030905634,0.00033935625,0.00062645087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010188115,0.00073822873,0.0009048807,0.003180888,0.0020299116,0.0030866398,0.0007961998,0.00078337383,0.0039084805],"category_scores_gemma":[0.0049581784,0.00055673247,0.00049818365,0.0027261646,0.0038563781,0.005021331,0.0030202917,0.002672964,0.0006143721],"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.000049542352,0.000020251715,0.0008652341,0.00007161283,0.000020505566,0.000054768247,0.00028570788,0.003448491,0.0010631438,0.96599513,0.014368075,0.013757514],"study_design_scores_gemma":[0.000009940148,0.000020760122,0.0010134884,0.000029593839,0.000010888564,0.00013424997,0.00010342779,0.009382323,0.0005261164,0.9712577,0.017480928,0.00003063504],"about_ca_topic_score_codex":0.001332536,"about_ca_topic_score_gemma":0.0011659602,"teacher_disagreement_score":0.0039084805,"about_ca_system_score_codex":0.002161608,"about_ca_system_score_gemma":0.00053204264,"threshold_uncertainty_score":0.015683651},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6397184,0.00061439525,0.3255294,0.00040805343,0.00010572801,0.000050100516,0.00011903962,0.00030352196,0.033151377],"genre_scores_gemma":[0.9885105,0.00018384508,0.008898811,0.00004543356,0.000042530788,0.0000345637,0.000033013675,0.000021858592,0.0022294861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932647,0.00011633298,0.000049050257,0.00016010346,0.00023711249,0.00011096305],"domain_scores_gemma":[0.9977913,0.000907769,0.00035801518,0.00044685198,0.0002789818,0.00021707884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052462256,0.0003058926,0.00039334997,0.00089538353,0.0008246012,0.002016241,0.0006701972,0.0004859234,0.002338729],"category_scores_gemma":[0.003080857,0.00020443517,0.0006198638,0.00039354496,0.0028617175,0.0019595425,0.0012518341,0.00077796995,0.0002450917],"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.000009707143,0.000018937291,0.0005279163,0.000024983523,0.000008821983,0.00012311355,0.0002543764,0.0060890964,0.0026345793,0.985838,0.00013592863,0.0043344945],"study_design_scores_gemma":[0.000009868158,0.000048640362,0.00072998786,0.000012755253,0.000015573758,0.00018893345,0.00016050487,0.06798418,0.0034315456,0.9254613,0.0019353253,0.000021294964],"about_ca_topic_score_codex":0.00090914516,"about_ca_topic_score_gemma":0.0005361563,"teacher_disagreement_score":0.002338729,"about_ca_system_score_codex":0.0006939394,"about_ca_system_score_gemma":0.00039604324,"threshold_uncertainty_score":0.0078238845},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0122304885,0.00054574147,0.97376156,0.0005015853,0.000059730744,0.00003575943,0.00004467142,0.00006996784,0.012750497],"genre_scores_gemma":[0.8157713,0.0029961744,0.16772914,0.00054075004,0.0007525187,0.00028761406,0.00014239055,0.00027852194,0.011501634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977983,0.0012149446,0.00005237118,0.00012595921,0.0006036866,0.0002047552],"domain_scores_gemma":[0.9938169,0.004781978,0.00032804068,0.00043058043,0.0005414574,0.00010109469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003466906,0.0016785989,0.0011030576,0.0019264026,0.00056913303,0.0022903406,0.0015828814,0.0014457116,0.0038990874],"category_scores_gemma":[0.011710806,0.00043367821,0.0008899931,0.0014195653,0.0020653945,0.0025386708,0.0014947783,0.001751326,0.0008436711],"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.000053499683,0.000059488524,0.00025872397,0.0001383779,0.000054094664,0.000056876732,0.0000666845,0.34281346,0.004258321,0.6219511,0.0019399719,0.028349457],"study_design_scores_gemma":[0.00000617692,0.000036639874,0.00008690612,0.000020485868,0.000012699468,0.000044376295,0.000015319929,0.8794641,0.0011861752,0.11831982,0.0007944321,0.000012841227],"about_ca_topic_score_codex":0.0007792421,"about_ca_topic_score_gemma":0.0003363015,"teacher_disagreement_score":0.0038990874,"about_ca_system_score_codex":0.002014066,"about_ca_system_score_gemma":0.0010267876,"threshold_uncertainty_score":0.018334985},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21941914,0.00670056,0.37489492,0.0040652384,0.0032798457,0.00025017123,0.0025021643,0.00090986665,0.3879781],"genre_scores_gemma":[0.74240327,0.0030593323,0.11814729,0.0019556184,0.0012718631,0.00020404845,0.0013792522,0.000214453,0.1313649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995952,0.000065088265,0.000029402589,0.00010700511,0.00015054003,0.000052813986],"domain_scores_gemma":[0.99966884,0.000045464687,0.000034756213,0.00004275617,0.0001637012,0.00004438935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036068924,0.00035229116,0.00036886946,0.0010267914,0.0013020918,0.0016945347,0.00049010164,0.00042692866,0.01771385],"category_scores_gemma":[0.0007084528,0.00021016266,0.0004074659,0.0009864419,0.0015448352,0.0024478678,0.0013503232,0.0011227044,0.0042413734],"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.000024818317,0.000008518988,0.000110288216,0.00006504647,0.000004588756,0.00014625705,0.00023561294,0.00032724006,0.0023106253,0.9784975,0.0026049104,0.015664581],"study_design_scores_gemma":[0.000015412796,0.00008520952,0.0006138064,0.00003818019,0.000015940692,0.00085202005,0.00019402968,0.0035052742,0.00387369,0.85299706,0.13777237,0.000036982612],"about_ca_topic_score_codex":0.0014056052,"about_ca_topic_score_gemma":0.001296965,"teacher_disagreement_score":0.01771385,"about_ca_system_score_codex":0.0009517505,"about_ca_system_score_gemma":0.0006719032,"threshold_uncertainty_score":0.0592587},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045450915,0.0009891728,0.9235229,0.0010749156,0.00022217823,0.00021610537,0.00057649973,0.002123541,0.025823785],"genre_scores_gemma":[0.43877658,0.001054596,0.5375756,0.00034731164,0.00017157783,0.0003174266,0.00123586,0.00042341877,0.020097584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916685,0.00019957783,0.00004277462,0.00023676643,0.00016508199,0.00018902642],"domain_scores_gemma":[0.99785656,0.0011332298,0.00017467105,0.00050406466,0.00018236977,0.00014913942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090025156,0.00076167524,0.00074137584,0.0008654267,0.0010354384,0.002755524,0.0016568674,0.0010260288,0.0064892224],"category_scores_gemma":[0.0045225867,0.00047622685,0.00076880486,0.0018962754,0.0012282114,0.003088385,0.0016829025,0.0017414081,0.0013345114],"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.00042212062,0.00020720121,0.0012425287,0.00030437976,0.000068744936,0.00011006057,0.00037495611,0.18847558,0.006857797,0.5594178,0.015396112,0.22712286],"study_design_scores_gemma":[0.00008040727,0.000054450345,0.0002915867,0.000035620127,0.000028547674,0.00009021881,0.000072745,0.3805087,0.0022452602,0.60633916,0.010232636,0.000020621897],"about_ca_topic_score_codex":0.0048735323,"about_ca_topic_score_gemma":0.004379722,"teacher_disagreement_score":0.0064892224,"about_ca_system_score_codex":0.003199048,"about_ca_system_score_gemma":0.0021510331,"threshold_uncertainty_score":0.023210764},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8489928,0.0002593914,0.1294832,0.00015204835,0.00007240382,0.000062921004,0.00094232033,0.00038053744,0.019654319],"genre_scores_gemma":[0.95759493,0.00020723377,0.034364026,0.000052648804,0.00002477664,0.00007864499,0.0009872424,0.0001099493,0.006580514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924564,0.00010059596,0.00005981044,0.00017985525,0.00022018387,0.0001939896],"domain_scores_gemma":[0.99760747,0.0008996723,0.0004376189,0.0005138466,0.0003354942,0.00020589902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004849032,0.00041115118,0.00049692066,0.0016529276,0.0008817338,0.0010716139,0.0011455968,0.0006733901,0.0050391103],"category_scores_gemma":[0.0037547324,0.00028184563,0.00054344424,0.0017487569,0.0009955519,0.0019857453,0.0011249718,0.0008648934,0.0009612802],"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.00070203637,0.00022465152,0.055086225,0.00029874526,0.00009196961,0.0017154933,0.0013843962,0.03856151,0.04940695,0.6777284,0.003787757,0.17101172],"study_design_scores_gemma":[0.000065732245,0.00039665436,0.018031264,0.0001254405,0.000120701145,0.0029101504,0.0007595284,0.14005132,0.054632466,0.7552119,0.027547628,0.0001472263],"about_ca_topic_score_codex":0.0006956865,"about_ca_topic_score_gemma":0.00096810685,"teacher_disagreement_score":0.0050391103,"about_ca_system_score_codex":0.0006316563,"about_ca_system_score_gemma":0.00045892008,"threshold_uncertainty_score":0.016857445},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7602245,0.00081271486,0.13739946,0.0021963788,0.00012737288,0.000116482326,0.0026003341,0.00077842665,0.095744416],"genre_scores_gemma":[0.9597372,0.0002797759,0.03069902,0.00024072672,0.00009043684,0.00026781525,0.0016780313,0.00014593906,0.006861005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735224,0.00062689243,0.00015381198,0.000683761,0.0006621882,0.0005210583],"domain_scores_gemma":[0.9897363,0.0063409084,0.0011189064,0.0010562956,0.0007336085,0.001013975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011492956,0.00057338923,0.00077080826,0.002742402,0.0038933095,0.0035346465,0.0024422703,0.0011466738,0.012371019],"category_scores_gemma":[0.010336051,0.00090644346,0.0011705139,0.0030024168,0.0033184101,0.005153806,0.00473605,0.0024677073,0.0013276518],"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.00024018547,0.00005625234,0.004278098,0.00012894992,0.000058885864,0.00025629837,0.0006897053,0.008799607,0.0025091653,0.96457547,0.0044643003,0.013943098],"study_design_scores_gemma":[0.000045166722,0.000057079647,0.0014733112,0.00003588561,0.000040539697,0.0007752411,0.00052382273,0.030785238,0.0036365585,0.95187986,0.01070297,0.00004429261],"about_ca_topic_score_codex":0.0014167002,"about_ca_topic_score_gemma":0.0011134768,"teacher_disagreement_score":0.012371019,"about_ca_system_score_codex":0.0020540094,"about_ca_system_score_gemma":0.00094531995,"threshold_uncertainty_score":0.041385233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063089505,0.012870181,0.77821076,0.003207325,0.00077680213,0.0002035637,0.003689715,0.0030713512,0.13488068],"genre_scores_gemma":[0.5054618,0.018292405,0.36433604,0.0023360068,0.0021324106,0.0005696168,0.007847391,0.0013603624,0.09766404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998357,0.0004656934,0.00011041384,0.0005016237,0.00032506112,0.00024023725],"domain_scores_gemma":[0.9970797,0.0016232881,0.00033377236,0.0004958815,0.0003182188,0.00014915725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006357593,0.001387374,0.00081105094,0.0022155894,0.0011093614,0.0033775817,0.0015493894,0.001210536,0.020778477],"category_scores_gemma":[0.005165785,0.00094684603,0.001082411,0.0047157346,0.002583633,0.0060890834,0.0020368504,0.002424189,0.0055105463],"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.000088883455,0.00003993973,0.00033017565,0.0004680509,0.00002349916,0.0001289033,0.00042666582,0.019365808,0.0020773092,0.90924144,0.012619094,0.055190258],"study_design_scores_gemma":[0.00002813772,0.000041871055,0.00029323142,0.000062692285,0.000011782262,0.00018653879,0.000103531114,0.017358309,0.00060442596,0.95276433,0.028519055,0.000026060714],"about_ca_topic_score_codex":0.00229078,"about_ca_topic_score_gemma":0.0027377165,"teacher_disagreement_score":0.020778477,"about_ca_system_score_codex":0.0029115318,"about_ca_system_score_gemma":0.000637129,"threshold_uncertainty_score":0.06951094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30395377,0.0015933871,0.6059539,0.002891893,0.00031298577,0.00021841822,0.0015472812,0.0015496839,0.081978686],"genre_scores_gemma":[0.71476835,0.0013984643,0.25643143,0.0006168887,0.00028078325,0.00028091823,0.0020657657,0.0005029293,0.023654493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828845,0.0004326692,0.00012374598,0.00045341396,0.0003356091,0.0003660886],"domain_scores_gemma":[0.99538726,0.002193045,0.0005949992,0.0010484192,0.00028216068,0.00049412576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008412933,0.0006446845,0.00089796935,0.0010792151,0.0015594481,0.0028280641,0.0014530434,0.0010859024,0.012872081],"category_scores_gemma":[0.0048779673,0.000594733,0.0009284525,0.0020980122,0.0029176956,0.005455799,0.0021833116,0.0020761292,0.0012861865],"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.0003187193,0.00010452373,0.0021610665,0.00023670803,0.00003110419,0.000223754,0.00035794204,0.07317972,0.0069441875,0.8438243,0.008776483,0.06384147],"study_design_scores_gemma":[0.00008564058,0.00011223946,0.0011897703,0.00005207319,0.000033439737,0.00044093942,0.00037457424,0.11030729,0.0053499597,0.8499651,0.032053344,0.000035593563],"about_ca_topic_score_codex":0.003103089,"about_ca_topic_score_gemma":0.0032469325,"teacher_disagreement_score":0.012872081,"about_ca_system_score_codex":0.0022210926,"about_ca_system_score_gemma":0.00091310946,"threshold_uncertainty_score":0.043061376},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8749322,0.0005018961,0.10444897,0.00069225463,0.000045737284,0.000043109365,0.00014405766,0.00031491095,0.018876769],"genre_scores_gemma":[0.9854968,0.00023781213,0.011461972,0.000059672806,0.000052119667,0.00006338038,0.00017076527,0.00007290781,0.0023845471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990663,0.0003387551,0.00003815239,0.00011635483,0.0002480722,0.00019247073],"domain_scores_gemma":[0.995999,0.0023538065,0.0005653744,0.00032912547,0.00036508028,0.00038762414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017073432,0.0006102174,0.0008275415,0.0036761467,0.0013807951,0.0030643826,0.0015063473,0.0008459315,0.0033518553],"category_scores_gemma":[0.010521627,0.00049040024,0.0008172332,0.001593335,0.00368438,0.0043636416,0.0016604158,0.0017964339,0.00039915068],"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.00006753155,0.000075495554,0.0020804955,0.000052752166,0.000015244407,0.00019391534,0.00030838297,0.02073924,0.0013367017,0.97073674,0.00044990738,0.003943599],"study_design_scores_gemma":[0.000029215253,0.00003514306,0.00086238567,0.000041661442,0.000013693711,0.00016400349,0.00019412886,0.28269434,0.0012978559,0.71371776,0.00091578206,0.000033997952],"about_ca_topic_score_codex":0.0021077814,"about_ca_topic_score_gemma":0.0018516022,"teacher_disagreement_score":0.0036761467,"about_ca_system_score_codex":0.0020536918,"about_ca_system_score_gemma":0.0008631895,"threshold_uncertainty_score":0.014900684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16872877,0.00097003736,0.8103549,0.00034116622,0.000097210206,0.00016860371,0.00080653216,0.0038335184,0.014699288],"genre_scores_gemma":[0.46887714,0.0009459436,0.51034147,0.00013789603,0.000071388284,0.00020689672,0.0014064985,0.0009675581,0.017045336],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994295,0.00011539356,0.000049198305,0.00014176632,0.00017563497,0.0000884349],"domain_scores_gemma":[0.998386,0.00044526134,0.0002523974,0.0005651205,0.00022220613,0.00012891002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004332809,0.0005003046,0.00043108832,0.00072411605,0.00068861956,0.0016461256,0.0010203146,0.0004535522,0.0052834987],"category_scores_gemma":[0.002373649,0.0006550052,0.000614781,0.0012736911,0.001175532,0.0028527607,0.0011207995,0.0007207968,0.0010213587],"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.0012479515,0.00020210048,0.004699069,0.0005028597,0.000088652705,0.00032204328,0.0016597428,0.17798106,0.056891438,0.3361533,0.013104251,0.40714753],"study_design_scores_gemma":[0.00020403796,0.0006143892,0.0057798102,0.00013300676,0.00013956481,0.00096160505,0.0008814747,0.4426692,0.04206534,0.4093064,0.09708644,0.00015871486],"about_ca_topic_score_codex":0.0037716546,"about_ca_topic_score_gemma":0.007016784,"teacher_disagreement_score":0.0052834987,"about_ca_system_score_codex":0.0010398657,"about_ca_system_score_gemma":0.0007787083,"threshold_uncertainty_score":0.017675102},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03902961,0.00023740692,0.9532978,0.000652082,0.000086314845,0.00033828098,0.00042171756,0.0021335876,0.0038032432],"genre_scores_gemma":[0.24173608,0.0001005373,0.75440717,0.00016096226,0.00006911396,0.00041251653,0.0010147218,0.00028370737,0.0018152589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770373,0.00054914894,0.00011853176,0.0007938479,0.0004614023,0.00037337054],"domain_scores_gemma":[0.9951148,0.0026935146,0.00047006132,0.001144402,0.00029962408,0.00027751664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012417862,0.00092343346,0.0015703375,0.0010235723,0.0013745321,0.0016224688,0.002921313,0.0018176594,0.005484508],"category_scores_gemma":[0.007591572,0.0009191266,0.0015125911,0.001445444,0.0017958345,0.0027962108,0.002947977,0.001718702,0.00095958466],"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.0014493166,0.00068116776,0.0030840007,0.0008097121,0.00027332138,0.00044011677,0.0004782462,0.5326283,0.024330333,0.10549593,0.021824127,0.30850542],"study_design_scores_gemma":[0.00050312554,0.00016928528,0.0004129573,0.00003178059,0.000041939664,0.00016350257,0.00007592801,0.91835415,0.0047081127,0.071366936,0.004132743,0.00003955913],"about_ca_topic_score_codex":0.0036773994,"about_ca_topic_score_gemma":0.0046639005,"teacher_disagreement_score":0.005484508,"about_ca_system_score_codex":0.0015945944,"about_ca_system_score_gemma":0.003176967,"threshold_uncertainty_score":0.018347561},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95613366,0.00020886166,0.023048082,0.00011277271,0.00002578159,0.000020267451,0.00016460932,0.00011198905,0.020174043],"genre_scores_gemma":[0.99290884,0.000098772085,0.0043077185,0.000021433463,0.000019235238,0.000033280165,0.0002473994,0.000025910784,0.002337291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997713,0.000033666496,0.000019344256,0.000079497964,0.000052290896,0.000043904784],"domain_scores_gemma":[0.99919635,0.00029570187,0.00016679519,0.00012450528,0.00008334786,0.00013327565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015987,0.00019852276,0.00029081167,0.0011984395,0.0009689401,0.0015865852,0.00037799988,0.00042659912,0.0048963944],"category_scores_gemma":[0.0017652989,0.00025627995,0.00032598388,0.00061637175,0.0017890749,0.0010552905,0.0010113588,0.00043997212,0.00040641578],"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.00015972386,0.00002841812,0.0051230486,0.00009681258,0.00001744531,0.00047139262,0.00094535697,0.013197903,0.011859481,0.9543354,0.00072129257,0.013043613],"study_design_scores_gemma":[0.000052333187,0.00009771161,0.00467085,0.000050375587,0.000024066872,0.00083316816,0.00054827664,0.043749493,0.008109802,0.9332961,0.008537469,0.000030364768],"about_ca_topic_score_codex":0.00028989153,"about_ca_topic_score_gemma":0.000280597,"teacher_disagreement_score":0.0048963944,"about_ca_system_score_codex":0.00044228276,"about_ca_system_score_gemma":0.00016274385,"threshold_uncertainty_score":0.016380072},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9685148,0.00018561418,0.020661896,0.00023453718,0.000032003776,0.00005970124,0.00021235681,0.00010218145,0.009997005],"genre_scores_gemma":[0.99316496,0.00009221099,0.0049008536,0.000019342267,0.000040143404,0.000033698238,0.00021714093,0.00003123892,0.0015004466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874324,0.00013326248,0.00008488032,0.0002900567,0.00041788485,0.00033064536],"domain_scores_gemma":[0.99504733,0.0018530816,0.0008675583,0.0005128445,0.0006218867,0.0010972917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012304719,0.00053134095,0.0007351779,0.0033780795,0.0018089983,0.002848853,0.0008860497,0.0011984966,0.0029980852],"category_scores_gemma":[0.008384979,0.00062391494,0.0010120262,0.0007422369,0.0043254048,0.0030010398,0.0029087106,0.0019021492,0.0002849569],"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.00046164403,0.00015114533,0.02457692,0.0001346212,0.000040588642,0.0009815486,0.0020344143,0.007971566,0.023356006,0.9234688,0.00077628926,0.016046455],"study_design_scores_gemma":[0.00019356636,0.0005082468,0.03657304,0.00012278871,0.000081394785,0.0019597763,0.0021966505,0.078604996,0.018917223,0.85293216,0.007690017,0.0002201939],"about_ca_topic_score_codex":0.0012136162,"about_ca_topic_score_gemma":0.0007145359,"teacher_disagreement_score":0.0033780795,"about_ca_system_score_codex":0.001248217,"about_ca_system_score_gemma":0.0004988413,"threshold_uncertainty_score":0.010029614},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7919304,0.00055417896,0.102500714,0.0010498147,0.00032607612,0.000058667563,0.00023474055,0.0001811685,0.103164315],"genre_scores_gemma":[0.9824532,0.00024748026,0.008271874,0.00017765258,0.00009484567,0.00004460356,0.00010595027,0.000046459692,0.0085578915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996076,0.000075686825,0.000017517968,0.000050478477,0.00013209385,0.00011657586],"domain_scores_gemma":[0.9995333,0.00010799659,0.00008674327,0.000092296876,0.00006865145,0.00011103906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041463968,0.00023324946,0.00033349014,0.00054204155,0.0010982737,0.0015985112,0.0005624793,0.00043448052,0.0032356216],"category_scores_gemma":[0.001008625,0.00018704185,0.0005829414,0.000458529,0.002172152,0.0019080471,0.000976395,0.0008681017,0.0006447794],"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.000021951564,0.000009057854,0.00014571715,0.000012038978,0.000002147225,0.00009295538,0.00016723276,0.0012727621,0.0017087315,0.99374557,0.00046251123,0.0023592373],"study_design_scores_gemma":[0.00002052893,0.000026209695,0.00029405172,0.000009798734,0.0000026812834,0.00019501991,0.00013975152,0.010972184,0.0012916141,0.9846177,0.002414297,0.000016064567],"about_ca_topic_score_codex":0.0012566377,"about_ca_topic_score_gemma":0.0008891124,"teacher_disagreement_score":0.0032356216,"about_ca_system_score_codex":0.0007355175,"about_ca_system_score_gemma":0.0007338249,"threshold_uncertainty_score":0.0108242035},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5768661,0.0011203062,0.28846774,0.00037794,0.0002773629,0.00014306739,0.00087452424,0.00031690407,0.13155611],"genre_scores_gemma":[0.9194414,0.0010392198,0.053406842,0.00012490407,0.00012256604,0.00014586885,0.0008222999,0.00013047783,0.024766447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969816,0.00003257877,0.000020904108,0.00006595172,0.00010529802,0.0000771292],"domain_scores_gemma":[0.9996278,0.00008449244,0.00007909998,0.00009265628,0.000055674438,0.00006024448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013627601,0.0003304059,0.00033017225,0.0011016589,0.00075541105,0.0009880936,0.00048490387,0.00035142875,0.011412441],"category_scores_gemma":[0.00058858324,0.00021002544,0.0004692419,0.0010602701,0.0010973007,0.0012321497,0.0011334335,0.0006992805,0.0007595131],"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.00006720716,0.000026995147,0.0019460627,0.00013894564,0.000019141184,0.00079748326,0.00052065705,0.01052968,0.013270407,0.9369081,0.002091326,0.03368392],"study_design_scores_gemma":[0.00003616922,0.00017408925,0.0056187776,0.0001255016,0.000041609917,0.0031777748,0.0014560503,0.048738834,0.010710242,0.8313747,0.098469615,0.000076535194],"about_ca_topic_score_codex":0.00092451146,"about_ca_topic_score_gemma":0.0014528545,"teacher_disagreement_score":0.011412441,"about_ca_system_score_codex":0.00049920875,"about_ca_system_score_gemma":0.00023925806,"threshold_uncertainty_score":0.038178444},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64143294,0.0030112406,0.17932291,0.019453859,0.0010000796,0.00015954005,0.0032095339,0.001018638,0.1513913],"genre_scores_gemma":[0.9403056,0.0032444173,0.029056016,0.0020989007,0.0008447674,0.00021049101,0.0034568687,0.00026954402,0.02051351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818987,0.00031905322,0.00014691129,0.00042527993,0.00045981794,0.00045904113],"domain_scores_gemma":[0.9927099,0.003732959,0.00081630156,0.0015668275,0.00053474464,0.000639289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022428841,0.0010250483,0.001663492,0.0015648811,0.0021846301,0.0030940026,0.0017100711,0.0016106449,0.012034409],"category_scores_gemma":[0.0105146,0.0007543679,0.0016120932,0.0019795322,0.0040661427,0.008265646,0.002819057,0.0031557262,0.0016650535],"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.00085540465,0.00017460035,0.0054767756,0.00045412852,0.00009704488,0.00056391174,0.0005297852,0.05694674,0.0034286156,0.8694438,0.02213715,0.03989205],"study_design_scores_gemma":[0.0001296255,0.000047863476,0.0012285123,0.000048849502,0.00003603905,0.00023069557,0.00031439983,0.027234448,0.0007725005,0.95188636,0.018046394,0.000024281304],"about_ca_topic_score_codex":0.0021071658,"about_ca_topic_score_gemma":0.0024402796,"teacher_disagreement_score":0.012034409,"about_ca_system_score_codex":0.0018250011,"about_ca_system_score_gemma":0.00098767,"threshold_uncertainty_score":0.040259123},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4571687,0.0019110371,0.5114277,0.00065532007,0.000096984084,0.00008579802,0.00041709095,0.00028912188,0.027948298],"genre_scores_gemma":[0.91999227,0.0008339682,0.071474865,0.00014989704,0.0003180252,0.00009272643,0.00039799203,0.00007972087,0.00666056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993697,0.00013294342,0.0000491299,0.00017966483,0.00016739291,0.00010125693],"domain_scores_gemma":[0.99693716,0.0018023907,0.00044542112,0.00022213307,0.00030180032,0.0002911614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011090778,0.00032353823,0.00046985265,0.00232693,0.0012584272,0.002080625,0.0006377639,0.0005537334,0.0038614885],"category_scores_gemma":[0.0062644356,0.00034837535,0.0011035837,0.0016139662,0.0019074569,0.0029024924,0.0011469595,0.0013604693,0.00034438452],"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.00003753914,0.000020112655,0.003906654,0.00007027448,0.000012769103,0.00021040779,0.00035155742,0.0050526313,0.0022749142,0.9709411,0.0008830154,0.01623891],"study_design_scores_gemma":[0.000010871318,0.00006902607,0.0043960228,0.00003765498,0.000016375456,0.0006723176,0.000144606,0.046761345,0.001242676,0.9404384,0.0061793546,0.000031275333],"about_ca_topic_score_codex":0.00092345505,"about_ca_topic_score_gemma":0.0008577152,"teacher_disagreement_score":0.0038614885,"about_ca_system_score_codex":0.0009944807,"about_ca_system_score_gemma":0.00035061254,"threshold_uncertainty_score":0.012917936},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24704513,0.0030056764,0.73138326,0.0028138033,0.00007629568,0.000183805,0.0008246128,0.00059762277,0.01406973],"genre_scores_gemma":[0.9231552,0.001942217,0.06728452,0.0002868453,0.00018877909,0.00035317818,0.0007691407,0.00016700722,0.005853122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828476,0.00064719166,0.00008275044,0.0003050538,0.00042092384,0.0002593468],"domain_scores_gemma":[0.97957474,0.01565099,0.0020152233,0.0009660137,0.0010864312,0.00070662634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001980073,0.00087231066,0.0011665517,0.0023204177,0.0012118845,0.0026008415,0.0027755522,0.0014858616,0.0044014105],"category_scores_gemma":[0.02299052,0.0006469492,0.0007643153,0.0021584434,0.0022226423,0.0051508048,0.0023753436,0.0017483849,0.00050480897],"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.00020262894,0.00010755088,0.0045003234,0.00027512442,0.00009755297,0.00019643478,0.00045174398,0.54691434,0.002070056,0.4255884,0.004854548,0.014741295],"study_design_scores_gemma":[0.00002358438,0.00003951053,0.00087345927,0.000027048445,0.000017628578,0.00009243985,0.00008471011,0.83783126,0.00029706044,0.15918404,0.0015139004,0.000015446289],"about_ca_topic_score_codex":0.0040806932,"about_ca_topic_score_gemma":0.0030725277,"teacher_disagreement_score":0.0044014105,"about_ca_system_score_codex":0.002993912,"about_ca_system_score_gemma":0.00070849154,"threshold_uncertainty_score":0.021722436},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.632056,0.002227398,0.17963566,0.0019826216,0.0005403624,0.000101599275,0.0010219044,0.00033382417,0.1821006],"genre_scores_gemma":[0.9352554,0.001139311,0.027574038,0.00025274706,0.00032489566,0.00008009402,0.00036614016,0.000053838932,0.03495352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993431,0.00010287749,0.000021716145,0.00013843444,0.00019041779,0.00020351763],"domain_scores_gemma":[0.99932957,0.00020441724,0.00009667191,0.00009998766,0.00014123908,0.00012815988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054528675,0.00049239374,0.00059755804,0.0011514807,0.00096768554,0.0014239807,0.00061903225,0.0005486787,0.008275499],"category_scores_gemma":[0.0021729295,0.00024398981,0.00063600694,0.00091525837,0.0017236631,0.002244357,0.0014666693,0.0017992834,0.0011830943],"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.000045103687,0.000010983404,0.000444467,0.00003998237,0.000006028053,0.000077564415,0.000108863846,0.002646165,0.0017581526,0.9835031,0.0010477119,0.010311776],"study_design_scores_gemma":[0.000047486625,0.00010286509,0.0018731392,0.000037879392,0.000014943911,0.0003458716,0.0002341787,0.036415383,0.0032296649,0.92894906,0.028709762,0.000039818973],"about_ca_topic_score_codex":0.0013975186,"about_ca_topic_score_gemma":0.0010304806,"teacher_disagreement_score":0.008275499,"about_ca_system_score_codex":0.0014372255,"about_ca_system_score_gemma":0.0006713361,"threshold_uncertainty_score":0.027684331},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02800854,0.00030969203,0.9534609,0.0009811595,0.00008880791,0.00019124807,0.00041268926,0.00088371505,0.015663246],"genre_scores_gemma":[0.49500838,0.000593022,0.4820036,0.00084293296,0.00018808644,0.00043725903,0.0014320828,0.00051533745,0.01897932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774003,0.0005658816,0.00014908078,0.0005636921,0.00061248394,0.000368853],"domain_scores_gemma":[0.99545974,0.0031055617,0.00029026673,0.00052389613,0.00038807027,0.00023243738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002043704,0.0009503605,0.0011835385,0.0008813865,0.00080111047,0.0031181313,0.0019424647,0.0012820618,0.010859245],"category_scores_gemma":[0.011381747,0.0005064988,0.0013200288,0.0019822905,0.0016851103,0.004568115,0.003137288,0.0034581313,0.0012711303],"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.00027243208,0.00014554361,0.00082473765,0.0002681722,0.000041150768,0.00012818628,0.0002810198,0.32399678,0.002192003,0.5678791,0.007467082,0.09650376],"study_design_scores_gemma":[0.000042230295,0.000033312775,0.000081611906,0.000020999827,0.000007642788,0.000035983474,0.00004102902,0.7343865,0.0006772979,0.2620303,0.0026350527,0.000008066483],"about_ca_topic_score_codex":0.0028311727,"about_ca_topic_score_gemma":0.0033175414,"teacher_disagreement_score":0.010859245,"about_ca_system_score_codex":0.0030526156,"about_ca_system_score_gemma":0.0016608016,"threshold_uncertainty_score":0.03632784},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7919894,0.0006721541,0.15524846,0.00095592614,0.000063890235,0.000108438086,0.0013643873,0.00029570525,0.049301684],"genre_scores_gemma":[0.9050203,0.0007135336,0.07495969,0.00022482843,0.00006300772,0.00031815568,0.0013915566,0.00013119429,0.01717764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929214,0.00013152203,0.00005087856,0.00018430482,0.0002172785,0.00012388389],"domain_scores_gemma":[0.9971635,0.0016535724,0.0004331265,0.00017079191,0.00040399906,0.00017489915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040951945,0.00038976973,0.0003706252,0.0017146212,0.0009532247,0.0017849462,0.0006599032,0.0006937661,0.0049228],"category_scores_gemma":[0.0031808184,0.0003791358,0.00040368468,0.0015330812,0.0011830267,0.0016979835,0.0005932189,0.0005541325,0.0004042342],"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.00032022235,0.000088784414,0.014717563,0.000417753,0.0000609634,0.00042774784,0.0011777239,0.028393386,0.02346649,0.8383629,0.005152539,0.08741393],"study_design_scores_gemma":[0.000055103093,0.0001572189,0.014290687,0.00016817398,0.00010015156,0.0013738677,0.0010146456,0.12760015,0.020696163,0.79803425,0.036427993,0.00008151456],"about_ca_topic_score_codex":0.002365478,"about_ca_topic_score_gemma":0.0032607133,"teacher_disagreement_score":0.0049228,"about_ca_system_score_codex":0.0015370285,"about_ca_system_score_gemma":0.0006759475,"threshold_uncertainty_score":0.016468406},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78699565,0.0002575544,0.14696898,0.0002601268,0.00005892885,0.000097427815,0.0004297862,0.00025636857,0.06467521],"genre_scores_gemma":[0.9802013,0.00018260788,0.015274947,0.00009078459,0.000043507112,0.00007180221,0.000555361,0.000100006684,0.0034797594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928576,0.00012780984,0.000033366665,0.00019237518,0.0002323588,0.00012831227],"domain_scores_gemma":[0.99722505,0.0011730184,0.0004110429,0.00035502747,0.00048810092,0.00034770736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004356723,0.0002567079,0.00039605645,0.0012843875,0.0013822195,0.0017581115,0.0008679503,0.0006198788,0.0071774395],"category_scores_gemma":[0.0032170608,0.00033079417,0.0005969745,0.0008791416,0.0017388427,0.0036194113,0.0016564013,0.0010349359,0.00041361785],"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.0001697838,0.00006476748,0.0040488597,0.00010555264,0.000028272645,0.0005252632,0.0010182571,0.002684128,0.011100357,0.9515086,0.0013345644,0.027411638],"study_design_scores_gemma":[0.000034681718,0.00012078795,0.012159206,0.00008573451,0.000097005686,0.0015921072,0.0015958803,0.03425489,0.0110809645,0.9237794,0.015151805,0.000047560836],"about_ca_topic_score_codex":0.0016994292,"about_ca_topic_score_gemma":0.001323381,"teacher_disagreement_score":0.0071774395,"about_ca_system_score_codex":0.00061040523,"about_ca_system_score_gemma":0.00033148934,"threshold_uncertainty_score":0.024010956},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7265121,0.00093492743,0.22894795,0.0006925444,0.00030637597,0.000051126783,0.00017648608,0.00015658514,0.04222187],"genre_scores_gemma":[0.9692665,0.0004270451,0.012363957,0.000083058716,0.00014247835,0.000031711974,0.00008789019,0.000084980726,0.017512323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964094,0.000090905465,0.00001672654,0.00006727291,0.000117802534,0.00006631671],"domain_scores_gemma":[0.9995621,0.0001278664,0.0001067832,0.000049901297,0.0000763914,0.00007697638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005610516,0.00048879156,0.00033721744,0.0008649708,0.00060571276,0.0013043842,0.0004985435,0.00056451594,0.0064210985],"category_scores_gemma":[0.0010870829,0.00019502334,0.0005382541,0.0004225488,0.0017778635,0.0021162129,0.0014415934,0.00086380454,0.0008159684],"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.00007091026,0.00001311394,0.00030716532,0.00006255697,0.00000850784,0.00030034847,0.0004564974,0.0025610481,0.01058737,0.9793124,0.00071007106,0.005610012],"study_design_scores_gemma":[0.00003161302,0.00017566199,0.0014102587,0.000028212502,0.000012095688,0.0008965068,0.0007585957,0.042025898,0.0065971166,0.94257456,0.0054182187,0.00007121781],"about_ca_topic_score_codex":0.0005794057,"about_ca_topic_score_gemma":0.00029817328,"teacher_disagreement_score":0.0064210985,"about_ca_system_score_codex":0.00045927285,"about_ca_system_score_gemma":0.00028861992,"threshold_uncertainty_score":0.02148068},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7768486,0.0015636146,0.12519532,0.0037733694,0.0003220271,0.00003803116,0.00026318117,0.00031637598,0.09167945],"genre_scores_gemma":[0.9790693,0.0004857055,0.011981127,0.00032029903,0.00025641057,0.000050418443,0.0002297139,0.000043743352,0.0075632436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986926,0.0002713389,0.00005061281,0.00029333946,0.0003046698,0.0003875025],"domain_scores_gemma":[0.9958484,0.0022347397,0.00057374145,0.0005054914,0.00029838446,0.0005393067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011660468,0.00030917407,0.0005211557,0.0009493337,0.0016289218,0.0025356552,0.0010700796,0.0006743814,0.0048660133],"category_scores_gemma":[0.0047400794,0.00044020117,0.0006438995,0.00091850106,0.004046188,0.0046707788,0.0026152013,0.0026480325,0.000663611],"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.00024427086,0.0000651746,0.0024787479,0.00005338611,0.000009278203,0.000097541735,0.00085525657,0.0048723826,0.0014948308,0.9726114,0.0022976415,0.014920209],"study_design_scores_gemma":[0.000048972262,0.00009315308,0.0013235083,0.000025238542,0.000010390882,0.00015001513,0.0004317328,0.011615366,0.0019215344,0.9755456,0.008810512,0.000024064326],"about_ca_topic_score_codex":0.0017304989,"about_ca_topic_score_gemma":0.0009585831,"teacher_disagreement_score":0.0048660133,"about_ca_system_score_codex":0.0013317519,"about_ca_system_score_gemma":0.000640068,"threshold_uncertainty_score":0.016278386},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5773045,0.0033126709,0.2840301,0.0053952504,0.00047711033,0.00009233447,0.00041751805,0.00044377457,0.12852673],"genre_scores_gemma":[0.977799,0.0007055341,0.015038037,0.000253892,0.00047941168,0.000055305463,0.00018424785,0.00007698325,0.005407635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870706,0.0004116416,0.00007542539,0.00028173704,0.00036790143,0.00015619521],"domain_scores_gemma":[0.99621814,0.0017671138,0.0005942138,0.00047725384,0.00033409067,0.00060918176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015953014,0.0006196414,0.00076077285,0.004030977,0.0024310446,0.0060806107,0.0014351788,0.0012276325,0.0071062357],"category_scores_gemma":[0.0056877458,0.00041002865,0.0008427058,0.0021891221,0.0068947915,0.014776124,0.0041686445,0.0026594438,0.0006329676],"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.000006762255,0.000009566987,0.00017929115,0.000016298005,0.0000027992635,0.000062971696,0.0001924471,0.00033842988,0.00034300616,0.9973349,0.00016384335,0.0013497303],"study_design_scores_gemma":[0.000004603421,0.0000107556025,0.00020743012,0.0000067576198,0.0000030669985,0.00012867585,0.00013673681,0.0016630151,0.00027087316,0.99626935,0.0012882977,0.000010343394],"about_ca_topic_score_codex":0.00039439998,"about_ca_topic_score_gemma":0.00045818338,"teacher_disagreement_score":0.0071062357,"about_ca_system_score_codex":0.001311744,"about_ca_system_score_gemma":0.0004967324,"threshold_uncertainty_score":0.023772776},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7828931,0.001302031,0.15711863,0.0017241988,0.00013231677,0.000087808716,0.0011205947,0.0015583033,0.05406291],"genre_scores_gemma":[0.9769233,0.00036758892,0.01216313,0.00028683068,0.0001242712,0.00021721619,0.0009989896,0.00034850594,0.008570172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985127,0.00030874636,0.00006464501,0.00037606116,0.0004258904,0.00031195825],"domain_scores_gemma":[0.99018574,0.0062170606,0.00068468455,0.0012635344,0.00092623767,0.00072273664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002160957,0.00043338977,0.001072436,0.0019777196,0.0015403383,0.0029084822,0.0025035988,0.0012422629,0.010826835],"category_scores_gemma":[0.026696395,0.0006671781,0.00063353404,0.00086622074,0.0032540034,0.0051739076,0.0025570723,0.002017843,0.0013442752],"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.00022862518,0.000054788576,0.005429809,0.00016860224,0.000033437267,0.00020571706,0.0005966061,0.011865268,0.0032821414,0.96350104,0.005331065,0.009302944],"study_design_scores_gemma":[0.000047210793,0.00005890829,0.004909314,0.00013446537,0.00003775959,0.0005946043,0.00046516195,0.23811348,0.004213759,0.74701506,0.004326507,0.00008372827],"about_ca_topic_score_codex":0.001907299,"about_ca_topic_score_gemma":0.0021414277,"teacher_disagreement_score":0.010826835,"about_ca_system_score_codex":0.0030527464,"about_ca_system_score_gemma":0.000990515,"threshold_uncertainty_score":0.03621936},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43427587,0.00027427863,0.51493925,0.0005153776,0.00023140803,0.00012050669,0.000114976116,0.0008901051,0.048638254],"genre_scores_gemma":[0.8625041,0.00017090482,0.122222975,0.00020943911,0.00010674388,0.00007141822,0.00011741032,0.00028211297,0.0143149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999416,0.00010082914,0.000047241483,0.00014274417,0.00020582721,0.0000872516],"domain_scores_gemma":[0.99956125,0.00012922286,0.000048257723,0.000114482704,0.00008903049,0.000057816345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080784643,0.0002543285,0.00039276652,0.0008693086,0.00071199326,0.0015023999,0.0010092893,0.00045855125,0.0042382474],"category_scores_gemma":[0.0021409825,0.00026873918,0.0007198186,0.00034986195,0.0022246705,0.0027072502,0.0013215258,0.001416858,0.0009656616],"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.00004158075,0.00002760529,0.0012187532,0.000054257853,0.000008826228,0.00029389732,0.00039782014,0.0017432853,0.009636765,0.95626575,0.001289099,0.029022342],"study_design_scores_gemma":[0.00003101854,0.00012871195,0.0016493379,0.00004182971,0.000029302162,0.00055145414,0.0003377929,0.033945683,0.023821928,0.9260419,0.013349265,0.00007191258],"about_ca_topic_score_codex":0.00045794627,"about_ca_topic_score_gemma":0.0007341386,"teacher_disagreement_score":0.0042382474,"about_ca_system_score_codex":0.00044758565,"about_ca_system_score_gemma":0.00031271242,"threshold_uncertainty_score":0.014178336},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92800087,0.0005270931,0.042961325,0.00033294348,0.000053694577,0.00005034023,0.00017954882,0.00008168821,0.027812555],"genre_scores_gemma":[0.9811902,0.00024308899,0.009038301,0.00005742377,0.00005981243,0.00004474454,0.00021438212,0.000025823796,0.009126215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960023,0.000060489852,0.000023013767,0.00006825163,0.0001625297,0.000085556516],"domain_scores_gemma":[0.9994312,0.00014060285,0.0001343329,0.000050724782,0.000110641806,0.00013243491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036940892,0.00029361123,0.00038031954,0.0017649108,0.0014666916,0.0019924887,0.00045554186,0.00049366965,0.004657899],"category_scores_gemma":[0.0010364851,0.00022567826,0.00040196895,0.0009581873,0.0019454234,0.0024333724,0.0017857739,0.0006658873,0.00035279497],"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.000014273254,0.000011484326,0.0012186915,0.000036271224,0.000005793801,0.0000919767,0.0006107469,0.0008797834,0.0023729645,0.9916859,0.00029400422,0.0027780703],"study_design_scores_gemma":[0.000016587614,0.00004710429,0.0024137138,0.000027937687,0.0000109336925,0.0003517358,0.000805904,0.010316352,0.003793772,0.9736717,0.008518478,0.000025783096],"about_ca_topic_score_codex":0.0015650698,"about_ca_topic_score_gemma":0.0016233333,"teacher_disagreement_score":0.004657899,"about_ca_system_score_codex":0.0011047154,"about_ca_system_score_gemma":0.0005155489,"threshold_uncertainty_score":0.015582204},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7959768,0.0004592407,0.12606588,0.003952834,0.0002580177,0.00019021495,0.0019257126,0.0015600071,0.069611184],"genre_scores_gemma":[0.91713536,0.00034584108,0.06949566,0.0008953508,0.00007949552,0.00015692736,0.0018988292,0.0002156667,0.009776853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988513,0.00020930919,0.0000768037,0.00035241788,0.00021706111,0.00029313887],"domain_scores_gemma":[0.9959953,0.0018457947,0.0005740429,0.00080077676,0.00042621343,0.00035784545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000668009,0.0005918739,0.000673418,0.00081643654,0.0020640062,0.0020041885,0.0011469225,0.0016962134,0.011619296],"category_scores_gemma":[0.005574303,0.00055496977,0.00061407353,0.0012474618,0.001783184,0.003995833,0.002892036,0.0016132947,0.0019304401],"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.0028182778,0.0005832088,0.015711373,0.0008783603,0.00008400958,0.00091110833,0.0019265459,0.043852143,0.08198529,0.6538177,0.03134408,0.16608787],"study_design_scores_gemma":[0.0005468076,0.0010113613,0.0067581064,0.00015676428,0.00016735074,0.0017225702,0.0026917895,0.11275414,0.08028415,0.72666305,0.067002006,0.00024196862],"about_ca_topic_score_codex":0.0017858113,"about_ca_topic_score_gemma":0.0022669705,"teacher_disagreement_score":0.011619296,"about_ca_system_score_codex":0.0015961804,"about_ca_system_score_gemma":0.0010928743,"threshold_uncertainty_score":0.038870454},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8221906,0.0005790451,0.1433348,0.00050605857,0.00007483074,0.00007981896,0.0006718133,0.00028780996,0.032275297],"genre_scores_gemma":[0.9444625,0.0003942769,0.047582828,0.00015887244,0.00003148179,0.000061451115,0.00084884226,0.00007559424,0.006384144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952555,0.000043286982,0.00001868452,0.00015397804,0.00012679145,0.00013173731],"domain_scores_gemma":[0.99847144,0.00059750024,0.00033372195,0.00023152515,0.0001744127,0.00019134948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023706524,0.0004932316,0.00044119655,0.0006693929,0.0009681751,0.0012381568,0.000878627,0.00072876364,0.0050387974],"category_scores_gemma":[0.0023898953,0.00044931224,0.0005942191,0.0008564921,0.0010015301,0.0021076188,0.0012574921,0.00088890875,0.00040214925],"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.0009168399,0.00016291077,0.0146057485,0.0006448099,0.00014549487,0.0016386125,0.0013334875,0.07156582,0.056320485,0.75744814,0.008520603,0.08669714],"study_design_scores_gemma":[0.00014586355,0.00038932316,0.00945159,0.00022224912,0.00021752123,0.002866565,0.0014842752,0.1982823,0.058354635,0.65476125,0.07372448,0.00009998055],"about_ca_topic_score_codex":0.0038438821,"about_ca_topic_score_gemma":0.0056782695,"teacher_disagreement_score":0.0050387974,"about_ca_system_score_codex":0.0008956895,"about_ca_system_score_gemma":0.00056691514,"threshold_uncertainty_score":0.016856432},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84877795,0.0003162012,0.09388021,0.0005869561,0.0001976696,0.000046375604,0.0004072898,0.00023526108,0.055552047],"genre_scores_gemma":[0.97876006,0.00019132838,0.006501515,0.00009571744,0.00009789942,0.000031440213,0.00036291374,0.000047620855,0.013911408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996797,0.000045186633,0.000014649778,0.00006595579,0.00009409722,0.000100361314],"domain_scores_gemma":[0.9996841,0.000058152218,0.000057390538,0.000041339972,0.000070950904,0.000088090135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003147868,0.000382478,0.00037761775,0.0005550303,0.0007443977,0.0011261823,0.00030417653,0.0001878293,0.007760213],"category_scores_gemma":[0.00034792942,0.00017938048,0.0004579694,0.00041937255,0.001116588,0.0014124366,0.0014819504,0.00072107924,0.0012724324],"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.0001513204,0.000041607516,0.0013663276,0.00007503273,0.00001963152,0.00021413826,0.0002668628,0.0012932996,0.010017343,0.96762174,0.0014232661,0.017509371],"study_design_scores_gemma":[0.00005445711,0.000268146,0.0022125887,0.00002713196,0.000022613893,0.00044311272,0.0003570143,0.011880622,0.015143078,0.95165396,0.01790684,0.000030353478],"about_ca_topic_score_codex":0.00047221076,"about_ca_topic_score_gemma":0.0004859505,"teacher_disagreement_score":0.007760213,"about_ca_system_score_codex":0.000459733,"about_ca_system_score_gemma":0.0003832264,"threshold_uncertainty_score":0.025960565},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6733948,0.000530766,0.295638,0.0007679009,0.00006136347,0.00007042788,0.00057191565,0.00029535533,0.028669497],"genre_scores_gemma":[0.96906203,0.00046289898,0.026124777,0.00007399407,0.00009053986,0.000051646242,0.00032571077,0.000094801566,0.0037135894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923027,0.00012596951,0.00003902033,0.0001974331,0.00020103624,0.00020620879],"domain_scores_gemma":[0.9964187,0.002226352,0.00038536664,0.00040050186,0.00018707897,0.00038196333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011380316,0.0006860544,0.000852656,0.001660774,0.000785831,0.0017174926,0.0013952418,0.0007068477,0.003863059],"category_scores_gemma":[0.006453322,0.0005736065,0.00084418734,0.0013008608,0.0024301463,0.0027655622,0.0014451197,0.0018490436,0.00043955309],"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.00026947763,0.00011040823,0.005600997,0.00019011559,0.000042886477,0.0002800262,0.0004666449,0.09593665,0.02059061,0.8547293,0.00147963,0.020303247],"study_design_scores_gemma":[0.00003739447,0.00013331065,0.0027114197,0.000043262586,0.000045841756,0.0002714294,0.0001170118,0.25409833,0.009491962,0.7303018,0.0026970035,0.00005123165],"about_ca_topic_score_codex":0.0011283599,"about_ca_topic_score_gemma":0.0014328975,"teacher_disagreement_score":0.003863059,"about_ca_system_score_codex":0.0019335856,"about_ca_system_score_gemma":0.00056624203,"threshold_uncertainty_score":0.014029264},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81176716,0.00029491083,0.18013346,0.00015703787,0.000045335033,0.00003910637,0.000060862116,0.00017068455,0.007331484],"genre_scores_gemma":[0.9846646,0.00011446057,0.013514086,0.000019201516,0.000022203778,0.000041421754,0.0000387628,0.000032248037,0.0015530293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996131,0.00010291197,0.000023500495,0.000055234676,0.00012128005,0.00008396746],"domain_scores_gemma":[0.9980685,0.0010829265,0.00029641725,0.00015205696,0.00016847487,0.00023163088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007280209,0.00031625625,0.00063645595,0.0008539618,0.0008805002,0.0013547171,0.0009867427,0.0007492726,0.0015688272],"category_scores_gemma":[0.0039400007,0.00029046476,0.000659093,0.00040336963,0.002113902,0.0014008358,0.00084058533,0.0007981467,0.00019847883],"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.00012696777,0.00005154777,0.0021206713,0.000051291452,0.00002428349,0.00026923371,0.00039753184,0.35178065,0.006998633,0.6327818,0.00031957895,0.005077784],"study_design_scores_gemma":[0.00001231062,0.000024025798,0.00033501623,0.000008973342,0.0000056194567,0.000038105492,0.000032085594,0.8820239,0.0012319623,0.11601725,0.0002537658,0.000017046576],"about_ca_topic_score_codex":0.0036827773,"about_ca_topic_score_gemma":0.002046572,"teacher_disagreement_score":0.0036827773,"about_ca_system_score_codex":0.0012365475,"about_ca_system_score_gemma":0.0006476031,"threshold_uncertainty_score":0.00897181},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23200311,0.0012551436,0.6308284,0.0007171022,0.00043846498,0.00018140662,0.0007969091,0.00052240054,0.13325712],"genre_scores_gemma":[0.66444343,0.0010490206,0.2780674,0.00028957715,0.00038486382,0.0002948659,0.0014516874,0.0002847073,0.053734444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921143,0.000113370465,0.000069747206,0.00019982271,0.00023210543,0.00017340413],"domain_scores_gemma":[0.9989767,0.0003981844,0.00014891138,0.00015515731,0.0001990305,0.00012211593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072585535,0.0006531199,0.000575226,0.0009772843,0.0009268284,0.0015422631,0.00057483604,0.0005292166,0.010954834],"category_scores_gemma":[0.002203026,0.00033439143,0.0009828667,0.0006855841,0.0013934943,0.0023368627,0.0008670498,0.0013894526,0.0027624143],"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.00014975973,0.000027790986,0.0005839051,0.00012538336,0.00001239457,0.00015828402,0.00033152846,0.0034534202,0.008866952,0.93788964,0.0038535167,0.04454731],"study_design_scores_gemma":[0.000023259267,0.00015498986,0.00065189286,0.00006547093,0.000025053845,0.00054545095,0.00020658683,0.016261801,0.008530953,0.9367964,0.03670767,0.000030478066],"about_ca_topic_score_codex":0.00065560633,"about_ca_topic_score_gemma":0.0011848706,"teacher_disagreement_score":0.010954834,"about_ca_system_score_codex":0.0007421227,"about_ca_system_score_gemma":0.0005454087,"threshold_uncertainty_score":0.03664756},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6331504,0.0017471814,0.25817674,0.0008726257,0.0005094288,0.00010218405,0.00031870988,0.00039286714,0.10472984],"genre_scores_gemma":[0.90922946,0.00060709444,0.051722925,0.0003475176,0.00024205429,0.00009959461,0.00026043606,0.0001475843,0.03734337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956256,0.000056047433,0.000030116209,0.0001265514,0.00012962415,0.00009497906],"domain_scores_gemma":[0.99860424,0.00063383405,0.0002192591,0.00021573242,0.00015463452,0.00017230157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063439296,0.00033746895,0.00043155707,0.0012623774,0.0019134925,0.0019547653,0.00047739266,0.0007263183,0.011115014],"category_scores_gemma":[0.0022506542,0.00024051349,0.00071579503,0.0008985787,0.0015687108,0.0039198063,0.0011135384,0.0012348467,0.0010198515],"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.000048878363,0.000028546874,0.0010729614,0.00005963034,0.000006512548,0.00009562876,0.00043125093,0.0011537005,0.0058747223,0.97465056,0.0006222703,0.015955297],"study_design_scores_gemma":[0.000027458613,0.0003198986,0.004131779,0.00007253614,0.00003642372,0.0011816121,0.00065567327,0.018645637,0.016396662,0.9183869,0.04007863,0.00006673559],"about_ca_topic_score_codex":0.00040292554,"about_ca_topic_score_gemma":0.0006083527,"teacher_disagreement_score":0.011115014,"about_ca_system_score_codex":0.00087224663,"about_ca_system_score_gemma":0.00032812473,"threshold_uncertainty_score":0.037183404},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72145087,0.0008540572,0.2473714,0.0005978442,0.000055111454,0.00022790318,0.00096622517,0.00064656796,0.027829962],"genre_scores_gemma":[0.8885587,0.0004142497,0.1022671,0.0002593614,0.00004349913,0.00011199915,0.0020866387,0.00014533657,0.00611315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946195,0.0000994936,0.00002370292,0.00020246873,0.0000912961,0.000121154786],"domain_scores_gemma":[0.9985185,0.0004110477,0.00018132357,0.0005828603,0.00012313016,0.00018315468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040651904,0.0007298201,0.0004307979,0.0006925001,0.000808617,0.00093804987,0.0010208801,0.00057539984,0.0037861986],"category_scores_gemma":[0.0018201491,0.0004163365,0.000596602,0.0009504882,0.0011114696,0.0020753536,0.0016570828,0.0011667385,0.0008122176],"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.0011117046,0.0004390466,0.018956568,0.0009295405,0.00019026271,0.00090819044,0.00179496,0.10162033,0.10391027,0.5410421,0.0158834,0.21321371],"study_design_scores_gemma":[0.00011671255,0.00038790467,0.01680257,0.00017515336,0.0002566927,0.0023716546,0.0016365228,0.2998616,0.03895118,0.5931918,0.046177514,0.00007057155],"about_ca_topic_score_codex":0.0010516404,"about_ca_topic_score_gemma":0.002123155,"teacher_disagreement_score":0.0037861986,"about_ca_system_score_codex":0.00071785325,"about_ca_system_score_gemma":0.0003463657,"threshold_uncertainty_score":0.012666106},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06921273,0.0029126152,0.8623867,0.0065902364,0.00048726675,0.0001724662,0.0004249149,0.000347087,0.05746599],"genre_scores_gemma":[0.760052,0.0051662805,0.19279629,0.0014988091,0.0016716551,0.0007165945,0.0008819468,0.0003175084,0.036898896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99623615,0.001926924,0.00012131378,0.00073366746,0.00065202697,0.0003300885],"domain_scores_gemma":[0.9894499,0.008148342,0.00074775534,0.0007060867,0.0005180422,0.00042972562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030540326,0.0009190272,0.0012335975,0.0014976826,0.0020424246,0.0021526222,0.0025660845,0.0021641995,0.010166361],"category_scores_gemma":[0.01779126,0.00052909955,0.0011896794,0.0025369243,0.0031237628,0.009223592,0.0030869688,0.003629244,0.0013396204],"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.000032518077,0.00003377677,0.00011767876,0.00009189766,0.000014267655,0.00005896524,0.00009778314,0.013242751,0.00018192528,0.9731559,0.0026773133,0.010295301],"study_design_scores_gemma":[0.000019859617,0.000017892544,0.000053916017,0.000014987338,0.0000051567786,0.000062697574,0.000034711975,0.029515818,0.00015638089,0.9663603,0.0037495568,0.000008901393],"about_ca_topic_score_codex":0.0012244916,"about_ca_topic_score_gemma":0.0008619193,"teacher_disagreement_score":0.010166361,"about_ca_system_score_codex":0.0019155334,"about_ca_system_score_gemma":0.0011175617,"threshold_uncertainty_score":0.034009814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3713729,0.0016367603,0.54484594,0.0010084797,0.00019032192,0.00014298347,0.0004374923,0.0005529382,0.079812124],"genre_scores_gemma":[0.79308915,0.0010564389,0.18610509,0.00020186676,0.00022852261,0.00014594792,0.00048998144,0.00010663287,0.018576415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941266,0.00010442485,0.00003732242,0.0001015453,0.00020305139,0.00014106897],"domain_scores_gemma":[0.99884975,0.0005979798,0.00015196396,0.00016381576,0.0001532473,0.00008329003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007112642,0.0004745283,0.00057592767,0.0016491251,0.0013044061,0.0014930612,0.00062793604,0.0007101849,0.005306612],"category_scores_gemma":[0.0034520237,0.00027308357,0.0006776426,0.0014705369,0.0027969596,0.0043438375,0.0011683105,0.0014950607,0.0008238923],"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.0000282452,0.000011695319,0.00035063646,0.00004685142,0.0000024661792,0.000060253326,0.00017393094,0.00175322,0.0010467333,0.98132575,0.00067556533,0.014524659],"study_design_scores_gemma":[0.0000039527195,0.000024829162,0.00013547429,0.000017305354,0.000003826506,0.00010024777,0.00009861652,0.007718216,0.0013632482,0.9869294,0.0035949703,0.000009884443],"about_ca_topic_score_codex":0.001039725,"about_ca_topic_score_gemma":0.0015838728,"teacher_disagreement_score":0.005306612,"about_ca_system_score_codex":0.0010580613,"about_ca_system_score_gemma":0.0006705342,"threshold_uncertainty_score":0.01775235},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8704682,0.0011975233,0.060235746,0.00087868556,0.0003198302,0.000055218297,0.0003926962,0.00013246774,0.06631967],"genre_scores_gemma":[0.9786759,0.00050811365,0.0071529276,0.00016922534,0.00013583692,0.0000257105,0.00024396212,0.000048529717,0.013039736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981266,0.000026228981,0.0000060287607,0.000045518216,0.000050268885,0.00005924258],"domain_scores_gemma":[0.999713,0.000055175646,0.000055307723,0.000018698276,0.000055639637,0.00010210162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017086008,0.00030070462,0.00022277822,0.0016091089,0.00068231137,0.0021808033,0.00030151563,0.00026736603,0.005874287],"category_scores_gemma":[0.00053585053,0.00021024984,0.0002536345,0.0008384523,0.0016426663,0.0012909356,0.0009224183,0.00067349663,0.00047834514],"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.000059504895,0.000023189697,0.00203834,0.00006472465,0.000015379186,0.0002604173,0.000622215,0.0038815371,0.0081793135,0.97198445,0.002505718,0.010365114],"study_design_scores_gemma":[0.000021338494,0.00007758646,0.0062278565,0.000040004874,0.000017218374,0.00057222176,0.0006087,0.023257665,0.005931669,0.9436777,0.019517252,0.000050695766],"about_ca_topic_score_codex":0.0028662195,"about_ca_topic_score_gemma":0.002657124,"teacher_disagreement_score":0.005874287,"about_ca_system_score_codex":0.0013924438,"about_ca_system_score_gemma":0.00036834885,"threshold_uncertainty_score":0.019651413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34283286,0.001056157,0.55984855,0.0004899918,0.0002378218,0.00009392916,0.00077894406,0.00027692274,0.09438488],"genre_scores_gemma":[0.7146136,0.0013042134,0.25288498,0.00017356077,0.00009965169,0.00015997145,0.001020954,0.00023096026,0.029512042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995492,0.00007257332,0.000024934996,0.0001274107,0.0001367958,0.000089103996],"domain_scores_gemma":[0.9993748,0.00015541274,0.000104498504,0.00014740445,0.0001293969,0.00008856992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003180811,0.00034392683,0.0003397433,0.0008454154,0.0009245358,0.001225944,0.00056483084,0.00035381314,0.010798816],"category_scores_gemma":[0.0012632253,0.0003640724,0.00071575743,0.0011197963,0.0014716394,0.0017821098,0.0024688258,0.0015184387,0.00089345884],"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.00007113461,0.000026384341,0.0014926475,0.00012230448,0.000019319994,0.00032020936,0.0005060815,0.017538283,0.0084076645,0.930362,0.0020689827,0.03906498],"study_design_scores_gemma":[0.00003819142,0.0001432373,0.0030157322,0.00013454666,0.000038930157,0.000910473,0.0008981406,0.05210513,0.009469309,0.8642267,0.06896618,0.000053499833],"about_ca_topic_score_codex":0.0031059135,"about_ca_topic_score_gemma":0.0040578074,"teacher_disagreement_score":0.010798816,"about_ca_system_score_codex":0.0008694329,"about_ca_system_score_gemma":0.00035739376,"threshold_uncertainty_score":0.0361256},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3587999,0.005456548,0.33766168,0.010475218,0.0022616482,0.00007591433,0.00059813604,0.0005356421,0.28413543],"genre_scores_gemma":[0.9521271,0.0013934396,0.010788781,0.0006996739,0.0017128865,0.00004084726,0.00015632245,0.00006771323,0.033013225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991622,0.00023108818,0.00004135895,0.000102989514,0.0003581906,0.00010428175],"domain_scores_gemma":[0.9986821,0.0006033464,0.00016190154,0.00009974235,0.0002738358,0.00017914441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012170271,0.00050139864,0.0005323637,0.0013694832,0.0009602752,0.0026142262,0.0007287161,0.000684113,0.009829558],"category_scores_gemma":[0.0030576668,0.00017432561,0.00066605327,0.0011099359,0.0030951942,0.004560666,0.0016413241,0.0014052959,0.00087482395],"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.0000069616576,0.0000047834133,0.000029637637,0.000010175995,0.0000016745176,0.000029845372,0.000053649223,0.00030901982,0.00020555693,0.9974233,0.00040657155,0.0015188644],"study_design_scores_gemma":[0.0000040057766,0.00000836093,0.000054561617,0.0000040988944,0.00000136767,0.000030430765,0.00001797344,0.0030312648,0.0002205678,0.9952083,0.0014132315,0.0000058595474],"about_ca_topic_score_codex":0.0011608121,"about_ca_topic_score_gemma":0.0005137755,"teacher_disagreement_score":0.009829558,"about_ca_system_score_codex":0.0012963037,"about_ca_system_score_gemma":0.00088780705,"threshold_uncertainty_score":0.032883108},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8824479,0.00047238392,0.06511694,0.00038481844,0.0001499549,0.000032469383,0.00011371752,0.0001391392,0.051142722],"genre_scores_gemma":[0.9667037,0.00029208988,0.015837835,0.00012635178,0.00009187239,0.000038981994,0.00013456646,0.00006403343,0.016710645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996803,0.000059316586,0.000024114448,0.00007941192,0.000089562556,0.000067321824],"domain_scores_gemma":[0.99966145,0.00007931581,0.00008151352,0.000045219433,0.00006698543,0.000065556385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033784172,0.00038942898,0.00025468206,0.0012756154,0.0007256873,0.0021109702,0.0005252878,0.00048594797,0.0036042964],"category_scores_gemma":[0.0006779158,0.00024348203,0.00046221897,0.0005816627,0.0021076088,0.0021331222,0.0008421651,0.00062739046,0.0004978893],"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.00003427432,0.000016928585,0.00040593866,0.000020748023,0.0000052902883,0.00014557733,0.0005802438,0.0009694785,0.004047924,0.9872574,0.00026043403,0.0062557664],"study_design_scores_gemma":[0.000021438565,0.00005565951,0.0011539366,0.000021936881,0.000017380895,0.00024207385,0.00056740845,0.009756767,0.0070517915,0.9716483,0.009427448,0.000035778634],"about_ca_topic_score_codex":0.00090930547,"about_ca_topic_score_gemma":0.0014259802,"teacher_disagreement_score":0.0036042964,"about_ca_system_score_codex":0.00082369574,"about_ca_system_score_gemma":0.00034289228,"threshold_uncertainty_score":0.012057543},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.791445,0.003207714,0.10855541,0.0018091828,0.0011096436,0.000043428645,0.00024902076,0.00016113126,0.093419544],"genre_scores_gemma":[0.960713,0.0014154902,0.016645158,0.00030375112,0.0005009332,0.000041302843,0.00014191539,0.00005044326,0.020187909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99982786,0.000039526585,0.000009638232,0.000045635006,0.00004721289,0.000030152858],"domain_scores_gemma":[0.99967885,0.00010662552,0.00006556465,0.00005029001,0.000052129722,0.000046683883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055746123,0.00040217477,0.00031508316,0.0011398982,0.000937253,0.0018843523,0.00045824167,0.00035028777,0.008653679],"category_scores_gemma":[0.000918559,0.00014013788,0.00030412347,0.00093275105,0.0021448794,0.0024294148,0.00093306,0.00062381144,0.00074543664],"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.000014269389,0.000017459044,0.00038815808,0.00003962646,0.0000045597094,0.00017305717,0.00032917582,0.0008728495,0.0010497313,0.9898425,0.0007523073,0.0065163113],"study_design_scores_gemma":[0.0000060261027,0.000030519106,0.00057882123,0.000013078672,0.0000056508215,0.000241239,0.00034064794,0.0030780847,0.001107876,0.9887571,0.0058299117,0.000011016098],"about_ca_topic_score_codex":0.0007382787,"about_ca_topic_score_gemma":0.0007382365,"teacher_disagreement_score":0.008653679,"about_ca_system_score_codex":0.0005559871,"about_ca_system_score_gemma":0.00042594995,"threshold_uncertainty_score":0.02894944},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018957069,0.0012101491,0.99516785,0.000116494215,0.000074208496,0.000018727163,0.000033944616,0.00010546772,0.0013774849],"genre_scores_gemma":[0.38045672,0.009188816,0.5931219,0.00062719616,0.0012700644,0.0008416413,0.0003541866,0.00046159184,0.0136779575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984584,0.00055929646,0.00006776219,0.0003637033,0.00047789206,0.0000730078],"domain_scores_gemma":[0.9969132,0.0017758351,0.00035594247,0.00032017703,0.0005598293,0.00007497115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021712491,0.0010267387,0.001291612,0.0023541376,0.0006197412,0.0013682949,0.0013468881,0.0015699345,0.0025647494],"category_scores_gemma":[0.006418866,0.000474709,0.00141816,0.001431781,0.0020803874,0.0019184602,0.0024239686,0.002220877,0.00076032564],"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.000117468895,0.000047549347,0.0012187228,0.00055727264,0.00019953492,0.00009501217,0.00025559292,0.1610473,0.01810813,0.70347553,0.002312069,0.11256581],"study_design_scores_gemma":[0.000023008895,0.00014532075,0.00071994035,0.00009758235,0.000059175738,0.000082567625,0.00003637557,0.6480901,0.007985241,0.33123875,0.011452639,0.00006939715],"about_ca_topic_score_codex":0.0012102961,"about_ca_topic_score_gemma":0.00066469464,"teacher_disagreement_score":0.0025647494,"about_ca_system_score_codex":0.0010414951,"about_ca_system_score_gemma":0.0006607012,"threshold_uncertainty_score":0.011482775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03622705,0.020511199,0.860605,0.01625616,0.0016890127,0.00045348462,0.0014353616,0.0011112466,0.061711445],"genre_scores_gemma":[0.36033386,0.017466413,0.58864564,0.0056219166,0.0030084148,0.00070514256,0.0023464225,0.0006689663,0.021203255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99635834,0.0012928537,0.00019933445,0.0009146175,0.00090691453,0.00032796123],"domain_scores_gemma":[0.9931116,0.0054097255,0.00030573184,0.0005256902,0.00038792586,0.0002594057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031271533,0.0016946202,0.002176728,0.0022153175,0.0019916156,0.0032028363,0.003189445,0.0031789623,0.0073892493],"category_scores_gemma":[0.008514535,0.0011334362,0.004027016,0.0052013975,0.0033948114,0.005507981,0.004315776,0.007644351,0.0015608231],"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.00037945868,0.00036201678,0.0017786925,0.0017399722,0.0001945147,0.0005534606,0.0007945524,0.15969707,0.004109261,0.6203821,0.039924324,0.17008458],"study_design_scores_gemma":[0.000078542245,0.00009978268,0.0006870522,0.00017978705,0.00007381831,0.00070906506,0.0001808667,0.25271088,0.0021719337,0.7047832,0.03826358,0.000061393876],"about_ca_topic_score_codex":0.0054810573,"about_ca_topic_score_gemma":0.0047097043,"teacher_disagreement_score":0.0073892493,"about_ca_system_score_codex":0.0039054689,"about_ca_system_score_gemma":0.0018550722,"threshold_uncertainty_score":0.028336346},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73942673,0.0013524375,0.15506999,0.0016194487,0.0006058809,0.00004702713,0.00018515614,0.00016992196,0.10152333],"genre_scores_gemma":[0.9649174,0.00071828085,0.016492447,0.00022105213,0.0003871281,0.00003165464,0.000095304466,0.000044406657,0.017092293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970514,0.00006429747,0.000010598106,0.000055907167,0.00008532332,0.00007874706],"domain_scores_gemma":[0.99965537,0.00008311605,0.00008623107,0.00002703986,0.000095401134,0.000052797626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003163965,0.0003938528,0.000244629,0.00082203065,0.00072389765,0.0015671387,0.00033631976,0.00032519858,0.005591643],"category_scores_gemma":[0.00092558237,0.00012429598,0.00039508223,0.0006451897,0.0015152162,0.001823874,0.0010645463,0.00097633415,0.00069719745],"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.00003381309,0.000014000953,0.00028944368,0.00003315905,0.00000332116,0.00011740588,0.0002099245,0.0008181737,0.0025813966,0.98719364,0.0006561511,0.008049535],"study_design_scores_gemma":[0.000011169387,0.00010228568,0.00090938166,0.000024072764,0.000008827618,0.00036571585,0.00034079267,0.008986572,0.0041065984,0.9716437,0.013471036,0.000029864503],"about_ca_topic_score_codex":0.00069273444,"about_ca_topic_score_gemma":0.00065771193,"teacher_disagreement_score":0.005591643,"about_ca_system_score_codex":0.000611595,"about_ca_system_score_gemma":0.00039821328,"threshold_uncertainty_score":0.018705845},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48456395,0.0005728895,0.46069965,0.00011470397,0.00012321981,0.0001042307,0.00030157564,0.00057069963,0.052949104],"genre_scores_gemma":[0.9118843,0.00030607235,0.06995147,0.00007644558,0.000056705005,0.00015576213,0.0003794609,0.00014323094,0.017046608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995036,0.000068939524,0.000037572998,0.00013834011,0.00014750967,0.00010408397],"domain_scores_gemma":[0.99931526,0.00013726346,0.00008289844,0.00013437946,0.0002212515,0.000108913715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029406618,0.00034064866,0.0003445834,0.0006146002,0.0006081069,0.0012680696,0.00044126975,0.00031204888,0.006135995],"category_scores_gemma":[0.00074258115,0.00019757326,0.00042109416,0.00032066464,0.00089287205,0.0016880803,0.0010262517,0.0006076802,0.001037679],"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.00007820153,0.00003118118,0.00058169727,0.00007784764,0.000011360218,0.00021235253,0.00044413435,0.0076755015,0.014822264,0.954055,0.00056966254,0.021440819],"study_design_scores_gemma":[0.000026893913,0.00022455296,0.0013590703,0.00004628846,0.0000416154,0.0007079548,0.00034492172,0.11339698,0.030784916,0.8200771,0.032915834,0.00007381372],"about_ca_topic_score_codex":0.00074770086,"about_ca_topic_score_gemma":0.0007237552,"teacher_disagreement_score":0.006135995,"about_ca_system_score_codex":0.00047885402,"about_ca_system_score_gemma":0.00040404446,"threshold_uncertainty_score":0.020526946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82981646,0.0009712566,0.102853335,0.00057522336,0.00005734533,0.00014420657,0.001381699,0.00018289618,0.06401752],"genre_scores_gemma":[0.9697109,0.00040382327,0.017981447,0.0001565736,0.00011829125,0.00019864977,0.0013723368,0.0000745811,0.009983595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918956,0.00019708794,0.00004096873,0.00019376128,0.0001559662,0.00022266827],"domain_scores_gemma":[0.9975867,0.0009284918,0.00038488474,0.000404016,0.00029359368,0.0004023515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006746176,0.00032313133,0.00031959914,0.0013211778,0.0014226042,0.0019580324,0.00067112653,0.00047919492,0.0066086375],"category_scores_gemma":[0.0029981462,0.00054172473,0.00051522226,0.0015875311,0.0017740754,0.0026226207,0.0016896841,0.00088925014,0.00038581912],"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.00015879728,0.000031376694,0.0018889223,0.00008198979,0.000018271869,0.00019355056,0.000480357,0.011266445,0.0034317472,0.97002923,0.0023853793,0.010033871],"study_design_scores_gemma":[0.0000883066,0.000066902634,0.0041540954,0.00007242432,0.00003419654,0.0004815863,0.0006079768,0.067757934,0.004677607,0.9040058,0.018009262,0.00004388319],"about_ca_topic_score_codex":0.0031009142,"about_ca_topic_score_gemma":0.0043724175,"teacher_disagreement_score":0.0066086375,"about_ca_system_score_codex":0.0022053584,"about_ca_system_score_gemma":0.00081441127,"threshold_uncertainty_score":0.022108078},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45556358,0.0034532733,0.29986706,0.0012029159,0.00043938606,0.0002656731,0.0009709215,0.0010977724,0.23713936],"genre_scores_gemma":[0.939068,0.0008177556,0.027390266,0.00040569916,0.0002840774,0.00025442685,0.00066527963,0.000245841,0.030868536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910885,0.000092552546,0.0000465009,0.00031155834,0.00020257522,0.00023792697],"domain_scores_gemma":[0.9991547,0.00026843874,0.000104674546,0.00013598404,0.00014065151,0.00019557029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037422974,0.0004767769,0.00045009455,0.0017497452,0.002187222,0.0024791851,0.0006331423,0.0007414176,0.009721679],"category_scores_gemma":[0.002069692,0.00031028435,0.00073786156,0.0010940232,0.0021531137,0.003388886,0.002094811,0.0011197221,0.00090293563],"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.000028007518,0.000011981906,0.0006508538,0.000034804634,0.0000055947926,0.00007106553,0.0004255308,0.00061184925,0.0013963,0.9801856,0.0010018937,0.015576437],"study_design_scores_gemma":[0.000011275052,0.000028801962,0.0005827699,0.00003798532,0.000009549304,0.0002253207,0.00018340415,0.0035983748,0.0015546269,0.9512589,0.042488948,0.000020078323],"about_ca_topic_score_codex":0.0027314473,"about_ca_topic_score_gemma":0.0020998,"teacher_disagreement_score":0.009721679,"about_ca_system_score_codex":0.0022561818,"about_ca_system_score_gemma":0.00078935426,"threshold_uncertainty_score":0.0325222},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.780856,0.0016977395,0.1596219,0.010263066,0.00030797697,0.00026491762,0.00056514196,0.0004706355,0.045952544],"genre_scores_gemma":[0.9603624,0.0011057619,0.026920998,0.0008631514,0.00020703624,0.00012554665,0.00053883815,0.0001237408,0.009752565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990276,0.00024518563,0.000046578425,0.0003030218,0.00017655092,0.00020107313],"domain_scores_gemma":[0.98926395,0.007752183,0.0008955191,0.00097641395,0.00042094238,0.0006910651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012603981,0.00047919582,0.0007433461,0.0007297057,0.0018432498,0.004425806,0.0019162082,0.001802637,0.008456543],"category_scores_gemma":[0.009386691,0.000629126,0.0010974302,0.0013324656,0.003802021,0.008147304,0.0021852737,0.0034416134,0.0006750453],"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.00043958786,0.00021020233,0.0043007103,0.00060195406,0.00005290494,0.00059783325,0.0012471697,0.061298564,0.010874782,0.8810738,0.009950983,0.029351512],"study_design_scores_gemma":[0.000090621616,0.00010107578,0.0014954744,0.000078485136,0.000033226042,0.00041282925,0.0007383822,0.09643557,0.004758701,0.88839287,0.0074267536,0.000036079775],"about_ca_topic_score_codex":0.0020148465,"about_ca_topic_score_gemma":0.0014431394,"teacher_disagreement_score":0.008456543,"about_ca_system_score_codex":0.002936646,"about_ca_system_score_gemma":0.0010350749,"threshold_uncertainty_score":0.028290033},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70643616,0.0006165827,0.2772701,0.0010657556,0.000041941134,0.00020872024,0.00128037,0.00084982574,0.012230455],"genre_scores_gemma":[0.9338432,0.00042350768,0.062105324,0.00016472818,0.00006357128,0.000092950795,0.0010812363,0.00013685781,0.0020886096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999236,0.00018847283,0.000039875977,0.0002044597,0.00016758038,0.00016360724],"domain_scores_gemma":[0.9932904,0.0045769652,0.00076276646,0.0005821396,0.00030803654,0.0004796966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006684338,0.0004161617,0.00057932065,0.0009315459,0.000846654,0.0014082278,0.000937906,0.0006043262,0.0033367071],"category_scores_gemma":[0.005500054,0.0005475591,0.00065611483,0.001237236,0.0013416186,0.0031708346,0.001258218,0.0010397815,0.00027642393],"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.0011857915,0.00027956694,0.011830122,0.0010393152,0.00016204377,0.0013345479,0.001477338,0.27761042,0.061998606,0.56340086,0.008490167,0.0711912],"study_design_scores_gemma":[0.000115308976,0.00012914954,0.0042559546,0.000068787325,0.00010044239,0.0010430437,0.00042521046,0.341199,0.019308798,0.6277977,0.0055142967,0.000042224496],"about_ca_topic_score_codex":0.0024213009,"about_ca_topic_score_gemma":0.0032337338,"teacher_disagreement_score":0.0033367071,"about_ca_system_score_codex":0.0012543519,"about_ca_system_score_gemma":0.00080185203,"threshold_uncertainty_score":0.011162341},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93648934,0.00019334072,0.051919274,0.0001737976,0.000027136914,0.000016752067,0.00015063307,0.00011058527,0.010919257],"genre_scores_gemma":[0.98723304,0.00013193348,0.009692888,0.000035943685,0.000009918622,0.000017969727,0.00016898706,0.000021907741,0.0026875262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998141,0.000032509946,0.000010713858,0.000042356023,0.000044310615,0.000055951026],"domain_scores_gemma":[0.9994105,0.000174497,0.00011573081,0.00016136703,0.000056972494,0.00008094814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021214329,0.0002677122,0.00040645798,0.00078941265,0.0006767465,0.0011233767,0.00059498724,0.00065131544,0.0032583987],"category_scores_gemma":[0.0010459522,0.00020632488,0.0006311905,0.0006350829,0.00083523075,0.0013187804,0.00053369283,0.00058549974,0.00038756293],"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.00042482762,0.00012690929,0.011514368,0.00010730033,0.000041364845,0.0006751318,0.00052820356,0.1178171,0.020239383,0.8198931,0.0017779518,0.026854351],"study_design_scores_gemma":[0.000043347365,0.000106230276,0.003372849,0.00002976872,0.000014969981,0.0005694191,0.00029272132,0.47310007,0.0048459163,0.5125428,0.0050431555,0.000038701517],"about_ca_topic_score_codex":0.0018344903,"about_ca_topic_score_gemma":0.0013874375,"teacher_disagreement_score":0.0032583987,"about_ca_system_score_codex":0.00050817686,"about_ca_system_score_gemma":0.00028699578,"threshold_uncertainty_score":0.010900438},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062441975,0.0010067247,0.7019582,0.016122468,0.0013497429,0.00030846268,0.0005794801,0.0004307406,0.21580216],"genre_scores_gemma":[0.8447472,0.0009173792,0.079496756,0.004908849,0.0004666796,0.00047169125,0.0001549067,0.00021706417,0.06861957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998858,0.00038813372,0.000046279813,0.00029999544,0.00024007533,0.00016752018],"domain_scores_gemma":[0.99837506,0.00084364746,0.00013328376,0.0002805183,0.0001595094,0.00020794349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011680006,0.0005548254,0.000598505,0.000326274,0.0009195401,0.0020508196,0.0017966622,0.0027586978,0.013020312],"category_scores_gemma":[0.0062700124,0.00029091426,0.00091297465,0.0003836837,0.0035552986,0.004067964,0.00152444,0.0033352599,0.001287078],"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.000041196745,0.000013586656,0.0001453957,0.000028539796,0.000010805545,0.000083359584,0.00007434149,0.008508859,0.0009317628,0.9834403,0.003089806,0.0036320824],"study_design_scores_gemma":[0.000064609456,0.00005188956,0.00018458307,0.000024164165,0.0000124466915,0.00017812858,0.000055540248,0.073533095,0.0006908208,0.90295297,0.022215502,0.000036269557],"about_ca_topic_score_codex":0.002788527,"about_ca_topic_score_gemma":0.0019541467,"teacher_disagreement_score":0.013020312,"about_ca_system_score_codex":0.0020382556,"about_ca_system_score_gemma":0.0009856133,"threshold_uncertainty_score":0.043557286},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78934115,0.0049532005,0.05835111,0.0012020877,0.00039826607,0.000033275293,0.00037891528,0.00020085453,0.14514099],"genre_scores_gemma":[0.96907187,0.001081704,0.007408133,0.00023606487,0.00018518486,0.000023953517,0.0003103331,0.000021965308,0.021660652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996086,0.000075820186,0.000029034885,0.00008361557,0.00011903382,0.00008383626],"domain_scores_gemma":[0.99971956,0.000054076976,0.00007708688,0.000031646898,0.00006737939,0.000050239236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044098258,0.00030946158,0.00026168086,0.0012146721,0.0008252875,0.0023995042,0.0003652711,0.000445326,0.0057328115],"category_scores_gemma":[0.0006568384,0.00014303614,0.0004268499,0.0009802973,0.0013808886,0.0022930196,0.0012643756,0.00061637943,0.00071200647],"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.000015459675,0.00002160785,0.00061688793,0.000039708062,0.000009348683,0.00015048639,0.000283262,0.000550288,0.001895742,0.98790365,0.00090516685,0.0076083755],"study_design_scores_gemma":[0.000015135787,0.00012184044,0.004924654,0.000037527727,0.000021510978,0.0010165666,0.0003732549,0.0038606622,0.0027212973,0.9541805,0.032696232,0.000030833835],"about_ca_topic_score_codex":0.0009548699,"about_ca_topic_score_gemma":0.00090620865,"teacher_disagreement_score":0.0057328115,"about_ca_system_score_codex":0.00070433016,"about_ca_system_score_gemma":0.00022973744,"threshold_uncertainty_score":0.019178152},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11135984,0.013141776,0.7631475,0.0058034766,0.0010434062,0.0002477826,0.002578194,0.0012953309,0.10138266],"genre_scores_gemma":[0.8200588,0.020598497,0.11754412,0.0028166368,0.008383249,0.00066181284,0.0047202753,0.0011846524,0.024031863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99562824,0.000747219,0.00027858815,0.0010967907,0.0016141178,0.00063502014],"domain_scores_gemma":[0.9776863,0.015320744,0.0024480599,0.0020666108,0.0015887734,0.000889447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052759685,0.0020039617,0.0020744887,0.0075898236,0.0030686331,0.0059636603,0.003075301,0.0016048308,0.015770093],"category_scores_gemma":[0.03667986,0.0011441164,0.0014988233,0.012233281,0.0049062134,0.011416429,0.0034616317,0.0040664147,0.0024322001],"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.0002576952,0.00015244613,0.0057414374,0.00059274054,0.000091376874,0.0004228945,0.0007222012,0.016821364,0.0043521626,0.88465405,0.012945668,0.07324596],"study_design_scores_gemma":[0.0000496235,0.00011761513,0.0028123793,0.00015546208,0.00009022011,0.0010521895,0.00023110118,0.043160476,0.0062355986,0.9236951,0.022318985,0.000081263526],"about_ca_topic_score_codex":0.0014712295,"about_ca_topic_score_gemma":0.0011958486,"teacher_disagreement_score":0.015770093,"about_ca_system_score_codex":0.002984944,"about_ca_system_score_gemma":0.00160177,"threshold_uncertainty_score":0.05275625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12818922,0.0014017457,0.5566699,0.0012638458,0.0014716544,0.00024082651,0.00043962186,0.0013069147,0.30901626],"genre_scores_gemma":[0.579958,0.0012976115,0.30221957,0.0013918697,0.00095112453,0.0002611433,0.00052251696,0.0012214544,0.11217668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779993,0.0004279135,0.00018953448,0.0005046777,0.0008228301,0.00025506987],"domain_scores_gemma":[0.9975694,0.0006324189,0.0001795188,0.0008775516,0.0005944806,0.00014653965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002546133,0.00071625254,0.00078126555,0.0013513499,0.0016348781,0.0019461532,0.001971786,0.0008725343,0.011435496],"category_scores_gemma":[0.005361251,0.0006256358,0.0018043091,0.00084818143,0.0030302815,0.0046964614,0.001967473,0.00306114,0.0041089575],"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.00004257108,0.000017764603,0.00023803463,0.000045835728,0.000006928758,0.00017355877,0.00019673632,0.0008760054,0.002426128,0.9820654,0.001667847,0.012243208],"study_design_scores_gemma":[0.00003116201,0.00011812553,0.00052994944,0.0000513662,0.00003166723,0.0008010248,0.00015921774,0.008188859,0.009705818,0.92635083,0.053957026,0.00007494751],"about_ca_topic_score_codex":0.001551044,"about_ca_topic_score_gemma":0.0019321588,"teacher_disagreement_score":0.011435496,"about_ca_system_score_codex":0.0008983976,"about_ca_system_score_gemma":0.00062837516,"threshold_uncertainty_score":0.038255572},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75194466,0.0003359636,0.201118,0.0011931851,0.00006993323,0.00014868523,0.0011543678,0.0010118061,0.043023523],"genre_scores_gemma":[0.9563352,0.00012560385,0.035661515,0.0001454054,0.00010318164,0.00013269775,0.0006446572,0.00012473423,0.0067270086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792767,0.00030783005,0.00018478517,0.0006197706,0.0006906145,0.00026940726],"domain_scores_gemma":[0.9933028,0.002986645,0.00091390946,0.0011430995,0.0010259869,0.00062750705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011677103,0.00035406149,0.0005126885,0.00093731994,0.001518955,0.003154053,0.00071663724,0.00053481496,0.005818051],"category_scores_gemma":[0.0049061878,0.00046921687,0.00091304595,0.00055971945,0.0031565996,0.0055748955,0.002494743,0.0013037235,0.0007282773],"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.0002713381,0.00006216078,0.0038395822,0.000119690936,0.000032915257,0.00025834312,0.0020022804,0.002696427,0.0154443635,0.9601841,0.001562222,0.01352658],"study_design_scores_gemma":[0.00004859924,0.0001299093,0.0038928369,0.000037698257,0.00004943382,0.0009739844,0.00094617443,0.024005786,0.019620689,0.92904365,0.021171814,0.000079566766],"about_ca_topic_score_codex":0.00043114505,"about_ca_topic_score_gemma":0.00049061293,"teacher_disagreement_score":0.005818051,"about_ca_system_score_codex":0.0012529239,"about_ca_system_score_gemma":0.0006997642,"threshold_uncertainty_score":0.0194633},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6759067,0.00048057822,0.24247833,0.00033891542,0.00013053961,0.000065531414,0.00030437487,0.00033863337,0.07995637],"genre_scores_gemma":[0.90844125,0.00042330177,0.06743857,0.00008538035,0.000066096356,0.00010791915,0.00042007712,0.00012486575,0.022892639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997037,0.00003255221,0.000009614251,0.000082159364,0.000083668674,0.00008822672],"domain_scores_gemma":[0.99946123,0.00013514172,0.00012548872,0.000084163854,0.000084053645,0.000110018125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002220773,0.00043289902,0.00035781303,0.00103011,0.00097255316,0.0013521939,0.00048751707,0.00028916527,0.008643724],"category_scores_gemma":[0.0009354348,0.00024159807,0.00049552956,0.0005264731,0.0020613305,0.0012563523,0.0015057012,0.0010883703,0.00094321615],"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.00010813407,0.000033437023,0.0014918295,0.00009873617,0.000008618777,0.00020190951,0.0002918523,0.009852313,0.013902557,0.9469368,0.0016655391,0.025408346],"study_design_scores_gemma":[0.00009415733,0.00038343697,0.0076098233,0.0001212402,0.000033107633,0.0015189977,0.0013712418,0.094580494,0.035279952,0.8029616,0.0559093,0.00013667642],"about_ca_topic_score_codex":0.001287777,"about_ca_topic_score_gemma":0.0016757167,"teacher_disagreement_score":0.008643724,"about_ca_system_score_codex":0.0008262033,"about_ca_system_score_gemma":0.0003758402,"threshold_uncertainty_score":0.02891612},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34940392,0.0025563189,0.31929103,0.0017979596,0.0010366197,0.00007375388,0.0004510702,0.00036678129,0.3250225],"genre_scores_gemma":[0.9119792,0.0013287445,0.037836377,0.00063665945,0.0006152983,0.000101077116,0.0003747285,0.00014224758,0.046985723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992919,0.000111016896,0.00003385779,0.0001774397,0.00024442698,0.00014135924],"domain_scores_gemma":[0.9990778,0.0003402401,0.00014378938,0.00008542125,0.00021089887,0.00014188791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058639137,0.000535474,0.0004249425,0.0018501617,0.0011044946,0.0021308255,0.0005065512,0.0005155258,0.007594835],"category_scores_gemma":[0.0026973358,0.00029276402,0.0005201964,0.0009575001,0.0031654118,0.0033469414,0.001281886,0.0014723255,0.0015509607],"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.000021786353,0.000005351077,0.00046479836,0.000027575483,0.000002092552,0.000071888084,0.00013825505,0.0005363817,0.0019670397,0.98762554,0.0010165286,0.008122757],"study_design_scores_gemma":[0.000008519919,0.000057560785,0.0009314235,0.00003986351,0.000008032865,0.0006498565,0.00021645622,0.006938209,0.0042620767,0.95414627,0.03269627,0.000045443834],"about_ca_topic_score_codex":0.0005376122,"about_ca_topic_score_gemma":0.0006896585,"teacher_disagreement_score":0.007594835,"about_ca_system_score_codex":0.00093457196,"about_ca_system_score_gemma":0.0005309747,"threshold_uncertainty_score":0.025407195},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6458079,0.00046625378,0.25515756,0.0004209696,0.00022024449,0.0001423341,0.00046757984,0.00032158307,0.09699562],"genre_scores_gemma":[0.9450251,0.00028403586,0.038125336,0.00014773213,0.00012087939,0.00013581236,0.0007618656,0.000115728566,0.0152835185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796945,0.0003610767,0.00017920037,0.0005093071,0.00057291554,0.0004080702],"domain_scores_gemma":[0.99853885,0.000615374,0.00024598706,0.00021710458,0.00023087575,0.00015166159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080809667,0.0004586289,0.00049903104,0.0015746542,0.001345137,0.0017626355,0.0008392336,0.0008160702,0.010355873],"category_scores_gemma":[0.004414204,0.00024769886,0.0008929635,0.0010443183,0.0019258078,0.0030623174,0.0014115564,0.0011376543,0.0009321532],"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.00007175835,0.000043729335,0.0012796483,0.00003997963,0.000011258504,0.00046823412,0.0005112185,0.005093795,0.00398775,0.964177,0.00066504563,0.023650626],"study_design_scores_gemma":[0.000021138943,0.0000805924,0.0010332176,0.000022359178,0.000011592843,0.0003721345,0.00024644347,0.018804673,0.0037217338,0.9660858,0.009573634,0.000026739974],"about_ca_topic_score_codex":0.0016603051,"about_ca_topic_score_gemma":0.0012187544,"teacher_disagreement_score":0.010355873,"about_ca_system_score_codex":0.001024646,"about_ca_system_score_gemma":0.0005200838,"threshold_uncertainty_score":0.03464383},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6658383,0.00041324642,0.090259865,0.0014407488,0.0005165297,0.000083432424,0.00045027674,0.00042582827,0.24057166],"genre_scores_gemma":[0.9485532,0.00018176532,0.012961969,0.00026695745,0.00018972643,0.00010208204,0.00026493403,0.00019015156,0.03728914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950075,0.00009546064,0.000018083838,0.00009359302,0.00012768332,0.00016433638],"domain_scores_gemma":[0.9995983,0.00015545935,0.0000505549,0.00003352119,0.000054873843,0.000107281325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049759395,0.0008245281,0.0003918236,0.0017738086,0.0022059262,0.003170304,0.00086240895,0.00093408773,0.012117304],"category_scores_gemma":[0.0009134415,0.00037236637,0.00077431253,0.00089901715,0.0035549118,0.002789059,0.0012688919,0.0018394723,0.0011530997],"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.000016891585,0.000011693487,0.00013687373,0.000007944078,0.0000012532478,0.0000943546,0.00017253784,0.0004377038,0.0006085824,0.996132,0.00047754904,0.0019025775],"study_design_scores_gemma":[0.000016034839,0.000022190608,0.00036736665,0.000014550986,0.0000037325003,0.00010324234,0.00016884682,0.004264766,0.0011947956,0.9883591,0.0054666447,0.000018787005],"about_ca_topic_score_codex":0.0014039149,"about_ca_topic_score_gemma":0.0023958131,"teacher_disagreement_score":0.012117304,"about_ca_system_score_codex":0.0025785337,"about_ca_system_score_gemma":0.00061202183,"threshold_uncertainty_score":0.040536404},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.943169,0.00038384247,0.041164406,0.00015467191,0.000045253477,0.000018835888,0.00023764325,0.00009022063,0.0147361355],"genre_scores_gemma":[0.979878,0.00043695417,0.014900811,0.000059782764,0.000084751555,0.000056918387,0.00031805743,0.00004522359,0.0042194286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995869,0.000074573,0.000027011178,0.00015287106,0.00009048082,0.00006815666],"domain_scores_gemma":[0.99812824,0.0006494383,0.00052816805,0.00016327256,0.00020447822,0.00032635755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003210831,0.00031972534,0.0003707022,0.0012000118,0.0008862118,0.0010858973,0.0007257527,0.0005023719,0.0024525952],"category_scores_gemma":[0.0021809954,0.00036591062,0.00064872927,0.00068481715,0.0014290396,0.0016429902,0.0009856077,0.0009297809,0.0002848146],"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.00024048089,0.00005184743,0.008984327,0.00017699644,0.000051091,0.0004799022,0.0010580473,0.030579844,0.021171777,0.92057973,0.0015849655,0.015040973],"study_design_scores_gemma":[0.00007345214,0.00029044788,0.030836118,0.00008381724,0.00010833162,0.0027726826,0.0019921483,0.15513824,0.019026106,0.75835824,0.031195961,0.0001244397],"about_ca_topic_score_codex":0.0009651534,"about_ca_topic_score_gemma":0.0008973347,"teacher_disagreement_score":0.0024525952,"about_ca_system_score_codex":0.00079044455,"about_ca_system_score_gemma":0.00020100703,"threshold_uncertainty_score":0.008204699},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.895867,0.00061374664,0.07969256,0.00029003978,0.000061772706,0.00003618193,0.0001337613,0.000065019616,0.023239987],"genre_scores_gemma":[0.9809333,0.0003532122,0.010764899,0.0000439941,0.000061855695,0.00003417039,0.00015645009,0.00002689013,0.0076251323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968934,0.000034348588,0.00001146,0.000065808024,0.000113113696,0.00008603529],"domain_scores_gemma":[0.9994567,0.0001328099,0.00012388763,0.00003620565,0.000089934314,0.00016036502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027891586,0.00039978608,0.0002855242,0.002411877,0.0007410111,0.0020964474,0.00045535347,0.00033301645,0.0039363997],"category_scores_gemma":[0.0013884373,0.00019568794,0.00028613323,0.0007368877,0.0020538461,0.0025856367,0.0012230008,0.0010258631,0.00026471316],"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.00003111491,0.000014928796,0.0016058284,0.000033432432,0.0000067368596,0.0000963072,0.0005191932,0.003265308,0.0045004473,0.98036504,0.0002927633,0.009268857],"study_design_scores_gemma":[0.00002077552,0.00007235522,0.0034037072,0.00004734355,0.00001579361,0.00036250282,0.0011554445,0.03381238,0.008280535,0.9407627,0.012029375,0.000037090802],"about_ca_topic_score_codex":0.0016121031,"about_ca_topic_score_gemma":0.0011337023,"teacher_disagreement_score":0.0039363997,"about_ca_system_score_codex":0.00093237567,"about_ca_system_score_gemma":0.00032172073,"threshold_uncertainty_score":0.013168573},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59912425,0.006259247,0.17841853,0.004295625,0.0007052971,0.00008974315,0.00019449646,0.0002876188,0.21062526],"genre_scores_gemma":[0.9549149,0.0027987522,0.017344337,0.00044782917,0.0007785166,0.00005677508,0.00009876494,0.00008552905,0.023474501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994772,0.00012833453,0.00001928155,0.00007543254,0.00019822965,0.000101449055],"domain_scores_gemma":[0.99954647,0.00016422277,0.000054950066,0.000044693865,0.000103623905,0.000085934436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085084897,0.00049061904,0.00055124017,0.0028615354,0.0018837668,0.002016907,0.00057906064,0.00059111905,0.0032632328],"category_scores_gemma":[0.0015889435,0.00026406912,0.0005495263,0.0014633315,0.0037649234,0.003369793,0.0020643775,0.0013188702,0.0004451927],"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.0000063922885,0.000007682373,0.00021124752,0.000017798438,0.0000024892865,0.00008054639,0.00027942334,0.00048195262,0.0005357933,0.99449784,0.00039075056,0.00348815],"study_design_scores_gemma":[0.00000847328,0.000024057716,0.0005955742,0.000024299969,0.0000070290453,0.00011766481,0.00022957948,0.004070729,0.00064997753,0.9868689,0.007385542,0.000018250936],"about_ca_topic_score_codex":0.0015633479,"about_ca_topic_score_gemma":0.0011447411,"teacher_disagreement_score":0.0032632328,"about_ca_system_score_codex":0.0012427333,"about_ca_system_score_gemma":0.0006021997,"threshold_uncertainty_score":0.010916591},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71687365,0.00057055213,0.235189,0.0006856577,0.00014141631,0.00009481448,0.0016080374,0.0010867915,0.043750174],"genre_scores_gemma":[0.91505283,0.00035689696,0.06765526,0.00017694592,0.00011075443,0.00025352475,0.0017007728,0.00047562327,0.014217395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982493,0.0003097796,0.00016941207,0.00034193846,0.0005370848,0.00039253946],"domain_scores_gemma":[0.9967899,0.001504319,0.00036508476,0.00037909337,0.0005303221,0.00043136056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015577392,0.0007644646,0.00083907164,0.0027342546,0.0016642008,0.0041259136,0.0015233452,0.0009090118,0.0070168967],"category_scores_gemma":[0.006663346,0.00042932652,0.00077696313,0.002436393,0.002278295,0.0053712963,0.0021436296,0.0009817263,0.0011944927],"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.0005984066,0.00010071577,0.0077570546,0.0002288387,0.000037796377,0.00034625526,0.00061314716,0.008420473,0.007680349,0.9370731,0.003983076,0.03316069],"study_design_scores_gemma":[0.000052160703,0.000114353985,0.0035833465,0.00013907332,0.00004925739,0.0004994691,0.00034763655,0.080349505,0.015153345,0.88799816,0.01161942,0.000094247844],"about_ca_topic_score_codex":0.0015306125,"about_ca_topic_score_gemma":0.0021927215,"teacher_disagreement_score":0.0070168967,"about_ca_system_score_codex":0.002281763,"about_ca_system_score_gemma":0.0010587182,"threshold_uncertainty_score":0.023473859},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23492754,0.0018379083,0.60932744,0.0019155772,0.0011860855,0.00012988523,0.0002009422,0.0003367264,0.15013799],"genre_scores_gemma":[0.8185477,0.0014956229,0.13572837,0.00082321145,0.0006684242,0.00018843326,0.00010994653,0.000260509,0.042177714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993057,0.00012263111,0.00004172349,0.00011567652,0.00030372743,0.00011046293],"domain_scores_gemma":[0.99918574,0.00026668413,0.00008245825,0.00011760872,0.00027797167,0.000069525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012795969,0.00048255868,0.0005012151,0.0011264752,0.0011634302,0.0013956492,0.00091887714,0.00058733945,0.004813664],"category_scores_gemma":[0.0027137813,0.00026504198,0.0011328208,0.00066120387,0.002390044,0.002879383,0.0013738967,0.0020935794,0.0017054295],"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.000016718863,0.000010965773,0.00028599764,0.000048505135,0.0000067479227,0.000274761,0.0004731697,0.00058385654,0.0031584592,0.98105204,0.00095511833,0.013133648],"study_design_scores_gemma":[0.000015741829,0.00007350723,0.0008170712,0.000041265965,0.0000211918,0.0008138291,0.00018457032,0.008748853,0.010586395,0.9556263,0.023021735,0.000049542537],"about_ca_topic_score_codex":0.0010858858,"about_ca_topic_score_gemma":0.0013603987,"teacher_disagreement_score":0.004813664,"about_ca_system_score_codex":0.000626636,"about_ca_system_score_gemma":0.00063679664,"threshold_uncertainty_score":0.016103327},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2033923,0.00046149988,0.6068886,0.0005331479,0.00046605588,0.00010501364,0.001380009,0.001980202,0.1847932],"genre_scores_gemma":[0.8630605,0.00034658486,0.07567737,0.00032858935,0.00010893366,0.00012759524,0.00089541246,0.0004944621,0.05896051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885,0.00018308622,0.000073084375,0.00038333706,0.00033924362,0.00017127045],"domain_scores_gemma":[0.99805,0.0007071164,0.00018326509,0.0005978182,0.00036926277,0.00009251373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067607674,0.00027709102,0.0002767573,0.0013168361,0.0007996202,0.0016126588,0.0005452397,0.00047313148,0.011701989],"category_scores_gemma":[0.0030412655,0.00023585702,0.00055796094,0.0012796737,0.0018394574,0.0019832633,0.00079637434,0.0007423278,0.0018968742],"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.00003908375,0.000014498371,0.0011713256,0.000037547066,0.000007555077,0.00016170529,0.00030232372,0.0021872604,0.0054331003,0.9491002,0.0021091723,0.039436262],"study_design_scores_gemma":[0.000013115434,0.000043742843,0.0019807853,0.000020902593,0.000016872573,0.0006081227,0.00013692949,0.015646342,0.010260677,0.91890687,0.052330386,0.00003535795],"about_ca_topic_score_codex":0.0012898447,"about_ca_topic_score_gemma":0.001397854,"teacher_disagreement_score":0.011701989,"about_ca_system_score_codex":0.0008651319,"about_ca_system_score_gemma":0.00051096926,"threshold_uncertainty_score":0.03914708},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049398158,0.00011097961,0.93046033,0.00014637689,0.000045656747,0.00005936799,0.00009537498,0.00022786527,0.019455856],"genre_scores_gemma":[0.47808346,0.00051530823,0.48868203,0.00018042684,0.000080644284,0.00027515888,0.0004063371,0.00042351004,0.031353045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952376,0.00012258676,0.000031770865,0.00006960764,0.00019011015,0.000062112034],"domain_scores_gemma":[0.9989281,0.00060002535,0.00009013973,0.0001700464,0.00016012804,0.00005143551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007227761,0.00025368648,0.00030648345,0.0009400486,0.0007556579,0.0013079398,0.0007426087,0.0005268571,0.0048202514],"category_scores_gemma":[0.0034228035,0.0003486576,0.0008025369,0.0007248106,0.00093313155,0.0020858669,0.0008204964,0.00081149663,0.0012191556],"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.000009581512,0.0000125343295,0.00038273915,0.00003972207,0.0000032174585,0.000119476135,0.0002646223,0.009339563,0.0030892626,0.96308434,0.0005944556,0.023060478],"study_design_scores_gemma":[0.000009718679,0.000030146584,0.00028164833,0.00003996265,0.000009837704,0.00048674032,0.00010885832,0.10569817,0.0076020514,0.8696135,0.01609603,0.000023258825],"about_ca_topic_score_codex":0.00060630887,"about_ca_topic_score_gemma":0.001815458,"teacher_disagreement_score":0.0048202514,"about_ca_system_score_codex":0.00070763996,"about_ca_system_score_gemma":0.00072753057,"threshold_uncertainty_score":0.016125381},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7373061,0.0005363445,0.117284484,0.0008752164,0.00024766388,0.000053092124,0.00026414607,0.0002506692,0.1431822],"genre_scores_gemma":[0.96355814,0.0002675621,0.007818244,0.00012756501,0.00010802859,0.000019719302,0.00016438543,0.000058466154,0.027877871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998048,0.000025897529,0.00000567381,0.00006481076,0.000048735317,0.000050046303],"domain_scores_gemma":[0.9997253,0.000066542336,0.00004112947,0.000040575662,0.000056880974,0.00006965833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002281923,0.00029097614,0.00022216774,0.0012785705,0.0006721116,0.001072858,0.00043728523,0.00030331415,0.007175686],"category_scores_gemma":[0.00057228905,0.00014244788,0.00034880024,0.00067734363,0.0020303898,0.0021567252,0.0011105445,0.00089305756,0.0005521196],"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.000011315343,0.000006225371,0.00033306953,0.000013143565,0.0000021174317,0.000044195436,0.00016645879,0.0006903122,0.0018417562,0.99191236,0.0004056942,0.004573197],"study_design_scores_gemma":[0.000016405353,0.000057007426,0.0023571576,0.000017201188,0.000011483678,0.00031543756,0.00041272913,0.009301136,0.004171365,0.9631384,0.020175716,0.000025955167],"about_ca_topic_score_codex":0.0026426583,"about_ca_topic_score_gemma":0.0025630775,"teacher_disagreement_score":0.007175686,"about_ca_system_score_codex":0.0013092603,"about_ca_system_score_gemma":0.0005334022,"threshold_uncertainty_score":0.024005055},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8597408,0.0009453951,0.071556255,0.0010753187,0.0001871976,0.000046551417,0.00026450274,0.00016937201,0.066014595],"genre_scores_gemma":[0.96850395,0.00041943774,0.017536309,0.0002616347,0.00010157056,0.00006841075,0.00037379816,0.00004787323,0.012686988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994253,0.00009772795,0.000032713855,0.0001507598,0.00013728434,0.00015621977],"domain_scores_gemma":[0.9993149,0.00020373231,0.00013615315,0.00010589045,0.00010786121,0.00013149205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040887797,0.0003760126,0.00041057743,0.0009835374,0.0013952126,0.0018279351,0.0007692677,0.00069700903,0.0035802275],"category_scores_gemma":[0.0014880296,0.00026446645,0.00047775093,0.00073943374,0.0020838957,0.0029624738,0.0017693597,0.0011578404,0.00049963506],"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.000035487465,0.000009601598,0.0005359774,0.000026190834,0.0000030732335,0.000061521554,0.00023435983,0.0009119274,0.0012517053,0.99163646,0.00068818004,0.004605621],"study_design_scores_gemma":[0.000013173172,0.000025294357,0.0012400231,0.000020624542,0.0000059972544,0.00020168663,0.00033398854,0.0067421175,0.00217758,0.98294604,0.0062726233,0.000020879084],"about_ca_topic_score_codex":0.0012785059,"about_ca_topic_score_gemma":0.0013181719,"teacher_disagreement_score":0.0035802275,"about_ca_system_score_codex":0.0013104504,"about_ca_system_score_gemma":0.0005307728,"threshold_uncertainty_score":0.0119770765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8898848,0.0005220888,0.08084485,0.00091989554,0.000062203755,0.000043802887,0.00024581375,0.0005848417,0.026891675],"genre_scores_gemma":[0.979166,0.00032528513,0.012731039,0.00014118232,0.00012953048,0.00010509975,0.0005072146,0.00014401044,0.00675067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999173,0.00022982959,0.000030021673,0.00013326261,0.00027917823,0.00015467581],"domain_scores_gemma":[0.9886874,0.0069551924,0.0012587873,0.0009791144,0.00076073635,0.0013587833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018000115,0.00062196224,0.0006403371,0.0030474046,0.001486328,0.0025842204,0.0017875776,0.0011592314,0.006485531],"category_scores_gemma":[0.012913628,0.00072284264,0.00078095665,0.0011313737,0.0030094404,0.0036566188,0.002128116,0.0018921837,0.00062042056],"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.00015801945,0.00007478761,0.00390681,0.000102458835,0.000018896884,0.00022617095,0.00028891698,0.010650539,0.0047472524,0.9712903,0.0015333353,0.007002602],"study_design_scores_gemma":[0.0000686125,0.00010738212,0.00396536,0.00007624437,0.000037886584,0.0007617249,0.0002300153,0.1834292,0.006660317,0.80182356,0.0027916534,0.000048119473],"about_ca_topic_score_codex":0.0006620927,"about_ca_topic_score_gemma":0.0007718593,"teacher_disagreement_score":0.006485531,"about_ca_system_score_codex":0.0021601666,"about_ca_system_score_gemma":0.00057119614,"threshold_uncertainty_score":0.02169621},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9651963,0.00035906542,0.029005682,0.0002595835,0.000028164934,0.000009154059,0.00003561169,0.000064375316,0.0050419187],"genre_scores_gemma":[0.997618,0.00010315044,0.0012743024,0.000025345016,0.000024109931,0.000006794367,0.000024582621,0.000011923927,0.0009117234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997739,0.000057213656,0.000007379223,0.000032528176,0.000054895525,0.00007395796],"domain_scores_gemma":[0.9985897,0.0004717878,0.00037018547,0.000097027085,0.00013575493,0.00033553079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064401637,0.0003953179,0.00037533964,0.0014310546,0.00091515674,0.0014956141,0.000636634,0.0005858958,0.0014874423],"category_scores_gemma":[0.0039246553,0.00020695201,0.00026640066,0.00076986785,0.0026445603,0.0014387051,0.00094015844,0.00067077356,0.0001597353],"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.00017268262,0.000060319275,0.0030413365,0.000043448083,0.00002495613,0.0004728763,0.00043456227,0.06506163,0.009629998,0.9149825,0.0007669398,0.0053087673],"study_design_scores_gemma":[0.000045097335,0.00012675367,0.008118012,0.000035630284,0.000021112559,0.00044100347,0.00046884015,0.41362026,0.0035265763,0.57238716,0.0011321392,0.00007740837],"about_ca_topic_score_codex":0.003392726,"about_ca_topic_score_gemma":0.0016862063,"teacher_disagreement_score":0.003392726,"about_ca_system_score_codex":0.0010968079,"about_ca_system_score_gemma":0.0003733291,"threshold_uncertainty_score":0.007957995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5923878,0.001794338,0.19180655,0.0021997031,0.0008243656,0.0001436757,0.00036441933,0.000400674,0.21007843],"genre_scores_gemma":[0.95279175,0.0005988817,0.02220884,0.00031409977,0.00025921798,0.00007584944,0.0001923046,0.00010672367,0.023452282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949765,0.00012156571,0.000030640513,0.00009511466,0.00012325209,0.00013179747],"domain_scores_gemma":[0.99927145,0.00016613823,0.0001617871,0.00008615439,0.00010694994,0.00020755776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000634435,0.00069554755,0.00058450084,0.0013783257,0.0017512703,0.0025209265,0.0009226499,0.001332548,0.010685891],"category_scores_gemma":[0.0023200996,0.00029225784,0.00075554714,0.0010541702,0.0027908615,0.004245607,0.0017373553,0.0017100199,0.0013887236],"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.000008318342,0.0000052821783,0.000060929695,0.000009662329,0.0000013624398,0.000057258352,0.00006767374,0.0005999917,0.00038745953,0.997764,0.00020480047,0.0008334065],"study_design_scores_gemma":[0.0000104775245,0.000021703354,0.000102614904,0.000012998766,0.0000033314734,0.00017103877,0.00018004239,0.0048190136,0.0006521465,0.99101514,0.0029978806,0.0000135554865],"about_ca_topic_score_codex":0.0006692455,"about_ca_topic_score_gemma":0.00070723076,"teacher_disagreement_score":0.010685891,"about_ca_system_score_codex":0.0008275451,"about_ca_system_score_gemma":0.0004857567,"threshold_uncertainty_score":0.035747886},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12028324,0.00009422381,0.86921763,0.00009407763,0.000039017694,0.00003983311,0.00024810608,0.0012889743,0.00869501],"genre_scores_gemma":[0.6418748,0.00020712678,0.34923258,0.00008561443,0.000032693923,0.000114699564,0.0008902454,0.0006716446,0.0068906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968016,0.000046307923,0.000010592385,0.000057129673,0.0001121142,0.0000937289],"domain_scores_gemma":[0.9988927,0.00052732776,0.00007842431,0.00021965192,0.00021633954,0.00006548767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002650066,0.00042826007,0.0004986359,0.00097439747,0.000564432,0.000872444,0.0006191936,0.0004865505,0.005936337],"category_scores_gemma":[0.003453537,0.00030915695,0.0008502578,0.0009222984,0.0006002454,0.0013958586,0.0008201833,0.0008465625,0.0010206797],"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.0003145575,0.000090189635,0.00484735,0.00023513455,0.00008091728,0.00028713123,0.000355657,0.5552472,0.02783714,0.19603097,0.006063315,0.20861042],"study_design_scores_gemma":[0.000017944349,0.000048846738,0.0006118909,0.000015000473,0.000011060634,0.00009186503,0.000061908446,0.92378116,0.008414909,0.0629925,0.003933403,0.000019520283],"about_ca_topic_score_codex":0.005624595,"about_ca_topic_score_gemma":0.011766937,"teacher_disagreement_score":0.005936337,"about_ca_system_score_codex":0.00068240205,"about_ca_system_score_gemma":0.00096505263,"threshold_uncertainty_score":0.019858956},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8103685,0.00043698397,0.18153638,0.00056656706,0.00005549464,0.000120922334,0.0011880223,0.00049026404,0.0052369237],"genre_scores_gemma":[0.9763165,0.00026456724,0.019236736,0.00010668879,0.000037518854,0.00020931127,0.0014542694,0.00012946578,0.0022449342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980427,0.0005610917,0.000093428236,0.0005030167,0.0005503843,0.00024933068],"domain_scores_gemma":[0.9813198,0.010600066,0.0028758745,0.0023961554,0.0020427709,0.00076535164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023410744,0.0004517501,0.00076685817,0.0024419508,0.0006942443,0.0016439361,0.0016999987,0.0012392777,0.0028053923],"category_scores_gemma":[0.0221773,0.0006479967,0.0006413788,0.0019656145,0.0026738148,0.0023681081,0.0015259709,0.0012959371,0.00051488786],"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.0013518922,0.00014645925,0.09515974,0.00032055101,0.00022044634,0.00077380217,0.0008804946,0.53477204,0.032521892,0.27150154,0.0066634803,0.055687636],"study_design_scores_gemma":[0.00011463069,0.00019353167,0.027322777,0.00008608456,0.00007338366,0.0011897266,0.0004910427,0.85162437,0.010485082,0.105199024,0.003068199,0.00015221204],"about_ca_topic_score_codex":0.001812218,"about_ca_topic_score_gemma":0.001915518,"teacher_disagreement_score":0.0028053923,"about_ca_system_score_codex":0.0014197553,"about_ca_system_score_gemma":0.0004972713,"threshold_uncertainty_score":0.012380958},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22119904,0.0012972226,0.68238926,0.00078308897,0.00043961252,0.00011655673,0.0007660364,0.0014828485,0.09152629],"genre_scores_gemma":[0.8590634,0.0007601626,0.11349468,0.00041536652,0.0003954635,0.00010989157,0.000753666,0.00068257505,0.024324758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901354,0.00010942881,0.000034628913,0.00030790476,0.00023343721,0.00030104505],"domain_scores_gemma":[0.998774,0.0004220438,0.00013068173,0.00031835854,0.00022599127,0.0001289269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078902,0.0008640935,0.0006432468,0.0015447388,0.0011526297,0.0015645667,0.00068155193,0.00056316244,0.010790705],"category_scores_gemma":[0.00451248,0.00040634527,0.00084268686,0.0014286009,0.0022688739,0.0036736361,0.0022575422,0.002105087,0.0025170925],"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.00015953275,0.00004220249,0.0016973325,0.00010690123,0.000014304795,0.00020243695,0.00060034025,0.0045384998,0.008031947,0.9072038,0.0051358026,0.07226686],"study_design_scores_gemma":[0.000023715433,0.000071026814,0.0008275507,0.0000558147,0.00001976548,0.00030633135,0.00022387349,0.02850713,0.006230109,0.93963623,0.024054877,0.000043537402],"about_ca_topic_score_codex":0.0021036463,"about_ca_topic_score_gemma":0.002686986,"teacher_disagreement_score":0.010790705,"about_ca_system_score_codex":0.0015178771,"about_ca_system_score_gemma":0.0008381914,"threshold_uncertainty_score":0.03609848},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41962633,0.00058584934,0.50376534,0.00029750497,0.0001324098,0.000100598605,0.00094970345,0.0005132357,0.07402908],"genre_scores_gemma":[0.67292494,0.00067642983,0.29677764,0.00013854187,0.000085348205,0.0003022393,0.0015120102,0.00031909105,0.027263775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944097,0.0000744595,0.00003452144,0.00012229205,0.000225154,0.00010250942],"domain_scores_gemma":[0.9990145,0.00037447893,0.00018956947,0.00017370972,0.00017258586,0.00007515283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002492475,0.00035608845,0.0004464362,0.0006736427,0.0006725874,0.0013588539,0.00079607917,0.0004257636,0.0076565873],"category_scores_gemma":[0.0014976835,0.00037997292,0.0004536607,0.0009154376,0.0007306026,0.0018071737,0.00094258046,0.0011647658,0.0009018157],"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.00030585978,0.00011223958,0.004752682,0.0004215993,0.00004100891,0.0008599576,0.0007654309,0.03425701,0.07151898,0.7901993,0.004920647,0.091845274],"study_design_scores_gemma":[0.00011253881,0.0004162791,0.0062710023,0.00019385602,0.00007292292,0.0034376024,0.0015493291,0.2515772,0.08115361,0.54589677,0.10920647,0.00011252979],"about_ca_topic_score_codex":0.00058067864,"about_ca_topic_score_gemma":0.0010681933,"teacher_disagreement_score":0.0076565873,"about_ca_system_score_codex":0.00047777506,"about_ca_system_score_gemma":0.00037007863,"threshold_uncertainty_score":0.025613785},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5360673,0.001016216,0.37459654,0.00038436853,0.00017405454,0.00006436188,0.0006592444,0.00028215963,0.08675577],"genre_scores_gemma":[0.91366166,0.0010106105,0.065756574,0.00009024608,0.000105505744,0.000096843,0.0007226826,0.00017717145,0.018378725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949634,0.0000673235,0.000015615691,0.00012329553,0.00020037552,0.000096971075],"domain_scores_gemma":[0.9994931,0.00016234066,0.000083591556,0.0000783669,0.000112993715,0.00006957014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000231292,0.00036009966,0.0002991565,0.0008131244,0.00070301705,0.001553849,0.00041887892,0.00040077095,0.0064591034],"category_scores_gemma":[0.0014377068,0.0002983732,0.0005768572,0.000864616,0.001480291,0.001850012,0.0011522284,0.0013480913,0.0004884241],"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.000043567023,0.000010005431,0.0014045525,0.00005274074,0.000010644725,0.000113275295,0.00021124662,0.02153678,0.00516879,0.950552,0.0012473105,0.01964911],"study_design_scores_gemma":[0.000024704143,0.00011802322,0.006723164,0.00008261577,0.000030581014,0.0007589891,0.001128574,0.16495246,0.015553704,0.7249004,0.08566371,0.00006303932],"about_ca_topic_score_codex":0.0028439942,"about_ca_topic_score_gemma":0.0035392765,"teacher_disagreement_score":0.0064591034,"about_ca_system_score_codex":0.0008290668,"about_ca_system_score_gemma":0.00041746878,"threshold_uncertainty_score":0.021607876},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82283777,0.00028221414,0.0972242,0.00035632812,0.000098105804,0.00003547675,0.00008753541,0.00011570432,0.07896266],"genre_scores_gemma":[0.9639826,0.00030691092,0.014433601,0.00012307859,0.00007050204,0.000035639638,0.00007496477,0.00007720108,0.020895492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979264,0.0000337687,0.000007107309,0.000040537747,0.00006610847,0.000059825037],"domain_scores_gemma":[0.999731,0.00006370464,0.000054607553,0.00003422935,0.000060060294,0.000056351622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027128623,0.00034946523,0.00022760386,0.0008284912,0.00068683387,0.00073441607,0.0004057863,0.00025058948,0.0061186766],"category_scores_gemma":[0.00082750176,0.00016360878,0.0003740348,0.0003791282,0.0013435762,0.0015374046,0.00091783976,0.0010654274,0.0007285762],"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.000031509386,0.000013184702,0.0005087089,0.000021459906,0.0000030103604,0.00019938355,0.00043287312,0.00076643424,0.007926311,0.9823139,0.00036320853,0.007419979],"study_design_scores_gemma":[0.00003063322,0.00013495117,0.002490685,0.000037055943,0.000019035622,0.0008132402,0.0008976729,0.019051265,0.029322892,0.9287886,0.018358244,0.000055666405],"about_ca_topic_score_codex":0.00068805896,"about_ca_topic_score_gemma":0.00067996245,"teacher_disagreement_score":0.0061186766,"about_ca_system_score_codex":0.00046172293,"about_ca_system_score_gemma":0.00030022225,"threshold_uncertainty_score":0.02046907},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91080046,0.00024811891,0.07965678,0.00008090943,0.000034909997,0.000022692182,0.0002251953,0.00013283863,0.008797994],"genre_scores_gemma":[0.9611875,0.00028555404,0.032975513,0.000042186435,0.000033666725,0.00004033101,0.00054884,0.00003712612,0.004849357],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99979645,0.00003440886,0.00001761312,0.000033538166,0.0000633444,0.000054739503],"domain_scores_gemma":[0.9993247,0.00021859625,0.00017187474,0.00009865372,0.0001325345,0.000053614396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015634704,0.00025224444,0.00024807843,0.0006561136,0.00031180232,0.0007004748,0.00029477527,0.00022683412,0.0026804109],"category_scores_gemma":[0.0008487967,0.00013439143,0.0002535351,0.00047809555,0.0005441305,0.0009483402,0.00042450527,0.0002582466,0.00038338607],"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.0012865025,0.00018596413,0.025509855,0.00059463194,0.000058844704,0.0011425936,0.0013661016,0.0321169,0.2641932,0.29936588,0.0046570203,0.36952242],"study_design_scores_gemma":[0.00016244286,0.001870117,0.027044974,0.00015239573,0.00013910039,0.0046706195,0.0019324197,0.22948296,0.25242355,0.44282836,0.039123576,0.00016954447],"about_ca_topic_score_codex":0.0004136387,"about_ca_topic_score_gemma":0.00062910496,"teacher_disagreement_score":0.0026804109,"about_ca_system_score_codex":0.00020479549,"about_ca_system_score_gemma":0.0003105584,"threshold_uncertainty_score":0.008966923},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.367721,0.001999469,0.454437,0.0011469552,0.0004831349,0.00014454969,0.00031586256,0.00050784776,0.17324418],"genre_scores_gemma":[0.93117094,0.0007518249,0.038717266,0.0002774051,0.00028960346,0.000115491974,0.00020464679,0.00013022638,0.028342571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953926,0.000118639575,0.000013238426,0.00006954536,0.00015950332,0.00009984824],"domain_scores_gemma":[0.99950504,0.00012399738,0.00005908726,0.00007581848,0.00013723416,0.00009882541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054921134,0.0007505696,0.00052361295,0.0017271487,0.00098733,0.0018825219,0.00064837537,0.0007154843,0.0061642313],"category_scores_gemma":[0.0016985937,0.00019882698,0.0005293425,0.0009935697,0.0016417073,0.0025120657,0.0007663443,0.0012427665,0.0016772065],"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.000011469159,0.000010786986,0.000104249724,0.000013349577,0.0000023589935,0.000024915831,0.00004693238,0.00079038326,0.0010354741,0.9922482,0.0005429094,0.005168971],"study_design_scores_gemma":[0.0000120897785,0.000042646458,0.0002827276,0.000019032339,0.000006400377,0.00023688853,0.00010341148,0.028282104,0.002560322,0.9590168,0.009416901,0.00002074098],"about_ca_topic_score_codex":0.00046119926,"about_ca_topic_score_gemma":0.0003855092,"teacher_disagreement_score":0.0061642313,"about_ca_system_score_codex":0.000777096,"about_ca_system_score_gemma":0.00057619065,"threshold_uncertainty_score":0.02062136},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5644527,0.001399915,0.24363887,0.001995248,0.00072354253,0.00015130966,0.0013816528,0.00075698463,0.18549974],"genre_scores_gemma":[0.92266977,0.00040441155,0.03241606,0.00033564787,0.00022754354,0.00010402792,0.00072055974,0.00013734933,0.042984642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989936,0.00013483549,0.000089042485,0.0003056975,0.0003385401,0.00013827255],"domain_scores_gemma":[0.99762964,0.0010351168,0.00026439579,0.00034711874,0.00051433133,0.00020931191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009418637,0.0004490626,0.000557466,0.0009089156,0.0014923996,0.003233766,0.0008341137,0.00067442446,0.020421427],"category_scores_gemma":[0.0034136921,0.0004919359,0.000796591,0.00078749104,0.0020016665,0.0046776338,0.0015177845,0.0011541415,0.0017059498],"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.00008001026,0.00002512619,0.0015876961,0.00011630925,0.000020560663,0.00014267766,0.00012343435,0.0011806568,0.0024354998,0.9752495,0.0020932562,0.016945263],"study_design_scores_gemma":[0.00003472901,0.00013859766,0.0013993611,0.000052253487,0.000043713168,0.00050169375,0.00017338329,0.011399006,0.0073566777,0.9579886,0.020867204,0.000044799755],"about_ca_topic_score_codex":0.0004207246,"about_ca_topic_score_gemma":0.0008690217,"teacher_disagreement_score":0.020421427,"about_ca_system_score_codex":0.0010785778,"about_ca_system_score_gemma":0.00073564437,"threshold_uncertainty_score":0.06831646},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64990103,0.0004297785,0.32659343,0.0034143666,0.00010450632,0.00035654363,0.003807309,0.0024264834,0.012966614],"genre_scores_gemma":[0.90542835,0.00033858474,0.08335728,0.0003949987,0.00009425276,0.00022106784,0.0043714847,0.0006013816,0.005192705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964948,0.0009777748,0.000182359,0.0009700709,0.0007093161,0.0006657031],"domain_scores_gemma":[0.9663017,0.0261643,0.0013642972,0.0040719747,0.0009216737,0.001176037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024804224,0.0008149073,0.0019872503,0.000722543,0.0016707225,0.0045871134,0.0043803942,0.002798407,0.014328979],"category_scores_gemma":[0.023610758,0.0007923688,0.0018986661,0.0021935636,0.0025318952,0.009341127,0.0032623068,0.0023207301,0.0010356791],"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.0014371631,0.0003746623,0.005691286,0.0008138381,0.00017452102,0.0006045852,0.0008313991,0.6747709,0.009950426,0.21355914,0.018174771,0.07361731],"study_design_scores_gemma":[0.00012865999,0.00007484723,0.0007533994,0.000022090264,0.00006651548,0.00020936804,0.00019086241,0.66080874,0.0038775112,0.33206922,0.001767361,0.00003143497],"about_ca_topic_score_codex":0.006259874,"about_ca_topic_score_gemma":0.004792837,"teacher_disagreement_score":0.014328979,"about_ca_system_score_codex":0.003413475,"about_ca_system_score_gemma":0.0027663973,"threshold_uncertainty_score":0.047935247},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6256329,0.00085182505,0.28079203,0.0005520237,0.00022999386,0.00010954028,0.00022351417,0.00023762461,0.091370545],"genre_scores_gemma":[0.91482514,0.00077264477,0.044830237,0.00016566951,0.00029029523,0.00006641366,0.0002931952,0.000083213825,0.038673185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969995,0.00005341977,0.000016222357,0.00005535137,0.00010177696,0.00007333474],"domain_scores_gemma":[0.99964464,0.00007279111,0.00007897151,0.000050412946,0.00007642074,0.00007672254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047850885,0.00046744812,0.00021370001,0.0010222279,0.0007894408,0.0012291875,0.00045359606,0.0002798244,0.0060926746],"category_scores_gemma":[0.0006218223,0.0002735062,0.00067770755,0.0005169918,0.001866545,0.0026218947,0.00096128887,0.00080418395,0.0010324066],"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.000018637891,0.000020360556,0.0005668548,0.000034351444,0.0000047889666,0.00008665619,0.0002681514,0.0010673373,0.004870668,0.98347014,0.0003390628,0.009252945],"study_design_scores_gemma":[0.000015561785,0.00011321034,0.0021249596,0.000023279097,0.000012763241,0.00053297717,0.0002239033,0.009402211,0.017946687,0.9509968,0.018566092,0.00004154866],"about_ca_topic_score_codex":0.00065858476,"about_ca_topic_score_gemma":0.0007212081,"teacher_disagreement_score":0.0060926746,"about_ca_system_score_codex":0.0006201803,"about_ca_system_score_gemma":0.00062138186,"threshold_uncertainty_score":0.020381987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.304741,0.0034759166,0.6137936,0.0024198939,0.0010935256,0.00018008456,0.00076287845,0.00077134045,0.072761856],"genre_scores_gemma":[0.80791754,0.002466601,0.14870282,0.00071919087,0.0009155169,0.00054417195,0.0007009083,0.00069997576,0.03733319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989692,0.0001431533,0.00009241614,0.0002568381,0.00037445498,0.00016403921],"domain_scores_gemma":[0.99703693,0.0015114658,0.0004613066,0.0002048131,0.00058409036,0.00020148726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013243133,0.0008286526,0.00087813695,0.0037873893,0.0011093714,0.002218044,0.0021174517,0.0013991952,0.008760299],"category_scores_gemma":[0.009207547,0.00051430764,0.0010780899,0.00163383,0.002505225,0.0044145794,0.0016508554,0.0024730393,0.002008636],"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.00008126259,0.000034471672,0.0036850213,0.00033798016,0.0000339452,0.00045382915,0.0006754278,0.007586192,0.010231056,0.92764455,0.0050631366,0.044173077],"study_design_scores_gemma":[0.000027305372,0.00008757565,0.00296011,0.00015343058,0.00006623443,0.0011069212,0.00025321313,0.08354502,0.008030836,0.8889373,0.014689022,0.00014299802],"about_ca_topic_score_codex":0.0017696334,"about_ca_topic_score_gemma":0.0018699175,"teacher_disagreement_score":0.008760299,"about_ca_system_score_codex":0.0014752665,"about_ca_system_score_gemma":0.0004933333,"threshold_uncertainty_score":0.029306114},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06984809,0.00033134726,0.9109984,0.0013528311,0.000115874405,0.000095453586,0.00064049126,0.0003196973,0.016297817],"genre_scores_gemma":[0.7026056,0.00080061506,0.26822823,0.0010006595,0.00054540037,0.00055820186,0.0011274874,0.00046501606,0.024668772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976947,0.00055736635,0.00015326697,0.0005901588,0.00068758667,0.00031693303],"domain_scores_gemma":[0.9905749,0.0061347517,0.00066463964,0.0010929516,0.0011251525,0.00040774423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038221732,0.00064248894,0.0010573309,0.0018048219,0.0012365456,0.0030309386,0.0023497392,0.0016320685,0.01572763],"category_scores_gemma":[0.017386397,0.00071409135,0.0016576011,0.0016708506,0.00296788,0.009003561,0.0024913172,0.0032825181,0.0016850943],"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.000040954135,0.000019027177,0.0005812854,0.000038740593,0.000011406366,0.00008452004,0.000126307,0.0045225616,0.000578336,0.98647404,0.0013340883,0.0061886897],"study_design_scores_gemma":[0.00002085032,0.000057763882,0.00047710404,0.000034888188,0.000020778582,0.00024469322,0.00005522143,0.10905381,0.0010120498,0.8856821,0.0033053518,0.000035262798],"about_ca_topic_score_codex":0.0013153809,"about_ca_topic_score_gemma":0.0013181888,"teacher_disagreement_score":0.01572763,"about_ca_system_score_codex":0.0020363368,"about_ca_system_score_gemma":0.0012604971,"threshold_uncertainty_score":0.052614212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76864076,0.00063430757,0.10843708,0.0008034995,0.00035736486,0.00007523876,0.00031405353,0.00020984397,0.12052786],"genre_scores_gemma":[0.96698195,0.0002794798,0.009569756,0.00016222463,0.0001428782,0.000032868786,0.00015970545,0.00003214896,0.022639109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997383,0.000031458876,0.00001363285,0.000056164463,0.000092642484,0.00006785054],"domain_scores_gemma":[0.99957937,0.000058649246,0.0000733981,0.0000561984,0.000091469716,0.00014085119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003375307,0.00031348132,0.0003258739,0.0016315535,0.0010711888,0.0019145949,0.00064659264,0.00045906473,0.009473212],"category_scores_gemma":[0.0005048684,0.00016695751,0.0004352692,0.00070464704,0.0014546245,0.0015234555,0.0014232168,0.00072823465,0.0008717552],"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.0000335699,0.000019253357,0.0010439641,0.000033846423,0.000005902946,0.0002615076,0.00039226314,0.0009794974,0.0027481716,0.986906,0.0007577759,0.0068180976],"study_design_scores_gemma":[0.000016716253,0.000063486754,0.0015681543,0.000028292883,0.000011435732,0.0005205255,0.0006808033,0.013289372,0.0038769257,0.9691956,0.010715873,0.0000329211],"about_ca_topic_score_codex":0.0014057484,"about_ca_topic_score_gemma":0.0009959153,"teacher_disagreement_score":0.009473212,"about_ca_system_score_codex":0.0009844144,"about_ca_system_score_gemma":0.0004538136,"threshold_uncertainty_score":0.031691015},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6288929,0.0008442279,0.34264827,0.0010579824,0.00005732204,0.000043671233,0.00011223035,0.00041126495,0.025932074],"genre_scores_gemma":[0.9861086,0.00022281948,0.011154886,0.00008747199,0.000035749785,0.00004598447,0.00006951001,0.000053579537,0.0022213503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931216,0.00023091248,0.000031002204,0.00016142534,0.00016291467,0.00010151592],"domain_scores_gemma":[0.9957736,0.0025268213,0.0005731767,0.00050473475,0.00026147463,0.00036014017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008756216,0.00038401617,0.0004979332,0.0010988504,0.0010719452,0.0014919164,0.0011101479,0.0010186057,0.0022391768],"category_scores_gemma":[0.007377001,0.00035961458,0.0007154523,0.00061888417,0.0028326793,0.003840263,0.0016070235,0.0011825056,0.00028509495],"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.000023987535,0.000024746148,0.0011107624,0.00004196287,0.00001284068,0.00022179693,0.0002809675,0.028439462,0.0029958924,0.9614866,0.00032545516,0.0050356044],"study_design_scores_gemma":[0.0000051556335,0.0000149025645,0.0002360946,0.000009174858,0.0000050250255,0.00017055312,0.0000587362,0.06994263,0.0011055174,0.92739636,0.001047558,0.000008236181],"about_ca_topic_score_codex":0.00067817786,"about_ca_topic_score_gemma":0.00040763742,"teacher_disagreement_score":0.0022391768,"about_ca_system_score_codex":0.0011646143,"about_ca_system_score_gemma":0.00040040317,"threshold_uncertainty_score":0.008449912},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44689482,0.0005435069,0.42635784,0.0012616622,0.000618495,0.00017046432,0.00021363914,0.0005294563,0.12341024],"genre_scores_gemma":[0.866002,0.0003585109,0.0929207,0.00024361064,0.00015776174,0.00010595561,0.00013439404,0.00012562337,0.039951403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996779,0.000057282956,0.000015346557,0.00006474008,0.0001086884,0.000076035656],"domain_scores_gemma":[0.99979347,0.00003884993,0.00003083396,0.00005527236,0.00003681494,0.00004466988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044308178,0.00034802896,0.00025898535,0.00080792885,0.0012229938,0.0011030949,0.00089237327,0.00050162594,0.006111826],"category_scores_gemma":[0.0006006225,0.00030061606,0.00059827603,0.00051472004,0.0021625916,0.0024919228,0.0014371995,0.0016011167,0.0009984985],"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.0000119185825,0.00001923117,0.00008650821,0.000020882087,0.0000021959574,0.00005515882,0.0003599387,0.00039326283,0.003948378,0.9903936,0.0004272683,0.0042816405],"study_design_scores_gemma":[0.000026413958,0.00008725718,0.0004030858,0.00001534015,0.000012100852,0.0002120674,0.00021140509,0.0060105654,0.012797659,0.9606424,0.019540932,0.00004077449],"about_ca_topic_score_codex":0.000782552,"about_ca_topic_score_gemma":0.0011183092,"teacher_disagreement_score":0.006111826,"about_ca_system_score_codex":0.00081165164,"about_ca_system_score_gemma":0.00073064334,"threshold_uncertainty_score":0.020446122},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065450487,0.0002194489,0.9884172,0.000058448397,0.00009243616,0.000038839604,0.00003878138,0.00068304525,0.0039067436],"genre_scores_gemma":[0.09459444,0.00045624076,0.8912021,0.00016176241,0.00022813222,0.00021533023,0.00026806278,0.0014460414,0.011427893],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985165,0.0002817913,0.00009884421,0.00020276428,0.0007453291,0.00015477288],"domain_scores_gemma":[0.9966455,0.0016539433,0.00017227976,0.0004682491,0.00091702165,0.00014298862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023594361,0.001458175,0.0013455048,0.0031767148,0.0010243903,0.0018951982,0.0025231624,0.0008076883,0.009677499],"category_scores_gemma":[0.009740702,0.0004777623,0.0015497435,0.00281679,0.001663819,0.003414695,0.001932751,0.0023271656,0.0035787362],"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.00035691285,0.00014215776,0.0013152153,0.00066120375,0.00013829733,0.00037111153,0.0004941964,0.051251065,0.023423798,0.38745624,0.00933166,0.5250582],"study_design_scores_gemma":[0.00010361275,0.00018253112,0.0005385583,0.0001373615,0.00008014747,0.00046566795,0.00008221871,0.58366567,0.026119394,0.36195788,0.026547654,0.00011924185],"about_ca_topic_score_codex":0.0020598627,"about_ca_topic_score_gemma":0.0033432485,"teacher_disagreement_score":0.009677499,"about_ca_system_score_codex":0.0013579774,"about_ca_system_score_gemma":0.0015458305,"threshold_uncertainty_score":0.03237444},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9413063,0.00014274113,0.031951007,0.00043303776,0.000040386425,0.000018674522,0.00011629633,0.00007841929,0.025913183],"genre_scores_gemma":[0.9922748,0.00006186456,0.002520349,0.00004416136,0.000029964998,0.000009899338,0.00004151449,0.000014886965,0.005002571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972636,0.000067087785,0.000008143027,0.000042752108,0.000073040246,0.000082589846],"domain_scores_gemma":[0.99913675,0.00034888377,0.00015850914,0.00012976273,0.00011388026,0.000112253474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052133057,0.00025186042,0.00022261344,0.0010622441,0.00068836,0.0009584858,0.00046187788,0.00033430028,0.007026422],"category_scores_gemma":[0.001966991,0.00015765154,0.0003215276,0.0007288435,0.0025273473,0.0018290579,0.00055806147,0.00051747664,0.00041556687],"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.00004562213,0.00002943087,0.0023483778,0.000021639544,0.0000054137513,0.000064017295,0.00014908872,0.0044111754,0.0034204267,0.984543,0.00044475347,0.004517035],"study_design_scores_gemma":[0.000026076661,0.000057775196,0.004466193,0.0000105687295,0.0000070218994,0.00014464994,0.00018664118,0.029564967,0.005900696,0.9580969,0.0015006176,0.00003793256],"about_ca_topic_score_codex":0.0014131052,"about_ca_topic_score_gemma":0.0016432827,"teacher_disagreement_score":0.007026422,"about_ca_system_score_codex":0.00085140084,"about_ca_system_score_gemma":0.00069250964,"threshold_uncertainty_score":0.023505747},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52671367,0.0043023475,0.37181294,0.0059963656,0.00026176253,0.00013811738,0.0008689652,0.0008299603,0.08907599],"genre_scores_gemma":[0.93475914,0.0011144659,0.053549755,0.000652735,0.0003980158,0.0002614967,0.00059427635,0.00018048735,0.008489676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988411,0.00036029003,0.00003839961,0.00026792462,0.00025843602,0.00023397389],"domain_scores_gemma":[0.99286807,0.0048419167,0.00063806085,0.0005748912,0.00042567987,0.00065130915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001212138,0.00097616523,0.0009405114,0.0022156844,0.0020686807,0.002654964,0.0032102603,0.0019023321,0.0065813926],"category_scores_gemma":[0.008786972,0.0008303563,0.0007533456,0.0017362376,0.003474582,0.006117015,0.0028055615,0.0038340348,0.0006405495],"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.00027706858,0.000113635004,0.0026625055,0.00022938751,0.000047651625,0.00015476497,0.00043266977,0.052933846,0.0037697873,0.9108166,0.009345997,0.019216118],"study_design_scores_gemma":[0.00004040179,0.00007159226,0.0018157274,0.00005249774,0.000041946594,0.00030628615,0.00017286025,0.26341602,0.0038651035,0.72337055,0.0067926827,0.00005439398],"about_ca_topic_score_codex":0.0020845593,"about_ca_topic_score_gemma":0.0022482066,"teacher_disagreement_score":0.0065813926,"about_ca_system_score_codex":0.0025365609,"about_ca_system_score_gemma":0.0006203502,"threshold_uncertainty_score":0.022016943},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5068828,0.00072975445,0.44363475,0.0014474944,0.000110099085,0.00019205706,0.0012674981,0.0004835454,0.04525198],"genre_scores_gemma":[0.896572,0.00097554026,0.08757089,0.00016596486,0.00013070546,0.00015193218,0.0011592199,0.00011863575,0.013155058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995566,0.000079655954,0.00002551988,0.00013057228,0.00011338919,0.000094272174],"domain_scores_gemma":[0.9989053,0.00045519063,0.0002521023,0.00017715094,0.00009524586,0.00011505444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003787352,0.0005566887,0.0006084867,0.00050163094,0.001096437,0.0012797347,0.0008628857,0.00076998165,0.0046262564],"category_scores_gemma":[0.0021326675,0.00048771276,0.0006146512,0.0013228107,0.0012178528,0.0036335536,0.0011124345,0.0010714,0.0003410158],"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.00037944753,0.00015138299,0.0020646965,0.00025956004,0.000043085143,0.0003822653,0.0003093197,0.3661129,0.005300888,0.5591976,0.010307453,0.055491406],"study_design_scores_gemma":[0.000063141524,0.00013248083,0.0009056176,0.000032101358,0.000019812544,0.00039812434,0.00026492955,0.3782914,0.0034641526,0.60480005,0.011607925,0.00002020489],"about_ca_topic_score_codex":0.0030393866,"about_ca_topic_score_gemma":0.0025591978,"teacher_disagreement_score":0.0046262564,"about_ca_system_score_codex":0.00096764223,"about_ca_system_score_gemma":0.00070184795,"threshold_uncertainty_score":0.015476346},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8937875,0.0003609535,0.096934296,0.0006894939,0.000035794495,0.00007471363,0.0005399877,0.00056547683,0.0070117847],"genre_scores_gemma":[0.98474634,0.000223716,0.012422753,0.00005307972,0.00006342713,0.00013159012,0.0004989401,0.00014741709,0.001712776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886465,0.00022555959,0.00009413812,0.0004060421,0.00025525756,0.00015423294],"domain_scores_gemma":[0.96715474,0.02348408,0.0035076023,0.002883663,0.001368547,0.0016014391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016381954,0.00050128606,0.0007883463,0.0016448268,0.0007610502,0.0019329287,0.0015679231,0.001087534,0.0054629184],"category_scores_gemma":[0.024383293,0.0005973117,0.00053754123,0.0009573755,0.0027407464,0.0045768917,0.0015183135,0.0012469769,0.0006277942],"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.0034911875,0.00036394832,0.06021606,0.0014345209,0.00021338035,0.003157427,0.0024399252,0.08593217,0.11802653,0.62039995,0.007840638,0.09648431],"study_design_scores_gemma":[0.00018838073,0.00049918477,0.024313327,0.00012505101,0.00014501483,0.004332662,0.000758492,0.37706846,0.052349865,0.5362455,0.0038171627,0.00015686886],"about_ca_topic_score_codex":0.00048730962,"about_ca_topic_score_gemma":0.00036852813,"teacher_disagreement_score":0.0054629184,"about_ca_system_score_codex":0.0008411719,"about_ca_system_score_gemma":0.00040533626,"threshold_uncertainty_score":0.01827526},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4867915,0.0005274442,0.41547856,0.00058249605,0.000324457,0.00013263468,0.00022090205,0.0002925249,0.095649585],"genre_scores_gemma":[0.8929459,0.00041303766,0.07950326,0.00033378036,0.00016347699,0.000106387866,0.00012805528,0.00013077112,0.026275305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996346,0.000048035952,0.000015003106,0.000105477164,0.000100240664,0.00009665661],"domain_scores_gemma":[0.99961346,0.000083371284,0.00006116594,0.000052084175,0.00008787952,0.00010211824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005181434,0.0005260963,0.0002823214,0.0011690179,0.0011601036,0.0014401397,0.00061913667,0.00044152938,0.005806417],"category_scores_gemma":[0.0008708606,0.00021973622,0.00089852046,0.0005520536,0.0022273818,0.0023167843,0.001027662,0.0012249243,0.0006857106],"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.000019199373,0.000011801732,0.0002649477,0.000027631546,0.0000033822525,0.00011037356,0.0002597421,0.00090322306,0.00563875,0.98851097,0.00031454227,0.003935502],"study_design_scores_gemma":[0.000023916422,0.000089236666,0.0011741663,0.000028928553,0.000014367238,0.0005940276,0.00030018305,0.027290659,0.011703993,0.94322145,0.0154986335,0.00006043931],"about_ca_topic_score_codex":0.0028992032,"about_ca_topic_score_gemma":0.002546214,"teacher_disagreement_score":0.005806417,"about_ca_system_score_codex":0.0010941133,"about_ca_system_score_gemma":0.0008059903,"threshold_uncertainty_score":0.019424379},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25861147,0.0010220729,0.6290477,0.0008055442,0.0007650961,0.00017201607,0.000445288,0.0004955809,0.10863521],"genre_scores_gemma":[0.8234786,0.0010774387,0.12957987,0.00059216475,0.00065218745,0.00015780093,0.00049189053,0.00031264435,0.04365735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923635,0.00013963864,0.00003735176,0.000108407316,0.00030994698,0.00016827998],"domain_scores_gemma":[0.99915814,0.00012999539,0.000100734695,0.0001412829,0.00032557058,0.0001443061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010112933,0.0006029719,0.000518598,0.0014180026,0.0010366016,0.0018062287,0.0007613425,0.00043595314,0.008624887],"category_scores_gemma":[0.0013839101,0.0002726226,0.00067964173,0.0006217248,0.0017443607,0.0027129953,0.0010441447,0.0012614256,0.0018865104],"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.000017523545,0.00001372331,0.00015931917,0.000026054986,0.0000032222451,0.00006338651,0.00009297854,0.0006352597,0.00408665,0.9838923,0.0006804172,0.010329132],"study_design_scores_gemma":[0.000015023909,0.00008693758,0.0005113581,0.000027079504,0.0000091052425,0.00044196003,0.00017456428,0.019350294,0.010471989,0.94070923,0.02816524,0.00003728922],"about_ca_topic_score_codex":0.0006167067,"about_ca_topic_score_gemma":0.0007609222,"teacher_disagreement_score":0.008624887,"about_ca_system_score_codex":0.00081201683,"about_ca_system_score_gemma":0.00076871034,"threshold_uncertainty_score":0.028853118},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5013856,0.0008702851,0.4423104,0.00062114664,0.00025675577,0.00011637812,0.00060200214,0.00058052654,0.053256795],"genre_scores_gemma":[0.90449035,0.00044671248,0.084553786,0.00014844924,0.00007716288,0.000075689546,0.0003786051,0.00024438195,0.009584924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995308,0.00007322227,0.000024918514,0.00014342404,0.00012618573,0.000101496116],"domain_scores_gemma":[0.99946994,0.000114320705,0.000084629966,0.00010624821,0.000112305795,0.00011257806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004731897,0.00048387673,0.0004964638,0.0009165137,0.00083970674,0.0011630716,0.00060097384,0.0003300844,0.0035567384],"category_scores_gemma":[0.0018294592,0.00024666122,0.0005877113,0.0009315663,0.0030479378,0.0019709535,0.0018072347,0.0008162534,0.00064029987],"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.00018326519,0.000023320139,0.0024408412,0.000107734195,0.000013802949,0.0003964488,0.00061601936,0.0115653435,0.015453376,0.87993693,0.004637649,0.08462535],"study_design_scores_gemma":[0.000014036835,0.00006680066,0.0016184242,0.000025329535,0.000010993529,0.00034887902,0.00025442077,0.03613358,0.006801579,0.94471616,0.009941483,0.000068380294],"about_ca_topic_score_codex":0.0012216141,"about_ca_topic_score_gemma":0.0013156985,"teacher_disagreement_score":0.0035567384,"about_ca_system_score_codex":0.00061563967,"about_ca_system_score_gemma":0.00049554725,"threshold_uncertainty_score":0.011898458},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.928971,0.00034332954,0.06397367,0.0003981384,0.000026158506,0.000033890352,0.00089636643,0.0002149319,0.0051425966],"genre_scores_gemma":[0.98755556,0.00025255824,0.010157491,0.0000688694,0.000040075123,0.00003823149,0.0007410848,0.000038253882,0.0011079198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832946,0.000305517,0.00007637109,0.000384569,0.0004959059,0.00040812418],"domain_scores_gemma":[0.9841232,0.009949015,0.0025879485,0.0019681063,0.00080945843,0.00056218344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014546716,0.00045564154,0.00071908196,0.0020477576,0.0016331924,0.0011824133,0.0011231877,0.00056006154,0.0030248542],"category_scores_gemma":[0.015177241,0.00027563708,0.0004769719,0.0022512388,0.0015633308,0.0026617784,0.0012532173,0.0010483235,0.00042545953],"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.0015423101,0.00027791437,0.054331,0.00049639057,0.00019464812,0.00070757547,0.0012976571,0.099349186,0.02761901,0.65882885,0.0056391614,0.14971629],"study_design_scores_gemma":[0.0001249808,0.00080620975,0.024508748,0.000112901595,0.0001328764,0.0022910328,0.00044791464,0.31543404,0.031716827,0.6095379,0.01471108,0.00017549942],"about_ca_topic_score_codex":0.001719378,"about_ca_topic_score_gemma":0.0014588201,"teacher_disagreement_score":0.0030248542,"about_ca_system_score_codex":0.0015326564,"about_ca_system_score_gemma":0.00094391464,"threshold_uncertainty_score":0.01112026},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83607465,0.0003604277,0.0778484,0.00024973595,0.00010869995,0.00005547479,0.00026159978,0.00022790671,0.08481308],"genre_scores_gemma":[0.9496642,0.00015693622,0.026371645,0.000048535276,0.000022699094,0.00006674301,0.00040955958,0.00008555804,0.023174074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975675,0.000032136708,0.000013850856,0.000057713278,0.00007782845,0.000061794664],"domain_scores_gemma":[0.99980146,0.00003803905,0.000030799085,0.000027021613,0.000039331928,0.000063391126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014965664,0.00037608843,0.00029101636,0.00082504214,0.0011140036,0.0015596524,0.0003513329,0.00041606274,0.010182939],"category_scores_gemma":[0.00040256427,0.0002813192,0.0005177517,0.00032500082,0.00090822275,0.0011211064,0.0012222839,0.00064975675,0.00090958056],"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.00010051667,0.000031314255,0.0029755917,0.00007076968,0.000015722777,0.0008282932,0.0008454119,0.0046452056,0.019766439,0.95574766,0.0014284783,0.013544567],"study_design_scores_gemma":[0.000066923385,0.00026129239,0.0128870895,0.00012155553,0.000057660487,0.0027708185,0.003515629,0.08608858,0.041301545,0.71589655,0.1368706,0.00016176172],"about_ca_topic_score_codex":0.0013213501,"about_ca_topic_score_gemma":0.002463628,"teacher_disagreement_score":0.010182939,"about_ca_system_score_codex":0.00072504545,"about_ca_system_score_gemma":0.00027049799,"threshold_uncertainty_score":0.034065366},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081514135,0.00044980913,0.8876227,0.0003773083,0.00018946044,0.000141013,0.00023334612,0.0006309475,0.028841289],"genre_scores_gemma":[0.60502666,0.00064242946,0.3775363,0.00033981082,0.00024314848,0.00027656578,0.00038742472,0.00037053463,0.015177119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991429,0.00016423367,0.00009259366,0.0001870911,0.00028604837,0.00012711453],"domain_scores_gemma":[0.99882656,0.00052331167,0.00009359538,0.00015256829,0.00033924537,0.000064673535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016813572,0.00044900307,0.00051059533,0.0009186806,0.0010444446,0.002111186,0.0009885366,0.000853331,0.004451075],"category_scores_gemma":[0.003191879,0.0004923095,0.0012662713,0.0005573202,0.0022174108,0.0038092248,0.0020692744,0.0022811932,0.0013690144],"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.000026744263,0.000023623348,0.0003397894,0.00010649965,0.000008920797,0.0001799587,0.0005228945,0.00046198312,0.00534455,0.9781472,0.00056327326,0.014274583],"study_design_scores_gemma":[0.00006894207,0.00019548653,0.0010005559,0.00013458174,0.00008114425,0.000698469,0.0003589425,0.019238694,0.0376946,0.8948115,0.045613058,0.00010403996],"about_ca_topic_score_codex":0.00095264864,"about_ca_topic_score_gemma":0.0012713325,"teacher_disagreement_score":0.004451075,"about_ca_system_score_codex":0.001047935,"about_ca_system_score_gemma":0.0008446468,"threshold_uncertainty_score":0.014890313},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6610137,0.0012294371,0.12812817,0.01748774,0.0014223823,0.000062217405,0.00066854234,0.0009328269,0.18905494],"genre_scores_gemma":[0.9737352,0.00040887034,0.009877706,0.0009839516,0.00056273746,0.000062154155,0.00022675714,0.00013430406,0.014008278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992111,0.000114006434,0.000041721047,0.00021994351,0.00030761928,0.00010554253],"domain_scores_gemma":[0.99611485,0.0025002505,0.00028732335,0.0004349321,0.00043049455,0.00023213054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005864168,0.0002679057,0.00037302705,0.00068998366,0.00090029486,0.0022947765,0.00060329004,0.00092671416,0.010546976],"category_scores_gemma":[0.006250517,0.00023073894,0.00054701767,0.0006232039,0.0024812673,0.005836363,0.0012607115,0.0017211124,0.0011699699],"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.00011519134,0.0000125505485,0.00078035815,0.000080189144,0.000007212062,0.00017626402,0.000304588,0.0015275677,0.0036143167,0.97985005,0.0046524517,0.00887933],"study_design_scores_gemma":[0.000019152909,0.00003530461,0.0014089848,0.000018982992,0.000010254159,0.00032276983,0.00012837537,0.0054568695,0.0056416877,0.97412634,0.012803353,0.000027898988],"about_ca_topic_score_codex":0.00048032036,"about_ca_topic_score_gemma":0.00038743255,"teacher_disagreement_score":0.010546976,"about_ca_system_score_codex":0.0011578988,"about_ca_system_score_gemma":0.0004618805,"threshold_uncertainty_score":0.03528315},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89138,0.00060597644,0.07689434,0.0048342035,0.00011181815,0.00027948077,0.0024089313,0.0010506322,0.022434605],"genre_scores_gemma":[0.9728961,0.00040028544,0.016195543,0.0003644637,0.0001628466,0.00017342968,0.0024608443,0.00018825523,0.0071583013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972312,0.0007382291,0.00018969581,0.00084987184,0.00039631358,0.0005946257],"domain_scores_gemma":[0.98372144,0.011542456,0.001189753,0.0015107897,0.0005856507,0.0014498644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016955289,0.00079148216,0.0014237582,0.00064056145,0.0017059507,0.0075493553,0.003203371,0.0020621587,0.018068142],"category_scores_gemma":[0.016194597,0.0008073501,0.0019318424,0.0013943891,0.0025397807,0.011318854,0.0038962916,0.0034783594,0.001193634],"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.0029545021,0.0012303178,0.02428465,0.0018618968,0.00044656981,0.0012573805,0.0050169104,0.19376822,0.012479192,0.64213216,0.02467388,0.08989441],"study_design_scores_gemma":[0.0003964182,0.00016430476,0.0026682154,0.000057954163,0.0001540581,0.00051587186,0.0011642099,0.16663466,0.004205128,0.81931555,0.004661401,0.000062292194],"about_ca_topic_score_codex":0.0035059634,"about_ca_topic_score_gemma":0.002907668,"teacher_disagreement_score":0.018068142,"about_ca_system_score_codex":0.0029204895,"about_ca_system_score_gemma":0.0017956815,"threshold_uncertainty_score":0.060443938},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57373106,0.00625182,0.3433131,0.004609535,0.00051627564,0.00017247052,0.0010714326,0.0009024532,0.069431745],"genre_scores_gemma":[0.94372654,0.002241335,0.045246407,0.0004040265,0.0002883185,0.0001557649,0.0005204548,0.0001965149,0.0072206017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858606,0.0003594513,0.00006159423,0.00033654258,0.00034615633,0.00031024963],"domain_scores_gemma":[0.99059945,0.0065366123,0.0008432976,0.0008123885,0.00050927384,0.0006989849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012128991,0.00063086604,0.0010169022,0.0018757517,0.0015207909,0.0026374639,0.001566011,0.0009215579,0.003624798],"category_scores_gemma":[0.011109219,0.0005692073,0.0005175814,0.0019429002,0.0020495465,0.004845065,0.0022362405,0.001673346,0.00059156003],"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.0011848734,0.00011669936,0.00732662,0.00046612683,0.000082470666,0.00035451137,0.0007887081,0.08561802,0.0098007545,0.7846439,0.0116187325,0.09799862],"study_design_scores_gemma":[0.00011910953,0.00016604041,0.0025232208,0.000106154235,0.00005972651,0.00071454886,0.00029357235,0.23353615,0.007993205,0.7382588,0.016178485,0.00005095284],"about_ca_topic_score_codex":0.00162705,"about_ca_topic_score_gemma":0.0010884409,"teacher_disagreement_score":0.003624798,"about_ca_system_score_codex":0.0018654934,"about_ca_system_score_gemma":0.00060210074,"threshold_uncertainty_score":0.013535142},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.200437,0.0014762012,0.60374284,0.0017924244,0.0008725105,0.00009626955,0.00018251874,0.0004520955,0.19094811],"genre_scores_gemma":[0.81743884,0.0016980639,0.121322125,0.0012296283,0.00065226457,0.00012046239,0.00011808411,0.00030888937,0.057111666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941885,0.00008822901,0.000032510554,0.00012309683,0.00026565444,0.00007167408],"domain_scores_gemma":[0.9993431,0.00015006922,0.00006216848,0.00019654175,0.00020458773,0.0000435619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070896436,0.00030872898,0.00037089913,0.00049929396,0.00066884066,0.0007534246,0.00073766365,0.00030791006,0.0064369095],"category_scores_gemma":[0.0017409091,0.00015874441,0.0006272873,0.00037293855,0.0015522992,0.0026201347,0.0013164793,0.0012078702,0.0012176028],"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.000013741823,0.000007945802,0.00019106388,0.000037619982,0.000004110337,0.00014172404,0.00019178243,0.0007270211,0.003896438,0.9825585,0.0008214363,0.011408556],"study_design_scores_gemma":[0.0000131004945,0.000070525944,0.00070168194,0.00001801667,0.0000139665935,0.0007566188,0.00014208654,0.0101934625,0.014572963,0.9422092,0.031276572,0.000031925978],"about_ca_topic_score_codex":0.0006392505,"about_ca_topic_score_gemma":0.00080034364,"teacher_disagreement_score":0.0064369095,"about_ca_system_score_codex":0.00037500937,"about_ca_system_score_gemma":0.00053136837,"threshold_uncertainty_score":0.021533608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8314009,0.0012184002,0.117181614,0.00082920806,0.00021003558,0.000039899565,0.00011608086,0.00020049114,0.04880344],"genre_scores_gemma":[0.97286487,0.00033173666,0.014834741,0.00016048104,0.00006127752,0.00003103025,0.000094556766,0.00006624561,0.01155517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998035,0.000029626257,0.000011056111,0.000036422676,0.00006635173,0.000052960077],"domain_scores_gemma":[0.99977857,0.0000611855,0.00004839456,0.000029981025,0.000047222853,0.00003465748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025840104,0.00022037531,0.00038652666,0.00076918665,0.00075598137,0.00095006893,0.00083712983,0.0006366337,0.004291679],"category_scores_gemma":[0.0009960245,0.00017241793,0.00044659688,0.00053682923,0.000939703,0.0014639873,0.00076926505,0.0008214066,0.00053796486],"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.000024651421,0.000024201887,0.00067495246,0.000055637982,0.0000072880443,0.00025930768,0.0003706515,0.008644914,0.0069310414,0.97531575,0.0008723105,0.006819282],"study_design_scores_gemma":[0.00002493931,0.000054667726,0.0010169068,0.000034726756,0.0000117037225,0.00065151555,0.00043222582,0.17307901,0.010046854,0.8077488,0.0068505225,0.000048072146],"about_ca_topic_score_codex":0.0019981044,"about_ca_topic_score_gemma":0.0020540708,"teacher_disagreement_score":0.004291679,"about_ca_system_score_codex":0.00074375037,"about_ca_system_score_gemma":0.0004788079,"threshold_uncertainty_score":0.01435709},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7539853,0.0012901429,0.2052795,0.0025429933,0.00018317271,0.00014018672,0.0014836516,0.00077561574,0.03431952],"genre_scores_gemma":[0.956026,0.0008971192,0.032078348,0.00042360183,0.0002510435,0.00022542638,0.000953988,0.00011179611,0.009032616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979292,0.00025525113,0.0001407147,0.00074805284,0.00044962106,0.00047701562],"domain_scores_gemma":[0.98804575,0.0069847372,0.0015389872,0.0011421652,0.0004566727,0.0018317892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001532172,0.0010300104,0.001222001,0.0025397614,0.0015006656,0.002630404,0.0022892132,0.0013415803,0.008321608],"category_scores_gemma":[0.008314614,0.0010397938,0.0015920147,0.0023773692,0.00450682,0.007270851,0.00386775,0.0039595463,0.0006796865],"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.0010450514,0.00036014876,0.010169295,0.000624349,0.00015790893,0.00085024897,0.0018650641,0.07251148,0.020761676,0.8393603,0.0070967935,0.04519777],"study_design_scores_gemma":[0.0000834966,0.00017434113,0.0073958375,0.000077006545,0.00007615623,0.00075369154,0.00037329743,0.06419666,0.0034968928,0.9167153,0.006559898,0.00009743615],"about_ca_topic_score_codex":0.0023463916,"about_ca_topic_score_gemma":0.0022654945,"teacher_disagreement_score":0.008321608,"about_ca_system_score_codex":0.0017668138,"about_ca_system_score_gemma":0.0008431126,"threshold_uncertainty_score":0.027838588},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9128744,0.0002463111,0.0682802,0.00018399196,0.00006551476,0.000029285711,0.00020338241,0.00023761921,0.01787928],"genre_scores_gemma":[0.982811,0.00014373698,0.011503111,0.00002331977,0.00004376992,0.000045156095,0.00024188639,0.000057416903,0.0051306416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951303,0.00006435529,0.000039407678,0.00010522041,0.00016369786,0.00011424694],"domain_scores_gemma":[0.9986985,0.00052009436,0.00016877039,0.00022543175,0.00018059272,0.00020655297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037597047,0.0001947355,0.00047995098,0.0011493465,0.001100165,0.0016266032,0.000564661,0.000722896,0.0054236394],"category_scores_gemma":[0.0022083416,0.00018143505,0.00055930804,0.00037845675,0.0013370545,0.0019700862,0.0010313444,0.00063815416,0.000500661],"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.00030881632,0.000056713547,0.005386138,0.00009114848,0.00001699585,0.00037565242,0.0005478253,0.0051452606,0.021950494,0.9350601,0.0009875998,0.030073266],"study_design_scores_gemma":[0.00005319466,0.0001921525,0.010302274,0.00007590315,0.000066315755,0.0014090263,0.0006598459,0.10592346,0.039396588,0.82815695,0.013677078,0.00008728304],"about_ca_topic_score_codex":0.0004934841,"about_ca_topic_score_gemma":0.0003234254,"teacher_disagreement_score":0.0054236394,"about_ca_system_score_codex":0.00068343594,"about_ca_system_score_gemma":0.00048352126,"threshold_uncertainty_score":0.018143892},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8384898,0.00054560724,0.09942028,0.00027368963,0.00011236797,0.000031499665,0.00027258493,0.00020636925,0.060647856],"genre_scores_gemma":[0.9697562,0.00027847334,0.009594434,0.000058253958,0.00004925905,0.000027527247,0.0003088027,0.000043055403,0.019884102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997677,0.00002606836,0.000016566455,0.000040450155,0.00007149658,0.00007773844],"domain_scores_gemma":[0.99965477,0.000050381735,0.000060295766,0.000029700885,0.00006552882,0.00013933587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025519516,0.0003565963,0.00024172942,0.0012440266,0.00082461926,0.0016791207,0.0002599204,0.00020871605,0.0059287166],"category_scores_gemma":[0.0005176022,0.00018021865,0.0003189742,0.0006281087,0.001080129,0.0022177198,0.0016921052,0.0006205651,0.0005051835],"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.000034682973,0.000015525571,0.0015997477,0.00003225575,0.000004686982,0.00011410426,0.0004282143,0.0011451432,0.003336624,0.98386085,0.0005970929,0.008831188],"study_design_scores_gemma":[0.000020278658,0.00015560507,0.008070764,0.000070437396,0.00003102896,0.0006000949,0.00094999664,0.023899997,0.014026464,0.91525954,0.03686266,0.000053219363],"about_ca_topic_score_codex":0.0018108737,"about_ca_topic_score_gemma":0.0026432902,"teacher_disagreement_score":0.0059287166,"about_ca_system_score_codex":0.0009742053,"about_ca_system_score_gemma":0.00047104192,"threshold_uncertainty_score":0.019833565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20664762,0.0011483517,0.7651975,0.0014848805,0.000269132,0.0004330188,0.0017248577,0.0029623497,0.020132279],"genre_scores_gemma":[0.5576407,0.0010977663,0.42129248,0.00048604028,0.00012389506,0.0003440168,0.0032401776,0.0006475271,0.0151274465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987006,0.00030677998,0.00009730363,0.00035694166,0.00020614902,0.00033215331],"domain_scores_gemma":[0.9979417,0.0010297359,0.00018363181,0.00046840895,0.00016270584,0.00021378082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080756244,0.00074824545,0.0011686438,0.0005489494,0.0013070294,0.0016444371,0.0017312568,0.0011215018,0.008097391],"category_scores_gemma":[0.0039610867,0.0005135782,0.0012093564,0.002019524,0.0012073594,0.005619746,0.002183353,0.0016219227,0.0015449204],"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.0012776515,0.000318125,0.0016986433,0.000833784,0.00011655197,0.00059023465,0.000536204,0.4427335,0.019381175,0.29099044,0.024487235,0.21703652],"study_design_scores_gemma":[0.00013425869,0.0001893251,0.00039250214,0.00005170342,0.000056821234,0.00031106826,0.00020968153,0.52183545,0.011254262,0.44197533,0.023552654,0.000036992726],"about_ca_topic_score_codex":0.0024763236,"about_ca_topic_score_gemma":0.0026471575,"teacher_disagreement_score":0.008097391,"about_ca_system_score_codex":0.0014265383,"about_ca_system_score_gemma":0.001499026,"threshold_uncertainty_score":0.027088463},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7261815,0.000689377,0.23330045,0.00063610094,0.00008852409,0.00010931819,0.00061189715,0.00067718566,0.03770557],"genre_scores_gemma":[0.9493601,0.00023995394,0.038696315,0.00010840561,0.00010910945,0.000103236176,0.00038514327,0.00016141287,0.010836367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995615,0.000052369593,0.000048118076,0.00012433266,0.00013183619,0.000081915336],"domain_scores_gemma":[0.9984047,0.00068443915,0.00028361476,0.00021270083,0.00023743614,0.00017710302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002468513,0.0003923149,0.0002775164,0.001260685,0.00079171406,0.0014797843,0.00055352965,0.00061219826,0.0042999065],"category_scores_gemma":[0.002104352,0.00032533967,0.000488916,0.00090063974,0.0024231696,0.0030398548,0.0013180188,0.0010892058,0.00063533476],"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.00009471086,0.00002363059,0.0018615841,0.00009043822,0.0000064407122,0.00055290264,0.0011632848,0.00371576,0.023953406,0.9473689,0.00065020856,0.020518662],"study_design_scores_gemma":[0.000020409505,0.000100114026,0.0019910992,0.00004192018,0.000023449362,0.001445918,0.00048776955,0.041357916,0.014928652,0.9207471,0.018800452,0.000055260276],"about_ca_topic_score_codex":0.0007448093,"about_ca_topic_score_gemma":0.00064046314,"teacher_disagreement_score":0.0042999065,"about_ca_system_score_codex":0.0010045398,"about_ca_system_score_gemma":0.00034202906,"threshold_uncertainty_score":0.014384627},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39949957,0.0021019024,0.33631578,0.0009997083,0.00151883,0.0002543364,0.00085867435,0.0008726025,0.25757858],"genre_scores_gemma":[0.8000551,0.0014586572,0.12280238,0.0007798904,0.00057156984,0.0005192488,0.0009328286,0.00048714198,0.07239329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883586,0.0002618761,0.00008573857,0.0003238404,0.0003129933,0.00017963616],"domain_scores_gemma":[0.99841845,0.00052194967,0.00019183116,0.00025366718,0.00036337672,0.0002506729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007217698,0.00040136662,0.00033367268,0.001414436,0.0016498665,0.002399334,0.0005763035,0.0007111968,0.006719965],"category_scores_gemma":[0.0021479332,0.000500021,0.0005631276,0.0010608692,0.0018545425,0.0028762275,0.0012399335,0.0012953336,0.0014940667],"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.000121254,0.00005963065,0.0014054627,0.0000982982,0.000014625194,0.00019056475,0.0010173224,0.0007189,0.011475906,0.9371295,0.0046266536,0.043141752],"study_design_scores_gemma":[0.00009486109,0.00018894837,0.008036635,0.00014188337,0.00004863725,0.0027011882,0.0012752404,0.008358627,0.012079021,0.7757401,0.19121695,0.000117926575],"about_ca_topic_score_codex":0.0012595681,"about_ca_topic_score_gemma":0.0016566095,"teacher_disagreement_score":0.006719965,"about_ca_system_score_codex":0.0009389682,"about_ca_system_score_gemma":0.00055205624,"threshold_uncertainty_score":0.022480547},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7784828,0.0010044842,0.18037835,0.00058303267,0.00008289742,0.00005169276,0.0010069688,0.00029681498,0.038113058],"genre_scores_gemma":[0.96549594,0.00042022337,0.025449779,0.000115025854,0.000051203595,0.000039371866,0.0004779193,0.00006412662,0.007886436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952483,0.00005375903,0.000026196038,0.00014530604,0.000079763864,0.00017015934],"domain_scores_gemma":[0.9986755,0.00044810204,0.00022687743,0.00019659035,0.00016905194,0.00028380373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005995987,0.00046705862,0.0005488249,0.0011504693,0.0012870842,0.0016956853,0.0005374628,0.0005419147,0.006104516],"category_scores_gemma":[0.0023606778,0.00032438702,0.0006909743,0.0008135305,0.0021411586,0.0037996033,0.001046436,0.0010382532,0.0007728383],"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.00018878242,0.00003331947,0.001537928,0.000054284883,0.000011448044,0.0001416609,0.00058940554,0.00679433,0.0037997074,0.9655978,0.0016272332,0.0196241],"study_design_scores_gemma":[0.00001871369,0.00005928166,0.0015462541,0.000028831573,0.000013453178,0.00036155464,0.00024953636,0.017419988,0.0018166773,0.972154,0.006296683,0.000034838395],"about_ca_topic_score_codex":0.0034041118,"about_ca_topic_score_gemma":0.0027351375,"teacher_disagreement_score":0.006104516,"about_ca_system_score_codex":0.0011144854,"about_ca_system_score_gemma":0.0006387517,"threshold_uncertainty_score":0.020421684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9132466,0.0007499286,0.068039,0.0010562153,0.000059631875,0.000044178683,0.00049564324,0.0008418385,0.015466933],"genre_scores_gemma":[0.98934466,0.00032755636,0.006904298,0.00008576887,0.00010396242,0.00009302384,0.0006503569,0.00018352635,0.002306904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991844,0.00020865003,0.000036036556,0.00021491165,0.00019334276,0.00016253928],"domain_scores_gemma":[0.97764343,0.015841288,0.0018629258,0.0019453266,0.0010906592,0.0016163106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023586631,0.000557266,0.0007139535,0.0031183476,0.0010750409,0.0028494014,0.001625415,0.0009063563,0.0048235236],"category_scores_gemma":[0.027626513,0.0007829566,0.00063438085,0.0007573185,0.0035644276,0.0036386289,0.0016376411,0.0014091972,0.00046006156],"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.00064401655,0.00014642198,0.026538553,0.00040608435,0.00010443879,0.00050092244,0.00075606233,0.053863022,0.017519737,0.8681507,0.006274855,0.025095083],"study_design_scores_gemma":[0.00008082161,0.0001497546,0.014936621,0.00014523909,0.000087500914,0.0011372599,0.00043194136,0.39647293,0.010829866,0.5729762,0.0026545576,0.00009743899],"about_ca_topic_score_codex":0.00097433163,"about_ca_topic_score_gemma":0.0009456555,"teacher_disagreement_score":0.0048235236,"about_ca_system_score_codex":0.0018352834,"about_ca_system_score_gemma":0.000645644,"threshold_uncertainty_score":0.016136348},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75995284,0.0010408418,0.19349106,0.00052533485,0.00030811536,0.00006980678,0.00020166925,0.00020841965,0.044201855],"genre_scores_gemma":[0.9738884,0.00054533075,0.012021432,0.00009995003,0.00021927911,0.000055229983,0.00019953029,0.00006249169,0.012908255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922657,0.0001462517,0.000043798664,0.00014673927,0.00022153926,0.00021509892],"domain_scores_gemma":[0.9990232,0.00023133143,0.00026585336,0.000093353745,0.0001668183,0.00021950343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011054886,0.000829637,0.0005699375,0.002468016,0.0016013233,0.0028110298,0.0012429879,0.0006148386,0.0066594933],"category_scores_gemma":[0.0012308166,0.0002924574,0.0010259852,0.0016556547,0.004013687,0.003682305,0.0016913852,0.0014402742,0.0010286219],"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.000013709562,0.000021197286,0.00023452935,0.00002072259,0.0000057707166,0.000084803294,0.00029822704,0.0007028587,0.0009866754,0.9949084,0.00014729473,0.0025758268],"study_design_scores_gemma":[0.00001285224,0.000060523736,0.000491938,0.000014289482,0.000012907599,0.000153005,0.00024636445,0.01193561,0.0026086234,0.9816876,0.0027494652,0.000026890259],"about_ca_topic_score_codex":0.0013657985,"about_ca_topic_score_gemma":0.0010744552,"teacher_disagreement_score":0.0066594933,"about_ca_system_score_codex":0.0012023705,"about_ca_system_score_gemma":0.0009308147,"threshold_uncertainty_score":0.02227825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39070886,0.00050419633,0.5137401,0.0006564337,0.0003540576,0.00013420005,0.0003754445,0.00051848654,0.09300822],"genre_scores_gemma":[0.9165356,0.00041501014,0.059011266,0.00031119926,0.0001771382,0.00007628273,0.00021525225,0.00015756756,0.023100687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953485,0.00009664466,0.000028159715,0.00008109205,0.00013804632,0.00012116281],"domain_scores_gemma":[0.99907684,0.00022880436,0.00012881457,0.00017319866,0.00024466284,0.00014767902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077242334,0.00056780665,0.00044658218,0.0017304742,0.0009808962,0.0019321147,0.00083019654,0.00055613206,0.007864505],"category_scores_gemma":[0.00191136,0.0002771581,0.000638791,0.0007374395,0.0020211875,0.0035641952,0.0014106835,0.0010396824,0.0014276413],"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.000019762245,0.0000120850855,0.00032725357,0.000023220418,0.0000032699838,0.000098092496,0.000111103756,0.0007407879,0.0020230054,0.9867819,0.00058798585,0.009271566],"study_design_scores_gemma":[0.000016063212,0.00005424029,0.0007869962,0.000028932152,0.000010855094,0.00053115585,0.0002154052,0.020772649,0.005164679,0.9618647,0.010505363,0.00004897852],"about_ca_topic_score_codex":0.00057740044,"about_ca_topic_score_gemma":0.0007174644,"teacher_disagreement_score":0.007864505,"about_ca_system_score_codex":0.00085647416,"about_ca_system_score_gemma":0.0005740287,"threshold_uncertainty_score":0.026309371},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50523466,0.0015483246,0.37527442,0.0018390694,0.00035693834,0.00015535954,0.00020937945,0.0003707206,0.11501116],"genre_scores_gemma":[0.9349053,0.00078227074,0.04057103,0.00028784364,0.00028992366,0.000120401906,0.00020420302,0.000117349075,0.02272176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994765,0.00009247507,0.000025137844,0.0001261962,0.00017406757,0.00010559735],"domain_scores_gemma":[0.99908125,0.00024181372,0.00014752342,0.0001384853,0.00019320888,0.00019772771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004703321,0.0005988208,0.00031922673,0.0027030676,0.0013367229,0.0022469843,0.0006077879,0.0005697303,0.0044744206],"category_scores_gemma":[0.0018326071,0.00019010094,0.00054776116,0.000750927,0.003397726,0.003721265,0.0023583914,0.0010481122,0.0005175967],"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.000004364854,0.000004980918,0.000283016,0.0000143859725,0.0000030196738,0.000052757267,0.00040150163,0.00062442187,0.001219541,0.9937452,0.0002751821,0.003371624],"study_design_scores_gemma":[0.0000058695946,0.000017214916,0.000298804,0.000015442658,0.000005717332,0.00013984414,0.0003974215,0.004288928,0.0016539296,0.97516143,0.018003779,0.0000116149395],"about_ca_topic_score_codex":0.0010305302,"about_ca_topic_score_gemma":0.00096527475,"teacher_disagreement_score":0.0044744206,"about_ca_system_score_codex":0.0014169377,"about_ca_system_score_gemma":0.00063180894,"threshold_uncertainty_score":0.014968455},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26755968,0.00083505054,0.47337452,0.0011181907,0.000768101,0.00015538026,0.00030479187,0.00048138073,0.25540295],"genre_scores_gemma":[0.87974554,0.0008371464,0.06859747,0.0008307771,0.0004081792,0.0001448126,0.00021129369,0.00025881454,0.04896591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992931,0.00010356079,0.000042614014,0.00011108577,0.00029257906,0.00015701665],"domain_scores_gemma":[0.99896455,0.00032164776,0.00013464167,0.0001905976,0.0002401305,0.00014841832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012042136,0.0005136551,0.000478755,0.0012046322,0.0013995323,0.0018973002,0.0005976577,0.00055546535,0.009716365],"category_scores_gemma":[0.0024802797,0.00042291588,0.00079358276,0.00059015077,0.002101307,0.0027037119,0.0020619722,0.0017415523,0.0020398137],"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.000012324417,0.000011306728,0.0002858688,0.000020171556,0.0000022895033,0.00012068713,0.00018295305,0.00053498364,0.0016059799,0.9890704,0.0009780242,0.0071749343],"study_design_scores_gemma":[0.000013356508,0.000034814417,0.00041051485,0.000022935777,0.000006698183,0.0003689449,0.00015147579,0.0050872704,0.0069213137,0.9739005,0.013058397,0.00002373657],"about_ca_topic_score_codex":0.0003831197,"about_ca_topic_score_gemma":0.00046364896,"teacher_disagreement_score":0.009716365,"about_ca_system_score_codex":0.0007182741,"about_ca_system_score_gemma":0.0004841466,"threshold_uncertainty_score":0.03250444},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18698312,0.00029831353,0.70890296,0.00037955854,0.00036637348,0.00013418772,0.0004878976,0.0005804455,0.10186722],"genre_scores_gemma":[0.7374706,0.00057979993,0.21621424,0.00028917778,0.0001556634,0.00019008073,0.00073025114,0.00029213287,0.044077996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950254,0.00008320945,0.000024673633,0.000074898686,0.0002161055,0.00009857083],"domain_scores_gemma":[0.9995035,0.00009496503,0.000040391635,0.00010485839,0.00020791426,0.00004839001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060205074,0.0005538384,0.00034598584,0.0008919184,0.0007589044,0.0013949269,0.00077169284,0.00035582716,0.009286289],"category_scores_gemma":[0.0011021459,0.00032122454,0.0006832246,0.00057238154,0.0011984777,0.001971842,0.000835753,0.0012176504,0.0025067865],"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.0000446062,0.000025772499,0.00019763806,0.000042051448,0.000004118208,0.000068429086,0.000192139,0.0019230758,0.01197522,0.9517307,0.0013733926,0.03242294],"study_design_scores_gemma":[0.00003452059,0.00018028615,0.0007898809,0.000055243345,0.000018374109,0.0004061192,0.00035345188,0.055542197,0.05532536,0.8389325,0.048280757,0.000081175895],"about_ca_topic_score_codex":0.0009310991,"about_ca_topic_score_gemma":0.0016457911,"teacher_disagreement_score":0.009286289,"about_ca_system_score_codex":0.000753807,"about_ca_system_score_gemma":0.000798284,"threshold_uncertainty_score":0.031065702},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30866355,0.0021743593,0.38047242,0.0013863245,0.00048828116,0.00015435075,0.0007556331,0.00049498526,0.30541015],"genre_scores_gemma":[0.92473775,0.0019367496,0.035382684,0.00026821683,0.00038405706,0.000093709714,0.0003784542,0.000090668196,0.03672765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996402,0.000055142857,0.000021630898,0.00005818095,0.00015672317,0.00006802776],"domain_scores_gemma":[0.99968576,0.00006326332,0.000044629553,0.00002945156,0.00012663087,0.000050256658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003627486,0.00028755562,0.0002006323,0.0014509244,0.0008815142,0.0019916536,0.00047837,0.000257896,0.005565281],"category_scores_gemma":[0.0010221219,0.00015458092,0.00032718165,0.0009646322,0.0017344169,0.0024958062,0.0009380209,0.0007774382,0.0006572661],"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.000004943741,0.0000034993707,0.00011057319,0.000011741367,0.0000018223187,0.00001959039,0.00009730803,0.00049521757,0.0006122436,0.9928559,0.00043493515,0.005352057],"study_design_scores_gemma":[0.0000036312754,0.0000091491065,0.00029498053,0.000009371047,0.000005024798,0.00006901594,0.00011131722,0.0045011756,0.0013917334,0.9808528,0.012742024,0.000009803685],"about_ca_topic_score_codex":0.002999877,"about_ca_topic_score_gemma":0.0020885535,"teacher_disagreement_score":0.005565281,"about_ca_system_score_codex":0.0013198107,"about_ca_system_score_gemma":0.00079751044,"threshold_uncertainty_score":0.01861775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10336371,0.0012353484,0.8718308,0.0029101362,0.00019963864,0.00022190291,0.00042008574,0.00032038664,0.019497966],"genre_scores_gemma":[0.85244995,0.0014068796,0.11405672,0.00048827723,0.00030432086,0.0006126343,0.00030877793,0.00017650104,0.030195814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978308,0.0007585801,0.00008345094,0.0004631671,0.00039945001,0.0004644822],"domain_scores_gemma":[0.98849773,0.008103013,0.0013397713,0.0009868958,0.00053756754,0.0005349771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022246798,0.0015780599,0.0021922865,0.0010795144,0.0016442711,0.0024766522,0.005847133,0.0044083656,0.009783964],"category_scores_gemma":[0.012791843,0.000826236,0.0014101671,0.0016122406,0.0025687034,0.007957116,0.0039202883,0.0029372144,0.0016336542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045569675,0.00018978918,0.0006051394,0.0002488601,0.0000461058,0.00043543847,0.00035956752,0.81784654,0.0015138134,0.15819374,0.003557699,0.016547564],"study_design_scores_gemma":[0.000037471425,0.000072342074,0.00007151604,0.0000110446335,0.000010941077,0.0000820555,0.000095814285,0.96279436,0.00039310273,0.035505924,0.0009078971,0.000017498236],"about_ca_topic_score_codex":0.003403295,"about_ca_topic_score_gemma":0.0024973203,"teacher_disagreement_score":0.009783964,"about_ca_system_score_codex":0.0017407816,"about_ca_system_score_gemma":0.00097167655,"threshold_uncertainty_score":0.03273058},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9455535,0.00030230763,0.024555447,0.00046644537,0.000057356447,0.000027132026,0.000094146104,0.00027585812,0.028667897],"genre_scores_gemma":[0.9953709,0.00017272792,0.0020539423,0.000046755507,0.000058942387,0.00003898277,0.0001381996,0.00008350005,0.0020359028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999647,0.00007043731,0.000013018836,0.00004114265,0.00011738035,0.00011102077],"domain_scores_gemma":[0.9986449,0.00049751444,0.00029112774,0.00012583616,0.00011360655,0.00032709842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047539957,0.0005139225,0.00057129853,0.002039177,0.0011632607,0.001491077,0.0010366288,0.0009595179,0.0043949834],"category_scores_gemma":[0.004533032,0.0004299097,0.0006001779,0.00040133562,0.0029552658,0.0016898939,0.0018120653,0.00083788275,0.0003835235],"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.00032435558,0.00017186292,0.0040663388,0.00022860366,0.000070935115,0.0016525325,0.00055257574,0.15313828,0.018950045,0.8103627,0.0016551934,0.008826638],"study_design_scores_gemma":[0.00009169454,0.00016263379,0.00630312,0.00008487835,0.000038218837,0.00081720075,0.00028616792,0.58378124,0.0036490636,0.40272757,0.0019958403,0.000062362786],"about_ca_topic_score_codex":0.0019814502,"about_ca_topic_score_gemma":0.0009149139,"teacher_disagreement_score":0.0043949834,"about_ca_system_score_codex":0.0008994871,"about_ca_system_score_gemma":0.00038529444,"threshold_uncertainty_score":0.014702678},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5719801,0.0012702361,0.21524532,0.0018697631,0.0006909777,0.0000691481,0.00018734157,0.0002666512,0.20842037],"genre_scores_gemma":[0.95311433,0.000379562,0.024661655,0.00023023969,0.00029024476,0.000049031147,0.000075692486,0.000069001784,0.021130184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966395,0.00006235032,0.000017494012,0.000055785033,0.00011729427,0.00008316132],"domain_scores_gemma":[0.9996517,0.00009081589,0.0000489105,0.000049499835,0.00008802597,0.000071084934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047039194,0.00033861655,0.00033940483,0.0009703879,0.00154144,0.0013586773,0.00047008894,0.0006124294,0.0052642273],"category_scores_gemma":[0.0012018656,0.00015892327,0.000460927,0.0004212955,0.002534341,0.0039121765,0.0012995445,0.0010413458,0.0007522026],"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.0000040265977,0.00000365995,0.000056874014,0.0000055055966,5.2101814e-7,0.000033449658,0.00010722813,0.00011740608,0.00038475674,0.997546,0.00016809723,0.0015724475],"study_design_scores_gemma":[0.000004973756,0.000015245827,0.00023867165,0.0000077911445,0.000002166058,0.0001583018,0.00009678928,0.0025597385,0.00076055736,0.989288,0.006855299,0.0000125683655],"about_ca_topic_score_codex":0.000655666,"about_ca_topic_score_gemma":0.0006085305,"teacher_disagreement_score":0.0052642273,"about_ca_system_score_codex":0.0009485789,"about_ca_system_score_gemma":0.0006793018,"threshold_uncertainty_score":0.01761055},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8796943,0.00028112464,0.05624326,0.0005907449,0.00014799922,0.000060389266,0.00014213956,0.00011832002,0.06272182],"genre_scores_gemma":[0.9799947,0.00018063455,0.009854923,0.00006957358,0.00013616156,0.00006141627,0.00013163696,0.00002441531,0.009546555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994916,0.00008718866,0.00003172975,0.000102197846,0.00013212954,0.00015516311],"domain_scores_gemma":[0.99942744,0.000191928,0.00009862257,0.00007777811,0.00006584777,0.00013838313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060710683,0.0004408981,0.00040524066,0.00095930585,0.0016783001,0.002319965,0.00046878366,0.00046138087,0.0040149544],"category_scores_gemma":[0.0013575313,0.000195057,0.0005488037,0.0005042749,0.0032955958,0.0039294884,0.0016092636,0.0010355973,0.00040256407],"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.00006930118,0.000029826115,0.0008837864,0.000023715178,0.000004110067,0.00018385793,0.00050552015,0.00086127006,0.0031084015,0.98658466,0.00034746755,0.0073981034],"study_design_scores_gemma":[0.000025566122,0.000113744776,0.0012266175,0.000016792595,0.000012346283,0.00034522524,0.000684346,0.0053452305,0.0046960753,0.980276,0.007235991,0.000022111162],"about_ca_topic_score_codex":0.0010079262,"about_ca_topic_score_gemma":0.0011985502,"teacher_disagreement_score":0.0040149544,"about_ca_system_score_codex":0.0009269141,"about_ca_system_score_gemma":0.00052159105,"threshold_uncertainty_score":0.01343143},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73136425,0.00085409323,0.2510143,0.0009894515,0.000094894,0.00007983411,0.0003900432,0.0007293856,0.014483794],"genre_scores_gemma":[0.9859212,0.00028927243,0.010184396,0.00012423146,0.00009699713,0.00008790406,0.00035408922,0.00012778737,0.002814218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986265,0.000404933,0.000041659758,0.00031213753,0.00040706526,0.00020773697],"domain_scores_gemma":[0.9860573,0.00770341,0.0021729036,0.0018241231,0.0011936573,0.0010486053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027406109,0.00043741884,0.00090023904,0.0027692493,0.0010037132,0.0026405226,0.0020167227,0.0014377108,0.006136385],"category_scores_gemma":[0.032226775,0.0005788361,0.0008049261,0.0010208397,0.0033247387,0.004980275,0.0016374493,0.0016572833,0.00044252357],"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.000084130465,0.000075434924,0.007816981,0.00010013595,0.000045808214,0.00016091032,0.00040679172,0.03757514,0.0032928076,0.94232816,0.0019436424,0.0061700596],"study_design_scores_gemma":[0.000057846923,0.0000620149,0.0036043394,0.00005522351,0.000025206558,0.00027605146,0.0001490159,0.4010325,0.0012901893,0.59134763,0.0020559384,0.000044043096],"about_ca_topic_score_codex":0.002059299,"about_ca_topic_score_gemma":0.001530436,"teacher_disagreement_score":0.006136385,"about_ca_system_score_codex":0.0018704552,"about_ca_system_score_gemma":0.00046520328,"threshold_uncertainty_score":0.020528257},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37364426,0.002061639,0.45207256,0.0014551124,0.0011466802,0.00023568132,0.0007696083,0.0007069756,0.1679074],"genre_scores_gemma":[0.89780945,0.0008567908,0.0557362,0.000675,0.0003863262,0.00013737142,0.00046821008,0.00016566728,0.04376498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952626,0.00005983197,0.000028242172,0.00012232465,0.00016455182,0.000098811484],"domain_scores_gemma":[0.9994342,0.000088022935,0.00006635353,0.0000529345,0.00021677412,0.00014173806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046293417,0.00041414713,0.0003534334,0.0015211101,0.0012486231,0.002519342,0.000772938,0.0005368108,0.010134032],"category_scores_gemma":[0.00079683244,0.00023791095,0.00056179834,0.0011358935,0.0013504254,0.0036468965,0.0015295525,0.0010388092,0.0015499834],"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.000013945493,0.00001233569,0.00017042541,0.000033007014,0.0000054795178,0.00015172211,0.00017456246,0.0005044097,0.0032581587,0.9900506,0.0007575085,0.0048676785],"study_design_scores_gemma":[0.0000089478835,0.00002413902,0.00033230035,0.000016517883,0.000010186617,0.00023944055,0.0001615945,0.008676012,0.0037681058,0.9719663,0.014771342,0.000025121566],"about_ca_topic_score_codex":0.0019573495,"about_ca_topic_score_gemma":0.0011978893,"teacher_disagreement_score":0.010134032,"about_ca_system_score_codex":0.0011152969,"about_ca_system_score_gemma":0.0006555654,"threshold_uncertainty_score":0.03390175},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54236346,0.001571236,0.35701397,0.00071542925,0.00020379234,0.00014122369,0.0012271787,0.00060677814,0.096156865],"genre_scores_gemma":[0.9371169,0.00072259514,0.044809166,0.00017601649,0.0004291407,0.00023010667,0.0011934071,0.00017260989,0.015150102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986338,0.00032807078,0.00010196087,0.00034282362,0.00035117325,0.00024217472],"domain_scores_gemma":[0.9964066,0.002043925,0.0005085301,0.00028353703,0.00037758183,0.0003797685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093343295,0.00073155394,0.00065222697,0.0027702474,0.0016859021,0.003237806,0.0007741639,0.00075184315,0.010105735],"category_scores_gemma":[0.0038770959,0.00043667146,0.0010667564,0.0024186692,0.0036839184,0.005475825,0.001994578,0.0015747276,0.0010576039],"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.00006433015,0.000023581637,0.0006815284,0.00004601048,0.00000696903,0.00020629591,0.0006523122,0.0025972936,0.0017815096,0.98630875,0.00048774877,0.0071436],"study_design_scores_gemma":[0.000017851611,0.0000633942,0.0006969577,0.000028988574,0.000010684243,0.00031762916,0.00026009325,0.0110806925,0.0014035343,0.9821854,0.003910615,0.000024095758],"about_ca_topic_score_codex":0.00088411174,"about_ca_topic_score_gemma":0.00061579456,"teacher_disagreement_score":0.010105735,"about_ca_system_score_codex":0.0009726745,"about_ca_system_score_gemma":0.00046658804,"threshold_uncertainty_score":0.03380704},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55288804,0.0018915548,0.2020363,0.0016116118,0.00039447003,0.000111913534,0.00046505115,0.00059251965,0.24000856],"genre_scores_gemma":[0.9335315,0.0005984452,0.035571884,0.00021680428,0.00013028413,0.000060166665,0.00029072442,0.000053352564,0.029546833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995289,0.000096485324,0.000031556898,0.00008790661,0.00014749286,0.00010759764],"domain_scores_gemma":[0.9994417,0.00011574523,0.00008315171,0.000101941616,0.00012333972,0.0001341048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005378361,0.0002340798,0.00020422805,0.0010671157,0.0012644425,0.0017584615,0.0005590434,0.0004616494,0.0053763837],"category_scores_gemma":[0.000928039,0.00030129464,0.0005004976,0.00054001523,0.002358241,0.0032977248,0.0013264942,0.00090576365,0.0005182827],"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.000008607374,0.000004697025,0.00029165242,0.000016744732,0.0000022036843,0.000057825906,0.00018189145,0.00062531006,0.0010601039,0.9950477,0.00038453282,0.0023188284],"study_design_scores_gemma":[0.000016819726,0.000024345622,0.0011465814,0.000026266567,0.000009145424,0.00024110283,0.00032376577,0.005607934,0.0024600858,0.9673752,0.022743069,0.000025621106],"about_ca_topic_score_codex":0.002420984,"about_ca_topic_score_gemma":0.0037668576,"teacher_disagreement_score":0.0053763837,"about_ca_system_score_codex":0.0015167819,"about_ca_system_score_gemma":0.00058301364,"threshold_uncertainty_score":0.017985761},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6022239,0.0011103873,0.31796438,0.0076969126,0.00046675786,0.00020022997,0.001190114,0.0012768151,0.06787051],"genre_scores_gemma":[0.9418034,0.00050116936,0.04535357,0.0012084029,0.00040797231,0.00018497663,0.00064383005,0.00033373077,0.009562983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973598,0.0006689672,0.00014542528,0.0006260671,0.0006990207,0.00050074473],"domain_scores_gemma":[0.9664178,0.020801129,0.0030614329,0.005646695,0.0021182562,0.001954641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025535163,0.0007684335,0.0011529762,0.0016747501,0.0015948601,0.0023384353,0.002537903,0.0020153997,0.011606111],"category_scores_gemma":[0.02565652,0.0007134376,0.0012519647,0.001997879,0.0030909919,0.008261106,0.0035937303,0.0045326445,0.0014849105],"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.00095899607,0.00019889222,0.0077742385,0.00033801893,0.000078036464,0.0006364029,0.00070349325,0.04044581,0.011844382,0.8921076,0.0098994095,0.03501481],"study_design_scores_gemma":[0.000087630986,0.00018881328,0.0020741385,0.000043557833,0.00004671959,0.0005870709,0.00016409263,0.08165761,0.003967448,0.90347207,0.0076391357,0.00007168075],"about_ca_topic_score_codex":0.0009895514,"about_ca_topic_score_gemma":0.00087091245,"teacher_disagreement_score":0.011606111,"about_ca_system_score_codex":0.0016333566,"about_ca_system_score_gemma":0.0006687298,"threshold_uncertainty_score":0.038826287},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53856874,0.0050268485,0.37818074,0.0039250143,0.0004100572,0.00009697999,0.00039860734,0.0014951775,0.071897745],"genre_scores_gemma":[0.9654668,0.0012298247,0.021130811,0.00024566066,0.00017752365,0.00019679876,0.00023471547,0.0004162481,0.010901624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895006,0.0002815037,0.000032580447,0.00018761274,0.0002973776,0.0002508997],"domain_scores_gemma":[0.9892161,0.007780935,0.00086525385,0.000913394,0.00053087575,0.0006934508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015814466,0.0012900345,0.0012499564,0.0018737126,0.0014037992,0.0019207936,0.0023545364,0.001769779,0.00655661],"category_scores_gemma":[0.014065848,0.0007601847,0.0011927311,0.0008508345,0.0034064194,0.005294007,0.0030626713,0.0034359498,0.0008180665],"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.00015055707,0.00009632766,0.0014190092,0.00028845007,0.000039545386,0.0002834683,0.0004088284,0.14625975,0.011579086,0.8284839,0.0026074357,0.00838378],"study_design_scores_gemma":[0.00001418554,0.0000312124,0.0002647665,0.000030694344,0.000016649501,0.00010762841,0.00007458146,0.7100588,0.0053726467,0.28301376,0.000981039,0.000033940858],"about_ca_topic_score_codex":0.002147694,"about_ca_topic_score_gemma":0.0014863472,"teacher_disagreement_score":0.00655661,"about_ca_system_score_codex":0.0020365838,"about_ca_system_score_gemma":0.00083353487,"threshold_uncertainty_score":0.021934032},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9546251,0.00016759687,0.022536457,0.00022728553,0.000027908605,0.00001641722,0.00005936271,0.00014221645,0.022197675],"genre_scores_gemma":[0.9916761,0.000079469464,0.0031222731,0.000022525646,0.000029559802,0.000030494322,0.00010077211,0.00003761673,0.0049011013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996691,0.000057295612,0.000012929196,0.00006200908,0.000102608334,0.00009612631],"domain_scores_gemma":[0.9992312,0.00023497175,0.000141899,0.00007697887,0.0001263245,0.00018852514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040953897,0.0003662233,0.0004102605,0.0014982817,0.0011987231,0.0018321002,0.0007211981,0.00053484045,0.0057157683],"category_scores_gemma":[0.0028616497,0.00025053215,0.00036271504,0.0003550593,0.0024572741,0.0019525003,0.0015202253,0.0009743506,0.00049496],"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.00014934067,0.000050265557,0.0058925464,0.000060934075,0.000012891498,0.00032863775,0.0010778987,0.005805602,0.010400303,0.966786,0.00096999283,0.008465501],"study_design_scores_gemma":[0.000060314906,0.00019454077,0.006814633,0.00007836693,0.00001705002,0.00067348836,0.0012037131,0.080856845,0.008934221,0.8949999,0.006103112,0.00006390592],"about_ca_topic_score_codex":0.0013481214,"about_ca_topic_score_gemma":0.0011373282,"teacher_disagreement_score":0.0057157683,"about_ca_system_score_codex":0.0011472409,"about_ca_system_score_gemma":0.00041925441,"threshold_uncertainty_score":0.01912111},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0609184,0.00049768627,0.87478644,0.00050588854,0.00030692792,0.000103142265,0.00035376174,0.0006507419,0.06187706],"genre_scores_gemma":[0.69304544,0.00078444224,0.26593816,0.00040868996,0.00036697218,0.00028641813,0.00085762073,0.00074997445,0.037562255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949193,0.0001474642,0.000025007746,0.000087884255,0.00015681038,0.00009093596],"domain_scores_gemma":[0.99925464,0.0002684487,0.00008098663,0.00013028037,0.00017210988,0.0000935226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070800894,0.00060418627,0.00062508986,0.0031210838,0.0008859239,0.0020779774,0.0012988199,0.0006326362,0.015096779],"category_scores_gemma":[0.0032407746,0.0003298485,0.0011874695,0.0014483064,0.001534229,0.0022927031,0.0016032478,0.001296147,0.0020040113],"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.000015310054,0.000015978529,0.00028546495,0.000029765288,0.0000067085266,0.000054366672,0.000062475476,0.0054099746,0.00069762167,0.97919774,0.002102375,0.012122177],"study_design_scores_gemma":[0.000009149111,0.000025951038,0.00017099922,0.000030166468,0.000009483026,0.00015177847,0.000050724648,0.17860535,0.0013064031,0.8121624,0.0074562966,0.000021279786],"about_ca_topic_score_codex":0.0029154285,"about_ca_topic_score_gemma":0.004173006,"teacher_disagreement_score":0.015096779,"about_ca_system_score_codex":0.001282601,"about_ca_system_score_gemma":0.00068268564,"threshold_uncertainty_score":0.05050379},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73008484,0.0004687536,0.22747192,0.0006182988,0.000121135956,0.00004875938,0.00013023721,0.00016711072,0.040889014],"genre_scores_gemma":[0.96368444,0.00022373191,0.022223473,0.000079925536,0.00004657127,0.000019907091,0.00007076399,0.000043982465,0.013607375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972206,0.00004737788,0.0000105126,0.00006387666,0.000093845694,0.00006241011],"domain_scores_gemma":[0.9996314,0.00010557867,0.000059052814,0.000048894537,0.000066481414,0.000088455214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004827966,0.00030882406,0.0001789022,0.00068761327,0.0005674192,0.00104371,0.00061345025,0.00037608357,0.004775512],"category_scores_gemma":[0.0014030761,0.00014851836,0.0004850065,0.00045244436,0.0020349051,0.0029774606,0.0011263989,0.0009963096,0.00040281573],"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.000016246637,0.000007226087,0.0005134044,0.000017038186,0.0000027325364,0.000080538404,0.0002560157,0.0027108619,0.0024729108,0.9897301,0.00018819713,0.004004662],"study_design_scores_gemma":[0.000016912605,0.000055330165,0.001164408,0.000021371405,0.000006113843,0.000261166,0.0002795667,0.042663045,0.0049576857,0.94322336,0.007322004,0.000028983675],"about_ca_topic_score_codex":0.0017125298,"about_ca_topic_score_gemma":0.0013953695,"teacher_disagreement_score":0.004775512,"about_ca_system_score_codex":0.0010328833,"about_ca_system_score_gemma":0.0005798728,"threshold_uncertainty_score":0.015975714},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.938407,0.00024341814,0.03999128,0.00023117111,0.000030424204,0.000020207834,0.00012474174,0.00010404556,0.02084769],"genre_scores_gemma":[0.9895102,0.00013636939,0.005266361,0.00005042868,0.000029382156,0.000041846855,0.00012806052,0.000030229447,0.004807187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948967,0.00011198919,0.000023481844,0.00008848569,0.00010740396,0.00017900926],"domain_scores_gemma":[0.99899286,0.0004362293,0.00014784021,0.00017095028,0.00010063124,0.0001515891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041254083,0.00034850492,0.0006621621,0.0009906122,0.0016707663,0.002615248,0.0006112809,0.0003490537,0.0041831],"category_scores_gemma":[0.0011160452,0.00044136547,0.00047328035,0.0010915088,0.002490104,0.0020440172,0.0017330478,0.0009386145,0.0005320997],"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.00014990241,0.000017631795,0.0012143318,0.00003894442,0.0000091623415,0.00018484422,0.00049832487,0.0027349463,0.0053891074,0.98464465,0.00055296667,0.004565261],"study_design_scores_gemma":[0.00007444973,0.000037450533,0.0017445955,0.000020731954,0.00002230663,0.00028524565,0.00060441316,0.011901847,0.0043299603,0.97516155,0.0057955645,0.00002185362],"about_ca_topic_score_codex":0.0027490454,"about_ca_topic_score_gemma":0.003133081,"teacher_disagreement_score":0.0041831,"about_ca_system_score_codex":0.0013669111,"about_ca_system_score_gemma":0.00043353788,"threshold_uncertainty_score":0.013993919},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5059976,0.0077712545,0.10650927,0.052896358,0.0030015735,0.00015120319,0.0010169436,0.0017683422,0.32088745],"genre_scores_gemma":[0.9754321,0.0010807657,0.008368473,0.003614908,0.0010970471,0.00011093654,0.00017772603,0.00018924069,0.009928884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986136,0.0002275882,0.00010970227,0.00038595154,0.00048683965,0.0001761623],"domain_scores_gemma":[0.99166065,0.005698403,0.0006647913,0.00078641216,0.0008507876,0.00033897243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000956288,0.00024613895,0.00037334068,0.0012580071,0.0012017934,0.0019272757,0.00077182625,0.0015384173,0.008397518],"category_scores_gemma":[0.013098297,0.00027673616,0.00042013545,0.0005933006,0.0038813374,0.004917137,0.0014663306,0.0027144097,0.0019382288],"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.00017344432,0.000020413234,0.0017102114,0.00017461304,0.000012345915,0.00041402885,0.0007955577,0.0014558578,0.00955007,0.95924115,0.010582771,0.015869534],"study_design_scores_gemma":[0.000056329904,0.00009389361,0.0025143076,0.00009722711,0.000018306768,0.0010043706,0.000341436,0.0065067452,0.011116379,0.95128065,0.026911775,0.00005853128],"about_ca_topic_score_codex":0.00056356064,"about_ca_topic_score_gemma":0.00036041666,"teacher_disagreement_score":0.008397518,"about_ca_system_score_codex":0.001298136,"about_ca_system_score_gemma":0.00056518003,"threshold_uncertainty_score":0.028092504},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21612528,0.0002479668,0.77096087,0.00061618624,0.00009560773,0.0002615801,0.00033351636,0.0013348018,0.010024164],"genre_scores_gemma":[0.43611163,0.00015457615,0.5551867,0.0002001003,0.00005127595,0.00018807387,0.0006807737,0.00027374818,0.007153206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987447,0.00036615535,0.000109141234,0.0003479295,0.00025164578,0.00018028857],"domain_scores_gemma":[0.9957799,0.0016045043,0.00037211395,0.0015799572,0.00034822384,0.00031534946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013616153,0.0006128215,0.0008508044,0.0012842121,0.0009313182,0.0017210935,0.0016516133,0.0010007003,0.003955167],"category_scores_gemma":[0.0066371127,0.0005259369,0.0007489256,0.002447308,0.0014799633,0.0037491142,0.002201815,0.0012367077,0.000624681],"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.00062590535,0.000542231,0.0072714943,0.0003910955,0.00012686384,0.00016581772,0.0008214383,0.111738384,0.031059336,0.46705523,0.010319764,0.36988243],"study_design_scores_gemma":[0.00010684447,0.00016371346,0.0012776279,0.000047252695,0.00008018071,0.00025348738,0.00020343231,0.35687622,0.015267926,0.6147336,0.010944599,0.00004511951],"about_ca_topic_score_codex":0.0018140138,"about_ca_topic_score_gemma":0.0028606823,"teacher_disagreement_score":0.003955167,"about_ca_system_score_codex":0.0014977825,"about_ca_system_score_gemma":0.00082944817,"threshold_uncertainty_score":0.013231337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2740437,0.00090028776,0.6590832,0.0004267194,0.00014437053,0.00007697551,0.0002865759,0.0003279692,0.06471022],"genre_scores_gemma":[0.8991627,0.00049728475,0.08773285,0.00022282348,0.00010885741,0.00018687687,0.00037617318,0.00014647136,0.011565947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926704,0.00013243186,0.00005549995,0.00013869622,0.00026569466,0.00014070382],"domain_scores_gemma":[0.9982033,0.0007635558,0.00025235242,0.00038083515,0.0002869367,0.00011306291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047837227,0.0003893987,0.00050141173,0.0008635931,0.00092164165,0.0012966495,0.0008305898,0.000872713,0.0047806483],"category_scores_gemma":[0.004004426,0.00024532294,0.00059225195,0.00075015705,0.0018470427,0.002535783,0.0011261097,0.0013037912,0.00076940114],"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.000024799107,0.000014892331,0.0005846275,0.000049840295,0.0000047532753,0.00015305419,0.00008177351,0.009720801,0.009992106,0.9679863,0.00053314515,0.010853976],"study_design_scores_gemma":[0.000009671996,0.000042748983,0.0006194394,0.00002830074,0.000005275239,0.0003609163,0.000085999294,0.0753689,0.007557764,0.91077465,0.0051260754,0.000020318521],"about_ca_topic_score_codex":0.0008743202,"about_ca_topic_score_gemma":0.00069986057,"teacher_disagreement_score":0.0047806483,"about_ca_system_score_codex":0.00062889967,"about_ca_system_score_gemma":0.0005959938,"threshold_uncertainty_score":0.01599288},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54962194,0.0005206706,0.43826562,0.000725688,0.000049453818,0.00025724768,0.00058866566,0.0006226481,0.00934817],"genre_scores_gemma":[0.73132473,0.00025093608,0.2636728,0.00009811342,0.00001409788,0.00009989789,0.0006413067,0.00009725876,0.003800856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993772,0.00018213179,0.00003772737,0.00016049285,0.00013495598,0.00010746072],"domain_scores_gemma":[0.99761945,0.001592922,0.00022018809,0.00028336712,0.00011811891,0.00016597797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005194083,0.00037480475,0.0007125811,0.00038563434,0.0005338661,0.00090987183,0.00088428194,0.00069148256,0.0037923008],"category_scores_gemma":[0.00355805,0.00033214863,0.00049654517,0.0007005155,0.00049645384,0.0015405319,0.00070870295,0.0008911186,0.00046667122],"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.0008208635,0.00044586693,0.005082626,0.0005122279,0.00007113741,0.0005239484,0.00027648557,0.74597603,0.023087373,0.07997994,0.004163599,0.13905983],"study_design_scores_gemma":[0.000096600925,0.00037620243,0.0006765921,0.000031124942,0.000036947687,0.00024928834,0.0001942982,0.91084516,0.010717771,0.073847555,0.0029059653,0.000022503815],"about_ca_topic_score_codex":0.0016932463,"about_ca_topic_score_gemma":0.0031056274,"teacher_disagreement_score":0.0037923008,"about_ca_system_score_codex":0.00065852323,"about_ca_system_score_gemma":0.0011880674,"threshold_uncertainty_score":0.012686551},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86676276,0.00045497782,0.052647397,0.0020356504,0.0001370933,0.0000664129,0.00039889998,0.00022780187,0.077268995],"genre_scores_gemma":[0.9854754,0.00011913623,0.0066772928,0.00011047372,0.000034804292,0.000019695055,0.00017974182,0.000024990011,0.0073584453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996345,0.00004713111,0.000017363138,0.00008653342,0.00012450383,0.000089910005],"domain_scores_gemma":[0.9989151,0.0004502649,0.00007984851,0.00013926346,0.0001308636,0.00028465828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047659452,0.00033232788,0.0004236771,0.0010061004,0.0026651793,0.0026916247,0.00064307364,0.00080180005,0.0069423523],"category_scores_gemma":[0.0019626934,0.00045118565,0.00046655466,0.0005882061,0.003707015,0.003930821,0.0026742506,0.0020857817,0.0006547057],"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.000045788605,0.000018239505,0.000492807,0.00003575913,0.0000060627167,0.00016619115,0.00038245023,0.0013241434,0.0039190417,0.9913079,0.00056845177,0.0017332924],"study_design_scores_gemma":[0.000047447254,0.000026090378,0.00082241057,0.000021609601,0.000014989919,0.00025812362,0.00036763307,0.0071473364,0.004878608,0.9781231,0.008269524,0.000023066634],"about_ca_topic_score_codex":0.0016073778,"about_ca_topic_score_gemma":0.0018668915,"teacher_disagreement_score":0.0069423523,"about_ca_system_score_codex":0.0014276815,"about_ca_system_score_gemma":0.0007229421,"threshold_uncertainty_score":0.023224533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18205114,0.00054045196,0.6990245,0.0010302255,0.00058049645,0.00013695947,0.0002597634,0.0011556143,0.11522087],"genre_scores_gemma":[0.77044535,0.00040386117,0.19970034,0.00065954024,0.00036187173,0.00010925699,0.00032188057,0.00055907713,0.027438859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998594,0.00031120775,0.00010263913,0.00040583801,0.00044393927,0.00014244733],"domain_scores_gemma":[0.99911565,0.00024129704,0.000092652175,0.00023388448,0.00021432072,0.00010224518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013203733,0.00049160916,0.0006100723,0.0014336462,0.0010984485,0.002156371,0.0013681249,0.00061755284,0.0092079295],"category_scores_gemma":[0.0032273186,0.00033367935,0.00064404553,0.0008105004,0.0035192308,0.004997338,0.0026880929,0.0019860154,0.002949762],"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.000028299813,0.000012271612,0.00024150877,0.000047166064,0.000005301665,0.0001496014,0.0001726703,0.0010959506,0.0038067745,0.9783211,0.001631206,0.014488268],"study_design_scores_gemma":[0.000025413854,0.0000787122,0.00038983073,0.000030504829,0.000019988409,0.00073742884,0.00015798892,0.014430681,0.01500617,0.9463697,0.022684695,0.00006875733],"about_ca_topic_score_codex":0.0002367447,"about_ca_topic_score_gemma":0.00030412723,"teacher_disagreement_score":0.0092079295,"about_ca_system_score_codex":0.0004734624,"about_ca_system_score_gemma":0.00041665137,"threshold_uncertainty_score":0.03080362},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33699465,0.007001272,0.26162007,0.05153769,0.0017422404,0.00032590912,0.0018929164,0.0014790258,0.33740625],"genre_scores_gemma":[0.9364014,0.0024150475,0.02920369,0.005730516,0.0011215761,0.00012425098,0.0017637215,0.00020872457,0.023031048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99666613,0.0006030833,0.0001328331,0.0011077393,0.00087706564,0.0006130921],"domain_scores_gemma":[0.98577154,0.008289873,0.0007582129,0.0027725801,0.0016602149,0.0007476655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022750434,0.0008114441,0.0014348713,0.0016945628,0.0025308246,0.002509595,0.0022617597,0.0020245702,0.011885513],"category_scores_gemma":[0.020586157,0.00054570375,0.001180891,0.0023321884,0.004082537,0.01111516,0.004864113,0.0054897377,0.0015222961],"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.00033765522,0.00012976259,0.0048407996,0.00035081405,0.000071466515,0.0007325094,0.0013360371,0.008385381,0.0033165314,0.9048288,0.031482395,0.044187855],"study_design_scores_gemma":[0.000072343384,0.00007603229,0.00200985,0.00009832612,0.00006922027,0.00054690125,0.00068110914,0.027072772,0.0032727337,0.9163064,0.049743447,0.000050877166],"about_ca_topic_score_codex":0.0049341233,"about_ca_topic_score_gemma":0.0025048757,"teacher_disagreement_score":0.011885513,"about_ca_system_score_codex":0.0018800023,"about_ca_system_score_gemma":0.00084708055,"threshold_uncertainty_score":0.039761066},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90336424,0.00019007141,0.08831926,0.00030298135,0.00002776581,0.00004565417,0.00016144032,0.00014424323,0.007444276],"genre_scores_gemma":[0.97666365,0.00023234799,0.021013707,0.000072453186,0.000037515376,0.000041908377,0.00025605975,0.00006930794,0.001613054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917537,0.00016982833,0.000043104716,0.00027197102,0.0001309636,0.00020867262],"domain_scores_gemma":[0.9903846,0.0058819302,0.0014915055,0.0008893341,0.0004364269,0.00091622793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008732608,0.00056349055,0.00060930237,0.0008448364,0.0012468571,0.002471618,0.0011896171,0.000695197,0.0023870186],"category_scores_gemma":[0.005051567,0.0005861645,0.0008424681,0.00082433526,0.0036972906,0.005321087,0.0015413138,0.0017342394,0.00029020346],"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.00071655016,0.00035110908,0.032757357,0.00046689124,0.00011874385,0.0014174656,0.0023247108,0.050505687,0.034100216,0.8355264,0.0020301575,0.0396848],"study_design_scores_gemma":[0.000080681275,0.0002847341,0.013135182,0.00007363417,0.00015056925,0.0020426551,0.0018548307,0.14021188,0.025500502,0.8109113,0.0056264508,0.00012759077],"about_ca_topic_score_codex":0.0013820023,"about_ca_topic_score_gemma":0.0014122005,"teacher_disagreement_score":0.002471618,"about_ca_system_score_codex":0.0010556374,"about_ca_system_score_gemma":0.0007296615,"threshold_uncertainty_score":0.0079853535},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52105963,0.0017107523,0.37688202,0.00057007215,0.00024136405,0.0001377466,0.0010661106,0.00058881356,0.09774351],"genre_scores_gemma":[0.90004873,0.00095638086,0.07485399,0.00011897172,0.00009838874,0.00013707684,0.0006692348,0.00012735496,0.022989918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994647,0.00012461202,0.00004380543,0.00009355349,0.0001681992,0.00010509619],"domain_scores_gemma":[0.99940205,0.00023572099,0.00006787825,0.00008869354,0.0001418767,0.00006368362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004424622,0.0003553243,0.00046219892,0.0022810695,0.0013151028,0.0033708713,0.000642166,0.0006516715,0.0067824367],"category_scores_gemma":[0.0012307474,0.0003006238,0.00043531714,0.0019106115,0.0012944259,0.0042452724,0.0011536474,0.0010645336,0.0007960128],"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.000020555004,0.000008832413,0.0004759251,0.00003507047,0.0000038048358,0.000086034204,0.00023177876,0.0008296921,0.0013682599,0.9894804,0.00048677126,0.0069728596],"study_design_scores_gemma":[0.000008402892,0.000025205563,0.0007491992,0.00004657825,0.000014271203,0.00041279706,0.0004629761,0.006373087,0.004079637,0.9591205,0.028671319,0.000036135512],"about_ca_topic_score_codex":0.0008496082,"about_ca_topic_score_gemma":0.0011509834,"teacher_disagreement_score":0.0067824367,"about_ca_system_score_codex":0.0006662526,"about_ca_system_score_gemma":0.00056200475,"threshold_uncertainty_score":0.022689521},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8314678,0.00027125631,0.14835893,0.00021716634,0.00003897174,0.00004800413,0.0008035389,0.00059343455,0.018200975],"genre_scores_gemma":[0.94628936,0.00016940913,0.04608679,0.000066158216,0.00002585612,0.00007400104,0.0011080242,0.00010144865,0.006078899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973494,0.000048372192,0.000019796682,0.00008611704,0.000056383564,0.00005444823],"domain_scores_gemma":[0.9984144,0.00065327564,0.00031477213,0.00022261545,0.000216184,0.00017872667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022663004,0.00025517255,0.00023939749,0.0006724374,0.0005191982,0.0006898301,0.0005087073,0.00033327623,0.0021113127],"category_scores_gemma":[0.0012722004,0.00026044282,0.00031241024,0.00043815398,0.0006563697,0.001553588,0.0007834014,0.00053249416,0.0003932902],"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.00034881962,0.00007310862,0.0054581743,0.00020845028,0.00003634877,0.00096848287,0.00087021425,0.010311069,0.11779845,0.8335154,0.0013779147,0.029033534],"study_design_scores_gemma":[0.000037990674,0.00013472333,0.004982843,0.000072810144,0.00008638103,0.0010706794,0.00040673764,0.040135223,0.0677869,0.86269826,0.022544008,0.000043434655],"about_ca_topic_score_codex":0.00039104294,"about_ca_topic_score_gemma":0.0010223809,"teacher_disagreement_score":0.0021113127,"about_ca_system_score_codex":0.00050709804,"about_ca_system_score_gemma":0.0003852039,"threshold_uncertainty_score":0.007063031},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8049506,0.001225705,0.14979653,0.0018334665,0.000059435224,0.00010377349,0.0008978968,0.0005419642,0.040590685],"genre_scores_gemma":[0.9713378,0.0006374712,0.019306405,0.00017944726,0.000033582874,0.00006661056,0.00050351134,0.00005592453,0.007879383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944514,0.00008428572,0.000023865423,0.00019730198,0.0001135095,0.00013586087],"domain_scores_gemma":[0.99764097,0.0017534825,0.00019874581,0.0001371399,0.00011615117,0.00015349744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050869933,0.00032904852,0.0004429663,0.0007595671,0.0010245362,0.0017446663,0.00084993534,0.00043073852,0.0020891489],"category_scores_gemma":[0.0029870223,0.00029697182,0.00031480452,0.0005879357,0.0015789948,0.0023258873,0.0014079034,0.0009796624,0.00023818399],"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.0010018894,0.000121558856,0.009125479,0.0009807287,0.00008564135,0.00091558316,0.0020450533,0.1357069,0.06357385,0.686405,0.011473292,0.08856492],"study_design_scores_gemma":[0.00010434727,0.000089653826,0.0044404767,0.00009039732,0.00005022931,0.0008999051,0.00044840507,0.27687347,0.023090161,0.6673611,0.026495991,0.000055899647],"about_ca_topic_score_codex":0.0021268255,"about_ca_topic_score_gemma":0.0034076774,"teacher_disagreement_score":0.0021268255,"about_ca_system_score_codex":0.0020161949,"about_ca_system_score_gemma":0.00058955315,"threshold_uncertainty_score":0.014628649},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7106739,0.00082865683,0.26613995,0.0010408703,0.00010431454,0.000204504,0.0005394333,0.00036338242,0.020105027],"genre_scores_gemma":[0.95296425,0.00033667852,0.043875102,0.00007047292,0.000024866715,0.00010171684,0.00022613941,0.00013831128,0.00226235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992478,0.0002609134,0.000025601932,0.00015996188,0.00010317913,0.00020255355],"domain_scores_gemma":[0.9964831,0.0024436545,0.00039096977,0.00022055187,0.00012782312,0.00033388424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011480006,0.00095139234,0.0010099448,0.00046407856,0.00057989213,0.0011707582,0.0018724503,0.0010699084,0.0051851184],"category_scores_gemma":[0.0067257406,0.0004673189,0.0007785733,0.00077636144,0.0011224524,0.0021397145,0.0010641073,0.0011240419,0.0002720506],"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.00033744363,0.00006797152,0.0007967701,0.00012444635,0.000041918076,0.000076312106,0.00005889574,0.97666794,0.002780575,0.008126551,0.00066426577,0.010256967],"study_design_scores_gemma":[0.000027165255,0.00025583885,0.00062448403,0.000013651982,0.000020822168,0.00005563969,0.00008001608,0.98701406,0.0010514016,0.010387084,0.00046100563,0.000008783451],"about_ca_topic_score_codex":0.002643327,"about_ca_topic_score_gemma":0.003011875,"teacher_disagreement_score":0.0051851184,"about_ca_system_score_codex":0.0012287719,"about_ca_system_score_gemma":0.0007972691,"threshold_uncertainty_score":0.017345965},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9088621,0.0005302287,0.067353025,0.00044733152,0.00004348856,0.000031395743,0.00026319918,0.00013749789,0.022331733],"genre_scores_gemma":[0.98597324,0.0001499117,0.010497921,0.000030697625,0.00000903703,0.000040789357,0.00010391598,0.000027911667,0.003166609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99984205,0.000041235136,0.0000058413634,0.000037041842,0.000030116185,0.000043601696],"domain_scores_gemma":[0.99968946,0.00013246914,0.00007504168,0.000024612718,0.000020815402,0.00005753152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029362077,0.0004058432,0.0003162855,0.00049108575,0.00077212794,0.00085897546,0.000739636,0.0009404464,0.0047785137],"category_scores_gemma":[0.00091625605,0.00034273413,0.00037686218,0.00051648886,0.0015342276,0.00091438624,0.0013104097,0.00069555786,0.00047419657],"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.0008873473,0.00012057391,0.004670822,0.00030764355,0.00006964095,0.0023501427,0.0008237637,0.53316915,0.025285386,0.40802258,0.0032747316,0.021018269],"study_design_scores_gemma":[0.00013351406,0.0005349329,0.0043936907,0.00008806622,0.0000267996,0.0008292128,0.00077956566,0.78009045,0.004397317,0.20143153,0.0071691587,0.00012570602],"about_ca_topic_score_codex":0.002312821,"about_ca_topic_score_gemma":0.0013374112,"teacher_disagreement_score":0.0047785137,"about_ca_system_score_codex":0.00041405967,"about_ca_system_score_gemma":0.00033934126,"threshold_uncertainty_score":0.015985668},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5566565,0.0077190544,0.28512934,0.0057808026,0.00062466256,0.000063463,0.0013870074,0.00030850343,0.14233072],"genre_scores_gemma":[0.96958995,0.0017940535,0.021708185,0.0003251284,0.0005907715,0.00007246188,0.0002508146,0.000099892444,0.0055687088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922013,0.00022828439,0.00003618883,0.00016625554,0.00019726978,0.00015186411],"domain_scores_gemma":[0.99443096,0.003827627,0.000535426,0.00038486885,0.00039541183,0.00042559637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010086977,0.0006638726,0.00066465157,0.0033878444,0.0010815025,0.0028748945,0.0008297074,0.0007406726,0.0058588055],"category_scores_gemma":[0.0058350936,0.0002526452,0.0004980979,0.002434984,0.0038861688,0.0073178615,0.0015962723,0.002129975,0.00058956887],"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.000030360261,0.000020361118,0.000624371,0.0000483178,0.000007615864,0.000048678885,0.00012781392,0.003068358,0.0012773216,0.98863846,0.0009520244,0.0051562367],"study_design_scores_gemma":[0.000005209479,0.000019701041,0.00078571273,0.000032521853,0.000010651242,0.00014679262,0.00008574333,0.013643007,0.00076624943,0.9816228,0.0028554427,0.000026316711],"about_ca_topic_score_codex":0.00077423657,"about_ca_topic_score_gemma":0.00070300366,"teacher_disagreement_score":0.0058588055,"about_ca_system_score_codex":0.0015189664,"about_ca_system_score_gemma":0.00037759022,"threshold_uncertainty_score":0.019599676},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2147155,0.001341694,0.7585372,0.0011081678,0.000121978876,0.00005013456,0.00036185118,0.00072618295,0.023037264],"genre_scores_gemma":[0.8382911,0.0011313804,0.15331297,0.00054725504,0.00025005726,0.0001176363,0.00038184342,0.00052952114,0.005438221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986462,0.000272939,0.00007936988,0.00040190166,0.00029245662,0.00030702053],"domain_scores_gemma":[0.99336123,0.0036046442,0.0007411035,0.0011991618,0.000591994,0.00050193653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00099898,0.0007403158,0.00061733,0.00081206055,0.00071050343,0.002699896,0.0015263887,0.0008767132,0.003287075],"category_scores_gemma":[0.006660929,0.0006731726,0.0010003534,0.0007785959,0.0024065375,0.009576941,0.0033197117,0.002792286,0.00060258585],"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.00012410547,0.000034681507,0.0013437867,0.0001649758,0.000026153972,0.00017419619,0.00057351106,0.0077281627,0.015600408,0.94640046,0.0015047451,0.026324812],"study_design_scores_gemma":[0.000016113847,0.000055174063,0.001144915,0.00006117424,0.000039055154,0.0005235313,0.0002452247,0.038430873,0.0072135,0.9400977,0.012134532,0.000038221344],"about_ca_topic_score_codex":0.0010021611,"about_ca_topic_score_gemma":0.0012184898,"teacher_disagreement_score":0.003287075,"about_ca_system_score_codex":0.001091933,"about_ca_system_score_gemma":0.0006000401,"threshold_uncertainty_score":0.010996342},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5317589,0.0033411207,0.20251961,0.003279666,0.00085129775,0.000122815,0.00061153393,0.00018672356,0.2573284],"genre_scores_gemma":[0.86400604,0.0017394748,0.03802217,0.0004254457,0.00073469576,0.00010637147,0.0005270138,0.00013462268,0.0943042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994103,0.000054215343,0.000024886323,0.00017866775,0.00019372316,0.00013825981],"domain_scores_gemma":[0.99941766,0.00015040996,0.000084324565,0.00004430576,0.00014997226,0.00015332433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057254004,0.0006817468,0.00054884737,0.0019316934,0.0017084237,0.0025604018,0.00075408653,0.0008087457,0.009946054],"category_scores_gemma":[0.0015376507,0.00030247465,0.0005456322,0.0006754871,0.0033446806,0.0047848197,0.0018428067,0.0018335495,0.001326853],"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.000010752045,0.0000056640006,0.0002329659,0.000017014876,0.0000024832912,0.000052735093,0.00022758011,0.0004144018,0.0008274322,0.99334645,0.00062914233,0.004233466],"study_design_scores_gemma":[0.000012039276,0.000039968178,0.0007737905,0.00003974047,0.0000068136246,0.0003043463,0.00036329526,0.007166832,0.0022073532,0.949645,0.039413154,0.000027804743],"about_ca_topic_score_codex":0.0029176483,"about_ca_topic_score_gemma":0.0017718138,"teacher_disagreement_score":0.009946054,"about_ca_system_score_codex":0.0020753457,"about_ca_system_score_gemma":0.0008747423,"threshold_uncertainty_score":0.033272862},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43150958,0.0008528045,0.54425174,0.00081243,0.000057515357,0.000037334805,0.00014746725,0.00025325685,0.022077926],"genre_scores_gemma":[0.91122115,0.0005198349,0.08190988,0.00015436308,0.00007146391,0.000086566564,0.00014984373,0.0001329057,0.005754082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929106,0.00019915315,0.00003743369,0.00018595361,0.00018053451,0.00010582473],"domain_scores_gemma":[0.9961597,0.0025121893,0.00035174668,0.00025753243,0.00032549188,0.00039334127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019808062,0.00038961167,0.00073180354,0.0020137595,0.001367781,0.0016470922,0.0012001913,0.001127341,0.003096198],"category_scores_gemma":[0.011776733,0.0004577785,0.00054407556,0.00095485133,0.002131004,0.0037066187,0.0026502726,0.0016529245,0.0005708424],"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.00007407299,0.000012987072,0.002755536,0.00004920368,0.000013781647,0.00022485845,0.00039535822,0.012113667,0.0044378866,0.9708247,0.00054136105,0.008556632],"study_design_scores_gemma":[0.000011017687,0.000035443976,0.0016208634,0.000041587577,0.0000148905765,0.00040638752,0.0001433418,0.118036814,0.0028072728,0.87441796,0.0024348292,0.000029539548],"about_ca_topic_score_codex":0.00061847374,"about_ca_topic_score_gemma":0.0006609506,"teacher_disagreement_score":0.003096198,"about_ca_system_score_codex":0.0011719826,"about_ca_system_score_gemma":0.00037863047,"threshold_uncertainty_score":0.0104756355},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16367777,0.0014293591,0.82099676,0.0009623523,0.00022211643,0.00006909708,0.00051500107,0.00059181306,0.011535839],"genre_scores_gemma":[0.911548,0.0016378681,0.07602796,0.0003254056,0.0005283798,0.00032002962,0.0010557433,0.00048716876,0.008069419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979407,0.00047448257,0.00011570209,0.00069151627,0.0005179329,0.00025954907],"domain_scores_gemma":[0.9835149,0.011137033,0.0013839887,0.0018544929,0.0016176495,0.00049198675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035366893,0.00061916147,0.0007361998,0.001996537,0.00049726345,0.0017105207,0.0018644823,0.0010028778,0.00636168],"category_scores_gemma":[0.03226379,0.0004988432,0.00079892745,0.00120579,0.0031012695,0.0037081654,0.0016170248,0.0022942198,0.0016218664],"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.00030750845,0.00012786067,0.011062553,0.00040961988,0.00013652608,0.00071984995,0.00048689276,0.08679753,0.032942336,0.80802846,0.0035988581,0.055382125],"study_design_scores_gemma":[0.000042300395,0.00013176816,0.0119992085,0.00019358381,0.00006258024,0.0012628981,0.00016561039,0.46015385,0.010886109,0.5110126,0.0039140317,0.00017541272],"about_ca_topic_score_codex":0.00081915036,"about_ca_topic_score_gemma":0.0006982683,"teacher_disagreement_score":0.00636168,"about_ca_system_score_codex":0.0009885116,"about_ca_system_score_gemma":0.0008562673,"threshold_uncertainty_score":0.021281958},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88237363,0.00030394812,0.08469392,0.00026919506,0.00005973467,0.000042143543,0.000070412505,0.00018830052,0.031998713],"genre_scores_gemma":[0.9817671,0.0001302288,0.013950415,0.000034534558,0.000025685154,0.000019279993,0.000044829896,0.000044192322,0.003983772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996575,0.00007873009,0.000016832433,0.000060601986,0.00010780295,0.000078517],"domain_scores_gemma":[0.99952173,0.00016179153,0.000065988905,0.00008738867,0.00007101661,0.000092095164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005303129,0.00040681774,0.00035620847,0.0016120432,0.00097351323,0.0019040847,0.0006072246,0.0003476579,0.0040640538],"category_scores_gemma":[0.0017824306,0.00023851919,0.00038925395,0.0006754623,0.0023691594,0.0025131723,0.0015447432,0.0009415393,0.000564187],"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.000044692566,0.000018141282,0.0011572586,0.000029783225,0.00000526403,0.00015713925,0.0005649821,0.0038233907,0.0024672085,0.98148525,0.00031677648,0.009930148],"study_design_scores_gemma":[0.000017681701,0.00008900474,0.001208083,0.00002822339,0.000007880561,0.00028168096,0.0004718271,0.032672584,0.0043625874,0.95401704,0.006805825,0.000037486392],"about_ca_topic_score_codex":0.0010493686,"about_ca_topic_score_gemma":0.0010296837,"teacher_disagreement_score":0.0040640538,"about_ca_system_score_codex":0.000805411,"about_ca_system_score_gemma":0.00036819823,"threshold_uncertainty_score":0.013595641},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40757787,0.001221606,0.50820667,0.0011572641,0.00023149587,0.00026990016,0.0034886415,0.0011437457,0.076702796],"genre_scores_gemma":[0.8445064,0.00071549247,0.1229256,0.0004493772,0.00013888648,0.00014108882,0.0044380524,0.0002637863,0.026421234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997019,0.000049967617,0.00001450953,0.00010353304,0.000076628814,0.000053348747],"domain_scores_gemma":[0.99915993,0.00024713125,0.00012684084,0.00021580285,0.0001268279,0.0001234512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017907184,0.00028266723,0.00058570935,0.0006095309,0.0009661452,0.0010974162,0.0006273743,0.0005452218,0.007872545],"category_scores_gemma":[0.0012264958,0.0003377483,0.0003356399,0.0007304752,0.0005808419,0.0016903003,0.00095087674,0.0010612119,0.0012030681],"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.00030266427,0.00010159238,0.0023122604,0.00034243314,0.000060145754,0.00052039284,0.0004974584,0.021352096,0.039862975,0.8236773,0.022396494,0.08857413],"study_design_scores_gemma":[0.00003778201,0.00008317581,0.0020048688,0.00004424804,0.00004576265,0.0008894172,0.00023045922,0.077456586,0.0129086245,0.85835755,0.047904484,0.000037005015],"about_ca_topic_score_codex":0.000924446,"about_ca_topic_score_gemma":0.0028704829,"teacher_disagreement_score":0.007872545,"about_ca_system_score_codex":0.0005918257,"about_ca_system_score_gemma":0.00049143157,"threshold_uncertainty_score":0.026336312},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8412229,0.0008599674,0.11311251,0.00054720824,0.000053603297,0.000026322581,0.00015287673,0.00022466303,0.043799996],"genre_scores_gemma":[0.99140924,0.00020143819,0.0059726243,0.0000390768,0.000012189022,0.000018005961,0.00004284558,0.000007920044,0.0022967393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996517,0.000059637405,0.000029304168,0.0001106527,0.00007703866,0.00007172134],"domain_scores_gemma":[0.9987581,0.00048725848,0.00015393995,0.0002659978,0.00015863685,0.00017608632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041593125,0.00025632224,0.0003568684,0.00055456604,0.00080589467,0.0022532844,0.00031921637,0.0004892838,0.0023186533],"category_scores_gemma":[0.0021936733,0.00013967084,0.00027335915,0.0004306402,0.0020544797,0.002702758,0.0015869183,0.0005697555,0.0002516228],"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.000041978663,0.00000833452,0.0009217739,0.000020539133,0.0000060113625,0.00008714588,0.00036023575,0.0037101854,0.0028842299,0.9873568,0.00017099672,0.0044317762],"study_design_scores_gemma":[0.000017198456,0.000036344052,0.0007934679,0.0000184582,0.000015193079,0.00017763874,0.00052424794,0.02200968,0.0047012405,0.96522886,0.0064627915,0.000014782623],"about_ca_topic_score_codex":0.0009679889,"about_ca_topic_score_gemma":0.0008743848,"teacher_disagreement_score":0.0023186533,"about_ca_system_score_codex":0.00066491705,"about_ca_system_score_gemma":0.00034920048,"threshold_uncertainty_score":0.0077566504},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11183609,0.010077598,0.042440746,0.061582297,0.003429371,0.000028668637,0.0004986249,0.00064078096,0.7694658],"genre_scores_gemma":[0.90408045,0.0026820793,0.008332219,0.009037657,0.0010021075,0.000032143387,0.00021921632,0.00025455453,0.07435964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991979,0.0001863652,0.000022113007,0.00025920305,0.00020450476,0.00012983714],"domain_scores_gemma":[0.9991566,0.00027103582,0.00006021666,0.00019570612,0.00020020067,0.00011615623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097183307,0.0004348715,0.00041135194,0.0007751118,0.002952575,0.0040874756,0.0006391783,0.0016107828,0.009586996],"category_scores_gemma":[0.0028811167,0.0001682496,0.0004829768,0.00080989127,0.0071738246,0.0056224354,0.0020099767,0.002510717,0.001641415],"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.000015865633,0.0000018942436,0.0001811557,0.000011484913,0.0000014960455,0.00003604686,0.00027146627,0.00007938432,0.00007722222,0.98856854,0.0047301757,0.006025221],"study_design_scores_gemma":[0.000008714735,0.000012332765,0.0005488934,0.000055078504,0.000004384385,0.0002446406,0.0005615918,0.0008130482,0.0002947703,0.8893712,0.108071886,0.000013573729],"about_ca_topic_score_codex":0.010775007,"about_ca_topic_score_gemma":0.008115469,"teacher_disagreement_score":0.010775007,"about_ca_system_score_codex":0.0034056876,"about_ca_system_score_gemma":0.0008262773,"threshold_uncertainty_score":0.03207165},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14543794,0.00052049157,0.78411734,0.0020938755,0.00017035553,0.0001860857,0.000784716,0.0015484673,0.06514079],"genre_scores_gemma":[0.77779603,0.0005948757,0.19779235,0.00092208403,0.00013528066,0.00019619631,0.0013243144,0.0004958588,0.020743057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897254,0.0002250633,0.000051994666,0.00030246406,0.00023708185,0.00021082537],"domain_scores_gemma":[0.9953864,0.001962934,0.0004959472,0.0013609196,0.0005063587,0.0002874623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010850991,0.00043128047,0.00048519394,0.00067991286,0.0016168761,0.0023107238,0.0019765622,0.001246562,0.014005181],"category_scores_gemma":[0.0043240804,0.00036519847,0.00056049676,0.0012574064,0.0026463165,0.0054302616,0.00339027,0.0014663725,0.0021950712],"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.00036710087,0.000108114014,0.0015244028,0.00029923004,0.000022848686,0.00015950963,0.0004670735,0.03597418,0.01912031,0.85809064,0.011394352,0.0724723],"study_design_scores_gemma":[0.00008817437,0.00025076413,0.0010374365,0.00006074758,0.000034714645,0.0005861238,0.0003158828,0.1601249,0.026454028,0.77148306,0.039495714,0.0000683985],"about_ca_topic_score_codex":0.0012546399,"about_ca_topic_score_gemma":0.0016483034,"teacher_disagreement_score":0.014005181,"about_ca_system_score_codex":0.002019921,"about_ca_system_score_gemma":0.0011677436,"threshold_uncertainty_score":0.046851993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93794703,0.00040758876,0.055263747,0.0003034864,0.000024204159,0.00004137845,0.00026644426,0.00015714082,0.005589017],"genre_scores_gemma":[0.98822427,0.00015377854,0.009751776,0.00007168294,0.000021702503,0.000055829387,0.00019908187,0.000057843157,0.0014639708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978331,0.0007922509,0.000116588184,0.0004918668,0.00045520664,0.0003109884],"domain_scores_gemma":[0.9807773,0.009756612,0.0033354056,0.0030843944,0.0012809684,0.0017653543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018353489,0.0004640894,0.0007666109,0.001850979,0.0012885334,0.0021816895,0.001867781,0.0011053128,0.002876925],"category_scores_gemma":[0.01647071,0.0006303305,0.0004019021,0.001524369,0.0032177258,0.0034685456,0.0015828498,0.0010855524,0.00030267372],"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.0013020862,0.00013890064,0.022656241,0.00028414192,0.00010326975,0.0005561592,0.0011799941,0.1141121,0.023264231,0.8130116,0.0035333715,0.019857988],"study_design_scores_gemma":[0.00012169995,0.00014113268,0.009972288,0.000040400886,0.000062282386,0.0007189757,0.00046353208,0.486919,0.011238607,0.48625678,0.003977851,0.000087432934],"about_ca_topic_score_codex":0.001962725,"about_ca_topic_score_gemma":0.0018288672,"teacher_disagreement_score":0.002876925,"about_ca_system_score_codex":0.0017621676,"about_ca_system_score_gemma":0.00043342134,"threshold_uncertainty_score":0.012785494},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80269015,0.0007196032,0.07398381,0.0005565453,0.00014388838,0.00004332468,0.00052194763,0.0003215025,0.12101921],"genre_scores_gemma":[0.97183716,0.00034883132,0.0043391655,0.0000876622,0.00010419271,0.000048815607,0.0005988241,0.00008865739,0.022546794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999423,0.00007642559,0.000019394143,0.00013622995,0.0001960202,0.00014899056],"domain_scores_gemma":[0.99944097,0.0001678755,0.000081159786,0.000055363056,0.00007948761,0.00017512418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034812652,0.00045628418,0.00042911337,0.0012559909,0.0011918894,0.0031311188,0.000556703,0.00040076097,0.01173023],"category_scores_gemma":[0.00080381165,0.0003421272,0.00057796284,0.00070891366,0.0018178567,0.003536614,0.0026983775,0.0010481796,0.001199593],"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.00007033762,0.000015530099,0.00065518427,0.000039118844,0.000010538057,0.00018924045,0.00064193615,0.0014473649,0.0029266926,0.9880072,0.0005940422,0.005402807],"study_design_scores_gemma":[0.000055495424,0.00012677553,0.0034875995,0.000039880964,0.000038341303,0.00096093555,0.0010239678,0.015182194,0.006751497,0.9469929,0.025294324,0.000046140853],"about_ca_topic_score_codex":0.0012733254,"about_ca_topic_score_gemma":0.00076974835,"teacher_disagreement_score":0.01173023,"about_ca_system_score_codex":0.0008225693,"about_ca_system_score_gemma":0.00035078538,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3148392,0.0033512781,0.49613783,0.0017633069,0.0013677805,0.00023304092,0.0004321672,0.0012683277,0.18060704],"genre_scores_gemma":[0.8685919,0.0018857433,0.09469828,0.0006348547,0.0007982467,0.00020422664,0.00025798898,0.0006264345,0.032302376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993617,0.00012925646,0.000043615626,0.0000960535,0.0002675606,0.000101841244],"domain_scores_gemma":[0.9991574,0.00033127592,0.00010510616,0.00014030757,0.00018582294,0.00008007747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008662439,0.00075144204,0.00061849057,0.0017389446,0.00094698864,0.0015554862,0.0010832053,0.00069672253,0.0071313847],"category_scores_gemma":[0.0051769908,0.00040757156,0.0010320353,0.0009864081,0.0013357577,0.003168942,0.0012631166,0.0024194322,0.0016670228],"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.000022736614,0.000029136812,0.0003352317,0.00006024836,0.00000849828,0.00019974809,0.00023672379,0.0022521606,0.0054108123,0.9750556,0.0017155297,0.014673627],"study_design_scores_gemma":[0.000018751447,0.000034228036,0.00038177927,0.000042176314,0.000022870216,0.00047913942,0.00006402047,0.061695356,0.007718931,0.91970485,0.009793858,0.000043964425],"about_ca_topic_score_codex":0.0005742917,"about_ca_topic_score_gemma":0.00085802656,"teacher_disagreement_score":0.0071313847,"about_ca_system_score_codex":0.0011800651,"about_ca_system_score_gemma":0.00071146426,"threshold_uncertainty_score":0.023856878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038431577,0.0015164376,0.9498839,0.00045785942,0.000086696076,0.00008541134,0.000065021406,0.00030875893,0.009164435],"genre_scores_gemma":[0.8189036,0.0024754026,0.17119989,0.0002429723,0.0002867351,0.00035533673,0.0001684809,0.00018151091,0.0061860075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974056,0.00103173,0.00014029178,0.0004161033,0.00067912077,0.00032714455],"domain_scores_gemma":[0.9899957,0.00809998,0.0008302081,0.00044811494,0.000378909,0.00024700005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030244626,0.0008815469,0.0012209511,0.00073264685,0.0010999275,0.0017701228,0.0016133914,0.00091475615,0.0017446239],"category_scores_gemma":[0.009002714,0.0005543544,0.0007544808,0.0009948043,0.0021702875,0.0036606814,0.0016956127,0.0011986124,0.0003356215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029803911,0.00006942221,0.00066790736,0.00055103755,0.0001365663,0.0005179726,0.00048577006,0.6240774,0.0074064876,0.33867326,0.0017471428,0.025368884],"study_design_scores_gemma":[0.000068527144,0.00016872192,0.00020689282,0.000030787756,0.000064538435,0.00019699911,0.00010473185,0.85821587,0.0028234555,0.1332047,0.004886815,0.00002802421],"about_ca_topic_score_codex":0.0014908512,"about_ca_topic_score_gemma":0.0009192295,"teacher_disagreement_score":0.0030244626,"about_ca_system_score_codex":0.0011566014,"about_ca_system_score_gemma":0.00088364474,"threshold_uncertainty_score":0.015995085},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053105243,0.00020292685,0.9833007,0.00029078242,0.00014517279,0.00016448977,0.00016544048,0.00072327344,0.009696766],"genre_scores_gemma":[0.1698922,0.0005588757,0.79886293,0.00054500706,0.00019992255,0.0007535725,0.00060798455,0.00089238776,0.0276872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837303,0.00038872453,0.00014049938,0.00039275343,0.000489046,0.0002158755],"domain_scores_gemma":[0.9966017,0.0014743085,0.00017429955,0.0010468122,0.00048171316,0.0002211346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016812531,0.0010896018,0.0008952761,0.0015852607,0.0014204044,0.0022143037,0.00305452,0.0012189948,0.01654278],"category_scores_gemma":[0.007432445,0.00064475357,0.0018375497,0.0013783764,0.0017051623,0.004377425,0.0056494544,0.0030851583,0.0043700393],"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.00036114373,0.00011264365,0.001350651,0.0003418803,0.000074547825,0.0003972922,0.00081327034,0.056596782,0.009137058,0.76045287,0.011110927,0.15925086],"study_design_scores_gemma":[0.00014125346,0.0001441788,0.00025494606,0.0001069953,0.000054896806,0.0004341728,0.00034019578,0.30819637,0.0064750444,0.62115186,0.06263982,0.000060354127],"about_ca_topic_score_codex":0.0019654862,"about_ca_topic_score_gemma":0.0025354922,"teacher_disagreement_score":0.01654278,"about_ca_system_score_codex":0.001155794,"about_ca_system_score_gemma":0.0010834468,"threshold_uncertainty_score":0.055341125},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5812925,0.005212354,0.22072223,0.017151525,0.0016535058,0.00020033684,0.0026140602,0.0037067358,0.16744675],"genre_scores_gemma":[0.9650845,0.0018213174,0.017409008,0.0022281636,0.0005672159,0.00019288115,0.001475946,0.0002620398,0.010958974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987741,0.00014186397,0.00005456221,0.00036603032,0.00022419069,0.0004391949],"domain_scores_gemma":[0.9908393,0.005093447,0.0005283349,0.0015849766,0.0009877309,0.00096624426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012263948,0.0007361212,0.0012453052,0.0016546817,0.0022312955,0.004005112,0.0016022773,0.0022070906,0.0102628125],"category_scores_gemma":[0.014378585,0.0005726565,0.0012947607,0.002357151,0.0031503441,0.009034886,0.0029343895,0.0040396466,0.001589073],"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.00050894707,0.0001108073,0.0036339103,0.00038380903,0.000050448074,0.00027817235,0.00080488774,0.016855009,0.0070388615,0.90622365,0.03248608,0.03162536],"study_design_scores_gemma":[0.0000870784,0.00006611783,0.0012223554,0.00008015653,0.000051037983,0.00032440925,0.0003651693,0.030140337,0.0027954655,0.944085,0.020743538,0.00003938328],"about_ca_topic_score_codex":0.004486757,"about_ca_topic_score_gemma":0.002995048,"teacher_disagreement_score":0.0102628125,"about_ca_system_score_codex":0.0024985597,"about_ca_system_score_gemma":0.0014513162,"threshold_uncertainty_score":0.034332573},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55573183,0.002684666,0.35087556,0.0018221976,0.00063628214,0.00006192603,0.00016964538,0.000151516,0.08786636],"genre_scores_gemma":[0.9594967,0.0012579376,0.022820342,0.00021695811,0.00035949014,0.00004793341,0.00008247604,0.00005898559,0.015659207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996389,0.0000956832,0.000013942013,0.000049447586,0.00013063235,0.000071410715],"domain_scores_gemma":[0.9994469,0.000121998186,0.00009489619,0.00009271128,0.00014053173,0.00010295748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066420704,0.0004227248,0.00050984445,0.0014189706,0.00072769594,0.0018380188,0.0006990766,0.0006036924,0.0030595977],"category_scores_gemma":[0.0013456425,0.00024972466,0.0004657344,0.00066155184,0.0020795392,0.003453888,0.0010408553,0.0011026326,0.0005794234],"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.0000060383545,0.00000816219,0.00008643404,0.000012820701,0.000002562089,0.000032361677,0.00007191237,0.0010639353,0.00084413483,0.9964432,0.00014236246,0.0012861261],"study_design_scores_gemma":[0.000007414128,0.000024640101,0.00018531078,0.00001634485,0.000004737721,0.00013257567,0.00008919403,0.014243737,0.00096927857,0.981625,0.0026854936,0.000016260814],"about_ca_topic_score_codex":0.00057790475,"about_ca_topic_score_gemma":0.0005874884,"teacher_disagreement_score":0.0030595977,"about_ca_system_score_codex":0.0005499164,"about_ca_system_score_gemma":0.00059482537,"threshold_uncertainty_score":0.010235369},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19489366,0.00046260073,0.7882238,0.00034270922,0.00007373599,0.000054606884,0.000105638646,0.0004151544,0.015428124],"genre_scores_gemma":[0.9128266,0.00044814192,0.07793402,0.00007008755,0.00008563573,0.000103050224,0.00012421035,0.00022102465,0.008187234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997063,0.000090745445,0.000016150127,0.000028283705,0.00010095379,0.000057445588],"domain_scores_gemma":[0.9992668,0.00024903158,0.00013346082,0.00010104345,0.00014325441,0.0001064012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000702706,0.0005123563,0.0008004885,0.002570775,0.00067587703,0.0010184054,0.0015021724,0.0006334314,0.0048146737],"category_scores_gemma":[0.0022059807,0.00027215487,0.0010263529,0.00076949014,0.0013002142,0.0019062137,0.0012321485,0.0010589688,0.0005651224],"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.000023594734,0.00004972325,0.0010229023,0.00007024055,0.000027065327,0.00021622083,0.00014953758,0.05240445,0.0026331467,0.9340857,0.0006903008,0.008627037],"study_design_scores_gemma":[0.000011813007,0.00001528284,0.00034494203,0.000018317995,0.000007838556,0.00008623971,0.000037138132,0.7676313,0.00063956087,0.23046677,0.00072322367,0.000017599787],"about_ca_topic_score_codex":0.0020356355,"about_ca_topic_score_gemma":0.0021652016,"teacher_disagreement_score":0.0048146737,"about_ca_system_score_codex":0.0009092561,"about_ca_system_score_gemma":0.00071088166,"threshold_uncertainty_score":0.016106725},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31951293,0.0030749484,0.48653963,0.002944818,0.00088013796,0.00018072636,0.0015385045,0.0018219256,0.18350634],"genre_scores_gemma":[0.799981,0.0017115083,0.14279222,0.0006238792,0.0006007723,0.00015279533,0.0024242885,0.0006803528,0.051033165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928916,0.00013506073,0.00003632054,0.00020888793,0.00022341221,0.0001071779],"domain_scores_gemma":[0.9988803,0.0002897426,0.0000848732,0.00030364012,0.0003053313,0.00013602074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000664905,0.0007207223,0.0007980216,0.001754025,0.0012418063,0.002624692,0.0012002084,0.0009466467,0.012900626],"category_scores_gemma":[0.0024463593,0.0005374262,0.0010347841,0.0017308145,0.0015886668,0.005080372,0.0027542058,0.001959317,0.0023484118],"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.00005471481,0.000022584845,0.0002678095,0.00005828901,0.0000083654595,0.000074578165,0.0002712223,0.0030783203,0.0014076458,0.97160184,0.0040415414,0.019113066],"study_design_scores_gemma":[0.00001897082,0.000057340654,0.00037868027,0.000025772895,0.000018850928,0.00012375994,0.000114416776,0.02209831,0.0011573475,0.9450398,0.03094635,0.000020365283],"about_ca_topic_score_codex":0.0023610597,"about_ca_topic_score_gemma":0.0022359628,"teacher_disagreement_score":0.012900626,"about_ca_system_score_codex":0.0014037036,"about_ca_system_score_gemma":0.0004952233,"threshold_uncertainty_score":0.043156862},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4714963,0.00097503193,0.46676955,0.016427753,0.0002938836,0.0012279291,0.0067771766,0.0030653425,0.032966983],"genre_scores_gemma":[0.74407303,0.00074057607,0.22660105,0.0021731688,0.00026420146,0.00076541404,0.0064576697,0.0007516106,0.018173333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773693,0.0006572016,0.0001282305,0.0008446776,0.00022147686,0.00041155642],"domain_scores_gemma":[0.9922891,0.0055623977,0.00051681005,0.0008251775,0.00021139435,0.00059511623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017835854,0.0014893535,0.0014398949,0.00045305784,0.0018661141,0.0041643,0.0032147528,0.003255071,0.01543778],"category_scores_gemma":[0.0077056084,0.0010147401,0.0024138475,0.0012288205,0.0022918177,0.009939299,0.002436211,0.004219249,0.0019960373],"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.004794002,0.0021234418,0.008698717,0.0028863458,0.0005527814,0.0011558426,0.0021225014,0.2778857,0.035668697,0.3923735,0.062020537,0.20971796],"study_design_scores_gemma":[0.000818958,0.00047895958,0.002058337,0.000105440005,0.0002090384,0.0008939012,0.0007645508,0.30528295,0.013149652,0.6607664,0.015363261,0.00010851805],"about_ca_topic_score_codex":0.0036363427,"about_ca_topic_score_gemma":0.0047013117,"teacher_disagreement_score":0.01543778,"about_ca_system_score_codex":0.003254469,"about_ca_system_score_gemma":0.002984907,"threshold_uncertainty_score":0.051644504},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9326546,0.0017286153,0.028066644,0.0012466836,0.00019864339,0.00004643858,0.00017698367,0.00036080985,0.035520513],"genre_scores_gemma":[0.99128985,0.0003380159,0.004178404,0.000117866046,0.0001686432,0.00003881872,0.00006996352,0.00007666246,0.0037217971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999368,0.00012900654,0.000045092704,0.00014434288,0.00016382498,0.00014964551],"domain_scores_gemma":[0.9927315,0.004451008,0.0009809678,0.00048345583,0.00065437716,0.0006986533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078945543,0.00046979083,0.00058285135,0.0018199232,0.0010886354,0.0019799042,0.00051050045,0.00072027807,0.005063543],"category_scores_gemma":[0.008257446,0.00037193854,0.00053181546,0.00050533225,0.003084799,0.002516816,0.0011494615,0.001451784,0.0007458865],"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.0002495597,0.00007201652,0.0038893076,0.000202121,0.000025696923,0.0006880924,0.0010085109,0.006249116,0.018811127,0.9533619,0.0032904097,0.012151927],"study_design_scores_gemma":[0.000055522873,0.00010716694,0.0019642636,0.000065625645,0.000020016256,0.0004775394,0.00022077608,0.037195288,0.0063386625,0.94923306,0.004281238,0.000040875937],"about_ca_topic_score_codex":0.00057521305,"about_ca_topic_score_gemma":0.00051766087,"teacher_disagreement_score":0.005063543,"about_ca_system_score_codex":0.001074317,"about_ca_system_score_gemma":0.00058499357,"threshold_uncertainty_score":0.016939223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35513398,0.0010478492,0.58167684,0.0014474737,0.00017427393,0.00031827326,0.0040902384,0.0018522169,0.054258868],"genre_scores_gemma":[0.8665431,0.00080844015,0.115400225,0.00070754153,0.00011387929,0.00021761237,0.004069916,0.0002460494,0.011893226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916506,0.00014780703,0.00004722026,0.00027500038,0.00019133781,0.00017371189],"domain_scores_gemma":[0.99822885,0.0005553696,0.00025851914,0.0005289097,0.0002445715,0.00018388305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039148025,0.00038230777,0.00033518393,0.00081237353,0.00067891314,0.0013033417,0.000827229,0.00056505995,0.0052196626],"category_scores_gemma":[0.0015751799,0.0003834471,0.0004270043,0.0010023772,0.0018616617,0.003575519,0.001591304,0.0009877844,0.0007200433],"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.00023114381,0.00017134055,0.0042019053,0.00045839645,0.000070671646,0.001241187,0.00098379,0.010069644,0.029167667,0.81936324,0.01371292,0.12032812],"study_design_scores_gemma":[0.000026059823,0.00005992745,0.002381258,0.0000627298,0.000044330736,0.0013537335,0.00053662475,0.016811013,0.01180288,0.92779946,0.03908047,0.00004146076],"about_ca_topic_score_codex":0.0009773578,"about_ca_topic_score_gemma":0.0010858565,"teacher_disagreement_score":0.0052196626,"about_ca_system_score_codex":0.00048845506,"about_ca_system_score_gemma":0.0006434633,"threshold_uncertainty_score":0.017461538},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65816855,0.009525433,0.21533461,0.020981055,0.0009292132,0.00010429982,0.0003663362,0.000416931,0.094173655],"genre_scores_gemma":[0.9661414,0.0015375146,0.023889331,0.0014074536,0.0005376332,0.000087369524,0.0001621739,0.00007717919,0.0061599696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927014,0.00021237037,0.00006689665,0.00018200358,0.00019100479,0.000077555684],"domain_scores_gemma":[0.9940744,0.004448956,0.00036061555,0.00054602826,0.00034780067,0.00022219421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011479848,0.00025781462,0.0006536467,0.0008410445,0.0014015456,0.0014983047,0.0005309661,0.0014609721,0.0028004344],"category_scores_gemma":[0.009123986,0.0003223139,0.0004887648,0.0008213475,0.003898182,0.0058423947,0.0019498755,0.0018883591,0.0004882051],"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.0001643982,0.00003591847,0.0012819387,0.00015819614,0.000015544148,0.0004186513,0.00090980914,0.0029011315,0.0039574127,0.95980114,0.0034292624,0.026926551],"study_design_scores_gemma":[0.000021261547,0.000037521004,0.0003846486,0.00003555047,0.0000072130865,0.00028112027,0.00022552098,0.005009473,0.0013882528,0.98313165,0.009462396,0.000015424546],"about_ca_topic_score_codex":0.00023182188,"about_ca_topic_score_gemma":0.00015516987,"teacher_disagreement_score":0.0028004344,"about_ca_system_score_codex":0.000663256,"about_ca_system_score_gemma":0.0004418039,"threshold_uncertainty_score":0.00936836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1598303,0.0019760649,0.76224947,0.0030928457,0.00024207166,0.0002723669,0.0021535836,0.0018175765,0.06836572],"genre_scores_gemma":[0.8535085,0.0012227779,0.13568145,0.0006638818,0.0002664703,0.0005487136,0.0011150074,0.0006480433,0.0063452316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970293,0.00074203825,0.00009819667,0.0005859284,0.00086729694,0.00067725277],"domain_scores_gemma":[0.9762591,0.018465942,0.0013757325,0.0022768218,0.00095070316,0.0006716714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002800108,0.0017667692,0.001694254,0.0023265004,0.0012958705,0.002931241,0.0035381939,0.001550435,0.013765606],"category_scores_gemma":[0.027848825,0.0011977546,0.0012783447,0.002530436,0.0026067446,0.0071002864,0.0032975103,0.0038331735,0.0020289372],"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.0009483546,0.00039000987,0.009558351,0.0013315363,0.00027410933,0.0006350321,0.0007169754,0.5064657,0.021076867,0.3412669,0.027310817,0.09002526],"study_design_scores_gemma":[0.00007287649,0.00007679834,0.0015143777,0.00011031193,0.000076595206,0.0003502987,0.00020044466,0.56807834,0.0068599065,0.41835248,0.004241846,0.00006569981],"about_ca_topic_score_codex":0.0027310213,"about_ca_topic_score_gemma":0.006093711,"teacher_disagreement_score":0.013765606,"about_ca_system_score_codex":0.0036034537,"about_ca_system_score_gemma":0.0020112991,"threshold_uncertainty_score":0.04605055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36470592,0.0009622991,0.5031256,0.0007399198,0.00085903483,0.00008284117,0.00045725293,0.00024854863,0.1288186],"genre_scores_gemma":[0.8179712,0.00084392057,0.11280787,0.00036707442,0.00046330967,0.00012446998,0.00057836686,0.00017773647,0.06666613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972016,0.000047278176,0.000011118067,0.000048309743,0.00011015047,0.000063087275],"domain_scores_gemma":[0.9997248,0.000027740494,0.000020243593,0.00003975439,0.00011854555,0.000068866924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004386655,0.0005158854,0.00043136126,0.0011163555,0.0006947397,0.0011427375,0.0007521574,0.0003726716,0.008504674],"category_scores_gemma":[0.000463237,0.00018489543,0.00046724762,0.00042583016,0.0011672704,0.0014514675,0.0007953372,0.0013725647,0.0017428949],"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.000024486106,0.000031164887,0.00012191299,0.000023669054,0.0000042362035,0.00005939695,0.00007654394,0.00078589784,0.007008503,0.9800602,0.00073372555,0.011070345],"study_design_scores_gemma":[0.000024189814,0.000117562726,0.0006392857,0.000024877361,0.000012996456,0.0003947892,0.00016689967,0.02055326,0.01260614,0.9408599,0.024563594,0.000036498088],"about_ca_topic_score_codex":0.0004625465,"about_ca_topic_score_gemma":0.0006104358,"teacher_disagreement_score":0.008504674,"about_ca_system_score_codex":0.00057691545,"about_ca_system_score_gemma":0.0006208257,"threshold_uncertainty_score":0.028450906},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26308972,0.0028612365,0.29409343,0.029947584,0.004425982,0.00024276445,0.0015587274,0.0020684272,0.40171215],"genre_scores_gemma":[0.8670392,0.0015543434,0.0741039,0.0069314656,0.0006238048,0.00023931224,0.0004823144,0.00035600012,0.04866964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939036,0.00012634548,0.00003442711,0.00017585349,0.00017829075,0.00009469158],"domain_scores_gemma":[0.99749666,0.001232098,0.0002536412,0.00043181877,0.00040474194,0.00018093463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007593582,0.00028914184,0.0002471874,0.0006743142,0.0015726598,0.0013597575,0.000988596,0.0009463383,0.013506431],"category_scores_gemma":[0.0048279436,0.00027611683,0.0005077953,0.0007973801,0.0022479948,0.0037507282,0.0012729646,0.0013423017,0.00135054],"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.00018087412,0.0000103043585,0.0017817101,0.00019173912,0.000019809979,0.00036468406,0.00094222307,0.0022630526,0.005054316,0.9266075,0.028353151,0.03423066],"study_design_scores_gemma":[0.000043896824,0.000043759766,0.002873589,0.00011043946,0.00003007932,0.0010126012,0.0009296764,0.0047308463,0.006256854,0.8276648,0.15625867,0.000044732526],"about_ca_topic_score_codex":0.0033389805,"about_ca_topic_score_gemma":0.0046760067,"teacher_disagreement_score":0.013506431,"about_ca_system_score_codex":0.0011861806,"about_ca_system_score_gemma":0.00043449315,"threshold_uncertainty_score":0.04518354},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47068676,0.002806459,0.23358758,0.012828961,0.0008936899,0.0002860008,0.003960858,0.0010499335,0.27389976],"genre_scores_gemma":[0.9279672,0.0020538047,0.040428992,0.002150547,0.00015326109,0.00014087412,0.0020594476,0.00014987237,0.024895944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952316,0.000058316728,0.000030116948,0.00015051683,0.00011155728,0.00012631106],"domain_scores_gemma":[0.9983816,0.00072854647,0.00020268721,0.00023416396,0.00028411282,0.00016886817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004191937,0.00037649178,0.00034093618,0.00064814155,0.0008089295,0.0010856036,0.00069098384,0.0005535943,0.007659395],"category_scores_gemma":[0.002865455,0.0002997952,0.00033460697,0.0008622474,0.0011550032,0.0022220216,0.00072071265,0.00086874346,0.0010628444],"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.0004360028,0.00005531008,0.0040497105,0.0005046702,0.0000363111,0.00093658635,0.0004923161,0.036329463,0.024388755,0.8457276,0.03478413,0.052259084],"study_design_scores_gemma":[0.0000813472,0.000110739,0.007876457,0.0001663582,0.000043572545,0.0024916846,0.001014522,0.06513295,0.033402227,0.70949525,0.18010502,0.00007991192],"about_ca_topic_score_codex":0.0017592316,"about_ca_topic_score_gemma":0.003990826,"teacher_disagreement_score":0.007659395,"about_ca_system_score_codex":0.0014404998,"about_ca_system_score_gemma":0.00086543127,"threshold_uncertainty_score":0.025623262},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12572889,0.01893556,0.6140739,0.04300125,0.0046297098,0.00030905538,0.0018531127,0.00097583927,0.19049275],"genre_scores_gemma":[0.7011444,0.020527361,0.22357579,0.013751344,0.008453649,0.0007794698,0.0016527142,0.00069729367,0.029418014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981571,0.00048942637,0.00009859335,0.0005161453,0.0004556281,0.00028313263],"domain_scores_gemma":[0.99011445,0.0073191887,0.00054854143,0.0006946276,0.0009190134,0.0004043123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025280013,0.00074949715,0.0007885337,0.0025936463,0.0022443123,0.0024456694,0.0014935439,0.0019767475,0.009455269],"category_scores_gemma":[0.013252097,0.000411541,0.0009007694,0.0045954227,0.0060830377,0.02005987,0.0040620645,0.00403538,0.0010665536],"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.000024829249,0.0000067433284,0.00021788845,0.00008690202,0.0000059817376,0.00006181164,0.00028746523,0.0020623263,0.0004563015,0.9811866,0.0075485557,0.008054626],"study_design_scores_gemma":[0.000009885411,0.000012986818,0.00023886951,0.000026242451,0.0000044973362,0.000086933185,0.000104280836,0.004224488,0.0002989724,0.9739828,0.02099688,0.00001315175],"about_ca_topic_score_codex":0.0034642697,"about_ca_topic_score_gemma":0.0018822209,"teacher_disagreement_score":0.009455269,"about_ca_system_score_codex":0.0026303977,"about_ca_system_score_gemma":0.00078127824,"threshold_uncertainty_score":0.031630993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2941556,0.005214369,0.51747924,0.059926607,0.0010046918,0.0003232601,0.0022494022,0.0060248785,0.113621876],"genre_scores_gemma":[0.81099236,0.002623237,0.16071865,0.0044226088,0.0006942472,0.00028853555,0.0017289001,0.0017346079,0.01679694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923173,0.0019744984,0.00031676507,0.0019002061,0.0026369863,0.00085417175],"domain_scores_gemma":[0.9523707,0.028545449,0.0024137706,0.012386665,0.0033195333,0.0009638068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036616272,0.0011662312,0.0013476695,0.0006850737,0.0016868254,0.0043550692,0.003512785,0.002664813,0.020241458],"category_scores_gemma":[0.037373845,0.0011334539,0.0017292266,0.0013112499,0.004149318,0.017866325,0.0051005394,0.0063790837,0.003942769],"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.00069865654,0.00025311252,0.0045444462,0.0008931331,0.00011201693,0.0005884512,0.0011490794,0.048595607,0.01754608,0.55244815,0.043301895,0.3298695],"study_design_scores_gemma":[0.0001156428,0.00027228965,0.0011456916,0.00017425092,0.00008704611,0.00088960864,0.0007744877,0.06446556,0.009662483,0.8664146,0.055928532,0.00006987497],"about_ca_topic_score_codex":0.00222337,"about_ca_topic_score_gemma":0.0022366438,"teacher_disagreement_score":0.020241458,"about_ca_system_score_codex":0.0018758399,"about_ca_system_score_gemma":0.0014193889,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27510732,0.00094973855,0.6814221,0.0018004233,0.00020901604,0.00030889566,0.0007894858,0.00046240987,0.038950555],"genre_scores_gemma":[0.78829193,0.00070728565,0.19423382,0.00022967599,0.000078308345,0.000299504,0.0008316439,0.00020691403,0.015120934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995209,0.00013005213,0.000019638755,0.00013153219,0.00008322542,0.000114694885],"domain_scores_gemma":[0.99940586,0.00031263626,0.00008759571,0.00006673025,0.00004450686,0.00008267691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042641594,0.0008245913,0.00087085523,0.00040690927,0.00078327634,0.0009764782,0.0011470638,0.0013191943,0.0060920827],"category_scores_gemma":[0.0020279894,0.00038088064,0.0008294861,0.0006664441,0.00097324373,0.001615009,0.00086118083,0.0011155254,0.00049649173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002655148,0.00015560967,0.0016824593,0.00021347131,0.00005979045,0.00039776516,0.00025824783,0.7872526,0.0038762789,0.15536612,0.0066988766,0.0437732],"study_design_scores_gemma":[0.000049335402,0.00014197928,0.00050467014,0.000026639289,0.000020801994,0.00017256901,0.00013663042,0.89479506,0.001280053,0.095424466,0.0074294237,0.000018343748],"about_ca_topic_score_codex":0.0039380137,"about_ca_topic_score_gemma":0.0032216494,"teacher_disagreement_score":0.0060920827,"about_ca_system_score_codex":0.0011281181,"about_ca_system_score_gemma":0.0008749836,"threshold_uncertainty_score":0.02038002},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76187813,0.00094788993,0.11940903,0.001997948,0.0002561393,0.000118633165,0.00055101694,0.0005504883,0.114290796],"genre_scores_gemma":[0.9452544,0.0003511496,0.029213687,0.00050743483,0.0001943207,0.0001501587,0.0004471949,0.00016101073,0.023720691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942124,0.00010952098,0.000052209114,0.00010787958,0.00013751218,0.00017170851],"domain_scores_gemma":[0.99816173,0.0009646749,0.00028064032,0.00027604448,0.00020832299,0.00010856911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037749627,0.00039206308,0.0004186324,0.0006509878,0.0012618076,0.002679915,0.0004918088,0.0007807163,0.008263493],"category_scores_gemma":[0.0032775046,0.00031935272,0.00054003036,0.00054537517,0.001890655,0.0042240834,0.001368336,0.0014459698,0.0021153148],"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.00016406649,0.000031425032,0.00080493896,0.0000777003,0.000006772033,0.00022741238,0.0005436663,0.0017490024,0.0073941504,0.96943,0.0025383348,0.017032515],"study_design_scores_gemma":[0.000051488503,0.0000818695,0.0006458404,0.000051378334,0.000020122905,0.00048990006,0.00036562615,0.0060017062,0.009180596,0.96335506,0.01971665,0.00003969998],"about_ca_topic_score_codex":0.00036354052,"about_ca_topic_score_gemma":0.00047271405,"teacher_disagreement_score":0.008263493,"about_ca_system_score_codex":0.0007034601,"about_ca_system_score_gemma":0.00043848445,"threshold_uncertainty_score":0.027644157},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4235771,0.0017735998,0.3912849,0.0009920843,0.000694705,0.00011529223,0.00034279664,0.00060209096,0.18061744],"genre_scores_gemma":[0.92061067,0.0009314677,0.047335602,0.0004544519,0.00044933282,0.0001030557,0.00028990555,0.0003680153,0.029457493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992679,0.0001742104,0.000055016437,0.00017977678,0.00019676963,0.00012629975],"domain_scores_gemma":[0.99931514,0.00024054946,0.00011951363,0.00010160067,0.00014459109,0.00007857076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054260454,0.0005519252,0.00041824533,0.001745817,0.0010375907,0.0024801902,0.00057277555,0.0007891874,0.0060260263],"category_scores_gemma":[0.0022388124,0.00027377598,0.000509483,0.0011436663,0.0024556057,0.0047773775,0.0012624598,0.0011529811,0.0014684951],"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.00001537258,0.000005291818,0.00009049807,0.000011324981,0.0000014478813,0.0000794307,0.00019350051,0.000516323,0.00109775,0.9940977,0.00023982633,0.0036515375],"study_design_scores_gemma":[0.000009992076,0.000044598204,0.0002651364,0.00002164429,0.000006995753,0.0002522755,0.00017201922,0.006046995,0.0034715103,0.9689002,0.02078112,0.000027574859],"about_ca_topic_score_codex":0.0004516483,"about_ca_topic_score_gemma":0.00028032987,"teacher_disagreement_score":0.0060260263,"about_ca_system_score_codex":0.0009413205,"about_ca_system_score_gemma":0.00037067468,"threshold_uncertainty_score":0.020159066},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93450534,0.00020673493,0.05167902,0.00029477404,0.000069029076,0.000037358837,0.00008662168,0.00027584497,0.012845257],"genre_scores_gemma":[0.9893734,0.00007647967,0.008061229,0.000057643127,0.00001829905,0.000041552732,0.00007264106,0.00003689061,0.0022618703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901175,0.00019252558,0.00014848649,0.00022474394,0.0002312143,0.00019132452],"domain_scores_gemma":[0.9941532,0.0033679153,0.0005608649,0.00093048206,0.0004457546,0.00054174935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011808359,0.00038306642,0.0007265367,0.0010089211,0.001004534,0.0023540156,0.0006005684,0.00090379594,0.0030030836],"category_scores_gemma":[0.005393761,0.0004353792,0.00074489054,0.00038497263,0.003410378,0.004018287,0.0029202783,0.0012308119,0.00037823725],"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.0009787888,0.00010706719,0.0040290016,0.0001662043,0.000033808374,0.0013514719,0.0013913794,0.008138085,0.03839757,0.9310682,0.0004725849,0.01386579],"study_design_scores_gemma":[0.00025560783,0.0007180508,0.0024110724,0.000102986916,0.00010701206,0.0019316706,0.0012343882,0.06737578,0.05924246,0.8592236,0.007253558,0.00014380396],"about_ca_topic_score_codex":0.00050720875,"about_ca_topic_score_gemma":0.00031052582,"teacher_disagreement_score":0.0030030836,"about_ca_system_score_codex":0.0007092648,"about_ca_system_score_gemma":0.00039324537,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38335168,0.0017375458,0.47610784,0.002680135,0.00030011707,0.00009265749,0.00026051843,0.0006989159,0.13477059],"genre_scores_gemma":[0.9465283,0.0010383832,0.039417148,0.0006188577,0.0002678094,0.00008938877,0.0001904516,0.00022840378,0.011621319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872905,0.00038823983,0.000048439564,0.00025033968,0.00037890283,0.00020490336],"domain_scores_gemma":[0.9926416,0.00495153,0.0005219961,0.00082461734,0.00047920342,0.0005810601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001108303,0.00069568516,0.00060837215,0.0019239071,0.0016699146,0.001875847,0.0012386492,0.0009703162,0.010997777],"category_scores_gemma":[0.007254919,0.0007278371,0.00074062875,0.00147018,0.0030357318,0.004627822,0.0023424893,0.0024064826,0.0008752404],"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.000053253687,0.000020106578,0.00037657956,0.00004807721,0.000008352129,0.000121582874,0.0002213153,0.0041026454,0.0016910966,0.9839512,0.0013998067,0.008006021],"study_design_scores_gemma":[0.000012782194,0.000023430233,0.00028453147,0.000021412987,0.000009872426,0.00017611163,0.000107473825,0.014727609,0.0016977291,0.97897685,0.003944815,0.000017309254],"about_ca_topic_score_codex":0.0014458487,"about_ca_topic_score_gemma":0.0019603055,"teacher_disagreement_score":0.010997777,"about_ca_system_score_codex":0.0017458942,"about_ca_system_score_gemma":0.0005728886,"threshold_uncertainty_score":0.036791205},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2091009,0.002223493,0.35723436,0.0031301752,0.0018689444,0.00022966212,0.0024159832,0.0008584953,0.422938],"genre_scores_gemma":[0.7274758,0.0016347448,0.14224687,0.0016478978,0.0009902631,0.0004458701,0.0030223178,0.00036563678,0.12217054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948657,0.000101867474,0.000034515968,0.00015716677,0.00012817513,0.00009161914],"domain_scores_gemma":[0.999627,0.00010524003,0.00008124955,0.000073001305,0.00006099743,0.000052481875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033758063,0.0008534604,0.00042498324,0.00085333554,0.0012579826,0.0018535788,0.0006860436,0.00056832505,0.028538533],"category_scores_gemma":[0.0008943421,0.00029982236,0.0009105045,0.0010449019,0.0014522563,0.0026873145,0.0018598045,0.0011908602,0.0044251145],"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.000052922027,0.000052959134,0.000384538,0.0000983786,0.000011812611,0.00021623992,0.00020561274,0.001778502,0.0032339916,0.95768857,0.010153566,0.026122866],"study_design_scores_gemma":[0.000012168744,0.000035874935,0.0005336686,0.00001629994,0.00001073596,0.00038497275,0.000096100935,0.005215804,0.00180501,0.9446508,0.047215905,0.00002251321],"about_ca_topic_score_codex":0.0012277418,"about_ca_topic_score_gemma":0.001661973,"teacher_disagreement_score":0.028538533,"about_ca_system_score_codex":0.0007851057,"about_ca_system_score_gemma":0.00034922812,"threshold_uncertainty_score":0.095470905},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28651547,0.001533155,0.68969584,0.0007965676,0.0002371978,0.000084656785,0.0001794813,0.00016910871,0.020788506],"genre_scores_gemma":[0.8652574,0.0021918584,0.12047596,0.00030692742,0.0003211205,0.00015842254,0.00024669553,0.000099646066,0.01094205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989421,0.00034351353,0.00007125185,0.00014390195,0.00030713523,0.00019223036],"domain_scores_gemma":[0.99369437,0.0040627834,0.0006190005,0.00050686445,0.0007955806,0.00032132075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010591313,0.0008303821,0.00049860217,0.0018875971,0.0011163333,0.001288161,0.0008629836,0.0012155251,0.001540958],"category_scores_gemma":[0.007926324,0.00032634274,0.0004336065,0.0022346824,0.0027232803,0.0028838878,0.0022285478,0.0014639663,0.00043207343],"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.00010247026,0.000026353156,0.0006118035,0.00009771106,0.000009346013,0.00024224252,0.0005282741,0.05052221,0.0036502937,0.91925275,0.001111167,0.02384534],"study_design_scores_gemma":[0.000027488859,0.000115441195,0.00027714804,0.00006244064,0.0000124729995,0.0003579779,0.0002372957,0.14922428,0.003977756,0.84118813,0.0044762054,0.000043458014],"about_ca_topic_score_codex":0.0010489938,"about_ca_topic_score_gemma":0.00088096753,"teacher_disagreement_score":0.0018875971,"about_ca_system_score_codex":0.0009894359,"about_ca_system_score_gemma":0.0006006769,"threshold_uncertainty_score":0.0071789026},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7819968,0.0015970868,0.19742894,0.00080555014,0.00006102341,0.000059359125,0.00042928802,0.00041554205,0.017206298],"genre_scores_gemma":[0.9823583,0.00048120908,0.012740088,0.00013256543,0.00007130447,0.000048182006,0.00021312712,0.00008462643,0.0038705545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949384,0.00010737963,0.000016958229,0.00010285769,0.00011557589,0.00016341505],"domain_scores_gemma":[0.99434197,0.0034452328,0.0007260887,0.00043021038,0.00037517227,0.0006813184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010719574,0.0004106154,0.0006134222,0.0011874066,0.0009067074,0.0016905916,0.0013287758,0.00084819796,0.0038423538],"category_scores_gemma":[0.008915799,0.0005879878,0.0005705003,0.0006401504,0.0017370194,0.0025472064,0.0015037403,0.0013791476,0.00045658284],"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.0001748339,0.000052738626,0.0071474886,0.00015723117,0.00004879275,0.00034224708,0.00073177606,0.06696501,0.013364363,0.8883979,0.0031155965,0.019502059],"study_design_scores_gemma":[0.00005049626,0.00011445867,0.005196436,0.000054018255,0.000046992427,0.0004884676,0.0002746573,0.47798738,0.0035185735,0.5077819,0.004427989,0.00005855211],"about_ca_topic_score_codex":0.0025597117,"about_ca_topic_score_gemma":0.0028081187,"teacher_disagreement_score":0.0038423538,"about_ca_system_score_codex":0.0017582112,"about_ca_system_score_gemma":0.00056291965,"threshold_uncertainty_score":0.01285398},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1255461,0.0009803099,0.84447545,0.0002977731,0.00014685806,0.00008655573,0.000045883426,0.00019159784,0.028229445],"genre_scores_gemma":[0.54586965,0.0017010857,0.43225926,0.00016197552,0.00015455429,0.0001723032,0.00010257324,0.00020204997,0.019376505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944776,0.00019322023,0.00003402175,0.00005114883,0.00021917115,0.00005457043],"domain_scores_gemma":[0.99835086,0.00094905554,0.000086997585,0.00026007975,0.00024623246,0.00010681015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015380906,0.00047507047,0.0005345833,0.0007263903,0.0005002638,0.00073442725,0.00070179946,0.00048309538,0.0017169375],"category_scores_gemma":[0.0047009774,0.00026123042,0.0008893158,0.00064563047,0.0015461964,0.0012619501,0.0015486401,0.0016327718,0.00033536373],"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.00020359806,0.00009414641,0.0015107212,0.00016863264,0.000019131967,0.0003005511,0.0007649543,0.19336715,0.008855021,0.6988054,0.00084957486,0.0950612],"study_design_scores_gemma":[0.000036212346,0.00019665595,0.0006223238,0.00008535964,0.000014803068,0.00022764025,0.00008250852,0.82470626,0.0042574983,0.15811394,0.011627648,0.000029183057],"about_ca_topic_score_codex":0.0024059194,"about_ca_topic_score_gemma":0.0028980896,"teacher_disagreement_score":0.0024059194,"about_ca_system_score_codex":0.000885305,"about_ca_system_score_gemma":0.0006539536,"threshold_uncertainty_score":0.008134365},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78857976,0.00090936985,0.1390735,0.0024399837,0.00023555371,0.00008956919,0.0017668064,0.0010051868,0.06590021],"genre_scores_gemma":[0.94698477,0.00058675563,0.04265975,0.00030939435,0.00012364406,0.00010765109,0.0011728674,0.0002677886,0.007787477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802136,0.00037077165,0.00010904482,0.00047505047,0.0005535868,0.0004701966],"domain_scores_gemma":[0.9897877,0.0062273913,0.000813676,0.0020086942,0.00046746695,0.000695103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013658499,0.0005686539,0.0009326062,0.001428343,0.0014974873,0.0026530253,0.001367344,0.0008080481,0.013114],"category_scores_gemma":[0.00875909,0.00065068033,0.0010707128,0.0014864433,0.0026857264,0.0033990908,0.0026372331,0.0016566237,0.0012182025],"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.001385814,0.00020748777,0.027070444,0.0006871316,0.00012173985,0.0005884507,0.0008599522,0.07437147,0.026364518,0.7357102,0.014549433,0.11808331],"study_design_scores_gemma":[0.00017494733,0.00026165732,0.011381723,0.0001367104,0.0001412746,0.0014408737,0.0005073235,0.20621222,0.018321665,0.7396972,0.021625793,0.00009869471],"about_ca_topic_score_codex":0.0009862497,"about_ca_topic_score_gemma":0.0016384902,"teacher_disagreement_score":0.013114,"about_ca_system_score_codex":0.0012618329,"about_ca_system_score_gemma":0.0007160833,"threshold_uncertainty_score":0.043870747},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8307654,0.00029485225,0.15768531,0.0006895054,0.000036996284,0.00002949837,0.00072342117,0.00015880348,0.009616124],"genre_scores_gemma":[0.9864249,0.00021614131,0.009717088,0.0001065134,0.000057103935,0.00007085138,0.00050924055,0.00003496777,0.002863148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987847,0.00028340175,0.0000773152,0.00032479188,0.0002994758,0.00023043276],"domain_scores_gemma":[0.97933096,0.015224191,0.0020870413,0.001731552,0.0009413934,0.0006848714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00216272,0.00031544323,0.0007920223,0.0018913759,0.0009412146,0.0020290918,0.0012232081,0.0007936093,0.0054433346],"category_scores_gemma":[0.014925786,0.00035662387,0.0006221881,0.0022271548,0.003630577,0.0032992598,0.0012510838,0.0014101343,0.00044635579],"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.00022201028,0.00004954947,0.019791987,0.00008594446,0.00003628091,0.00027410247,0.000886392,0.018176924,0.004893101,0.94007057,0.0011728058,0.014340317],"study_design_scores_gemma":[0.000047015325,0.00013239148,0.012168343,0.000057723053,0.000030255896,0.0005739356,0.00039630404,0.11614319,0.0041212877,0.86342585,0.0028257056,0.00007801449],"about_ca_topic_score_codex":0.0011395845,"about_ca_topic_score_gemma":0.0012800856,"teacher_disagreement_score":0.0054433346,"about_ca_system_score_codex":0.0012107891,"about_ca_system_score_gemma":0.00059278397,"threshold_uncertainty_score":0.018209755},"labels":[],"label_agreement":null}]}