{"meta":{"query_hash":"d7e185dcc2e7","filters":{"venue":"European Journal of Combinatorics"},"cohort_total":219,"direct_labels_cover":0,"predictions_cover":219,"exported":219,"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/d7e185dcc2e7","api":"https://metacan.xera.ac/api/v1/cohort?venue=European+Journal+of+Combinatorics"},"results":[{"id":"W1502715615","doi":"10.1016/j.ejc.2015.05.006","title":"Palindromic sequences generated from marked morphisms","year":2015,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"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; Grantová Agentura České Republiky","keywords":"Morphism; Mathematics; Palindrome; Alphabet; Combinatorics; Combinatorics on words; Fixed point; Class (philosophy); Aperiodic graph; Order (exchange); Discrete mathematics; Sequence (biology); Geometry","score_opus":0.03061910790872446,"score_gpt":0.21986033904549562,"score_spread":0.18924123113677116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502715615","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85217804,0.0013078647,0.13632879,0.0006689796,0.003799775,0.00004630701,0.000003010799,0.00009253122,0.0055747363],"genre_scores_gemma":[0.99104565,0.00005103969,0.008251175,0.00026162196,0.00021531575,1.678628e-7,0.000001702939,0.000018732653,0.00015459723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978849,0.0007493573,0.000509911,0.00017402729,0.00047953153,0.00020224835],"domain_scores_gemma":[0.99841714,0.00009625864,0.00048119426,0.00038663088,0.00032890475,0.00028986417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020373622,0.00014888948,0.00024348745,0.0001231971,0.0000604822,0.00022099802,0.0015980297,0.000025095069,0.000016357106],"category_scores_gemma":[0.00013980761,0.00012045855,0.00009141669,0.00036755088,0.000046650992,0.00052659627,0.00020739448,0.00025829347,0.00011538998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035450232,0.0017417578,0.010136589,0.000037866466,0.0008816727,0.029276688,0.012126107,0.003384775,0.04173694,0.5434964,0.20960334,0.14722338],"study_design_scores_gemma":[0.015457655,0.0040644747,0.03612322,0.0005152691,0.00016455461,0.002913097,0.000938671,0.09334224,0.018948669,0.70980495,0.1153392,0.002387994],"about_ca_topic_score_codex":0.0000046624486,"about_ca_topic_score_gemma":1.2048102e-7,"teacher_disagreement_score":0.16630857,"about_ca_system_score_codex":0.00007024545,"about_ca_system_score_gemma":0.00014701547,"threshold_uncertainty_score":0.4912157},"labels":[],"label_agreement":null},{"id":"W1539787319","doi":"10.1016/j.ejc.2016.11.001","title":"On excluded minors of connectivity 2 for the class of frame matroids","year":2016,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"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","keywords":"Matroid; Combinatorics; Class (philosophy); Minor (academic); Mathematics; Frame (networking); Binary number; Set (abstract data type); Graphic matroid; Discrete mathematics; Computer science; Artificial intelligence; Arithmetic; Humanities","score_opus":0.01546122094561451,"score_gpt":0.21814366560072188,"score_spread":0.20268244465510737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1539787319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9298808,0.0018398927,0.048908655,0.000098361874,0.007832828,0.0003938174,0.00008127981,0.000038321232,0.010926057],"genre_scores_gemma":[0.9994697,0.00012473666,0.000043784534,0.000008565135,0.00018531612,0.0000026072155,9.145732e-7,0.000071422204,0.000092979826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980136,0.00045804767,0.00088893936,0.00011891918,0.00033767318,0.00018281708],"domain_scores_gemma":[0.99711025,0.001020355,0.0009337742,0.00050574867,0.00035272175,0.000077166755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022577888,0.00025177022,0.00063411164,0.00018093316,0.000040362207,0.000020425088,0.0007947009,0.00009711261,0.000011795607],"category_scores_gemma":[0.00026312677,0.00016345218,0.00049227953,0.000108744425,0.0000918307,0.000045579163,0.00011137322,0.0006381476,0.0000039363445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001101145,0.0007043256,0.0011480612,0.0049124975,0.0031699026,0.000102699574,0.0026609038,0.035471074,0.016286314,0.90742916,0.02020095,0.0068129585],"study_design_scores_gemma":[0.010354034,0.005015529,0.014925196,0.008410482,0.0011970169,0.00019449981,0.0008430421,0.0036705295,0.06324505,0.85610586,0.034224607,0.0018141532],"about_ca_topic_score_codex":4.773806e-7,"about_ca_topic_score_gemma":1.3399772e-7,"teacher_disagreement_score":0.069588885,"about_ca_system_score_codex":0.00005898416,"about_ca_system_score_gemma":0.00003936226,"threshold_uncertainty_score":0.6665386},"labels":[],"label_agreement":null},{"id":"W1596628413","doi":"10.1016/j.ejc.2015.04.006","title":"The diameter of type <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si106.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>D</mml:mi></mml:math> associahedra and the non-leaving-face property","year":2015,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Ministerio de Ciencia e Innovación; Agence Nationale de la Recherche","keywords":"Type (biology); Geodesic; Combinatorics; Mathematics; Graph; Polytope; Discrete mathematics; Geometry; Geology","score_opus":0.028879694720775888,"score_gpt":0.26128883140475917,"score_spread":0.23240913668398328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596628413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98798054,0.00061281375,0.0028183411,0.00049816427,0.0025056559,0.00013037203,0.000008776965,0.0000476079,0.005397727],"genre_scores_gemma":[0.99489796,0.00036969793,0.0035954453,0.0001315375,0.0004056318,0.000010199534,0.0000028775673,0.00017817538,0.000408476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99644345,0.00050312845,0.001170893,0.0002629138,0.0011430916,0.00047650567],"domain_scores_gemma":[0.9946229,0.0018320652,0.0019217159,0.000852299,0.00050681905,0.00026419692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004081371,0.0003443056,0.00044943418,0.0000722882,0.00039906308,0.00025650125,0.0010493827,0.00015777531,0.0000046090536],"category_scores_gemma":[0.0054704305,0.00022874954,0.00034271812,0.0003467876,0.0004457901,0.0003670245,0.00053470785,0.00086949987,0.00010396858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037677458,0.00023885898,0.00001883742,0.00017029552,0.00027222678,0.00014391802,0.002298847,0.00008080122,0.00014824433,0.9932177,0.00260565,0.00042781554],"study_design_scores_gemma":[0.016350303,0.0058246977,0.00019098113,0.002318973,0.0020173371,0.0016154152,0.0054108724,0.43943298,0.006478762,0.4863204,0.032408293,0.0016309817],"about_ca_topic_score_codex":0.0000069469925,"about_ca_topic_score_gemma":0.0000026142977,"teacher_disagreement_score":0.50689733,"about_ca_system_score_codex":0.000047560006,"about_ca_system_score_gemma":0.00030123486,"threshold_uncertainty_score":0.9328136},"labels":[],"label_agreement":null},{"id":"W1695953772","doi":"10.1016/j.ejc.2015.06.005","title":"Improved complexity results on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-coloring <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si5.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math>-free graphs","year":2015,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph coloring; Vertex (graph theory); Complete coloring; Graph; Induced subgraph; Discrete mathematics; Line graph","score_opus":0.03197586937708036,"score_gpt":0.2621459650223334,"score_spread":0.23017009564525304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1695953772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8107993,0.0021431886,0.0034344946,0.0012564226,0.008551617,0.00013408168,0.0005837213,0.00048217466,0.172615],"genre_scores_gemma":[0.98277026,0.002357879,0.006290856,0.0019265189,0.003345054,0.0004886514,0.0007525557,0.0016092563,0.00045898164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.97768176,0.002065478,0.0049192375,0.0035211267,0.006808025,0.0050043757],"domain_scores_gemma":[0.9794554,0.0037320685,0.006353144,0.0061103455,0.00096600514,0.0033830146],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.009453803,0.002117013,0.0010344215,0.0015312243,0.0034807916,0.0037110632,0.008535828,0.002506399,0.016215626],"category_scores_gemma":[0.006802146,0.0035236622,0.0037720113,0.0034968122,0.0035188587,0.0042964644,0.007081145,0.00585061,0.0032719374],"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.0062297974,0.0012708709,0.000029740255,0.001315384,0.0022345618,0.007236511,0.0033608177,0.0042440523,0.002404765,0.88027424,0.08895098,0.002448311],"study_design_scores_gemma":[0.010740627,0.010396455,0.00036367856,0.0037483105,0.0020973028,0.0051479004,0.0026095822,0.4596281,0.4876924,0.0035833549,0.009919058,0.0040732524],"about_ca_topic_score_codex":0.0007827634,"about_ca_topic_score_gemma":0.00058830454,"teacher_disagreement_score":0.87669086,"about_ca_system_score_codex":0.000098803706,"about_ca_system_score_gemma":0.0036594728,"threshold_uncertainty_score":0.999193},"labels":[],"label_agreement":null},{"id":"W1717529143","doi":"10.1016/j.ejc.2015.10.007","title":"Noncrossing partitions and Bruhat order","year":2015,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Coxeter group; Bijection, injection and surjection; Bruhat order; Coxeter element; Combinatorics; Mathematics; Lattice (music); Element (criminal law); Point group; Coxeter complex; Order (exchange); Bijection; Longest element of a Coxeter group; Pure mathematics; Physics; Artin group","score_opus":0.09802077523028978,"score_gpt":0.3421907827603641,"score_spread":0.24417000753007428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1717529143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70122564,0.006593062,0.21304998,0.0012931672,0.021987507,0.0010918604,0.00004645388,0.00037595356,0.05433635],"genre_scores_gemma":[0.9529596,0.0003305475,0.04493964,0.000053262713,0.00083932927,0.0000030304536,0.0000043610153,0.00024699754,0.0006232386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99643743,0.00068542024,0.0014357652,0.00028138713,0.0008070555,0.0003529212],"domain_scores_gemma":[0.99418354,0.0005387919,0.0021948586,0.00068675453,0.001989694,0.00040635435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030374106,0.00045821877,0.0009512322,0.0002438477,0.00017002493,0.00032770424,0.00072308077,0.0001438372,0.0000146785005],"category_scores_gemma":[0.0036670999,0.00042176468,0.00019579103,0.0002895308,0.00018184433,0.00024203457,0.0010603268,0.001645958,0.000019714947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011096277,0.0012933686,0.00031294348,0.0017639402,0.0005608697,0.0016724521,0.0058447514,0.0005345422,0.00010916295,0.9307879,0.05414496,0.0028641392],"study_design_scores_gemma":[0.0014290296,0.00027641797,0.000043897526,0.0007412378,0.0002545925,0.00030850322,0.00020372841,0.00010954026,0.00007563838,0.98658985,0.0095526455,0.0004149041],"about_ca_topic_score_codex":4.824282e-7,"about_ca_topic_score_gemma":2.8761903e-7,"teacher_disagreement_score":0.25173393,"about_ca_system_score_codex":0.00024259603,"about_ca_system_score_gemma":0.00042067425,"threshold_uncertainty_score":0.9998234},"labels":[],"label_agreement":null},{"id":"W1781781209","doi":"10.1016/j.ejc.2016.12.005","title":"Hardness of computing clique number and chromatic number for Cayley graphs","year":2017,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Circulant matrix; Mathematics; Cayley graph; Discrete mathematics; Chordal graph; Clique; Indifference graph; Quotient; Clique problem; Pathwidth; Graph; 1-planar graph; Line graph","score_opus":0.016793337465747682,"score_gpt":0.2496986862510314,"score_spread":0.2329053487852837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1781781209","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96392107,0.00080195535,0.012428535,0.000014888504,0.006701509,0.00027612038,0.000021646118,0.000054033837,0.015780231],"genre_scores_gemma":[0.9988245,0.00021484395,0.00056347146,0.000006215258,0.00019211657,0.0000015113795,0.0000039347647,0.00010406543,0.000089351095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797136,0.0003544171,0.0010211616,0.00016485534,0.00025392373,0.00023426274],"domain_scores_gemma":[0.9977224,0.00015123768,0.0011435699,0.00046302966,0.0003678678,0.00015190631],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022578642,0.00031789544,0.00083881844,0.00011425028,0.0001184201,0.00012356513,0.00066482,0.00011374548,0.000007502963],"category_scores_gemma":[0.00013696945,0.00030567555,0.0003331693,0.000069387905,0.00009177211,0.000108166736,0.00020454153,0.00071871607,0.000007615189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066001964,0.0016314699,0.1239348,0.07918575,0.010757679,0.0020930301,0.036975637,0.0352866,0.004257296,0.61978734,0.063829646,0.021600746],"study_design_scores_gemma":[0.01800355,0.0013101707,0.08980755,0.033393003,0.0025380396,0.0049985657,0.0017872285,0.020504827,0.007217,0.77329665,0.041503843,0.00563958],"about_ca_topic_score_codex":0.0000018576263,"about_ca_topic_score_gemma":2.38453e-7,"teacher_disagreement_score":0.15350932,"about_ca_system_score_codex":0.00003949917,"about_ca_system_score_gemma":0.000042333966,"threshold_uncertainty_score":0.99993956},"labels":[],"label_agreement":null},{"id":"W1791216447","doi":"10.1016/j.ejc.2015.08.001","title":"Fast recoloring of sparse graphs","year":2015,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université de Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Graph coloring; Mathematics; Edge coloring; List coloring; Complete coloring; Fractional coloring; Discrete mathematics; Conjecture; Graph; Planar graph; Greedy coloring; Brooks' theorem; Bounded function; Vertex (graph theory); Graph power; Line graph","score_opus":0.05956010983609713,"score_gpt":0.2941333767780692,"score_spread":0.2345732669419721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1791216447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3137354,0.0052466164,0.6118752,0.0005732441,0.0150701385,0.00053230225,0.00001595057,0.00016128802,0.05278991],"genre_scores_gemma":[0.9827642,0.0004644768,0.016319368,0.000020886706,0.0001305539,9.841712e-7,0.0000010944792,0.00005717442,0.0002412492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99544483,0.0014649222,0.0011530357,0.0003501489,0.0011957941,0.00039129006],"domain_scores_gemma":[0.994353,0.00021194115,0.0018507376,0.0011692329,0.0020186682,0.00039640095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.006258804,0.00030529,0.0006848439,0.0008177476,0.00006760902,0.00014139555,0.0045609986,0.00007559002,0.00000503006],"category_scores_gemma":[0.0006137703,0.00028354162,0.00035867697,0.0008166077,0.0001510682,0.00042186055,0.002986331,0.0018428199,0.000023458528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025463878,0.00106202,0.0039537395,0.00054981856,0.0005634094,0.004353992,0.003455024,0.014988326,0.00068740954,0.9069626,0.008828145,0.05434093],"study_design_scores_gemma":[0.0017426367,0.0014326618,0.002242532,0.0007412434,0.000048340316,0.00028671144,0.000116159725,0.0011526073,0.0014830782,0.9825641,0.007608791,0.00058112544],"about_ca_topic_score_codex":7.4502486e-7,"about_ca_topic_score_gemma":1.8941725e-7,"teacher_disagreement_score":0.6690288,"about_ca_system_score_codex":0.00015559625,"about_ca_system_score_gemma":0.0004546846,"threshold_uncertainty_score":0.9999617},"labels":[],"label_agreement":null},{"id":"W1817870969","doi":"10.1016/j.ejc.2015.09.006","title":"Intersection theorems for multisets","year":2015,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"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":"Multiset; Mathematics; Combinatorics; Intersection (aeronautics); Homomorphism; Graph; Family of sets; Discrete mathematics; Structured program theorem; Set (abstract data type); Computer science","score_opus":0.11506094032244622,"score_gpt":0.33122726990632767,"score_spread":0.21616632958388143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1817870969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8505054,0.0003135495,0.10517161,0.00014337251,0.008250087,0.00020970276,0.000004657434,0.000048377962,0.035353236],"genre_scores_gemma":[0.9953884,0.000008828522,0.0039471295,0.000047596135,0.00030672702,4.2754743e-7,4.4112022e-7,0.000036040892,0.00026442032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885035,0.00030357164,0.00041222374,0.00007260978,0.00022960249,0.00013164154],"domain_scores_gemma":[0.9985544,0.00025088384,0.0004178614,0.00016492257,0.00047226495,0.00013966316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023501927,0.00010613366,0.00019418872,0.00011052552,0.0000857907,0.000029754485,0.00029161977,0.00002294226,0.000006124388],"category_scores_gemma":[0.0012349492,0.00007788502,0.00014966048,0.00009548339,0.000047657097,0.000113415015,0.000060248192,0.00019428013,0.0000029808775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017547896,0.000094863004,0.00022727074,0.000025883628,0.000063137326,0.00004675929,0.0025611422,0.000009226666,0.00006085625,0.9745165,0.019194363,0.0030244908],"study_design_scores_gemma":[0.0019303116,0.0007152502,0.00023019456,0.000042124022,0.000045559547,0.0001588387,0.00044107405,0.000059347476,0.00034547865,0.973191,0.022733156,0.000107642474],"about_ca_topic_score_codex":1.24418e-7,"about_ca_topic_score_gemma":8.264581e-8,"teacher_disagreement_score":0.14488298,"about_ca_system_score_codex":0.000055642042,"about_ca_system_score_gemma":0.00002682668,"threshold_uncertainty_score":0.31760588},"labels":[],"label_agreement":null},{"id":"W1863544524","doi":"10.1016/j.ejc.2016.01.002","title":"On inversion sets and the weak order in Coxeter groups","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Coxeter group; Mathematics; Joins; Inversion (geology); Longest element of a Coxeter group; Coxeter complex; Combinatorics; Point group; Coxeter element; Pure mathematics; Artin group","score_opus":0.022593962566356443,"score_gpt":0.26253153948247315,"score_spread":0.23993757691611672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1863544524","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96062654,0.00018969715,0.017916951,0.002793355,0.0020963852,0.00033408523,0.000001792905,0.00003762581,0.01600354],"genre_scores_gemma":[0.9981983,0.0001343385,0.0011407773,0.00011791466,0.00007036246,9.490329e-7,7.5713515e-8,0.00005075523,0.0002865449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977468,0.0007630568,0.0006826382,0.00013102625,0.000460589,0.000215894],"domain_scores_gemma":[0.996361,0.0023590482,0.000605872,0.00032923522,0.0002379445,0.0001068841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002379349,0.00019037892,0.00038594735,0.00015305661,0.00007406604,0.00003475141,0.0004035182,0.000035321857,0.000018270719],"category_scores_gemma":[0.0031748055,0.00009590941,0.00008351914,0.00026489355,0.00015478986,0.00019408918,0.00015095758,0.00034955592,0.000030767576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002588048,0.00017907118,0.00015335635,0.000032676,0.000024933686,0.00011576439,0.0005987083,0.0000024523733,0.00006845039,0.99416465,0.0028521987,0.0015489155],"study_design_scores_gemma":[0.009099621,0.00040411853,0.0001876113,0.00040108516,0.000030322612,0.00007826594,0.00012390541,0.00004123323,0.000121409175,0.98723614,0.0021286695,0.00014762729],"about_ca_topic_score_codex":1.8201848e-7,"about_ca_topic_score_gemma":2.7811825e-7,"teacher_disagreement_score":0.037571713,"about_ca_system_score_codex":0.00010334762,"about_ca_system_score_gemma":0.000029174118,"threshold_uncertainty_score":0.39110723},"labels":[],"label_agreement":null},{"id":"W1871929648","doi":"10.1016/j.ejc.2015.05.001","title":"Flag algebras and the stable coefficients of the Jones polynomial","year":2015,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"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; Combinatorics; Conjecture; Graph; Polynomial; Planar graph; Flag (linear algebra); Discrete mathematics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.03799076350958117,"score_gpt":0.25516937756499586,"score_spread":0.2171786140554147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871929648","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9847898,0.0011132602,0.0016283308,0.00122843,0.0017062088,0.00011263879,0.0000018930796,0.00000751068,0.00941191],"genre_scores_gemma":[0.9986228,0.000035742247,0.00017409469,0.00007987781,0.00010654874,1.6709052e-7,8.310152e-8,0.000018434619,0.00096224906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807036,0.0007571726,0.00052587636,0.000071598675,0.00041375015,0.00016126409],"domain_scores_gemma":[0.9981363,0.0005102913,0.0006785665,0.00024757933,0.00032335173,0.00010392615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030286892,0.000106818996,0.00030829894,0.000097851,0.00009249758,0.000027489605,0.0005236215,0.000023236851,0.000012144378],"category_scores_gemma":[0.0021673888,0.000053246404,0.00010476029,0.00041152432,0.00032281165,0.000059798924,0.00021293222,0.00027293887,0.000005889609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049264973,0.00065015047,0.009344834,0.00007779433,0.000265411,0.000082866645,0.006187617,0.000046948535,0.00008723011,0.8738223,0.10609397,0.002848268],"study_design_scores_gemma":[0.039235298,0.002113588,0.024579398,0.00027755878,0.00074325595,0.0014763222,0.0066845613,0.0002112936,0.0025548046,0.7994285,0.122034594,0.0006608056],"about_ca_topic_score_codex":0.0000028000748,"about_ca_topic_score_gemma":2.9884797e-7,"teacher_disagreement_score":0.07439374,"about_ca_system_score_codex":0.000024213308,"about_ca_system_score_gemma":0.000090508285,"threshold_uncertainty_score":0.25947234},"labels":[],"label_agreement":null},{"id":"W1897016437","doi":"10.1016/j.ejc.2016.04.005","title":"Positive independence densities of finite rank countable hypergraphs are achieved by finite hypergraphs","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Science Foundation","keywords":"Mathematics; Countable set; Combinatorics; Rank (graph theory); Independence (probability theory); Discrete mathematics; Independence number; Graph; Statistics","score_opus":0.01560923728923203,"score_gpt":0.23327514059379265,"score_spread":0.21766590330456062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1897016437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.980358,0.0015494023,0.008166096,0.00025634878,0.0014343148,0.00015347294,0.00012692915,0.000040063438,0.007915349],"genre_scores_gemma":[0.9975582,0.00070036727,0.0006660743,0.00014989445,0.0000856868,6.3686394e-7,0.0000013362807,0.00007166395,0.00076614204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966879,0.00086875766,0.0010143259,0.00021512798,0.0008539162,0.00035999378],"domain_scores_gemma":[0.99479365,0.0020857244,0.0014859923,0.0004523659,0.0009962305,0.00018601112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001938974,0.00032415352,0.000673322,0.00031243794,0.00023243207,0.000043230197,0.00075900083,0.000092812654,0.00005155573],"category_scores_gemma":[0.0013194118,0.00021372492,0.00033993655,0.00039133968,0.0003254852,0.0003421123,0.00017926228,0.00048466172,0.0000068577306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018657362,0.0012323302,0.039164227,0.00040986793,0.0016562366,0.0013954579,0.0063945386,0.00004988567,0.019025838,0.8898799,0.03384755,0.00507843],"study_design_scores_gemma":[0.007915202,0.0020317344,0.013252465,0.0018917838,0.0004976119,0.00048111673,0.0015728568,0.000024023204,0.020566728,0.9423564,0.008364843,0.0010452084],"about_ca_topic_score_codex":0.0000018223652,"about_ca_topic_score_gemma":6.877396e-7,"teacher_disagreement_score":0.052476525,"about_ca_system_score_codex":0.000057641915,"about_ca_system_score_gemma":0.000063506464,"threshold_uncertainty_score":0.87154496},"labels":[],"label_agreement":null},{"id":"W1963693997","doi":"10.1016/j.ejc.2013.06.043","title":"Graph partitions with prescribed patterns","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"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","keywords":"Mathematics; Combinatorics; Induced subgraph isomorphism problem; Graph homomorphism; Homomorphism; Partition (number theory); Induced subgraph; Discrete mathematics; Graph; Distance-hereditary graph; Factor-critical graph; Line graph; Voltage graph","score_opus":0.01618968927603948,"score_gpt":0.23112680411656777,"score_spread":0.2149371148405283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963693997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18221794,0.00018799986,0.8092193,0.0009092196,0.00038985498,0.000144124,0.0000011421312,0.000059046408,0.006871376],"genre_scores_gemma":[0.9940922,0.000045153625,0.005464353,0.00010086875,0.00004506652,0.0000022541246,3.413279e-7,0.000020906595,0.00022881562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818814,0.0005159359,0.0003393956,0.00014938734,0.0005166912,0.00029042942],"domain_scores_gemma":[0.99828595,0.0001088574,0.00026474966,0.00045827986,0.0006271475,0.00025503186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070941326,0.00012335356,0.00016150955,0.00023356472,0.00012201651,0.00021478851,0.0012982151,0.000011645783,0.000040525887],"category_scores_gemma":[0.000066721994,0.000090624766,0.00008231688,0.000586116,0.000071052564,0.0010639868,0.0001756432,0.00037452104,0.000107849584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060619634,0.0009321601,0.027215464,0.00005599992,0.00022784637,0.0019662362,0.001943012,0.00092622923,0.0014248823,0.9268252,0.014133564,0.02428879],"study_design_scores_gemma":[0.0055253496,0.0057906914,0.17371309,0.00039702954,0.000047303212,0.0013079321,0.00032259812,0.0010306105,0.0036285908,0.7825755,0.02466097,0.0010003358],"about_ca_topic_score_codex":0.0000010799899,"about_ca_topic_score_gemma":2.3864445e-7,"teacher_disagreement_score":0.81187433,"about_ca_system_score_codex":0.000026251228,"about_ca_system_score_gemma":0.00004611154,"threshold_uncertainty_score":0.36955708},"labels":[],"label_agreement":null},{"id":"W1964184952","doi":"10.1016/j.ejc.2010.10.009","title":"Commutativity conditions for groups arising from acyclic directed graphs and posets","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Eulerian path; Mathematics; Commutative property; Combinatorics; Abelian group; Directed acyclic graph; Parity (physics); Discrete mathematics; Cayley graph; Directed graph; Graph; Pure mathematics; Lagrangian; Physics","score_opus":0.0470906586337946,"score_gpt":0.3339807573313563,"score_spread":0.2868900986975617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964184952","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9943417,0.00008068109,0.002474942,0.00024068083,0.0006802045,0.000181895,0.00006535035,0.000060349365,0.0018742082],"genre_scores_gemma":[0.99424446,0.000024958103,0.0054731336,0.000037280704,0.00008513248,0.0000015359695,0.000012105439,0.00006314942,0.000058242927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797493,0.00076875655,0.00053172937,0.00014095106,0.00033357367,0.0002500847],"domain_scores_gemma":[0.9943226,0.0042429105,0.00047654947,0.0003089861,0.00043465878,0.00021431436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002544136,0.00016652972,0.00034632132,0.0002172344,0.00027050372,0.00012932904,0.0004021279,0.00004675666,0.000035056786],"category_scores_gemma":[0.0032054135,0.00015000427,0.00013148648,0.0002421178,0.00018445846,0.0002404607,0.000118503034,0.00089975505,0.000007721108],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025953059,0.0010956075,0.008053279,0.00012244671,0.0003508841,0.00034790754,0.002928002,9.834558e-7,0.04931864,0.9248145,0.008982082,0.003726119],"study_design_scores_gemma":[0.0020738537,0.00036222933,0.021974796,0.00006692219,0.000083299994,0.00011321866,0.00015355552,0.00013046514,0.0009846016,0.9723549,0.0015257042,0.00017647557],"about_ca_topic_score_codex":0.0000017428962,"about_ca_topic_score_gemma":0.0000042694155,"teacher_disagreement_score":0.04833404,"about_ca_system_score_codex":0.00002482008,"about_ca_system_score_gemma":0.000037827704,"threshold_uncertainty_score":0.61169964},"labels":[],"label_agreement":null},{"id":"W1964393859","doi":"10.1016/j.ejc.2012.07.003","title":"On the removal lemma for linear systems over Abelian groups","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Mathematics; Abelian group; Coprime integers; Lemma (botany); Integer (computer science); Combinatorics; Order (exchange); Elementary abelian group; Group (periodic table); Extension (predicate logic); Discrete mathematics; Matrix (chemical analysis)","score_opus":0.017823009999461344,"score_gpt":0.2064599083475682,"score_spread":0.18863689834810685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964393859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95330364,0.003922448,0.007997316,0.00006560629,0.011412366,0.0002358692,0.000007319457,0.00007586106,0.022979595],"genre_scores_gemma":[0.99870694,0.000037711852,0.000031478434,0.00004150119,0.0008306872,0.0000015471704,6.9757044e-7,0.00006291445,0.0002865408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986589,0.00033688193,0.0004361351,0.000054532135,0.0002444697,0.00026906191],"domain_scores_gemma":[0.99910724,0.0002624663,0.00017513164,0.00022195268,0.000094600065,0.00013859985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025864884,0.0001494232,0.00020468644,0.00009263241,0.00010308112,0.000048271704,0.00033016913,0.000028709685,0.000009831592],"category_scores_gemma":[0.000099777695,0.00009920608,0.00015927626,0.00016775566,0.000021773065,0.00015167588,0.000016050602,0.00029808978,0.00005625363],"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.000058197118,0.00010294433,0.00031019672,0.0001359254,0.00016416184,0.0000715232,0.0007150358,0.0028312344,0.0007668592,0.9646116,0.029797496,0.0004348407],"study_design_scores_gemma":[0.0028286977,0.0010351738,0.0025121632,0.0005959725,0.000137575,0.0010179736,0.0007415668,0.0048362743,0.00096529705,0.009972869,0.9747196,0.0006368334],"about_ca_topic_score_codex":1.8905949e-7,"about_ca_topic_score_gemma":1.9276243e-8,"teacher_disagreement_score":0.9546387,"about_ca_system_score_codex":0.00004465864,"about_ca_system_score_gemma":0.0000065325703,"threshold_uncertainty_score":0.40455064},"labels":[],"label_agreement":null},{"id":"W1964586680","doi":"10.1016/j.ejc.2008.09.026","title":"Positivity results on ribbon Schur function differences","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Schur product theorem; Schur's theorem; Partially ordered set; Skew; Combinatorics; Schur's lemma; Schur complement; Regular polygon; Schur decomposition; Pure mathematics; Geometry; Orthogonal polynomials; Physics","score_opus":0.0764879347411226,"score_gpt":0.2787453871676308,"score_spread":0.20225745242650822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964586680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9372549,0.000098921446,0.01765471,0.00024066542,0.0036173477,0.00017266814,0.00000628249,0.00010973586,0.040844776],"genre_scores_gemma":[0.9966851,0.00009277314,0.0021196334,0.00005055904,0.00037589137,7.305957e-7,9.642414e-7,0.00006732819,0.000607005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967617,0.00073215447,0.0010799324,0.00021134557,0.0009139038,0.00030099362],"domain_scores_gemma":[0.99613476,0.0012940976,0.0013365501,0.00047595927,0.00055090117,0.00020771734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016532195,0.00029242926,0.0005379035,0.00021795311,0.00026216474,0.00004073632,0.0004991672,0.000055389755,0.000010810022],"category_scores_gemma":[0.0032797402,0.00023963946,0.00020695067,0.00037324298,0.00010005746,0.00028615177,0.00009355213,0.00069640105,0.000073005554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013492602,0.0023691154,0.0008322885,0.000108205306,0.00019514268,0.0015856475,0.0015182272,0.000033854947,0.00064706575,0.97281736,0.016229292,0.002314527],"study_design_scores_gemma":[0.0056037945,0.005043208,0.011590902,0.0004324639,0.00013350914,0.0006425329,0.00014912983,0.000051255163,0.0015225478,0.96858263,0.0057281824,0.00051983504],"about_ca_topic_score_codex":3.3641982e-7,"about_ca_topic_score_gemma":1.12614885e-7,"teacher_disagreement_score":0.059430223,"about_ca_system_score_codex":0.00014305548,"about_ca_system_score_gemma":0.00007250203,"threshold_uncertainty_score":0.97722137},"labels":[],"label_agreement":null},{"id":"W1964729600","doi":"10.1016/j.ejc.2007.11.007","title":"Majority functions on structures with finite duality","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; University of the Fraser Valley","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Unanimity; Duality (order theory); Combinatorics; Bounded function; Strong duality; Path (computing); Discrete mathematics; Pure mathematics; Optimization problem; Mathematical analysis; Mathematical optimization","score_opus":0.03352257192047073,"score_gpt":0.25745444317490584,"score_spread":0.22393187125443512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964729600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29969326,0.00016422741,0.68005586,0.00052180083,0.0010200515,0.000089895875,0.0000030500703,0.00007391317,0.018377928],"genre_scores_gemma":[0.9950539,0.00003863776,0.0041813157,0.000118446325,0.00008763788,2.790291e-7,3.8252745e-7,0.000017117753,0.00050229765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777424,0.00073986955,0.00033337247,0.00018252553,0.0007262153,0.0002437441],"domain_scores_gemma":[0.9982291,0.00029424342,0.000290881,0.00051259436,0.00046418296,0.00020900891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010751883,0.00014047952,0.00019122702,0.000225298,0.00030890584,0.00006371623,0.0010108509,0.000016211952,0.00001189806],"category_scores_gemma":[0.00023431859,0.00010257177,0.000086506865,0.00070504483,0.00014345447,0.00042901025,0.00014308472,0.00063323794,0.000042699074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035193158,0.0005259063,0.008513696,0.000020298747,0.00012052661,0.005007524,0.001069201,0.0038592222,0.00014258783,0.9680994,0.005065063,0.0072246213],"study_design_scores_gemma":[0.009246884,0.014021446,0.3495147,0.00018854691,0.000051326722,0.0060883993,0.0002308614,0.0010457371,0.0029983488,0.5161383,0.09912798,0.001347474],"about_ca_topic_score_codex":3.7486052e-7,"about_ca_topic_score_gemma":1.3583222e-7,"teacher_disagreement_score":0.6953606,"about_ca_system_score_codex":0.00005486248,"about_ca_system_score_gemma":0.00010257354,"threshold_uncertainty_score":0.41827554},"labels":[],"label_agreement":null},{"id":"W1969286931","doi":"10.1016/j.ejc.2006.07.008","title":"The cone condition and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>t</mml:mi></mml:math>-designs","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"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":"Scroll; Mathematics; Combinatorics; Theology","score_opus":0.011731601163762295,"score_gpt":0.2086038448841361,"score_spread":0.19687224372037382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969286931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9884475,0.0013570752,0.0015135754,0.00007170081,0.001653569,0.00003416305,0.000015923952,0.00007396654,0.0068325447],"genre_scores_gemma":[0.998855,0.00034661166,0.00008010377,0.00006373132,0.000428891,0.0000053293065,0.000015700949,0.00009960708,0.000105001905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821305,0.00022609229,0.00063963654,0.00016245269,0.00042055594,0.00033821448],"domain_scores_gemma":[0.99873674,0.0002914033,0.000415408,0.00032088291,0.000082138955,0.0001534285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013295765,0.00022096875,0.00018136122,0.00008288072,0.0003796902,0.0002552,0.00035453594,0.0001031054,0.000009065243],"category_scores_gemma":[0.00009947299,0.00021336916,0.00021315238,0.00018861344,0.0001521282,0.00029662513,0.00008056766,0.00048932084,0.0001541471],"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.0000723248,0.000057093184,0.000028056813,0.00009176929,0.00013116933,0.00039478616,0.00022985485,0.0014677722,0.0018447846,0.99337405,0.0020565633,0.00025178902],"study_design_scores_gemma":[0.0062361117,0.002589711,0.0034037533,0.0013594116,0.00074809557,0.0040105763,0.0015886668,0.85108215,0.015311843,0.027763596,0.08445802,0.001448041],"about_ca_topic_score_codex":0.0000058284845,"about_ca_topic_score_gemma":0.0000029412165,"teacher_disagreement_score":0.96561044,"about_ca_system_score_codex":0.000015588263,"about_ca_system_score_gemma":0.0000443765,"threshold_uncertainty_score":0.8700942},"labels":[],"label_agreement":null},{"id":"W1969885991","doi":"10.1016/j.ejc.2012.07.010","title":"Computing regularities in strings: A survey","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computation; Mathematics; Combinatorics; Algorithm","score_opus":0.02669545516524006,"score_gpt":0.24501842042849722,"score_spread":0.21832296526325717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969885991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28359276,0.0018837258,0.7087188,0.00010056915,0.0026320985,0.000049478145,0.0000019023514,0.0000348233,0.0029858889],"genre_scores_gemma":[0.9908955,0.000038142167,0.008820507,0.000052375057,0.00014199705,4.2828127e-8,0.0000010027445,0.000011120019,0.000039287683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9979926,0.0007988987,0.00048160736,0.00009748042,0.00034995787,0.00027948408],"domain_scores_gemma":[0.99886817,0.0001796426,0.00034953994,0.00027809173,0.0001732072,0.0001513257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044765742,0.00010507721,0.00019708474,0.00018173689,0.000069266425,0.00012563274,0.0009755665,0.000017126913,0.0000025472082],"category_scores_gemma":[0.0001926678,0.000090480404,0.000049698974,0.0004205534,0.000021725995,0.0009707418,0.00043743613,0.00030489473,0.0000120409295],"study_design_candidate":"observational","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.0000688017,0.0016970228,0.4180209,0.00007939035,0.000076725635,0.0010665493,0.0072582318,0.00056532637,0.00028866704,0.4414792,0.019287512,0.11011165],"study_design_scores_gemma":[0.0014803746,0.00028308417,0.976354,0.00022471166,0.000005068311,0.0002830673,0.00010334124,0.0037827077,0.0002191611,0.0031908776,0.01377695,0.00029664853],"about_ca_topic_score_codex":0.0000066311827,"about_ca_topic_score_gemma":3.6023619e-7,"teacher_disagreement_score":0.70730275,"about_ca_system_score_codex":0.00005056332,"about_ca_system_score_gemma":0.000040405164,"threshold_uncertainty_score":0.3689684},"labels":[],"label_agreement":null},{"id":"W1969922647","doi":"10.1016/j.ejc.2009.06.005","title":"Hypergroupoids determined by lattices","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Associative property; Combinatorics; Pure mathematics","score_opus":0.045777245504680465,"score_gpt":0.3178118181212804,"score_spread":0.2720345726165999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969922647","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91386294,0.0013368209,0.002570581,0.0014718677,0.0016237897,0.000041917836,0.000002821317,0.00002557471,0.07906366],"genre_scores_gemma":[0.9963755,0.00005532476,0.00022569078,0.0007157063,0.00015801679,4.17721e-8,3.8830373e-7,0.0000131405495,0.0024562133],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99637514,0.0010392189,0.0009554826,0.00016988548,0.0012420098,0.00021823545],"domain_scores_gemma":[0.9973827,0.0008382562,0.0006985495,0.00036475668,0.00047649167,0.00023924967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070709484,0.00014021338,0.00032058105,0.00021752415,0.00012994625,0.0002497173,0.001384613,0.000027859112,0.00009534077],"category_scores_gemma":[0.002596966,0.000097784694,0.00018723535,0.00053327787,0.000065386055,0.00047535752,0.000056795143,0.0003121516,0.0002671721],"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.0005410584,0.0013924206,0.0073752073,0.0000088924435,0.00008539782,0.002938313,0.0026394464,0.000094859715,0.012155669,0.1248238,0.47591007,0.37203485],"study_design_scores_gemma":[0.0029829808,0.0033234318,0.03131201,0.000059107988,0.000049740367,0.00046883358,0.00051756704,0.00009843205,0.0016675558,0.5019327,0.45712188,0.00046580678],"about_ca_topic_score_codex":1.0029238e-7,"about_ca_topic_score_gemma":3.749466e-8,"teacher_disagreement_score":0.37710887,"about_ca_system_score_codex":0.000027709668,"about_ca_system_score_gemma":0.00003785754,"threshold_uncertainty_score":0.39875442},"labels":[],"label_agreement":null},{"id":"W1970283777","doi":"10.1006/eujc.2000.0437","title":"Note Concerning an Odd Langford Sequence","year":2001,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Arithmetic progression; Combinatorics; Sequence (biology); Set (abstract data type); Arithmetic; Discrete mathematics","score_opus":0.14493517751988508,"score_gpt":0.3802863079236982,"score_spread":0.23535113040381314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970283777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87047064,0.00014685917,0.037391674,0.00035420177,0.0005503234,0.00009493233,0.0000021355236,0.00006439154,0.090924814],"genre_scores_gemma":[0.99464154,0.00007759194,0.0021636616,0.00007542081,0.00026728472,1.90023e-7,7.8518775e-7,0.000058558464,0.0027149452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975594,0.00082801323,0.00055164826,0.00012749921,0.00062928017,0.00030410875],"domain_scores_gemma":[0.99809736,0.00036438127,0.00045498577,0.0003418788,0.00046533105,0.00027604212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035160396,0.00014483495,0.00028753854,0.00013397612,0.00011019003,0.00007838677,0.0007086247,0.000026763804,0.00017599495],"category_scores_gemma":[0.0009328236,0.00012262785,0.0001120296,0.0003135995,0.00009448434,0.00031349927,0.00009833604,0.0005694637,0.00012698841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040816102,0.0009015668,0.016515674,0.00012900295,0.00024075317,0.015359701,0.005217231,0.00008912671,0.0032023992,0.92267984,0.01192781,0.023328753],"study_design_scores_gemma":[0.0047158552,0.002485907,0.0022269355,0.00045226896,0.00020080066,0.004581547,0.001720211,0.0016787073,0.00095650944,0.84120965,0.1389561,0.0008155013],"about_ca_topic_score_codex":0.0000017205045,"about_ca_topic_score_gemma":7.948517e-7,"teacher_disagreement_score":0.12702829,"about_ca_system_score_codex":0.00012052519,"about_ca_system_score_gemma":0.000097809454,"threshold_uncertainty_score":0.50006187},"labels":[],"label_agreement":null},{"id":"W1971692815","doi":"10.1016/j.ejc.2005.03.004","title":"Hadamard ideals and Hadamard matrices with two circulant cores","year":2005,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Hadamard transform; Complex Hadamard matrix; Hadamard matrix; Hadamard's inequality; Hadamard's maximal determinant problem; Mathematics; Hadamard three-lines theorem; Circulant matrix; Hadamard three-circle theorem; Formalism (music); Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.0048725861245969525,"score_gpt":0.1753602694732534,"score_spread":0.17048768334865644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971692815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9767428,0.005140095,0.0022747181,0.00008814925,0.00057055306,0.00006629005,0.0000023486039,0.000072007584,0.015043009],"genre_scores_gemma":[0.9989856,0.00036465807,0.00025955233,0.00003744682,0.00021745889,3.7180553e-7,4.9290077e-7,0.000048157952,0.00008624416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988265,0.0001942659,0.00042398053,0.00008742074,0.00027145247,0.0001963558],"domain_scores_gemma":[0.9993244,0.00006818893,0.00018577398,0.00015024294,0.00010688893,0.00016450985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089191255,0.0001677323,0.00027431836,0.00015166753,0.00006831596,0.00009075998,0.00022495806,0.000017643775,0.000011944021],"category_scores_gemma":[0.000017786102,0.00012909739,0.00006257109,0.00019236663,0.00004307631,0.0002167803,0.000023210687,0.00026001333,0.000020942449],"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.0012510093,0.0010321498,0.1626478,0.002136395,0.0038544983,0.012980754,0.012111315,0.12021399,0.0213413,0.45411095,0.08469395,0.123625875],"study_design_scores_gemma":[0.021150073,0.0040936847,0.1312349,0.0025142832,0.0008585687,0.015041082,0.0021307706,0.00689126,0.0070445347,0.018237384,0.7875656,0.0032378985],"about_ca_topic_score_codex":6.84366e-7,"about_ca_topic_score_gemma":8.6253294e-7,"teacher_disagreement_score":0.7028716,"about_ca_system_score_codex":0.00003384482,"about_ca_system_score_gemma":0.000013352006,"threshold_uncertainty_score":0.52644384},"labels":[],"label_agreement":null},{"id":"W1973866695","doi":"10.1016/j.ejc.2009.11.019","title":"Combinatorial characterization of the Assur graphs from engineering","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Terminology; Mathematics; Rigidity (electromagnetism); Characterization (materials science); Combinatorics; Graph theory; Kinematics; Discrete mathematics; Linguistics; Engineering","score_opus":0.0038831277628646886,"score_gpt":0.1538509751646961,"score_spread":0.1499678474018314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973866695","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.990401,0.00012712054,0.005950577,0.00005881342,0.002697918,0.000035685287,0.00000393293,0.000026398513,0.0006985376],"genre_scores_gemma":[0.99959993,0.000088254536,0.00012209087,0.000015309786,0.00014684223,5.3725056e-8,0.000004686274,0.00001645043,0.0000063689236],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9991023,0.00007269909,0.00043790234,0.000050527397,0.00024653325,0.00009002124],"domain_scores_gemma":[0.9993961,0.000021837024,0.00023935447,0.00013668477,0.00015953463,0.00004650324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020212495,0.000105244784,0.00019722735,0.00008728238,0.000030903328,0.000028393377,0.0002654148,0.000022814571,0.000012197845],"category_scores_gemma":[0.000047946007,0.00007628504,0.00013756567,0.0003771503,0.000009237593,0.00014681107,0.000014036291,0.00018346091,0.0000013761083],"study_design_candidate":"observational","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.000078233556,0.00022932986,0.009096533,0.00006755756,0.00060907146,0.00007203361,0.0012364237,0.24481736,0.6345121,0.0909405,0.0009101334,0.0174307],"study_design_scores_gemma":[0.002532592,0.00036164708,0.88042676,0.00024175765,0.00028046197,0.00002678548,0.000026053414,0.04698636,0.051967982,0.0123767555,0.0043003275,0.00047249082],"about_ca_topic_score_codex":3.5097636e-7,"about_ca_topic_score_gemma":2.3992534e-8,"teacher_disagreement_score":0.87133026,"about_ca_system_score_codex":0.000028922785,"about_ca_system_score_gemma":0.0000076128017,"threshold_uncertainty_score":0.31108135},"labels":[],"label_agreement":null},{"id":"W1974623598","doi":"10.1016/j.ejc.2007.03.001","title":"On an involution of Christoffel words and Sturmian morphisms","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Modulo; Morphism; Christoffel symbols; Combinatorics on words; Involution (esoterism); Iterated function; Combinatorics; Automorphism; Endomorphism; Quotient; Palindrome; Discrete mathematics; Pure mathematics; Word (group theory)","score_opus":0.010255622208276069,"score_gpt":0.22606754202962095,"score_spread":0.2158119198213449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974623598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8044008,0.00043793782,0.19219065,0.0000845489,0.00069907936,0.000029426328,3.9892765e-7,0.000021697158,0.0021354647],"genre_scores_gemma":[0.9975116,0.00004274673,0.0022028815,0.00012533796,0.00007395655,3.700877e-8,2.5629777e-7,0.000011992295,0.000031176995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987132,0.000249668,0.00041830755,0.00012142755,0.00034077992,0.00015660461],"domain_scores_gemma":[0.9988918,0.00010866316,0.00043218362,0.00027877218,0.00012841875,0.00016019057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029372755,0.00010224948,0.00017255144,0.00021176322,0.000061833736,0.00004622481,0.0006240068,0.000020823578,0.00000192856],"category_scores_gemma":[0.00007596759,0.000086083885,0.00005108391,0.00027961738,0.000057231842,0.00038068453,0.00009987254,0.00022515899,0.0000040982827],"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.00008384487,0.0005253395,0.001576733,0.000024891962,0.00003220313,0.0005775406,0.0027422663,0.00006984456,0.0041418653,0.9210687,0.0009835572,0.06817321],"study_design_scores_gemma":[0.008941604,0.015789974,0.5179004,0.0008213779,0.00008884332,0.0015480116,0.0012618272,0.008252328,0.018415138,0.413789,0.011883499,0.001308001],"about_ca_topic_score_codex":0.0000010213695,"about_ca_topic_score_gemma":2.4955804e-7,"teacher_disagreement_score":0.5163237,"about_ca_system_score_codex":0.000038205824,"about_ca_system_score_gemma":0.000026159263,"threshold_uncertainty_score":0.3510399},"labels":[],"label_agreement":null},{"id":"W1975911106","doi":"10.1016/j.ejc.2007.04.018","title":"Deterministic random walks on the integers","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Theoretical and Computational Physics","field":"Physics and Astronomy","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Random walk; Vertex (graph theory); Graph; Discrete mathematics; Path (computing); Constant (computer programming); Statistics; Computer science","score_opus":0.007934329050717573,"score_gpt":0.21710633129103507,"score_spread":0.2091720022403175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975911106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5863404,0.000025937192,0.1907678,0.000730385,0.0010737829,0.000075090895,0.000002611394,0.000010561503,0.2209734],"genre_scores_gemma":[0.9992326,5.9707924e-7,0.000043454114,0.00016685268,0.00041047542,1.3524865e-7,7.167165e-7,0.000014635459,0.0001305689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990752,0.00017732354,0.00031555476,0.000059586157,0.00023545774,0.00013691396],"domain_scores_gemma":[0.99880034,0.0006675911,0.0002215936,0.000104880775,0.00011642655,0.00008914622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010905873,0.00009457231,0.00012726814,0.000035290846,0.000092144845,0.00003973978,0.00028062565,0.000005720731,0.0000726887],"category_scores_gemma":[0.00003535894,0.00005684693,0.00013873084,0.00012071454,0.00007168956,0.000038515966,0.000031007807,0.00030908507,0.00008123106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104412626,0.00011580291,0.00022520081,0.0000012623741,0.000034392993,0.000036440317,0.00011858381,0.000092247654,0.00003220783,0.9858685,0.000677719,0.012693236],"study_design_scores_gemma":[0.002051559,0.00053877133,0.0036781274,0.000060145154,0.000044806806,0.000012317989,0.0002983839,0.00016390938,0.00090923125,0.98169893,0.010376655,0.00016716965],"about_ca_topic_score_codex":2.0422964e-7,"about_ca_topic_score_gemma":5.8728187e-9,"teacher_disagreement_score":0.41289213,"about_ca_system_score_codex":0.0000140803,"about_ca_system_score_gemma":0.000023226437,"threshold_uncertainty_score":0.23181504},"labels":[],"label_agreement":null},{"id":"W1976660742","doi":"10.1016/j.ejc.2013.07.008","title":"Finite dimensional scattered posets","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Calgary","funders":"","keywords":"Star product; Mathematics; Product (mathematics); Combinatorics; Characterization (materials science); Pure mathematics; Discrete mathematics; Geometry; Physics; Optics","score_opus":0.011568501039543027,"score_gpt":0.20436805959664706,"score_spread":0.19279955855710404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976660742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3321199,0.00092488626,0.64311796,0.0041710613,0.0039717713,0.00015152336,8.483021e-7,0.000108781314,0.015433264],"genre_scores_gemma":[0.98986137,0.000015805139,0.008949335,0.0007517751,0.00009482625,2.8953724e-7,3.6259826e-7,0.000013106451,0.00031315224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864,0.00025507255,0.000402711,0.00013363095,0.00035727612,0.00021132913],"domain_scores_gemma":[0.99869543,0.0001386571,0.00034715634,0.0002905821,0.00033998102,0.00018821507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044821796,0.000121854166,0.00016972353,0.00012126992,0.00009034003,0.00012869432,0.0009861192,0.000014527764,0.000047055415],"category_scores_gemma":[0.00010749878,0.000094447176,0.000097672426,0.00027738378,0.00003328958,0.00074741367,0.00022061386,0.00026247842,0.0004808278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041946063,0.0013983672,0.0059078676,0.000050411527,0.00020796819,0.0040739565,0.0017353684,0.0047582346,0.0072683217,0.71262825,0.09385689,0.16807239],"study_design_scores_gemma":[0.0062764105,0.0034744442,0.19160421,0.0002718584,0.000043062235,0.0021187358,0.00007725048,0.014160831,0.002631161,0.70878446,0.06916408,0.0013934638],"about_ca_topic_score_codex":2.8975666e-7,"about_ca_topic_score_gemma":1.5598612e-8,"teacher_disagreement_score":0.6577414,"about_ca_system_score_codex":0.000027361475,"about_ca_system_score_gemma":0.000038252267,"threshold_uncertainty_score":0.61802286},"labels":[],"label_agreement":null},{"id":"W1977033885","doi":"10.1016/j.ejc.2006.05.003","title":"3-star factors in random <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si7.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>d</mml:mi></mml:math>-regular graphs","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Random graph; Combinatorics; Star (game theory); Discrete mathematics; Graph","score_opus":0.01542945236961823,"score_gpt":0.23443577868424,"score_spread":0.21900632631462177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977033885","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9917866,0.0005976635,0.00055330846,0.000079416444,0.0018756285,0.00006472929,0.000026405189,0.00006568409,0.004950588],"genre_scores_gemma":[0.9976987,0.00022262825,0.0012248784,0.00013552536,0.00038491882,0.0000047218045,0.000020818388,0.00018124335,0.00012652882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99623275,0.0004826303,0.0013264414,0.00035287038,0.0009952182,0.0006101046],"domain_scores_gemma":[0.99692285,0.00073291146,0.0012182307,0.00071564387,0.00015962517,0.00025075613],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021042957,0.00043359818,0.00046657235,0.0003086894,0.00043547733,0.00021110382,0.0008965652,0.00022570984,0.000034643275],"category_scores_gemma":[0.0006647427,0.0004152552,0.0007311394,0.00045346006,0.0002717955,0.00039497795,0.00033558754,0.0009809412,0.000050916165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036980846,0.0002825361,0.00026403338,0.00016343879,0.00020617392,0.0009989023,0.00095785165,0.00022325471,0.00028759005,0.9944964,0.0016123536,0.00013765435],"study_design_scores_gemma":[0.020112801,0.0030436914,0.0062152636,0.0018717123,0.0013939419,0.0017110017,0.0018802349,0.09468645,0.011786861,0.8288262,0.026087286,0.002384587],"about_ca_topic_score_codex":0.0000212787,"about_ca_topic_score_gemma":0.000009935313,"teacher_disagreement_score":0.16567023,"about_ca_system_score_codex":0.000032392134,"about_ca_system_score_gemma":0.00015115862,"threshold_uncertainty_score":0.99982995},"labels":[],"label_agreement":null},{"id":"W1977808884","doi":"10.1016/j.ejc.2010.05.001","title":"Cyclically<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>t</mml:mi></mml:math>-complementary uniform hypergraphs","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Hypergraph; Combinatorics; Permutation (music); Vertex (graph theory); Isomorphism (crystallography); Partition (number theory); Discrete mathematics; Graph","score_opus":0.01091408648858767,"score_gpt":0.21289985691249547,"score_spread":0.2019857704239078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977808884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9834588,0.00031041153,0.0005431181,0.0000997737,0.003973441,0.00004191636,0.000029756473,0.00012887723,0.011413879],"genre_scores_gemma":[0.9981876,0.00021878701,0.00051087077,0.000190242,0.0006235011,0.000006807707,0.000031148793,0.00017426073,0.000056778063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99738926,0.00016220773,0.000974278,0.00025625151,0.0006699775,0.00054800435],"domain_scores_gemma":[0.99819934,0.00019744897,0.0004959588,0.0006258524,0.00010558802,0.00037577926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014947908,0.00034650843,0.00028714768,0.00019427431,0.00031866066,0.0002045324,0.0008638152,0.00015954401,0.000059524515],"category_scores_gemma":[0.00012160051,0.0003767429,0.0004978066,0.00035200428,0.00014535266,0.00043269762,0.00020301851,0.0011587788,0.00040767292],"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.000095894764,0.00014353468,0.00011998136,0.00014513807,0.00028791817,0.00067486375,0.0004297816,0.0006805625,0.00400864,0.9911827,0.0015500354,0.00068094773],"study_design_scores_gemma":[0.007952914,0.003350297,0.003784484,0.0013325695,0.001030044,0.005284262,0.0018015488,0.6982177,0.014909835,0.017955663,0.24192683,0.0024538876],"about_ca_topic_score_codex":0.000011733678,"about_ca_topic_score_gemma":0.0000118023645,"teacher_disagreement_score":0.973227,"about_ca_system_score_codex":0.000017429973,"about_ca_system_score_gemma":0.00007109181,"threshold_uncertainty_score":0.99986845},"labels":[],"label_agreement":null},{"id":"W1980496272","doi":"10.1006/eujc.2002.0574","title":"Generalized Pigeonhole Properties of Graphs and Oriented Graphs","year":2002,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Pigeonhole principle; Combinatorics; Property (philosophy); Substructure; Countable set; Discrete mathematics; Vertex (graph theory); Graph","score_opus":0.04259153202162123,"score_gpt":0.2492221179893882,"score_spread":0.20663058596776698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980496272","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9906005,0.0034775678,0.0013979152,0.00011872094,0.0004461057,0.00007055131,0.0000015266115,0.00002347609,0.0038636306],"genre_scores_gemma":[0.9970118,0.00066288444,0.0015498099,0.000047283527,0.000019513585,3.442925e-7,1.9769118e-7,0.000029346982,0.0006788217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843174,0.0005018165,0.00058869866,0.00009774003,0.0002134237,0.00016658421],"domain_scores_gemma":[0.99879384,0.00010008952,0.0005473823,0.00019360261,0.00026604006,0.000099033874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080949016,0.00014159798,0.00035195105,0.00017574886,0.00009320533,0.000009269841,0.0002070904,0.00003243097,0.000045202014],"category_scores_gemma":[0.00038858817,0.00010770068,0.00011313636,0.00021918851,0.00024112484,0.00013974466,0.000056581728,0.00027091833,0.000004671773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010583399,0.00034601806,0.0009155283,0.00008497472,0.00011262331,0.0001505477,0.0017023635,0.000006448662,0.0024173514,0.9916255,0.0016405764,0.00089222746],"study_design_scores_gemma":[0.0032952295,0.00081765524,0.0005033122,0.00018939043,0.00012810662,0.0003528922,0.0004263652,0.00006550548,0.0064505655,0.98232245,0.005202244,0.00024627516],"about_ca_topic_score_codex":2.441029e-7,"about_ca_topic_score_gemma":1.2324128e-7,"teacher_disagreement_score":0.009303048,"about_ca_system_score_codex":0.000011383592,"about_ca_system_score_gemma":0.00000860606,"threshold_uncertainty_score":0.43919063},"labels":[],"label_agreement":null},{"id":"W1980573399","doi":"10.1016/j.ejc.2011.03.005","title":"Limits of kernel operators and the spectral regularity lemma","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Lemma (botany); Eigenvalues and eigenvectors; Invariant (physics); Combinatorics; Spectral theory; Spectral graph theory; Graph; Discrete mathematics; Pure mathematics; Hilbert space; Voltage graph; Line graph","score_opus":0.06104600602389194,"score_gpt":0.2611345016580148,"score_spread":0.20008849563412284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980573399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9739165,0.00019765667,0.0011094126,0.00018144694,0.00016091851,0.000092399576,0.0000015631098,0.000009410304,0.02433071],"genre_scores_gemma":[0.99830747,0.000081638245,0.001362295,0.000028405457,0.000039205675,4.11971e-7,1.03041515e-7,0.000017542343,0.00016292324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987143,0.0004979428,0.0004526122,0.000067001216,0.00016637679,0.000101765734],"domain_scores_gemma":[0.9988617,0.00020739125,0.0004308739,0.00024049851,0.00018549137,0.00007409258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022688932,0.00009243521,0.00022450203,0.00005455726,0.00009262628,0.000016734788,0.00034788222,0.000016984037,0.00002017615],"category_scores_gemma":[0.000268065,0.000058540747,0.000107808795,0.00016629788,0.00023191607,0.00008126568,0.000047821755,0.0002490521,0.0000035074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006894613,0.00015129586,0.0006600295,0.000016255168,0.000044106397,0.000017201817,0.0015668342,2.2280875e-7,0.00014153155,0.99661773,0.0005161851,0.00019968263],"study_design_scores_gemma":[0.0017017589,0.00019469288,0.008385798,0.000042884425,0.00010037831,0.00012959578,0.00029141965,0.000006957551,0.0039791916,0.9841571,0.0009254317,0.00008482098],"about_ca_topic_score_codex":7.169941e-7,"about_ca_topic_score_gemma":2.1187098e-7,"teacher_disagreement_score":0.024390992,"about_ca_system_score_codex":0.000007546641,"about_ca_system_score_gemma":0.000019843017,"threshold_uncertainty_score":0.23872225},"labels":[],"label_agreement":null},{"id":"W1983401788","doi":"10.1016/j.ejc.2010.08.002","title":"Vertex-coloring 2-edge-weighting of graphs","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Nankai University","keywords":"Combinatorics; Mathematics; Edge coloring; Bipartite graph; Vertex (graph theory); Weighting; Discrete mathematics; Complete coloring; Graph coloring; Fractional coloring; Edge cover; Graph; Graph power; Line graph; Physics","score_opus":0.00992254455779144,"score_gpt":0.20449213558362553,"score_spread":0.1945695910258341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983401788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9762799,0.00030780255,0.008919479,0.0002402712,0.0051071546,0.000038647617,2.6150056e-7,0.000046307086,0.009060155],"genre_scores_gemma":[0.98994195,0.000034298846,0.009887708,0.000055588476,0.000014314698,1.205235e-7,1.021101e-7,0.000015515938,0.000050380295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838316,0.00018597723,0.0006523269,0.00014431203,0.0004253886,0.0002088404],"domain_scores_gemma":[0.9980981,0.00012794099,0.000660483,0.00039586725,0.00054775213,0.00016989418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021188764,0.00012317383,0.00023593844,0.00028959467,0.00010671212,0.000073610834,0.0011222134,0.000026904727,0.0000052420996],"category_scores_gemma":[0.00024477887,0.00010335786,0.00015258227,0.00061000825,0.0000637044,0.00033792804,0.00019720769,0.000555515,0.00001489643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007699593,0.00017064906,0.002979332,0.000019997096,0.000032699634,0.00017693157,0.000493783,0.00004314332,0.03176776,0.9551285,0.001021921,0.008157575],"study_design_scores_gemma":[0.0050064162,0.002291063,0.020683726,0.00046095334,0.00008625041,0.00096636434,0.000103378996,0.0038304813,0.06816186,0.8789701,0.018595144,0.00084430043],"about_ca_topic_score_codex":9.2056507e-7,"about_ca_topic_score_gemma":1.4758673e-7,"teacher_disagreement_score":0.07615845,"about_ca_system_score_codex":0.000008458482,"about_ca_system_score_gemma":0.00006210604,"threshold_uncertainty_score":0.42148113},"labels":[],"label_agreement":null},{"id":"W1984357160","doi":"10.1016/j.ejc.2004.10.003","title":"Toward the classification of Moufang loops of order 64","year":2004,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjecture; Order (exchange); Table (database); Multiplication (music); Quarter (Canadian coin); Pure mathematics; Algebra over a field; Loop (graph theory); Combinatorics; Arithmetic; Computer science; Geography; Database; Archaeology","score_opus":0.09299178416552384,"score_gpt":0.3051185169528175,"score_spread":0.21212673278729366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984357160","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82271105,0.00031350442,0.14844099,0.0028010202,0.00030907665,0.00029089669,0.0000073601495,0.000018958917,0.025107142],"genre_scores_gemma":[0.99101365,0.00005672003,0.008739661,0.000015603133,0.000042167972,8.1301926e-7,5.136984e-7,0.000023767232,0.00010708431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858445,0.00012044039,0.00078863226,0.00006067069,0.0003531821,0.000092641276],"domain_scores_gemma":[0.9975673,0.00021189437,0.0011983804,0.00033172022,0.00064165116,0.00004904293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012532617,0.00009093269,0.0002376783,0.00007100146,0.000043228978,0.000014000671,0.00044983803,0.000019366313,0.000017129829],"category_scores_gemma":[0.00045081595,0.00006028414,0.00011069473,0.00033205852,0.000074242846,0.000053795877,0.00004718394,0.00018343887,0.0000075759685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009730091,0.0006122313,0.0000753446,0.00018035079,0.00006353146,0.0000065418453,0.0028635124,0.00006555442,0.004141562,0.98847353,0.0028642176,0.00064391136],"study_design_scores_gemma":[0.0021135262,0.00044998413,0.0033166646,0.00038137604,0.0002245882,0.000121370045,0.0021793111,0.0001695261,0.010138617,0.9724522,0.008240692,0.00021210675],"about_ca_topic_score_codex":7.060817e-7,"about_ca_topic_score_gemma":1.6172885e-7,"teacher_disagreement_score":0.16830261,"about_ca_system_score_codex":0.000028862258,"about_ca_system_score_gemma":0.000072531526,"threshold_uncertainty_score":0.2458316},"labels":[],"label_agreement":null},{"id":"W1984523325","doi":"10.1016/j.ejc.2007.08.003","title":"Vertex-transitive self-complementary uniform hypergraphs","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Transitive relation; Combinatorics; Vertex (graph theory); Hypergraph; Prime power; Modulo; Prime (order theory); Discrete mathematics; Graph","score_opus":0.008940873634418138,"score_gpt":0.1691587544205315,"score_spread":0.16021788078611335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984523325","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9359756,0.0007845409,0.00100723,0.000027875045,0.0020753152,0.000064318694,0.0000039993047,0.00012803105,0.059933066],"genre_scores_gemma":[0.9992907,0.00036105592,0.00013145467,0.000036201152,0.00008766838,2.9216125e-7,0.0000015668783,0.00004667646,0.000044399632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987656,0.00021167353,0.0004741585,0.000071984905,0.00026460193,0.00021198396],"domain_scores_gemma":[0.9994186,0.000047068283,0.000108501874,0.00015429665,0.00012485472,0.00014663753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005718022,0.00016227101,0.00023936864,0.00017978155,0.0001038084,0.000013991479,0.00029911145,0.000019275472,0.00002129223],"category_scores_gemma":[0.000007641067,0.00015039381,0.00015135393,0.00029989792,0.000037168502,0.00015751086,0.000016063577,0.00031203486,0.000028296636],"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.0009896575,0.004406692,0.094626255,0.0017718355,0.009981345,0.05737878,0.088729315,0.019239761,0.031376876,0.5415034,0.13250838,0.017487673],"study_design_scores_gemma":[0.031804614,0.008191581,0.15028328,0.0014686701,0.001101066,0.029641075,0.008888093,0.008574928,0.025092416,0.06555356,0.66408,0.0053206827],"about_ca_topic_score_codex":5.9129894e-7,"about_ca_topic_score_gemma":1.6534682e-7,"teacher_disagreement_score":0.5315717,"about_ca_system_score_codex":0.000052244945,"about_ca_system_score_gemma":0.000018203107,"threshold_uncertainty_score":0.61328816},"labels":[],"label_agreement":null},{"id":"W1984989930","doi":"10.1016/j.ejc.2008.09.010","title":"Local Steiner convexity","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"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; National Research Foundation","keywords":"Combinatorics; Mathematics; Steiner tree problem; Vertex (graph theory); Convexity; Convex set; Regular polygon; Graph; Discrete mathematics; Convex optimization; Geometry","score_opus":0.03156079600770018,"score_gpt":0.25557173935320465,"score_spread":0.22401094334550448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984989930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06027404,0.00041855202,0.92535007,0.00032850084,0.0007616582,0.000040954743,3.2387862e-7,0.000041048606,0.012784844],"genre_scores_gemma":[0.9945851,0.000104083556,0.0045066066,0.00012862029,0.000064172375,1.4968838e-7,1.1562005e-7,0.000017803672,0.0005933748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978216,0.0006877033,0.00041522426,0.00014846625,0.0006569633,0.00027000796],"domain_scores_gemma":[0.99838835,0.00013943913,0.00027299806,0.00043268362,0.0005148253,0.00025172185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015251122,0.000119664866,0.00020580707,0.0001961721,0.0001579798,0.000041681997,0.001599632,0.000016612817,0.000012595373],"category_scores_gemma":[0.00015475228,0.00009999311,0.000120255034,0.0005890575,0.0002219659,0.00056977477,0.00029789467,0.00049722113,0.00011527679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008456446,0.00045585976,0.002872961,0.000019503195,0.00007412776,0.010908047,0.0011213797,0.0006134789,0.0005985805,0.9497974,0.0102280285,0.023226071],"study_design_scores_gemma":[0.013384155,0.007871612,0.06277543,0.00022912964,0.000039182032,0.017708955,0.00031110022,0.009988224,0.016166374,0.5150256,0.3546724,0.0018278268],"about_ca_topic_score_codex":2.098071e-7,"about_ca_topic_score_gemma":2.8949282e-8,"teacher_disagreement_score":0.93431103,"about_ca_system_score_codex":0.000057251622,"about_ca_system_score_gemma":0.00010943025,"threshold_uncertainty_score":0.40776008},"labels":[],"label_agreement":null},{"id":"W1985078507","doi":"10.1006/eujc.2000.0382","title":"Jump-number of Means on Graphs","year":2000,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Idempotence; Vertex (graph theory); Jump; Graph; Discrete mathematics","score_opus":0.018218568695760166,"score_gpt":0.27622258504412533,"score_spread":0.2580040163483652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985078507","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6131214,0.0003708474,0.070255674,0.0006353263,0.001235542,0.00014180603,0.0000029017606,0.000074470234,0.31416208],"genre_scores_gemma":[0.9951002,0.0001879889,0.0035278895,0.00009638897,0.00003632094,1.8316243e-7,1.4775425e-7,0.000022176317,0.0010287039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976163,0.0006996234,0.0005159099,0.00015948883,0.00075186376,0.0002568308],"domain_scores_gemma":[0.9984638,0.00018442457,0.00029740768,0.0005254562,0.0003438773,0.00018505217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016622109,0.00013386682,0.00024303136,0.00022222004,0.00007651995,0.00004715958,0.0016645575,0.000018052633,0.000127912],"category_scores_gemma":[0.00009844035,0.00011274684,0.00018179856,0.00087533734,0.00010021097,0.00037683512,0.00009770612,0.00043614706,0.00019064164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009228436,0.0003615165,0.001322292,0.000013709255,0.000048066333,0.0005270298,0.00044222828,0.00039238305,0.00020394407,0.94376296,0.0019486325,0.050884947],"study_design_scores_gemma":[0.0035335456,0.0028519945,0.014376744,0.00025895258,0.000025677318,0.000737324,0.00004546156,0.00064971054,0.0045665046,0.8974156,0.07501436,0.0005241633],"about_ca_topic_score_codex":3.255252e-7,"about_ca_topic_score_gemma":4.4740844e-8,"teacher_disagreement_score":0.38197884,"about_ca_system_score_codex":0.00003096253,"about_ca_system_score_gemma":0.000047020018,"threshold_uncertainty_score":0.4597683},"labels":[],"label_agreement":null},{"id":"W1985880617","doi":"10.1016/j.ejc.2011.04.001","title":"On the maximum number of cliques in a graph embedded in a surface","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Omega; Combinatorics; Mathematics; Integer (computer science); Graph; Sigma; Vertex (graph theory); Surface (topology); Discrete mathematics; Physics; Geometry; Quantum mechanics; Computer science","score_opus":0.04936329978905404,"score_gpt":0.28329069176825206,"score_spread":0.233927391979198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985880617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94308764,0.00006930005,0.00012556616,0.000041446885,0.0003531083,0.00007947831,0.0000010334063,0.0000062749937,0.056236178],"genre_scores_gemma":[0.99877983,0.00006566579,0.0009929616,0.00006675458,0.00001585276,2.2381131e-7,6.412322e-8,0.000028554421,0.000050100753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774754,0.0009991575,0.0007151826,0.00008619226,0.00028294072,0.00016895983],"domain_scores_gemma":[0.9984658,0.0005363363,0.00052475446,0.00029086124,0.00013360435,0.000048672122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027928266,0.00013548677,0.000307393,0.00013889525,0.0000366185,0.000009915627,0.00050887937,0.000032451742,0.00008698936],"category_scores_gemma":[0.0005383566,0.00008422686,0.00013580102,0.0003582149,0.00009286775,0.00007202127,0.00008153516,0.00051288767,0.000003658622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016730439,0.0003137765,0.011185447,0.000028338087,0.000029404297,0.00023508316,0.007322418,0.000004951808,0.00003072963,0.9798909,0.00065101945,0.00014062868],"study_design_scores_gemma":[0.00081719086,0.00024061535,0.011274711,0.00017839117,0.000012852462,0.00004718499,0.00046997188,0.00000502021,0.0005996441,0.9861758,0.00008471301,0.00009394151],"about_ca_topic_score_codex":0.0000026944335,"about_ca_topic_score_gemma":0.0000014791615,"teacher_disagreement_score":0.056186076,"about_ca_system_score_codex":0.00002590599,"about_ca_system_score_gemma":0.00002321415,"threshold_uncertainty_score":0.34346715},"labels":[],"label_agreement":null},{"id":"W1986161890","doi":"10.1016/j.ejc.2008.09.022","title":"On the geodesic pre-hull number of a graph","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Convexity; Combinatorics; Hull; Geodesic; Bipartite graph; Convex hull; Graph; Discrete mathematics; Regular polygon; Geometry","score_opus":0.027576156594967358,"score_gpt":0.2700224635671326,"score_spread":0.24244630697216524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986161890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79029804,0.000221565,0.18567795,0.00058585504,0.00061029714,0.00011276679,8.964977e-7,0.000028011049,0.022464588],"genre_scores_gemma":[0.9977153,0.00012703729,0.0016053752,0.00012657198,0.000033560857,4.402543e-7,6.823401e-8,0.000018962872,0.00037269088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974129,0.0009802184,0.00044961268,0.00013870731,0.0007761013,0.00024246752],"domain_scores_gemma":[0.9978043,0.00058539835,0.0004448001,0.00060458435,0.00043274835,0.00012820544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020058453,0.00012643069,0.00020509143,0.00016265968,0.00016820992,0.000032293083,0.0020269991,0.0000151836175,0.000021709733],"category_scores_gemma":[0.00036685445,0.000082566745,0.00017472336,0.0008425463,0.00020146322,0.0002839953,0.00021922776,0.00051613577,0.00005799813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060530503,0.00022945779,0.0014846952,0.000007783025,0.000039696155,0.00051318883,0.0007667432,0.00018011633,0.00019261817,0.991578,0.0034526032,0.0014945819],"study_design_scores_gemma":[0.0019477782,0.0017846484,0.02309174,0.00015414113,0.00001476061,0.0016994608,0.00005651401,0.00047522955,0.003780176,0.95872045,0.0079437895,0.00033130843],"about_ca_topic_score_codex":3.4777932e-7,"about_ca_topic_score_gemma":2.6704962e-8,"teacher_disagreement_score":0.20741722,"about_ca_system_score_codex":0.000028472401,"about_ca_system_score_gemma":0.00007694982,"threshold_uncertainty_score":0.37667024},"labels":[],"label_agreement":null},{"id":"W1986611537","doi":"10.1016/s0195-6698(03)00044-1","title":"The set of k-power free words over Σ is empty or perfect","year":2003,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Alphabet; Combinatorics; Set (abstract data type); Natural number; Finite set; Power (physics); Power set; Discrete mathematics; Generating set of a group; Linguistics; Computer science; Mathematical analysis; Geometry","score_opus":0.014190143730028755,"score_gpt":0.23495079632413993,"score_spread":0.22076065259411118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986611537","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8456863,0.0039664963,0.08542411,0.0015445234,0.006971479,0.00017350486,0.000008360607,0.00008204128,0.056143165],"genre_scores_gemma":[0.9978851,0.0001238318,0.0009335023,0.000265798,0.000052426214,1.6503229e-7,6.509133e-8,0.00001940152,0.0007197071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99784464,0.0007483322,0.000525628,0.00013394687,0.00051647983,0.00023097683],"domain_scores_gemma":[0.9979884,0.00037538522,0.000530248,0.0007751769,0.0002159453,0.00011484145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030541453,0.00014165253,0.00021926177,0.0000810459,0.00015602152,0.00014766818,0.0019324998,0.00002090282,0.00007250216],"category_scores_gemma":[0.00047272336,0.00008197034,0.00016364013,0.00045299067,0.00007681964,0.00030412117,0.00023126607,0.00030308584,0.000019124194],"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.00010126627,0.00029575516,0.002250783,0.00002925309,0.00018980737,0.0007526459,0.0059991353,0.000019761135,0.00042235744,0.8372387,0.13694738,0.015753137],"study_design_scores_gemma":[0.006357355,0.0038178489,0.023941519,0.00032690846,0.00008040119,0.0013264309,0.0009881655,0.00096864544,0.009099154,0.14467509,0.80756336,0.00085511274],"about_ca_topic_score_codex":4.1593447e-7,"about_ca_topic_score_gemma":1.2818391e-7,"teacher_disagreement_score":0.69256365,"about_ca_system_score_codex":0.0000335716,"about_ca_system_score_gemma":0.00010845063,"threshold_uncertainty_score":0.35910976},"labels":[],"label_agreement":null},{"id":"W1987605301","doi":"10.1016/j.ejc.2010.05.013","title":"Relative centers of motion, implicit bars and dead-center positions for planar mechanisms","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Robotic Mechanisms and Dynamics","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Montréal","keywords":"Planar; Center (category theory); Motion (physics); Mathematics; Point (geometry); Relative motion; Instant centre of rotation; Geometry; Combinatorics; Computer science; Computer graphics (images); Computer vision; Classical mechanics; Physics; Rotation (mathematics)","score_opus":0.0061852890139435296,"score_gpt":0.19443776249151748,"score_spread":0.18825247347757396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987605301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05509541,0.00003740587,0.94191885,0.00008000782,0.0012169557,0.00009092982,0.000024794075,0.000018761073,0.0015168806],"genre_scores_gemma":[0.936249,0.000046833862,0.06356425,0.000025873482,0.000041131658,5.1383296e-7,0.000004902744,0.000039619157,0.000027882481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992719,0.000038026225,0.0003674388,0.000067765395,0.0001231664,0.00013168236],"domain_scores_gemma":[0.99939775,0.000055478733,0.00015576067,0.00010978495,0.0001665209,0.00011472372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003660744,0.00010629844,0.00017843054,0.00010638181,0.00005210421,0.000020187586,0.00013941045,0.000031007352,0.0000063007196],"category_scores_gemma":[0.000039911967,0.000098869896,0.00008034729,0.00007495944,0.000020225254,0.000133807,0.000016663553,0.0002471693,0.0000016521072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026190051,0.00011047505,0.00020279485,0.00006657797,0.00012332799,0.000032122854,0.00032556785,0.0045661516,0.02443124,0.9685791,0.00063672184,0.00089971203],"study_design_scores_gemma":[0.01446387,0.004171101,0.018706532,0.00061299524,0.0005868839,0.0017274544,0.0006913995,0.0838185,0.01162764,0.8582611,0.0039484114,0.0013841111],"about_ca_topic_score_codex":2.7067264e-7,"about_ca_topic_score_gemma":2.6405675e-7,"teacher_disagreement_score":0.8811536,"about_ca_system_score_codex":0.000019586043,"about_ca_system_score_gemma":0.000008463022,"threshold_uncertainty_score":0.40317973},"labels":[],"label_agreement":null},{"id":"W1988491896","doi":"10.1016/j.ejc.2013.07.007","title":"Generalization of convolution and incidence algebras","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Semigroup; Commutative property; Ideal (ethics); Convolution (computer science); Idempotence; Pure mathematics; Incidence algebra; Bicyclic semigroup; Associative property; Generalization; Element (criminal law); Discrete mathematics; Combinatorics; Algebra over a field; Subalgebra; Division algebra","score_opus":0.02509024815534918,"score_gpt":0.24602316403903376,"score_spread":0.22093291588368458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988491896","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9837266,0.00050797337,0.013781091,0.0001105647,0.00033327748,0.000074469564,5.062378e-7,0.000011853704,0.0014536304],"genre_scores_gemma":[0.99691576,0.00023310352,0.0025247782,0.00003922892,0.00009464512,2.961951e-7,5.2080986e-7,0.00002258391,0.00016910447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987653,0.00023145352,0.00054719753,0.00007796873,0.00026640602,0.00011167419],"domain_scores_gemma":[0.99855244,0.000100559504,0.00065847905,0.00013771538,0.0004618961,0.00008891715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007766606,0.00009733011,0.00021483928,0.00010602734,0.000048207894,0.000036179037,0.00017557273,0.000021045156,0.000031945066],"category_scores_gemma":[0.00043160273,0.000083342406,0.000052703628,0.00013438762,0.000064612075,0.00030725988,0.00005371404,0.00013351072,0.000012976023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023495886,0.00034050853,0.021680737,0.0002761229,0.00009886177,0.00006240918,0.0018669909,0.000027211932,0.011337537,0.93804806,0.02078668,0.0054513677],"study_design_scores_gemma":[0.002026652,0.00077505887,0.098878436,0.00037595254,0.00011179307,0.0002877309,0.00029353503,0.0005981549,0.008651801,0.8852999,0.0023608604,0.0003400836],"about_ca_topic_score_codex":0.000002903746,"about_ca_topic_score_gemma":2.27391e-7,"teacher_disagreement_score":0.07719769,"about_ca_system_score_codex":0.000026555894,"about_ca_system_score_gemma":0.000026949147,"threshold_uncertainty_score":0.33986047},"labels":[],"label_agreement":null},{"id":"W1988884000","doi":"10.1016/j.ejc.2011.09.007","title":"Degenerate and star colorings of graphs on surfaces","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"American Roentgen Ray Society","keywords":"Mathematics; Combinatorics; Degenerate energy levels; Star (game theory); Physics; Mathematical analysis","score_opus":0.06385033420358606,"score_gpt":0.2493722401986703,"score_spread":0.18552190599508422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988884000","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97489464,0.00031294406,0.000051778086,0.000012042064,0.00044435525,0.00004259045,0.000002255314,0.000008906586,0.024230506],"genre_scores_gemma":[0.9976556,0.00021925416,0.0019549816,0.000027085338,0.000018850898,8.952874e-8,8.562858e-8,0.000026155398,0.00009795254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987886,0.00030479796,0.00046089466,0.00008174124,0.00023869555,0.00012524582],"domain_scores_gemma":[0.99881977,0.00016620732,0.00054467586,0.00017068813,0.0002040903,0.000094540505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012034492,0.0001236032,0.00026534533,0.00013779459,0.000084784035,0.000011618183,0.00025680277,0.000022397571,0.000021432545],"category_scores_gemma":[0.00017277346,0.00009036457,0.00008610123,0.00013299685,0.00011008512,0.000078414574,0.000072311144,0.00021913428,9.65886e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012026824,0.00011072419,0.0027647128,0.000045959874,0.00007461461,0.000093174844,0.0017312701,0.0000011991946,0.00033324314,0.99404824,0.00041010167,0.00026651117],"study_design_scores_gemma":[0.0010098733,0.0015829256,0.019257838,0.00010151066,0.00007408103,0.00006509166,0.00022538155,0.000004104206,0.009776248,0.96645933,0.0012888077,0.00015480952],"about_ca_topic_score_codex":5.926905e-7,"about_ca_topic_score_gemma":1.2839405e-7,"teacher_disagreement_score":0.02758889,"about_ca_system_score_codex":0.000009499327,"about_ca_system_score_gemma":0.000013727961,"threshold_uncertainty_score":0.36849603},"labels":[],"label_agreement":null},{"id":"W1989100100","doi":"10.1016/j.ejc.2010.11.004","title":"Uniform approximation and Bernstein polynomials with coefficients in the unit interval","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Bernstein polynomial; Interval (graph theory); Unit interval; Polynomial; Degree (music); Interval arithmetic; Discrete mathematics; Combinatorics; Applied mathematics; Mathematical analysis","score_opus":0.034299187845906305,"score_gpt":0.22523143031778817,"score_spread":0.19093224247188187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989100100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74366766,0.00008754892,0.24549548,0.0005254458,0.00016731504,0.00012505494,3.7654675e-7,0.000012452852,0.009918656],"genre_scores_gemma":[0.9977308,0.000020917483,0.0020672835,0.00012297876,0.00002360246,5.199631e-7,1.9980143e-7,0.0000057198986,0.00002797192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99919945,0.00020161842,0.00024895874,0.000077598954,0.0001714185,0.00010097385],"domain_scores_gemma":[0.9994236,0.000045122248,0.00022573906,0.00017918785,0.00007972254,0.000046634646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088731357,0.00006802928,0.000091626505,0.00007151469,0.000061609695,0.00008253829,0.0006666802,0.000008044885,0.0000012163351],"category_scores_gemma":[0.000010311132,0.00004026459,0.000019735751,0.0003554113,0.000035773,0.00024025408,0.00007897406,0.0001733199,0.0000033897713],"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.000094187155,0.0010136091,0.012243496,0.000029640207,0.00004163706,0.000479085,0.015106807,0.00032136077,0.00017363088,0.8835016,0.00141472,0.08558022],"study_design_scores_gemma":[0.017142804,0.012590646,0.7339753,0.0012473247,0.0001788977,0.005126016,0.004372481,0.053062417,0.0036367243,0.08926875,0.077352755,0.002045908],"about_ca_topic_score_codex":0.0000015984451,"about_ca_topic_score_gemma":8.4498504e-7,"teacher_disagreement_score":0.79423285,"about_ca_system_score_codex":0.000010101095,"about_ca_system_score_gemma":0.00001588868,"threshold_uncertainty_score":0.16419423},"labels":[],"label_agreement":null},{"id":"W1989633733","doi":"10.1016/j.ejc.2010.04.001","title":"On a conjecture about the Szeged index","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Bipartite graph; Edge-transitive graph; Graph; Graph power; Discrete mathematics; Line graph","score_opus":0.020104109396715357,"score_gpt":0.2738195751573895,"score_spread":0.25371546576067416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989633733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9603971,0.000038691625,0.0018823256,0.0011106448,0.00087090244,0.000104270985,0.0000020524335,0.000025108748,0.03556886],"genre_scores_gemma":[0.99902743,0.000007838732,0.00018311407,0.00023312854,0.00015526952,8.13453e-7,2.3370325e-7,0.000027621601,0.0003645727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889374,0.00031496122,0.0003421579,0.000072376024,0.000250442,0.00012635218],"domain_scores_gemma":[0.99835944,0.0006229376,0.00040550542,0.000365562,0.00015928618,0.00008728622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001700548,0.00011070344,0.000148446,0.00006915663,0.00018826647,0.000051017953,0.0005527231,0.000028393759,0.00006775791],"category_scores_gemma":[0.00058374385,0.000065928776,0.00012770247,0.00021096332,0.00008763045,0.000046228513,0.00003571631,0.0010087233,0.000044059445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001877547,0.00013875704,0.00012814718,0.0000053515714,0.000024017623,0.000029944586,0.00030382982,0.000002819954,0.00051664474,0.9901883,0.008103821,0.0005395699],"study_design_scores_gemma":[0.00064001046,0.0001666734,0.00273219,0.000025976187,0.00003127618,0.00013788874,0.000057921672,0.000007033322,0.00041301904,0.9495197,0.046182465,0.000085832005],"about_ca_topic_score_codex":9.463214e-8,"about_ca_topic_score_gemma":4.1086935e-7,"teacher_disagreement_score":0.040668607,"about_ca_system_score_codex":0.000008492434,"about_ca_system_score_gemma":0.000028375172,"threshold_uncertainty_score":0.43824568},"labels":[],"label_agreement":null},{"id":"W1990093945","doi":"10.1016/j.ejc.2004.01.003","title":"Coloring face hypergraphs on surfaces","year":2004,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; Simon Fraser University","funders":"Pacific Institute for the Mathematical Sciences","keywords":"Combinatorics; Hypergraph; Mathematics; Vertex (graph theory); Upper and lower bounds; Surface (topology); Graph; Discrete mathematics; Geometry","score_opus":0.023794382802791874,"score_gpt":0.26164787578767273,"score_spread":0.23785349298488087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990093945","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6992016,0.0006520916,0.2776297,0.0011442776,0.0017185899,0.00010514609,7.210479e-7,0.00009063393,0.019457253],"genre_scores_gemma":[0.9948634,0.00012641233,0.0047135106,0.00009819208,0.000045424615,2.4608715e-7,8.7867654e-8,0.0000217719,0.00013096987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807394,0.00039004278,0.00037582283,0.0001834393,0.0006703505,0.00030643702],"domain_scores_gemma":[0.9986463,0.00016151681,0.00028376898,0.00041153477,0.00028245675,0.00021438238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016531114,0.00014545086,0.00020153642,0.00029471924,0.0001539859,0.0001326777,0.0017020572,0.000017160124,0.0000031626594],"category_scores_gemma":[0.00019677347,0.0001238744,0.00012154548,0.00081184605,0.000071260285,0.0005389927,0.00021210246,0.00051429967,0.00008828578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046839676,0.00025349678,0.00040599797,0.000009613196,0.000037546626,0.001056345,0.00065899256,0.01690298,0.0016989978,0.9741409,0.00026164803,0.004526635],"study_design_scores_gemma":[0.00904899,0.008963882,0.015970793,0.0004890327,0.000025864876,0.00096633896,0.00053804525,0.0005586041,0.03605355,0.8898943,0.03640445,0.0010861182],"about_ca_topic_score_codex":2.8228112e-7,"about_ca_topic_score_gemma":7.489143e-8,"teacher_disagreement_score":0.2956618,"about_ca_system_score_codex":0.000078911224,"about_ca_system_score_gemma":0.000081080274,"threshold_uncertainty_score":0.50514513},"labels":[],"label_agreement":null},{"id":"W1990777780","doi":"10.1016/j.ejc.2003.10.014","title":"Addendum to James Singer’s theorem on difference sets","year":2004,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Addendum; Mathematics; Combinatorics; Calculus (dental); Discrete mathematics; Philosophy","score_opus":0.018173515733292876,"score_gpt":0.22998907846145933,"score_spread":0.21181556272816646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990777780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64633375,0.00026795105,0.31791505,0.0032713218,0.0034483823,0.00010869097,0.0000015238334,0.00013002603,0.028523285],"genre_scores_gemma":[0.995679,0.000020488329,0.003229068,0.0008591502,0.00013726045,2.7565534e-7,1.2178863e-7,0.000016970143,0.00005764427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983918,0.00037963092,0.00035239386,0.00019336659,0.00043636275,0.0002464336],"domain_scores_gemma":[0.99873775,0.0001263075,0.0002477117,0.000449563,0.00018591051,0.0002527773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011953934,0.00016608006,0.00020070407,0.00028042812,0.00013856406,0.00019653665,0.0015506856,0.00001817064,0.0000070916753],"category_scores_gemma":[0.00015728483,0.00013433726,0.00015278328,0.0006230343,0.000042351898,0.0001987005,0.00020405656,0.00034152623,0.00012513106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003914403,0.0002280845,0.00012022502,0.000004594916,0.00002076252,0.00037891523,0.0012911048,0.00015814992,0.00034212417,0.97007793,0.0013092876,0.026029691],"study_design_scores_gemma":[0.0024204026,0.005676752,0.012772731,0.00053786533,0.00002746571,0.0002593447,0.000139718,0.000045409837,0.0049970266,0.947473,0.025024144,0.00062613067],"about_ca_topic_score_codex":2.6142501e-7,"about_ca_topic_score_gemma":6.512287e-8,"teacher_disagreement_score":0.34934524,"about_ca_system_score_codex":0.0000563839,"about_ca_system_score_gemma":0.00005580949,"threshold_uncertainty_score":0.54781145},"labels":[],"label_agreement":null},{"id":"W1991539303","doi":"10.1016/j.ejc.2013.08.001","title":"On terminal forms for topological polynomials for ribbon graphs: The<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si33.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>N</mml:mi></mml:math>-petal flower","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Abdus Salam International Centre for Theoretical Physics","keywords":"Ribbon; Mathematics; Combinatorics; Polynomial; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.026410891631761444,"score_gpt":0.2710543024001802,"score_spread":0.24464341076841875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991539303","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98160195,0.00013893782,0.0125156185,0.0003980025,0.003023601,0.00032447075,0.000041635252,0.00008446108,0.0018713013],"genre_scores_gemma":[0.9897934,0.00007235746,0.00847585,0.0003421348,0.00076536706,0.00011388502,0.000016240409,0.00023061977,0.00019011383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962468,0.00020851681,0.0014777504,0.0004062293,0.0008835753,0.0007771017],"domain_scores_gemma":[0.9943339,0.0024316541,0.001719747,0.0008362771,0.00035241753,0.00032600795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002043342,0.0004993251,0.0005486815,0.00015503238,0.0005781748,0.0003215086,0.0011420525,0.00025932683,0.000032358148],"category_scores_gemma":[0.0026596922,0.00041057967,0.00092621666,0.00024421525,0.0002713954,0.0005351139,0.0003387112,0.0007626136,0.0001852398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004466123,0.00056316226,0.000003713582,0.00027276872,0.00022482117,0.00014700355,0.00048745002,0.000058730206,0.00032488888,0.9928728,0.0038439427,0.0007541273],"study_design_scores_gemma":[0.0050453935,0.005635207,0.00004393002,0.0006728396,0.0006103509,0.0008667081,0.0007690544,0.08809482,0.005521587,0.8852331,0.00668712,0.00081988686],"about_ca_topic_score_codex":0.0000026600203,"about_ca_topic_score_gemma":0.0000016200577,"teacher_disagreement_score":0.10763968,"about_ca_system_score_codex":0.000053197113,"about_ca_system_score_gemma":0.00016768742,"threshold_uncertainty_score":0.9998346},"labels":[],"label_agreement":null},{"id":"W1992234658","doi":"10.1016/j.ejc.2015.02.013","title":"Boxicity and cubicity of product graphs","year":2015,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Austrian Science Fund","keywords":"Intersection graph; Mathematics; Combinatorics; Cartesian product; Graph; Sublinear function; Discrete mathematics; Line graph","score_opus":0.038455324322367514,"score_gpt":0.272555753371019,"score_spread":0.2341004290486515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992234658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83751523,0.0019660299,0.15160646,0.00047805076,0.0008439083,0.00010824833,0.0000010609557,0.000031704738,0.007449312],"genre_scores_gemma":[0.99379694,0.0000783898,0.00598717,0.000026571966,0.00003194985,1.1603897e-7,7.194926e-8,0.000011140755,0.00006765239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979782,0.000699449,0.00040603158,0.00015239092,0.0005769148,0.00018699824],"domain_scores_gemma":[0.9980554,0.00009386071,0.00039454785,0.00037594748,0.0008062172,0.00027400538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035553663,0.00010240223,0.00022967791,0.00023631881,0.00004821311,0.00004743165,0.0009948639,0.000010739105,9.567219e-7],"category_scores_gemma":[0.0005970305,0.0000849383,0.00006484872,0.00065099826,0.00014758151,0.00052518514,0.00034036388,0.00031487356,0.000003959899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011047732,0.00041336459,0.01435789,0.00005098418,0.00006274487,0.000447856,0.0015666082,0.00011241134,0.0024403746,0.9575051,0.002517153,0.020415021],"study_design_scores_gemma":[0.0032731302,0.0029125682,0.029230118,0.00011009646,0.000021842656,0.00072236394,0.00014451891,0.0005589564,0.019237276,0.933644,0.009762236,0.00038288126],"about_ca_topic_score_codex":5.7415934e-7,"about_ca_topic_score_gemma":7.142345e-8,"teacher_disagreement_score":0.15628171,"about_ca_system_score_codex":0.000026580165,"about_ca_system_score_gemma":0.00009282597,"threshold_uncertainty_score":0.3463683},"labels":[],"label_agreement":null},{"id":"W1994332726","doi":"10.1016/j.ejc.2014.04.002","title":"Sets of complex unit vectors with few inner products and distance-regular graphs","year":2014,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Unit (ring theory); Unit vector; Product (mathematics); Inner product space; Discrete mathematics; Geometry","score_opus":0.05789941826854944,"score_gpt":0.28395814545836,"score_spread":0.22605872718981057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994332726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99153286,0.00015529417,0.0020249686,0.00022791311,0.00015358203,0.00013854992,0.000004021711,0.000018638455,0.00574415],"genre_scores_gemma":[0.9970244,0.000031981486,0.0025859543,0.000018004897,0.000046498728,3.5887933e-7,0.0000015842504,0.0000661404,0.00022508016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731135,0.0010826621,0.00056282943,0.00015500907,0.0006398339,0.00024833845],"domain_scores_gemma":[0.99757713,0.00043354052,0.0006140756,0.00041130625,0.0007971838,0.00016675881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030495978,0.00018691043,0.00043390456,0.0002485791,0.00008752171,0.000043890435,0.0004314654,0.000023227503,0.000016266664],"category_scores_gemma":[0.00089597824,0.00013661168,0.00005692413,0.00061331474,0.0002863356,0.00014407538,0.000107192674,0.0003954477,0.0000047280582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003967149,0.00051526545,0.012058259,0.00070206553,0.00019767164,0.00020420688,0.0013467139,0.000011298648,0.002494431,0.9767377,0.0034235888,0.0019120956],"study_design_scores_gemma":[0.00911041,0.0073992237,0.078559645,0.0012069973,0.00030997922,0.00075331837,0.00074970466,0.00024012743,0.005481166,0.85108143,0.044189733,0.0009182766],"about_ca_topic_score_codex":4.706941e-7,"about_ca_topic_score_gemma":5.396644e-7,"teacher_disagreement_score":0.12565628,"about_ca_system_score_codex":0.0000245976,"about_ca_system_score_gemma":0.00004877501,"threshold_uncertainty_score":0.5570862},"labels":[],"label_agreement":null},{"id":"W1995160715","doi":"10.1016/j.ejc.2009.11.009","title":"Circuit and fractional circuit covers of matroids","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matroid; Mathematics; Conjecture; Combinatorics; Cover (algebra); Circumference; Graphic matroid; Set (abstract data type); Discrete mathematics; Geometry; Computer science","score_opus":0.02325855087543759,"score_gpt":0.25863036851149096,"score_spread":0.23537181763605336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995160715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15081978,0.00093973015,0.8222717,0.00047432556,0.00069185416,0.00008022782,0.0000019552467,0.000031796942,0.024688618],"genre_scores_gemma":[0.99842954,0.00011164165,0.0011604121,0.00010797715,0.000051088264,6.922728e-8,1.7766091e-7,0.00000964954,0.00012944585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830616,0.00033311252,0.0004178955,0.00013991866,0.0006063751,0.00019655962],"domain_scores_gemma":[0.9985941,0.00017181368,0.0004048494,0.00027463594,0.00038041174,0.00017415665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014216711,0.00010597809,0.0002106866,0.00026502679,0.00007894542,0.00006690009,0.00083033805,0.000018191406,0.0000094374445],"category_scores_gemma":[0.00017906113,0.00009963549,0.00009001702,0.00046595893,0.000082138824,0.00061150116,0.00009158475,0.00036984528,0.000009213364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026353737,0.00014783863,0.0012659169,0.000009347276,0.000028618788,0.00028059148,0.00027488865,0.00012728319,0.0034777895,0.97676617,0.0005674648,0.01702771],"study_design_scores_gemma":[0.0023192575,0.0023975414,0.07168182,0.000091115806,0.000018285415,0.001018219,0.000075912634,0.00033866006,0.0017554966,0.9111443,0.008875669,0.000283728],"about_ca_topic_score_codex":1.3546001e-7,"about_ca_topic_score_gemma":1.1039677e-8,"teacher_disagreement_score":0.84760976,"about_ca_system_score_codex":0.00004664028,"about_ca_system_score_gemma":0.00007682341,"threshold_uncertainty_score":0.40630174},"labels":[],"label_agreement":null},{"id":"W1995234636","doi":"10.1016/j.ejc.2008.05.006","title":"A new proof of the Erdős–Ko–Rado theorem for intersecting families of permutations","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Coset; Symmetric group; Point (geometry); Upper and lower bounds; Discrete mathematics; Geometry","score_opus":0.037368124268792303,"score_gpt":0.26929644003350856,"score_spread":0.23192831576471626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995234636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9556209,0.0002573742,0.03337507,0.00010353536,0.0011149253,0.00021148931,0.0000067942447,0.000008953096,0.009300976],"genre_scores_gemma":[0.99541914,0.000023969253,0.004098366,0.000020341471,0.000096809665,3.5575738e-7,1.8546504e-7,0.00003195923,0.00030888888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984855,0.00030621016,0.0007145906,0.000072966184,0.00029435696,0.00012638785],"domain_scores_gemma":[0.9976234,0.0005985583,0.0010273589,0.00025628135,0.00043917526,0.000055234115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009355524,0.000119590935,0.00030145713,0.00011593414,0.00018690377,0.0000075899625,0.0005176499,0.000023498742,0.000010273549],"category_scores_gemma":[0.0013105661,0.00007435909,0.0003174016,0.00023069292,0.00015485504,0.00008013382,0.00010623225,0.00023713407,1.5120946e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102215956,0.00012757725,0.0015478778,0.0001635731,0.00015842574,0.000014146333,0.020822993,0.00005880578,0.00052534655,0.9713637,0.0030133182,0.0021019957],"study_design_scores_gemma":[0.0015669529,0.00060847827,0.003009942,0.00027506307,0.0001357604,0.0002770039,0.0024934849,0.000046868594,0.010508973,0.97971,0.0012333713,0.00013412346],"about_ca_topic_score_codex":6.6682594e-7,"about_ca_topic_score_gemma":3.1189927e-7,"teacher_disagreement_score":0.03979824,"about_ca_system_score_codex":0.000023015446,"about_ca_system_score_gemma":0.000094820134,"threshold_uncertainty_score":0.30322757},"labels":[],"label_agreement":null},{"id":"W1995632009","doi":"10.1016/j.ejc.2012.02.002","title":"Immersing complete digraphs","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Digraph; Combinatorics; Mathematics; Eulerian path; Immersion (mathematics); Graph; Simple (philosophy); Degree (music); Discrete mathematics; Pure mathematics; Physics","score_opus":0.03739444157553979,"score_gpt":0.2731345082850047,"score_spread":0.2357400667094649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995632009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07598087,0.0025993125,0.8910917,0.0004408356,0.0027339053,0.000075218886,8.5612714e-7,0.000055478115,0.027021835],"genre_scores_gemma":[0.991082,0.000058900063,0.008522074,0.000084773856,0.00014256935,1.2525446e-7,1.8427794e-7,0.00002017133,0.00008919798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99776024,0.000737576,0.0003988134,0.00010660259,0.0005488751,0.0004478681],"domain_scores_gemma":[0.99846417,0.00018565632,0.00033090703,0.00039050324,0.00027854065,0.0003502252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027624387,0.00012434434,0.0001933615,0.00029962623,0.00015153136,0.0000977961,0.0014120805,0.000013043591,0.000007747954],"category_scores_gemma":[0.00010892278,0.000108125154,0.00014431741,0.0007356892,0.00007779234,0.0011851449,0.0002802899,0.00042418024,0.00007999399],"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.000024636644,0.00025639252,0.004952374,0.00001350311,0.000052507807,0.00024213595,0.0011864295,0.000034316457,0.0023387724,0.9634176,0.0017743391,0.025706982],"study_design_scores_gemma":[0.008385705,0.0035168128,0.105751894,0.0004371251,0.0000934472,0.006607254,0.00086143194,0.0016214041,0.008527658,0.39215955,0.4699522,0.002085502],"about_ca_topic_score_codex":1.3828628e-7,"about_ca_topic_score_gemma":1.0258395e-8,"teacher_disagreement_score":0.9151011,"about_ca_system_score_codex":0.000050694383,"about_ca_system_score_gemma":0.000030707022,"threshold_uncertainty_score":0.4409216},"labels":[],"label_agreement":null},{"id":"W1996049142","doi":"10.1016/j.ejc.2014.08.013","title":"A new class of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math>-ary hyperoperations","year":2014,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Meromorphic and Entire Functions","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Unary operation; Mathematics; Associative property; Class (philosophy); Combinatorics; Discrete mathematics; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.027583616845097646,"score_gpt":0.24471423803650677,"score_spread":0.21713062119140913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996049142","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9702827,0.00019598454,0.014339261,0.00041066366,0.0019518442,0.000040645315,0.000016890717,0.0000565255,0.012705529],"genre_scores_gemma":[0.9930087,0.00019305992,0.004754979,0.00027782796,0.0007147253,0.000004647309,0.000021288222,0.0001353229,0.0008895025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726534,0.0002971877,0.0010529883,0.00024938723,0.00076263916,0.00037243337],"domain_scores_gemma":[0.99726176,0.00047649702,0.0009912382,0.0006529045,0.00023293334,0.00038468422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014071692,0.00026913887,0.00032346422,0.00014261878,0.0003555209,0.00014825289,0.00056816585,0.00014420663,0.00011529259],"category_scores_gemma":[0.0011582475,0.00027685156,0.00043059592,0.00030935448,0.00013074932,0.00034839235,0.00023344242,0.00066249043,0.0004585855],"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.00009030926,0.00029598112,0.00003109459,0.00013730532,0.00021379953,0.00015518727,0.0005603623,0.0002224373,0.0007300732,0.97830015,0.018722707,0.00054060074],"study_design_scores_gemma":[0.008911599,0.0062899324,0.0009883452,0.0022472832,0.0025065104,0.0031219502,0.0016600566,0.75465524,0.006194938,0.03426696,0.17749232,0.001664844],"about_ca_topic_score_codex":0.000016199943,"about_ca_topic_score_gemma":0.000006358916,"teacher_disagreement_score":0.9440332,"about_ca_system_score_codex":0.000020973179,"about_ca_system_score_gemma":0.00033647826,"threshold_uncertainty_score":0.99996835},"labels":[],"label_agreement":null},{"id":"W1996469228","doi":"10.1016/j.ejc.2012.01.010","title":"Subdigraphs with orthogonal factorizations of digraphs","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Digraph; Combinatorics; Mathematics; Disjoint sets; Factorization; Integer (computer science); Arc (geometry); Discrete mathematics; Algorithm; Computer science; Geometry","score_opus":0.006067909235337864,"score_gpt":0.15986234370706287,"score_spread":0.153794434471725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996469228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9633361,0.001424645,0.011663278,0.0000055239225,0.0013298696,0.000048793107,0.0000057339776,0.000041269202,0.022144772],"genre_scores_gemma":[0.99968314,0.00006989585,0.00007828338,0.0000041517583,0.000094665884,2.8868357e-7,0.0000014474049,0.000037746187,0.00003036096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989135,0.00016738799,0.00042392063,0.000041319552,0.0002607226,0.00019314662],"domain_scores_gemma":[0.99925727,0.000054099186,0.00021245658,0.00014608141,0.00016801356,0.00016210416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062262284,0.00012732131,0.00021629824,0.00021117518,0.00004114456,0.000014566927,0.00020612348,0.000019642086,0.000017962644],"category_scores_gemma":[0.000014870057,0.000099275094,0.000111602945,0.00047974783,0.000046422232,0.0002649798,0.000011012412,0.0002058674,0.0000064355822],"study_design_candidate":"observational","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.00008469566,0.00046854888,0.41800442,0.00023889152,0.0006052675,0.000092691625,0.0033869531,0.0025903243,0.004895647,0.56669784,0.0017028485,0.0012318895],"study_design_scores_gemma":[0.007030701,0.0029737533,0.84203565,0.0010389544,0.00065406435,0.0016603803,0.0025014565,0.0001775144,0.0253828,0.010938764,0.10374457,0.0018614114],"about_ca_topic_score_codex":1.2321405e-7,"about_ca_topic_score_gemma":1.2024981e-7,"teacher_disagreement_score":0.5557591,"about_ca_system_score_codex":0.000012848322,"about_ca_system_score_gemma":0.000012464455,"threshold_uncertainty_score":0.4048321},"labels":[],"label_agreement":null},{"id":"W1996940011","doi":"10.1016/j.ejc.2006.08.008","title":"Representations of directed strongly regular graphs","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Mathematics; Combinatorics; Directed graph; Discrete mathematics","score_opus":0.03640506570934796,"score_gpt":0.3005941386890048,"score_spread":0.2641890729796568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996940011","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93885565,0.00028747728,0.0029978452,0.0001229,0.00035656893,0.00012137381,0.0000070674096,0.000049577444,0.05720157],"genre_scores_gemma":[0.99488187,0.000021096665,0.0035680777,0.0000034361549,0.00008404506,4.2367438e-7,0.0000023937494,0.000050602004,0.0013880823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970477,0.0010556708,0.0008836102,0.00011168749,0.00068486365,0.00021642854],"domain_scores_gemma":[0.99731076,0.0006157556,0.0007520495,0.00040536767,0.00082222547,0.0000938214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023458041,0.00012750512,0.00031524248,0.00034668596,0.00007266809,0.000032992626,0.0005034229,0.000025161124,0.00005494155],"category_scores_gemma":[0.0009804235,0.00011401088,0.00019296196,0.00065305876,0.0001252886,0.00014953822,0.00008582742,0.00035114895,0.000012515261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009214404,0.00063675875,0.005461167,0.000073611904,0.000094182586,0.00032722892,0.00025008738,0.000055207114,0.0035239074,0.9694961,0.019735204,0.00025440325],"study_design_scores_gemma":[0.002098436,0.0006212805,0.023404539,0.00012893966,0.0000933073,0.00012579787,0.00024228796,0.000067956425,0.004109075,0.965858,0.0030613136,0.00018908674],"about_ca_topic_score_codex":0.0000027855663,"about_ca_topic_score_gemma":5.935282e-7,"teacher_disagreement_score":0.056026224,"about_ca_system_score_codex":0.000043326247,"about_ca_system_score_gemma":0.00005536723,"threshold_uncertainty_score":0.46492288},"labels":[],"label_agreement":null},{"id":"W1997694836","doi":"10.1016/j.ejc.2014.04.009","title":"Connected obstructions to full graph homomorphisms","year":2014,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"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; Grantová Agentura České Republiky","keywords":"Homomorphism; Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.015460049152079302,"score_gpt":0.24380856122834915,"score_spread":0.22834851207626986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997694836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09234514,0.00009301996,0.89755946,0.00081644655,0.0017078636,0.00008025463,9.393793e-7,0.000074078605,0.007322792],"genre_scores_gemma":[0.97711295,0.00001791143,0.022363616,0.00019133984,0.0001191086,6.805723e-7,3.099469e-7,0.000026407793,0.00016767187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974843,0.000919775,0.0004827631,0.00021043913,0.0005694463,0.00033323493],"domain_scores_gemma":[0.997673,0.00027335447,0.00029474383,0.00060532533,0.0007275773,0.0004260369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019463063,0.0001501137,0.000241178,0.0005226951,0.00019446833,0.00014961674,0.0018640549,0.00001915642,0.000012921029],"category_scores_gemma":[0.0006800478,0.00013599436,0.00013488867,0.001456676,0.000076736374,0.0004325597,0.00030267696,0.00044096628,0.00014020929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028034974,0.00009213223,0.00014175163,0.000005573914,0.00002685527,0.00016403668,0.00023865968,0.00043905585,0.0021341683,0.98223203,0.001728199,0.012769507],"study_design_scores_gemma":[0.002687115,0.003945054,0.009551243,0.0001013574,0.000023428738,0.00139828,0.00009307983,0.0011213276,0.0028297892,0.88344365,0.09420078,0.00060487626],"about_ca_topic_score_codex":2.0497708e-7,"about_ca_topic_score_gemma":1.5238112e-7,"teacher_disagreement_score":0.88476783,"about_ca_system_score_codex":0.000049306676,"about_ca_system_score_gemma":0.00004489774,"threshold_uncertainty_score":0.5545689},"labels":[],"label_agreement":null},{"id":"W1999445910","doi":"10.1006/eujc.2001.0447","title":"On Traces ofd-stresses in the Skeletons of Lower Dimensions of Piecewise-lineard-manifolds","year":2001,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"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; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjecture; Manifold (fluid mechanics); Piecewise; Piecewise linear function; Class (philosophy); Polynomial; Pure mathematics; Piecewise linear manifold; Realization (probability); Construct (python library); Combinatorics; Planar; Simplicial complex; Geometry; Mathematical analysis; Computer science","score_opus":0.017333373654724277,"score_gpt":0.24411360096390353,"score_spread":0.22678022730917924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999445910","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9386882,0.00050963106,0.055442,0.00085216196,0.0007592764,0.00006918451,0.0000016991714,0.0000072139605,0.0036705842],"genre_scores_gemma":[0.9984288,0.00020346783,0.0011298619,0.000097626275,0.000057288926,2.324901e-7,7.066008e-7,0.0000063380558,0.000075635326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9983325,0.00041280538,0.00054679724,0.00009963993,0.00049559143,0.00011267776],"domain_scores_gemma":[0.9985069,0.00041992095,0.00044424756,0.00024442593,0.0003369103,0.000047601316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011794596,0.00009265607,0.00018084871,0.00025864935,0.000053365085,0.00003393873,0.0007069575,0.000015627762,0.000007585575],"category_scores_gemma":[0.00020012591,0.000059935093,0.000098990946,0.00086517143,0.000034102624,0.00020417802,0.00006057572,0.00019066948,0.000004907699],"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.00022460056,0.004992249,0.0027217641,0.000071596616,0.00012901356,0.0014847603,0.0040238663,0.1128125,0.0051469207,0.81896555,0.010971879,0.03845533],"study_design_scores_gemma":[0.019363374,0.033828143,0.3896036,0.002557497,0.00036222325,0.003019192,0.0018216957,0.05950372,0.038467187,0.23194887,0.21721463,0.0023098544],"about_ca_topic_score_codex":0.0000011669891,"about_ca_topic_score_gemma":8.761308e-7,"teacher_disagreement_score":0.58701664,"about_ca_system_score_codex":0.000015272675,"about_ca_system_score_gemma":0.00007024693,"threshold_uncertainty_score":0.24440822},"labels":[],"label_agreement":null},{"id":"W2002583508","doi":"10.1006/eujc.2000.0434","title":"Alternating Knot Diagrams, Euler Circuits and the Interlace Polynomial","year":2001,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Mathematics; Combinatorics; Knot (papermaking); Simple (philosophy); Jones polynomial; Interlacing; Euler's formula; Diagram; Discrete mathematics; Graph; Polynomial; Knot theory; Mathematical analysis; Computer science","score_opus":0.03141400411610264,"score_gpt":0.26671598072042724,"score_spread":0.23530197660432461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002583508","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96799296,0.0013415589,0.0060788444,0.001720778,0.0017223451,0.00008381761,5.6242044e-7,0.000021115256,0.021037988],"genre_scores_gemma":[0.9978163,0.00030900634,0.00019060032,0.00015593113,0.00042329208,3.2437697e-7,1.5543499e-7,0.000030448171,0.0010739145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817693,0.0006265029,0.0005872014,0.00010835256,0.00027514953,0.00022583477],"domain_scores_gemma":[0.9977064,0.001227127,0.0005973506,0.00018927018,0.00016212497,0.00011771686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002405298,0.00014238709,0.00032633197,0.00016073057,0.000120099845,0.000073690055,0.0004338628,0.000024886009,0.000045588087],"category_scores_gemma":[0.0021817333,0.00009104497,0.000117181095,0.00030256045,0.00016225703,0.00010231338,0.00014159628,0.00045105387,0.000018937631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000408431,0.0007647871,0.02376911,0.00010199085,0.0006241352,0.002633796,0.007923052,0.000013550921,0.0001435388,0.7642151,0.054689903,0.1447126],"study_design_scores_gemma":[0.043441504,0.0027009274,0.039366927,0.0004910298,0.00070556917,0.013368363,0.003689251,0.00043361835,0.00034848799,0.5838615,0.3102542,0.0013386492],"about_ca_topic_score_codex":0.000001839091,"about_ca_topic_score_gemma":4.87481e-7,"teacher_disagreement_score":0.2555643,"about_ca_system_score_codex":0.000033196317,"about_ca_system_score_gemma":0.000024643228,"threshold_uncertainty_score":0.37127063},"labels":[],"label_agreement":null},{"id":"W2005133195","doi":"10.1016/j.ejc.2004.07.010","title":"Poset edge-labellings and left modularity","year":2004,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"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; University of New Brunswick; Université du Québec à Montréal","funders":"","keywords":"Mathematics; Partially ordered set; Combinatorics; Bounded function; Lattice (music); Discrete mathematics; Modular design; Computer science; Physics; Mathematical analysis","score_opus":0.0058107588642839,"score_gpt":0.1672636208497889,"score_spread":0.16145286198550501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005133195","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9826433,0.0019853048,0.007872078,0.00006390585,0.0013495318,0.000036716916,0.0000016608576,0.00005261009,0.005994897],"genre_scores_gemma":[0.9993857,0.00025496806,0.00016370705,0.000022966413,0.000092826056,4.3904087e-8,4.4050802e-7,0.000032072247,0.0000472595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992109,0.00010462371,0.00032346384,0.00006272303,0.00015545647,0.00014282201],"domain_scores_gemma":[0.99955106,0.00001998648,0.0000912948,0.00011964698,0.0000849328,0.00013306178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078489946,0.00011562816,0.00017834063,0.00009321948,0.000057694186,0.000046915127,0.00018261417,0.000023289205,0.000004694297],"category_scores_gemma":[0.00002239282,0.00010713451,0.00006077935,0.00010633846,0.000033026074,0.00014983006,0.00002114986,0.00030121583,0.000019924064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016680289,0.0008332568,0.016022608,0.001040144,0.0009482267,0.0042660628,0.012576315,0.062087294,0.033620324,0.85025954,0.008834006,0.009345442],"study_design_scores_gemma":[0.018478155,0.003302147,0.063783765,0.0016313802,0.0003981572,0.0077743237,0.0011974765,0.0019373347,0.026499104,0.6536558,0.21872117,0.0026211832],"about_ca_topic_score_codex":3.1602087e-7,"about_ca_topic_score_gemma":1.0791e-7,"teacher_disagreement_score":0.20988716,"about_ca_system_score_codex":0.000032125812,"about_ca_system_score_gemma":0.000009904298,"threshold_uncertainty_score":0.43688184},"labels":[],"label_agreement":null},{"id":"W2006288216","doi":"10.1016/j.ejc.2005.10.001","title":"Medial layer graphs of equivelar 4-polytopes","year":2005,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Polytope; Transitive relation; Graph; Partially ordered set; Symmetric graph; Discrete mathematics; Dual graph; Line graph; Voltage graph","score_opus":0.05206938189438442,"score_gpt":0.3086400590243661,"score_spread":0.25657067712998166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006288216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94632035,0.000905888,0.023217771,0.0004390127,0.0033421526,0.00024778116,0.000006674334,0.000082004626,0.025438374],"genre_scores_gemma":[0.97508436,0.00012262049,0.023966035,0.000041661777,0.0004342203,6.41123e-7,4.3017633e-7,0.000091489295,0.000258534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99670476,0.00044129314,0.0014895612,0.0001483037,0.0008925245,0.00032357045],"domain_scores_gemma":[0.9961877,0.0007006342,0.0016906111,0.00045604078,0.00074477366,0.0002202564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020794468,0.00027060788,0.00068754336,0.00028414375,0.0000727948,0.000028535334,0.00085120025,0.00005671227,0.000069713686],"category_scores_gemma":[0.0018041596,0.0002324738,0.00030633062,0.0004312834,0.000121588586,0.00035580323,0.00017318953,0.0005081278,0.000037194382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080117505,0.0007881514,0.00018180751,0.00012795276,0.00012881949,0.00015033773,0.001612509,0.0000370795,0.0030669982,0.9863267,0.005280917,0.002218589],"study_design_scores_gemma":[0.003121196,0.0008771917,0.00021339246,0.00025406273,0.00016967379,0.00017519962,0.00015035756,0.00003722724,0.017329963,0.95999056,0.017347783,0.00033342015],"about_ca_topic_score_codex":2.1961547e-7,"about_ca_topic_score_gemma":2.8373694e-7,"teacher_disagreement_score":0.028764026,"about_ca_system_score_codex":0.00009071902,"about_ca_system_score_gemma":0.00008714047,"threshold_uncertainty_score":0.9480006},"labels":[],"label_agreement":null},{"id":"W2009138921","doi":"10.1016/j.ejc.2004.04.011","title":"Counting unrooted loopless planar maps","year":2004,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Isomorphism (crystallography); Planar; Enhanced Data Rates for GSM Evolution; Orientation (vector space); Discrete mathematics; Geometry; Crystallography","score_opus":0.01216748856328748,"score_gpt":0.21037650164486088,"score_spread":0.1982090130815734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009138921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06118028,0.0003594364,0.926741,0.0013260428,0.0007276775,0.000056170324,0.0000015927851,0.00008467605,0.009523102],"genre_scores_gemma":[0.9883641,0.0000331603,0.011276174,0.00013550278,0.00008739537,2.2985866e-7,0.0000015838997,0.000015746187,0.00008609919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886423,0.00010166694,0.00039924606,0.0001240808,0.0003360269,0.00017472848],"domain_scores_gemma":[0.99893755,0.00003869899,0.0003639047,0.00033363918,0.00020517428,0.00012100857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007567682,0.00010130842,0.00014634883,0.00011334516,0.00013100218,0.00016325885,0.0011265498,0.000015109212,0.0000025878714],"category_scores_gemma":[0.00003979091,0.000092804985,0.00008044373,0.0004735253,0.000025809606,0.00031503546,0.00010137529,0.00023916188,0.00009772281],"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.0000043144837,0.0002925148,0.00035202788,0.000017382807,0.000034727196,0.00095208443,0.00068284647,0.000484089,0.0028269945,0.98128855,0.0032073178,0.009857161],"study_design_scores_gemma":[0.012084509,0.0014342922,0.03778295,0.0006055554,0.00012948965,0.0045680413,0.00035362915,0.004403158,0.017584234,0.33866102,0.58072317,0.0016699596],"about_ca_topic_score_codex":0.0000012997863,"about_ca_topic_score_gemma":2.2240323e-7,"teacher_disagreement_score":0.9271838,"about_ca_system_score_codex":0.0000630392,"about_ca_system_score_gemma":0.0000964274,"threshold_uncertainty_score":0.37844777},"labels":[],"label_agreement":null},{"id":"W2011032242","doi":"10.1016/j.ejc.2014.08.031","title":"An infinite family of inv-Wilf-equivalent permutation pairs","year":2014,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Simon Fraser University","keywords":"Mathematics; Combinatorics; Permutation (music); Conjecture; Equivalence (formal languages); Counterexample; Discrete mathematics","score_opus":0.04412760451355986,"score_gpt":0.3042648882213948,"score_spread":0.26013728370783495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011032242","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84378135,0.000106821724,0.14406407,0.00006308357,0.0017437681,0.00016412584,0.0000028604954,0.00006613048,0.010007792],"genre_scores_gemma":[0.9864786,0.000045293327,0.013011636,0.00005119334,0.00024541674,8.617334e-7,0.0000016172297,0.000100826444,0.000064544336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99606127,0.0010905823,0.0015176649,0.0001738731,0.00087626145,0.00028037885],"domain_scores_gemma":[0.995355,0.00080703135,0.0019804027,0.00060948275,0.0010038333,0.00024426714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0033731947,0.00027393448,0.00063809677,0.00028130427,0.000093371855,0.000047569967,0.00075420697,0.0000560921,0.000014405627],"category_scores_gemma":[0.0023351973,0.00024733553,0.0002100916,0.00039658975,0.00009613031,0.00042899264,0.00009644855,0.00044453976,0.000018965631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008579106,0.0011465535,0.00072178675,0.00036270954,0.00009652425,0.00007279992,0.002941832,0.00030950626,0.004725105,0.98446953,0.0011989755,0.0038688967],"study_design_scores_gemma":[0.0026747421,0.0026775822,0.0015848905,0.00034314735,0.00015479334,0.00007614432,0.00062665605,0.0007522527,0.0021814536,0.9847161,0.0038477927,0.00036443715],"about_ca_topic_score_codex":4.2068285e-7,"about_ca_topic_score_gemma":1.1680121e-7,"teacher_disagreement_score":0.14269727,"about_ca_system_score_codex":0.00010011982,"about_ca_system_score_gemma":0.00007739869,"threshold_uncertainty_score":0.9999979},"labels":[],"label_agreement":null},{"id":"W2012436566","doi":"10.1016/j.ejc.2011.01.004","title":"Generalized descent patterns in permutations and associated Hopf algebras","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Noncommutative geometry; Hopf algebra; Symmetric function; Descent (aeronautics); Mathematics; Statistic; Permutation (music); Combinatorics; Pure mathematics; Algebra over a field; Statistics; Physics","score_opus":0.07185760605114695,"score_gpt":0.2827589003298267,"score_spread":0.21090129427867976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012436566","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9874527,0.00014103987,0.008890586,0.000050532002,0.00075217616,0.00014815628,0.0000031070513,0.00003565275,0.0025260923],"genre_scores_gemma":[0.9938365,0.00012363431,0.005788127,0.000035540786,0.000049863513,0.0000013869801,9.106476e-7,0.00006879265,0.000095222626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766636,0.0006085902,0.0009417507,0.00014032958,0.00037594498,0.00026700995],"domain_scores_gemma":[0.99814564,0.00028995634,0.00083478406,0.00023250649,0.00032957425,0.00016754524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001431112,0.00020899317,0.0004417038,0.00023478524,0.000081667415,0.000036550362,0.00033280742,0.000044507986,0.000034827615],"category_scores_gemma":[0.001476951,0.00019221239,0.00009944007,0.00030190012,0.000045789875,0.00022274793,0.00010734491,0.00040946135,0.0000074390696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062080144,0.0015538589,0.018950298,0.00011320976,0.00013301565,0.00095940696,0.009216843,0.0000058994056,0.00019678142,0.96745896,0.00059487997,0.000754757],"study_design_scores_gemma":[0.0037813657,0.00046820636,0.026101511,0.00029802992,0.00009812935,0.00012689373,0.00048432656,0.000079643505,0.00040780767,0.9676852,0.0001719089,0.00029692997],"about_ca_topic_score_codex":0.0000021359392,"about_ca_topic_score_gemma":0.0000027230592,"teacher_disagreement_score":0.008732516,"about_ca_system_score_codex":0.00014766608,"about_ca_system_score_gemma":0.000047708592,"threshold_uncertainty_score":0.7838194},"labels":[],"label_agreement":null},{"id":"W2017407451","doi":"10.1016/j.ejc.2007.11.026","title":"On the Whitney numbers of the second kind for the star poset","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Partially ordered set; Mathematics; Star (game theory); Combinatorics; Generating function; Function (biology); Discrete mathematics; Mathematical analysis","score_opus":0.06727468315416679,"score_gpt":0.2745214165993272,"score_spread":0.20724673344516042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017407451","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9587848,0.00012730145,0.00466289,0.005297649,0.0005895262,0.000658915,0.000042889165,0.000010814677,0.029825222],"genre_scores_gemma":[0.996441,0.000029539,0.0007257184,0.00023683994,0.00007191389,0.0000030506965,2.3781487e-7,0.000032526343,0.002459157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873865,0.00020210954,0.0005109229,0.000064702406,0.00035698002,0.00012666675],"domain_scores_gemma":[0.99649924,0.0018908875,0.00078274426,0.0005157889,0.0002666499,0.000044690074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015305859,0.00011065358,0.00018226917,0.000025974798,0.00033564318,0.00002304948,0.00083307625,0.000016345013,0.00009350867],"category_scores_gemma":[0.00060963904,0.00004807706,0.00021373357,0.00017765428,0.000115431794,0.00003092537,0.00006712236,0.00028641312,0.00000841582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017058092,0.00026504073,0.00006467435,0.000053897227,0.00009573553,0.000004748759,0.002056624,0.000010924572,0.00012101092,0.6884898,0.30875674,0.00006374344],"study_design_scores_gemma":[0.0015319979,0.00043935576,0.0014495533,0.00018204881,0.00017011732,0.0002124245,0.0009577978,0.00026799663,0.0028091874,0.7364127,0.25535268,0.00021416886],"about_ca_topic_score_codex":2.4474744e-7,"about_ca_topic_score_gemma":7.348279e-7,"teacher_disagreement_score":0.053404067,"about_ca_system_score_codex":0.000021633183,"about_ca_system_score_gemma":0.00005548956,"threshold_uncertainty_score":0.258153},"labels":[],"label_agreement":null},{"id":"W2018030990","doi":"10.1016/j.ejc.2008.01.016","title":"Deforming Meyer sets","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Deformation (meteorology); Injective function; Homomorphism; Set (abstract data type); Group (periodic table); Combinatorics; Point (geometry); Geometry; Physics; Computer science","score_opus":0.023107817306323695,"score_gpt":0.21292034917158958,"score_spread":0.1898125318652659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018030990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9860235,0.0009900376,0.00029560426,0.00009890288,0.0013546636,0.000026249174,0.0000013085129,0.000026776057,0.011182999],"genre_scores_gemma":[0.998638,0.00011238626,0.00067519903,0.000108274624,0.0001449897,7.974859e-8,2.203263e-7,0.000020501615,0.00030034946],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988037,0.0002151141,0.00038373412,0.000078330464,0.00033846384,0.00018067629],"domain_scores_gemma":[0.99925333,0.000027697894,0.00029026225,0.00012984556,0.00018227009,0.00011657364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006938788,0.00010296004,0.00017587465,0.000054213855,0.00018620277,0.000040890212,0.00034464608,0.0000148227755,0.00016621481],"category_scores_gemma":[0.000081562415,0.00007052728,0.00008359373,0.00010090982,0.00007352358,0.00024153278,0.000071702874,0.0001685965,0.00010226424],"study_design_candidate":"bench_or_experimental","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.00089300476,0.0006698271,0.013355002,0.00024643185,0.00016116662,0.02024206,0.01806208,0.0012779528,0.7780683,0.030010877,0.11252189,0.024491431],"study_design_scores_gemma":[0.0050666486,0.0036215158,0.040096145,0.00031745134,0.00010105453,0.020312302,0.000653308,0.00012268493,0.2614215,0.021763433,0.6452579,0.0012660361],"about_ca_topic_score_codex":0.0000016372072,"about_ca_topic_score_gemma":1.0162382e-7,"teacher_disagreement_score":0.532736,"about_ca_system_score_codex":0.000033720633,"about_ca_system_score_gemma":0.00004303778,"threshold_uncertainty_score":0.28760192},"labels":[],"label_agreement":null},{"id":"W2018081095","doi":"10.1006/eujc.1999.0318","title":"Subpolytopes of Cyclic Polytopes","year":2000,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Polytope; Mathematics; Combinatorics; Polytope model; Combinatorial analysis; Combinatorial proof","score_opus":0.004005648358442802,"score_gpt":0.15832502605755522,"score_spread":0.15431937769911241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018081095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9122675,0.0021685981,0.00025781916,0.000019633486,0.0007389233,0.000031303178,0.0000019559127,0.000038487608,0.084475785],"genre_scores_gemma":[0.99895626,0.00034620715,0.00003971734,0.000013287085,0.000106521205,1.3266444e-7,3.2269196e-7,0.000035476547,0.00050208636],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99885505,0.00020996715,0.00053207204,0.000051898627,0.00020175302,0.00014923682],"domain_scores_gemma":[0.9994951,0.000043091237,0.0001279468,0.00016891476,0.000068683206,0.00009627374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006624411,0.000118008466,0.0002559338,0.000120593075,0.00003081222,0.000019308194,0.0003303546,0.000020008249,0.00016636921],"category_scores_gemma":[0.000016887063,0.00010349721,0.00013594356,0.00023935066,0.00003807833,0.0001352873,0.000009937694,0.00019930798,0.00006518289],"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.0008379416,0.0018489169,0.03003158,0.0016578317,0.0023786651,0.0039289505,0.013047615,0.045506977,0.10567798,0.31711623,0.05724865,0.42071867],"study_design_scores_gemma":[0.008046362,0.0029540067,0.083171986,0.0013832335,0.00034505627,0.0020686213,0.0010017529,0.00086252164,0.09034984,0.029128524,0.7788894,0.0017986567],"about_ca_topic_score_codex":4.918736e-7,"about_ca_topic_score_gemma":8.399358e-8,"teacher_disagreement_score":0.72164077,"about_ca_system_score_codex":0.000015140402,"about_ca_system_score_gemma":0.000008656144,"threshold_uncertainty_score":0.42204937},"labels":[],"label_agreement":null},{"id":"W2018084637","doi":"10.1016/j.ejc.2004.07.014","title":"Homomorphism bounded classes of graphs","year":2005,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Homomorphism; Combinatorics; Bounded function; Planar graph; Discrete mathematics; 1-planar graph; Graph; Class (philosophy); Chordal graph","score_opus":0.020602692775760423,"score_gpt":0.26433551195402494,"score_spread":0.2437328191782645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018084637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42331225,0.0031755876,0.5361601,0.0019811178,0.0016936633,0.00016823295,0.0000025861345,0.00009426495,0.03341216],"genre_scores_gemma":[0.9829383,0.00020695478,0.016440906,0.00007731301,0.00006583197,2.101856e-7,1.6631238e-7,0.000020579944,0.00024973587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764067,0.00060737535,0.00062959164,0.00015065368,0.0006981924,0.00027351239],"domain_scores_gemma":[0.9978849,0.00020403757,0.00058160146,0.000498617,0.00063700345,0.0001938057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001961327,0.00013469903,0.00027425526,0.0004134622,0.000092942275,0.000080431564,0.0018956277,0.000019949415,0.000012935596],"category_scores_gemma":[0.00020898774,0.0001180631,0.00017725574,0.0008813929,0.00015764878,0.00074454874,0.00025831218,0.0004193782,0.000033448978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000291144,0.00027155573,0.00061355013,0.000014322327,0.00004409402,0.00026578063,0.00035386192,0.00011405452,0.0017120045,0.97662246,0.0019348094,0.018024385],"study_design_scores_gemma":[0.0040904814,0.0025254765,0.009256967,0.00017352737,0.00003277741,0.00091878895,0.000108147695,0.00095982465,0.018103559,0.8227426,0.14054812,0.00053975335],"about_ca_topic_score_codex":1.9721101e-7,"about_ca_topic_score_gemma":1.568492e-7,"teacher_disagreement_score":0.55962604,"about_ca_system_score_codex":0.000051939875,"about_ca_system_score_gemma":0.000104301245,"threshold_uncertainty_score":0.48144737},"labels":[],"label_agreement":null},{"id":"W2022451101","doi":"10.1016/j.ejc.2011.09.002","title":"Connectivity augmentation in planar straight line graphs","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Planar graph; Book embedding; Planar straight-line graph; Mathematics; Polyhedral graph; Embedding; Planar; Outerplanar graph; Line graph; Graph; Discrete mathematics; 1-planar graph; Pathwidth; Computer science; Artificial intelligence","score_opus":0.03723774661021497,"score_gpt":0.23406813937796137,"score_spread":0.1968303927677464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022451101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39475542,0.00016018802,0.5950436,0.00014288307,0.0011872081,0.000054936783,6.600312e-7,0.000019102119,0.008635986],"genre_scores_gemma":[0.9913644,0.000027972344,0.008425326,0.00007632347,0.00004831614,2.3676479e-7,0.0000012064369,0.000005885738,0.000050285817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998811,0.00034106584,0.00037538857,0.00011026856,0.00025364695,0.00010862716],"domain_scores_gemma":[0.99926674,0.00006379197,0.00028276234,0.00012214879,0.00018788975,0.00007667644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011412615,0.00008094267,0.00011941666,0.00030599424,0.000046371075,0.000042712676,0.00038698205,0.000013410439,0.000014031755],"category_scores_gemma":[0.000060233633,0.00007591503,0.000052784715,0.0005661819,0.000014229329,0.00052349985,0.00003579633,0.00017005362,0.000012068611],"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.00007677371,0.0008328388,0.0052126423,0.00001784156,0.00004419462,0.0008397561,0.0032962535,0.0014657306,0.0014573148,0.94379926,0.0012972523,0.04166017],"study_design_scores_gemma":[0.0065918206,0.0035044532,0.62309384,0.00013770458,0.00003354244,0.0005602705,0.00015397274,0.0107921995,0.013767784,0.33569708,0.005012519,0.0006547832],"about_ca_topic_score_codex":0.0000013188519,"about_ca_topic_score_gemma":0.0000012932544,"teacher_disagreement_score":0.61788124,"about_ca_system_score_codex":0.000037760874,"about_ca_system_score_gemma":0.00005372659,"threshold_uncertainty_score":0.3095725},"labels":[],"label_agreement":null},{"id":"W2023927275","doi":"10.1016/j.ejc.2012.03.016","title":"A bijection between words and multisets of necklaces","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Bijection; Lexicographical order; Mathematics; Combinatorics; Permutation (music); Order (exchange); Set (abstract data type); Inverse; Word (group theory); Discrete mathematics; Computer science","score_opus":0.014712648348581674,"score_gpt":0.22803322308592308,"score_spread":0.2133205747373414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023927275","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9159407,0.001397243,0.08018676,0.00009925819,0.0008466764,0.00002678738,6.3934107e-7,0.000020516336,0.0014814303],"genre_scores_gemma":[0.99671793,0.00007649016,0.0029915278,0.000022461223,0.00014857794,6.617074e-8,1.4433697e-7,0.000009178808,0.00003364487],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.998941,0.00029043414,0.00033206504,0.00006695629,0.00022160231,0.00014794628],"domain_scores_gemma":[0.9990975,0.0001225819,0.0003984096,0.00016298919,0.00008698069,0.00013149175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016016645,0.000080847814,0.00017424184,0.00013567478,0.00004688181,0.000043381027,0.00039727063,0.000015022967,0.0000023963828],"category_scores_gemma":[0.00007446158,0.00006617353,0.000051244617,0.00024671972,0.000035164954,0.00060333824,0.00014216913,0.00014499175,0.000005151369],"study_design_candidate":"observational","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.000045167188,0.0008964003,0.34917417,0.00015100854,0.00024429004,0.00014718279,0.015584943,0.000027927947,0.0047175516,0.25016606,0.002807115,0.37603816],"study_design_scores_gemma":[0.0026298505,0.0013746663,0.9548888,0.00026941855,0.00007933614,0.00045121132,0.0003781932,0.0008932279,0.0077013504,0.015740372,0.015151131,0.00044242543],"about_ca_topic_score_codex":7.9103637e-7,"about_ca_topic_score_gemma":1.9992179e-8,"teacher_disagreement_score":0.6057146,"about_ca_system_score_codex":0.000015687467,"about_ca_system_score_gemma":0.000014508245,"threshold_uncertainty_score":0.26984784},"labels":[],"label_agreement":null},{"id":"W2024214480","doi":"10.1016/j.ejc.2004.08.007","title":"Rigidity of ball-polyhedra in Euclidean 3-space","year":2004,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dual polyhedron; Polyhedron; Ball (mathematics); Mathematics; Rigidity (electromagnetism); Euclidean space; Euclidean geometry; Combinatorics; Pure mathematics; Geometry","score_opus":0.045644182008671694,"score_gpt":0.3011429456739542,"score_spread":0.2554987636652825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024214480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93704695,0.00014611715,0.022648895,0.000824675,0.00025638525,0.00015517282,0.000003861639,0.000019003759,0.03889895],"genre_scores_gemma":[0.98728245,0.00006137088,0.012393089,0.000018427738,0.00005121624,5.019923e-7,3.1486408e-7,0.00003080996,0.00016181645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984307,0.00014389135,0.0008425723,0.00008710724,0.0003409679,0.00015475266],"domain_scores_gemma":[0.9983561,0.00020085073,0.0008120928,0.00030313773,0.00022506012,0.00010277326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016073465,0.00012233235,0.0003361708,0.00015340898,0.000036743157,0.000020278712,0.0004131274,0.00002394513,0.000026782003],"category_scores_gemma":[0.00046579988,0.000105853964,0.00012383694,0.00033479492,0.00004677587,0.00008602585,0.00006537575,0.00028590523,0.000015628631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012282977,0.0010451407,0.00050331827,0.00013969737,0.0000320414,0.0001072893,0.001294311,0.00008186693,0.0009248166,0.991065,0.0045739235,0.00022029542],"study_design_scores_gemma":[0.0026151715,0.0003494368,0.002246125,0.00041070124,0.000054892284,0.00011216187,0.0003151547,0.000033717486,0.003950592,0.9808749,0.008815993,0.00022118661],"about_ca_topic_score_codex":0.0000018830061,"about_ca_topic_score_gemma":0.0000013253728,"teacher_disagreement_score":0.050235514,"about_ca_system_score_codex":0.000070566355,"about_ca_system_score_gemma":0.00007382649,"threshold_uncertainty_score":0.43165994},"labels":[],"label_agreement":null},{"id":"W2026687552","doi":"10.1016/j.ejc.2014.04.008","title":"Universality of intervals of line graph order","year":2014,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Mathematics; Combinatorics; Universality (dynamical systems); Line graph; Graph; Discrete mathematics; Physics","score_opus":0.02152212209297294,"score_gpt":0.26989417466615184,"score_spread":0.2483720525731789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026687552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13609828,0.0001738668,0.8575277,0.00019788528,0.0004426179,0.000042479413,9.277706e-7,0.000013039008,0.005503201],"genre_scores_gemma":[0.991805,0.00005881056,0.007968095,0.000025613563,0.000026321897,4.6755407e-8,1.5478214e-7,0.000012621624,0.0001033266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974023,0.0011726447,0.0006211628,0.00012099019,0.00051434815,0.00016853814],"domain_scores_gemma":[0.99711055,0.00027831068,0.00076331926,0.0004883622,0.0012332391,0.0001262369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036282202,0.00010161389,0.00031160054,0.00032093833,0.000033296114,0.000017819157,0.0016362845,0.000016778813,0.000008423626],"category_scores_gemma":[0.00058059744,0.00008670864,0.00014665582,0.0009850302,0.00015552947,0.00034204178,0.00032865396,0.0002898344,0.0000046078153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007173959,0.00032131892,0.0015758723,0.000066779,0.000067610796,0.00006171136,0.0005785876,0.0005081989,0.002524609,0.97829586,0.0003172656,0.0156104285],"study_design_scores_gemma":[0.0059137456,0.0074260533,0.015874572,0.0004448554,0.000056964902,0.00016191005,0.00023061977,0.0037895604,0.03860917,0.90842843,0.018525291,0.0005388457],"about_ca_topic_score_codex":7.2833524e-7,"about_ca_topic_score_gemma":1.0988659e-7,"teacher_disagreement_score":0.85570675,"about_ca_system_score_codex":0.000020449059,"about_ca_system_score_gemma":0.00005523497,"threshold_uncertainty_score":0.35358757},"labels":[],"label_agreement":null},{"id":"W2027966825","doi":"10.1016/j.ejc.2013.10.007","title":"Semilattice polymorphisms and chordal graphs","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"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","keywords":"Semilattice; Chordal graph; Mathematics; Combinatorics; Indifference graph; Discrete mathematics; Graph","score_opus":0.013216061297907762,"score_gpt":0.234110532029467,"score_spread":0.22089447073155924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027966825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6378569,0.0029745423,0.33485335,0.0024778387,0.0015168826,0.0002204281,7.853309e-7,0.00009474263,0.020004528],"genre_scores_gemma":[0.99030125,0.00016803006,0.008998119,0.000182268,0.000046897632,5.4860834e-7,9.4343406e-8,0.000020072544,0.00028270355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981993,0.0005206193,0.00037179055,0.00016686713,0.00045665255,0.00028481084],"domain_scores_gemma":[0.9984951,0.00018994148,0.00026016802,0.00035840197,0.00038832985,0.000308063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001334899,0.00013186569,0.0001861428,0.00027252283,0.00012136264,0.00021740109,0.0011574156,0.000017321145,0.000018999635],"category_scores_gemma":[0.00016131799,0.000110136454,0.000076164026,0.0005685776,0.000110054876,0.0010100842,0.0003356561,0.00041946722,0.000075092576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017089626,0.00015515022,0.0038359503,0.000016267526,0.000057088757,0.0005656696,0.0006907691,0.000018680754,0.004025641,0.93937165,0.0041906126,0.047055423],"study_design_scores_gemma":[0.0025002658,0.0016119585,0.06369794,0.00009622047,0.000019956635,0.0016049839,0.000112571826,0.0012272993,0.0021254108,0.91258556,0.013891927,0.0005259116],"about_ca_topic_score_codex":8.3414676e-7,"about_ca_topic_score_gemma":2.9455945e-8,"teacher_disagreement_score":0.35244435,"about_ca_system_score_codex":0.000023710158,"about_ca_system_score_gemma":0.000035131612,"threshold_uncertainty_score":0.4491234},"labels":[],"label_agreement":null},{"id":"W2032387361","doi":"10.1016/j.ejc.2010.06.002","title":"A conjecture of Welsh revisited","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matroid; Combinatorics; Conjecture; Mathematics; Welsh; Simple (philosophy); Discrete mathematics","score_opus":0.011226861763532355,"score_gpt":0.2564675826925108,"score_spread":0.24524072092897845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032387361","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48395276,0.0010043995,0.48321316,0.0012399679,0.0029014535,0.00018507561,0.0000031787558,0.00007418387,0.027425816],"genre_scores_gemma":[0.99059093,0.000039677685,0.009056007,0.0000525116,0.00007831122,1.0986908e-7,1.7623425e-7,0.000016417298,0.00016586676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982268,0.00045750092,0.00047786714,0.00012945419,0.000508613,0.00019973613],"domain_scores_gemma":[0.99797255,0.00018558669,0.0005176756,0.00053923717,0.0006112867,0.00017366189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022682946,0.0001087908,0.00024194717,0.00026633864,0.00005821694,0.000059002767,0.0017850715,0.000024608707,0.000021462203],"category_scores_gemma":[0.0005022588,0.00008819037,0.00012952804,0.00075113634,0.000102293365,0.0003628075,0.00024649204,0.0008254143,0.000018706402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028870747,0.000141687,0.0012843311,0.000028045419,0.000036096826,0.00052002165,0.0003415536,0.000021899174,0.018399006,0.9647257,0.0016259915,0.012846832],"study_design_scores_gemma":[0.006172417,0.003778803,0.026983999,0.00031610805,0.00004863483,0.0025639005,0.00008448515,0.000912806,0.04315087,0.7099281,0.2052404,0.0008195159],"about_ca_topic_score_codex":1.3377205e-7,"about_ca_topic_score_gemma":6.955348e-8,"teacher_disagreement_score":0.50663817,"about_ca_system_score_codex":0.000012801574,"about_ca_system_score_gemma":0.0000732724,"threshold_uncertainty_score":0.3596299},"labels":[],"label_agreement":null},{"id":"W2033843939","doi":"10.1016/j.ejc.2003.07.007","title":"Embedding grids in surfaces","year":2004,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"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; Consejo Nacional de Ciencia y Tecnología","keywords":"Embedding; Mathematics; Grid; Combinatorics; Surface (topology); Minor (academic); Square tiling; Graph; Discrete mathematics; Geometry; Computer science; Artificial intelligence","score_opus":0.013193596942656746,"score_gpt":0.24235195760164982,"score_spread":0.2291583606589931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033843939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5137477,0.0003558517,0.48214808,0.0005478043,0.0011333163,0.000023756764,1.185259e-7,0.000014506926,0.0020288827],"genre_scores_gemma":[0.98609716,0.000039474304,0.0136450315,0.00008042429,0.00008605697,8.173737e-8,2.9080275e-7,0.0000057782086,0.00004567587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898785,0.00016481134,0.00035156228,0.000092471266,0.0002863989,0.00011691182],"domain_scores_gemma":[0.99939924,0.000049583698,0.00019856477,0.000113523194,0.00016879743,0.0000702928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011331855,0.000071014176,0.000111400586,0.00023062943,0.00004817004,0.00009695004,0.00048371748,0.000010317947,0.0000021485098],"category_scores_gemma":[0.000086031316,0.00006587872,0.000048424252,0.00059593853,0.000010819548,0.00048895687,0.00007718052,0.0001733697,0.000019131992],"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.000011835894,0.00028436055,0.0010309865,0.000012275935,0.000017218943,0.00088277896,0.0013314531,0.6465275,0.0010679669,0.334009,0.00054289895,0.014281698],"study_design_scores_gemma":[0.018955667,0.004326259,0.2204285,0.00081636093,0.000041048777,0.0025488692,0.00038379253,0.08798868,0.01680013,0.5801726,0.0658141,0.0017239777],"about_ca_topic_score_codex":6.176405e-7,"about_ca_topic_score_gemma":2.5264393e-7,"teacher_disagreement_score":0.55853885,"about_ca_system_score_codex":0.0000737348,"about_ca_system_score_gemma":0.00009465468,"threshold_uncertainty_score":0.2686456},"labels":[],"label_agreement":null},{"id":"W2035172594","doi":"10.1016/j.ejc.2009.11.020","title":"Geometric properties of Assur graphs","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Characterization (materials science); Link (geometry); Combinatorics; Focus (optics); Geometric analysis; Mathematical analysis; Physics","score_opus":0.01050891993799969,"score_gpt":0.17151978281479086,"score_spread":0.16101086287679117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035172594","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98482096,0.00336761,0.0055559366,0.00004612377,0.0004633788,0.000026208065,4.4489295e-7,0.00002695598,0.005692369],"genre_scores_gemma":[0.9989829,0.00043737254,0.00048122826,0.000012965369,0.000037705344,2.4658853e-8,3.5530763e-7,0.000011263874,0.000036173435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9992129,0.00005213209,0.00039505132,0.000037790804,0.00021480709,0.00008731461],"domain_scores_gemma":[0.9994689,0.000007935196,0.00016347996,0.000084460386,0.00022402316,0.000051175026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002856167,0.0000804431,0.00018998628,0.00032888158,0.00002136388,0.000019955562,0.00016956918,0.000012411001,0.000011372417],"category_scores_gemma":[0.000056294757,0.00005909068,0.00010770157,0.00076867867,0.000011233084,0.00012618206,0.0000072737375,0.00012337243,0.0000030539802],"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.00014188437,0.0004922107,0.009184451,0.00035712,0.0010334902,0.00038851306,0.0017074872,0.6047384,0.07007742,0.027064072,0.01477977,0.27003515],"study_design_scores_gemma":[0.009411075,0.0060049193,0.6162246,0.0011665389,0.0012391744,0.00067340996,0.00062945695,0.06290224,0.24463709,0.024465429,0.03017024,0.0024758412],"about_ca_topic_score_codex":1.5860967e-7,"about_ca_topic_score_gemma":1.8377847e-8,"teacher_disagreement_score":0.60704017,"about_ca_system_score_codex":0.000019021394,"about_ca_system_score_gemma":0.0000059419845,"threshold_uncertainty_score":0.2409648},"labels":[],"label_agreement":null},{"id":"W2035476338","doi":"10.1016/j.ejc.2006.08.015","title":"Self-complementary two-graphs and almost self-complementary double covers","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Cograph; Vertex (graph theory); Discrete mathematics; Automorphism group; Split graph; Graph; Automorphism; Pathwidth; Line graph","score_opus":0.035989071461162606,"score_gpt":0.2986098030622003,"score_spread":0.2626207316010377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035476338","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.948612,0.00054110796,0.000460085,0.0005941543,0.0007519034,0.0004297972,0.000029882362,0.00016562405,0.048415486],"genre_scores_gemma":[0.98759246,0.00012611941,0.011484728,0.00018164057,0.00021750732,0.0000015498401,0.00001602596,0.00011749471,0.0002624755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99623954,0.0008616438,0.0011100798,0.0002662095,0.0009592971,0.0005632412],"domain_scores_gemma":[0.9976928,0.0005889239,0.00066103914,0.00042523988,0.00036604627,0.0002659571],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037413074,0.0003304559,0.00048914837,0.00040441277,0.00029006574,0.00015812895,0.0007315324,0.000028458326,0.00020784106],"category_scores_gemma":[0.000047849757,0.0003077228,0.00018930314,0.00049671455,0.000102075326,0.00048090605,0.00034145568,0.0006431186,0.000045662055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041784765,0.0022317572,0.014246991,0.0002752003,0.0005432928,0.0016023382,0.0011706627,0.000014519737,0.0005160046,0.9109199,0.06767853,0.0003829702],"study_design_scores_gemma":[0.024513641,0.0028502806,0.004674156,0.00018278265,0.00048661555,0.0012259334,0.0014547426,0.00018933693,0.0014783766,0.78228754,0.1797162,0.00094042043],"about_ca_topic_score_codex":0.00001884668,"about_ca_topic_score_gemma":0.000004775156,"teacher_disagreement_score":0.12863237,"about_ca_system_score_codex":0.00021022756,"about_ca_system_score_gemma":0.00008276304,"threshold_uncertainty_score":0.9999375},"labels":[],"label_agreement":null},{"id":"W2035770966","doi":"10.1016/j.ejc.2015.02.021","title":"The acquaintance time of (percolated) random geometric graphs","year":2015,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"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; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Ryerson University","keywords":"Combinatorics; Mathematics; Random regular graph; Random graph; Random geometric graph; Euclidean geometry; Graph; Discrete mathematics; Spatial network; Line graph; Geometry; Voltage graph","score_opus":0.04005132894232749,"score_gpt":0.27701960309160834,"score_spread":0.23696827414928084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035770966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053851567,0.0033178427,0.93020785,0.00029328238,0.0016946725,0.00021428855,0.000009173015,0.000032183718,0.01037916],"genre_scores_gemma":[0.9960469,0.00015165078,0.0033683958,0.00002777185,0.000053524862,4.8387085e-7,2.744019e-7,0.00003445947,0.00031651955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793124,0.0003263759,0.00081130705,0.00008565215,0.00063562935,0.00020981678],"domain_scores_gemma":[0.99582344,0.0019027691,0.00076216797,0.00023250007,0.0010692545,0.00020989486],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0036240355,0.00013461296,0.0003725506,0.00014439454,0.0000870418,0.000043177235,0.00057634944,0.000025998068,0.000012800417],"category_scores_gemma":[0.009040525,0.00008496134,0.00012539227,0.0007717886,0.00006796591,0.0000818619,0.00007540256,0.00028954187,0.00003096316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004956061,0.00030862237,0.00003381136,0.00007110843,0.00014861855,0.00021265875,0.0005503098,0.000020651743,0.000104548606,0.9723314,0.017629024,0.008093665],"study_design_scores_gemma":[0.0037424194,0.0012316722,0.000052983232,0.000110489265,0.00011792883,0.00016470808,0.00021497384,0.0010717585,0.00023632265,0.9893718,0.0035364004,0.0001485794],"about_ca_topic_score_codex":2.5498431e-7,"about_ca_topic_score_gemma":5.551604e-8,"teacher_disagreement_score":0.94219536,"about_ca_system_score_codex":0.000044360808,"about_ca_system_score_gemma":0.000099571065,"threshold_uncertainty_score":0.99930674},"labels":[],"label_agreement":null},{"id":"W2036097200","doi":"10.1016/j.ejc.2015.01.010","title":"Corrigendum to “Many large eigenvalues in sparse graphs” [European J. Combin. 34 (2013) 1125–1129]","year":2015,"lang":"en","type":"erratum","venue":"European Journal of Combinatorics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Eigenvalues and eigenvectors; Physics","score_opus":0.028259423805735356,"score_gpt":0.2461163809714948,"score_spread":0.21785695716575945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036097200","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025032065,0.017681006,0.108382694,0.0022272842,0.34513435,0.001141309,0.00011387417,0.0005028532,0.5223134],"genre_scores_gemma":[0.24117817,0.008715133,0.014700643,0.0053188605,0.012889013,0.000014448501,0.00019886957,0.0017287444,0.7152561],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.989264,0.0046012904,0.0021974721,0.0008692134,0.0018519587,0.0012160824],"domain_scores_gemma":[0.99387443,0.00010085088,0.0019279526,0.0017671946,0.0011245371,0.0012050463],"candidate_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0122614615,0.00093702856,0.0014146768,0.0016288678,0.00026360858,0.0006523722,0.006788068,0.00019745444,0.000058681475],"category_scores_gemma":[0.0004864461,0.0008747277,0.00056422374,0.001958371,0.000106986234,0.00079760834,0.001795454,0.0034368443,0.0011320589],"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.00003779914,0.00057928875,0.000080415026,0.00007036234,0.000082733735,0.0063655768,0.0010964852,0.00003114762,0.0000060330894,0.09214686,0.8967022,0.0028011387],"study_design_scores_gemma":[0.002269272,0.001468019,0.0011713238,0.0007244243,0.000065599546,0.00046311316,0.00013507436,0.0006886633,0.000017229218,0.028783215,0.9631634,0.0010506903],"about_ca_topic_score_codex":0.0000072628513,"about_ca_topic_score_gemma":0.0000037629145,"teacher_disagreement_score":0.33224532,"about_ca_system_score_codex":0.00036757762,"about_ca_system_score_gemma":0.00060497737,"threshold_uncertainty_score":0.99964565},"labels":[],"label_agreement":null},{"id":"W2037445555","doi":"10.1006/eujc.2001.0456","title":"Hamilton-Connected Cayley Graphs on Hamiltonian Groups","year":2001,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Combinatorics; Cayley graph; Valency; Bipartite graph; Hamiltonian (control theory); Hamiltonian path; Vertex-transitive graph; Pancyclic graph; Complete bipartite graph; Graph; Discrete mathematics; Voltage graph; Chordal graph; Line graph; 1-planar graph","score_opus":0.06348036643430521,"score_gpt":0.3046526594731529,"score_spread":0.24117229303884768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037445555","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9188259,0.00016647804,0.0010099248,0.00028863162,0.0010564728,0.00017023472,0.000003854428,0.00008925959,0.0783892],"genre_scores_gemma":[0.9971109,0.00022524918,0.00054548285,0.00018043246,0.00022022636,0.0000010670396,0.0000019463396,0.00013945061,0.0015752506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954806,0.0016354955,0.0009868001,0.000251938,0.0010788826,0.00056630967],"domain_scores_gemma":[0.99644536,0.0011499334,0.0006562104,0.0006906947,0.0006654185,0.00039241355],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0042080134,0.0003241564,0.00052569,0.0006429666,0.000208488,0.00012157535,0.0010826363,0.00006448834,0.00017436723],"category_scores_gemma":[0.0016601626,0.00027726358,0.0003047008,0.001004355,0.00013725675,0.00022875902,0.0001121264,0.0011427636,0.00029565094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006394962,0.0012985086,0.0027023405,0.000076441764,0.00022504861,0.0062949597,0.0019448836,0.000020508109,0.0009927972,0.96668595,0.016374063,0.0027450055],"study_design_scores_gemma":[0.006879149,0.0046432465,0.015651174,0.0004953643,0.00012631224,0.0018928276,0.00058652734,0.00010522437,0.00087671325,0.908867,0.05904756,0.0008289229],"about_ca_topic_score_codex":0.000001039642,"about_ca_topic_score_gemma":0.000001373853,"teacher_disagreement_score":0.07828495,"about_ca_system_score_codex":0.00016027279,"about_ca_system_score_gemma":0.00007107435,"threshold_uncertainty_score":0.99996793},"labels":[],"label_agreement":null},{"id":"W2037695996","doi":"10.1016/j.ejc.2006.05.009","title":"Product representations of polynomials","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Product (mathematics); Class (philosophy); Set (abstract data type); Value (mathematics); Discrete mathematics; Statistics; Geometry","score_opus":0.023255380985091462,"score_gpt":0.27947357936633116,"score_spread":0.2562181983812397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037695996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9230574,0.00055640884,0.001634137,0.00016568348,0.001257783,0.000089178415,0.000003996827,0.000016758851,0.073218696],"genre_scores_gemma":[0.9963186,0.000022421513,0.002579741,0.000012801988,0.00030228402,1.4010692e-7,4.8065516e-7,0.0000258901,0.00073768466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983441,0.00040265944,0.0007553726,0.00008215116,0.00029827718,0.00011744084],"domain_scores_gemma":[0.9982564,0.0002381536,0.00082606764,0.00029145073,0.00034198252,0.000045987766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013348527,0.00009723339,0.00025707678,0.00014791892,0.00008839622,0.000016287551,0.00032298284,0.00001344343,0.000028371882],"category_scores_gemma":[0.000562031,0.00007558174,0.00015308548,0.00020888576,0.00008136986,0.00009602102,0.000067612265,0.0001766739,0.0000019983192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033338692,0.00019196977,0.0031469623,0.000043607604,0.000052996023,0.00007380293,0.00039085062,0.000026148507,0.0015685934,0.9703263,0.023580847,0.00056457054],"study_design_scores_gemma":[0.00087292056,0.0001935241,0.017672498,0.00005289789,0.00008071252,0.00014347238,0.00008996034,0.0000025227,0.008785829,0.965344,0.006639499,0.0001221532],"about_ca_topic_score_codex":0.000001462641,"about_ca_topic_score_gemma":1.4641881e-7,"teacher_disagreement_score":0.0732612,"about_ca_system_score_codex":0.000017414655,"about_ca_system_score_gemma":0.000029277271,"threshold_uncertainty_score":0.30821338},"labels":[],"label_agreement":null},{"id":"W2038193038","doi":"10.1016/j.ejc.2011.09.024","title":"A stability theorem on fractional covering of triangles by edges","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"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; Disjoint sets; Graph; Discrete mathematics","score_opus":0.05720135198896756,"score_gpt":0.2618078043544493,"score_spread":0.20460645236548172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038193038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3591928,0.0004573383,0.60594934,0.00012858446,0.0010075294,0.00010578821,0.000006168488,0.00003504525,0.033117425],"genre_scores_gemma":[0.9973921,0.000049012488,0.0024355932,0.000028915165,0.000031676496,2.7932748e-7,2.0267039e-7,0.000014176453,0.00004801129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784374,0.00080155174,0.00045778783,0.00014985885,0.00056265853,0.00018438681],"domain_scores_gemma":[0.9982264,0.00038087295,0.0004764204,0.00038068055,0.00040201566,0.00013359978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002596299,0.00011199107,0.00021341754,0.00015610603,0.00007020469,0.00003020538,0.001135228,0.000017121556,0.00003906731],"category_scores_gemma":[0.00044443054,0.000092305985,0.00012413716,0.00037188537,0.00012152302,0.0004515241,0.0001658911,0.00037666506,0.000013853492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044317712,0.0009689299,0.002382311,0.000027540227,0.000074382915,0.00016148646,0.0016973501,0.000033810997,0.0038263784,0.9709068,0.0009777842,0.018500052],"study_design_scores_gemma":[0.0043655853,0.0060378527,0.021802275,0.00019969784,0.000023793453,0.00017574178,0.00037043742,0.0003308446,0.17702237,0.77503246,0.01411843,0.0005204996],"about_ca_topic_score_codex":4.4503423e-7,"about_ca_topic_score_gemma":3.517896e-8,"teacher_disagreement_score":0.6381993,"about_ca_system_score_codex":0.000054851575,"about_ca_system_score_gemma":0.000057599766,"threshold_uncertainty_score":0.3764129},"labels":[],"label_agreement":null},{"id":"W2040632432","doi":"10.1016/j.ejc.2015.02.009","title":"Planar emulators conjecture is nearly true for cubic graphs","year":2015,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Combinatorics; Mathematics; Cubic graph; Planar; Planar graph; Polyhedral graph; Graph; Discrete mathematics; 1-planar graph; Chordal graph; Computer science; Line graph; Computer graphics (images)","score_opus":0.040647873983149146,"score_gpt":0.28536969998990297,"score_spread":0.24472182600675382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040632432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12026788,0.0015683165,0.8700099,0.0014558581,0.0027778088,0.00028884003,0.000008699738,0.00008944092,0.0035332679],"genre_scores_gemma":[0.9885661,0.000028473343,0.010598087,0.00032067616,0.00012025696,9.881059e-7,7.379096e-7,0.0000424038,0.00032229506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755514,0.0005466225,0.0005077569,0.00023745059,0.0007128797,0.00044014753],"domain_scores_gemma":[0.99753827,0.00023045637,0.0004193073,0.0005338929,0.000775348,0.00050272635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028966428,0.00019476895,0.00031023036,0.00037223517,0.00014829838,0.00019592427,0.0019058047,0.000037131937,0.0000038361945],"category_scores_gemma":[0.00034879317,0.00016364148,0.00021726941,0.0007952114,0.00008878587,0.0006551686,0.00016139043,0.0004754316,0.000033405824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014224258,0.0001569222,0.0011057362,0.000024092857,0.00009733117,0.00053388905,0.0025550623,0.00021304365,0.00019701892,0.95991594,0.028206233,0.0068524717],"study_design_scores_gemma":[0.004065115,0.0028734833,0.00071411696,0.000053215623,0.000022385637,0.00040078931,0.00016034,0.0010575161,0.0012936555,0.9144274,0.07457266,0.0003593042],"about_ca_topic_score_codex":3.5316444e-7,"about_ca_topic_score_gemma":8.131617e-8,"teacher_disagreement_score":0.8682982,"about_ca_system_score_codex":0.00007520208,"about_ca_system_score_gemma":0.00018330416,"threshold_uncertainty_score":0.6673106},"labels":[],"label_agreement":null},{"id":"W2042465032","doi":"10.1016/j.ejc.2011.03.013","title":"Interleaved adjoints of directed graphs","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.039698541488880044,"score_gpt":0.25137634195446207,"score_spread":0.21167780046558202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042465032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26817134,0.0016981164,0.6650537,0.00022837547,0.0028207724,0.00021857065,0.0000026810796,0.00019183935,0.061614595],"genre_scores_gemma":[0.98419636,0.00008437917,0.015511199,0.000036093345,0.00001422176,1.878406e-7,1.3639068e-7,0.00001969224,0.00013773142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976021,0.00089898513,0.0006484714,0.00014417141,0.0004634989,0.0002427766],"domain_scores_gemma":[0.9979149,0.00009267576,0.00071335473,0.00047189265,0.00061117706,0.00019598623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001999329,0.00012387962,0.00029079322,0.00042585947,0.000052509924,0.000026521164,0.0018476414,0.000013907065,0.000021195343],"category_scores_gemma":[0.00024889846,0.00010542376,0.00016657537,0.00087414205,0.000113062975,0.00043991755,0.0003187107,0.0003458941,0.000021460051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015223424,0.00078357063,0.004209127,0.00004642653,0.000172468,0.00083102647,0.006501937,0.000006757964,0.0021275529,0.934381,0.0022928945,0.048495017],"study_design_scores_gemma":[0.004589923,0.0066566835,0.083802424,0.0005390351,0.000028237431,0.00065178855,0.0003446508,0.0005232915,0.028815322,0.86657846,0.006799066,0.0006711343],"about_ca_topic_score_codex":7.3378385e-7,"about_ca_topic_score_gemma":1.1499431e-7,"teacher_disagreement_score":0.71602505,"about_ca_system_score_codex":0.000030470144,"about_ca_system_score_gemma":0.00006660504,"threshold_uncertainty_score":0.4299056},"labels":[],"label_agreement":null},{"id":"W2042696910","doi":"10.1016/j.ejc.2013.03.004","title":"Many large eigenvalues in sparse graphs","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Degree (music); Bounded function; Equivalence (formal languages); Constant (computer programming); Discrete mathematics; Mathematical analysis","score_opus":0.03181502815291788,"score_gpt":0.271340035511531,"score_spread":0.23952500735861315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042696910","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97802734,0.00018573584,0.0017798888,0.00024328279,0.00025394163,0.00013502964,0.0000015986675,0.000022492453,0.019350672],"genre_scores_gemma":[0.99826527,0.000070731854,0.0011441434,0.00007407262,0.000040279716,0.0000021135158,4.6750614e-7,0.000030263747,0.00037266806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985143,0.0004096615,0.0005641244,0.00008870545,0.00021305794,0.00021014233],"domain_scores_gemma":[0.99892724,0.00017014805,0.00035917194,0.00024884223,0.00018010623,0.000114506714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016230287,0.000117386575,0.00021532354,0.00020862694,0.00007241086,0.000043187523,0.00038592715,0.000021305379,0.00014192756],"category_scores_gemma":[0.00019335886,0.00009964556,0.00012413083,0.00036768024,0.000036500514,0.00018449077,0.000054218573,0.0003243432,0.00017300237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050495146,0.00037414194,0.002708666,0.000014869853,0.00001725276,0.000057686575,0.0003721666,0.0000015815411,0.00019909932,0.9892684,0.0066281017,0.00035294742],"study_design_scores_gemma":[0.00079626,0.00010675871,0.0151028475,0.00005245152,0.000019158553,0.000045247907,0.0002505297,0.000019705605,0.00021276511,0.9760876,0.0071931174,0.00011351449],"about_ca_topic_score_codex":6.132306e-7,"about_ca_topic_score_gemma":3.2848848e-7,"teacher_disagreement_score":0.020237902,"about_ca_system_score_codex":0.00002149436,"about_ca_system_score_gemma":0.000016542963,"threshold_uncertainty_score":0.4063428},"labels":[],"label_agreement":null},{"id":"W2043268389","doi":"10.1016/j.ejc.2014.10.007","title":"Proof of a conjecture of Kulakova et al. related to the<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"fraktur\">s</mml:mi><mml:mi mathvariant=\"fraktur\">l</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math>weight system","year":2014,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Mathematics; Diagram; Projection (relational algebra); Combinatorics; Discrete mathematics; Statistics; Algorithm","score_opus":0.012939967528450454,"score_gpt":0.23557764122158176,"score_spread":0.2226376736931313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043268389","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49937508,0.002487883,0.006593194,0.0016523658,0.0055726063,0.0000896317,0.00036464832,0.00018640861,0.4836782],"genre_scores_gemma":[0.9906309,0.00094380067,0.0034443694,0.0016975654,0.0013369386,0.00015953225,0.00032071475,0.0010098638,0.00045629207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98830897,0.0013712854,0.0035006565,0.0013960081,0.0033194679,0.0021035941],"domain_scores_gemma":[0.9875213,0.0024553565,0.00539159,0.0028467341,0.00052282336,0.0012622189],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["research_integrity","insufficient_payload"],"category_scores_codex":[0.005297135,0.0010586061,0.0006805882,0.00078766164,0.0011783232,0.0009438275,0.0030600305,0.0015746518,0.12259413],"category_scores_gemma":[0.0036383786,0.0016646961,0.0021721271,0.001980083,0.0011086768,0.0012679793,0.0020019137,0.0028274776,0.0010818472],"study_design_candidate":"bench_or_experimental","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.0013406994,0.0005481546,0.000010589245,0.0022232991,0.0019415701,0.0024278406,0.0026688317,0.0024930811,0.0013167232,0.7111189,0.27290368,0.0010066469],"study_design_scores_gemma":[0.0048022615,0.0047266195,0.00013808778,0.005053527,0.00283737,0.0055648354,0.0025163365,0.03304837,0.92298543,0.0015305179,0.014785288,0.0020113424],"about_ca_topic_score_codex":0.00013119007,"about_ca_topic_score_gemma":0.00012002137,"teacher_disagreement_score":0.9216687,"about_ca_system_score_codex":0.000027776872,"about_ca_system_score_gemma":0.0014581082,"threshold_uncertainty_score":0.9997215},"labels":[],"label_agreement":null},{"id":"W2045095870","doi":"10.1016/j.ejc.2012.07.011","title":"Computing the Longest Previous Factor","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Substring; Suffix array; Combinatorics; Suffix; Factor (programming language); Mathematics; Prefix; Permutation (music); String (physics); Compressed suffix array; Discrete mathematics; Algorithm; Data structure; Suffix tree; Computer science; Physics","score_opus":0.023129639898129783,"score_gpt":0.24359221495462088,"score_spread":0.2204625750564911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045095870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09427853,0.0041336073,0.8904746,0.00066738704,0.005265907,0.00008787493,0.000001483918,0.000058149668,0.0050324346],"genre_scores_gemma":[0.99403733,0.00007387412,0.0051229205,0.00016356506,0.00052171445,6.518887e-8,3.098535e-7,0.000013486636,0.00006670875],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983382,0.0004904412,0.00039113208,0.000092391914,0.0004167731,0.00027101705],"domain_scores_gemma":[0.9985727,0.00016988929,0.000460813,0.00043644846,0.00017701679,0.00018312503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001480336,0.00011959632,0.00015578611,0.000060034603,0.00020080128,0.00018050091,0.0016194567,0.000014246041,0.0000072181924],"category_scores_gemma":[0.000099235695,0.00007101669,0.000089121844,0.00025272323,0.00003110099,0.00075320737,0.00053184904,0.0003625115,0.0000587874],"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.000027096055,0.0012898486,0.03047445,0.000059771286,0.00018033657,0.00061581534,0.01132284,0.00025347323,0.00050336635,0.24158166,0.05730138,0.65638995],"study_design_scores_gemma":[0.0023063892,0.0010972681,0.3385589,0.00031681856,0.000057460365,0.0021769418,0.00019797326,0.009522621,0.00091414334,0.0030465706,0.64101005,0.0007948343],"about_ca_topic_score_codex":4.966239e-7,"about_ca_topic_score_gemma":1.75401e-8,"teacher_disagreement_score":0.8997588,"about_ca_system_score_codex":0.000032438715,"about_ca_system_score_gemma":0.000032033367,"threshold_uncertainty_score":0.30093804},"labels":[],"label_agreement":null},{"id":"W2047595535","doi":"10.1016/j.ejc.2008.01.002","title":"Equiangular lines, mutually unbiased bases, and spin models","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":168,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Mathematics; Mutually unbiased bases; Combinatorics; Conjecture; Prime (order theory); Commutative property; Association scheme; Prime power; Discrete mathematics; Pure mathematics; Hilbert space","score_opus":0.019168578521812116,"score_gpt":0.18193559893691938,"score_spread":0.16276702041510727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047595535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96552163,0.0050309496,0.01654044,0.00002984146,0.0011170553,0.000060562295,0.0000032000269,0.00008037078,0.011615923],"genre_scores_gemma":[0.99890375,0.00053584424,0.00016772338,0.000039388895,0.00015881856,2.5119917e-7,0.0000010724624,0.000049838865,0.0001433276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99884164,0.00021697383,0.00045583534,0.00008000986,0.00022738423,0.00017816988],"domain_scores_gemma":[0.999366,0.000044921373,0.0001237302,0.00016655202,0.00012259497,0.00017621831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007161964,0.0001531057,0.0002444217,0.00014365042,0.00007857501,0.000026567808,0.00021894381,0.00002679761,0.000007943542],"category_scores_gemma":[0.000037449874,0.00014101867,0.00008843645,0.00019919859,0.000047909787,0.00022089251,0.000026875117,0.00026503258,0.000013035567],"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.0006156438,0.001411917,0.009726401,0.0016292938,0.0018447939,0.04596396,0.016270831,0.29642016,0.033031113,0.46168104,0.10332186,0.028082987],"study_design_scores_gemma":[0.035406873,0.008013596,0.03437653,0.0033272463,0.000826486,0.034298286,0.0026121638,0.23944761,0.017806366,0.14368406,0.47360116,0.006599602],"about_ca_topic_score_codex":5.8362866e-7,"about_ca_topic_score_gemma":1.1392751e-7,"teacher_disagreement_score":0.3702793,"about_ca_system_score_codex":0.000025260066,"about_ca_system_score_gemma":0.000019978355,"threshold_uncertainty_score":0.57505745},"labels":[],"label_agreement":null},{"id":"W2047936368","doi":"10.1016/j.ejc.2007.02.010","title":"Fractional coloring and the odd Hadwiger’s conjecture","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Pure mathematics","score_opus":0.020669284174452397,"score_gpt":0.270061181899496,"score_spread":0.2493918977250436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047936368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9292872,0.0013317966,0.01848447,0.00069444894,0.0030016976,0.00012643343,0.0000013185836,0.00002573186,0.047046892],"genre_scores_gemma":[0.9982806,0.00009416731,0.00079271046,0.00019987865,0.00036108372,1.140317e-7,1.209062e-7,0.00002390027,0.00024745477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986056,0.0003391148,0.00047199233,0.00007663449,0.0003419783,0.00016464414],"domain_scores_gemma":[0.9977492,0.0013510964,0.00046883052,0.00015821258,0.00017831016,0.00009435016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046906644,0.000120305966,0.00022872661,0.000091469956,0.0002988546,0.000047790054,0.00027383622,0.000029458948,0.000025170846],"category_scores_gemma":[0.00070687593,0.000069153335,0.00011563557,0.00012859264,0.00020385739,0.00009240193,0.000095759555,0.0005533112,0.0000017405404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021084755,0.000029109555,0.00068900146,0.000014016272,0.00007591024,0.00017315855,0.0010757482,0.0000039719434,0.00002065381,0.9945107,0.0020575004,0.0011393981],"study_design_scores_gemma":[0.0031009114,0.00017298386,0.0073444587,0.000041722335,0.00007710949,0.00088538567,0.00034696748,0.000010347296,0.00017197223,0.9499865,0.037736535,0.00012509062],"about_ca_topic_score_codex":2.730783e-7,"about_ca_topic_score_gemma":2.1897908e-7,"teacher_disagreement_score":0.06899336,"about_ca_system_score_codex":0.000027913482,"about_ca_system_score_gemma":0.000019545605,"threshold_uncertainty_score":0.28199914},"labels":[],"label_agreement":null},{"id":"W2049419313","doi":"10.1016/j.ejc.2010.03.008","title":"Subgraphs with orthogonal factorizations and algorithms","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Graph; Factorization; Vertex (graph theory); Integer (computer science); Induced subgraph; Discrete mathematics; Algorithm; Computer science","score_opus":0.0033887231626349977,"score_gpt":0.15646074815079491,"score_spread":0.15307202498815992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049419313","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97779906,0.00022213264,0.011768504,0.000018842946,0.0016264492,0.000038001697,0.000003135893,0.000048648948,0.008475219],"genre_scores_gemma":[0.9994621,0.000047394144,0.00029427855,0.000006582436,0.00011131122,2.3607589e-7,8.6927787e-7,0.00003219999,0.000044994005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9993394,0.0000823317,0.00024146568,0.00005633424,0.00016444601,0.00011602142],"domain_scores_gemma":[0.99949795,0.000042875326,0.00009122039,0.00011013615,0.00012258672,0.00013521127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047890126,0.00010593349,0.00014175569,0.00012037157,0.00006422413,0.000048263853,0.00014067558,0.000020106452,0.000014096175],"category_scores_gemma":[0.000020271971,0.00008205455,0.000040596704,0.00021621489,0.00004817508,0.00014397036,0.000010976842,0.0003880422,0.0000048867173],"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.00010289221,0.00035871964,0.13914803,0.00026353542,0.0007409657,0.0016058888,0.0036238912,0.001998545,0.031983864,0.79762083,0.003390486,0.019162327],"study_design_scores_gemma":[0.012120968,0.003880703,0.553735,0.0005900921,0.00048998557,0.009873049,0.001518218,0.0036407693,0.008588271,0.054355454,0.34839568,0.0028117725],"about_ca_topic_score_codex":1.06740444e-7,"about_ca_topic_score_gemma":5.6117796e-7,"teacher_disagreement_score":0.7432654,"about_ca_system_score_codex":0.0000050171816,"about_ca_system_score_gemma":0.0000116288575,"threshold_uncertainty_score":0.33460873},"labels":[],"label_agreement":null},{"id":"W2050844884","doi":"10.1016/j.ejc.2006.08.007","title":"On balanced incomplete-block designs with repeated blocks","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Engineering and Physical Sciences Research Council; Beijing Institute For Brain Disorders","keywords":"Lint; Mathematics; Combinatorics; Block (permutation group theory); Block design; Multiplicity (mathematics); Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.008195666601238341,"score_gpt":0.17043293973253226,"score_spread":0.16223727313129394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050844884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92796576,0.00023428527,0.005138685,0.000019750045,0.00074895046,0.000073698575,0.0000019336144,0.00012264344,0.06569431],"genre_scores_gemma":[0.9994544,0.00000716436,0.000098993725,0.000019750252,0.00012944228,4.6003214e-7,0.0000013061161,0.000058805654,0.00022972688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987168,0.00024600903,0.00046019172,0.00009142934,0.00027880323,0.00020679177],"domain_scores_gemma":[0.99929017,0.00007615902,0.00018886372,0.00021442791,0.00013526285,0.00009508958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005723217,0.00017927217,0.00025212526,0.00015582122,0.00006018725,0.000044928896,0.00026710628,0.000023749759,0.000012535449],"category_scores_gemma":[0.00001850174,0.000141255,0.000081014085,0.00031302994,0.000029114726,0.00007723705,0.000011596905,0.00031330652,0.000027504164],"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.0016002812,0.0020161981,0.014263935,0.00040553702,0.001120722,0.012493037,0.0012465981,0.46491364,0.10174993,0.28608721,0.11150444,0.002598471],"study_design_scores_gemma":[0.07003608,0.04525535,0.16804974,0.007724283,0.0012519434,0.015969723,0.0013299217,0.011777309,0.18108962,0.19073313,0.29705933,0.009723575],"about_ca_topic_score_codex":5.7159565e-7,"about_ca_topic_score_gemma":3.0978015e-7,"teacher_disagreement_score":0.45313632,"about_ca_system_score_codex":0.000056166908,"about_ca_system_score_gemma":0.000009408769,"threshold_uncertainty_score":0.5760212},"labels":[],"label_agreement":null},{"id":"W2050977427","doi":"10.1006/eujc.1998.0266","title":"Judicious Partitions of 3-uniform Hypergraphs","year":2000,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Partition (number theory); Conjecture; Class (philosophy); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","score_opus":0.00526714390918659,"score_gpt":0.16509049881869817,"score_spread":0.15982335490951158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050977427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8609913,0.0009631284,0.00043808884,0.000019241927,0.0007236242,0.00003352239,0.0000035798391,0.000042002546,0.1367855],"genre_scores_gemma":[0.9993051,0.00036672555,0.000046133762,0.000011868573,0.00006430929,2.420526e-7,6.428209e-7,0.000027423162,0.0001775096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990408,0.0001268392,0.00048161446,0.000041985986,0.00017552722,0.00013326418],"domain_scores_gemma":[0.99952215,0.000031416403,0.000106461564,0.0001530062,0.00009115045,0.00009582806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005330076,0.00009536136,0.00019943525,0.00012393092,0.000042426727,0.00001290313,0.00022266753,0.000017685947,0.00015020663],"category_scores_gemma":[0.0000123416185,0.000086843604,0.00013612708,0.00028492507,0.000040252595,0.000110939785,0.0000064302267,0.00019103018,0.000059121714],"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.00041626804,0.0021448594,0.011346595,0.0010568944,0.0021194126,0.0031709443,0.009778108,0.15534884,0.020074582,0.5831474,0.09045528,0.1209408],"study_design_scores_gemma":[0.009228217,0.003953527,0.033130538,0.0014567069,0.0005452555,0.0027932825,0.0013956304,0.0019495602,0.015995523,0.19463097,0.73315674,0.0017640744],"about_ca_topic_score_codex":3.0385885e-7,"about_ca_topic_score_gemma":1.1512998e-7,"teacher_disagreement_score":0.64270145,"about_ca_system_score_codex":0.000014514597,"about_ca_system_score_gemma":0.000008649281,"threshold_uncertainty_score":0.35413793},"labels":[],"label_agreement":null},{"id":"W2051569409","doi":"10.1016/j.ejc.2003.10.002","title":"On codes from hypergraphs","year":2003,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Hebrew University of Jerusalem","keywords":"Mathematics; Hypergraph; Combinatorics; Vertex (graph theory); Discrete mathematics; Binary number; Decoding methods; List decoding; Block code; Algorithm; Graph; Concatenated error correction code","score_opus":0.01307566050862434,"score_gpt":0.22208362489756325,"score_spread":0.20900796438893893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051569409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32038063,0.0005641539,0.58502907,0.00028952485,0.0038468824,0.00006798847,9.2120894e-7,0.00026114174,0.089559674],"genre_scores_gemma":[0.97709036,0.000043539345,0.022443453,0.0002569905,0.00003867161,1.9044806e-7,1.378922e-7,0.000021838852,0.000104843006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980531,0.000769564,0.000402938,0.00016880422,0.00042424636,0.00018137909],"domain_scores_gemma":[0.998442,0.0003137001,0.00039787684,0.00046987893,0.00024538275,0.00013117716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014042549,0.0001425249,0.00020708633,0.00020146347,0.000085876534,0.00011723501,0.0011716149,0.000021413636,0.000009281309],"category_scores_gemma":[0.00056994916,0.00012408385,0.00012483464,0.00042048097,0.000026553018,0.00025449574,0.00007748331,0.00041506608,0.000050295774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014153659,0.00030993216,0.0021185118,0.0000040436817,0.000045230372,0.00083572714,0.0006659367,0.00005017216,0.0013322973,0.97251636,0.014330393,0.0077772154],"study_design_scores_gemma":[0.0024509903,0.0036976126,0.008505168,0.00037982978,0.000046787965,0.0005802872,0.00010150458,0.0005419443,0.04617187,0.84248,0.094155,0.0008890267],"about_ca_topic_score_codex":0.0000011640485,"about_ca_topic_score_gemma":1.6797586e-7,"teacher_disagreement_score":0.65670973,"about_ca_system_score_codex":0.000052195046,"about_ca_system_score_gemma":0.000054144784,"threshold_uncertainty_score":0.50599927},"labels":[],"label_agreement":null},{"id":"W2053608075","doi":"10.1006/eujc.2000.0417","title":"Existence and Non-existence of -systems of Polar Spaces","year":2001,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Symplectic geometry; Order (exchange); Polar; Translation (biology); Pure mathematics; Physics; Quantum mechanics","score_opus":0.01614616424244786,"score_gpt":0.21845512575912612,"score_spread":0.20230896151667827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053608075","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9115982,0.0022718683,0.075072244,0.000105723055,0.0008350919,0.000052768868,0.0000011027322,0.000013706523,0.010049294],"genre_scores_gemma":[0.99659616,0.00036799436,0.0029127002,0.000015674685,0.000038010647,9.9404716e-8,6.1194434e-8,0.000008288176,0.00006102549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985069,0.0003220278,0.00053404184,0.00012705557,0.0003611196,0.00014887932],"domain_scores_gemma":[0.998287,0.00013121101,0.0007709898,0.00033405307,0.00036081433,0.00011593484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016836089,0.00011247949,0.0002910075,0.00021415915,0.000058880585,0.00006734888,0.00096082175,0.000017862107,0.0000017866269],"category_scores_gemma":[0.00007971054,0.000096268515,0.000103882165,0.0006024495,0.00012849685,0.0003533885,0.0001712279,0.00017087985,0.0000017973086],"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.00008578432,0.00031007835,0.048143838,0.00015461427,0.00008112334,0.00048319122,0.002380117,0.000047720467,0.0029871373,0.93904907,0.00026159125,0.0060157483],"study_design_scores_gemma":[0.014015771,0.024512123,0.4481878,0.0054537854,0.00036462164,0.00855942,0.004919665,0.0074088112,0.015738338,0.3806418,0.087245144,0.0029527254],"about_ca_topic_score_codex":0.0000027824938,"about_ca_topic_score_gemma":1.0811867e-7,"teacher_disagreement_score":0.55840725,"about_ca_system_score_codex":0.000009626706,"about_ca_system_score_gemma":0.000035789406,"threshold_uncertainty_score":0.39257163},"labels":[],"label_agreement":null},{"id":"W2054485268","doi":"10.1016/j.ejc.2008.09.024","title":"Commutation relations and Vandermonde determinants","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Vandermonde matrix; Mathematics; Mismatch negativity; Tensor product; Multilinear map; Commutation; Combinatorics; Matrix (chemical analysis); Polynomial; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.058730418751361244,"score_gpt":0.3011236395612834,"score_spread":0.24239322080992215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054485268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9615075,0.00025612733,0.030171763,0.00011399281,0.00036155112,0.00005263734,6.651332e-7,0.000021592758,0.0075141843],"genre_scores_gemma":[0.98733443,0.00014586985,0.01185544,0.000029830726,0.00006006316,1.8604007e-7,2.5704097e-7,0.000027618014,0.00054631283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989281,0.00022727759,0.00044648797,0.000066694025,0.00022481027,0.00010662542],"domain_scores_gemma":[0.99879575,0.00033100936,0.00044060696,0.00015656522,0.00018999974,0.00008607887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049416564,0.000091863185,0.00017498509,0.000094699106,0.00017513835,0.000013720081,0.00015832951,0.000019613744,0.000010312074],"category_scores_gemma":[0.0006408332,0.000083781924,0.000046606066,0.00011926734,0.00007343828,0.00020665009,0.000052631563,0.00027923647,0.000011071859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006166483,0.000554073,0.058428623,0.0000787622,0.00010697059,0.00320782,0.0064116553,0.000028377506,0.00033572223,0.90841544,0.010648534,0.011722381],"study_design_scores_gemma":[0.0016933122,0.0003348787,0.03463756,0.00009254421,0.000049680304,0.0023503983,0.00013288215,0.00008101763,0.00039228256,0.9559675,0.004077356,0.00019061657],"about_ca_topic_score_codex":8.127177e-8,"about_ca_topic_score_gemma":1.6496152e-7,"teacher_disagreement_score":0.047552053,"about_ca_system_score_codex":0.00003993402,"about_ca_system_score_gemma":0.000028104969,"threshold_uncertainty_score":0.34165275},"labels":[],"label_agreement":null},{"id":"W2059134409","doi":"10.1016/j.ejc.2012.01.009","title":"Induced subgraphs in sparse random graphs with given degree sequences","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"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; Canada Research Chairs; Alexander von Humboldt-Stiftung","keywords":"Mathematics; Combinatorics; Random regular graph; Random graph; Degree (music); Discrete mathematics; Graph; Line graph; Pathwidth","score_opus":0.06554242911777086,"score_gpt":0.2757763514326202,"score_spread":0.21023392231484933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059134409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.982625,0.00064901327,0.00039532603,0.00006445507,0.0009962544,0.00012265134,0.0000012321913,0.000019927607,0.01512616],"genre_scores_gemma":[0.99825543,0.00009783423,0.0013823451,0.000052121322,0.00011939588,7.318837e-7,3.370212e-7,0.000046761073,0.00004503216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974455,0.00090538926,0.00066699064,0.00011419904,0.0004881084,0.00037979384],"domain_scores_gemma":[0.9982429,0.00041055892,0.00064270623,0.00028561242,0.00020122936,0.0002169653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003133853,0.00022655338,0.00044672046,0.00039869366,0.00012727974,0.000037673442,0.00051195937,0.000044644396,0.0000257373],"category_scores_gemma":[0.00034612007,0.00014985596,0.00016096683,0.00056056416,0.00011707048,0.00035684678,0.00007654536,0.00059909764,0.0000036914912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070963183,0.0005045427,0.12610155,0.00008402507,0.00022950373,0.0007453388,0.0069122026,0.000008584862,0.00035580216,0.8605305,0.001210447,0.0026078946],"study_design_scores_gemma":[0.0095955925,0.0012117889,0.08833508,0.00038005377,0.00018691442,0.0009135805,0.0010354368,0.000005001249,0.0011479615,0.89413536,0.002473498,0.0005797509],"about_ca_topic_score_codex":0.000001717904,"about_ca_topic_score_gemma":0.0000018585125,"teacher_disagreement_score":0.037766464,"about_ca_system_score_codex":0.00004049415,"about_ca_system_score_gemma":0.0000399751,"threshold_uncertainty_score":0.61109483},"labels":[],"label_agreement":null},{"id":"W2062741650","doi":"10.1016/j.ejc.2014.07.003","title":"Automorphisms of Cayley graphs on generalised dicyclic groups","year":2014,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Australian Research Council","keywords":"Cayley graph; Automorphism; Mathematics; Combinatorics; Abelian group; Vertex-transitive graph; Vertex (graph theory); Graph; Dicyclic group; Discrete mathematics; Voltage graph; Quaternion group; Alternating group; Line graph","score_opus":0.05284546534984777,"score_gpt":0.29402204980008684,"score_spread":0.24117658445023907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062741650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9687044,0.00008705022,0.0034229702,0.00023480933,0.0007979322,0.000121658726,0.00000433479,0.000038946982,0.026587903],"genre_scores_gemma":[0.99772334,0.00003979229,0.0015218708,0.00009445596,0.00015773316,5.9073636e-7,0.0000013100793,0.00008905809,0.00037183246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956134,0.0019557013,0.00096327666,0.00016553652,0.00097642536,0.00032568502],"domain_scores_gemma":[0.99674696,0.0010436208,0.0009142375,0.0005720628,0.00047934309,0.00024376699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055127745,0.00021909025,0.000527755,0.00046087956,0.00008777775,0.000040042843,0.0008757616,0.00004515382,0.00007084248],"category_scores_gemma":[0.0018978228,0.00018077205,0.00027200492,0.0004896201,0.0001530189,0.000118314805,0.000117970485,0.00062211184,0.0000598463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014868542,0.00057919626,0.0008385368,0.000097887794,0.00009384078,0.00017946877,0.0005058813,0.000026749598,0.0033513005,0.9844052,0.007977222,0.0017960122],"study_design_scores_gemma":[0.004026852,0.0035561263,0.0052503888,0.00028143224,0.000089583606,0.00014284352,0.00006751926,0.0002425949,0.0051725963,0.97302383,0.007829485,0.000316736],"about_ca_topic_score_codex":8.110459e-7,"about_ca_topic_score_gemma":2.0556021e-7,"teacher_disagreement_score":0.029018963,"about_ca_system_score_codex":0.00006563107,"about_ca_system_score_gemma":0.00004288439,"threshold_uncertainty_score":0.73716706},"labels":[],"label_agreement":null},{"id":"W2063944845","doi":"10.1016/j.ejc.2003.07.006","title":"On the spectrum of non-Denniston maximal arcs in PG(2,2h)","year":2003,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Isomorphism (crystallography); Order (exchange); Degree (music); Type (biology); Spectrum (functional analysis); Projective plane; Discrete mathematics; Geometry; Crystallography; Physics","score_opus":0.010738151867189577,"score_gpt":0.20260787323156165,"score_spread":0.19186972136437208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063944845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83236706,0.00025175166,0.08661292,0.00089225994,0.0014211271,0.00008548992,4.505367e-7,0.000016112375,0.07835281],"genre_scores_gemma":[0.9991495,0.0000352509,0.00058582064,0.00014287332,0.000024929726,1.8058526e-7,3.9261128e-8,0.000011657051,0.000049725575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810034,0.0007877377,0.0004394762,0.00012192119,0.0003548802,0.00019565043],"domain_scores_gemma":[0.99880546,0.00026986218,0.00036909344,0.000401522,0.00008106217,0.00007301742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029696247,0.00011981866,0.00019163947,0.0002442422,0.00007537283,0.00005992307,0.001152966,0.000015853748,0.000020172209],"category_scores_gemma":[0.00017422768,0.00008515804,0.00014827651,0.0007433072,0.00006817505,0.00014568261,0.0000825206,0.0004203682,0.000017150542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027100305,0.00020026808,0.0008292556,0.000005577503,0.000012534948,0.00020117612,0.0004630096,0.000052882817,0.00022885008,0.99657303,0.00060585863,0.00080042554],"study_design_scores_gemma":[0.0018817239,0.00262429,0.022294926,0.00022978458,0.00001694058,0.00025173085,0.00013559511,0.00028546894,0.00652472,0.9540659,0.011380393,0.000308504],"about_ca_topic_score_codex":3.79818e-7,"about_ca_topic_score_gemma":1.7714312e-7,"teacher_disagreement_score":0.16678244,"about_ca_system_score_codex":0.000031430183,"about_ca_system_score_gemma":0.000051704297,"threshold_uncertainty_score":0.34726444},"labels":[],"label_agreement":null},{"id":"W2065299307","doi":"10.1016/j.ejc.2013.06.020","title":"Forbidden configurations: Boundary cases","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"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":"Forb; Mathematics; Combinatorics; Permutation (music); Simple (philosophy); Matrix (chemical analysis); Conjecture; Column (typography); Boundary (topology); Geometry; Mathematical analysis; Physics; Connection (principal bundle)","score_opus":0.009763203030370158,"score_gpt":0.18204344979126452,"score_spread":0.17228024676089437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065299307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89209294,0.0028824073,0.0033292605,0.00007926747,0.0030240617,0.00012065283,0.0000024047777,0.00010177101,0.098367244],"genre_scores_gemma":[0.99939984,0.000074462354,0.000051914343,0.000029444307,0.00014465726,9.613422e-7,8.3173575e-7,0.000030979016,0.00026688608],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911606,0.00016581635,0.00038953792,0.000043427197,0.00015389292,0.00013129036],"domain_scores_gemma":[0.9994084,0.000073222895,0.00010937156,0.0001318507,0.0001705839,0.000106562824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042276524,0.00009939906,0.00014936745,0.000101132435,0.00006906793,0.00010984985,0.00021006094,0.000016104235,0.00013369265],"category_scores_gemma":[0.00005682358,0.000086892745,0.00008367477,0.00013985255,0.000029575893,0.00030508553,0.000011358291,0.00019611421,0.00026830897],"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.000060795515,0.0004774843,0.004188705,0.0005644468,0.001008269,0.0047228644,0.0047235787,0.004267854,0.02889985,0.40369695,0.50372577,0.04366347],"study_design_scores_gemma":[0.0042217155,0.0018255976,0.03148303,0.00060527667,0.00016948402,0.0066316747,0.0028051918,0.0016472572,0.006080406,0.093970485,0.849248,0.0013118652],"about_ca_topic_score_codex":6.786592e-7,"about_ca_topic_score_gemma":9.8354874e-8,"teacher_disagreement_score":0.34552228,"about_ca_system_score_codex":0.00002556777,"about_ca_system_score_gemma":0.000014718228,"threshold_uncertainty_score":0.35433835},"labels":[],"label_agreement":null},{"id":"W2065521247","doi":"10.1016/j.ejc.2007.11.017","title":"Generalised dualities and maximal finite antichains in the homomorphism order of relational structures","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Homomorphism; Finitary; Digraph; Mathematics; Duality (order theory); Algebra homomorphism; Order (exchange); Discrete mathematics; Combinatorics; Partially ordered set; Treewidth; Pathwidth; Graph","score_opus":0.04494834000764881,"score_gpt":0.25531751028673677,"score_spread":0.21036917027908797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065521247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91172004,0.00096060324,0.084851615,0.0007210558,0.0002468751,0.000072436866,0.0000035374248,0.000008013236,0.0014158218],"genre_scores_gemma":[0.99196297,0.00022115388,0.00758686,0.00010482317,0.000038062724,2.2078328e-7,5.511091e-7,0.00000905487,0.000076326774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791056,0.000886682,0.00040252166,0.00010240528,0.0005406872,0.00015717291],"domain_scores_gemma":[0.9987092,0.00041972072,0.00026731176,0.00022781026,0.00032067636,0.00005525368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014419084,0.00009312949,0.00016720456,0.00024238783,0.00011609116,0.000031606298,0.0007147025,0.000015762816,0.0000046042796],"category_scores_gemma":[0.00030854344,0.00006545155,0.00004609082,0.00057684176,0.00022141595,0.00032088897,0.00013434439,0.00033657454,0.0000010374678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031445965,0.000071930896,0.0073315874,0.000010674954,0.000017396898,0.00074000703,0.0041812025,0.00094961986,0.00019903664,0.98581904,0.00025902453,0.000389016],"study_design_scores_gemma":[0.0044854134,0.0012326706,0.35543326,0.00007841341,0.000014886516,0.0027393498,0.00045477742,0.004730221,0.0006599679,0.6238727,0.0059127402,0.00038564266],"about_ca_topic_score_codex":0.0000010429642,"about_ca_topic_score_gemma":2.3445511e-7,"teacher_disagreement_score":0.36194637,"about_ca_system_score_codex":0.0000143249845,"about_ca_system_score_gemma":0.00007447244,"threshold_uncertainty_score":0.2669037},"labels":[],"label_agreement":null},{"id":"W2066238480","doi":"10.1016/j.ejc.2009.09.003","title":"Homomorphisms of random paths","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Hungarian Scientific Research Fund; Nemzeti Kutatási és Technológiai Hivatal; National Science Foundation","keywords":"Homomorphism; Mathematics; Path (computing); Combinatorics; Core (optical fiber); Constraint (computer-aided design); Discrete mathematics; Constraint satisfaction problem; Algebra homomorphism; Computer science; Statistics","score_opus":0.015739098610519562,"score_gpt":0.25282456104128,"score_spread":0.23708546243076042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066238480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07992019,0.0013216891,0.8974104,0.0006268058,0.00086829247,0.000101913276,9.507367e-7,0.000038571612,0.01971119],"genre_scores_gemma":[0.9925836,0.00012544764,0.007014031,0.00008465543,0.000048078142,8.246463e-8,1.2590262e-7,0.000010494972,0.00013352811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782854,0.0006587235,0.00055895513,0.00012351184,0.0006068131,0.00022345598],"domain_scores_gemma":[0.9981885,0.0001777702,0.0005051421,0.0004367335,0.00052370044,0.00016813294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024497274,0.00011292179,0.00028919277,0.0002656706,0.00006202077,0.000049565046,0.0016331848,0.000015275491,0.0000065285312],"category_scores_gemma":[0.00027238682,0.00009369358,0.00016138205,0.00066768314,0.00006880461,0.00043528917,0.00011839632,0.00034259591,0.000017112894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014644169,0.00037361824,0.00017993977,0.000010408596,0.000030955707,0.001139082,0.00045934878,0.00019169848,0.0036851251,0.91617996,0.0012341442,0.07636927],"study_design_scores_gemma":[0.0100395335,0.005278221,0.012100914,0.00018233446,0.000024748131,0.0007601689,0.000052212137,0.0008521325,0.01405439,0.94328564,0.01295019,0.00041954176],"about_ca_topic_score_codex":5.8274807e-8,"about_ca_topic_score_gemma":6.558897e-9,"teacher_disagreement_score":0.91266334,"about_ca_system_score_codex":0.000028181948,"about_ca_system_score_gemma":0.00006356379,"threshold_uncertainty_score":0.38207135},"labels":[],"label_agreement":null},{"id":"W2066666508","doi":"10.1016/j.ejc.2011.09.004","title":"Polynomial treewidth forces a large grid-like-minor","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Australian Research Council","keywords":"Treewidth; Combinatorics; Mathematics; Partial k-tree; Minor (academic); Graph minor; Tree-depth; Tree decomposition; 1-planar graph; Discrete mathematics; Graph; Clique-sum; Pathwidth; Chordal graph; Line graph; Graph power","score_opus":0.032144537609966384,"score_gpt":0.25239588175131195,"score_spread":0.22025134414134556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066666508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17348571,0.0014053517,0.7396115,0.00028987665,0.0065414766,0.00023084473,0.000006881042,0.00016302426,0.07826535],"genre_scores_gemma":[0.9896683,0.000065599954,0.0091231605,0.00014478882,0.00022095862,5.669576e-7,3.546409e-7,0.00003359593,0.00074265426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974644,0.00068389514,0.00054601865,0.00022296872,0.00059095054,0.0004917528],"domain_scores_gemma":[0.9981962,0.000113144524,0.00045850113,0.00055738457,0.00034880426,0.00032600196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022654678,0.00018535108,0.0002717114,0.00034993238,0.0001725732,0.00010551917,0.0024483406,0.00002594419,0.000036968635],"category_scores_gemma":[0.00015038582,0.0001555313,0.00019450593,0.0006455741,0.000084726715,0.0009066547,0.00048878836,0.0005011469,0.00009882999],"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.0011422549,0.0026217068,0.015934473,0.000087554756,0.00039645756,0.009985954,0.013606171,0.00003453826,0.0014277865,0.8180806,0.07387435,0.06280817],"study_design_scores_gemma":[0.02075463,0.013678222,0.088524066,0.00038916554,0.0001385483,0.003260524,0.0008878926,0.0021744105,0.017277448,0.16368096,0.6866454,0.0025887617],"about_ca_topic_score_codex":7.864769e-7,"about_ca_topic_score_gemma":4.3364574e-7,"teacher_disagreement_score":0.8161826,"about_ca_system_score_codex":0.000056130946,"about_ca_system_score_gemma":0.000100808626,"threshold_uncertainty_score":0.6342383},"labels":[],"label_agreement":null},{"id":"W2067086851","doi":"10.1016/j.ejc.2013.05.027","title":"Roth-type theorems in finite groups","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Lemma (botany); Type (biology); Combinatorics; Discrete mathematics","score_opus":0.02469061789435342,"score_gpt":0.25309649037574905,"score_spread":0.22840587248139563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067086851","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9499155,0.00045326012,0.0011439832,0.00014778998,0.0018790074,0.00012784294,5.8343676e-7,0.000022210286,0.04630978],"genre_scores_gemma":[0.99823165,0.000118539014,0.00097359996,0.00012432411,0.00016006951,3.8520338e-7,2.766157e-7,0.00004482652,0.00034635753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981006,0.0006107173,0.00065133057,0.0000994724,0.00031304095,0.00022484023],"domain_scores_gemma":[0.998342,0.00054290984,0.00042641358,0.00028039116,0.0002924219,0.000115906354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016981752,0.00015605945,0.00029124832,0.00021194135,0.00008328196,0.000056938134,0.0005242994,0.000035658122,0.00019226549],"category_scores_gemma":[0.00097371306,0.00011380522,0.00011749851,0.0003308851,0.00007476677,0.00021155544,0.00011920559,0.00051836256,0.00004486987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035326815,0.00014114936,0.003470324,0.000039300627,0.000038417318,0.00021500685,0.0016391955,0.000019054132,0.000089473186,0.98770106,0.004631857,0.001979808],"study_design_scores_gemma":[0.0009024817,0.0003160209,0.008131589,0.00007671929,0.000016346206,0.000076962824,0.0001794193,0.000041042116,0.00007994589,0.9857724,0.004258209,0.00014889163],"about_ca_topic_score_codex":8.409532e-7,"about_ca_topic_score_gemma":1.9085635e-7,"teacher_disagreement_score":0.04831608,"about_ca_system_score_codex":0.000037872713,"about_ca_system_score_gemma":0.000022877126,"threshold_uncertainty_score":0.4640842},"labels":[],"label_agreement":null},{"id":"W2067740969","doi":"10.1016/j.ejc.2013.07.013","title":"Age and weak indivisibility","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Countable set; Embedding; Partition (number theory); Substructure; Combinatorics; Isomorphism (crystallography); Automorphism; Finite set; Subspace topology; Homogeneous; Discrete mathematics; Mathematical analysis","score_opus":0.029079546315120143,"score_gpt":0.27838604925971144,"score_spread":0.2493065029445913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067740969","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9650732,0.00025325766,0.0052680233,0.00020617823,0.0003892175,0.000070995884,5.1862713e-7,0.00001863146,0.028719965],"genre_scores_gemma":[0.99638987,0.000046850357,0.0026033148,0.00006599618,0.00006185546,2.4911415e-7,1.7379324e-7,0.000018731536,0.00081293314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988036,0.0004655186,0.00037858562,0.00008061219,0.00013584204,0.00013583578],"domain_scores_gemma":[0.9989464,0.00033004733,0.0003002415,0.00017361957,0.00013776594,0.00011187631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012098671,0.00009649368,0.00021209205,0.00006414513,0.000073138515,0.000025224812,0.00019700453,0.000024853429,0.00009083564],"category_scores_gemma":[0.0006561889,0.00007582914,0.00004962652,0.000075987926,0.00012496216,0.0001876409,0.000075771735,0.00033699744,0.00004125911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028150213,0.000265758,0.0044980203,0.000053006497,0.00006886026,0.00051094964,0.0012061022,0.000001282612,0.0002732722,0.9782341,0.007834353,0.0070261452],"study_design_scores_gemma":[0.0006380055,0.00023416168,0.019872809,0.000023036808,0.00002051308,0.00015029777,0.00022962713,0.000002776676,0.000096016556,0.9751345,0.0035088456,0.000089419365],"about_ca_topic_score_codex":1.6470366e-7,"about_ca_topic_score_gemma":8.201876e-8,"teacher_disagreement_score":0.031316683,"about_ca_system_score_codex":0.000018672807,"about_ca_system_score_gemma":0.000012931994,"threshold_uncertainty_score":0.30922228},"labels":[],"label_agreement":null},{"id":"W2068369131","doi":"10.1006/eujc.1999.0357","title":"Self-dual Cayley Maps","year":2000,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Dual (grammatical number); Cayley graph; Graph; Art","score_opus":0.02577405114084486,"score_gpt":0.2735917771275878,"score_spread":0.24781772598674295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068369131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57604027,0.00079633435,0.0065701464,0.0006248845,0.0023865786,0.00019768195,0.0000058865703,0.00024184433,0.4131364],"genre_scores_gemma":[0.9077594,0.0004015869,0.08287304,0.00021057056,0.0007966018,5.1809496e-7,0.0000011661355,0.00014260359,0.007814494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808055,0.00037376455,0.00069337495,0.00012396467,0.0004785876,0.00024973444],"domain_scores_gemma":[0.9986243,0.00022598341,0.00040600475,0.00034473266,0.0002253839,0.00017355404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011157318,0.00017380038,0.00029413332,0.000096080854,0.00009111804,0.000043483593,0.00043881565,0.0000303677,0.00031870854],"category_scores_gemma":[0.0002797297,0.00015514567,0.00014026201,0.00022610002,0.000039476858,0.00020173288,0.000054815435,0.0005281684,0.00023910314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005645871,0.0007011224,0.00026283076,0.00008950209,0.00015156859,0.0023699978,0.0013610157,0.0000144015385,0.000051553776,0.9459585,0.028560592,0.020422459],"study_design_scores_gemma":[0.0013024469,0.00034959277,0.00025038267,0.00005810772,0.000059450766,0.00062834984,0.000054203487,0.000014578742,0.00027592372,0.69992274,0.29687622,0.00020798563],"about_ca_topic_score_codex":8.6693284e-8,"about_ca_topic_score_gemma":7.28264e-8,"teacher_disagreement_score":0.4053219,"about_ca_system_score_codex":0.00009486281,"about_ca_system_score_gemma":0.0000487341,"threshold_uncertainty_score":0.6326657},"labels":[],"label_agreement":null},{"id":"W2068865948","doi":"10.1016/j.ejc.2006.07.001","title":"Minimal paths and cycles in set systems","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Disjoint sets; Conjecture; Modulo; Disjoint union (topology); Family of sets; Set (abstract data type); Discrete mathematics","score_opus":0.022415123895904207,"score_gpt":0.2542392567298244,"score_spread":0.23182413283392017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068865948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98518646,0.001319312,0.0002364617,0.000038740247,0.0007490324,0.00005352982,0.0000028161232,0.000010940807,0.012402689],"genre_scores_gemma":[0.9992159,0.00005817023,0.00038320106,0.000013036718,0.00016663013,1.7453182e-7,3.2487165e-7,0.000026054926,0.00013652463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985405,0.00042422855,0.0005689033,0.00008323995,0.00023119929,0.0001519312],"domain_scores_gemma":[0.99912095,0.00023127193,0.0003591072,0.00013530505,0.00009384612,0.000059526483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013721993,0.000117963005,0.00025631394,0.00015533975,0.00006930649,0.000050476705,0.00020138513,0.00002635467,0.0000036942897],"category_scores_gemma":[0.00014612632,0.00009084856,0.000059038324,0.00012675766,0.0000556452,0.00009129508,0.000070955786,0.00024897367,0.0000012375109],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003696327,0.0000945849,0.016441995,0.000088440414,0.000020662388,0.0007446987,0.0007081102,0.000022311888,0.00008598697,0.97754437,0.0038125282,0.0003993222],"study_design_scores_gemma":[0.0022611741,0.00039963707,0.07285468,0.00025342772,0.000049361675,0.0007906482,0.00062256615,0.00009016542,0.000090647,0.9132333,0.009072917,0.0002815164],"about_ca_topic_score_codex":0.0000017714697,"about_ca_topic_score_gemma":4.505444e-7,"teacher_disagreement_score":0.06431114,"about_ca_system_score_codex":0.000024793613,"about_ca_system_score_gemma":0.0000131922425,"threshold_uncertainty_score":0.3704697},"labels":[],"label_agreement":null},{"id":"W2070037875","doi":"10.1016/j.ejc.2005.11.005","title":"Dejean’s conjecture and Sturmian words","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"University of Tehran","keywords":"Conjecture; Mathematics; Alphabet; Repetition (rhetorical device); Combinatorics; Word (group theory); Combinatorics on words; Quadratic equation; Discrete mathematics; Geometry; Linguistics","score_opus":0.00414040258297324,"score_gpt":0.17869109342052547,"score_spread":0.17455069083755223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070037875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73051894,0.0038754102,0.24100736,0.0015460411,0.0020132894,0.00007070748,0.0000014320767,0.00010799478,0.020858843],"genre_scores_gemma":[0.9966867,0.000042875192,0.0026858647,0.00018084564,0.00017585588,7.8574374e-8,2.8969947e-7,0.000014043734,0.00021346941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988542,0.00026437463,0.00033233425,0.00012388152,0.00025631423,0.00016885225],"domain_scores_gemma":[0.99921,0.00008249593,0.00028046715,0.00023249735,0.000094419214,0.000100108635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095207314,0.00011820978,0.00017173939,0.000113096954,0.00008391722,0.00018998535,0.0006752803,0.000018464474,0.0000041758367],"category_scores_gemma":[0.000033626722,0.00009357301,0.000061980485,0.00023273646,0.000042138876,0.00031304077,0.00015467571,0.00024116169,0.000011199446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009231665,0.00013845986,0.0031072823,0.00001544988,0.000026197255,0.0013687644,0.0005041011,0.000041734664,0.00046525116,0.9569021,0.011887856,0.025533613],"study_design_scores_gemma":[0.0055885985,0.0018631188,0.1684633,0.00026753487,0.00006713536,0.004135505,0.00024197095,0.0021171502,0.0024882692,0.58594435,0.22781795,0.0010051341],"about_ca_topic_score_codex":0.0000013902235,"about_ca_topic_score_gemma":3.351616e-7,"teacher_disagreement_score":0.37095773,"about_ca_system_score_codex":0.000024998877,"about_ca_system_score_gemma":0.00003129319,"threshold_uncertainty_score":0.38157967},"labels":[],"label_agreement":null},{"id":"W2078121532","doi":"10.1016/j.ejc.2012.02.004","title":"On a bijective proof of a factorization formula for Macdonald polynomials","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"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","funders":"National Science Foundation","keywords":"Mathematics; Factorization; Combinatorics; Bijection; Combinatorial proof; Symmetric function; Macdonald polynomials; Pure mathematics; Orthogonal polynomials; Classical orthogonal polynomials","score_opus":0.05778111569077619,"score_gpt":0.32514533592921757,"score_spread":0.26736422023844136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078121532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35161415,0.0002741888,0.63574284,0.0001140892,0.0044813864,0.0010661342,0.000027771317,0.000049543545,0.0066299327],"genre_scores_gemma":[0.98986524,0.000008456678,0.009492675,0.000022304366,0.0003579212,0.000004513195,0.0000014121408,0.0000957932,0.00015165216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976191,0.00030292798,0.0010887525,0.00011083604,0.0005464111,0.00033198454],"domain_scores_gemma":[0.9953053,0.0015551805,0.0018797105,0.0003003055,0.0007804278,0.00017907686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020120367,0.00023938173,0.000580212,0.00024427357,0.00007706236,0.00001983535,0.0003800666,0.000053081894,0.00001530952],"category_scores_gemma":[0.0040825657,0.0002002732,0.000258183,0.00029856683,0.000041705407,0.0003483788,0.000064322376,0.000257205,0.0000055198366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026094366,0.0012117502,0.00015090007,0.00026802748,0.00012751145,0.000005464443,0.0015286512,0.000022655657,0.0011198648,0.9920473,0.0020581386,0.0011987535],"study_design_scores_gemma":[0.0029940275,0.0021055196,0.00016288734,0.00029773713,0.00015252795,0.00003910395,0.00016364038,0.00004966298,0.03158274,0.95945084,0.0027398393,0.00026150054],"about_ca_topic_score_codex":1.2187103e-7,"about_ca_topic_score_gemma":3.6128267e-8,"teacher_disagreement_score":0.6382511,"about_ca_system_score_codex":0.00017585648,"about_ca_system_score_gemma":0.00006891622,"threshold_uncertainty_score":0.81669044},"labels":[],"label_agreement":null},{"id":"W2081191210","doi":"10.1016/j.ejc.2013.06.023","title":"Obstructions to locally injective oriented improper colourings","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Injective function; Mathematics; Substructure; Combinatorics; Time complexity; Decision problem; Discrete mathematics; Algorithm","score_opus":0.010618255854592492,"score_gpt":0.23893658910515012,"score_spread":0.22831833325055761,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081191210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33385375,0.00007844599,0.65605044,0.0009981177,0.001343661,0.0002480757,6.514163e-7,0.000062828534,0.007364023],"genre_scores_gemma":[0.9799467,0.000011278414,0.01903525,0.0002137954,0.00007808238,0.0000029415608,1.1979037e-7,0.000027086115,0.0006847836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979509,0.00047743384,0.00045669472,0.00021453372,0.00055201224,0.00034841773],"domain_scores_gemma":[0.99722075,0.000112540234,0.00025385924,0.00043427778,0.0015644241,0.0004141187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009455921,0.0001471561,0.00020904621,0.00037484246,0.00017232535,0.00018376087,0.0014849154,0.00001964293,0.000029492216],"category_scores_gemma":[0.00041891748,0.000121959165,0.00009801323,0.0012377593,0.000079782294,0.00093066506,0.0005045375,0.0005095041,0.00038502063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103969156,0.00055267767,0.0024377615,0.000024582894,0.00016426745,0.00074272987,0.003807627,0.0012090806,0.011781701,0.9025948,0.01297004,0.063610755],"study_design_scores_gemma":[0.009687044,0.016937261,0.17676258,0.00047524713,0.00006755397,0.0031707794,0.0019454194,0.00428901,0.021610722,0.590703,0.17193079,0.0024205833],"about_ca_topic_score_codex":0.0000021433311,"about_ca_topic_score_gemma":1.5090095e-7,"teacher_disagreement_score":0.6460929,"about_ca_system_score_codex":0.00013560499,"about_ca_system_score_gemma":0.00009783632,"threshold_uncertainty_score":0.49733505},"labels":[],"label_agreement":null},{"id":"W2082113404","doi":"10.1016/j.ejc.2010.05.007","title":"Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Univerzita Karlova v Praze","keywords":"Mathematics; Combinatorics; Clique; Hypergraph; clone (Java method); Discrete mathematics; Homomorphism; Boolean function; Monotone polygon; Minor (academic)","score_opus":0.008817298394155414,"score_gpt":0.20506831778030915,"score_spread":0.19625101938615375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082113404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7041705,0.00013247653,0.28299624,0.00049680425,0.0011967879,0.000081124526,0.0000023963285,0.000031452382,0.010892207],"genre_scores_gemma":[0.98613554,0.000024808278,0.013043099,0.00009080532,0.00006972615,6.2021894e-7,3.2419632e-7,0.000015956246,0.0006191107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989262,0.00012102504,0.00034725957,0.00017233357,0.00026249915,0.00017067723],"domain_scores_gemma":[0.99873054,0.00007364381,0.00027781876,0.00036120374,0.00031556384,0.00024120664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050452526,0.0001306739,0.00020123574,0.00028664505,0.00014111254,0.000053745458,0.000503149,0.000020808573,0.0000069297707],"category_scores_gemma":[0.00005776482,0.000099302146,0.00006817083,0.00068756205,0.00009093978,0.00029449633,0.000114583,0.00042379307,0.00001555584],"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.0002435943,0.0007486098,0.010712359,0.000042995514,0.00019261317,0.0012528985,0.0011317423,0.0004641812,0.010824406,0.92140204,0.0058313184,0.04715323],"study_design_scores_gemma":[0.012754463,0.024619317,0.45339835,0.0006041212,0.00046371197,0.013403408,0.0018790063,0.0004108301,0.01017718,0.1711589,0.30850202,0.002628722],"about_ca_topic_score_codex":5.1515303e-7,"about_ca_topic_score_gemma":0.0000018504832,"teacher_disagreement_score":0.7502431,"about_ca_system_score_codex":0.00001190758,"about_ca_system_score_gemma":0.00004706806,"threshold_uncertainty_score":0.40494242},"labels":[],"label_agreement":null},{"id":"W2082384308","doi":"10.1016/j.ejc.2008.12.006","title":"Symmetric matroid polytopes and their generation","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Matroid; Mathematics; Combinatorics; Polytope; Oriented matroid; Graphic matroid","score_opus":0.015182541598251557,"score_gpt":0.21102666050188307,"score_spread":0.19584411890363151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082384308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2325685,0.0021874483,0.76005304,0.001463888,0.00080397655,0.000039025526,3.425404e-7,0.000023954874,0.002859853],"genre_scores_gemma":[0.992404,0.00014720914,0.0067016655,0.00035698875,0.00028814192,6.314646e-8,9.0242185e-7,0.000004640036,0.000096429736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907166,0.00021298528,0.00030285126,0.000109025976,0.000200958,0.000102541286],"domain_scores_gemma":[0.99926376,0.000048174283,0.00022833022,0.00012774351,0.00023574136,0.00009622295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082571735,0.00009158736,0.000121032004,0.00029802773,0.00010203679,0.00018928871,0.0003191034,0.00001225267,0.0000016132977],"category_scores_gemma":[0.00007353831,0.00007290232,0.00004926196,0.00059695414,0.000009708753,0.00046675786,0.000044992907,0.0001232696,0.0000063972466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009296413,0.0001792154,0.00015194861,0.000005310891,0.000024295128,0.00009024989,0.00055072276,0.0012147742,0.010733459,0.53021127,0.004469768,0.4523597],"study_design_scores_gemma":[0.008551789,0.012120686,0.24497545,0.00017597029,0.00008985826,0.0053481734,0.00018137015,0.2311988,0.057208035,0.27074173,0.16740909,0.001999038],"about_ca_topic_score_codex":9.819903e-8,"about_ca_topic_score_gemma":3.3424957e-8,"teacher_disagreement_score":0.7598355,"about_ca_system_score_codex":0.00002367282,"about_ca_system_score_gemma":0.00003727218,"threshold_uncertainty_score":0.29728705},"labels":[],"label_agreement":null},{"id":"W2083711510","doi":"10.1016/j.ejc.2007.04.015","title":"Colorful subgraphs in Kneser-like graphs","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Generalization; Bipartite graph; Vertex (graph theory); Chromatic scale; Robertson–Seymour theorem; Discrete mathematics; Chordal graph; Graph; 1-planar graph","score_opus":0.011834286054315373,"score_gpt":0.22893041782465462,"score_spread":0.21709613177033923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083711510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7124712,0.0014087552,0.26378492,0.0006413345,0.002144833,0.00007121347,0.0000016026552,0.00005590468,0.01942029],"genre_scores_gemma":[0.99710494,0.00014988375,0.0022720378,0.00024618744,0.000038147486,9.592033e-8,6.822415e-7,0.000007906478,0.00018014165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9978567,0.00031526666,0.00075322686,0.00019843479,0.0005265469,0.00034983986],"domain_scores_gemma":[0.9984661,0.00025325033,0.00042006606,0.00037527632,0.00025012819,0.00023521512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044099973,0.00014062332,0.00030243912,0.0012002577,0.000067205925,0.000104145416,0.001733056,0.0000313726,0.000019648158],"category_scores_gemma":[0.00026495705,0.00010846177,0.00019555037,0.004629604,0.000061957035,0.00046270946,0.0002667012,0.00040863556,0.000047726255],"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.00009046091,0.0013720632,0.11940647,0.000017641454,0.00013870808,0.011189656,0.0007527793,0.000118368946,0.00020281319,0.79154015,0.00937722,0.06579369],"study_design_scores_gemma":[0.0033271792,0.0020914911,0.749224,0.000057722194,0.00005202897,0.0005045686,0.00023299339,0.00028917694,0.0003500625,0.1107801,0.13244948,0.0006412013],"about_ca_topic_score_codex":0.000003927467,"about_ca_topic_score_gemma":0.0000032471282,"teacher_disagreement_score":0.68076,"about_ca_system_score_codex":0.000044821783,"about_ca_system_score_gemma":0.000031448242,"threshold_uncertainty_score":0.44229427},"labels":[],"label_agreement":null},{"id":"W2084490360","doi":"10.1016/j.ejc.2003.10.006","title":"Stable sets of maximal size in Kneser-type graphs","year":2003,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":123,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Combinatorics; Automorphism; Transitive relation; Vertex (graph theory); Indifference graph; Chordal graph; Maximal independent set; Discrete mathematics; 1-planar graph; Graph","score_opus":0.027114038223941424,"score_gpt":0.2683398913297358,"score_spread":0.24122585310579436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084490360","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9593793,0.00048258432,0.00012917716,0.000020229385,0.001186396,0.00006679782,0.0000017318382,0.000009013558,0.038724758],"genre_scores_gemma":[0.99677306,0.0001144147,0.0027801797,0.000030108287,0.000019081133,1.11010586e-7,1.4801272e-7,0.000038621718,0.0002442996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771947,0.00078173523,0.00078644435,0.000102220285,0.0003809416,0.00022919306],"domain_scores_gemma":[0.9982037,0.000479925,0.00059494586,0.00028232238,0.00033774553,0.00010138601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024376586,0.00015703669,0.00039484826,0.00019752524,0.00006471826,0.000017748851,0.00038128145,0.000037307,0.000097909506],"category_scores_gemma":[0.0017774131,0.0001261513,0.00014282526,0.0005298095,0.00007520247,0.00012793513,0.00006258879,0.00040309242,0.0000025937225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009686145,0.00026597784,0.01290081,0.00008540968,0.00005753293,0.0003123891,0.00093274727,0.000015332196,0.0002973953,0.9831287,0.0016151137,0.00029168],"study_design_scores_gemma":[0.0015525664,0.00049636594,0.010147518,0.00009860331,0.000037189242,0.00012818267,0.00022058189,0.0000034329173,0.0011957467,0.98183554,0.004124432,0.00015985442],"about_ca_topic_score_codex":4.880527e-7,"about_ca_topic_score_gemma":2.3396183e-7,"teacher_disagreement_score":0.038480457,"about_ca_system_score_codex":0.000032361208,"about_ca_system_score_gemma":0.000059057795,"threshold_uncertainty_score":0.51443005},"labels":[],"label_agreement":null},{"id":"W2084802325","doi":"10.1016/j.ejc.2007.01.002","title":"Characterizations of finite and infinite episturmian words via lexicographic orderings","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Lexicographical order; Mathematics; Alphabet; Finite set; Combinatorics on words; Order (exchange); Characterization (materials science); Combinatorics; Skew; Set (abstract data type); Infinite set; Infinite product; Discrete mathematics; Word (group theory); Mathematical analysis; Linguistics; Computer science","score_opus":0.007909369142483323,"score_gpt":0.2068976660720896,"score_spread":0.19898829692960626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084802325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41181797,0.00030656508,0.5852535,0.00017660075,0.0005486418,0.0000336109,8.975306e-7,0.00002829285,0.0018339751],"genre_scores_gemma":[0.9961649,0.00015414094,0.0034160062,0.00014921045,0.00005777286,8.8122654e-8,6.705132e-7,0.000015887847,0.00004128496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99867934,0.000157931,0.0005909636,0.000120299395,0.00026362564,0.0001878401],"domain_scores_gemma":[0.9985613,0.0002084985,0.0005986927,0.00025956472,0.0002244014,0.00014750163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019616678,0.00012214191,0.0002127126,0.0003803049,0.00008324228,0.0000785744,0.0006310712,0.000022619648,0.00000454665],"category_scores_gemma":[0.00011935258,0.000109956425,0.000078333345,0.0007907544,0.00008476929,0.00042180537,0.00017869251,0.00023128984,0.000003824329],"study_design_candidate":"observational","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.00009945275,0.00084410806,0.056258924,0.0001742046,0.00020195107,0.0014152044,0.008661625,0.00009701849,0.018593328,0.6758038,0.0002939135,0.23755649],"study_design_scores_gemma":[0.003475758,0.002100559,0.8830508,0.00051694055,0.00007446441,0.0009824977,0.00022196115,0.0035977084,0.005277405,0.066260576,0.033595577,0.0008457743],"about_ca_topic_score_codex":7.311901e-7,"about_ca_topic_score_gemma":2.0442177e-7,"teacher_disagreement_score":0.8267919,"about_ca_system_score_codex":0.000011625001,"about_ca_system_score_gemma":0.000026808728,"threshold_uncertainty_score":0.4483893},"labels":[],"label_agreement":null},{"id":"W2089574458","doi":"10.1016/j.ejc.2010.01.003","title":"Some weak indivisibility results in ultrahomogeneous metric spaces","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Countable set; Metric space; Partition (number theory); Metric (unit); Property (philosophy); Space (punctuation); Combinatorics; Product metric; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.024339793303434717,"score_gpt":0.2912635724384608,"score_spread":0.2669237791350261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089574458","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98571026,0.0003685812,0.0006531796,0.00027312728,0.0019482243,0.00008757506,0.000005783708,0.000027048576,0.010926225],"genre_scores_gemma":[0.9967891,0.00010938056,0.0023259844,0.000037208236,0.00024810163,2.5922012e-7,8.067414e-7,0.000032405467,0.0004567787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997611,0.0007489568,0.00088698586,0.00017350103,0.00030886751,0.0002706766],"domain_scores_gemma":[0.99741733,0.0011359643,0.00072020956,0.0003911409,0.00018870577,0.00014666308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004903274,0.00017132635,0.00037813335,0.0003985318,0.00008065858,0.00002733173,0.00054147805,0.000071518654,0.000021549013],"category_scores_gemma":[0.005349812,0.0001433472,0.00012280545,0.0004750388,0.0001431617,0.00023229035,0.00007647546,0.0012374228,0.000028611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005360093,0.0013023801,0.0055970293,0.00006464123,0.00008882573,0.0019201137,0.0017881026,0.00005403672,0.002046021,0.97957164,0.002027192,0.005004021],"study_design_scores_gemma":[0.0026917178,0.0004885555,0.013680167,0.000036682657,0.0000344688,0.00040510407,0.00024121221,0.000008216158,0.0015368232,0.9736191,0.0070353067,0.00022261817],"about_ca_topic_score_codex":5.885833e-7,"about_ca_topic_score_gemma":0.0000034868733,"teacher_disagreement_score":0.01107882,"about_ca_system_score_codex":0.00004498401,"about_ca_system_score_gemma":0.000064565145,"threshold_uncertainty_score":0.64046115},"labels":[],"label_agreement":null},{"id":"W2089905104","doi":"10.1016/j.ejc.2013.06.034","title":"On the number of monochromatic solutions of integer linear systems on abelian groups","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Monochromatic color; Integer (computer science); Abelian group; Combinatorics; Exponent; Natural number; Homogeneous; Integer matrix; Discrete mathematics; Matrix (chemical analysis); Physics; Symmetric matrix; Nonnegative matrix; Quantum mechanics","score_opus":0.03894188381614987,"score_gpt":0.2681822148189683,"score_spread":0.22924033100281843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089905104","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97217506,0.00011640893,0.001730078,0.0001671355,0.0011901144,0.00018328027,0.0000043149357,0.000011190767,0.024422416],"genre_scores_gemma":[0.99929184,0.000026025928,0.00029896703,0.00004673356,0.000085835534,0.0000010339594,2.352781e-7,0.000036019737,0.00021332206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976979,0.0007352678,0.00086835324,0.0000785976,0.00045184922,0.00016803636],"domain_scores_gemma":[0.9969761,0.0010601641,0.001011549,0.00043583463,0.00043926813,0.000077134035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015926892,0.00015475304,0.00036989758,0.00011701309,0.00012507311,0.000022076189,0.00053769903,0.00003476033,0.00010345479],"category_scores_gemma":[0.00078880397,0.00008756788,0.00020232031,0.00021253567,0.0001318545,0.00007680855,0.00008476567,0.00041049634,0.00003854011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018296378,0.00021536452,0.00014045868,0.000105839456,0.00011226407,0.000010397085,0.00084134657,0.000058754104,0.000121606936,0.99141407,0.006867833,0.000093779265],"study_design_scores_gemma":[0.00083932513,0.00078875973,0.0017300317,0.0009037456,0.00010248568,0.00010598697,0.0008113158,0.0005754751,0.0004511129,0.9931688,0.00035106848,0.00017191052],"about_ca_topic_score_codex":0.0000021521757,"about_ca_topic_score_gemma":3.9992482e-8,"teacher_disagreement_score":0.027116766,"about_ca_system_score_codex":0.00003320084,"about_ca_system_score_gemma":0.000022108923,"threshold_uncertainty_score":0.35709146},"labels":[],"label_agreement":null},{"id":"W2091165358","doi":"10.1016/j.ejc.2009.03.023","title":"A linear equation for Minkowski sums of polytopes relatively in general position","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Minkowski addition; Polytope; Minkowski space; Position (finance); Combinatorics; General position; Pure mathematics; Mathematical analysis; Mathematical physics","score_opus":0.08084035713429075,"score_gpt":0.3293928859405814,"score_spread":0.24855252880629067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091165358","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8461146,0.0005422259,0.14755706,0.00062969443,0.00029412273,0.0001677631,0.00000860854,0.000011745173,0.0046741893],"genre_scores_gemma":[0.9869679,0.000057558744,0.012347734,0.00005781279,0.00013078266,3.8532738e-7,0.0000026842831,0.000015313415,0.00041980945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851954,0.0001903469,0.00079950463,0.00007381147,0.00027115282,0.00014563829],"domain_scores_gemma":[0.9982813,0.00033120607,0.00075302506,0.000091887785,0.0004957018,0.000046854642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018257146,0.00010259795,0.0002868627,0.00036732992,0.000034560962,0.00001692051,0.00016892918,0.00002899646,0.0000052949904],"category_scores_gemma":[0.0012354165,0.00008892035,0.00011385629,0.00043860462,0.000016717195,0.00022525035,0.00001445609,0.00015862352,0.0000014353147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002929784,0.0005465206,0.00040421114,0.00020155536,0.000045537447,0.000058673464,0.0024991657,0.00017767533,0.0013825124,0.9875865,0.001498859,0.0053057945],"study_design_scores_gemma":[0.0038980064,0.0037685777,0.006964149,0.00041056226,0.000081611935,0.00006868283,0.00038415822,0.0013910799,0.008432031,0.9726969,0.0016412674,0.0002629569],"about_ca_topic_score_codex":0.0000010572518,"about_ca_topic_score_gemma":1.8248902e-7,"teacher_disagreement_score":0.14085333,"about_ca_system_score_codex":0.000055430464,"about_ca_system_score_gemma":0.000051100254,"threshold_uncertainty_score":0.36260667},"labels":[],"label_agreement":null},{"id":"W2093180783","doi":"10.1016/j.ejc.2014.06.009","title":"The Chen–Chvátal conjecture for metric spaces induced by distance-hereditary graphs","year":2014,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Conjecture; Metric space; De Bruijn sequence; Discrete mathematics; De Bruijn graph; Generalization; Mathematical analysis","score_opus":0.014858984196394653,"score_gpt":0.2557884431531749,"score_spread":0.24092945895678025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093180783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06391734,0.003404184,0.92446166,0.0020372227,0.0029614177,0.0002591087,0.00000625964,0.000061483974,0.0028913093],"genre_scores_gemma":[0.9973941,0.00012711284,0.0019559357,0.000096339594,0.00016103928,0.0000021443502,9.813134e-7,0.000034185017,0.00022819455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99725914,0.00089310325,0.00048263368,0.00023151946,0.000697112,0.00043650324],"domain_scores_gemma":[0.99688435,0.0013250598,0.0005214739,0.0005444479,0.0004876823,0.00023699549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038275172,0.00019850623,0.00026928322,0.00023371782,0.00044157144,0.00031638335,0.0024548396,0.000033620032,0.0000016796457],"category_scores_gemma":[0.0009787367,0.00013137798,0.00020671537,0.0011705597,0.0001313423,0.0004720308,0.0002214255,0.0005958315,0.000007520499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009412602,0.00012725647,0.00023510508,0.000023190092,0.00009805819,0.000059989794,0.00029244536,0.000043315173,0.00092433486,0.9433083,0.018196212,0.03659767],"study_design_scores_gemma":[0.0032953059,0.0031792715,0.0015967208,0.000058481128,0.000031202835,0.00016493563,0.00015303119,0.0013245166,0.0024291752,0.65143377,0.33586013,0.00047345003],"about_ca_topic_score_codex":3.3538683e-7,"about_ca_topic_score_gemma":3.2612547e-7,"teacher_disagreement_score":0.93347675,"about_ca_system_score_codex":0.00005571686,"about_ca_system_score_gemma":0.00006495477,"threshold_uncertainty_score":0.53574383},"labels":[],"label_agreement":null},{"id":"W2094345793","doi":"10.1016/j.ejc.2007.04.010","title":"Latin squares and low discrepancy allocation of two-dimensional data","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of British Columbia","keywords":"Rectangle; Latin square; Combinatorics; Tile; Mathematics; Square (algebra); Space (punctuation); Discrete mathematics; Algorithm; Computer science; Geometry; Geography","score_opus":0.029084955832189962,"score_gpt":0.2859633665509024,"score_spread":0.2568784107187124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094345793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21786138,0.00091283774,0.7729503,0.00037749004,0.00037989355,0.00006239741,0.0000028073973,0.00007449294,0.0073784264],"genre_scores_gemma":[0.9152763,0.000011544153,0.084547445,0.0000487246,0.000033536842,4.0054513e-8,0.0000018027969,0.000011050455,0.00006959129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987309,0.00009600377,0.000501696,0.00015422747,0.00039005151,0.0001271363],"domain_scores_gemma":[0.9984224,0.000117378586,0.0005266781,0.00046391223,0.00037575467,0.00009387667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021128478,0.000091931644,0.00015049089,0.0001907129,0.000041944826,0.00013120552,0.0011943913,0.000011056895,8.610643e-7],"category_scores_gemma":[0.00026444142,0.00007900969,0.000026640177,0.00035085357,0.00006798414,0.0012506201,0.0006387327,0.00014691254,0.0000020281213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091340844,0.0013018518,0.010420227,0.00022895863,0.000101513644,0.0010820575,0.001352173,0.00008456602,0.016965609,0.50087184,0.008490668,0.45900917],"study_design_scores_gemma":[0.008066662,0.0047688247,0.1993877,0.00318665,0.00015700984,0.0018240005,0.00016047989,0.05202783,0.13633882,0.5828805,0.009262339,0.0019391826],"about_ca_topic_score_codex":0.0000010111114,"about_ca_topic_score_gemma":2.0243615e-7,"teacher_disagreement_score":0.6974149,"about_ca_system_score_codex":0.000016599062,"about_ca_system_score_gemma":0.00006079029,"threshold_uncertainty_score":0.32219216},"labels":[],"label_agreement":null},{"id":"W2094753236","doi":"10.1016/j.ejc.2004.09.003","title":"Signed Mahonian polynomials for classical Weyl groups","year":2004,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Weyl group; Flag (linear algebra); Type (biology); Sign (mathematics); Combinatorics; Macdonald polynomials; Generating function; Symmetric group; Pure mathematics; Index (typography); Product (mathematics); Algebra over a field; Orthogonal polynomials; Difference polynomials; Mathematical analysis; Geometry","score_opus":0.045842190365600485,"score_gpt":0.30538646486772847,"score_spread":0.25954427450212797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094753236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23720038,0.00033611915,0.7434598,0.002072168,0.007075341,0.00087227,0.000014273607,0.00019681592,0.008772805],"genre_scores_gemma":[0.94615614,0.000021918624,0.052313566,0.000097180826,0.0008386512,0.000004324596,0.0000011577387,0.00017196729,0.00039511189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690425,0.00031327497,0.0014328052,0.00022525326,0.0006445308,0.00047989475],"domain_scores_gemma":[0.9962151,0.0009711538,0.0013538852,0.00049139716,0.00062944915,0.00033899405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002140003,0.00034894916,0.00076826045,0.00021280612,0.00018270631,0.000096942415,0.000849952,0.000080881546,0.000014858884],"category_scores_gemma":[0.0028534825,0.00030847863,0.00041600832,0.00033479338,0.00010108378,0.00031082553,0.00012887896,0.00048759737,0.000041767253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014246951,0.000736146,0.000010766164,0.00013122667,0.000096089025,0.00020511636,0.00059382466,0.000049188642,0.0012005176,0.9925775,0.0036435083,0.00061362673],"study_design_scores_gemma":[0.006241259,0.0015558418,0.000044986708,0.00021321868,0.00013907923,0.00020545123,0.00015606364,0.000016519254,0.0025503093,0.9773684,0.011159484,0.00034934658],"about_ca_topic_score_codex":1.6629704e-7,"about_ca_topic_score_gemma":2.513823e-7,"teacher_disagreement_score":0.7089557,"about_ca_system_score_codex":0.00034780003,"about_ca_system_score_gemma":0.00018269657,"threshold_uncertainty_score":0.99993676},"labels":[],"label_agreement":null},{"id":"W2097770061","doi":"10.1016/j.ejc.2016.03.002","title":"A characterization of functions with vanishing averages over products of disjoint sets","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Disjoint sets; Mathematics; Characterization (materials science); Randomness; Combinatorics; Relation (database); Integrable system; Discrete mathematics; Pure mathematics; Statistics; Computer science; Data mining","score_opus":0.01870007576703975,"score_gpt":0.2319187107806285,"score_spread":0.21321863501358876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097770061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98838955,0.000030473426,0.009343195,0.00011478882,0.00055965135,0.000073473704,0.000011341847,0.000009338861,0.001468202],"genre_scores_gemma":[0.9989439,0.000045307934,0.00063320925,0.000010346013,0.00007340849,1.8462617e-7,7.3055213e-7,0.00003010817,0.00026276556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986797,0.00025991185,0.0005381951,0.000086984284,0.00033051686,0.00010467419],"domain_scores_gemma":[0.9980077,0.0001477106,0.001048071,0.00024163973,0.0005037117,0.000051123054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008060024,0.000110810746,0.0002643913,0.000119802135,0.00006111378,0.000011887421,0.00019913256,0.000018103432,0.000027612776],"category_scores_gemma":[0.0004249674,0.00006118446,0.000073342846,0.00018913657,0.000078614365,0.00023145282,0.000060950584,0.00012576701,7.361389e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005671084,0.00075450423,0.014614908,0.0006004371,0.0005175712,0.00013593427,0.004887807,0.000007000531,0.30604443,0.6628324,0.0013380777,0.0076998738],"study_design_scores_gemma":[0.008794454,0.00505971,0.31503397,0.0034970192,0.00068889913,0.00062739104,0.0004132541,0.000013739609,0.18170656,0.47385395,0.009435963,0.000875097],"about_ca_topic_score_codex":1.283015e-7,"about_ca_topic_score_gemma":6.8964574e-8,"teacher_disagreement_score":0.30041906,"about_ca_system_score_codex":0.000022350716,"about_ca_system_score_gemma":0.000036778732,"threshold_uncertainty_score":0.24950299},"labels":[],"label_agreement":null},{"id":"W2100478405","doi":"10.1016/j.ejc.2011.09.031","title":"Reduced clique graphs of chordal graphs","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Treewidth; Indifference graph; Interval graph; Split graph; Clique-sum; Pathwidth; Discrete mathematics; Clique; Graph; 1-planar graph; Line graph","score_opus":0.039253829072214,"score_gpt":0.2658061011198843,"score_spread":0.22655227204767028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100478405","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7097369,0.00095818186,0.23516701,0.00018272105,0.0023578077,0.00020148764,0.0000022551426,0.00008737258,0.05130629],"genre_scores_gemma":[0.9854243,0.0001892393,0.014204372,0.000040853447,0.000025097626,4.5840696e-7,1.75768e-7,0.000028554907,0.0000869398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970001,0.0010257887,0.0007792035,0.00021135375,0.0006422975,0.00034124727],"domain_scores_gemma":[0.9974023,0.00013466852,0.00074348866,0.000664246,0.00078215165,0.0002731439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028953406,0.0001759551,0.00033443762,0.00060675933,0.00008730174,0.00003817187,0.0024739963,0.000030228919,0.000017501576],"category_scores_gemma":[0.0002557164,0.00015312937,0.00026538142,0.0012855117,0.00018819289,0.0006283112,0.00032722845,0.0005766966,0.000017192326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008283417,0.00029558118,0.0014058867,0.000018104625,0.000057955574,0.00045363614,0.0011718365,0.00000654257,0.0037693388,0.9866414,0.00042447884,0.0056723733],"study_design_scores_gemma":[0.0015624932,0.0022680182,0.0180163,0.000101300284,0.000018586063,0.00034478155,0.00008714399,0.000060862156,0.030240193,0.945427,0.0015765947,0.0002967442],"about_ca_topic_score_codex":0.000001022482,"about_ca_topic_score_gemma":1.0001266e-7,"teacher_disagreement_score":0.27568743,"about_ca_system_score_codex":0.00002831838,"about_ca_system_score_gemma":0.00010464733,"threshold_uncertainty_score":0.6244434},"labels":[],"label_agreement":null},{"id":"W2104733152","doi":"10.1016/j.ejc.2012.02.001","title":"Maximal supports and Schur-positivity among connected skew shapes","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"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":"Skew; Mathematics; Combinatorics; Ribbon; Order (exchange); Skew-symmetric matrix; Class (philosophy); Schur product theorem; Schur decomposition; Schur complement; Geometry; Symmetric matrix; Computer science; Physics","score_opus":0.028489282583880008,"score_gpt":0.27421793943818346,"score_spread":0.24572865685430345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104733152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9750144,0.000505222,0.014444001,0.00006991155,0.0015271696,0.00018244956,0.0000032028004,0.00008128038,0.008172373],"genre_scores_gemma":[0.9916371,0.0000588597,0.007632333,0.000030509022,0.00036631254,0.0000010226229,7.395138e-7,0.00009961073,0.00017348907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732757,0.00048132072,0.00093512994,0.00015919167,0.0005916877,0.0005051334],"domain_scores_gemma":[0.9968927,0.0008009044,0.001112579,0.0002852552,0.00043415322,0.0004743993],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026099738,0.00031555127,0.0006072718,0.00018119291,0.00015908614,0.000077595374,0.0003648694,0.00006411482,0.00004830755],"category_scores_gemma":[0.0018566028,0.00028018333,0.0001480981,0.00028877956,0.00014744088,0.0007629151,0.00022473503,0.00059408287,0.000020173655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007857685,0.0011057549,0.021438316,0.0002534942,0.00018145627,0.000518637,0.0017922067,0.0000017335045,0.0006731218,0.9699326,0.0025725588,0.0014515227],"study_design_scores_gemma":[0.0031848182,0.0008810771,0.04635153,0.00040591534,0.00033610026,0.0013138764,0.0003183556,0.00005635836,0.0019769398,0.9408841,0.003575351,0.00071558496],"about_ca_topic_score_codex":4.176084e-7,"about_ca_topic_score_gemma":1.7352149e-7,"teacher_disagreement_score":0.029048529,"about_ca_system_score_codex":0.00010731763,"about_ca_system_score_gemma":0.00004566393,"threshold_uncertainty_score":0.999965},"labels":[],"label_agreement":null},{"id":"W2110985552","doi":"10.1016/j.ejc.2010.09.008","title":"A generalization of Meshulam’s theorem on subsets of finite abelian groups with no 3-term arithmetic progression (II)","year":2010,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"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; National Science Foundation","keywords":"Mathematics; Abelian group; Combinatorics; Cardinality (data modeling); Arithmetic progression; Generalization; Upper and lower bounds; Term (time); Matrix (chemical analysis); Group (periodic table); Discrete mathematics; Mathematical analysis","score_opus":0.013728264792289873,"score_gpt":0.2610165575834548,"score_spread":0.24728829279116496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110985552","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99134696,0.0000687904,0.0014456648,0.00003761019,0.00095667184,0.00013910796,0.000005213783,0.000014551751,0.0059854616],"genre_scores_gemma":[0.99507684,0.000046697543,0.0045821853,0.000025287873,0.00012100225,4.8655625e-7,0.000002069441,0.000054857606,0.00009054979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979522,0.00039691984,0.0007512512,0.00012819184,0.00059993,0.00017150836],"domain_scores_gemma":[0.9971866,0.00024534666,0.0013556897,0.00040074316,0.00070528314,0.000106320476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014838896,0.00020026405,0.0004013856,0.00025052062,0.00013301443,0.000019153793,0.00045842523,0.000055578166,0.000048837006],"category_scores_gemma":[0.00048428835,0.00012696408,0.00013975211,0.00028600634,0.00018586247,0.000103648235,0.00009458605,0.0004664939,0.000001540279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041443782,0.0006255805,0.0041879187,0.00021768283,0.00012105694,0.00010887102,0.0020071187,0.000033455206,0.0059925923,0.983785,0.00038297227,0.0021233202],"study_design_scores_gemma":[0.00702823,0.009732114,0.02188448,0.0019182806,0.00043392414,0.0003754718,0.00014601025,0.00039470335,0.04072801,0.91459405,0.0020433983,0.0007213076],"about_ca_topic_score_codex":1.6581025e-7,"about_ca_topic_score_gemma":3.2074288e-7,"teacher_disagreement_score":0.06919093,"about_ca_system_score_codex":0.0000142284935,"about_ca_system_score_gemma":0.000039157192,"threshold_uncertainty_score":0.5177445},"labels":[],"label_agreement":null},{"id":"W2116830615","doi":"10.1016/j.ejc.2008.12.009","title":"Monomial bases for broken circuit complexes","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Monomial; Conjecture; Modulo; Combinatorics; Vector space; Finite field; Discrete mathematics; Homogeneous; Graph; Space (punctuation); Pure mathematics","score_opus":0.08651963829677255,"score_gpt":0.32475587824134744,"score_spread":0.23823623994457488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116830615","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66936696,0.00047817026,0.26819745,0.003067843,0.00068243465,0.0005630732,0.000029178074,0.00009097497,0.057523947],"genre_scores_gemma":[0.99558675,0.000024976085,0.0036155472,0.00022451465,0.00022126661,0.0000010816893,0.0000018609071,0.000025916848,0.00029811283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988858,0.00016179071,0.0005295562,0.00008927785,0.00017576638,0.00015781699],"domain_scores_gemma":[0.9983141,0.00054263155,0.00045920754,0.00022023512,0.00035583592,0.000108031265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007477961,0.00012267147,0.0002617337,0.000100501435,0.00013733433,0.00005475976,0.00040243828,0.000014737507,0.000026202948],"category_scores_gemma":[0.0004118784,0.000108355445,0.00016838522,0.00014248148,0.000031563934,0.00012957494,0.000026486834,0.00017101495,0.000013487548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039031856,0.00035934435,0.00011858601,0.00001689736,0.000042889103,0.00001669542,0.00043670024,0.000004571128,0.0011309304,0.9326259,0.055423036,0.0097854445],"study_design_scores_gemma":[0.0016707401,0.0010120878,0.006095447,0.00004199931,0.00008144202,0.000060915674,0.00010554644,0.000040426312,0.0011105859,0.8971338,0.09246953,0.00017747517],"about_ca_topic_score_codex":1.972518e-7,"about_ca_topic_score_gemma":1.5857123e-7,"teacher_disagreement_score":0.3262198,"about_ca_system_score_codex":0.000052033763,"about_ca_system_score_gemma":0.000041852614,"threshold_uncertainty_score":0.44186068},"labels":[],"label_agreement":null},{"id":"W2119307154","doi":"10.1016/j.ejc.2012.10.008","title":"Resolving sets for Johnson and Kneser graphs","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Chordal graph; Indifference graph; Discrete mathematics; Metric dimension; 1-planar graph; Graph","score_opus":0.014346862872492924,"score_gpt":0.21398185471597825,"score_spread":0.19963499184348532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119307154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9746955,0.009003851,0.0030688602,0.000025524592,0.0029270062,0.000085718995,0.000002322406,0.00004805528,0.0101431385],"genre_scores_gemma":[0.9993406,0.00017975496,0.00023128222,0.000013402812,0.0001388631,5.745907e-7,4.018267e-7,0.0000400431,0.000055096836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992047,0.00013945,0.0002924904,0.00004268847,0.00011503204,0.00020562268],"domain_scores_gemma":[0.9994904,0.00008494712,0.000099127494,0.00009758443,0.0000745959,0.00015336128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014460542,0.00010331728,0.00016140853,0.000121075194,0.000063024345,0.000032931315,0.000127844,0.00002012623,0.000004252225],"category_scores_gemma":[0.000053655865,0.000090773494,0.00007955422,0.0001243799,0.00001788786,0.00023821292,0.00001651191,0.00015907519,0.000005668463],"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.00031443598,0.0005063815,0.07604633,0.0016865467,0.0009204532,0.00028332943,0.0111714965,0.0011715791,0.013670051,0.74950296,0.110032074,0.03469434],"study_design_scores_gemma":[0.006356277,0.0013103482,0.086414784,0.00072151853,0.00028422862,0.0014818304,0.0012107918,0.0014014065,0.0038682516,0.05898854,0.83669555,0.001266477],"about_ca_topic_score_codex":7.3794446e-8,"about_ca_topic_score_gemma":2.952265e-8,"teacher_disagreement_score":0.7266635,"about_ca_system_score_codex":0.000015530664,"about_ca_system_score_gemma":0.0000034264133,"threshold_uncertainty_score":0.37016356},"labels":[],"label_agreement":null},{"id":"W2121495542","doi":"10.1016/j.ejc.2006.06.024","title":"Divisibility of countable metric spaces","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Divisibility rule; Countable set; Metric space; Combinatorics; Metric (unit); Pure mathematics; Discrete mathematics","score_opus":0.022424752170812055,"score_gpt":0.2816058676378148,"score_spread":0.25918111546700273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121495542","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.914472,0.0011580625,0.034475077,0.00007247405,0.00070049945,0.00006362302,0.0000037982647,0.000020742675,0.049033746],"genre_scores_gemma":[0.99625987,0.000039316346,0.0026992126,0.000013303807,0.00008624428,9.699541e-8,4.5924128e-7,0.000021340224,0.00088015874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983216,0.00049115875,0.00065578346,0.00008615545,0.0002858659,0.00015943596],"domain_scores_gemma":[0.997966,0.00060593605,0.0007992137,0.00023372474,0.00034253023,0.00005261254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024283607,0.00011204111,0.00034735,0.00016990947,0.00006193112,0.00001143534,0.00030246857,0.00002781688,0.000049806647],"category_scores_gemma":[0.0007326403,0.00009120268,0.00012324128,0.00035955728,0.00012288878,0.00014736588,0.00005462652,0.000265599,0.000009539106],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007660049,0.0006065776,0.007415816,0.000082943254,0.000052861087,0.0001445862,0.0001563736,0.0000804576,0.00033887447,0.9858186,0.004790377,0.00043592433],"study_design_scores_gemma":[0.0009700145,0.00035937334,0.0076779583,0.000038252023,0.000064077765,0.00007164438,0.00012255434,0.000008599977,0.0018861541,0.9820622,0.0066266935,0.000112445916],"about_ca_topic_score_codex":0.0000014343465,"about_ca_topic_score_gemma":4.672874e-7,"teacher_disagreement_score":0.08178789,"about_ca_system_score_codex":0.00004377081,"about_ca_system_score_gemma":0.00003725649,"threshold_uncertainty_score":0.37191373},"labels":[],"label_agreement":null},{"id":"W2122238195","doi":"10.1016/j.ejc.2009.11.008","title":"An improved linear bound on the number of perfect matchings in cubic graphs","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Cubic graph; Perfect graph theorem; Polytope; Matching (statistics); Perfect graph; Trivially perfect graph; Dimension (graph theory); Graph; Upper and lower bounds; Discrete mathematics; Line graph; Pathwidth; Mathematical analysis","score_opus":0.016313602346027672,"score_gpt":0.29190614115601826,"score_spread":0.2755925388099906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122238195","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97855896,0.000092954666,0.016423468,0.0007169074,0.00029450157,0.00009875571,5.0502615e-7,0.00001923273,0.0037946976],"genre_scores_gemma":[0.99790347,0.000048545,0.0017150939,0.00022854419,0.000034595218,2.3978902e-7,1.4420748e-7,0.000016421649,0.000052929834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738556,0.0011374449,0.00050379365,0.00017563523,0.0005208451,0.00027673724],"domain_scores_gemma":[0.998356,0.000268,0.00038313394,0.00059152284,0.0002687277,0.0001326127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035746135,0.00014572336,0.00023666672,0.00024214775,0.00010254598,0.000092189606,0.0019391007,0.000020828958,0.000008361932],"category_scores_gemma":[0.00020157294,0.00009988838,0.00012980677,0.0009045955,0.0000847284,0.0005072509,0.00008920772,0.0007302583,0.000016418293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015374974,0.00076699315,0.0027464626,0.000011951381,0.000023216475,0.0003673576,0.0016447693,0.0002699515,0.00991276,0.9713303,0.0001728749,0.012599637],"study_design_scores_gemma":[0.0024535025,0.004541385,0.038478885,0.00020007988,0.000011332143,0.0003013412,0.00017247937,0.0063777124,0.0080651045,0.9380362,0.00097296183,0.00038903786],"about_ca_topic_score_codex":0.0000010062613,"about_ca_topic_score_gemma":1.5234528e-7,"teacher_disagreement_score":0.035732426,"about_ca_system_score_codex":0.000043832817,"about_ca_system_score_gemma":0.00006213852,"threshold_uncertainty_score":0.40733296},"labels":[],"label_agreement":null},{"id":"W2134206798","doi":"10.1016/j.ejc.2011.01.016","title":"On the asymptotic proportion of connected matroids","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Marsden Fund; Foundation for Research, Science and Technology","keywords":"Matroid; Mathematics; Combinatorics; Conjecture; Asymptotically optimal algorithm; Automorphism group; Discrete mathematics; Automorphism","score_opus":0.038056690377805034,"score_gpt":0.23923317974985886,"score_spread":0.20117648937205382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134206798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6783245,0.00013600169,0.29739517,0.0003206991,0.00077699975,0.00015973984,5.7263895e-7,0.000036885456,0.022849396],"genre_scores_gemma":[0.9980056,0.00001818942,0.001796661,0.000051099236,0.000019946681,3.436908e-7,8.293105e-8,0.0000143628995,0.00009368491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978644,0.00082160515,0.00045335412,0.000108042696,0.0005745862,0.00017797612],"domain_scores_gemma":[0.99809664,0.00022969797,0.0005560323,0.00045484575,0.00057220587,0.00009056536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024125266,0.000097261676,0.00015965097,0.000181174,0.00007807097,0.000028669585,0.0014188512,0.00001300464,0.000027152315],"category_scores_gemma":[0.0005024172,0.000061109204,0.00009913256,0.0005697821,0.00010884395,0.00024844543,0.00015031108,0.0003490627,0.00003376282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045517325,0.00016204389,0.0003577879,0.0000072107387,0.000023541656,0.00012607299,0.0004497641,0.000016726886,0.00062961894,0.9964927,0.00027810503,0.0014109416],"study_design_scores_gemma":[0.0013493389,0.0044377972,0.024620455,0.00015247813,0.00001970222,0.0002480057,0.00011852394,0.0006381242,0.020255035,0.9471554,0.0007798705,0.00022527459],"about_ca_topic_score_codex":2.0041092e-7,"about_ca_topic_score_gemma":2.436763e-8,"teacher_disagreement_score":0.31968108,"about_ca_system_score_codex":0.000029681505,"about_ca_system_score_gemma":0.000056705354,"threshold_uncertainty_score":0.26366022},"labels":[],"label_agreement":null},{"id":"W2136534655","doi":"10.1016/j.ejc.2004.01.002","title":"A note on orientations of the infinite random graph","year":2004,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Pigeonhole principle; Mathematics; Combinatorics; Countable set; Discrete mathematics; Graph; Property (philosophy); Random graph","score_opus":0.023223625033066412,"score_gpt":0.2911247830370573,"score_spread":0.2679011580039909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136534655","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84762967,0.00016377203,0.11042078,0.0012872653,0.0024909256,0.00018704118,0.0000062572803,0.000023992206,0.03779028],"genre_scores_gemma":[0.9981991,0.000026774105,0.0014072714,0.00016626803,0.000048387086,2.419759e-7,1.8773804e-7,0.000018308314,0.00013344588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987441,0.00041393956,0.0004570925,0.000056003628,0.0002244405,0.00010443589],"domain_scores_gemma":[0.99844855,0.0004979833,0.00059018016,0.00022452153,0.00018987541,0.000048894002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087965943,0.00009097751,0.00020180784,0.00009491397,0.00011259188,0.0000058958585,0.00030966278,0.000021190419,0.000010526695],"category_scores_gemma":[0.0009875637,0.00005858837,0.00017026451,0.0002620463,0.00013848866,0.000068333546,0.000037361613,0.00035595204,0.000008720863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015463731,0.00021609128,0.00009875062,0.000011814452,0.00003400503,0.00004907946,0.0013461335,0.00041985317,0.0001411514,0.9971125,0.00020169285,0.00021428156],"study_design_scores_gemma":[0.003993554,0.00032740267,0.0008152274,0.000099326426,0.00005080391,0.00006463937,0.00013244666,0.0000010644256,0.0015949954,0.9914623,0.0013951929,0.000063080035],"about_ca_topic_score_codex":1.13928444e-7,"about_ca_topic_score_gemma":2.3174273e-7,"teacher_disagreement_score":0.15056942,"about_ca_system_score_codex":0.000029891093,"about_ca_system_score_gemma":0.00005306768,"threshold_uncertainty_score":0.23891644},"labels":[],"label_agreement":null},{"id":"W2143149197","doi":"10.1016/j.ejc.2008.01.011","title":"From the Kneser–Poulsen conjecture to ball-polyhedra","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Polyhedron; Ball (mathematics); Conjecture; Combinatorics; Euclidean geometry; Euclidean space; Intersection (aeronautics); Finite set; Pure mathematics; Geometry; Mathematical analysis","score_opus":0.050821044902606215,"score_gpt":0.2747463600608664,"score_spread":0.22392531515826017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143149197","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9731941,0.000690251,0.0069874045,0.005568075,0.0018629163,0.00011841014,0.0000066147836,0.000034372784,0.011537812],"genre_scores_gemma":[0.9955322,0.00006428229,0.0014082125,0.0007570982,0.0007463976,3.5389087e-7,8.168324e-7,0.000042517888,0.0014481194],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980166,0.0005392432,0.00059005973,0.00013853585,0.0004520646,0.00026351554],"domain_scores_gemma":[0.99769396,0.001045481,0.00042774502,0.00038508483,0.00023348891,0.00021423015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009582764,0.00018199356,0.0003637205,0.00014305451,0.00018992735,0.00003132365,0.00084182835,0.000041799027,0.00022206879],"category_scores_gemma":[0.001647989,0.00011419986,0.00016935926,0.00059466343,0.0000919571,0.000077478275,0.00015947719,0.0005288806,0.00018061994],"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.00014830971,0.0006623777,0.013071374,0.0000239035,0.00046289992,0.004549077,0.01209031,0.00003828754,0.00030628897,0.21684971,0.7458343,0.005963134],"study_design_scores_gemma":[0.004410227,0.0018570632,0.07783512,0.00013067057,0.00023122657,0.0029774953,0.0017430091,0.000010999565,0.00063577306,0.45837492,0.4511064,0.0006870905],"about_ca_topic_score_codex":0.000005607427,"about_ca_topic_score_gemma":6.86042e-7,"teacher_disagreement_score":0.29472792,"about_ca_system_score_codex":0.00004366297,"about_ca_system_score_gemma":0.000079048084,"threshold_uncertainty_score":0.4656935},"labels":[],"label_agreement":null},{"id":"W2143482081","doi":"10.1016/j.ejc.2014.09.009","title":"Decomposition of bounded degree graphs into <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-free subgraphs","year":2014,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Partition (number theory); Combinatorics; Bounded function; Iterated function; Degree (music); Graph; Discrete mathematics; Mathematical analysis; Physics","score_opus":0.01790779142924023,"score_gpt":0.24446387120057606,"score_spread":0.22655607977133582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143482081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6342117,0.0014201814,0.0016184378,0.00031391886,0.0043919594,0.000035221132,0.00011562115,0.00009971522,0.3577932],"genre_scores_gemma":[0.9900359,0.0017273722,0.004579564,0.00084958476,0.0015134445,0.00007655305,0.00026870423,0.000778973,0.00016991603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9901006,0.001286297,0.0028137162,0.0011312783,0.0028834855,0.0017845749],"domain_scores_gemma":[0.9894375,0.0021105208,0.004183508,0.0026690513,0.00045656553,0.0011428212],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004458934,0.00091482635,0.0005319621,0.00084537506,0.0016359064,0.0011201076,0.0032581275,0.0012674965,0.085972145],"category_scores_gemma":[0.0027894452,0.0015279804,0.0024414188,0.0013108571,0.0016788467,0.0012827368,0.0020082043,0.0022617262,0.00043059717],"study_design_candidate":"bench_or_experimental","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.0015416156,0.00050190906,0.000040410778,0.0013844083,0.0017302891,0.001406999,0.0027021917,0.00034603543,0.0013783062,0.8299032,0.15740685,0.0016577854],"study_design_scores_gemma":[0.0057872594,0.005421116,0.00055168377,0.0028612236,0.0032198909,0.003153915,0.0017215076,0.021611398,0.92583936,0.02208249,0.005559462,0.0021906663],"about_ca_topic_score_codex":0.00020169652,"about_ca_topic_score_gemma":0.00024258964,"teacher_disagreement_score":0.92446107,"about_ca_system_score_codex":0.000023086473,"about_ca_system_score_gemma":0.0008524816,"threshold_uncertainty_score":0.99991685},"labels":[],"label_agreement":null},{"id":"W2146949677","doi":"10.1006/eujc.2000.0409","title":"Transitive Factorizations in the Symmetric Group, and Combinatorial Aspects of Singularity Theory","year":2000,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"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; Monodromy; Symmetric group; Combinatorics; Conjecture; Alternating group; Group (periodic table); Permutation group; Permutation (music); Combinatorial proof; Generating function; Series (stratigraphy); Holomorphic function; Partition (number theory); Pure mathematics","score_opus":0.010295371457462905,"score_gpt":0.20785636947065797,"score_spread":0.19756099801319507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146949677","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7585555,0.0011530614,0.18620889,0.0002827835,0.0012893985,0.00017212126,0.0000036770045,0.00003051133,0.05230408],"genre_scores_gemma":[0.9994565,0.00012446148,0.00029072765,0.0000623089,0.000053796535,2.3718044e-7,4.0905678e-7,0.000007759751,0.000003765709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997195,0.0017610363,0.0004159793,0.00012653174,0.00035094385,0.00015047609],"domain_scores_gemma":[0.998797,0.0005584068,0.0002188831,0.00024061919,0.00011875401,0.000066358385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027337777,0.000116586576,0.00020914203,0.00030665094,0.00011317645,0.00009029175,0.0008563519,0.000021577262,0.0000070608094],"category_scores_gemma":[0.00012352518,0.00008723527,0.000103391496,0.0016032623,0.00010417829,0.00032612577,0.00004122835,0.00035078355,0.0000013939082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036890404,0.0002804746,0.00077010645,0.0000075613757,0.000019379531,0.00010077487,0.0023322443,0.0000073345905,0.000026943071,0.9839909,0.000017982744,0.012409421],"study_design_scores_gemma":[0.0015155277,0.0009663846,0.08197567,0.000050045954,0.00003023666,0.00010398989,0.00012246678,0.00006890892,0.00007293889,0.913194,0.0017601433,0.00013966163],"about_ca_topic_score_codex":7.88935e-7,"about_ca_topic_score_gemma":3.5714348e-7,"teacher_disagreement_score":0.24090107,"about_ca_system_score_codex":0.000017521696,"about_ca_system_score_gemma":0.0000321638,"threshold_uncertainty_score":0.3557351},"labels":[],"label_agreement":null},{"id":"W2146959334","doi":"10.1016/j.ejc.2007.11.012","title":"A dichotomy for minimum cost graph homomorphisms","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"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","keywords":"Homomorphism; Mathematics; Combinatorics; Graph; Graph homomorphism; Discrete mathematics; Vertex (graph theory); Algebra homomorphism; Line graph; Graph power","score_opus":0.0400559946199954,"score_gpt":0.2741690628301987,"score_spread":0.2341130682102033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146959334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051573273,0.0006313951,0.9411591,0.0004057447,0.0012607842,0.00029501284,0.0000034263503,0.000055847773,0.004615411],"genre_scores_gemma":[0.9825633,0.000221002,0.016380731,0.00015572445,0.00012445917,0.000004245762,7.153016e-7,0.00003815806,0.00051162485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777734,0.0004512768,0.000544432,0.00021696692,0.00060655153,0.00040343203],"domain_scores_gemma":[0.9976324,0.00036872274,0.00043058995,0.0005036708,0.0007488464,0.00031580622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017927681,0.0001709223,0.00029009223,0.0003933939,0.0002877434,0.00007622349,0.0019879304,0.000023061139,0.00000534822],"category_scores_gemma":[0.00031348725,0.00015062361,0.00024769083,0.000844497,0.00017607273,0.00059461215,0.00021031169,0.00039015777,0.000031128115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002617585,0.0008058971,0.0017214837,0.00004791731,0.00015254131,0.0049603,0.0013796643,0.0001989001,0.0016680742,0.9480988,0.024910731,0.015793974],"study_design_scores_gemma":[0.012947369,0.0056165615,0.008935044,0.00018489943,0.00004627077,0.005951307,0.00011431644,0.0019292473,0.005686984,0.6558422,0.30164206,0.0011037687],"about_ca_topic_score_codex":1.0794097e-7,"about_ca_topic_score_gemma":3.1146573e-8,"teacher_disagreement_score":0.93099004,"about_ca_system_score_codex":0.000054635926,"about_ca_system_score_gemma":0.00012412055,"threshold_uncertainty_score":0.61422527},"labels":[],"label_agreement":null},{"id":"W2151986794","doi":"10.1016/j.ejc.2009.07.007","title":"A lower bound for the spectral radius of graphs with fixed diameter","year":2009,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"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 Toronto; Connaught Fund; Pohang University of Science and Technology; University of Delaware","keywords":"Mathematics; Spectral radius; Combinatorics; Upper and lower bounds; Graph; RADIUS; Order (exchange); Discrete mathematics; Mathematical analysis; Eigenvalues and eigenvectors; Physics","score_opus":0.02701508009018262,"score_gpt":0.264474852411065,"score_spread":0.2374597723208824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151986794","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9576033,0.00030617486,0.035961337,0.0008164503,0.00029427264,0.000297763,0.000005743,0.000016839147,0.0046981224],"genre_scores_gemma":[0.9961345,0.00002875216,0.0034862466,0.00008171201,0.000055982327,0.0000010894155,2.8835163e-7,0.000020371623,0.00019105621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990813,0.00013305311,0.0003840049,0.00007043189,0.00019188631,0.00013932404],"domain_scores_gemma":[0.998476,0.00052211544,0.0004649566,0.00026431042,0.00021073093,0.00006187615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009062562,0.00010701929,0.00020413418,0.00007492931,0.00010856421,0.00003093124,0.00036079463,0.000013460452,0.000010949789],"category_scores_gemma":[0.00013580028,0.00006255206,0.00018687395,0.00024599626,0.00008709912,0.00007080885,0.000010212717,0.00018448236,0.0000016149348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018250613,0.0003934016,0.0001316989,0.000015434782,0.00009350094,0.000020346106,0.00035050692,0.0000074557042,0.00061555963,0.9928461,0.004483544,0.00085997616],"study_design_scores_gemma":[0.0014724762,0.0017022548,0.0039253524,0.00005828823,0.00018085392,0.000095477735,0.00010124428,0.000011549462,0.0015042506,0.9844508,0.0063857785,0.00011165331],"about_ca_topic_score_codex":7.8832024e-8,"about_ca_topic_score_gemma":1.4718012e-7,"teacher_disagreement_score":0.038531203,"about_ca_system_score_codex":0.000011349782,"about_ca_system_score_gemma":0.000024428886,"threshold_uncertainty_score":0.25507993},"labels":[],"label_agreement":null},{"id":"W2153268570","doi":"10.1016/j.ejc.2005.05.001","title":"Sphere packings revisited","year":2005,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Hungarian Science Foundation","keywords":"Mathematics; Combinatorics; Isoperimetric inequality; Conjecture; Discrete geometry; Regular polygon; SPHERES; Dodecahedron; Polyhedron; Voronoi diagram; Constant curvature; Curvature; Geometry; Physics","score_opus":0.04658571231293762,"score_gpt":0.2953418779338797,"score_spread":0.2487561656209421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153268570","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68866146,0.00658764,0.034341976,0.0023543676,0.0012443133,0.00016542812,0.000007493837,0.00013735237,0.26649997],"genre_scores_gemma":[0.9914989,0.00022496223,0.0042838673,0.00020834076,0.00052274676,1.2565594e-7,5.081841e-7,0.000039569495,0.0032209975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983156,0.00022623414,0.0007332147,0.00008623961,0.0004291565,0.00020958412],"domain_scores_gemma":[0.99817467,0.00027024795,0.00069056504,0.00019661972,0.0005455894,0.00012233156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002039562,0.00013848687,0.0003039242,0.00017970544,0.00006980746,0.00007368762,0.00037188813,0.00002271736,0.00019600015],"category_scores_gemma":[0.0014100791,0.00011121355,0.0001449625,0.0005363088,0.000025229738,0.00028000269,0.00006313786,0.0003153263,0.00008266968],"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.00006720984,0.00051862333,0.0008102497,0.00036675896,0.00015114312,0.00046906894,0.0019000454,0.00001443451,0.00009414527,0.8030284,0.15755415,0.035025734],"study_design_scores_gemma":[0.002009556,0.0006640521,0.0006783438,0.00036737497,0.00010805824,0.00048013407,0.00053805497,0.00003476781,0.00080437696,0.22858065,0.7653651,0.00036951026],"about_ca_topic_score_codex":2.1348315e-7,"about_ca_topic_score_gemma":1.0076471e-7,"teacher_disagreement_score":0.607811,"about_ca_system_score_codex":0.00005897966,"about_ca_system_score_gemma":0.000042860494,"threshold_uncertainty_score":0.4535157},"labels":[],"label_agreement":null},{"id":"W2164055139","doi":"10.1006/eujc.2000.0467","title":"Fissioned Triangular Schemes via the Cross-ratio","year":2001,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Association scheme; Prime power; Cross-ratio; Combinatorics; Intersection (aeronautics); Prime (order theory); Transitive relation; Discrete mathematics; Element (criminal law); Line (geometry); Pure mathematics; Geometry","score_opus":0.07407507749573258,"score_gpt":0.35082276868916074,"score_spread":0.2767476911934281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164055139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92099434,0.0012994346,0.040969465,0.0017671398,0.0013307426,0.00029642682,0.0000027016113,0.000068425914,0.03327134],"genre_scores_gemma":[0.99435824,0.00010050333,0.0007699849,0.00009636654,0.00029758515,7.5485303e-7,7.368918e-7,0.00006480959,0.004311033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967111,0.0013101643,0.0007583939,0.00012183892,0.00079346943,0.0003050847],"domain_scores_gemma":[0.9972884,0.0008996082,0.0005327137,0.00050836365,0.0005957326,0.00017519106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005845297,0.00016898016,0.00028238868,0.00014976767,0.0002896794,0.00018310004,0.00096877356,0.00003564031,0.00028884393],"category_scores_gemma":[0.0026136641,0.00010626933,0.00020101634,0.0005052934,0.00014494223,0.00023533689,0.00015964292,0.00067575334,0.00014097658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015615906,0.001919812,0.010936743,0.00016974112,0.00057148444,0.0063419533,0.004999329,0.000046897527,0.006653244,0.897892,0.049558304,0.019348891],"study_design_scores_gemma":[0.006041902,0.0013345323,0.0034800954,0.00016638558,0.000104877654,0.0019281219,0.0004407635,0.0005213713,0.002931016,0.6955791,0.28701392,0.0004578999],"about_ca_topic_score_codex":2.733598e-7,"about_ca_topic_score_gemma":1.2517177e-7,"teacher_disagreement_score":0.2374556,"about_ca_system_score_codex":0.0000681275,"about_ca_system_score_gemma":0.00007018488,"threshold_uncertainty_score":0.43335375},"labels":[],"label_agreement":null},{"id":"W2164463888","doi":"10.1016/j.ejc.2011.09.011","title":"Cyclic colorings of plane graphs with independent faces","year":2011,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"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","keywords":"Combinatorics; Mathematics; Fractional coloring; Complete coloring; Disjoint sets; Greedy coloring; List coloring; Vertex (graph theory); Plane (geometry); Graph; Discrete mathematics; Graph power; Geometry; Line graph","score_opus":0.030710658112959862,"score_gpt":0.23383085010427274,"score_spread":0.20312019199131287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164463888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89258134,0.0003451205,0.07520809,0.000058024765,0.00035866766,0.00010710426,0.0000011943588,0.000035847912,0.031304594],"genre_scores_gemma":[0.9941813,0.00008030277,0.005581468,0.000019476662,0.000009436032,3.940294e-7,1.2779567e-7,0.000018651454,0.000108847235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803495,0.00039536142,0.00045270412,0.00015953612,0.00070361554,0.00025384873],"domain_scores_gemma":[0.9983271,0.0000988454,0.0006012879,0.00038817807,0.00039593456,0.00018869535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001433163,0.00013684249,0.00025794562,0.00035320845,0.0000665327,0.000036498106,0.0016996805,0.000018145449,0.000011443408],"category_scores_gemma":[0.00006121023,0.00010265443,0.00007912684,0.0006754163,0.00013803109,0.00051657844,0.00023861401,0.00040929363,0.000012826606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028351299,0.00044806374,0.01945968,0.000036454647,0.00012955217,0.0016330944,0.002354481,0.000051519324,0.0017738517,0.97055495,0.00013308485,0.0031417652],"study_design_scores_gemma":[0.0098537225,0.020756796,0.2557983,0.0005696221,0.000094107156,0.0027299467,0.0010344419,0.00010459529,0.09832388,0.5995052,0.01000687,0.0012225235],"about_ca_topic_score_codex":0.0000014030097,"about_ca_topic_score_gemma":3.6308953e-7,"teacher_disagreement_score":0.37104976,"about_ca_system_score_codex":0.000026065854,"about_ca_system_score_gemma":0.000064361855,"threshold_uncertainty_score":0.4186126},"labels":[],"label_agreement":null},{"id":"W2177899233","doi":"10.1016/j.ejc.2006.05.002","title":"Pairwise intersections and forbidden configurations","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Pairwise comparison; Mathematics; Combinatorics; Discrete mathematics; Statistics","score_opus":0.019082775710059684,"score_gpt":0.2491467423438832,"score_spread":0.23006396663382353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177899233","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8973769,0.000290758,0.012213437,0.00023316647,0.0012412681,0.00007406076,0.0000036084598,0.000033440647,0.08853335],"genre_scores_gemma":[0.9982348,0.000023116281,0.0009276913,0.000032822507,0.00018671254,2.1683117e-7,4.5570386e-7,0.000020584981,0.00057358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907863,0.00021440724,0.00039032867,0.000063456806,0.0001513111,0.000101894395],"domain_scores_gemma":[0.9991629,0.0001867358,0.00027987134,0.00012922245,0.00018032533,0.000060943312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006137497,0.000090866895,0.000149075,0.00011865611,0.0001923057,0.000043583976,0.00014703785,0.000017770044,0.00002875168],"category_scores_gemma":[0.00017750108,0.000071563896,0.000083728846,0.00011002054,0.000072315685,0.00011159302,0.000047308833,0.00021108714,0.0000021703686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011332269,0.000061832456,0.00072238164,0.000013911374,0.00002991029,0.000068335394,0.0004267724,0.0000026023615,0.00016780617,0.98593926,0.012058236,0.00049758854],"study_design_scores_gemma":[0.0007494211,0.00022489918,0.008982309,0.000039880968,0.000063180254,0.00036567744,0.00026113255,0.000017924503,0.00018813703,0.973827,0.015166376,0.00011403459],"about_ca_topic_score_codex":9.659107e-7,"about_ca_topic_score_gemma":8.766241e-7,"teacher_disagreement_score":0.10085791,"about_ca_system_score_codex":0.000019234596,"about_ca_system_score_gemma":0.000013755943,"threshold_uncertainty_score":0.2918291},"labels":[],"label_agreement":null},{"id":"W2179924680","doi":"10.1016/j.ejc.2011.12.010","title":"Computability of width of submodular partition functions","year":2012,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Grantová Agentura České Republiky","keywords":"Submodular set function; Mathematics; Partition (number theory); Combinatorics; Discrete mathematics; Graph; Exponential function","score_opus":0.026041076771552606,"score_gpt":0.2625905182321438,"score_spread":0.2365494414605912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179924680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39013332,0.000466846,0.60670364,0.000075922115,0.000754041,0.000053890137,0.0000017449563,0.000012863605,0.0017977474],"genre_scores_gemma":[0.9945682,0.00002515863,0.005298584,0.00000990176,0.00005657413,2.1225829e-7,4.2952072e-7,0.0000106761045,0.000030212816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9976817,0.0008629154,0.0006085202,0.00009506527,0.00052289537,0.0002289221],"domain_scores_gemma":[0.99791133,0.00019048172,0.0005955705,0.00043093157,0.00069412927,0.00017754159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033464162,0.0000913896,0.00024469086,0.00019691864,0.000057077537,0.000014628194,0.00072879094,0.000016238402,0.000011456067],"category_scores_gemma":[0.00025641185,0.00008097467,0.00014306685,0.0006670316,0.00013835604,0.00068343343,0.00018982794,0.00025557834,0.000011125129],"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.00012797724,0.0024106293,0.09282848,0.00016300842,0.00013980278,0.00004601426,0.0016936983,0.0018473176,0.008744967,0.8651771,0.001064845,0.025756186],"study_design_scores_gemma":[0.0047714915,0.004875806,0.52253443,0.00031263902,0.00010515975,0.0004201527,0.0003182507,0.0032308854,0.047035303,0.39720756,0.018470215,0.0007180874],"about_ca_topic_score_codex":3.7596942e-7,"about_ca_topic_score_gemma":3.8679154e-8,"teacher_disagreement_score":0.6044349,"about_ca_system_score_codex":0.000040613217,"about_ca_system_score_gemma":0.000048828173,"threshold_uncertainty_score":0.3302051},"labels":[],"label_agreement":null},{"id":"W2201174638","doi":"10.1016/j.ejc.2016.05.011","title":"Tableau sequences, open diagrams, and Baxter families","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche; Pacific Institute for the Mathematical Sciences","keywords":"Bijection; Mathematics; Combinatorics; Bounded function; Combinatorial proof; Diagram; Algebraic number; Young tableau; Bijection, injection and surjection; Arc (geometry); Discrete mathematics; Geometry","score_opus":0.052205046540423676,"score_gpt":0.30754418429351676,"score_spread":0.2553391377530931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2201174638","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.772292,0.0019245766,0.13102165,0.0030808884,0.006832214,0.0010862617,0.000021410206,0.00020648232,0.08353449],"genre_scores_gemma":[0.98325473,0.00070641655,0.014327857,0.00007248174,0.00019763103,0.0000020138623,2.1984759e-7,0.0000887026,0.0013499437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976254,0.00048713197,0.0008970917,0.00019990644,0.0004745484,0.0003159135],"domain_scores_gemma":[0.9969829,0.0010090524,0.00090741017,0.00043751157,0.00042398946,0.00023914596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021612775,0.00025796023,0.00054744596,0.0001370748,0.0001247781,0.00016570439,0.0010885319,0.00004152944,0.000037669888],"category_scores_gemma":[0.002037101,0.0001624048,0.000090427704,0.0002747967,0.00015294435,0.00073250424,0.0005338142,0.00025765738,0.000032331565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056478846,0.0002666726,0.000963214,0.00009343563,0.0000883671,0.00035797385,0.0005401926,6.638517e-7,0.0012117127,0.9747764,0.0073774,0.014267484],"study_design_scores_gemma":[0.002504847,0.0005683678,0.000341327,0.00044807539,0.00006384943,0.00027814304,0.00018082676,0.0000033343936,0.0010461211,0.96207327,0.032208122,0.00028371013],"about_ca_topic_score_codex":8.072355e-7,"about_ca_topic_score_gemma":5.7445936e-7,"teacher_disagreement_score":0.2109627,"about_ca_system_score_codex":0.00011124063,"about_ca_system_score_gemma":0.00008105397,"threshold_uncertainty_score":0.66226757},"labels":[],"label_agreement":null},{"id":"W2219887110","doi":"10.1016/j.ejc.2016.02.005","title":"An Erdős–Ko–Rado theorem for finite 2-transitive groups","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Mathematics; Combinatorics; Transitive relation; Cardinality (data modeling); Finite set; Discrete mathematics; Set (abstract data type)","score_opus":0.026531212264782104,"score_gpt":0.27791283433286507,"score_spread":0.25138162206808295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219887110","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5734902,0.000258379,0.40901616,0.0005216453,0.0029207438,0.0003004401,0.000048866958,0.00007644917,0.013367128],"genre_scores_gemma":[0.99592954,0.000071140676,0.003122332,0.00013491254,0.00042239163,8.498538e-7,7.5701365e-7,0.00008000491,0.000238059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978985,0.00068954495,0.00063006394,0.00016357357,0.00033218123,0.0002861338],"domain_scores_gemma":[0.99700207,0.0014013395,0.00054339576,0.00037620886,0.00047585834,0.0002011568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024597493,0.00021439003,0.00035415133,0.00015230115,0.00021681021,0.00004464397,0.00056703424,0.000045296056,0.00004355436],"category_scores_gemma":[0.00079993444,0.00012615933,0.00027692298,0.00013583757,0.00013797109,0.00028857487,0.000049465627,0.00022662882,0.000005606129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023521628,0.00014846715,0.00018047578,0.000032283133,0.00009584158,0.00010615521,0.0016547622,0.0000021477817,0.0008413489,0.9886978,0.0013746369,0.0066308426],"study_design_scores_gemma":[0.0024270588,0.0012480604,0.00096703006,0.0001418236,0.00009517585,0.00009824269,0.00020916124,0.000017729672,0.0011464325,0.986043,0.0073791905,0.00022710621],"about_ca_topic_score_codex":5.9843316e-8,"about_ca_topic_score_gemma":1.0678345e-7,"teacher_disagreement_score":0.42243937,"about_ca_system_score_codex":0.000045969053,"about_ca_system_score_gemma":0.0000337161,"threshold_uncertainty_score":0.51446277},"labels":[],"label_agreement":null},{"id":"W2223734161","doi":"10.1016/j.ejc.2016.09.004","title":"Uniform linear embeddings of graphons","year":2016,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Embedding; Combinatorics; Mathematics; Vertex (graph theory); Random graph; Space (punctuation); Discrete mathematics; Random element; Graph; Random variable; Statistics; Computer science","score_opus":0.03627176269484287,"score_gpt":0.29721844590930135,"score_spread":0.26094668321445846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2223734161","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8411982,0.0014234725,0.033757925,0.00032889377,0.012450144,0.0003659088,0.00009958287,0.00008844093,0.11028741],"genre_scores_gemma":[0.9929487,0.000479545,0.005479568,0.000032591786,0.0004352183,3.8128863e-7,0.0000013582287,0.0001089659,0.0005136441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683076,0.000546886,0.0014734244,0.00019933424,0.00067818735,0.00027139997],"domain_scores_gemma":[0.99487007,0.00047677572,0.0028319154,0.0007294034,0.0009035811,0.0001882684],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002681229,0.00036311315,0.0008567095,0.00045733093,0.00011313393,0.000028530587,0.0013544552,0.0001410059,0.00005411818],"category_scores_gemma":[0.00085692905,0.00024576255,0.00069577293,0.0001955253,0.00020844284,0.0000896803,0.0009891829,0.0012078217,0.000004489279],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094847666,0.00018969734,0.00042716038,0.00050203764,0.00043888262,0.00024713785,0.0015791296,0.000016448132,0.00013620904,0.9875106,0.007797804,0.001060007],"study_design_scores_gemma":[0.000931186,0.00031533095,0.00031211047,0.0009845231,0.00020621829,0.000114279035,0.00007955695,0.000011836228,0.0009936191,0.9886004,0.0071633486,0.0002876412],"about_ca_topic_score_codex":3.0953072e-7,"about_ca_topic_score_gemma":6.369241e-8,"teacher_disagreement_score":0.1517505,"about_ca_system_score_codex":0.000064338885,"about_ca_system_score_gemma":0.0001236711,"threshold_uncertainty_score":0.99999946},"labels":[],"label_agreement":null},{"id":"W2253883587","doi":"10.1016/j.ejc.2017.06.026","title":"On the minimum number of edges in triangle-free 5-critical graphs","year":2017,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Corollary; Disjoint sets; Graph; Vertex (graph theory); Discrete mathematics; Clique number; Cograph; Chordal graph; 1-planar graph","score_opus":0.05218795407067771,"score_gpt":0.32938781679283025,"score_spread":0.2771998627221525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253883587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55603737,0.004970534,0.19604662,0.02580885,0.021994824,0.0013837154,0.00005571855,0.00012945558,0.1935729],"genre_scores_gemma":[0.99738264,0.00024682647,0.0019495471,0.00007336257,0.00009932537,0.000002039826,3.8369512e-7,0.000041231568,0.00020464548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9943685,0.0026418515,0.0010315189,0.00035885206,0.0011869544,0.00041235864],"domain_scores_gemma":[0.99277383,0.002502007,0.001132852,0.0026218228,0.00077094854,0.00019856278],"candidate_categories":["open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0070771445,0.00030368887,0.0006874885,0.00046838107,0.00015413298,0.00026992522,0.009526964,0.00008855623,0.000018413948],"category_scores_gemma":[0.0077521848,0.0002160849,0.00043781317,0.00038715434,0.00047093668,0.0002814865,0.0031320904,0.002472446,0.000030032814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100880796,0.00033571085,0.0005113235,0.00006806227,0.000049252434,0.0009369981,0.00037573595,0.000058345915,0.000023463193,0.9905697,0.0034644369,0.0035061014],"study_design_scores_gemma":[0.0012371127,0.00037152207,0.0019061975,0.0006755664,0.000014346531,0.000093192604,0.000031890657,0.00016421043,0.00033028488,0.9939702,0.0009906094,0.00021483906],"about_ca_topic_score_codex":0.0000010652869,"about_ca_topic_score_gemma":3.3740585e-7,"teacher_disagreement_score":0.44134524,"about_ca_system_score_codex":0.00008089937,"about_ca_system_score_gemma":0.0002632134,"threshold_uncertainty_score":0.9998289},"labels":[],"label_agreement":null},{"id":"W2256982406","doi":"10.1016/j.ejc.2016.09.001","title":"Colourings, homomorphisms, and partitions of transitive digraphs","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"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","keywords":"Transitive relation; Combinatorics; Mathematics; Homomorphism; Class (philosophy); Transitive reduction; Discrete mathematics; Graph; Computer science; Line graph; Voltage graph; Artificial intelligence","score_opus":0.013774946470163807,"score_gpt":0.2306429583358,"score_spread":0.2168680118656362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256982406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33153114,0.00073542446,0.6617736,0.0014055623,0.00034613733,0.00009271343,0.0000081121325,0.000027813241,0.0040794406],"genre_scores_gemma":[0.99742705,0.00034197659,0.0020871067,0.000026642841,0.00001868054,3.7117098e-7,7.0359675e-8,0.000011179799,0.00008691732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985578,0.00044667505,0.00036340256,0.00012280181,0.00032663258,0.00018270164],"domain_scores_gemma":[0.9986246,0.00028946853,0.00028811579,0.00023221296,0.0003999558,0.0001656353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011322191,0.000091670125,0.00019130736,0.00022597065,0.000076072516,0.000029267761,0.0005988217,0.000013253497,0.0000058938163],"category_scores_gemma":[0.00014036035,0.000063318745,0.000082281476,0.00039174256,0.00022377973,0.00047103426,0.00010973856,0.00015259595,0.00000550147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004641573,0.00017161491,0.001449161,0.000015096307,0.000052573967,0.0003820365,0.0005763902,0.000006106147,0.008305098,0.97461206,0.00036874408,0.014014714],"study_design_scores_gemma":[0.004649979,0.003142389,0.04509341,0.00045089945,0.000038427374,0.0006844368,0.00013613966,0.0000550854,0.027261518,0.9088186,0.009281913,0.00038721453],"about_ca_topic_score_codex":1.2642046e-7,"about_ca_topic_score_gemma":8.113594e-8,"teacher_disagreement_score":0.6658959,"about_ca_system_score_codex":0.00002008753,"about_ca_system_score_gemma":0.000043956257,"threshold_uncertainty_score":0.25820634},"labels":[],"label_agreement":null},{"id":"W2265044263","doi":"10.1016/j.ejc.2016.07.001","title":"On the existence of unparalleled even cycle systems","year":2016,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Combinatorics; Disjoint sets; Partition (number theory); Vertex (graph theory); Mathematics; Graph; Class (philosophy); Order (exchange); Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.0143087983742838,"score_gpt":0.19419913837809996,"score_spread":0.17989034000381615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2265044263","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85003984,0.005368522,0.007770349,0.000136206,0.013444072,0.0003877118,0.000028659153,0.00009826932,0.12272639],"genre_scores_gemma":[0.99919796,0.00021534051,0.000009777029,0.000009044205,0.00022563843,0.000002178515,6.61797e-7,0.000071359216,0.0002680342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972759,0.0009761029,0.00094884716,0.00012489605,0.00047033463,0.00020395083],"domain_scores_gemma":[0.9979229,0.00032818425,0.00078259147,0.0006010966,0.00026112152,0.000104102066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002350095,0.00027039295,0.0005387877,0.00016020023,0.00005049058,0.000054975564,0.0011285613,0.00007263049,0.000013444843],"category_scores_gemma":[0.00012841563,0.00016323222,0.00029195176,0.00013526891,0.00006410193,0.000054123746,0.00013818801,0.0007929257,0.000045848785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010431804,0.00014330684,0.00014435757,0.0010877104,0.00071889034,0.00035341142,0.0011013541,0.05755762,0.0010313531,0.9254933,0.011781146,0.0004832076],"study_design_scores_gemma":[0.006240599,0.0025617157,0.0044031385,0.027870761,0.0006374259,0.0008638934,0.0015159631,0.007872472,0.0039134067,0.89408934,0.047176514,0.0028547572],"about_ca_topic_score_codex":5.2118077e-7,"about_ca_topic_score_gemma":3.4208785e-8,"teacher_disagreement_score":0.14915815,"about_ca_system_score_codex":0.00007699499,"about_ca_system_score_gemma":0.0000368785,"threshold_uncertainty_score":0.6656417},"labels":[],"label_agreement":null},{"id":"W2294555104","doi":"10.1016/j.ejc.2016.02.004","title":"Spectral radius and fractional matchings in graphs","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":34,"is_retracted":false,"has_abstract":false,"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","keywords":"Combinatorics; Mathematics; Spectral radius; Vertex (graph theory); Graph; Matching (statistics); Integer (computer science); Eigenvalues and eigenvectors; Upper and lower bounds; Discrete mathematics; Mathematical analysis; Physics","score_opus":0.021374349242671245,"score_gpt":0.26041471782898346,"score_spread":0.23904036858631222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294555104","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98983735,0.0000952663,0.0033989863,0.00089380535,0.00018653636,0.00004276852,0.0000016862804,0.000012071582,0.005531506],"genre_scores_gemma":[0.9986396,0.00009919213,0.000951779,0.00003482164,0.000045225166,3.844164e-7,9.399075e-8,0.000016585425,0.00021233666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991201,0.00019743398,0.0003418845,0.000074011776,0.00015396359,0.0001126015],"domain_scores_gemma":[0.99915713,0.00034257967,0.00025025904,0.0001051613,0.000063471074,0.0000814267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010661789,0.00008055852,0.0001401801,0.00014848959,0.000051321902,0.000018669924,0.00015542726,0.000014480645,0.00003225692],"category_scores_gemma":[0.00016423003,0.00005475525,0.000060352297,0.00015658258,0.00005436055,0.00015202917,0.00002436723,0.00018268394,0.000011325462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021610289,0.00011680102,0.0034485396,0.0000068401087,0.000013585951,0.00006100911,0.00015611797,3.028902e-7,0.0009476237,0.9930551,0.0011109408,0.0010614998],"study_design_scores_gemma":[0.0009363933,0.00009162936,0.021762196,0.00006480411,0.000012341387,0.00021199627,0.000041815005,0.0000011800714,0.00024981482,0.9720635,0.004489222,0.00007510052],"about_ca_topic_score_codex":2.0865207e-7,"about_ca_topic_score_gemma":2.1329056e-7,"teacher_disagreement_score":0.020991622,"about_ca_system_score_codex":0.000023742881,"about_ca_system_score_gemma":0.000015141169,"threshold_uncertainty_score":0.22328544},"labels":[],"label_agreement":null},{"id":"W2296193615","doi":"10.1016/j.ejc.2016.12.001","title":"Cycles in graphs of fixed girth with large size","year":2017,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"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","keywords":"Mathematics; Combinatorics; Girth (graph theory); Infinity; Upper and lower bounds; Constant (computer programming); Discrete mathematics; Mathematical analysis","score_opus":0.023530214582149284,"score_gpt":0.2812424542988576,"score_spread":0.2577122397167083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296193615","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9788693,0.00015227994,0.00029704068,0.00006782974,0.00048984593,0.00006113399,0.0000041098615,0.00000751135,0.020050943],"genre_scores_gemma":[0.99802274,0.0000757118,0.0016661835,0.000022004735,0.00004516426,1.5687854e-7,1.1927015e-7,0.000033997956,0.00013395362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851257,0.0003041978,0.00054891297,0.000092816146,0.00034822032,0.00019330937],"domain_scores_gemma":[0.99768907,0.00031723917,0.0011754305,0.00051379343,0.0002210691,0.00008340081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017066941,0.0001423969,0.0003762254,0.00012947054,0.00020331745,0.00004441627,0.00078083295,0.000027600387,0.000022934617],"category_scores_gemma":[0.0010191464,0.00009743818,0.00012512803,0.00010055085,0.00013872572,0.00017347226,0.00014597122,0.00034952012,9.073534e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018047402,0.00027323476,0.07816758,0.00008710193,0.00008964946,0.00051149196,0.0013473843,0.000003334104,0.00009659102,0.9179483,0.0006712649,0.00062360236],"study_design_scores_gemma":[0.0034513304,0.0005426947,0.22480968,0.0002862639,0.000053275042,0.00009620511,0.00025101262,0.0000050203357,0.0004990998,0.7685847,0.0012448922,0.00017578462],"about_ca_topic_score_codex":7.55719e-7,"about_ca_topic_score_gemma":0.0000018258228,"teacher_disagreement_score":0.14936355,"about_ca_system_score_codex":0.000015736165,"about_ca_system_score_gemma":0.00003006942,"threshold_uncertainty_score":0.39734134},"labels":[],"label_agreement":null},{"id":"W2301667118","doi":"10.1016/j.ejc.2016.10.009","title":"Minimum size of feedback vertex sets of planar graphs of girth at least five","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Conjecture; Feedback vertex set; Girth (graph theory); Planar graph; Upper and lower bounds; Discrete mathematics; Graph","score_opus":0.015419745436154084,"score_gpt":0.24508041134648448,"score_spread":0.2296606659103304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301667118","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97178674,0.0006737382,0.021570338,0.0003642811,0.00078981626,0.00012814037,0.000025784328,0.000016200453,0.0046449513],"genre_scores_gemma":[0.99670553,0.0002151074,0.0024957182,0.000017698725,0.000013472318,1.8860281e-7,2.1230628e-7,0.00002443768,0.00052760664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99694216,0.0007327794,0.0009230857,0.00020269366,0.0008965092,0.00030279093],"domain_scores_gemma":[0.99606985,0.00091732974,0.0012566583,0.0006305264,0.00091513095,0.00021052701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015959976,0.00017644501,0.00049936946,0.00031855013,0.00005256918,0.000011701051,0.0019112639,0.00003165039,0.000024620584],"category_scores_gemma":[0.00058641424,0.00012546474,0.00024915577,0.0007380806,0.00033698432,0.00039554574,0.0003824845,0.00021741232,0.000017094697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018412386,0.0017077448,0.027649695,0.00046807644,0.0006540196,0.0010863016,0.0041009127,0.00011791765,0.16464205,0.7473739,0.011611279,0.038746856],"study_design_scores_gemma":[0.020106437,0.013415495,0.15880156,0.002558745,0.00012639376,0.00082491175,0.00049467775,0.00030426832,0.18219577,0.6133743,0.006584188,0.0012132695],"about_ca_topic_score_codex":7.368214e-7,"about_ca_topic_score_gemma":2.9817966e-7,"teacher_disagreement_score":0.13399962,"about_ca_system_score_codex":0.000056189438,"about_ca_system_score_gemma":0.00010575048,"threshold_uncertainty_score":0.51163036},"labels":[],"label_agreement":null},{"id":"W2416550492","doi":"10.1016/j.ejc.2016.05.002","title":"Lattice path constructions for orthosymplectic determinantal formulas","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Combinatorics; Mathematical proof; Lattice (music); Symplectic geometry; Path (computing); Tridiagonal matrix; Pure mathematics; Eigenvalues and eigenvectors; Geometry; Computer science; Quantum mechanics","score_opus":0.045098523856930126,"score_gpt":0.3083606583068491,"score_spread":0.26326213444991897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2416550492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42939246,0.00011142594,0.560156,0.0003076031,0.0048120758,0.0004907989,0.000020903344,0.00011003923,0.0045987023],"genre_scores_gemma":[0.9535326,0.000036389687,0.045293503,0.000023162314,0.0003296257,0.000004547245,3.2847873e-7,0.00010915304,0.00067070115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99771935,0.00025319643,0.0010626316,0.00017393024,0.000418228,0.00037268864],"domain_scores_gemma":[0.9953594,0.00205678,0.0011832498,0.00039028647,0.00080151745,0.00020875446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013614945,0.0002532194,0.00048902247,0.00017276366,0.00019236495,0.00004492816,0.0004910866,0.000047267757,0.000020806388],"category_scores_gemma":[0.0037968894,0.00017407005,0.00028780513,0.00024416173,0.00010385091,0.00038811797,0.000093786664,0.0002127953,0.000022671213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008857486,0.00030998662,0.0004650882,0.00013301485,0.00009458923,0.00013233561,0.00022314402,6.546823e-7,0.001030154,0.98901033,0.0017446383,0.006767477],"study_design_scores_gemma":[0.0037653942,0.0010539992,0.00011593702,0.00033276615,0.00017463615,0.00090673065,0.00009944176,0.000021219714,0.0018634895,0.9817189,0.00966325,0.0002842569],"about_ca_topic_score_codex":8.167782e-8,"about_ca_topic_score_gemma":3.0510796e-7,"teacher_disagreement_score":0.5241401,"about_ca_system_score_codex":0.00017672415,"about_ca_system_score_gemma":0.000098194876,"threshold_uncertainty_score":0.7098371},"labels":[],"label_agreement":null},{"id":"W2433753645","doi":"10.1016/j.ejc.2017.06.007","title":"Reconstruction of infinite matroids from their 3-connected minors","year":2017,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Tree (set theory); Graphic matroid; Planar; Face (sociological concept); Mathematics; Combinatorics; Matroid partitioning; Decomposition; Rest (music); Discrete mathematics; Computer science; Pure mathematics; Physics; Sociology","score_opus":0.029240262023690462,"score_gpt":0.23501746112417174,"score_spread":0.20577719910048128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2433753645","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7414955,0.0032131313,0.23654771,0.0007442001,0.008043112,0.00011118543,0.00013808839,0.000068057896,0.00963905],"genre_scores_gemma":[0.9908524,0.0008806023,0.007836204,0.000030422245,0.00024145374,2.9402042e-7,0.000014961878,0.000015421123,0.00012819601],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971438,0.0006885647,0.0011275954,0.00034399968,0.0004871556,0.00020890232],"domain_scores_gemma":[0.9940646,0.00026258468,0.0034372252,0.0013222261,0.00073321257,0.00018011934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014274862,0.00028025973,0.000805281,0.0006620996,0.00011719349,0.00030414932,0.0040219533,0.00011125953,0.000045950048],"category_scores_gemma":[0.0008213896,0.00020932134,0.0004880902,0.00051085814,0.00014118405,0.00037981002,0.0017959636,0.0009622853,0.00002278968],"study_design_candidate":"design_other","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.00012938741,0.00094424357,0.022564158,0.00017260104,0.0024514594,0.0010481572,0.0015750235,0.000852086,0.0005996078,0.057839364,0.0067399717,0.90508395],"study_design_scores_gemma":[0.0042519877,0.0021200527,0.2089052,0.0016972297,0.00083845976,0.0005486853,0.00027331625,0.0048704054,0.0039712787,0.73321974,0.037407458,0.0018962137],"about_ca_topic_score_codex":0.000029380175,"about_ca_topic_score_gemma":8.2687137e-7,"teacher_disagreement_score":0.90318775,"about_ca_system_score_codex":0.000053167332,"about_ca_system_score_gemma":0.00012961356,"threshold_uncertainty_score":0.8535876},"labels":[],"label_agreement":null},{"id":"W2529549915","doi":"10.1016/j.ejc.2018.04.008","title":"Random 4-regular graphs have 3-star decompositions asymptotically almost surely","year":2018,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Counterexample; Combinatorics; Conjecture; Star (game theory); Graph; Discrete mathematics; Random graph; Asymptotically optimal algorithm; Planar graph; Random regular graph; Chordal graph; 1-planar graph","score_opus":0.029508806626674208,"score_gpt":0.28489483296535684,"score_spread":0.2553860263386826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529549915","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8919234,0.0023459222,0.04030445,0.0006582424,0.014026034,0.00079272286,0.00011147218,0.00018553832,0.049652196],"genre_scores_gemma":[0.9815994,0.0003786842,0.016482012,0.00016395428,0.000812695,0.0000018905083,0.000014387998,0.000207034,0.00033997165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99378663,0.0023384735,0.0018752031,0.00041670573,0.0010834219,0.00049955776],"domain_scores_gemma":[0.9938593,0.00096988596,0.0019950178,0.001115132,0.0016276513,0.00043303837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004855225,0.00064301316,0.0012238135,0.00052070816,0.0005006876,0.00023208199,0.0017850928,0.0002537166,0.0001286709],"category_scores_gemma":[0.0011529337,0.0005271044,0.001089824,0.00023014408,0.00044761642,0.00013001495,0.0011525395,0.0022160986,0.00002037831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006686601,0.0007889237,0.0009240384,0.0004768964,0.0017509422,0.0017139124,0.0021356854,0.00010414996,0.00011175552,0.9496494,0.04120629,0.00046935058],"study_design_scores_gemma":[0.003143229,0.00058769254,0.0013896164,0.00071975874,0.00068295066,0.00044447367,0.000076440534,0.00006554791,0.00025210303,0.98557174,0.006480901,0.0005855605],"about_ca_topic_score_codex":8.0769206e-7,"about_ca_topic_score_gemma":5.534018e-7,"teacher_disagreement_score":0.08967595,"about_ca_system_score_codex":0.00012379153,"about_ca_system_score_gemma":0.0001899712,"threshold_uncertainty_score":0.99971807},"labels":[],"label_agreement":null},{"id":"W2531100822","doi":"10.1016/j.ejc.2018.12.001","title":"Geometric random graphs and Rado sets in sequence spaces","year":2019,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Dalhousie University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Ryerson University","keywords":"Mathematics; Countable set; Metric space; Combinatorics; Separable space; Discrete mathematics; Isomorphism (crystallography); Graph isomorphism; Banach space; Complete metric space; Random graph; Vertex (graph theory); Graph; Line graph","score_opus":0.04835547272737199,"score_gpt":0.3126801922916965,"score_spread":0.2643247195643245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531100822","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97513074,0.006554558,0.008803848,0.00025194287,0.0026953213,0.00029429764,0.00001029245,0.000032893822,0.0062261224],"genre_scores_gemma":[0.99461776,0.002638553,0.0022232432,0.000051812858,0.000045755198,7.68616e-7,0.000002106218,0.00005860486,0.00036139495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969303,0.0013032415,0.0008912278,0.0002576819,0.00034026234,0.00027728308],"domain_scores_gemma":[0.9967046,0.0012630133,0.0012764956,0.00040619753,0.00021917994,0.0001305501],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003756654,0.00031504495,0.00087744027,0.0009008587,0.000056930636,0.000056204884,0.000596772,0.00014323452,0.000019104995],"category_scores_gemma":[0.0016036149,0.00027305956,0.00018295222,0.00041366156,0.00016684263,0.0001387102,0.00045333084,0.0018666156,0.000013296362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015848298,0.0011384555,0.027900646,0.0024308716,0.00074817816,0.008537067,0.0052884496,0.0020994537,0.00013214277,0.9328365,0.005829475,0.011473974],"study_design_scores_gemma":[0.003795469,0.00025181743,0.0019895642,0.0005074986,0.00009106101,0.00034957295,0.00017428654,0.000050639883,0.000051721694,0.99137926,0.001046333,0.0003127574],"about_ca_topic_score_codex":8.033539e-7,"about_ca_topic_score_gemma":3.8994122e-7,"teacher_disagreement_score":0.05854282,"about_ca_system_score_codex":0.000084660904,"about_ca_system_score_gemma":0.000104377665,"threshold_uncertainty_score":0.99997216},"labels":[],"label_agreement":null},{"id":"W2544865958","doi":"10.1016/j.ejc.2019.04.001","title":"Graph homomorphisms via vector colorings","year":2019,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy; National Research Foundation Singapore","keywords":"Combinatorics; Mathematics; Bipartite graph; Homomorphism; Graph homomorphism; Graph; Discrete mathematics; Multipartite; Unit vector; Graph power; Line graph","score_opus":0.024339746574552523,"score_gpt":0.2597267797700776,"score_spread":0.23538703319552506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2544865958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036791027,0.0023830459,0.9361773,0.00067477435,0.009851294,0.00039313783,0.00000681349,0.00013971377,0.01358288],"genre_scores_gemma":[0.99032575,0.0004150042,0.008138992,0.00011087549,0.00022082624,0.000002172982,0.000002187369,0.00009406513,0.00069014914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99502033,0.0014068122,0.0010545674,0.0005526746,0.0013810154,0.00058458484],"domain_scores_gemma":[0.9949109,0.0003338523,0.0015758222,0.0015926453,0.0011731971,0.00041355757],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003700087,0.00045449362,0.0007770688,0.0008351917,0.00013861521,0.0003886264,0.006090207,0.00011358173,0.000016818247],"category_scores_gemma":[0.0002590936,0.00042505155,0.00053764536,0.0008713172,0.000159345,0.0005367177,0.0033590735,0.0028444193,0.00022906723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016746816,0.0006957295,0.0010088236,0.000370481,0.0004792261,0.005283959,0.00089497614,0.005441912,0.0010451825,0.96785194,0.0049591227,0.011801184],"study_design_scores_gemma":[0.0027617102,0.002415076,0.006019921,0.00069429853,0.00007925857,0.0008664815,0.00003224759,0.0018560486,0.001883994,0.95254207,0.029582711,0.001266176],"about_ca_topic_score_codex":8.248301e-7,"about_ca_topic_score_gemma":5.9556626e-8,"teacher_disagreement_score":0.9535347,"about_ca_system_score_codex":0.00022524869,"about_ca_system_score_gemma":0.00034372183,"threshold_uncertainty_score":0.9998201},"labels":[],"label_agreement":null},{"id":"W2586439702","doi":"10.1016/j.ejc.2018.03.003","title":"Smooth Schubert varieties in the affine flag variety of type <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml16\" display=\"inline\" overflow=\"scroll\" altimg=\"si16.gif\"><mml:mover accent=\"true\"><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mrow><mml:mo></mml:mo></mml:mrow></mml:mover></mml:math>","year":2018,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Oklahoma State University","keywords":"Mathematics; Flag (linear algebra); Affine transformation; Schubert variety; Iterated function; Type (biology); Schubert calculus; Variety (cybernetics); Conjecture; Pure mathematics; Combinatorics; Algebra over a field; Mathematical analysis; Grassmannian","score_opus":0.022003390112290574,"score_gpt":0.2537264490715417,"score_spread":0.2317230589592511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586439702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70933884,0.0011967579,0.0025352386,0.0005209686,0.0067171613,0.00008380962,0.00012766175,0.0001354283,0.2793441],"genre_scores_gemma":[0.98926824,0.001479613,0.0043663047,0.00091667165,0.0024997855,0.00008977262,0.00012745475,0.00085445505,0.00039766962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9892145,0.0010219001,0.0031188875,0.0011609179,0.0035230857,0.0019607255],"domain_scores_gemma":[0.9888269,0.0026861767,0.00447036,0.0025084487,0.000685149,0.00082297175],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0046280017,0.0010407777,0.000664339,0.0005173571,0.0010878042,0.0012066107,0.0034554845,0.0012766976,0.028708063],"category_scores_gemma":[0.0054164906,0.001516013,0.0015493999,0.0016678311,0.0015199305,0.0016324363,0.002263446,0.0026955474,0.0012363892],"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.0015992406,0.0010472115,0.000016082191,0.001368221,0.0012514238,0.0015001392,0.0045442656,0.00067468104,0.0009153541,0.90068555,0.08566266,0.0007351807],"study_design_scores_gemma":[0.01277179,0.014058363,0.0004943963,0.006795465,0.0057185073,0.0046938066,0.008268477,0.20703197,0.67467946,0.027625691,0.033100758,0.004761348],"about_ca_topic_score_codex":0.00019050411,"about_ca_topic_score_gemma":0.000095530486,"teacher_disagreement_score":0.87305987,"about_ca_system_score_codex":0.000049631544,"about_ca_system_score_gemma":0.0014669828,"threshold_uncertainty_score":0.99983025},"labels":[],"label_agreement":null},{"id":"W2730819323","doi":"10.1016/j.ejc.2017.05.005","title":"Erdős–Ko–Rado for perfect matchings","year":2017,"lang":"hu","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Algebraic number; Graph; Discrete mathematics","score_opus":0.05007146253368222,"score_gpt":0.3229423109075511,"score_spread":0.2728708483738689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730819323","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8741712,0.0037821282,0.014087786,0.0018766373,0.02509122,0.0007443873,0.00007163233,0.000059362465,0.08011565],"genre_scores_gemma":[0.9913107,0.0005196197,0.0028783125,0.00014987397,0.0014895871,7.846312e-7,0.0000011309347,0.00019247361,0.0034575083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962949,0.0007495018,0.0013811081,0.0002911213,0.0007029826,0.0005803978],"domain_scores_gemma":[0.9930757,0.0007790971,0.003591623,0.0013548719,0.0008298639,0.00036881352],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0054852064,0.000492632,0.0009252388,0.000220378,0.0022095433,0.00072662573,0.0026260726,0.00011737966,0.00010095984],"category_scores_gemma":[0.0032111506,0.00040310266,0.00089651387,0.000081904065,0.00032989195,0.0004990314,0.0005881195,0.0010662797,0.000033690867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041977383,0.00041441072,0.0013778037,0.00073164864,0.0006166265,0.0006803525,0.005480144,0.000007428394,0.00018572163,0.9469059,0.0338941,0.009286077],"study_design_scores_gemma":[0.005607665,0.0021459335,0.0057810484,0.0008869893,0.000764624,0.00057262654,0.000449611,0.00011392718,0.000515532,0.8738875,0.108560555,0.0007140343],"about_ca_topic_score_codex":0.0000011356285,"about_ca_topic_score_gemma":2.446919e-7,"teacher_disagreement_score":0.11713952,"about_ca_system_score_codex":0.00011037421,"about_ca_system_score_gemma":0.000121166006,"threshold_uncertainty_score":0.9998421},"labels":[],"label_agreement":null},{"id":"W2743005347","doi":"10.1016/j.ejc.2018.10.008","title":"Cycle reversions and dichromatic number in tournaments","year":2018,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Austrian Science Fund; Pacific Institute for the Mathematical Sciences","keywords":"Tournament; Reversing; Conjecture; Mathematics; Sequence (biology); Combinatorics; Finite set; Discrete mathematics; Mathematical analysis; Biology; Genetics; Engineering","score_opus":0.02735657926617593,"score_gpt":0.29884590660661003,"score_spread":0.27148932734043413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743005347","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9768851,0.00032715034,0.0004143808,0.00012919641,0.0025092268,0.00012644191,0.0000052445384,0.000015080956,0.019588185],"genre_scores_gemma":[0.9954432,0.00039245802,0.0035124375,0.00007962175,0.00024342969,4.3339995e-7,7.9592587e-7,0.000060698534,0.0002669035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741906,0.000812414,0.00093243533,0.00018348118,0.00043228394,0.00022031229],"domain_scores_gemma":[0.9978461,0.00028533489,0.0010732121,0.00041266636,0.00021617462,0.00016650787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021889608,0.00025960695,0.0005550213,0.00021457385,0.00012758904,0.00007591148,0.0006096181,0.00009541149,0.00009376285],"category_scores_gemma":[0.0006763897,0.00021169234,0.00016826022,0.00013898403,0.00013004223,0.000093152696,0.0010239843,0.0011222409,0.000010006937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043622113,0.0023277092,0.068693005,0.003963299,0.0017917762,0.0077105956,0.032677233,0.000090315785,0.00009077889,0.6869914,0.18938218,0.0058455016],"study_design_scores_gemma":[0.0010578162,0.00013691334,0.007315637,0.0009815928,0.000113826805,0.0002647431,0.00011429313,0.000029140921,0.000016572174,0.98799026,0.0017417817,0.00023743638],"about_ca_topic_score_codex":0.000001060186,"about_ca_topic_score_gemma":3.215357e-7,"teacher_disagreement_score":0.30099887,"about_ca_system_score_codex":0.00010265882,"about_ca_system_score_gemma":0.000054363496,"threshold_uncertainty_score":0.86325634},"labels":[],"label_agreement":null},{"id":"W2745779757","doi":"10.1016/j.ejc.2018.04.007","title":"Ramsey-nice families of graphs","year":2018,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Freie Universität Berlin; Israel Science Foundation; Tel Aviv University; German-Israeli Foundation for Scientific Research and Development","keywords":"Mathematics; Combinatorics; Nice; Discrete mathematics; Computer science","score_opus":0.027906012423889768,"score_gpt":0.2779638504698694,"score_spread":0.2500578380459796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745779757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9348226,0.0003318108,0.0015890496,0.000034392833,0.0019077822,0.000049818656,0.0000023786,0.000018670575,0.061243463],"genre_scores_gemma":[0.9972696,0.00013839618,0.0021359536,0.000047290207,0.0001966895,8.280168e-8,1.583881e-7,0.00003583495,0.00017603849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819964,0.0004346569,0.00070872204,0.00009012707,0.0003950246,0.00017182081],"domain_scores_gemma":[0.99784505,0.0002965592,0.0007776133,0.00033180887,0.00065195985,0.000096978765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016780816,0.00014352436,0.00035266904,0.00021076138,0.00012994769,0.000018250168,0.000579712,0.000030077412,0.00004817957],"category_scores_gemma":[0.00061692833,0.00010725806,0.00020825911,0.0003121169,0.0002781983,0.00011172337,0.00013176117,0.00026902594,0.000006395897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076725264,0.000120479155,0.0015591494,0.00005920617,0.000109580884,0.00006124794,0.0025320926,6.4906646e-7,0.0003384405,0.98902404,0.003883618,0.0022347728],"study_design_scores_gemma":[0.0010413466,0.0010375562,0.0040392377,0.000112039146,0.000088105095,0.0000904572,0.000603566,0.0000054206225,0.0027919058,0.9791909,0.010842722,0.00015674152],"about_ca_topic_score_codex":3.8126936e-7,"about_ca_topic_score_gemma":2.3172097e-7,"teacher_disagreement_score":0.062446922,"about_ca_system_score_codex":0.000015716154,"about_ca_system_score_gemma":0.000028348337,"threshold_uncertainty_score":0.43738568},"labels":[],"label_agreement":null},{"id":"W2745841391","doi":"10.1016/j.ejc.2018.07.002","title":"Enumerations relating braid and commutation classes","year":2018,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"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; Canada Research Chairs; DePaul University; Simons Foundation; National Science Foundation","keywords":"Mathematics; Enumeration; Braid; Permutation (music); Combinatorics; Commutation; Upper and lower bounds; Discrete mathematics","score_opus":0.046907579781147214,"score_gpt":0.3183526101716971,"score_spread":0.27144503039054985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745841391","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76238066,0.00029737037,0.19029447,0.00057997165,0.0026763543,0.0002247895,0.000002815376,0.00011128806,0.043432266],"genre_scores_gemma":[0.97225296,0.000030417517,0.027031846,0.000046625566,0.00035291494,4.8495906e-7,5.864146e-7,0.000052937132,0.00023123609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981844,0.00043005927,0.0007602431,0.00010505228,0.00034865594,0.00017158035],"domain_scores_gemma":[0.99720275,0.00086749316,0.0008668932,0.00024585228,0.0006953334,0.00012166142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001378503,0.00015545193,0.00028155485,0.00013378507,0.00025709945,0.00008552967,0.00025123148,0.000032262535,0.0000164198],"category_scores_gemma":[0.0028293442,0.00014219746,0.00006443907,0.00026322663,0.00012477656,0.00037305523,0.000098220924,0.0003493348,0.000022412856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022110076,0.000189882,0.0004924557,0.000063630396,0.000056957197,0.000058046215,0.0024148594,0.0000035255455,0.0011561324,0.99044216,0.0029987874,0.0021014593],"study_design_scores_gemma":[0.0012262999,0.0008312531,0.00051731576,0.00017922472,0.000076797725,0.00025065397,0.0003750122,0.0001747053,0.0013600141,0.98890346,0.005915612,0.00018962316],"about_ca_topic_score_codex":2.3424639e-7,"about_ca_topic_score_gemma":4.7858543e-7,"teacher_disagreement_score":0.20987229,"about_ca_system_score_codex":0.00005978897,"about_ca_system_score_gemma":0.000046278252,"threshold_uncertainty_score":0.5798644},"labels":[],"label_agreement":null},{"id":"W2790277062","doi":"10.1016/j.ejc.2018.01.013","title":"Randomly twisted hypercubes","year":2018,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"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; National Natural Science Foundation of China; State Administration of Foreign Experts Affairs; Simons Foundation","keywords":"Hypercube; Mathematics; Combinatorics; Vertex (graph theory); Hypercube graph; Dimension (graph theory); Disjoint sets; Asymptotically optimal algorithm; Discrete mathematics; Graph; Line graph; Algorithm; Graph power","score_opus":0.012849131909337471,"score_gpt":0.21500796496726934,"score_spread":0.20215883305793186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790277062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10505844,0.00046910025,0.78390354,0.00079905504,0.013029497,0.000075202806,2.6631992e-7,0.00007814933,0.096586764],"genre_scores_gemma":[0.9972488,0.000019415173,0.0008161555,0.00022356679,0.0008190061,1.3346813e-7,7.640398e-8,0.000012757318,0.00086003187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99837536,0.00053529016,0.0005098082,0.000113471586,0.00029785768,0.00016820082],"domain_scores_gemma":[0.99850255,0.000080313286,0.0003391571,0.00027995842,0.00068162923,0.0001163874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017885797,0.0001002662,0.00020829476,0.00012922935,0.00011894088,0.0001790583,0.00089628086,0.000017411785,0.000017088909],"category_scores_gemma":[0.000102356826,0.0000776301,0.0001231973,0.00034364383,0.000045824276,0.00034271722,0.000100894365,0.00019214126,0.00015183988],"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.00023959413,0.00046812472,0.0017764381,0.000035198118,0.00026010367,0.0016026997,0.00551284,0.00011635121,0.0020200587,0.71016836,0.2398796,0.037920646],"study_design_scores_gemma":[0.008288798,0.0041817958,0.004991704,0.00029298678,0.000036044683,0.0034364348,0.0001820298,0.012441979,0.0017579399,0.012241415,0.95157266,0.00057622796],"about_ca_topic_score_codex":6.478482e-7,"about_ca_topic_score_gemma":2.2381614e-7,"teacher_disagreement_score":0.8921904,"about_ca_system_score_codex":0.00003459688,"about_ca_system_score_gemma":0.000037241734,"threshold_uncertainty_score":0.31656638},"labels":[],"label_agreement":null},{"id":"W2794063315","doi":"10.1016/j.ejc.2017.12.001","title":"The monotonicity property of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml4\" display=\"inline\" overflow=\"scroll\" altimg=\"si4.gif\"><mml:mi>M</mml:mi></mml:math>-partition problems","year":2018,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Partition (number theory); Monotonic function; Scroll; Mathematics; Combinatorics; Discrete mathematics; Mathematical analysis; Theology; Philosophy","score_opus":0.02150163503203327,"score_gpt":0.25267805859292525,"score_spread":0.23117642356089196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794063315","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9697744,0.00037195242,0.024222162,0.00045750578,0.001151552,0.000088828056,0.00000799045,0.00006172343,0.0038638555],"genre_scores_gemma":[0.9967764,0.00034103592,0.002208143,0.00014193874,0.0002881792,0.0000123561695,0.000003882062,0.0000741952,0.00015386373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964337,0.00055272086,0.00088534167,0.00037476554,0.0011547359,0.0005987673],"domain_scores_gemma":[0.9968169,0.0003662469,0.0010745511,0.0009793215,0.0004895211,0.00027348578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032833098,0.0002533804,0.00022790606,0.00013862342,0.00066334876,0.00034970063,0.0019722509,0.00010074013,0.000008219853],"category_scores_gemma":[0.00059537764,0.00019757326,0.0003050173,0.000613657,0.0005456402,0.00090279704,0.000833125,0.0007643919,0.0002590737],"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.00018909447,0.00021445863,0.000036433103,0.000070960166,0.000100769554,0.00018388956,0.0006170779,0.00048983184,0.0016803923,0.9933831,0.00060427055,0.0024297042],"study_design_scores_gemma":[0.0019751482,0.004404732,0.00059525,0.00058400864,0.00009878419,0.00070341,0.00019843107,0.9066075,0.028061574,0.032091066,0.024154115,0.00052595383],"about_ca_topic_score_codex":0.000008710096,"about_ca_topic_score_gemma":0.00000668811,"teacher_disagreement_score":0.961292,"about_ca_system_score_codex":0.000032727577,"about_ca_system_score_gemma":0.00030670635,"threshold_uncertainty_score":0.80568033},"labels":[],"label_agreement":null},{"id":"W2799851485","doi":"10.1016/j.ejc.2018.03.006","title":"Constructing de Bruijn sequences with co-lexicographic order: The<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml23\" display=\"inline\" overflow=\"scroll\" altimg=\"si23.gif\"><mml:mi>k</mml:mi></mml:math>-ary Grandmama sequence","year":2018,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"De Bruijn sequence; Lexicographical order; Substring; Mathematics; String (physics); Combinatorics; Sequence (biology); Order (exchange); De Bruijn graph; Aperiodic graph; Discrete mathematics; Data structure; Computer science","score_opus":0.017720056711356687,"score_gpt":0.23768122403048136,"score_spread":0.21996116731912468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799851485","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9687083,0.00043047074,0.024576366,0.00040070518,0.0011730208,0.000043448938,0.000011135775,0.000114716866,0.0045418795],"genre_scores_gemma":[0.9932058,0.00023895425,0.005440984,0.00061124377,0.00041233358,0.0000056762633,0.0000049873674,0.00006576368,0.000014261924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681294,0.00059059524,0.0007020762,0.00042441912,0.0008526561,0.00061733066],"domain_scores_gemma":[0.9970446,0.0005136065,0.0010533666,0.000756565,0.000299179,0.00033263804],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002831026,0.00033072292,0.00025048666,0.00022354005,0.00094204413,0.0006487036,0.001902158,0.00011961423,0.000013901328],"category_scores_gemma":[0.00028014544,0.00029186756,0.00032639108,0.0010990979,0.0010410708,0.0008139868,0.0003223103,0.0008644321,0.00008680096],"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.00017185109,0.0000885182,0.0004962789,0.000052478845,0.00017560404,0.00085082446,0.0012111194,0.00009348263,0.00048190166,0.99299914,0.00024278158,0.0031360087],"study_design_scores_gemma":[0.009030211,0.015393582,0.002644576,0.0038189578,0.0011347013,0.029720757,0.00501437,0.76796365,0.022533763,0.11176326,0.027662048,0.0033200984],"about_ca_topic_score_codex":0.000016099582,"about_ca_topic_score_gemma":0.000010290585,"teacher_disagreement_score":0.8812359,"about_ca_system_score_codex":0.000020546946,"about_ca_system_score_gemma":0.0004729284,"threshold_uncertainty_score":0.9999533},"labels":[],"label_agreement":null},{"id":"W2808719341","doi":"10.1016/j.ejc.2018.05.009","title":"Factorial<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml1\" display=\"inline\" overflow=\"scroll\" altimg=\"si1.gif\"><mml:mi>Q</mml:mi></mml:math>-functions and Tokuyama identities for classical Lie groups","year":2018,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Nankai University; Natural Sciences and Engineering Research Council of Canada; Wilfrid Laurier University","keywords":"Factorial; Mathematics; Algebraic number; Lattice (music); Path (computing); Combinatorics; Factorial experiment; Pure mathematics; Mathematical analysis; Statistics; Computer science","score_opus":0.028941241661476026,"score_gpt":0.26855494517009526,"score_spread":0.23961370350861924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808719341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9621305,0.00023597137,0.025448335,0.00019003796,0.008005878,0.00012251559,0.000055151315,0.0001237677,0.0036878516],"genre_scores_gemma":[0.9903578,0.00018485662,0.0055773417,0.00011598088,0.0029585767,0.000025568539,0.00001975764,0.0002658369,0.00049428025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99634546,0.0002382687,0.001338458,0.00041725123,0.0010216247,0.00063895894],"domain_scores_gemma":[0.9954647,0.0014077493,0.0015071698,0.0007543335,0.00047205112,0.00039401266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015361673,0.00045651253,0.0004995992,0.00019108709,0.0006724084,0.00044609248,0.0007591796,0.00025822606,0.000028787259],"category_scores_gemma":[0.0027531912,0.000488751,0.00048630868,0.00031228727,0.00040687577,0.0007722705,0.0005001407,0.0007754832,0.00022903635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027778698,0.00040729725,0.000010010997,0.0003370851,0.00029352563,0.00019991679,0.00094474363,0.00001539292,0.0003830871,0.9902709,0.006511479,0.00034874532],"study_design_scores_gemma":[0.007535084,0.006599334,0.00011192484,0.0013782729,0.0014969729,0.0014199391,0.0019223968,0.09691715,0.0042918213,0.83259195,0.044328634,0.0014065291],"about_ca_topic_score_codex":0.0000027295125,"about_ca_topic_score_gemma":0.000004580051,"teacher_disagreement_score":0.15767899,"about_ca_system_score_codex":0.00006324147,"about_ca_system_score_gemma":0.00023365498,"threshold_uncertainty_score":0.9997564},"labels":[],"label_agreement":null},{"id":"W2885565269","doi":"10.1016/j.ejc.2025.104223","title":"Splitter theorems for graph immersions","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Corollary; Mathematics; Splitter; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Geometry; Telecommunications","score_opus":0.01636324418123912,"score_gpt":0.2859100178305071,"score_spread":0.269546773649268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885565269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007876074,0.0005189445,0.9729821,0.0018748819,0.0014780927,0.00012336839,0.0000011764906,0.000026413867,0.015118918],"genre_scores_gemma":[0.98690575,0.0000754854,0.011240412,0.00042110594,0.00005727304,0.0000013722885,3.5596142e-7,0.000016898919,0.0012813322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845505,0.00041668155,0.00040009737,0.00016489653,0.00028756604,0.00027574063],"domain_scores_gemma":[0.9981598,0.00054566417,0.00021665262,0.00044343673,0.00051194016,0.00012245233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022792367,0.000116408155,0.00018987512,0.00044109236,0.00018120899,0.00010877609,0.0017234173,0.000017645718,0.000004569654],"category_scores_gemma":[0.0002794866,0.000095643256,0.00021528316,0.00087675074,0.00008636682,0.00034993843,0.00026901145,0.00031209193,0.000013287496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003413795,0.00008312859,0.00025627343,0.000013349288,0.000040401243,0.000058279576,0.00011419311,0.000022249063,0.00052561634,0.98085046,0.006271805,0.011730108],"study_design_scores_gemma":[0.0014927494,0.0004447603,0.0013009154,0.00007849354,0.00001559294,0.000039500283,0.00006512096,0.0003160597,0.0016538865,0.9244922,0.0699576,0.00014315563],"about_ca_topic_score_codex":7.5764554e-8,"about_ca_topic_score_gemma":2.0782462e-8,"teacher_disagreement_score":0.9790297,"about_ca_system_score_codex":0.000040625873,"about_ca_system_score_gemma":0.0000833467,"threshold_uncertainty_score":0.39002186},"labels":[],"label_agreement":null},{"id":"W2897536931","doi":"10.1016/j.ejc.2020.103181","title":"On the roots of the subtree polynomial","year":2020,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Root (linguistics); Polynomial; Closure (psychology); Mathematics; Tree (set theory); Boundary (topology); Interval (graph theory); Discrete mathematics; Mathematical analysis","score_opus":0.06453758780731812,"score_gpt":0.2762962373155245,"score_spread":0.2117586495082064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897536931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9488395,0.00017967586,0.0011765586,0.009303169,0.002194133,0.00041139123,0.000030600917,0.000025396526,0.03783961],"genre_scores_gemma":[0.9991858,0.000026915524,0.00012469462,0.00018277449,0.00021166174,0.0000014843107,5.705381e-7,0.000047397993,0.00021871706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973998,0.0011282715,0.0007482939,0.00013382506,0.00046116236,0.00012866857],"domain_scores_gemma":[0.9963155,0.00091199693,0.0016653716,0.0007869969,0.00023851174,0.0000816392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017578447,0.00020574701,0.00036078994,0.0000614464,0.00014117034,0.00004384523,0.0018152492,0.0000512664,0.000031263982],"category_scores_gemma":[0.0011146192,0.00011167524,0.00048716506,0.00023414004,0.00012928611,0.000021697655,0.0005827634,0.0014757455,0.000017594815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040618874,0.00018628428,0.00006299068,0.000058012793,0.00010418594,0.000015040729,0.00035817054,0.000036117654,0.00024029992,0.9590471,0.0397066,0.00014461999],"study_design_scores_gemma":[0.0003674714,0.00014062795,0.0020286888,0.00026918406,0.00014723379,0.00001819358,0.00007614039,0.00001397455,0.0011563007,0.9894314,0.006230711,0.00012011545],"about_ca_topic_score_codex":3.477689e-7,"about_ca_topic_score_gemma":1.9271513e-7,"teacher_disagreement_score":0.05034632,"about_ca_system_score_codex":0.000034944278,"about_ca_system_score_gemma":0.00011213568,"threshold_uncertainty_score":0.6411462},"labels":[],"label_agreement":null},{"id":"W2911473588","doi":"10.1016/j.ejc.2015.09.003","title":"Unary functions","year":2015,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Unary operation; Combinatorics; Class (philosophy); Bijection, injection and surjection; Finite set; Discrete mathematics; Generalization; Function (biology); Interpretation (philosophy); Bijection; Mathematical analysis","score_opus":0.09298738096446398,"score_gpt":0.3156862775005377,"score_spread":0.22269889653607372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911473588","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4001122,0.001441864,0.21264163,0.0011302324,0.007242149,0.000108239896,0.0000035045807,0.00011789953,0.3772023],"genre_scores_gemma":[0.99332255,0.000016724201,0.0023736304,0.00009116703,0.0002161885,1.4001812e-7,4.8440455e-7,0.000027159067,0.003951978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877995,0.0004819578,0.00035875896,0.00005992393,0.00019243873,0.00012696612],"domain_scores_gemma":[0.99883354,0.00020785397,0.00030686468,0.00017305645,0.0003062353,0.0001724814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016044778,0.000087716886,0.00017680661,0.00009020864,0.00006477037,0.000009766871,0.00022598247,0.000021695148,0.0000347186],"category_scores_gemma":[0.000907665,0.00007232176,0.00008006223,0.00014115736,0.00006911734,0.00014319007,0.000049227958,0.00033002615,0.00011489765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011592387,0.00030162532,0.00057126605,0.000011420791,0.000067002424,0.0008104576,0.00078305235,0.000046278084,0.00003583333,0.9103538,0.08535241,0.0015509467],"study_design_scores_gemma":[0.0011191975,0.00052210514,0.000207291,0.000020894411,0.000042840536,0.00052459625,0.0006070624,0.0000061841365,0.00005739638,0.9116468,0.08514902,0.00009660045],"about_ca_topic_score_codex":4.5866592e-8,"about_ca_topic_score_gemma":5.0696684e-8,"teacher_disagreement_score":0.59321034,"about_ca_system_score_codex":0.000045331868,"about_ca_system_score_gemma":0.000060495368,"threshold_uncertainty_score":0.29491958},"labels":[],"label_agreement":null},{"id":"W2913518517","doi":"10.1016/j.ejc.2008.04.006","title":"Palindromic richness","year":2008,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":151,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Palindrome; Conjecture; Mathematics; Class (philosophy); Word (group theory); Combinatorics; Property (philosophy); Sequence (biology); Pure mathematics; Computer science; Artificial intelligence","score_opus":0.01561513954250889,"score_gpt":0.19376765825863365,"score_spread":0.17815251871612475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913518517","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68397164,0.0008405576,0.2981847,0.00040117645,0.00255275,0.000037424677,4.2042853e-7,0.00008985566,0.013921483],"genre_scores_gemma":[0.9963782,0.0001268497,0.002951283,0.0001763769,0.00011719542,9.1346884e-8,1.4632398e-7,0.000015014329,0.00023488517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99864495,0.00032041848,0.00040293596,0.00011428848,0.0003405096,0.00017690008],"domain_scores_gemma":[0.99891573,0.000080346836,0.0003518108,0.00034471427,0.0001746799,0.0001327128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010539901,0.00010721537,0.00018696445,0.00013338511,0.00012435252,0.000056036875,0.0013860184,0.000014815638,0.000008838007],"category_scores_gemma":[0.000068168796,0.00008864268,0.00010994553,0.00035578042,0.000045414596,0.0004092082,0.00017504566,0.00023866254,0.00010188548],"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.00004003777,0.0009134642,0.008542565,0.00003609323,0.00013977173,0.020757135,0.0041502398,0.00022181257,0.0021269051,0.89063203,0.0394342,0.033005755],"study_design_scores_gemma":[0.015439595,0.0052404655,0.3077445,0.0005541828,0.000114113616,0.0556534,0.00036855662,0.011579111,0.013722976,0.25785917,0.3288181,0.0029058333],"about_ca_topic_score_codex":1.8261912e-7,"about_ca_topic_score_gemma":6.861487e-9,"teacher_disagreement_score":0.63277286,"about_ca_system_score_codex":0.00003128217,"about_ca_system_score_gemma":0.000063693515,"threshold_uncertainty_score":0.36147434},"labels":[],"label_agreement":null},{"id":"W2914340152","doi":"10.1006/eujc.1999.0384","title":"n-Semimetrics","year":2000,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Extension (predicate logic); Combinatorics; Simplex; Triangle inequality; Inequality; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.0450805289558108,"score_gpt":0.29191038196717983,"score_spread":0.24682985301136903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914340152","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4856068,0.00041639886,0.021831358,0.00060094637,0.0004145344,0.00016474507,0.0000040324953,0.00007034251,0.49089083],"genre_scores_gemma":[0.9809539,0.00019070659,0.0132184215,0.00006440265,0.00015411052,4.6528064e-7,3.9043607e-7,0.00004269434,0.0053749457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987544,0.00013363456,0.00057943945,0.00006894407,0.00032762822,0.0001359827],"domain_scores_gemma":[0.9988153,0.00025738278,0.0003453283,0.00026290177,0.00019789212,0.00012121482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012673528,0.000101181635,0.00020772687,0.00011340313,0.000072242416,0.000042908912,0.00039204344,0.000016687241,0.00052078854],"category_scores_gemma":[0.0002811061,0.00008318706,0.00011907858,0.00041835062,0.000024453935,0.00007217403,0.000023730212,0.00022208266,0.00018526855],"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.000022130256,0.0012871439,0.00024239042,0.000109384,0.000109387234,0.00025236982,0.00096626586,0.000018545152,0.00020127483,0.54379445,0.4075158,0.045480903],"study_design_scores_gemma":[0.0010714675,0.00029312616,0.00036146666,0.00008586082,0.00008705895,0.00028988175,0.00007445138,0.0001095018,0.0003635574,0.38623667,0.61079323,0.000233751],"about_ca_topic_score_codex":9.9114864e-8,"about_ca_topic_score_gemma":2.0243338e-8,"teacher_disagreement_score":0.49534705,"about_ca_system_score_codex":0.000026268444,"about_ca_system_score_gemma":0.000023795687,"threshold_uncertainty_score":0.5702269},"labels":[],"label_agreement":null},{"id":"W2936116483","doi":"10.1016/j.ejc.2020.103085","title":"Flagged (P,ρ)-partitions","year":2020,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Context (archaeology); Combinatorics; Disjoint sets; Polynomial; Discrete mathematics; Function (biology)","score_opus":0.06688798463006154,"score_gpt":0.27940827894925085,"score_spread":0.2125202943191893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2936116483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2656151,0.010810886,0.48633873,0.02868206,0.035014316,0.0022108883,0.00014545441,0.0007637797,0.17041875],"genre_scores_gemma":[0.98677635,0.00048119656,0.009537527,0.0005546492,0.0018677749,0.0000011719826,0.0000024234607,0.0002856293,0.00049330445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99356425,0.0014884435,0.002722806,0.0003459092,0.0012371499,0.00064145756],"domain_scores_gemma":[0.992911,0.00090546225,0.0030782837,0.00067325396,0.0013704884,0.0010615465],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020731285,0.000608524,0.0012649691,0.00020267048,0.00027073783,0.0002188297,0.0015423691,0.00011512646,0.00025718167],"category_scores_gemma":[0.0060890066,0.00059954444,0.00064760563,0.0010819491,0.00018580536,0.00053219346,0.0004200358,0.0016703903,0.0009883782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002583243,0.0018385722,0.00011219017,0.0011809175,0.0006411455,0.0031850357,0.008820174,0.00024439915,0.0013347993,0.8914804,0.08946814,0.0014359173],"study_design_scores_gemma":[0.008024671,0.0048260144,0.000099181714,0.0012225155,0.0012053547,0.00048380587,0.0016814071,0.00064017694,0.0022882798,0.83355975,0.14474365,0.0012251973],"about_ca_topic_score_codex":1.936027e-7,"about_ca_topic_score_gemma":7.978376e-8,"teacher_disagreement_score":0.7211612,"about_ca_system_score_codex":0.00022163166,"about_ca_system_score_gemma":0.0002988634,"threshold_uncertainty_score":0.9997895},"labels":[],"label_agreement":null},{"id":"W2952726132","doi":"10.1016/j.ejc.2018.02.027","title":"Maximum colored trees in edge-colored graphs","year":2019,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College Saint-Jean","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Ministère de l'Éducation Nationale","keywords":"Colored; Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Computer science; Materials science; Artificial intelligence","score_opus":0.01409644265845204,"score_gpt":0.24717553546455168,"score_spread":0.23307909280609965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952726132","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95511997,0.0006125857,0.023770424,0.00050862867,0.0020151422,0.00024299695,9.566796e-7,0.000055146476,0.017674124],"genre_scores_gemma":[0.9969392,0.00009115837,0.0024155893,0.000089822024,0.000030736443,8.113202e-7,3.6302248e-7,0.000029066643,0.00040328712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970271,0.0009667119,0.0006419339,0.00025942342,0.0006691454,0.00043571135],"domain_scores_gemma":[0.9981867,0.0002676372,0.00040597748,0.00057414843,0.0003523429,0.00021319982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025969648,0.00018294707,0.00035704474,0.00069708476,0.00006252338,0.00013038807,0.0022936382,0.000033052755,0.000021565509],"category_scores_gemma":[0.00019770463,0.00016227913,0.0001614108,0.0015240563,0.00008393706,0.0007560327,0.0003801113,0.00065682747,0.00016902447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036702064,0.00077173044,0.039173145,0.00003717566,0.00008515473,0.0029058522,0.0016960388,0.0011712484,0.0065092216,0.9253271,0.0021545498,0.019801725],"study_design_scores_gemma":[0.008906089,0.004168324,0.15121561,0.00022187705,0.000013969418,0.00042291183,0.0002811745,0.0022072792,0.0027437762,0.8059308,0.023165548,0.000722669],"about_ca_topic_score_codex":5.8195303e-7,"about_ca_topic_score_gemma":8.0105735e-7,"teacher_disagreement_score":0.119396366,"about_ca_system_score_codex":0.00010294791,"about_ca_system_score_gemma":0.00010985651,"threshold_uncertainty_score":0.66175514},"labels":[],"label_agreement":null},{"id":"W2962756164","doi":"10.1016/j.ejc.2020.103210","title":"Distance-two colourings of Barnette graphs","year":2020,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"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","keywords":"Combinatorics; Mathematics; Bipartite graph; Planar graph; 1-planar graph; Discrete mathematics; Cograph; Chordal graph; Graph","score_opus":0.022800464512898265,"score_gpt":0.256425006666158,"score_spread":0.2336245421532597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962756164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17423797,0.0011139116,0.80899495,0.0026425042,0.00075590797,0.00012976513,0.0000021265391,0.000065346256,0.012057534],"genre_scores_gemma":[0.99442255,0.00007696878,0.005132008,0.00023486381,0.00005355825,2.1008722e-7,1.503785e-7,0.000021469572,0.00005821393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775857,0.00056175666,0.0005835461,0.00018073517,0.0006599266,0.0002554593],"domain_scores_gemma":[0.9981547,0.00015942234,0.000570922,0.00033075767,0.00046562462,0.00031856145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012612676,0.00013416538,0.00029476944,0.00015809033,0.00006949536,0.0000611509,0.0020100847,0.000012643565,0.000008689074],"category_scores_gemma":[0.00029797285,0.00011992631,0.00016644406,0.0010652079,0.00012253155,0.00046884784,0.00034666766,0.00046474385,0.000020182206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009326585,0.000115105926,0.0020166833,0.00004242186,0.00005129346,0.0008009835,0.0010345072,0.0003452785,0.0021268635,0.98617405,0.002107465,0.0050920607],"study_design_scores_gemma":[0.01163698,0.008257945,0.012028602,0.00038924324,0.00007235715,0.00054913055,0.00030746774,0.0056447336,0.031740796,0.7942617,0.13390395,0.0012070854],"about_ca_topic_score_codex":2.0646665e-7,"about_ca_topic_score_gemma":4.338183e-8,"teacher_disagreement_score":0.8201846,"about_ca_system_score_codex":0.000027200205,"about_ca_system_score_gemma":0.00006627778,"threshold_uncertainty_score":0.4890453},"labels":[],"label_agreement":null},{"id":"W2962798202","doi":"10.1016/j.ejc.2014.08.032","title":"Beyond Ohba’s Conjecture: A bound on the choice number of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-chromatic graphs with<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math>vertices","year":2014,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; Simon Fraser University; McGill University","funders":"Natural Science Foundation of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Conjecture; Mathematics; Upper and lower bounds; Graph; Mathematical analysis","score_opus":0.01633513048850506,"score_gpt":0.2519756485367961,"score_spread":0.23564051804829106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962798202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98214465,0.000995422,0.0067352257,0.0008635826,0.002767367,0.00021738035,0.00010651693,0.0002892178,0.005880659],"genre_scores_gemma":[0.9917226,0.00064231764,0.00413071,0.0015436918,0.0009847953,0.00012862691,0.00008808215,0.00057186454,0.0001873564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9879317,0.0013847052,0.002682868,0.0016990713,0.0040680584,0.0022335588],"domain_scores_gemma":[0.98764545,0.0035195488,0.0036351557,0.0034471552,0.00060816965,0.0011445003],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.005457116,0.0013811724,0.0010161027,0.0005826704,0.0019192337,0.0017524374,0.004939283,0.0007422722,0.000081805505],"category_scores_gemma":[0.0022923646,0.0013573881,0.0015876065,0.0019328935,0.001678448,0.0024232187,0.0021716931,0.00307834,0.0014723944],"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.0010510272,0.00087290554,0.00009158176,0.00072134775,0.0010785293,0.0016041764,0.001966154,0.0023669302,0.0012585262,0.986557,0.0013003158,0.0011314806],"study_design_scores_gemma":[0.0044505806,0.0042283833,0.0005518569,0.0018452579,0.0008706053,0.0029531866,0.0006520213,0.95334566,0.0068269335,0.01498053,0.007703519,0.0015914479],"about_ca_topic_score_codex":0.00011986152,"about_ca_topic_score_gemma":0.00007941208,"teacher_disagreement_score":0.9715765,"about_ca_system_score_codex":0.00008560108,"about_ca_system_score_gemma":0.0011154413,"threshold_uncertainty_score":0.9998939},"labels":[],"label_agreement":null},{"id":"W2963040959","doi":"10.1016/j.ejc.2014.03.007","title":"On the robustness of random<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-cores","year":2014,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Bounded function; Mathematics; Robustness (evolution); Discrete mathematics; Mathematical analysis; Chemistry","score_opus":0.018840471331056208,"score_gpt":0.2402401927875879,"score_spread":0.2213997214565317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963040959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9856073,0.00022202384,0.002860242,0.00019185027,0.0021100468,0.00005397172,0.0000129637265,0.000037800906,0.008903757],"genre_scores_gemma":[0.9979422,0.00017168038,0.00081043685,0.00027225306,0.0005534039,0.000004930713,0.000004862907,0.00013543245,0.00010477653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967662,0.0006307683,0.0010092342,0.00025293967,0.00093507854,0.00040578388],"domain_scores_gemma":[0.9954011,0.0019522101,0.0014152408,0.0008329713,0.00021067314,0.00018783835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003222365,0.00032140018,0.00038582407,0.00013689106,0.00046095898,0.00014584899,0.0010673932,0.0001513661,0.00004095043],"category_scores_gemma":[0.0021018274,0.00025172697,0.000584328,0.0002491662,0.00031621824,0.00020436256,0.00035396224,0.0008201522,0.000051168234],"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.0005873752,0.00019660195,0.000014619302,0.00018432816,0.00025913073,0.00014561714,0.0008354658,0.00088667765,0.000121769,0.9935262,0.0027714365,0.00047076834],"study_design_scores_gemma":[0.0112715755,0.004165263,0.0005907924,0.002108682,0.0012857169,0.0012950905,0.0010998436,0.5564843,0.007846915,0.39922982,0.013374977,0.0012470417],"about_ca_topic_score_codex":0.0000027505682,"about_ca_topic_score_gemma":0.0000014331582,"teacher_disagreement_score":0.5942964,"about_ca_system_score_codex":0.000013840133,"about_ca_system_score_gemma":0.00009512303,"threshold_uncertainty_score":0.9999935},"labels":[],"label_agreement":null},{"id":"W2963262475","doi":"10.1016/j.ejc.2018.01.011","title":"Factorial characters of the classical Lie groups","year":2018,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Nankai University; Wilfrid Laurier University","keywords":"Factorial; Mathematics; Combinatorics; Partition (number theory); Factorial experiment; Realisation; Identity (music); Character (mathematics); Statistics; Geometry; Mathematical analysis","score_opus":0.04091051347692748,"score_gpt":0.2845869444549574,"score_spread":0.24367643097802993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963262475","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.951693,0.000057319983,0.0149786845,0.0005140299,0.02059153,0.00026214536,0.000004755334,0.000049916358,0.011848607],"genre_scores_gemma":[0.996258,0.0000128969405,0.0015580814,0.0000387174,0.0017367644,4.445295e-7,1.9507644e-7,0.00007487892,0.00031997575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687344,0.00061866187,0.0011865753,0.00014211301,0.00089335174,0.00028587994],"domain_scores_gemma":[0.9957596,0.00066606386,0.0018375668,0.0006197861,0.00095921423,0.00015778764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015161514,0.00024080182,0.0005380767,0.00010788123,0.00013646239,0.000041029583,0.0011641454,0.000060218274,0.000027549911],"category_scores_gemma":[0.003098623,0.0001612398,0.0003257744,0.00043142025,0.00030637547,0.00023296593,0.00027055515,0.00059977314,0.000028595465],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115456525,0.0005542156,0.00031801255,0.00008041891,0.000106032276,0.00004119338,0.0014053133,6.2993286e-7,0.0023764356,0.98744,0.00694277,0.00061955716],"study_design_scores_gemma":[0.0022117011,0.001135495,0.0014336137,0.00026714813,0.00013409225,0.00010015182,0.00012216394,0.000013390407,0.008018848,0.96887076,0.017448138,0.00024448533],"about_ca_topic_score_codex":1.1600631e-7,"about_ca_topic_score_gemma":1.5881473e-7,"teacher_disagreement_score":0.044565033,"about_ca_system_score_codex":0.00011952881,"about_ca_system_score_gemma":0.00010769763,"threshold_uncertainty_score":0.65751684},"labels":[],"label_agreement":null},{"id":"W2964071314","doi":"10.1016/j.ejc.2017.10.003","title":"Bijections for Weyl Chamber walks ending on an axis, using arc diagrams and Schnyder woods","year":2017,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"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; Pacific Institute for the Mathematical Sciences","keywords":"Bijection, injection and surjection; Bijection; Mathematics; Young tableau; Combinatorics; Weyl group; Lattice (music); Simple (philosophy); Dimension (graph theory); Bounded function; Homogeneous; Mathematical analysis","score_opus":0.12683875775855968,"score_gpt":0.3802546426921762,"score_spread":0.2534158849336165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964071314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8987122,0.00012612066,0.090227135,0.00020603435,0.0043052197,0.0004181659,0.0000076052274,0.00007240097,0.005925101],"genre_scores_gemma":[0.9711163,0.000046209116,0.027919998,0.000026891586,0.0005600937,0.0000024077633,6.4789845e-7,0.00013369042,0.00019375196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979402,0.00027903475,0.00075324555,0.00023106039,0.00043418267,0.00036228955],"domain_scores_gemma":[0.9963755,0.0006297755,0.0015085908,0.0007617109,0.00044619452,0.00027822523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020461753,0.00029577242,0.00053901103,0.00021096726,0.000926275,0.0003330576,0.00051743764,0.00006550394,0.0000070226706],"category_scores_gemma":[0.0031659957,0.00026355882,0.00017610438,0.000108352884,0.00012530402,0.00062252895,0.00017016807,0.00050413614,0.0000037478226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007869707,0.00062297354,0.0003361912,0.00014609532,0.00011812507,0.00014223329,0.000718139,0.000028688211,0.00061168335,0.99379396,0.0003820602,0.0030211525],"study_design_scores_gemma":[0.0034046771,0.0016437207,0.00071162323,0.0005134317,0.00022443123,0.00042092951,0.00034103112,0.0010995421,0.0011586575,0.985156,0.0048387814,0.00048720324],"about_ca_topic_score_codex":7.0439916e-7,"about_ca_topic_score_gemma":6.505688e-7,"teacher_disagreement_score":0.07240409,"about_ca_system_score_codex":0.00013605018,"about_ca_system_score_gemma":0.00005361114,"threshold_uncertainty_score":0.99998164},"labels":[],"label_agreement":null},{"id":"W2972876943","doi":"10.1016/j.ejc.2021.103383","title":"Cops and robbers on directed and undirected abelian Cayley graphs","year":2021,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds de recherche du Québec – Nature et technologies; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Cayley graph; Mathematics; Abelian group; Combinatorics; Cayley's theorem; Upper and lower bounds; Order (exchange); Undirected graph; Discrete mathematics; Strongly connected component; Graph; Line graph; Voltage graph","score_opus":0.020625254972703178,"score_gpt":0.2519415998974809,"score_spread":0.2313163449247777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972876943","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9811455,0.0014327626,0.0000691243,0.00019373963,0.0009313349,0.000051867548,0.0000034375148,0.000047838443,0.016124371],"genre_scores_gemma":[0.9974136,0.0007002686,0.0012564964,0.0001420417,0.000054345153,1.586459e-7,9.666346e-7,0.000042231146,0.0003898951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983266,0.0006386061,0.0004184125,0.00015889827,0.00027891027,0.00017857994],"domain_scores_gemma":[0.9985423,0.00042581532,0.00031510624,0.00021910548,0.00030681663,0.00019083387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077600323,0.00017475915,0.00032079036,0.00016160528,0.00020426053,0.000070014925,0.00015352409,0.00003728121,0.00002174014],"category_scores_gemma":[0.0007229049,0.00014003034,0.000081954226,0.00032597044,0.00010585093,0.000076997094,0.000102328486,0.0003925601,0.000001196629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115417504,0.00020587977,0.005443567,0.00009361052,0.0002941619,0.0016576615,0.0020936423,0.0000025657625,0.00070706144,0.9771923,0.0071920757,0.005002052],"study_design_scores_gemma":[0.0031946932,0.000735241,0.043903388,0.0003552636,0.00021996771,0.0011735216,0.0004075262,0.000026166594,0.001785651,0.93463624,0.01312439,0.00043796556],"about_ca_topic_score_codex":4.797611e-7,"about_ca_topic_score_gemma":7.986968e-7,"teacher_disagreement_score":0.042556077,"about_ca_system_score_codex":0.000022812017,"about_ca_system_score_gemma":0.000031639953,"threshold_uncertainty_score":0.5710272},"labels":[],"label_agreement":null},{"id":"W2973207532","doi":"10.1016/j.ejc.2021.103405","title":"Bounds on expected propagation time of probabilistic zero forcing","year":2021,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Sanitarium Association; Division of Mathematical Sciences; National Security Agency; National Science Foundation","keywords":"Combinatorics; Vertex (graph theory); Upper and lower bounds; Mathematics; Graph; Probabilistic logic; Binary logarithm; Discrete mathematics; Connectivity; Mathematical analysis; Statistics","score_opus":0.07555647171697927,"score_gpt":0.33018314496774315,"score_spread":0.2546266732507639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973207532","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94471097,0.00021949729,0.035163093,0.00032858577,0.0011920152,0.00028474582,0.000010245234,0.000023380535,0.018067453],"genre_scores_gemma":[0.99801373,0.000016457847,0.00053384935,0.000034217224,0.00011938807,0.0000024085537,0.000008291325,0.000034334298,0.0012372949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9941628,0.0018887909,0.0018260016,0.00035895026,0.001587388,0.00017605511],"domain_scores_gemma":[0.9925476,0.0010240168,0.0029643814,0.0009198947,0.0023961305,0.00014799039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006982738,0.00023216645,0.0006420468,0.00040252143,0.00012320041,0.00033759145,0.0014690382,0.00007159479,0.00013884154],"category_scores_gemma":[0.00547457,0.00018149223,0.00035124025,0.0007486809,0.00012745676,0.00015706701,0.0004640627,0.0008416647,0.00010858654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015173315,0.008941654,0.0027773292,0.00093864865,0.0010931367,0.0016965303,0.031903047,0.09934065,0.038690742,0.6907727,0.045959733,0.07636848],"study_design_scores_gemma":[0.0017822126,0.0015824708,0.010732249,0.0016922792,0.00024127342,0.0001752906,0.0010901347,0.002001013,0.008088933,0.9665365,0.005353013,0.0007246039],"about_ca_topic_score_codex":3.8589178e-7,"about_ca_topic_score_gemma":9.496294e-8,"teacher_disagreement_score":0.2757638,"about_ca_system_score_codex":0.000109146094,"about_ca_system_score_gemma":0.00033473413,"threshold_uncertainty_score":0.74010384},"labels":[],"label_agreement":null},{"id":"W3010132614","doi":"10.1016/j.ejc.2020.103280","title":"Graph covers with two new eigenvalues","year":2020,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"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; Adjacency matrix; Mathematics; Eigenvalues and eigenvectors; Hypercube; Adjacency list; Regular graph; Discrete mathematics; Multiset; Conjecture; Graph energy; Graph; Cover (algebra); Line graph; Voltage graph","score_opus":0.053967928660172984,"score_gpt":0.27650973602796725,"score_spread":0.22254180736779428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010132614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8385995,0.00038767845,0.10625656,0.004085195,0.00035031902,0.00022041783,0.0000049106716,0.00011580193,0.049979597],"genre_scores_gemma":[0.99521524,0.000035687903,0.0040191393,0.00033628682,0.0001579495,2.1633788e-7,4.6770583e-7,0.00003712893,0.0001978907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989317,0.00022444267,0.00034774546,0.00009483417,0.00027092136,0.00013036812],"domain_scores_gemma":[0.9988628,0.00014250044,0.000395569,0.00016658353,0.00014653755,0.00028603253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005054967,0.0001215322,0.00020501803,0.00005933121,0.00008468631,0.00004032598,0.00036304435,0.00001039378,0.00004096761],"category_scores_gemma":[0.00015750316,0.00009293483,0.00011003503,0.00039780693,0.000048936276,0.000118253694,0.00003349973,0.00027043407,0.000039484145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078373065,0.00009504314,0.00044490813,0.000015251321,0.000079175275,0.00012885901,0.00096499984,0.00005590936,0.00033880296,0.9762809,0.021018911,0.0004988426],"study_design_scores_gemma":[0.0025817468,0.00095144665,0.00042255997,0.000065281296,0.00015731592,0.00012357037,0.0003475794,0.000013935343,0.001403618,0.94939816,0.044317186,0.00021762736],"about_ca_topic_score_codex":2.7936952e-7,"about_ca_topic_score_gemma":9.7675944e-8,"teacher_disagreement_score":0.1566157,"about_ca_system_score_codex":0.000012234906,"about_ca_system_score_gemma":0.000060129852,"threshold_uncertainty_score":0.37897727},"labels":[],"label_agreement":null},{"id":"W3022921866","doi":"10.1016/j.ejc.2023.103859","title":"Graph sequences sampled from Robinson graphons","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Measurable function; Bounded function; Graph; Norm (philosophy); Converse; Embedding; Discrete mathematics; Mathematical analysis; Computer science; Geometry","score_opus":0.04525435601837074,"score_gpt":0.28343904416938104,"score_spread":0.2381846881510103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022921866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9868141,0.00040468256,0.0017346699,0.00018729083,0.003163224,0.00007668163,0.000020006872,0.00012630316,0.0074730315],"genre_scores_gemma":[0.99742025,0.00040269236,0.0016072175,0.00007768149,0.00024121093,4.2540282e-7,0.0000038137266,0.000055054672,0.00019166832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770665,0.0006649499,0.0006844798,0.00015686211,0.00050678995,0.000280275],"domain_scores_gemma":[0.9979033,0.0007636314,0.00058247027,0.00035055782,0.00023138236,0.00016866339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001768013,0.00019989863,0.00036867376,0.00039801342,0.0002699875,0.00006524601,0.00071749516,0.00004075668,0.00007286186],"category_scores_gemma":[0.0006235275,0.00015272397,0.0003089262,0.00087229855,0.00011800087,0.00015638274,0.00014961066,0.00044084102,0.000030230447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007287328,0.00012117214,0.0039150203,0.00003967545,0.00031968392,0.0010950171,0.0033300603,0.000034218534,0.0009373357,0.9444754,0.043728437,0.001931078],"study_design_scores_gemma":[0.00081487047,0.00021588807,0.008028942,0.000078837445,0.00007707449,0.000050997165,0.0003488364,0.000011357508,0.00039024456,0.97984177,0.009950552,0.00019064225],"about_ca_topic_score_codex":0.0000029910934,"about_ca_topic_score_gemma":8.200705e-7,"teacher_disagreement_score":0.035366327,"about_ca_system_score_codex":0.000026746935,"about_ca_system_score_gemma":0.00003495826,"threshold_uncertainty_score":0.6227903},"labels":[],"label_agreement":null},{"id":"W3047381039","doi":"10.1016/j.ejc.2022.103599","title":"Periodic P-partitions","year":2022,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"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":"Omega; Mathematics; Constant (computer programming); Combinatorics; Matrix (chemical analysis); Homogeneous; Order (exchange); Constant coefficients; Class (philosophy); Mathematical analysis; Discrete mathematics; Physics; Quantum mechanics","score_opus":0.0698780518281715,"score_gpt":0.32778430175660417,"score_spread":0.2579062499284327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047381039","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6113435,0.0048064464,0.1023739,0.001945055,0.0640532,0.0018627978,0.00017223731,0.00075099576,0.21269189],"genre_scores_gemma":[0.97820264,0.00032742837,0.018567711,0.000075277945,0.0008791705,0.0000132167515,0.000010911074,0.00032202178,0.0016016288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994761,0.0013485173,0.0018850296,0.0003121455,0.0012941288,0.00039916052],"domain_scores_gemma":[0.99409467,0.0006736206,0.0031359044,0.0010995934,0.00071600714,0.00028019093],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0029873557,0.0004919837,0.0010339913,0.0004005509,0.00030345726,0.00015831621,0.0017853968,0.00009565998,0.0005273919],"category_scores_gemma":[0.0022894398,0.00049308717,0.00063902594,0.00038307733,0.000108893706,0.00015529282,0.0018892316,0.0030062082,0.000044804798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056571065,0.0014118924,0.00011595574,0.00074412284,0.00036080272,0.0018165873,0.0022533687,0.00073350477,0.000046311507,0.9473021,0.044663128,0.000495677],"study_design_scores_gemma":[0.0010170129,0.00047336813,0.00006626049,0.00030215204,0.00027335843,0.00021343962,0.00033151146,0.000028797593,0.000052693493,0.9384714,0.058323745,0.0004462798],"about_ca_topic_score_codex":3.4241e-7,"about_ca_topic_score_gemma":1.14817276e-7,"teacher_disagreement_score":0.36685917,"about_ca_system_score_codex":0.0005119191,"about_ca_system_score_gemma":0.0003934142,"threshold_uncertainty_score":0.9997521},"labels":[],"label_agreement":null},{"id":"W3088844073","doi":"10.1016/j.ejc.2020.103242","title":"On-line size Ramsey number for monotone k-uniform ordered paths with uniform looseness","year":2020,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"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; National Natural Science Foundation of China; Ryerson University","keywords":"Hypergraph; Combinatorics; Ramsey's theorem; Mathematics; Monotone polygon; Upper and lower bounds; Discrete mathematics; Graph; Geometry; Mathematical analysis","score_opus":0.03885832215286916,"score_gpt":0.2791317990322767,"score_spread":0.24027347687940753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088844073","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8916558,0.00009129876,0.0811215,0.0013051126,0.0015927171,0.00057407614,0.000033858374,0.000097349766,0.023528257],"genre_scores_gemma":[0.99096876,0.00004597728,0.007469485,0.0006866474,0.00040653627,0.0000016274796,0.0000021552257,0.00011784799,0.0003009755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980387,0.00020475726,0.00074712664,0.00019349792,0.0005016856,0.0003142497],"domain_scores_gemma":[0.99708694,0.00094217365,0.0007730687,0.0003232266,0.0005724957,0.00030208874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009904061,0.0003037864,0.0005366976,0.00005877714,0.0002307315,0.000068049216,0.00060380384,0.000053097257,0.00006998902],"category_scores_gemma":[0.0012274575,0.00020715201,0.00021573802,0.00033170168,0.000086954526,0.00015895136,0.0001060869,0.00051213783,0.0000113105925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001774563,0.00036442428,0.00024489508,0.00024061945,0.00029704112,0.0006149257,0.0021828478,0.0003141243,0.00005552889,0.98510635,0.006614876,0.0021897834],"study_design_scores_gemma":[0.010497521,0.0052350825,0.00028304596,0.00027020677,0.00027723014,0.00040729129,0.00057820434,0.00061904365,0.0012853482,0.9514121,0.02846081,0.00067411375],"about_ca_topic_score_codex":2.2611549e-7,"about_ca_topic_score_gemma":2.02907e-7,"teacher_disagreement_score":0.09931292,"about_ca_system_score_codex":0.000049062033,"about_ca_system_score_gemma":0.00008075208,"threshold_uncertainty_score":0.8447414},"labels":[],"label_agreement":null},{"id":"W3092858120","doi":"10.1016/j.ejc.2021.103381","title":"Primitive elements of the Hopf algebras of tableaux","year":2021,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Sapienza Università di Roma; Université du Québec à Montréal","keywords":"Hopf algebra; Mathematics; Combinatorics; Monoid; Order (exchange); Partially ordered set; Homomorphism; Coproduct; Young tableau; Algebra over a field; Pure mathematics","score_opus":0.04494154769434903,"score_gpt":0.2976514511110777,"score_spread":0.25270990341672867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092858120","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96006215,0.0012561156,0.015647119,0.00015410877,0.008764939,0.0007078149,0.000035993526,0.000031124375,0.013340628],"genre_scores_gemma":[0.98318195,0.00026769945,0.015910976,0.000023853014,0.0001857778,0.0000021315218,0.0000026220446,0.00015236175,0.00027262434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99345773,0.0013861317,0.0029779396,0.00028047885,0.0015598101,0.00033793153],"domain_scores_gemma":[0.9869445,0.0008245999,0.008159181,0.0013597899,0.0025666722,0.00014525204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027997603,0.0004826261,0.0015059678,0.00021412366,0.000090084184,0.000052046973,0.0020995927,0.00014626065,0.000041440086],"category_scores_gemma":[0.004515745,0.00037338212,0.00079224235,0.00052772043,0.00019725141,0.00014758045,0.0021595403,0.0016514164,0.0000023983573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001470359,0.0038660662,0.0018326902,0.005465023,0.0020387056,0.00039781933,0.0069308914,0.00037078327,0.0032539316,0.9696335,0.004628874,0.0014346335],"study_design_scores_gemma":[0.0024227006,0.0005271335,0.0010900873,0.004568472,0.00080766587,0.0000938658,0.0011091401,0.000045766436,0.023518622,0.9643395,0.0009809496,0.0004961031],"about_ca_topic_score_codex":0.0000010254782,"about_ca_topic_score_gemma":3.744238e-7,"teacher_disagreement_score":0.023119798,"about_ca_system_score_codex":0.00023338033,"about_ca_system_score_gemma":0.0006215692,"threshold_uncertainty_score":0.9998718},"labels":[],"label_agreement":null},{"id":"W3207930735","doi":"10.1016/j.ejc.2023.103708","title":"Continuously increasing subsequences of random multiset permutations","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multiset; Mathematics; Combinatorics; Subsequence; Longest increasing subsequence; Infinity; Conjecture; Integer (computer science); Generating function; Inverse; Function (biology); Discrete mathematics; Bounded function","score_opus":0.056269511119543605,"score_gpt":0.322514570171774,"score_spread":0.2662450590522304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207930735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.977102,0.00016317671,0.015970334,0.00013904067,0.0015988111,0.00021375704,0.000009669489,0.00011254443,0.004690708],"genre_scores_gemma":[0.99225885,0.00009470362,0.007255226,0.00000993512,0.00012708596,0.0000012719967,0.0000024902308,0.0000715426,0.00017889103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966603,0.00090798916,0.0013400514,0.00013179897,0.00068397896,0.00027588365],"domain_scores_gemma":[0.9945906,0.002523084,0.0015691491,0.0003187536,0.0008501933,0.00014821212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003887773,0.00020691741,0.00064846943,0.0003495391,0.000119190234,0.00004238421,0.0005701766,0.000037592326,0.000019319818],"category_scores_gemma":[0.0070850155,0.00018201549,0.00023302842,0.0008659108,0.0001276177,0.00026643372,0.00010974288,0.0003372356,0.00003459408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004885549,0.0009818267,0.0034887025,0.0006942671,0.000431944,0.0016928705,0.0080445865,0.00044132565,0.007978407,0.9643605,0.00883299,0.002564028],"study_design_scores_gemma":[0.00610167,0.0005353361,0.0016236036,0.00051423465,0.00018528676,0.00031340614,0.0012463259,0.00033926714,0.0021140946,0.9851987,0.0015147211,0.00031337864],"about_ca_topic_score_codex":0.0000012356995,"about_ca_topic_score_gemma":3.241185e-7,"teacher_disagreement_score":0.020838177,"about_ca_system_score_codex":0.00006525681,"about_ca_system_score_gemma":0.00009513094,"threshold_uncertainty_score":0.8481937},"labels":[],"label_agreement":null},{"id":"W3211716743","doi":"10.1016/j.ejc.2021.103467","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e117\" altimg=\"si8.svg\"> <mml:mrow> <mml:mn>1</mml:mn> <mml:mo>/</mml:mo> <mml:mn>2</mml:mn> </mml:mrow> </mml:math> -conjectures on the domination game and claw-free graphs","year":2021,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Conjecture; Combinatorics; Graph; Mathematics; Class (philosophy); Computer science; Artificial intelligence","score_opus":0.01985399388103665,"score_gpt":0.2507570447313059,"score_spread":0.23090305085026924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211716743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94120467,0.004187924,0.009438815,0.0026011574,0.004466699,0.00012140005,0.0002153714,0.0001821267,0.03758183],"genre_scores_gemma":[0.99109226,0.002570988,0.002622355,0.0014862132,0.0011481385,0.00007096522,0.0001247127,0.00044652188,0.00043786786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98919195,0.002063258,0.0020375552,0.0014985781,0.0033496344,0.001859029],"domain_scores_gemma":[0.99036235,0.0027895595,0.0025330414,0.0025111688,0.0007282764,0.0010756328],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005655683,0.0009344223,0.0005567284,0.0006752563,0.0016465358,0.0020785192,0.0041191857,0.0007076594,0.0013970768],"category_scores_gemma":[0.0035053205,0.0011574645,0.0013163418,0.0019204842,0.0015233496,0.0017227068,0.0028984824,0.0031946402,0.0006256271],"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.0008089008,0.00053593836,0.000015217557,0.00039673742,0.0007612561,0.003772898,0.0024602483,0.0008923755,0.0017139447,0.96106386,0.022472577,0.005106058],"study_design_scores_gemma":[0.010677815,0.010268783,0.0011837815,0.004399635,0.0019792104,0.010451796,0.004190635,0.4574716,0.39093897,0.051859822,0.052495852,0.004082066],"about_ca_topic_score_codex":0.00004174865,"about_ca_topic_score_gemma":0.000047892892,"teacher_disagreement_score":0.909204,"about_ca_system_score_codex":0.000053978958,"about_ca_system_score_gemma":0.0010588559,"threshold_uncertainty_score":0.99965316},"labels":[],"label_agreement":null},{"id":"W3212288097","doi":"10.1016/j.ejc.2023.103845","title":"Weak diameter coloring of graphs on surfaces","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Bounded function; Monochromatic color; Planar graph; Vertex (graph theory); Induced subgraph; Graph; Discrete mathematics; Mathematical analysis","score_opus":0.048343231452040614,"score_gpt":0.28466745918701775,"score_spread":0.23632422773497713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212288097","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9737899,0.000098044475,0.000110472974,0.00006090728,0.0017127527,0.00005344543,0.000003161662,0.000034430683,0.024136908],"genre_scores_gemma":[0.99885565,0.00015417628,0.00046594936,0.000023040977,0.00006230225,1.8610729e-7,2.9952812e-7,0.000041157065,0.00039725148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829036,0.00041061005,0.0005875595,0.00009299285,0.00043335123,0.00018515551],"domain_scores_gemma":[0.99815875,0.0007350162,0.0005683146,0.00025272704,0.00019854582,0.000086615495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019988308,0.00013591882,0.00032027616,0.00031510423,0.0001028144,0.000019853605,0.0004253973,0.000026058957,0.00002136083],"category_scores_gemma":[0.0006091861,0.00010135397,0.00020634073,0.0004953209,0.00007815228,0.00007814104,0.00011092073,0.00030394917,0.000011628115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008102927,0.0001103038,0.0031255188,0.00008991885,0.00013489323,0.00018019165,0.0011569831,0.00007995,0.00051337184,0.9846107,0.008849249,0.0010678865],"study_design_scores_gemma":[0.0011029122,0.0010392651,0.017184583,0.00021554349,0.00006780379,0.00003764163,0.00037535134,0.000025841953,0.0027237823,0.970531,0.006503841,0.00019247488],"about_ca_topic_score_codex":1.7544464e-7,"about_ca_topic_score_gemma":6.283224e-8,"teacher_disagreement_score":0.025065761,"about_ca_system_score_codex":0.00001779061,"about_ca_system_score_gemma":0.000015868876,"threshold_uncertainty_score":0.4133095},"labels":[],"label_agreement":null},{"id":"W4205624872","doi":"10.1016/j.ejc.2006.06.010","title":"When is a random graph projective?","year":2006,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Korle-Bu Neuroscience Foundation; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Mathematics; Combinatorics; Projective test; Graph; Discrete mathematics; Pure mathematics","score_opus":0.018958885909743716,"score_gpt":0.24955865484453948,"score_spread":0.23059976893479578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205624872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84732056,0.0010713716,0.016120637,0.0003785635,0.002228685,0.00026769255,0.000006570289,0.0000670071,0.1325389],"genre_scores_gemma":[0.9959474,0.00003258966,0.0025932898,0.00011062457,0.00032886292,4.819929e-7,3.3865462e-7,0.000049655744,0.00093671767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980055,0.0005599994,0.00066199066,0.000121671095,0.0004384813,0.00021233837],"domain_scores_gemma":[0.9984065,0.00027394612,0.0006188952,0.00026875007,0.00035171796,0.00008017009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001656595,0.00018049119,0.0003497997,0.00022111765,0.00018357363,0.00005492775,0.00044820414,0.000032299813,0.000064000844],"category_scores_gemma":[0.0002375821,0.0001317665,0.00029135734,0.00022098275,0.00008671971,0.00014015255,0.000087949375,0.0003784923,0.0000067227425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002296684,0.0002768496,0.0017010692,0.000056774083,0.00014016176,0.00038410487,0.002813232,0.0000030308654,0.00011391932,0.8903574,0.1026522,0.0012716044],"study_design_scores_gemma":[0.0029744655,0.00024400915,0.0013904894,0.000051041763,0.000076895725,0.00020119334,0.00008045416,0.0000047280705,0.00042767095,0.9713576,0.023032758,0.00015873098],"about_ca_topic_score_codex":0.0000013152383,"about_ca_topic_score_gemma":1.9094104e-7,"teacher_disagreement_score":0.14862686,"about_ca_system_score_codex":0.000034555913,"about_ca_system_score_gemma":0.00003163919,"threshold_uncertainty_score":0.5373282},"labels":[],"label_agreement":null},{"id":"W4206382042","doi":"10.1016/j.ejc.2006.06.009","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-Free bound for the class of planar graphs","year":2006,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Graph; Vertex (graph theory); Homomorphism; Scroll; Discrete mathematics; Algorithm; Philosophy; Theology","score_opus":0.01973816240423871,"score_gpt":0.24753745387877338,"score_spread":0.22779929147453468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206382042","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54791284,0.0042391755,0.013776924,0.0015676522,0.006171469,0.000080649545,0.00034003242,0.00015588898,0.42575538],"genre_scores_gemma":[0.99080044,0.0016364984,0.0035667038,0.00085682917,0.0016424005,0.00014616309,0.00018961504,0.0006355866,0.000525742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98946327,0.0010619159,0.0023920161,0.0013165572,0.003467379,0.0022988613],"domain_scores_gemma":[0.9891597,0.003025635,0.003275147,0.0029923005,0.0005113793,0.0010358564],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005101034,0.0008045201,0.0004212017,0.0007445207,0.0017915136,0.001628921,0.0055543324,0.0008847179,0.0457609],"category_scores_gemma":[0.0022190076,0.0012807766,0.0020914234,0.0019095935,0.0020352686,0.0018083056,0.0024041566,0.0023271453,0.0005856548],"study_design_candidate":"bench_or_experimental","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.0013711854,0.00040801827,0.000027039845,0.000562792,0.00095782534,0.0020452465,0.0010185194,0.0017609885,0.0010201117,0.7309475,0.25840762,0.0014731319],"study_design_scores_gemma":[0.0057101785,0.005991913,0.00051409786,0.0017188685,0.0014198542,0.0028973697,0.0014639902,0.08699463,0.8642734,0.0063942526,0.020657843,0.0019636017],"about_ca_topic_score_codex":0.00023689924,"about_ca_topic_score_gemma":0.0002526,"teacher_disagreement_score":0.8632533,"about_ca_system_score_codex":0.000025192801,"about_ca_system_score_gemma":0.0015321672,"threshold_uncertainty_score":0.99997455},"labels":[],"label_agreement":null},{"id":"W4246559368","doi":"10.1016/j.ejc.2013.07.005","title":"Preface","year":2013,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012025013765093264,"score_gpt":0.20624001679823545,"score_spread":0.19421500303314218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246559368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8531811,0.0005993413,0.0010267298,0.0003509862,0.0013823818,0.0001241888,0.000001605168,0.00006917666,0.14326444],"genre_scores_gemma":[0.99748206,0.000025632267,0.00047926023,0.00008673043,0.00017809325,3.209156e-7,4.2078815e-7,0.00011137364,0.0016361055],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99779403,0.0006772054,0.0006146959,0.000099873825,0.000548767,0.0002654192],"domain_scores_gemma":[0.9978947,0.00006935776,0.00068151555,0.0002800491,0.00078587566,0.00028851395],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014562662,0.00015503359,0.0002321091,0.00018705807,0.00006913384,0.00012470291,0.0006460309,0.000015920225,0.00039830347],"category_scores_gemma":[0.000317071,0.00012806799,0.0001349362,0.00038555948,0.000054102147,0.00054964353,0.000095566545,0.0004385185,0.014718726],"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.00009145,0.001172725,0.016907476,0.00004752461,0.00028326694,0.0014062086,0.0015459657,0.00026944818,0.024094917,0.031886626,0.9071134,0.0151810115],"study_design_scores_gemma":[0.007271139,0.0026262922,0.28750962,0.00024511787,0.00015340533,0.0016487779,0.00049480604,0.0001493383,0.007054575,0.027649775,0.6642532,0.0009439926],"about_ca_topic_score_codex":0.0000010617811,"about_ca_topic_score_gemma":3.5781472e-8,"teacher_disagreement_score":0.27060214,"about_ca_system_score_codex":0.000098248776,"about_ca_system_score_gemma":0.000051426694,"threshold_uncertainty_score":0.9860484},"labels":[],"label_agreement":null},{"id":"W4313450058","doi":"10.1016/j.ejc.2007.04.014","title":"An upper bound for the chromatic number of line graphs","year":2007,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Chromatic scale; Upper and lower bounds; Computer science; Line (geometry); Combinatorics; Mathematics; Geometry","score_opus":0.02439923940933715,"score_gpt":0.3239694786796888,"score_spread":0.29957023927035165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313450058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23678625,0.00038867386,0.76039255,0.00020395344,0.0006778142,0.00012612871,9.574021e-7,0.000016545531,0.0014071345],"genre_scores_gemma":[0.9856693,0.000053173033,0.01399009,0.00007583165,0.00008359136,4.3158278e-7,2.441778e-7,0.000023351813,0.00010398392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813247,0.00032328625,0.00058966386,0.00012689353,0.0005352159,0.00029244472],"domain_scores_gemma":[0.9973873,0.00077030313,0.000466972,0.000566821,0.0006474702,0.00016117067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058549293,0.000115923,0.00020400701,0.00016642212,0.00016239173,0.00008526522,0.0019222597,0.000017471357,0.0000085837155],"category_scores_gemma":[0.00025505666,0.00007757725,0.00016737661,0.0006651009,0.00014307039,0.00047317334,0.000120577424,0.00029065064,0.000009173813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105975,0.00038607663,0.002411616,0.000042503147,0.000086029715,0.00013282403,0.0009643827,0.00014830453,0.0017714812,0.9703104,0.00054504274,0.023095364],"study_design_scores_gemma":[0.0034148314,0.0030451068,0.024100699,0.00013675504,0.00005555598,0.00067673234,0.0003353402,0.0043497207,0.008318078,0.9405162,0.01466816,0.00038286403],"about_ca_topic_score_codex":3.1680253e-7,"about_ca_topic_score_gemma":2.0146835e-7,"teacher_disagreement_score":0.74888307,"about_ca_system_score_codex":0.00002942578,"about_ca_system_score_gemma":0.000057813628,"threshold_uncertainty_score":0.35720688},"labels":[],"label_agreement":null},{"id":"W4320168735","doi":"10.1016/j.ejc.2023.103688","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e33\" altimg=\"si4.svg\"><mml:mi>P</mml:mi></mml:math>-partition power sums","year":2023,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"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":"Mathematics; Monomial; Coproduct; Basis (linear algebra); Partition (number theory); Symmetric function; Combinatorics; Type (biology); Hopf algebra; Discrete mathematics; Product (mathematics); Arithmetic function; Algebra over a field; Pure mathematics; Geometry","score_opus":0.026498859394244838,"score_gpt":0.26503158830401763,"score_spread":0.23853272890977278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320168735","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9778695,0.00063396443,0.0036808786,0.00053696154,0.009379202,0.00015565476,0.00007878221,0.00029277222,0.007372252],"genre_scores_gemma":[0.99344367,0.0010016727,0.002626835,0.00024773658,0.0013283684,0.000024261868,0.00006727093,0.0006091473,0.0006510514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923608,0.0006915536,0.0026939858,0.00068802707,0.0022625031,0.0013031715],"domain_scores_gemma":[0.99206114,0.0015587632,0.0034920769,0.001547252,0.0006078203,0.0007329278],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0038640772,0.0008401654,0.0008228776,0.00043318214,0.00073850347,0.00059851503,0.0016467632,0.00047877294,0.0000922866],"category_scores_gemma":[0.0033878507,0.0009691954,0.0009878944,0.0012293616,0.0003886294,0.0009760708,0.0010711844,0.0019424829,0.0050441725],"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.00025784838,0.00090890226,0.000011393888,0.00093511015,0.00051728386,0.0032634076,0.002380776,0.0004471971,0.00059540453,0.98358893,0.006708802,0.0003849173],"study_design_scores_gemma":[0.009713329,0.00795902,0.00024811496,0.0066487305,0.0028261896,0.0035921023,0.0049495245,0.4533595,0.008249082,0.4351109,0.06411748,0.0032260185],"about_ca_topic_score_codex":0.000005572784,"about_ca_topic_score_gemma":0.000003041446,"teacher_disagreement_score":0.54847807,"about_ca_system_score_codex":0.00012519122,"about_ca_system_score_gemma":0.0005069154,"threshold_uncertainty_score":0.99927586},"labels":[],"label_agreement":null},{"id":"W4385611729","doi":"10.1016/j.ejc.2023.103786","title":"Pure pairs. X. Tournaments and the strong Erdős-Hajnal property","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Property (philosophy)","score_opus":0.0352324415802909,"score_gpt":0.26716592679473466,"score_spread":0.23193348521444376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385611729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.975185,0.0005678003,0.00054446846,0.0014229616,0.002024528,0.00022135235,0.0000037466255,0.000066516914,0.019963637],"genre_scores_gemma":[0.9976683,0.00027496542,0.00020894177,0.000100541365,0.00023275941,6.143676e-7,3.9379336e-7,0.0000423983,0.0014710844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977525,0.00085542415,0.00054956356,0.00011064605,0.0004900346,0.00024183885],"domain_scores_gemma":[0.99855375,0.0004043488,0.00046485104,0.00026254298,0.00019048764,0.00012404422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036562784,0.00016490307,0.0003071558,0.00012337687,0.00035723814,0.00009758233,0.00050846755,0.000027328912,0.000026243773],"category_scores_gemma":[0.0006853922,0.00007502124,0.00015836403,0.00028265076,0.00020116298,0.00012945473,0.0002692871,0.00052450894,0.000009111246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002731573,0.00008476443,0.0013841456,0.00008888849,0.0002771503,0.0007908073,0.006701084,0.000015776819,0.000030810115,0.9398753,0.04250668,0.007971444],"study_design_scores_gemma":[0.0054775705,0.0003917836,0.0037149251,0.00017287905,0.00015088821,0.00061859516,0.0017203193,0.00015078083,0.000049203634,0.9621907,0.025112506,0.00024988997],"about_ca_topic_score_codex":3.1748323e-7,"about_ca_topic_score_gemma":1.365684e-7,"teacher_disagreement_score":0.022483313,"about_ca_system_score_codex":0.000030244535,"about_ca_system_score_gemma":0.00003059595,"threshold_uncertainty_score":0.30592775},"labels":[],"label_agreement":null},{"id":"W4386832011","doi":"10.1016/j.ejc.2023.103809","title":"Guarding isometric subgraphs and cops and robber in planar graphs","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Combinatorics; Mathematics; Conjecture; Planar graph; Graph; Planar; Discrete mathematics; Computer science; Computer graphics (images)","score_opus":0.021495076137568046,"score_gpt":0.26022560617976226,"score_spread":0.23873053004219422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386832011","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9782744,0.002371776,0.015786937,0.00045732592,0.0005302479,0.00009515274,0.0000010843273,0.00006106067,0.0024220143],"genre_scores_gemma":[0.9971187,0.0015155153,0.001199724,0.000042026797,0.000017359347,3.846594e-7,2.5618442e-7,0.00001895693,0.00008708539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981325,0.0005243223,0.00038576373,0.00020857931,0.00042496048,0.00032386818],"domain_scores_gemma":[0.9988359,0.00040912908,0.00018631133,0.00023514903,0.00013923463,0.00019427612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031569372,0.00012744157,0.00023597611,0.0021358102,0.000108109976,0.00014380696,0.00065128814,0.000020675367,0.0000012247176],"category_scores_gemma":[0.00030143667,0.00011527429,0.00005378155,0.004546889,0.00009100078,0.0005385036,0.00027098774,0.00043418628,0.000010616429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006066734,0.00012365355,0.13865457,0.000071760274,0.00006690373,0.004561841,0.001782779,0.00013251172,0.00084989547,0.81411326,0.0023030795,0.037279055],"study_design_scores_gemma":[0.003774508,0.0011990382,0.382212,0.00019478652,0.000014104208,0.000828243,0.00042786065,0.0016697594,0.00025323743,0.6030824,0.00585034,0.0004936636],"about_ca_topic_score_codex":5.991311e-7,"about_ca_topic_score_gemma":2.6661868e-7,"teacher_disagreement_score":0.24355745,"about_ca_system_score_codex":0.000024485085,"about_ca_system_score_gemma":0.000024343473,"threshold_uncertainty_score":0.4700749},"labels":[],"label_agreement":null},{"id":"W4386988462","doi":"10.1016/j.ejc.2023.103837","title":"On tangencies among planar curves with an application to coloring L-shapes","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research, Development and Innovation Office; Nemzeti Kutatási, Fejlesztési és Innovaciós Alap; Innovációs és Technológiai Minisztérium; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Magyar Tudományos Akadémia; Nemzeti Kutatási és Technológiai Hivatal; Mount Allison University","keywords":"Mathematics; Combinatorics; Disjoint sets; Upper and lower bounds; Context (archaeology); String (physics); Planar; Set (abstract data type); Mathematical analysis; Computer science","score_opus":0.017623599024066555,"score_gpt":0.2380684267204793,"score_spread":0.22044482769641274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386988462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48558578,0.00007516956,0.51167667,0.00065487076,0.00032110082,0.00010388949,8.760492e-7,0.000080515885,0.0015010973],"genre_scores_gemma":[0.9967074,0.000041917458,0.0026874521,0.00030063474,0.00010616429,0.0000020651582,0.0000032625378,0.000011529491,0.00013957922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9988741,0.00016690746,0.00023823051,0.00014865625,0.00044200313,0.00013005071],"domain_scores_gemma":[0.99913067,0.00009959853,0.00019371428,0.00015765877,0.00027215062,0.0001462295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093400927,0.000090204434,0.00011097976,0.00028482155,0.00011861068,0.00009556795,0.00053019373,0.000009106821,0.0000015026848],"category_scores_gemma":[0.00007273587,0.00007524238,0.000028657236,0.001153982,0.000013081478,0.00041924897,0.00004846478,0.00011816461,0.000057633868],"study_design_candidate":"observational","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.00019869478,0.000560497,0.005018701,0.00012927612,0.00012054091,0.0008505055,0.003496251,0.22877443,0.0032920442,0.6671957,0.024325376,0.06603799],"study_design_scores_gemma":[0.0034611318,0.018783279,0.7296151,0.0013108636,0.00008286211,0.0004286345,0.00043231368,0.13438639,0.0054666563,0.036533322,0.067958854,0.0015406157],"about_ca_topic_score_codex":6.0862146e-7,"about_ca_topic_score_gemma":0.0000010181362,"teacher_disagreement_score":0.7245964,"about_ca_system_score_codex":0.00003468715,"about_ca_system_score_gemma":0.000042064985,"threshold_uncertainty_score":0.30682954},"labels":[],"label_agreement":null},{"id":"W4387305967","doi":"10.1016/j.ejc.2023.103813","title":"Hereditary classes of ordered sets of width at most two","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; University of Calgary","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics","score_opus":0.022747337532556283,"score_gpt":0.2716756933517104,"score_spread":0.2489283558191541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387305967","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.727489,0.001958685,0.18606669,0.0013646414,0.0034136756,0.00026235866,0.000021970536,0.0007383208,0.07868463],"genre_scores_gemma":[0.9821236,0.000073939336,0.01741433,0.000048422422,0.000032466112,2.4417696e-7,0.0000014520799,0.000028268354,0.00027725505],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981056,0.00021010695,0.0007335313,0.00015165904,0.000594446,0.00020469564],"domain_scores_gemma":[0.9976771,0.00015469962,0.0008897352,0.00041279843,0.0007556024,0.00011005101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011397968,0.00014235933,0.00032055136,0.00031050312,0.000051904983,0.0000790838,0.0015457458,0.000018661452,0.000004231206],"category_scores_gemma":[0.00033581897,0.00012791964,0.00010627188,0.0013009837,0.0001065243,0.00081438787,0.00071217347,0.0001887629,0.000018575638],"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.00025743316,0.0024319754,0.01734814,0.0012332443,0.0005246102,0.010197818,0.0041341875,0.00065750006,0.035540074,0.11290292,0.47192755,0.34284455],"study_design_scores_gemma":[0.009374385,0.008573849,0.04677948,0.0032512061,0.00018165616,0.0029460725,0.00030591656,0.013128768,0.33845943,0.5197904,0.055158217,0.0020506207],"about_ca_topic_score_codex":0.0000012224523,"about_ca_topic_score_gemma":2.773376e-7,"teacher_disagreement_score":0.41676936,"about_ca_system_score_codex":0.000045918398,"about_ca_system_score_gemma":0.00013398194,"threshold_uncertainty_score":0.52164114},"labels":[],"label_agreement":null},{"id":"W4387329467","doi":"10.1016/j.ejc.2023.103848","title":"Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Graph; Random graph; Discrete mathematics; Regular graph; Geometric graph theory; Graph power; Line graph","score_opus":0.021161410493852315,"score_gpt":0.26388670439312195,"score_spread":0.24272529389926964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387329467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9942481,0.0012235233,0.0004235877,0.000054058793,0.0010119097,0.000118235825,0.0000087413255,0.000034990266,0.0028768464],"genre_scores_gemma":[0.99830776,0.0011622211,0.00022947884,0.000039672283,0.000029225095,5.3183993e-7,0.0000017956453,0.00005562474,0.00017366507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971586,0.0007765011,0.0010119653,0.00014996876,0.00059893547,0.00030401323],"domain_scores_gemma":[0.99747556,0.001085273,0.0007497139,0.00030789542,0.00024588115,0.0001356934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032148953,0.00021241358,0.00057018927,0.0016341154,0.0000952406,0.000027089642,0.00058325083,0.00005291677,0.000017503997],"category_scores_gemma":[0.0013054432,0.00016683982,0.00034340925,0.0026188944,0.0001306742,0.00012050694,0.00009714247,0.0004592042,0.0000040347177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029639017,0.0020477914,0.049013082,0.000996155,0.0013500655,0.0045515792,0.026795223,0.00025202156,0.006326819,0.7266703,0.1691236,0.009909425],"study_design_scores_gemma":[0.009924316,0.00077368214,0.018226791,0.00028109417,0.00013308974,0.00015314916,0.0009961714,0.000039806047,0.0015541682,0.96384734,0.0036505887,0.00041980695],"about_ca_topic_score_codex":0.0000013817992,"about_ca_topic_score_gemma":2.9697947e-7,"teacher_disagreement_score":0.237177,"about_ca_system_score_codex":0.000034320296,"about_ca_system_score_gemma":0.000025467865,"threshold_uncertainty_score":0.680353},"labels":[],"label_agreement":null},{"id":"W4387427116","doi":"10.1016/j.ejc.2023.103860","title":"Mixing is hard for triangle-free reflexive graphs","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Ministry of Education, Science and Technology; Ministry of Education; Kyungpook National University","keywords":"Mathematics; Combinatorics; Simplicial complex; Simplicial homology; Graph; Simplicial approximation theorem; Discrete mathematics; Simplicial set; Pure mathematics","score_opus":0.056953514808353436,"score_gpt":0.2804022602852278,"score_spread":0.22344874547687438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387427116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04040899,0.0012797926,0.931403,0.012890287,0.0037388701,0.00021632455,0.000056950736,0.00029095126,0.009714857],"genre_scores_gemma":[0.97194165,0.00063015503,0.020951461,0.0013423684,0.00038064612,0.0000024086846,0.000009460014,0.000041749285,0.0047001126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817646,0.00026086226,0.0005767212,0.00022630306,0.0004594587,0.00030019364],"domain_scores_gemma":[0.9979905,0.00039693492,0.00047361257,0.00058486295,0.00036578972,0.00018833809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026900524,0.00013388977,0.00033837408,0.00074184017,0.00016129212,0.00018357235,0.002410697,0.000025560257,0.000016644974],"category_scores_gemma":[0.001163093,0.00010172091,0.00038791908,0.0033613988,0.000037989015,0.0004019169,0.00046807682,0.00021164615,0.00010304254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054816926,0.00019650387,0.0006929934,0.000027957278,0.00027226174,0.00085981295,0.00058776606,0.000071717564,0.00014470462,0.5254365,0.4065399,0.06511503],"study_design_scores_gemma":[0.0039610313,0.0018270961,0.008209568,0.000054353328,0.00011688546,0.00008730103,0.00012807218,0.0015164104,0.0005017137,0.55742884,0.42575452,0.00041423793],"about_ca_topic_score_codex":7.5526555e-7,"about_ca_topic_score_gemma":7.6862584e-8,"teacher_disagreement_score":0.9315326,"about_ca_system_score_codex":0.000029858851,"about_ca_system_score_gemma":0.00003464789,"threshold_uncertainty_score":0.4479715},"labels":[],"label_agreement":null},{"id":"W4389590920","doi":"10.1016/j.ejc.2023.103889","title":"Additive structure in convex translates","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"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; University of British Columbia; Hungarian Scientific Research Fund","keywords":"Mathematics; Combinatorics; Conjecture; Regular polygon; Dimension (graph theory); Convex set; Set (abstract data type); Plane (geometry); Unit (ring theory); Convex body; Convex hull; Convex optimization; Geometry; Computer science","score_opus":0.02771948999840225,"score_gpt":0.27908899418573946,"score_spread":0.2513695041873372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389590920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98884565,0.00023152312,0.00021837647,0.00017433877,0.0014330113,0.00007964517,0.000019729398,0.00004468202,0.008953051],"genre_scores_gemma":[0.99908525,0.00013039676,0.000361088,0.00005286885,0.00013071124,1.7485111e-7,0.0000019023947,0.00004186444,0.00019575557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983441,0.00046970922,0.0005475141,0.00010274041,0.00031457897,0.00022135163],"domain_scores_gemma":[0.99882764,0.00045147518,0.00030699815,0.00017290351,0.00015193339,0.00008902419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011146222,0.0001480797,0.00031271056,0.00032265083,0.00008478403,0.000025453493,0.00038863107,0.0000384526,0.00008794277],"category_scores_gemma":[0.00039599897,0.000114308044,0.00012832152,0.00057890225,0.000069932285,0.00011372284,0.00005948635,0.0005063055,0.0000097422835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012159644,0.00009844234,0.0027202526,0.00009312993,0.00014332042,0.002512005,0.009934354,0.000036009318,0.00041240317,0.95863664,0.015343575,0.009948299],"study_design_scores_gemma":[0.0014137712,0.00022085168,0.011414164,0.0001018898,0.000029805267,0.000113897266,0.0004715111,0.000030488603,0.00059043727,0.973231,0.012211774,0.00017036898],"about_ca_topic_score_codex":1.8026742e-7,"about_ca_topic_score_gemma":4.5169492e-7,"teacher_disagreement_score":0.014594428,"about_ca_system_score_codex":0.0000272357,"about_ca_system_score_gemma":0.000027385484,"threshold_uncertainty_score":0.46613467},"labels":[],"label_agreement":null},{"id":"W4389591199","doi":"10.1016/j.ejc.2023.103910","title":"On the intersection density of the Kneser graph <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e2044\" altimg=\"si19.svg\"> <mml:mrow> <mml:mi>K</mml:mi> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>n</mml:mi> <mml:mo>,</mml:mo> <mml:mn>3</mml:mn> <mml:mo>)</mml:mo> </mml:mrow> </mml:mrow> </mml:math>","year":2023,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Automorphism; Automorphism group; Vertex (graph theory); Graph; Intersection (aeronautics); Discrete mathematics","score_opus":0.01993996439892176,"score_gpt":0.23828513346462318,"score_spread":0.21834516906570142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389591199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8368333,0.0014001689,0.0012192405,0.0010845145,0.0095567405,0.00013518664,0.00042937943,0.00036231457,0.14897913],"genre_scores_gemma":[0.98856187,0.0023037796,0.0011536938,0.0020858988,0.0031790717,0.00032237702,0.00040815832,0.0014988565,0.00048628007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98237956,0.0023579998,0.004307962,0.0023523767,0.0051864646,0.0034156665],"domain_scores_gemma":[0.9834909,0.004299232,0.0060487846,0.0036749053,0.00081797986,0.0016682149],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0076341624,0.001815348,0.00092296855,0.0011853913,0.0036643043,0.0020722095,0.005453783,0.0025096985,0.026739024],"category_scores_gemma":[0.005300733,0.002537936,0.004339672,0.0030444204,0.0031613682,0.001894737,0.004287975,0.005184057,0.001801962],"study_design_candidate":"bench_or_experimental","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.0021862886,0.00074147043,0.000043408614,0.0014551794,0.0030252007,0.0021036246,0.004593774,0.001419844,0.0018329755,0.7974557,0.1834597,0.0016827891],"study_design_scores_gemma":[0.0067196945,0.007217541,0.00066922576,0.005599709,0.006332204,0.007506102,0.009125729,0.045845482,0.8544618,0.0405729,0.0113794245,0.00457022],"about_ca_topic_score_codex":0.0005000062,"about_ca_topic_score_gemma":0.00036459332,"teacher_disagreement_score":0.85262877,"about_ca_system_score_codex":0.00007307247,"about_ca_system_score_gemma":0.0015485819,"threshold_uncertainty_score":0.99992716},"labels":[],"label_agreement":null},{"id":"W4389899308","doi":"10.1016/j.ejc.2023.103908","title":"Reconfiguration of vertex colouring and forbidden induced subgraphs","year":2023,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Induced subgraph; Bound graph; Graph power; Discrete mathematics; Line graph","score_opus":0.03411597351799357,"score_gpt":0.2729934213049364,"score_spread":0.23887744778694286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389899308","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9798328,0.00013850832,0.016057935,0.0002484863,0.00056705694,0.00006831474,4.9249564e-7,0.000036703917,0.0030496966],"genre_scores_gemma":[0.9990423,0.0001528814,0.00066824956,0.000014342586,0.000018879306,2.8640963e-7,2.590712e-7,0.0000129638,0.0000898812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857825,0.00038636016,0.00038292605,0.00011853542,0.00035645114,0.00017748824],"domain_scores_gemma":[0.99879396,0.00022219941,0.00032467913,0.00022970566,0.00031708647,0.00011237278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020791667,0.00008101767,0.00017202519,0.00043342603,0.00007713411,0.000057725236,0.0006486357,0.000017206496,0.0000022600864],"category_scores_gemma":[0.0002820137,0.00007461187,0.000059131162,0.0010045837,0.000042771833,0.00046238894,0.0001752575,0.00024284997,0.000011303063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109065506,0.00014874747,0.005802916,0.0001020902,0.000117206444,0.00086272793,0.0030142693,0.00012040427,0.055338062,0.84131855,0.0017057145,0.09136023],"study_design_scores_gemma":[0.005467895,0.004796543,0.19288026,0.00044115368,0.00003662723,0.0005364577,0.0006641218,0.0064555355,0.060597572,0.7233993,0.004048113,0.00067643943],"about_ca_topic_score_codex":3.5207293e-7,"about_ca_topic_score_gemma":1.5556193e-7,"teacher_disagreement_score":0.18707733,"about_ca_system_score_codex":0.000019915327,"about_ca_system_score_gemma":0.000046747875,"threshold_uncertainty_score":0.30425838},"labels":[],"label_agreement":null},{"id":"W4390833619","doi":"10.1016/j.ejc.2025.104316","title":"Bounded degree graphs and hypergraphs with no full rainbow matchings","year":2025,"lang":"en","type":"preprint","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo; Austrian Science Fund","keywords":"Rainbow; Combinatorics; Matching (statistics); Degree (music); Colored; Mathematics; Generalization; Bounded function; Class (philosophy); Enhanced Data Rates for GSM Evolution; Hypergraph; Discrete mathematics; Computer science; Artificial intelligence; Physics","score_opus":0.029749260496819318,"score_gpt":0.2611861623233053,"score_spread":0.23143690182648602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390833619","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9070899,0.0021566232,0.0026017737,0.0002791671,0.0049873395,0.00041848034,0.000037287995,0.00012233885,0.08230712],"genre_scores_gemma":[0.9812385,0.0010117517,0.01571576,0.00021543066,0.00017659273,0.000001922927,0.0000035679182,0.000115735136,0.0015207842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996709,0.00081286614,0.0010470039,0.00037472378,0.0006991648,0.0003572338],"domain_scores_gemma":[0.9961627,0.00051880034,0.0014949742,0.00073206663,0.00084240426,0.00024904983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022646554,0.00057336927,0.0009700748,0.00058787013,0.0003400633,0.00023115415,0.0010912201,0.00015893484,0.000020187545],"category_scores_gemma":[0.00047977138,0.00041664235,0.00038526862,0.00030515192,0.0002883724,0.00012203983,0.0010126062,0.002068996,0.0000022032368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045193246,0.00019643853,0.0009895364,0.0010745907,0.0008746228,0.0007588739,0.0024047224,0.000009433979,0.000024310537,0.98355263,0.0075051375,0.0021577484],"study_design_scores_gemma":[0.0017265987,0.00062716287,0.001356798,0.0011467624,0.00043170532,0.00046527805,0.00013425524,0.0000131678535,0.00002602191,0.98713195,0.0064596287,0.00048069374],"about_ca_topic_score_codex":0.0000016296502,"about_ca_topic_score_gemma":8.9936395e-7,"teacher_disagreement_score":0.08078634,"about_ca_system_score_codex":0.00006153896,"about_ca_system_score_gemma":0.00017813704,"threshold_uncertainty_score":0.9998285},"labels":[],"label_agreement":null},{"id":"W4391055591","doi":"10.1016/j.ejc.2024.103926","title":"Exact values and improved bounds on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e2259\" altimg=\"si125.svg\"><mml:mi>k</mml:mi></mml:math>-neighborly families of boxes","year":2024,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Institute for Basic Science","keywords":"Mathematics; Combinatorics","score_opus":0.013248280040866227,"score_gpt":0.22916540398566357,"score_spread":0.21591712394479734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391055591","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99031556,0.0025921715,0.0022608025,0.00033316526,0.0021985914,0.000029118772,0.000010589328,0.0001076487,0.0021523398],"genre_scores_gemma":[0.9965387,0.0008647668,0.0020822247,0.00023411534,0.00010426828,0.0000029822759,0.0000056160857,0.000071262584,0.00009604005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746746,0.00021260172,0.000804538,0.00039585217,0.00073540985,0.00038414405],"domain_scores_gemma":[0.9980406,0.0003718441,0.00059207523,0.0005713201,0.00017896813,0.00024515865],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016839523,0.00027412796,0.0002529907,0.00026957164,0.00028579673,0.0005795503,0.0008244034,0.000105319756,0.0000035277528],"category_scores_gemma":[0.00024137142,0.0002612583,0.00028163413,0.00045514695,0.0002231875,0.00058428635,0.00042123513,0.00058942335,0.00009135978],"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.000054961314,0.00014485985,0.000019244848,0.00017936324,0.00014216937,0.00045844528,0.0010692538,0.00013758385,0.0022403782,0.9918916,0.0008515163,0.002810573],"study_design_scores_gemma":[0.0015354336,0.0042784764,0.0005147637,0.001446311,0.00024323384,0.0007796777,0.00038542572,0.93830293,0.008241958,0.03664614,0.0070294472,0.0005961865],"about_ca_topic_score_codex":0.000016680226,"about_ca_topic_score_gemma":0.0000012241753,"teacher_disagreement_score":0.9552455,"about_ca_system_score_codex":0.00001328129,"about_ca_system_score_gemma":0.00020944251,"threshold_uncertainty_score":0.99998397},"labels":[],"label_agreement":null},{"id":"W4399559849","doi":"10.1016/j.ejc.2024.104004","title":"Corrigendum to “Describing quasi-graphic matroids” [European J. Combin. 85 (2020) 103062]","year":2024,"lang":"en","type":"erratum","venue":"European Journal of Combinatorics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Douglas College","funders":"","keywords":"Matroid; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.029147713484708373,"score_gpt":0.2449687663328516,"score_spread":0.21582105284814324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399559849","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007547323,0.012318944,0.34740353,0.0029398792,0.16110238,0.00043919327,0.000029001209,0.001623293,0.4740683],"genre_scores_gemma":[0.22104536,0.004388487,0.07988401,0.004912682,0.009867373,0.000014332006,0.00010590104,0.0024847912,0.67729706],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9922219,0.0014166874,0.0022514637,0.0011130455,0.0019593532,0.0010375456],"domain_scores_gemma":[0.9939008,0.00007677615,0.0018163297,0.0018326183,0.0014504687,0.0009230106],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0046428256,0.0010830078,0.0012782698,0.0016623575,0.00028705673,0.0042631943,0.008585733,0.00018047073,0.000014622059],"category_scores_gemma":[0.000624586,0.0010232662,0.00081298494,0.0027058334,0.00020826413,0.001652877,0.003077238,0.0042520794,0.0011713736],"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.000012292225,0.00030409876,0.000008464684,0.00026727095,0.00013240897,0.008882632,0.000503397,0.0000020090479,0.000073934294,0.019077435,0.94940627,0.0213298],"study_design_scores_gemma":[0.00048816003,0.0022601122,0.00010665017,0.004000907,0.00015395049,0.0017910961,0.000055146058,0.00035952256,0.00011796254,0.024967562,0.96437836,0.0013206005],"about_ca_topic_score_codex":0.0000020730313,"about_ca_topic_score_gemma":5.133256e-7,"teacher_disagreement_score":0.2675195,"about_ca_system_score_codex":0.0003977047,"about_ca_system_score_gemma":0.00071485015,"threshold_uncertainty_score":0.9996063},"labels":[],"label_agreement":null},{"id":"W4400089379","doi":"10.1016/j.ejc.2024.104019","title":"Asymptotics of local face distributions and the face distribution of the complete graph","year":2024,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Conjugacy class; Distribution (mathematics); Graph; Discrete mathematics; Mathematical analysis","score_opus":0.023985376791887558,"score_gpt":0.26487086576783136,"score_spread":0.2408854889759438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400089379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18567051,0.0017027085,0.8084761,0.00096086337,0.0019596873,0.00033109917,0.00014115642,0.000032680142,0.0007252319],"genre_scores_gemma":[0.99924296,0.00015047811,0.00044391892,0.0000074813706,0.000054271848,8.253155e-7,0.000002987393,0.000035562076,0.00006152435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972676,0.00068864576,0.0010990301,0.00012245616,0.00062642724,0.00019584458],"domain_scores_gemma":[0.9964595,0.0016213309,0.0009106646,0.00045359292,0.00047236448,0.00008259161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019608713,0.00020403868,0.0005038096,0.000057903315,0.00014543082,0.000048429574,0.0006636004,0.00004137863,0.0000032686871],"category_scores_gemma":[0.0012577531,0.00011670277,0.00030404874,0.00064814015,0.0007520716,0.00013010882,0.00026622662,0.00056268345,0.000002382459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038787264,0.00013742258,0.000036470192,0.00027279265,0.0001239559,0.000013583106,0.00078950817,0.00011449337,0.000114326096,0.99678564,0.001187266,0.00038573475],"study_design_scores_gemma":[0.0018696234,0.0002649084,0.0006465786,0.0006785299,0.00038469108,0.00017505208,0.0011321834,0.0012089759,0.0016745396,0.9885286,0.0032716838,0.00016460482],"about_ca_topic_score_codex":6.723227e-7,"about_ca_topic_score_gemma":2.2251712e-7,"teacher_disagreement_score":0.81357247,"about_ca_system_score_codex":0.00008742334,"about_ca_system_score_gemma":0.00008110715,"threshold_uncertainty_score":0.47590008},"labels":[],"label_agreement":null},{"id":"W4401748186","doi":"10.1016/j.ejc.2024.104043","title":"The Nash-Williams orientation theorem for graphs with countably many ends","year":2024,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Orientation (vector space); Discrete mathematics; Geometry","score_opus":0.014185230573488274,"score_gpt":0.27121071112808504,"score_spread":0.2570254805545968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401748186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015209193,0.0020532524,0.9743382,0.0010500938,0.0021442848,0.00019610829,0.0000028682475,0.00007670385,0.0049293092],"genre_scores_gemma":[0.9939936,0.00035151496,0.0044331728,0.00006885029,0.00010316267,0.0000039324673,8.230841e-7,0.000043133852,0.00100181],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802154,0.00041194042,0.0003776422,0.0002073656,0.0006637492,0.00031776342],"domain_scores_gemma":[0.9979408,0.0007586202,0.0002054771,0.00039009887,0.0005757988,0.0001292561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003453498,0.00014673051,0.00014602105,0.0002033673,0.0003459809,0.00060474244,0.0013762503,0.000015135744,0.0000021366955],"category_scores_gemma":[0.00012135641,0.00008511957,0.00012735165,0.0009857286,0.00015143206,0.0007118147,0.00011196805,0.00038472313,0.000015479076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000726242,0.000029197017,0.00007744909,0.000019340225,0.000054647844,0.00018951367,0.0004031341,0.000059652542,0.00012197521,0.9763224,0.0014149563,0.0212351],"study_design_scores_gemma":[0.0011931527,0.0020842925,0.0005676111,0.00016299025,0.00002953308,0.00042075376,0.0002473578,0.0033054324,0.00099944,0.8266323,0.1641202,0.00023694473],"about_ca_topic_score_codex":1.3164023e-7,"about_ca_topic_score_gemma":2.0674402e-7,"teacher_disagreement_score":0.9787844,"about_ca_system_score_codex":0.000072739305,"about_ca_system_score_gemma":0.00012347511,"threshold_uncertainty_score":0.58315456},"labels":[],"label_agreement":null},{"id":"W4402445191","doi":"10.1016/j.ejc.2024.104057","title":"All 3-transitive groups satisfy the strict-Erdős–Ko–Rado property","year":2024,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Transitive relation; Property (philosophy); Discrete mathematics","score_opus":0.07445873035584656,"score_gpt":0.3193599088458863,"score_spread":0.24490117849003973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402445191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6744898,0.00804313,0.04343438,0.016189294,0.007816641,0.0017080535,0.00006357771,0.000547655,0.24770749],"genre_scores_gemma":[0.995684,0.00027323805,0.0005303556,0.00017676712,0.00044011537,0.0000020352118,0.0000016361304,0.00012847056,0.0027633612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951937,0.0022498292,0.00083924143,0.00022921604,0.0010361321,0.00045187745],"domain_scores_gemma":[0.996501,0.0020945256,0.00026228582,0.00046730996,0.00045597108,0.00021885269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076818354,0.00027568644,0.000371563,0.00027173167,0.00017372193,0.0003440935,0.0010309013,0.00004843956,0.00009728511],"category_scores_gemma":[0.0012395582,0.00014339159,0.00025073,0.000759606,0.00018055805,0.00032777342,0.0001823663,0.00149913,0.0002506304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029453344,0.00044926588,0.00016915968,0.00041393732,0.0006826025,0.005706079,0.008437877,0.000013512446,0.0013042457,0.8553927,0.11543299,0.011703088],"study_design_scores_gemma":[0.0023362779,0.0026462036,0.002678854,0.0009806247,0.00045451356,0.0019914985,0.0016644861,0.0008989788,0.00075047475,0.68906415,0.2958019,0.0007320224],"about_ca_topic_score_codex":0.0000016217705,"about_ca_topic_score_gemma":6.077644e-7,"teacher_disagreement_score":0.32119423,"about_ca_system_score_codex":0.00019554235,"about_ca_system_score_gemma":0.00018872715,"threshold_uncertainty_score":0.65130574},"labels":[],"label_agreement":null},{"id":"W4402732438","doi":"10.1016/j.ejc.2024.104072","title":"Induced subdivisions with pinned branch vertices","year":2024,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Mathematics; Combinatorics; Subdivision","score_opus":0.023751553805502992,"score_gpt":0.2766314345661225,"score_spread":0.2528798807606195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402732438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37497544,0.0019813452,0.6091446,0.0015065328,0.0017243149,0.00010306964,8.57414e-7,0.00015931274,0.010404486],"genre_scores_gemma":[0.9973592,0.00007071982,0.002204216,0.000063929794,0.0000791089,4.109862e-7,1.7035524e-7,0.000030124882,0.00019208928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979637,0.0005214357,0.00035327915,0.00020699986,0.0006728083,0.00028176414],"domain_scores_gemma":[0.99860156,0.00029777797,0.00013307165,0.000403204,0.00034518662,0.00021922939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016486092,0.00013963062,0.00018391378,0.00037626678,0.00012333892,0.00039197062,0.0014292136,0.00001635903,0.000010010012],"category_scores_gemma":[0.00014394661,0.00009919076,0.00008915683,0.0013891329,0.00005757174,0.0010239002,0.0002232837,0.0006066751,0.000086695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007437974,0.00019721848,0.00040849508,0.00006422544,0.00014129264,0.004017182,0.0013915722,0.000121918165,0.0055444916,0.92795956,0.0016213119,0.05845833],"study_design_scores_gemma":[0.0072195316,0.01621699,0.027929824,0.0026603458,0.0001579526,0.0046339235,0.00034519212,0.011677576,0.024054788,0.7267916,0.17628525,0.0020269863],"about_ca_topic_score_codex":2.468096e-7,"about_ca_topic_score_gemma":1.4515209e-7,"teacher_disagreement_score":0.6223838,"about_ca_system_score_codex":0.000050491464,"about_ca_system_score_gemma":0.00015224206,"threshold_uncertainty_score":0.40448818},"labels":[],"label_agreement":null},{"id":"W4402779380","doi":"10.1016/j.ejc.2024.104074","title":"Induced subgraphs and tree decompositions XIV. Non-adjacent neighbours in a hole","year":2024,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada; Alfred P. Sloan Foundation; Ministry of Colleges and Universities; National Science Foundation","keywords":"Mathematics; Combinatorics; Tree (set theory)","score_opus":0.01722149256355198,"score_gpt":0.2757203212955558,"score_spread":0.2584988287320038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402779380","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8298609,0.0030332364,0.15697224,0.0020529334,0.0014273901,0.00015692187,0.0000016618575,0.000069265974,0.0064254194],"genre_scores_gemma":[0.9969271,0.00030038247,0.002576516,0.000056184323,0.000046021734,8.948798e-7,2.8777163e-7,0.000024130795,0.00006852033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982012,0.00045488324,0.00042098342,0.00022948162,0.00039477443,0.0002986975],"domain_scores_gemma":[0.99900055,0.00021631009,0.00011468622,0.0002915704,0.0001477209,0.00022918521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001295219,0.00014476995,0.00020613051,0.00077597756,0.000088461886,0.00030902782,0.00083222723,0.000022991946,0.0000040338614],"category_scores_gemma":[0.00006614914,0.0001289441,0.0000985046,0.0013771799,0.00006336052,0.00068793126,0.00025729815,0.0006697772,0.000024716375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006891309,0.00052710157,0.003877666,0.000092447444,0.000103811166,0.00806039,0.0034346343,0.00024100346,0.013347379,0.8867512,0.0015064706,0.081989],"study_design_scores_gemma":[0.008496378,0.005203549,0.1673248,0.0022389092,0.000081191305,0.0027601353,0.0006544713,0.031437363,0.009111471,0.7501391,0.020863656,0.0016889623],"about_ca_topic_score_codex":6.0913464e-7,"about_ca_topic_score_gemma":0.0000012639281,"teacher_disagreement_score":0.16706613,"about_ca_system_score_codex":0.00007948022,"about_ca_system_score_gemma":0.00009919643,"threshold_uncertainty_score":0.52581877},"labels":[],"label_agreement":null},{"id":"W4405806035","doi":"10.1016/j.ejc.2024.104104","title":"On heroes in digraphs with forbidden induced forests","year":2024,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"H2020 European Research Council; Natural Sciences and Engineering Research Council of Canada; Ministry of Colleges and Universities; Grantová Agentura České Republiky","keywords":"Mathematics; Combinatorics; Digraph","score_opus":0.01995709647949996,"score_gpt":0.27270917631230945,"score_spread":0.2527520798328095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405806035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90723234,0.0005962159,0.08279433,0.00051731453,0.0007752892,0.00010824727,4.6302043e-7,0.00006786396,0.00790796],"genre_scores_gemma":[0.9988308,0.00003583232,0.00089724077,0.000039698265,0.000038413924,7.5723096e-7,1.3017414e-7,0.00002940542,0.00012774255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981886,0.0004081913,0.00033270655,0.00020306252,0.00058721646,0.00028022192],"domain_scores_gemma":[0.9989505,0.00030867636,0.00011387541,0.000338035,0.00014489469,0.00014404605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014658555,0.0001409553,0.00018029181,0.00067759684,0.000049804283,0.00022892219,0.0011361369,0.00001759192,0.000003355013],"category_scores_gemma":[0.0001121529,0.00009964357,0.000079290454,0.0013995926,0.000043512126,0.0006354069,0.00013514279,0.0006761855,0.000033412878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008197891,0.0001376971,0.0019488911,0.000030241794,0.000038436672,0.0059750327,0.00082946697,0.00024278036,0.00019603112,0.97287095,0.0004928732,0.01715564],"study_design_scores_gemma":[0.0026485,0.006900024,0.030536827,0.0012635547,0.000013123268,0.0007310173,0.00015052459,0.0022266835,0.0017264134,0.94810677,0.0051857037,0.0005108521],"about_ca_topic_score_codex":4.4256797e-7,"about_ca_topic_score_gemma":0.000002259046,"teacher_disagreement_score":0.091598466,"about_ca_system_score_codex":0.00007063302,"about_ca_system_score_gemma":0.00009757764,"threshold_uncertainty_score":0.4063347},"labels":[],"label_agreement":null},{"id":"W4407955310","doi":"10.1016/j.ejc.2025.104139","title":"Injective edge colorings of degenerate graphs and the oriented chromatic number","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Chromatic scale; Combinatorics; Injective function; Degenerate energy levels; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Physics","score_opus":0.008913040825824276,"score_gpt":0.25554163910575695,"score_spread":0.24662859827993266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407955310","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83032763,0.0013332738,0.14118004,0.0008821482,0.0007554458,0.00020918078,8.267897e-7,0.000028010434,0.025283456],"genre_scores_gemma":[0.9979866,0.00014090909,0.0014321915,0.00007579339,0.000007856326,0.0000010180851,6.534467e-8,0.00000905218,0.00034649073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979508,0.0009825936,0.00044885033,0.00012949122,0.00031806732,0.00017019824],"domain_scores_gemma":[0.9981766,0.00050718954,0.00037727066,0.00031338743,0.0005516264,0.000073936055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023778428,0.00010941796,0.00026410725,0.00019811702,0.00014327894,0.000058683323,0.00090600335,0.000013800326,0.000002573997],"category_scores_gemma":[0.00041207383,0.00007272435,0.00009207747,0.0012228544,0.00033449265,0.00027658461,0.00037805765,0.00032892355,0.0000041307485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091738846,0.000059321836,0.0018217551,0.000022990956,0.00007250471,0.000044180848,0.0006677005,0.000023223223,0.00023329163,0.9953012,0.00030720382,0.0013548859],"study_design_scores_gemma":[0.008413475,0.0007271783,0.017229822,0.0003069718,0.00006776194,0.00022965838,0.00033236356,0.0013971948,0.008673759,0.9562237,0.0061471737,0.0002509219],"about_ca_topic_score_codex":0.0000029311698,"about_ca_topic_score_gemma":5.465883e-7,"teacher_disagreement_score":0.167659,"about_ca_system_score_codex":0.0000424347,"about_ca_system_score_gemma":0.00013049676,"threshold_uncertainty_score":0.29656133},"labels":[],"label_agreement":null},{"id":"W4409202377","doi":"10.1016/j.ejc.2025.104159","title":"Thresholds for constrained Ramsey and anti-Ramsey problems","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Limits and Structures in Graph Theory","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 Victoria","funders":"H2020 European Research Council; Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences; Royal Society; Alexander von Humboldt-Stiftung","keywords":"Ramsey's theorem; Mathematics; Ramsey theory; Combinatorics; Graph","score_opus":0.026686812007090926,"score_gpt":0.2846851732435496,"score_spread":0.25799836123645864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409202377","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91471654,0.0017530738,0.034680713,0.00075686036,0.0029067614,0.0005075311,0.000013163052,0.000059046914,0.044606283],"genre_scores_gemma":[0.996031,0.00013607321,0.003034496,0.0001594436,0.00009167987,9.4199214e-7,6.326411e-7,0.000030335723,0.00051539764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986441,0.00021747431,0.0006088004,0.00013066226,0.00019229861,0.00020662589],"domain_scores_gemma":[0.9984609,0.0004910906,0.00040575425,0.00021478186,0.0003311747,0.00009629114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018317777,0.00016914755,0.00037092646,0.0001773876,0.00022146336,0.000075339805,0.0003381919,0.0000456863,0.00000787591],"category_scores_gemma":[0.00063376414,0.00012990067,0.00014536947,0.00019007923,0.00015716552,0.00009894679,0.000114985436,0.00029882748,4.8201036e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043605363,0.000086595755,0.0018014426,0.00021408996,0.00013870788,0.000037635233,0.00048649166,0.0000054291095,0.00020050825,0.98863906,0.0057978486,0.0025485887],"study_design_scores_gemma":[0.0026423146,0.00032429164,0.0016803581,0.0002438161,0.00012712681,0.00012729387,0.00015489565,0.000042632793,0.00024698523,0.97222733,0.022017045,0.0001659009],"about_ca_topic_score_codex":1.1707382e-7,"about_ca_topic_score_gemma":9.164957e-8,"teacher_disagreement_score":0.08131443,"about_ca_system_score_codex":0.000021862541,"about_ca_system_score_gemma":0.00005439726,"threshold_uncertainty_score":0.52971953},"labels":[],"label_agreement":null},{"id":"W4409220423","doi":"10.1016/j.ejc.2025.104158","title":"Grothendieck polynomials of inverse fireworks permutations","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","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":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Inverse; Fireworks; Pure mathematics; Geometry","score_opus":0.03177516236096998,"score_gpt":0.31859589228776686,"score_spread":0.28682072992679686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409220423","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54945165,0.0010124755,0.2991298,0.0021454673,0.009812774,0.00092552416,0.000018449504,0.00017426212,0.13732961],"genre_scores_gemma":[0.98718333,0.00006728654,0.01155374,0.00010286661,0.00010358788,0.0000014724537,5.667295e-7,0.000053712112,0.000933408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99739724,0.0004733934,0.0013639833,0.00012789787,0.00041491858,0.0002225577],"domain_scores_gemma":[0.9964066,0.0010495612,0.001323963,0.00044421147,0.0006632096,0.00011243411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015341359,0.00021191443,0.0006009605,0.00035331864,0.00009795785,0.000030900366,0.0006504499,0.000054343265,0.00003379563],"category_scores_gemma":[0.002923912,0.00019392207,0.00025444038,0.0006229948,0.00011068046,0.00019978474,0.0001431427,0.0004309725,0.00001302437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051685547,0.0004972702,0.00021504718,0.00023205271,0.0001592114,0.00007965285,0.00095976854,0.00005169108,0.0005269204,0.97915816,0.01738707,0.0006814961],"study_design_scores_gemma":[0.0019400817,0.0002958388,0.00021178875,0.00052557426,0.00018332686,0.000036683818,0.0004421358,0.00007537829,0.0025794453,0.98449725,0.0090331305,0.00017936474],"about_ca_topic_score_codex":4.4803187e-7,"about_ca_topic_score_gemma":2.2890552e-7,"teacher_disagreement_score":0.4377317,"about_ca_system_score_codex":0.0001230071,"about_ca_system_score_gemma":0.00016138205,"threshold_uncertainty_score":0.7907912},"labels":[],"label_agreement":null},{"id":"W4410371193","doi":"10.1016/j.ejc.2025.104174","title":"Sparsity of 3-flow-critical graphs","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Mathematics; Combinatorics; Flow (mathematics); Discrete mathematics; Geometry","score_opus":0.017855904037367868,"score_gpt":0.28922014670176716,"score_spread":0.2713642426643993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410371193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039317977,0.0009807665,0.9305494,0.0010399141,0.0016526231,0.000060115293,0.0000013504692,0.00003136343,0.026366483],"genre_scores_gemma":[0.98531234,0.00007235472,0.014322798,0.0000810906,0.000017769287,1.1824443e-7,9.2589715e-8,0.0000081469525,0.00018529929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979117,0.0007245026,0.00049990736,0.00014536345,0.0004837635,0.00023476026],"domain_scores_gemma":[0.9980416,0.00044177606,0.00019919412,0.00045407814,0.0007238259,0.0001395094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021691297,0.00010443511,0.0002525493,0.00043536653,0.00009097399,0.0000520528,0.0017344381,0.000018981726,0.000006331691],"category_scores_gemma":[0.0008131667,0.0000944104,0.00016165145,0.0011617074,0.00018727391,0.00037388568,0.00042656405,0.00042963336,0.000010292659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002807396,0.00017119729,0.001383813,0.000029572228,0.000028079616,0.00025284485,0.000098706856,0.000056387787,0.00033847752,0.9887106,0.0011900987,0.007712186],"study_design_scores_gemma":[0.0011515028,0.0006159185,0.0097477585,0.00017037855,0.000019952153,0.000081010214,0.000038318827,0.0010090126,0.0033247988,0.9752457,0.008439415,0.00015623146],"about_ca_topic_score_codex":1.7854293e-7,"about_ca_topic_score_gemma":4.3411518e-8,"teacher_disagreement_score":0.9459944,"about_ca_system_score_codex":0.00003398869,"about_ca_system_score_gemma":0.00010925927,"threshold_uncertainty_score":0.38499445},"labels":[],"label_agreement":null},{"id":"W4411869800","doi":"10.1016/j.ejc.2025.104203","title":"Patterns in multi-dimensional permutations","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; Youth Innovation Promotion Association; Chinese Academy of Sciences; National Natural Science Foundation of China; Canadian Anesthesiologists' Society","keywords":"Mathematics; Combinatorics","score_opus":0.050360747265578286,"score_gpt":0.33731093005528606,"score_spread":0.2869501827897078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411869800","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77808434,0.00029184663,0.20983319,0.00051572936,0.0035476605,0.0002654377,0.000004978377,0.00006113179,0.0073956833],"genre_scores_gemma":[0.9868449,0.000018821245,0.012276676,0.00007325402,0.00004434279,0.0000013836865,7.388383e-7,0.000039246694,0.0007006492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978361,0.00042263768,0.0010140127,0.00013363008,0.00036826497,0.00022536474],"domain_scores_gemma":[0.997972,0.00069876434,0.0005279163,0.000286388,0.00042529902,0.000089613946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012953987,0.00018271862,0.0003898847,0.0004112412,0.00007376957,0.000035486897,0.00044670698,0.000036058398,0.000020040385],"category_scores_gemma":[0.00175724,0.00016856962,0.00013531902,0.00052025967,0.000030784344,0.00017751429,0.00012712363,0.0004988505,0.000015718619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003655799,0.0012990664,0.0048193177,0.00016344884,0.00007234947,0.00057938194,0.000752761,0.00026222985,0.00024334849,0.98911625,0.0019757636,0.0006795056],"study_design_scores_gemma":[0.0044514304,0.00020296937,0.0079713315,0.00070639554,0.000069823574,0.00008245676,0.0003370617,0.0005514983,0.00042545935,0.9831829,0.0017686245,0.00025004],"about_ca_topic_score_codex":4.9574845e-7,"about_ca_topic_score_gemma":0.0000012557371,"teacher_disagreement_score":0.20876054,"about_ca_system_score_codex":0.00017494062,"about_ca_system_score_gemma":0.00011748833,"threshold_uncertainty_score":0.68740696},"labels":[],"label_agreement":null},{"id":"W4412656973","doi":"10.1016/j.ejc.2025.104224","title":"Stability properties for subgroups generated by return words","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","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":"Université de Moncton","funders":"","keywords":"Mathematics; Combinatorics; Stability (learning theory)","score_opus":0.019218019895092715,"score_gpt":0.22186009486592484,"score_spread":0.20264207497083211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412656973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3646606,0.003255025,0.6250712,0.0014960092,0.0024263035,0.00018088837,0.0000043705404,0.000097292796,0.002808307],"genre_scores_gemma":[0.99649906,0.000057415185,0.0024237323,0.00035525655,0.00006572462,0.0000015246857,0.0000012117392,0.000015679494,0.0005803844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982383,0.0004897712,0.0005784362,0.00020007616,0.00025346677,0.00023989685],"domain_scores_gemma":[0.9985778,0.00012721789,0.00031636286,0.00041881873,0.00046213658,0.0000977017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024775816,0.0001533882,0.00025878052,0.00011295862,0.00014985524,0.00023457265,0.0012848842,0.000027220585,0.0000047560347],"category_scores_gemma":[0.000259428,0.000118339296,0.00013249344,0.00049539626,0.000056831854,0.00040819935,0.00019174916,0.00024019397,0.0000038689072],"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.000385463,0.001619259,0.0032265352,0.00039026348,0.00038850718,0.00021158221,0.003637007,0.00006650363,0.1033693,0.5929585,0.21476763,0.07897941],"study_design_scores_gemma":[0.01186542,0.003823919,0.005378457,0.000967735,0.00019163363,0.00020944419,0.0009057194,0.04901117,0.30186263,0.18528014,0.43872464,0.0017790903],"about_ca_topic_score_codex":6.4745177e-7,"about_ca_topic_score_gemma":1.16448874e-7,"teacher_disagreement_score":0.63183844,"about_ca_system_score_codex":0.0000857778,"about_ca_system_score_gemma":0.00012423604,"threshold_uncertainty_score":0.48257363},"labels":[],"label_agreement":null},{"id":"W4414661668","doi":"10.1016/j.ejc.2025.104246","title":"Growth rates of permutations with given descent or peak set","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"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; California State University","keywords":"Set (abstract data type); Descent (aeronautics); Growth rate; Enumeration; Permutation (music)","score_opus":0.05271141562145107,"score_gpt":0.3355684367525756,"score_spread":0.28285702113112454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414661668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61804754,0.00055137475,0.3445052,0.0016125364,0.0028473858,0.00081018225,0.000021316784,0.00013250244,0.03147194],"genre_scores_gemma":[0.9863935,0.000068409645,0.012350456,0.000032908007,0.00005657677,0.0000015605352,0.000001024945,0.00005820565,0.001037372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99772793,0.0004031078,0.001006563,0.0001374903,0.00049962394,0.00022531296],"domain_scores_gemma":[0.9958791,0.0009366834,0.0014101826,0.0003460753,0.0013130585,0.000114886425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009945023,0.00023244375,0.0005584687,0.00028076797,0.0001055814,0.000041110576,0.00057664956,0.000033101314,0.000022998574],"category_scores_gemma":[0.0024635573,0.0001640525,0.00013136773,0.0007548192,0.00011056176,0.00020192945,0.00011293327,0.00037437156,0.000006378795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031365608,0.000808387,0.0007072661,0.0006478995,0.0002842956,0.00032623243,0.001655709,0.000050435414,0.00035854586,0.98778397,0.006769648,0.00029392788],"study_design_scores_gemma":[0.0043186974,0.0014310277,0.0010416554,0.0013132027,0.00038251365,0.00019641456,0.0014164209,0.000058429847,0.0062996326,0.9798922,0.003329767,0.00032005625],"about_ca_topic_score_codex":3.928802e-7,"about_ca_topic_score_gemma":6.053732e-7,"teacher_disagreement_score":0.36834592,"about_ca_system_score_codex":0.00012209185,"about_ca_system_score_gemma":0.00025180005,"threshold_uncertainty_score":0.6689867},"labels":[],"label_agreement":null},{"id":"W4415216491","doi":"10.1016/j.ejc.2025.104265","title":"A perfect expansion property","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Topology and Set Theory","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 Toronto","funders":"","keywords":"Disjoint sets; Ergodicity; Automorphism; Property (philosophy); Class (philosophy); Automorphism group; Digraph","score_opus":0.025553300143675375,"score_gpt":0.3009681206046002,"score_spread":0.27541482046092486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415216491","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59107137,0.0014397869,0.12549643,0.0015179927,0.0037850898,0.00022186321,0.000001224357,0.00010226864,0.27636397],"genre_scores_gemma":[0.9899164,0.0000727008,0.001761746,0.0001735734,0.00006698349,3.2866478e-7,1.9114407e-7,0.00002001997,0.007988065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854386,0.0006471066,0.00042602915,0.0000877731,0.00014939709,0.00014583675],"domain_scores_gemma":[0.99895895,0.00029158092,0.0002608195,0.00021059623,0.00021983925,0.00005819708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001494502,0.00011204763,0.00024448676,0.00013765266,0.00011355975,0.000014125168,0.00030052842,0.000028427883,0.00003526989],"category_scores_gemma":[0.00093701156,0.0000693587,0.00011343523,0.00019933574,0.000071883485,0.00010948376,0.00007318774,0.0003884384,0.000021320659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019543698,0.0003806162,0.000537382,0.000087221684,0.00009413886,0.00052485423,0.0005945731,0.000011014105,0.00090067595,0.961964,0.02256213,0.012147932],"study_design_scores_gemma":[0.0016000808,0.00048220248,0.0006584667,0.00023014323,0.00007846712,0.0001636709,0.0002525664,0.000021348465,0.0015390506,0.93177015,0.06305893,0.00014493788],"about_ca_topic_score_codex":8.9751e-8,"about_ca_topic_score_gemma":7.5184246e-8,"teacher_disagreement_score":0.39884502,"about_ca_system_score_codex":0.000045464276,"about_ca_system_score_gemma":0.00006861562,"threshold_uncertainty_score":0.28283656},"labels":[],"label_agreement":null},{"id":"W4415246310","doi":"10.1016/j.ejc.2025.104263","title":"Topological dynamics of Polish group extensions","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Topology and Set 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":"University of Waterloo","funders":"National Science Foundation","keywords":"Metrization theorem; Topological dynamics; Group (periodic table); Sequence (biology); Dynamics (music)","score_opus":0.02253913648133697,"score_gpt":0.3071200168256716,"score_spread":0.2845808803443346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415246310","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61654454,0.000942801,0.242913,0.0017808067,0.0032312553,0.00014144654,0.000009418184,0.00005861939,0.13437814],"genre_scores_gemma":[0.9942276,0.00009884176,0.004173445,0.00014791451,0.000048167363,1.7209209e-7,9.56614e-7,0.00001539347,0.0012875074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983758,0.00055435253,0.0006516806,0.00009146616,0.00015985461,0.00016685968],"domain_scores_gemma":[0.9982564,0.00066513085,0.00047060678,0.00024338708,0.00029329554,0.000071220726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012094638,0.000118070544,0.00036690704,0.00016698721,0.00008778218,0.0000073823785,0.000390967,0.00005167898,0.000041343774],"category_scores_gemma":[0.0014144485,0.00009469227,0.00015973745,0.00025529292,0.0002156528,0.0000804301,0.00012405551,0.00043950518,0.0000041513144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006092396,0.00027651424,0.00057274196,0.000027133488,0.000050322946,0.00016304843,0.00009215824,0.0000065447143,0.000074522206,0.99582136,0.0018528138,0.0010019356],"study_design_scores_gemma":[0.00078919437,0.00032922032,0.0020685738,0.00009012887,0.0000683844,0.0000918421,0.00037508106,0.000038492057,0.00011085385,0.9934933,0.002461449,0.000083454725],"about_ca_topic_score_codex":2.5744296e-7,"about_ca_topic_score_gemma":6.4621264e-7,"teacher_disagreement_score":0.37768307,"about_ca_system_score_codex":0.000056881643,"about_ca_system_score_gemma":0.0000392129,"threshold_uncertainty_score":0.38614386},"labels":[],"label_agreement":null},{"id":"W4416623009","doi":"10.1016/j.ejc.2025.104285","title":"Interval hypergraphic lattices","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Departament de Recerca i Universitats, Generalitat de Catalunya; Natural Sciences and Engineering Research Council of Canada; Agencia Estatal de Investigación; Ministerio de Ciencia, Innovación y Universidades; Austrian Science Fund; Agence Nationale de la Recherche; Deutsche Forschungsgemeinschaft","keywords":"","score_opus":0.054130558609935875,"score_gpt":0.34355556475210886,"score_spread":0.289425006142173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416623009","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76181847,0.0017213881,0.005462468,0.001844345,0.0053415047,0.000040283427,0.0000013342589,0.000021712838,0.22374852],"genre_scores_gemma":[0.995043,0.000062513645,0.00013671574,0.0004718761,0.00008850741,8.4969365e-8,1.1671484e-7,0.000009661738,0.00418752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965704,0.0013279739,0.0009439079,0.00015190993,0.0008450593,0.00016071128],"domain_scores_gemma":[0.9969994,0.00133984,0.00051035825,0.00036397524,0.0006723425,0.00011409501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009358491,0.000110899775,0.00029969824,0.00059120916,0.00012474532,0.00022846168,0.0014995049,0.000023387345,0.00008650923],"category_scores_gemma":[0.0039472915,0.00007660749,0.00024545233,0.0011176834,0.00011284343,0.0003084356,0.00018222391,0.00036899542,0.00018896414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020529359,0.00034032256,0.024233716,0.000016280912,0.00012727371,0.00073048717,0.0008677915,0.00008001672,0.00030029935,0.8491122,0.07523455,0.048751757],"study_design_scores_gemma":[0.0011186061,0.0003775092,0.039882507,0.00011123573,0.00003841976,0.00006798401,0.00067010534,0.00004660813,0.00021669066,0.6727972,0.2845321,0.00014103368],"about_ca_topic_score_codex":2.2105931e-7,"about_ca_topic_score_gemma":2.2143622e-7,"teacher_disagreement_score":0.23322456,"about_ca_system_score_codex":0.000024406085,"about_ca_system_score_gemma":0.00007707224,"threshold_uncertainty_score":0.47255617},"labels":[],"label_agreement":null},{"id":"W636225799","doi":"10.1016/j.ejc.2015.03.026","title":"The number of lines in a matroid with no <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>U</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math>-minor","year":2015,"lang":"lv","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research","keywords":"Matroid; Mathematics; Prime power; Combinatorics; Rank (graph theory); Prime (order theory); Discrete mathematics; Oriented matroid; Graphic matroid","score_opus":0.02048945282311033,"score_gpt":0.25401326868118757,"score_spread":0.23352381585807724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W636225799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.598637,0.0023348797,0.0030742288,0.00093348045,0.004427628,0.000058792793,0.00015822919,0.00016180781,0.39021397],"genre_scores_gemma":[0.9883235,0.001999511,0.0044948775,0.00095895963,0.0021942288,0.000263942,0.00019775344,0.00096292276,0.0006042884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98566765,0.0016567261,0.003027767,0.0018241223,0.0047484245,0.0030753224],"domain_scores_gemma":[0.9875462,0.002626534,0.00403225,0.003089683,0.00081710005,0.0018882072],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["research_integrity","insufficient_payload"],"category_scores_codex":[0.0065127104,0.0011002288,0.0005385037,0.00086167565,0.0016991402,0.0021719038,0.0055221063,0.0013138809,0.078896336],"category_scores_gemma":[0.0035862543,0.001795146,0.001943067,0.0026631926,0.0025430988,0.0025896472,0.0036457225,0.0033261185,0.0022450862],"study_design_candidate":"bench_or_experimental","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.0036647937,0.0007052643,0.00010306881,0.0009002884,0.0015191247,0.0052020806,0.002812205,0.0027463573,0.0012042462,0.73653734,0.24196395,0.002641244],"study_design_scores_gemma":[0.006108374,0.0063130474,0.00032057037,0.002764534,0.0012871234,0.0062538083,0.002676796,0.043774284,0.9145708,0.00233842,0.0110952975,0.0024969282],"about_ca_topic_score_codex":0.00043441658,"about_ca_topic_score_gemma":0.0004057671,"teacher_disagreement_score":0.91336656,"about_ca_system_score_codex":0.000037212776,"about_ca_system_score_gemma":0.002737841,"threshold_uncertainty_score":0.9999826},"labels":[],"label_agreement":null},{"id":"W7081942273","doi":"10.1016/j.ejc.2025.104235","title":"Odd-Ramsey numbers of complete bipartite graphs","year":2025,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Geochemistry and Geologic Mapping","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":"H2020 Marie Skłodowska-Curie Actions; European Research Council; National Science and Technology Council; Eidgenössische Technische Hochschule Zürich; Engineering and Physical Sciences Research Council; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Horizon 2020 Framework Programme","keywords":"Bipartite graph; Complete bipartite graph; Graph; Upper and lower bounds; Dimension (graph theory); Binary number","score_opus":0.014274246597868434,"score_gpt":0.22065419291228588,"score_spread":0.20637994631441745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7081942273","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1807194,0.001387834,0.26939443,0.007033401,0.0045442516,0.00014647926,0.0000032424514,0.00010290662,0.53666806],"genre_scores_gemma":[0.9966518,0.000045868772,0.0019895472,0.00017169322,0.000021438993,1.506887e-7,3.9542138e-7,0.000002859686,0.0011162262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985651,0.00027044598,0.00057456107,0.0001362345,0.00026503662,0.00018866135],"domain_scores_gemma":[0.99843836,0.00011439939,0.00050387264,0.00036951367,0.0004834134,0.00009046317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011735387,0.00011594716,0.0002537652,0.00015243568,0.00007633441,0.000052070453,0.0012364049,0.000022660914,0.000011746814],"category_scores_gemma":[0.000238863,0.00010367569,0.00014930384,0.00075502554,0.000073644755,0.0001710805,0.00025755612,0.0002734253,0.000011038257],"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.000030273615,0.00031484122,0.012123307,0.00016358236,0.00016522026,0.00044094486,0.0006812496,0.0006591851,0.005050234,0.9476597,0.026270576,0.0064408975],"study_design_scores_gemma":[0.0032054696,0.0007188987,0.035507903,0.00063227076,0.00007477064,0.00027677006,0.00018731308,0.0021674153,0.011331622,0.30679852,0.63858837,0.00051066646],"about_ca_topic_score_codex":0.000001106424,"about_ca_topic_score_gemma":9.604331e-8,"teacher_disagreement_score":0.8159324,"about_ca_system_score_codex":0.000018685292,"about_ca_system_score_gemma":0.00007004598,"threshold_uncertainty_score":0.42277718},"labels":[],"label_agreement":null},{"id":"W753498374","doi":"10.1016/j.ejc.2016.10.008","title":"Braid moves in commutation classes of the symmetric group","year":2016,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"National Science Foundation","keywords":"Braid group; Mathematics; Braid; Combinatorics; Dihedral group; Word (group theory); Symmetric group; Bijection; Abelian group; Group (periodic table); Class (philosophy); Operator (biology); Element (criminal law); Discrete mathematics; Law; Physics; Geometry; Computer science; Quantum mechanics; Chemistry","score_opus":0.03247884459122029,"score_gpt":0.2778529679791292,"score_spread":0.24537412338790887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W753498374","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97368073,0.00023238618,0.01864571,0.00040061423,0.0017305387,0.00020150772,0.0000032420492,0.000022533388,0.0050827097],"genre_scores_gemma":[0.99737865,0.00008528082,0.0022652224,0.000022819204,0.0000701734,7.4399446e-7,1.1027591e-7,0.000050021114,0.00012700514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714327,0.0008101648,0.0011355256,0.00010166712,0.0006055838,0.0002037921],"domain_scores_gemma":[0.99561733,0.001970759,0.0015252035,0.00044385594,0.00037101557,0.0000718287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015683107,0.00017243091,0.00041736296,0.00028938925,0.00005136554,0.000018743458,0.0008320157,0.000033004166,0.0000075422645],"category_scores_gemma":[0.004614781,0.0000976608,0.0001679961,0.0009768953,0.00010250795,0.000284585,0.00017411393,0.000298602,0.000006640869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045821944,0.00066950795,0.007162366,0.00013944299,0.000046811812,0.000048653237,0.0005440275,0.000008302974,0.002137271,0.98455954,0.0007490344,0.0038892291],"study_design_scores_gemma":[0.0025536853,0.0004160817,0.020421997,0.0005773188,0.000045256536,0.000054078904,0.00013536307,0.000011008451,0.002924845,0.97155005,0.0011475738,0.0001627398],"about_ca_topic_score_codex":3.5948614e-7,"about_ca_topic_score_gemma":0.0000011814521,"teacher_disagreement_score":0.023697866,"about_ca_system_score_codex":0.00015470912,"about_ca_system_score_gemma":0.000052462157,"threshold_uncertainty_score":0.55246574},"labels":[],"label_agreement":null},{"id":"W920035815","doi":"10.1016/j.ejc.2015.04.005","title":"Displaying blocking pairs in signed graphs","year":2015,"lang":"en","type":"article","venue":"European Journal of Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"Seventh Framework Programme; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Signed graph; Graph; Discrete mathematics; Blocking (statistics); Line graph","score_opus":0.039532124111896313,"score_gpt":0.2762106568089395,"score_spread":0.2366785326970432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W920035815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4885682,0.0012821312,0.49195197,0.00062784465,0.0018606237,0.00013689454,4.0505017e-7,0.00007638819,0.015495551],"genre_scores_gemma":[0.9950894,0.000023996168,0.0047094915,0.000056882098,0.000037285557,3.3702224e-7,1.173355e-7,0.00002109975,0.00006135546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972538,0.0010201564,0.00051880337,0.00017296469,0.0006950723,0.0003392413],"domain_scores_gemma":[0.9984329,0.00019948445,0.0003169155,0.00036259668,0.0003791455,0.0003090052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046870583,0.00013278353,0.00022482887,0.00053044857,0.00006847021,0.00012608143,0.0015906002,0.000017954384,0.0000017268801],"category_scores_gemma":[0.00052603264,0.00011811296,0.000093875264,0.0012806344,0.000057934696,0.00072787894,0.0003331377,0.00051006,0.000020631978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118097894,0.00043086015,0.030359702,0.000024797042,0.00004505312,0.0063188714,0.0039999713,0.0024089175,0.0009781822,0.9301525,0.0014018636,0.023761205],"study_design_scores_gemma":[0.007298954,0.0023129457,0.013504474,0.00035040814,0.0000144479045,0.00078085135,0.00088056375,0.005842501,0.0014355808,0.95801795,0.00881938,0.0007419274],"about_ca_topic_score_codex":5.7513876e-7,"about_ca_topic_score_gemma":2.5411796e-7,"teacher_disagreement_score":0.5065212,"about_ca_system_score_codex":0.000102474114,"about_ca_system_score_gemma":0.00010885986,"threshold_uncertainty_score":0.48165068},"labels":[],"label_agreement":null}]}