{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56730294,0.00056187843,0.35538313,0.0004960248,0.0004667421,0.00014341644,0.00039015018,0.0011978374,0.07405784],"genre_scores_gemma":[0.9304945,0.00023609125,0.033979926,0.00015509756,0.00016758467,0.000108222885,0.00039644205,0.00023548726,0.03422664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912864,0.0001617424,0.00006540345,0.00027284725,0.00022469438,0.00014662922],"domain_scores_gemma":[0.9975914,0.0012279835,0.00028447362,0.00030296587,0.00032317822,0.0002699838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078832754,0.0007555655,0.00054223667,0.0015655062,0.0013699079,0.0021494124,0.001042545,0.0011400149,0.008500072],"category_scores_gemma":[0.0026091211,0.00057503907,0.0008713378,0.0010120233,0.0013872987,0.0032579699,0.0022769428,0.0019200433,0.002491111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030475773,0.00012951574,0.00069973257,0.00013409129,0.000024341785,0.0010733281,0.0012720622,0.0013776819,0.02089744,0.9536715,0.0008188629,0.01959669],"study_design_scores_gemma":[0.0000817166,0.00017629201,0.0007356879,0.000043477736,0.000046164154,0.0014262063,0.00029775748,0.0063615525,0.021002026,0.95863503,0.011148355,0.00004559305],"about_ca_topic_score_codex":0.0001262802,"about_ca_topic_score_gemma":0.00018618458,"teacher_disagreement_score":0.008500072,"about_ca_system_score_codex":0.0006186338,"about_ca_system_score_gemma":0.0004258996,"threshold_uncertainty_score":0.028435588},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77948725,0.001335311,0.12704302,0.0029469077,0.00048469668,0.00014855315,0.0012366408,0.0003975348,0.08692008],"genre_scores_gemma":[0.96104664,0.0007780465,0.015448995,0.00048813084,0.00108813,0.00019213955,0.0015935501,0.00019897037,0.019165318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990025,0.00027075404,0.000041167365,0.00024751565,0.00023977645,0.00019830657],"domain_scores_gemma":[0.9965624,0.0018572524,0.000514368,0.00017613375,0.00023923299,0.0006505843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009980967,0.0013150872,0.0013486325,0.0026927898,0.0030737855,0.0052666026,0.0015206076,0.0022538335,0.012971577],"category_scores_gemma":[0.0047952603,0.0009823875,0.0012555287,0.0014914796,0.0031458251,0.004292233,0.0023565297,0.0035307975,0.0011815525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016129066,0.00006488999,0.00084279996,0.0000738522,0.000017738665,0.00022848333,0.0004864234,0.0019569278,0.0014776352,0.98523027,0.00400694,0.0054528685],"study_design_scores_gemma":[0.000055678523,0.000049763144,0.0006786773,0.000024778743,0.000018669118,0.0002853505,0.00017416332,0.011325829,0.00041693953,0.9828441,0.004105305,0.00002074767],"about_ca_topic_score_codex":0.0019923237,"about_ca_topic_score_gemma":0.001699761,"teacher_disagreement_score":0.012971577,"about_ca_system_score_codex":0.001727281,"about_ca_system_score_gemma":0.00066465157,"threshold_uncertainty_score":0.043394268},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.318895,0.0020915705,0.15937133,0.003414268,0.0014756116,0.000051297728,0.0024994176,0.001266973,0.5109346],"genre_scores_gemma":[0.92960423,0.0007755997,0.013570002,0.0004208369,0.00054107746,0.000086664164,0.00076198415,0.00056982716,0.053669654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992601,0.00010959161,0.000042731437,0.0002453632,0.00014578452,0.0001963293],"domain_scores_gemma":[0.99659497,0.0015943972,0.0003472119,0.00038055456,0.00045789656,0.00062495784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006264479,0.00042269862,0.0005859528,0.0008848858,0.0016453533,0.0036111993,0.0010727829,0.0009367499,0.019836275],"category_scores_gemma":[0.003495605,0.00030591947,0.00042220126,0.0006365427,0.001890943,0.004201823,0.001746402,0.0012966415,0.0041248887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016101151,0.000018749379,0.0013906361,0.0000768413,0.000009560842,0.00019319281,0.00033567526,0.00046190267,0.004484901,0.9648636,0.013930958,0.014072929],"study_design_scores_gemma":[0.000047585352,0.00010294162,0.005229158,0.00009111124,0.000051388775,0.0028070996,0.00084778434,0.0066110124,0.017454593,0.8383874,0.12829892,0.00007094749],"about_ca_topic_score_codex":0.00058887503,"about_ca_topic_score_gemma":0.0005182978,"teacher_disagreement_score":0.019836275,"about_ca_system_score_codex":0.00072637055,"about_ca_system_score_gemma":0.00039280925,"threshold_uncertainty_score":0.06635898},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096699126,0.007378155,0.3725759,0.020079337,0.0025753838,0.0005557279,0.012499982,0.005181498,0.48245484],"genre_scores_gemma":[0.6015212,0.0061410996,0.21551171,0.0043123662,0.0035968751,0.0009127773,0.018756613,0.0053905197,0.14385687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964964,0.0006671802,0.00017369757,0.00066011114,0.0013121306,0.000690447],"domain_scores_gemma":[0.9827544,0.010029228,0.0007648499,0.003498822,0.0020409306,0.0009116966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020265991,0.0024478645,0.0016152291,0.0040280046,0.002402029,0.0048522246,0.00455607,0.001969866,0.05757092],"category_scores_gemma":[0.0136925625,0.0007714138,0.0030845145,0.0045400867,0.0023579225,0.010862482,0.0047661667,0.0075609116,0.01412159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012250032,0.00071283383,0.004662303,0.0025052966,0.00034026813,0.0007763068,0.0010187315,0.07673921,0.012034568,0.5304832,0.22607277,0.14342955],"study_design_scores_gemma":[0.00017282869,0.00011741522,0.0030967172,0.00016600637,0.00027531662,0.00056431344,0.00024448783,0.08571781,0.005593181,0.8559584,0.04797719,0.0001163101],"about_ca_topic_score_codex":0.009384505,"about_ca_topic_score_gemma":0.020206107,"teacher_disagreement_score":0.05757092,"about_ca_system_score_codex":0.0055829845,"about_ca_system_score_gemma":0.0027956618,"threshold_uncertainty_score":0.19259393},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7623337,0.0027295605,0.07332981,0.003243148,0.00085188414,0.00005016393,0.00035266555,0.00030971857,0.15679933],"genre_scores_gemma":[0.9716225,0.001058554,0.005229065,0.00029766082,0.00057469495,0.000036280013,0.00029530076,0.00011328345,0.020772716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925107,0.00019905176,0.000028751978,0.00014766098,0.00018272184,0.0001907825],"domain_scores_gemma":[0.9969674,0.0015556236,0.00040794455,0.00034533115,0.00026304013,0.00046080482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007550583,0.0007026912,0.0009647843,0.0032770983,0.0032899554,0.0042987857,0.0011082973,0.0017951817,0.008875075],"category_scores_gemma":[0.0042869784,0.00080536533,0.00062250666,0.0021592118,0.004111624,0.0048741684,0.0024494054,0.003476096,0.0013387238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042067466,0.000025041873,0.00040038556,0.00002452599,0.000004871637,0.00009133645,0.00025506096,0.0006102258,0.0005093774,0.9944877,0.0009756598,0.002573839],"study_design_scores_gemma":[0.00000958649,0.000004573653,0.0002501532,0.000010899694,0.000004070596,0.00009895567,0.000069276226,0.0012832461,0.00013652966,0.9967068,0.0014194713,0.000006510938],"about_ca_topic_score_codex":0.0011343753,"about_ca_topic_score_gemma":0.0016884973,"teacher_disagreement_score":0.008875075,"about_ca_system_score_codex":0.0011946777,"about_ca_system_score_gemma":0.0004330794,"threshold_uncertainty_score":0.029690087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71445876,0.0025287713,0.21704105,0.01374876,0.000586209,0.0003249615,0.009981627,0.00376371,0.03756615],"genre_scores_gemma":[0.9360564,0.00060139055,0.046725202,0.0010208051,0.0007962132,0.00016135808,0.0054811286,0.0006283284,0.008529289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9933403,0.0014536999,0.00027000287,0.0024141828,0.0013769603,0.0011448633],"domain_scores_gemma":[0.96066266,0.02889283,0.001827978,0.0051454995,0.0014087097,0.0020623908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027243039,0.0022201966,0.0024872464,0.0029799445,0.0029086883,0.009704218,0.0063705416,0.0043097315,0.014633597],"category_scores_gemma":[0.02644246,0.001442537,0.0023425862,0.004516957,0.0046993354,0.015385179,0.0047455714,0.005922147,0.0016494485],"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.0063110543,0.0016208554,0.033889577,0.0023555795,0.00086750113,0.0008216438,0.0021711914,0.43701085,0.0200137,0.2862374,0.07192183,0.1367788],"study_design_scores_gemma":[0.0002438538,0.00012269063,0.0033687742,0.00008585287,0.00012088067,0.00027092788,0.00051046506,0.38953876,0.005667033,0.5956789,0.004318945,0.000072934],"about_ca_topic_score_codex":0.009922018,"about_ca_topic_score_gemma":0.014253438,"teacher_disagreement_score":0.014633597,"about_ca_system_score_codex":0.005479597,"about_ca_system_score_gemma":0.004472652,"threshold_uncertainty_score":0.04895425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36425593,0.00096966425,0.6034968,0.0010652344,0.00041130217,0.00028272806,0.0010983921,0.007624527,0.020795414],"genre_scores_gemma":[0.570955,0.00051017106,0.40895373,0.00028447973,0.00011481323,0.00014938439,0.0017377464,0.0013676676,0.01592703],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993262,0.00018560298,0.000027218006,0.0001373502,0.00016976621,0.00015392105],"domain_scores_gemma":[0.996317,0.00141371,0.00025739975,0.0014164643,0.0003745419,0.0002208927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006274954,0.0010386504,0.0013440601,0.0013995543,0.00083164306,0.0011756412,0.0015974925,0.00078183645,0.009987331],"category_scores_gemma":[0.004444525,0.0005470471,0.0008564705,0.0014939636,0.00074690464,0.0022683092,0.0031984446,0.0011619959,0.0016758036],"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.001965035,0.00035319812,0.0028003457,0.001061711,0.00014842549,0.0004832448,0.00089001586,0.09795285,0.075910494,0.07190995,0.037595518,0.70892924],"study_design_scores_gemma":[0.00036489137,0.00038244977,0.0017571267,0.000119980745,0.0001292066,0.00059057213,0.0005539801,0.6180506,0.051708523,0.2998887,0.026387664,0.00006634844],"about_ca_topic_score_codex":0.0019398504,"about_ca_topic_score_gemma":0.0050374875,"teacher_disagreement_score":0.009987331,"about_ca_system_score_codex":0.0007659975,"about_ca_system_score_gemma":0.00060832547,"threshold_uncertainty_score":0.033410907},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19895382,0.008781333,0.46119395,0.0072270148,0.0012070496,0.00013583037,0.001503136,0.0013298917,0.31966797],"genre_scores_gemma":[0.8506677,0.004342697,0.08505155,0.0018435166,0.001460713,0.00048740814,0.0020414407,0.0007509045,0.053354032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649614,0.00084393256,0.00032013896,0.0008671783,0.00101365,0.0004589377],"domain_scores_gemma":[0.9904999,0.0064587374,0.00052016455,0.0008115341,0.0009801039,0.00072957284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037205752,0.001576161,0.0023250133,0.00848329,0.006668262,0.008198849,0.0029816364,0.0021176946,0.015782576],"category_scores_gemma":[0.0074979304,0.0021269813,0.004154087,0.0067743054,0.006904649,0.025262307,0.011255322,0.010113738,0.0018514433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018260842,0.000016029133,0.0001644553,0.000036666428,0.000014967108,0.000050270242,0.00029305895,0.000138006,0.00016940323,0.9956672,0.0007469886,0.0026845837],"study_design_scores_gemma":[0.000008501093,0.000005566116,0.00010295044,0.000015174346,0.000016967128,0.000076624485,0.00009459578,0.00064283673,0.00019580971,0.99644643,0.0023856885,0.000008867712],"about_ca_topic_score_codex":0.0013878444,"about_ca_topic_score_gemma":0.0010242775,"teacher_disagreement_score":0.015782576,"about_ca_system_score_codex":0.003433384,"about_ca_system_score_gemma":0.0010089561,"threshold_uncertainty_score":0.052797914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64301574,0.0036535657,0.08819581,0.0072881393,0.001277611,0.00009028556,0.00048860494,0.0002341588,0.2557561],"genre_scores_gemma":[0.95721006,0.0020717992,0.008851711,0.0006801057,0.0011965586,0.00008792207,0.00045629012,0.00010004865,0.029345509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990632,0.00028007047,0.000059259568,0.0001344458,0.00021847445,0.00024454683],"domain_scores_gemma":[0.99741095,0.0015175758,0.0002748097,0.00024814604,0.00022511063,0.00032347557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015144409,0.0012935047,0.0012378567,0.0034896517,0.0035191437,0.0053164596,0.0015208487,0.0017914277,0.009723484],"category_scores_gemma":[0.004048429,0.0007215566,0.0012754671,0.0025939273,0.008012096,0.0100463815,0.004756913,0.0051999614,0.0010251284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041822717,0.00002337823,0.00024367041,0.000023687848,0.00000495998,0.000060194452,0.00032383823,0.00038428386,0.00028006628,0.9957125,0.0004521914,0.0024494345],"study_design_scores_gemma":[0.000011203261,0.000013023057,0.00017812,0.0000115473,0.0000056278604,0.00004080146,0.00014451928,0.00066009955,0.0001337646,0.9975024,0.0012904489,0.000008353441],"about_ca_topic_score_codex":0.0019387493,"about_ca_topic_score_gemma":0.0020678549,"teacher_disagreement_score":0.009723484,"about_ca_system_score_codex":0.0020686768,"about_ca_system_score_gemma":0.00086876826,"threshold_uncertainty_score":0.03252828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8376224,0.0012379177,0.045769494,0.0019774984,0.00035362577,0.000042088337,0.0002665972,0.0001737407,0.112556666],"genre_scores_gemma":[0.9830958,0.0005156567,0.0019521223,0.00011863362,0.00025335842,0.000012698148,0.00010928343,0.00003074111,0.013911644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949884,0.000097399425,0.000020704296,0.00006439643,0.00016039395,0.00015820799],"domain_scores_gemma":[0.99895537,0.00027520765,0.00020269773,0.000080586,0.0001760981,0.00030996624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008051225,0.0005268395,0.00064880506,0.0023523835,0.0015962244,0.003072091,0.00090647116,0.0006741111,0.0069552665],"category_scores_gemma":[0.0028144177,0.00036825368,0.00046628746,0.0014750649,0.0030452048,0.005115438,0.0021237128,0.0019093453,0.0010305935],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052575717,0.000027123888,0.00042762447,0.000019511579,0.0000062095814,0.00007956493,0.00021599111,0.0005948199,0.0008791191,0.9928929,0.00065076974,0.0041537187],"study_design_scores_gemma":[0.00002254803,0.000022348997,0.0006642959,0.000008020955,0.000008978573,0.00011377576,0.00012484459,0.0031124358,0.000566604,0.9934041,0.0019324861,0.000019492343],"about_ca_topic_score_codex":0.0026815326,"about_ca_topic_score_gemma":0.0024107506,"teacher_disagreement_score":0.0069552665,"about_ca_system_score_codex":0.0013407718,"about_ca_system_score_gemma":0.0009858763,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52706915,0.0007185931,0.36684835,0.0018203271,0.00015446072,0.00009632464,0.0007768659,0.0011250398,0.101390876],"genre_scores_gemma":[0.96319866,0.00037410608,0.02014702,0.0003242491,0.00019004499,0.00013609884,0.00041441843,0.00025721817,0.014958099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970368,0.0009062798,0.00015875933,0.0005353388,0.00081434567,0.00054842874],"domain_scores_gemma":[0.98184574,0.011388115,0.0016930127,0.0016161704,0.0013193988,0.0021374656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002390631,0.00092779327,0.0014244633,0.0032058994,0.0036842423,0.0066869576,0.0022293143,0.0016460402,0.00842955],"category_scores_gemma":[0.010495023,0.001961216,0.0020994043,0.00242848,0.0060180225,0.011032966,0.004916299,0.0050719674,0.0010389374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004948558,0.000033274286,0.0003268725,0.000038429673,0.000016825272,0.00010165923,0.00038001826,0.00092197355,0.00079255237,0.9946525,0.00053635467,0.0021499502],"study_design_scores_gemma":[0.000016600521,0.0000114208115,0.0002710925,0.00001176996,0.000017622187,0.00016098503,0.0001063553,0.005163488,0.0006919494,0.99270296,0.00082765595,0.000018067705],"about_ca_topic_score_codex":0.0018030273,"about_ca_topic_score_gemma":0.0021156108,"teacher_disagreement_score":0.00842955,"about_ca_system_score_codex":0.0019811182,"about_ca_system_score_gemma":0.001114417,"threshold_uncertainty_score":0.028199673},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47814095,0.000365262,0.3529273,0.0019196556,0.000503138,0.0004233535,0.0016450434,0.0017274477,0.16234788],"genre_scores_gemma":[0.8314406,0.0004022971,0.11654313,0.0005991432,0.00015980251,0.0005033867,0.001971316,0.0008924203,0.04748795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981731,0.00039225596,0.00014557206,0.0004035459,0.00051033276,0.00037513784],"domain_scores_gemma":[0.9956874,0.0013169401,0.00039287185,0.0013974945,0.00063390884,0.00057134253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077918376,0.00068367337,0.0010438473,0.0017649997,0.0025224222,0.003495427,0.0014228534,0.0019406944,0.015830934],"category_scores_gemma":[0.0058237268,0.0009390863,0.0013441541,0.0018462024,0.0024360523,0.0037291364,0.0035073245,0.00222069,0.0032501472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019680281,0.000079882644,0.0007583366,0.0001083916,0.000020910937,0.00029281838,0.00046044597,0.0026353844,0.0048500253,0.9687008,0.004832946,0.017063096],"study_design_scores_gemma":[0.000060434668,0.000035432968,0.00050663523,0.000033893117,0.000021648731,0.00043947165,0.00025811157,0.012198521,0.00302404,0.9763198,0.0070838844,0.000018197232],"about_ca_topic_score_codex":0.0008148483,"about_ca_topic_score_gemma":0.0013985138,"teacher_disagreement_score":0.015830934,"about_ca_system_score_codex":0.0010555584,"about_ca_system_score_gemma":0.0010267837,"threshold_uncertainty_score":0.05295974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45286003,0.001404465,0.4107729,0.0030138437,0.00084523956,0.00039338606,0.0014437891,0.0006731329,0.12859318],"genre_scores_gemma":[0.9370774,0.00073010207,0.03966981,0.0009224862,0.000688853,0.0006206761,0.0018883421,0.00031181588,0.018090473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99629164,0.0009185942,0.00043787083,0.0009876105,0.00067871844,0.0006855732],"domain_scores_gemma":[0.98450965,0.010133679,0.0011600119,0.001138235,0.0014410748,0.001617334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044908053,0.00093466113,0.0014900515,0.0031536177,0.004361264,0.005678991,0.0016408149,0.0026986673,0.015305089],"category_scores_gemma":[0.0097749,0.0013901917,0.0022418096,0.002662386,0.0069236886,0.011671357,0.005034881,0.0040349206,0.0018116807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081971506,0.000042532465,0.0004424012,0.000045052846,0.00001167669,0.00025657722,0.0010916899,0.0002593579,0.0010107362,0.9936724,0.0007891081,0.0022965276],"study_design_scores_gemma":[0.00003636659,0.000020809046,0.00018334616,0.00001653944,0.000019130852,0.00018722839,0.0003980214,0.0012204017,0.00086952077,0.99486536,0.002164811,0.000018585171],"about_ca_topic_score_codex":0.0011227663,"about_ca_topic_score_gemma":0.0013688607,"teacher_disagreement_score":0.015305089,"about_ca_system_score_codex":0.0014373247,"about_ca_system_score_gemma":0.0012886451,"threshold_uncertainty_score":0.051200688},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14565867,0.0052853706,0.5361559,0.011580396,0.0027565053,0.00017141104,0.00063440023,0.0013224464,0.29643488],"genre_scores_gemma":[0.8393594,0.003875111,0.05532579,0.004637005,0.0026028734,0.00026053158,0.0016198858,0.001300255,0.091019295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979305,0.00061319,0.000112347436,0.0003192028,0.0005727268,0.00045206596],"domain_scores_gemma":[0.9927241,0.0051088016,0.000320125,0.0009527155,0.00060083345,0.00029343477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023167976,0.0011556448,0.0016634016,0.0025914353,0.0028473292,0.0039770645,0.0019850668,0.0024248876,0.016572982],"category_scores_gemma":[0.0069613988,0.0008438287,0.0022481424,0.0019045142,0.004813474,0.010078368,0.0065066027,0.0081141405,0.0040905518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019106781,0.00006652308,0.00036102493,0.00020987255,0.000033986675,0.0004769944,0.0004818562,0.0015368888,0.0038523013,0.96879923,0.010122048,0.013868138],"study_design_scores_gemma":[0.00004075622,0.000039388935,0.00028680352,0.000039454466,0.00004147849,0.00032362458,0.00013313837,0.0065824105,0.0025171635,0.9735005,0.0164563,0.000038985847],"about_ca_topic_score_codex":0.0012427416,"about_ca_topic_score_gemma":0.0010287703,"teacher_disagreement_score":0.016572982,"about_ca_system_score_codex":0.0011835502,"about_ca_system_score_gemma":0.0007031062,"threshold_uncertainty_score":0.055442154},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32491028,0.0028670724,0.27587944,0.0034337966,0.0011974428,0.0001060434,0.0004981944,0.00056814525,0.39053965],"genre_scores_gemma":[0.912546,0.001606731,0.018807964,0.0012062308,0.0009701126,0.000107358894,0.00033271353,0.00046194508,0.063960925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896646,0.00026080935,0.000043000993,0.00021010512,0.00033241988,0.00018726653],"domain_scores_gemma":[0.9961994,0.001781441,0.00036176853,0.00030447988,0.0006594524,0.00069345604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016346173,0.001398637,0.0013543527,0.0040256944,0.002947886,0.0029640982,0.0021257277,0.0015532403,0.017418426],"category_scores_gemma":[0.0057450393,0.00072499126,0.0011574295,0.0024443457,0.0046346365,0.0077132364,0.0041194176,0.0044824188,0.0026887092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006674697,0.000013715881,0.00013240136,0.00004054401,0.0000058941955,0.00008031521,0.0001565182,0.0005224578,0.0012165437,0.9926813,0.001172741,0.003910755],"study_design_scores_gemma":[0.0000119089245,0.000016968374,0.00020699741,0.000015446225,0.000012231935,0.00015593263,0.000050354753,0.003134865,0.00071682816,0.9927406,0.0029195352,0.00001838586],"about_ca_topic_score_codex":0.00087315094,"about_ca_topic_score_gemma":0.0009739213,"teacher_disagreement_score":0.017418426,"about_ca_system_score_codex":0.0014008378,"about_ca_system_score_gemma":0.0004944154,"threshold_uncertainty_score":0.058270395},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5269274,0.0007333211,0.33752808,0.0034025107,0.00049243413,0.00012342066,0.0004182452,0.00078157644,0.12959301],"genre_scores_gemma":[0.92692024,0.00046446288,0.03503135,0.0005889801,0.00040271482,0.00017582338,0.00032392854,0.00035196534,0.0357404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723166,0.0008315927,0.0001492443,0.0005269992,0.00054994517,0.0007106388],"domain_scores_gemma":[0.9942889,0.003270458,0.0004373073,0.00069699937,0.00051117863,0.0007950877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022796937,0.0010358928,0.001942206,0.0035426382,0.0046656295,0.006534788,0.002068036,0.0024633924,0.008098379],"category_scores_gemma":[0.0066178124,0.0011891548,0.001938361,0.0027324127,0.0058711274,0.014010172,0.0070422,0.004936938,0.0015796933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027179734,0.000013420983,0.00007214331,0.000011824678,0.000002951383,0.0000433727,0.00014015616,0.00019296189,0.00024747962,0.99697745,0.0002677779,0.002003319],"study_design_scores_gemma":[0.0000107494525,0.000007893585,0.000042639567,0.000008038278,0.000006637334,0.00007056211,0.000072562165,0.0010924789,0.00032849074,0.9973923,0.0009601399,0.0000075672174],"about_ca_topic_score_codex":0.00073522766,"about_ca_topic_score_gemma":0.0006330259,"teacher_disagreement_score":0.008098379,"about_ca_system_score_codex":0.0023221062,"about_ca_system_score_gemma":0.0009259753,"threshold_uncertainty_score":0.027091801},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01577146,0.00042452657,0.17808913,0.0043016495,0.0015327535,0.000310747,0.003595959,0.0010286515,0.7949452],"genre_scores_gemma":[0.47907537,0.0014351413,0.10117747,0.00463442,0.001097771,0.00076596066,0.007030872,0.0027136016,0.40206936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782616,0.00036151873,0.00016911287,0.0004625214,0.0007056626,0.00047504093],"domain_scores_gemma":[0.9962496,0.0010450731,0.00018714019,0.0005622728,0.0016115017,0.00034442384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012395751,0.00078759843,0.0009331218,0.0012435534,0.0026652035,0.004479585,0.0012664383,0.0017171842,0.1304272],"category_scores_gemma":[0.007810795,0.0004640918,0.0007346576,0.0013147151,0.0020390248,0.00745295,0.0017927445,0.0038686963,0.026019568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010659997,0.00005757601,0.00025804562,0.00008692009,0.000005593546,0.00016143141,0.00011450029,0.0004340463,0.0013954438,0.9326999,0.04654484,0.018135047],"study_design_scores_gemma":[0.00007270656,0.00006931333,0.00064912374,0.00011661713,0.0000147982055,0.0006067455,0.00026736088,0.0056831967,0.005177315,0.8605118,0.12677568,0.000055309483],"about_ca_topic_score_codex":0.005561208,"about_ca_topic_score_gemma":0.0074201217,"teacher_disagreement_score":0.1304272,"about_ca_system_score_codex":0.0015367081,"about_ca_system_score_gemma":0.0027131,"threshold_uncertainty_score":0.43632245},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056440074,0.25685447,0.6546394,0.0046310485,0.00070693495,0.00022253225,0.0015419071,0.0022823862,0.02268119],"genre_scores_gemma":[0.2631171,0.26017353,0.4549259,0.0019097818,0.0038858724,0.00035852418,0.0053785453,0.0011542413,0.009096459],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99483275,0.00070741423,0.00062818476,0.0017045666,0.0018355474,0.00029150548],"domain_scores_gemma":[0.9846198,0.010848152,0.0005576808,0.0025443623,0.0010992619,0.00033081096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033483575,0.0013245877,0.0035077462,0.0058461046,0.0012369622,0.006223516,0.004216477,0.0020020152,0.005337258],"category_scores_gemma":[0.015247755,0.0015123544,0.002003422,0.012598952,0.002863792,0.015534647,0.003726657,0.003307543,0.0022881634],"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.00020848567,0.0002461573,0.0051990827,0.0037117829,0.00014557783,0.000112239955,0.0004308547,0.011330884,0.0023732393,0.14749716,0.008337038,0.8204075],"study_design_scores_gemma":[0.00007621323,0.00032530067,0.0041977167,0.0016140044,0.00022167676,0.002006042,0.0007519932,0.09491748,0.010414929,0.7683935,0.11694682,0.00013433775],"about_ca_topic_score_codex":0.001327263,"about_ca_topic_score_gemma":0.001305764,"teacher_disagreement_score":0.006223516,"about_ca_system_score_codex":0.0016816069,"about_ca_system_score_gemma":0.0022297471,"threshold_uncertainty_score":0.017854929},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6701524,0.0007512572,0.25396338,0.0012239383,0.0003147359,0.00016000071,0.0005364975,0.00038470747,0.07251302],"genre_scores_gemma":[0.92936164,0.00034230095,0.048728857,0.00017091291,0.00024338695,0.00014510918,0.00043857936,0.00013492437,0.020434253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984849,0.0004280762,0.00009206379,0.0003082056,0.00046337195,0.00022345541],"domain_scores_gemma":[0.9963756,0.0015083393,0.0005617248,0.00036265538,0.00040520454,0.000786532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011287492,0.00044270902,0.0011897292,0.002752229,0.002376735,0.0055131004,0.0010817606,0.0009463117,0.0074853306],"category_scores_gemma":[0.0038616355,0.00067922537,0.0010250278,0.0016410031,0.0034279632,0.0035368672,0.0033046282,0.0020550732,0.001476236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018834302,0.00002773898,0.00040248263,0.000043592707,0.000017554154,0.00019981098,0.00057446695,0.002259333,0.0019007167,0.98604137,0.0009978132,0.007346742],"study_design_scores_gemma":[0.000058134534,0.000031138366,0.00025671988,0.000021600043,0.000013159665,0.0001824092,0.00036817093,0.008007642,0.0012337823,0.98473096,0.0050695688,0.000026657386],"about_ca_topic_score_codex":0.00094568665,"about_ca_topic_score_gemma":0.0008481939,"teacher_disagreement_score":0.0074853306,"about_ca_system_score_codex":0.0013069243,"about_ca_system_score_gemma":0.00056926126,"threshold_uncertainty_score":0.025040925},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3893934,0.0036005662,0.09590087,0.02753046,0.015287426,0.00008322126,0.00046257832,0.00081223436,0.46692926],"genre_scores_gemma":[0.8790393,0.0018571399,0.01748323,0.0030578293,0.00388349,0.000055355293,0.00030286514,0.00030291485,0.09401791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997074,0.00005122353,0.000020743542,0.00006236505,0.00008273744,0.00007551614],"domain_scores_gemma":[0.9987753,0.000547612,0.00013537443,0.0001532727,0.0001568497,0.0002316051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006883335,0.00083476526,0.00064072356,0.0011090101,0.002966939,0.0020434968,0.0011231242,0.0014374815,0.0092185335],"category_scores_gemma":[0.002413106,0.00024321732,0.00061559596,0.0011188735,0.0030529206,0.0046761823,0.0018529359,0.002423204,0.0011155487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010854926,0.00001921826,0.00038299416,0.000066954526,0.0000064421442,0.0007385004,0.0003225251,0.00025706415,0.0014652621,0.9846918,0.0053978343,0.0065429104],"study_design_scores_gemma":[0.0000129901155,0.000033404944,0.00047265284,0.000020314525,0.000018222296,0.00089841726,0.00013884179,0.0007570488,0.0010697241,0.957481,0.039077673,0.000019720537],"about_ca_topic_score_codex":0.0010615658,"about_ca_topic_score_gemma":0.000925328,"teacher_disagreement_score":0.0092185335,"about_ca_system_score_codex":0.0009358266,"about_ca_system_score_gemma":0.0005807775,"threshold_uncertainty_score":0.030839086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45667174,0.001016317,0.30917883,0.00285205,0.0012955773,0.00025268146,0.00047453653,0.00061542646,0.22764283],"genre_scores_gemma":[0.89138687,0.00035769938,0.06646933,0.00067414244,0.00087677647,0.00016819913,0.00025831826,0.00014426885,0.03966451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982495,0.00043414353,0.000087823486,0.0002571568,0.0005566386,0.000414707],"domain_scores_gemma":[0.9967788,0.0010215173,0.00044695783,0.00044214766,0.0006594493,0.0006511787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012420339,0.0009778575,0.0009302536,0.0029385262,0.0026886822,0.0039967666,0.0011862603,0.0013769515,0.008185424],"category_scores_gemma":[0.004098977,0.0007176997,0.00094587094,0.0017230625,0.0038589728,0.0035051054,0.0018613064,0.0027977964,0.0013894784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050307342,0.000025833348,0.000068950714,0.000015707707,0.0000042131423,0.00010823103,0.00012032869,0.00040431513,0.0012142931,0.9950498,0.00075781334,0.002180271],"study_design_scores_gemma":[0.000026430087,0.00003256964,0.000121669575,0.000009660253,0.000005892223,0.00025222232,0.00008004894,0.0044140816,0.0014893917,0.9905715,0.0029722527,0.00002429797],"about_ca_topic_score_codex":0.0006112919,"about_ca_topic_score_gemma":0.0006156869,"teacher_disagreement_score":0.008185424,"about_ca_system_score_codex":0.0010560518,"about_ca_system_score_gemma":0.0009721103,"threshold_uncertainty_score":0.02738297},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45440844,0.0015257352,0.3137232,0.002679284,0.00023549172,0.00021829487,0.0012087886,0.00054629723,0.2254544],"genre_scores_gemma":[0.90509236,0.0015440197,0.058553185,0.0007633494,0.00038138087,0.0001601377,0.0020607861,0.00027085922,0.031173855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933606,0.00019422523,0.0000281651,0.0001290557,0.00023533976,0.000077278535],"domain_scores_gemma":[0.99730253,0.0013071734,0.0003785392,0.0003563091,0.00041914423,0.00023617347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050205475,0.0012340477,0.0007325658,0.0034719228,0.001609784,0.0026826807,0.0011572933,0.0011567815,0.011270775],"category_scores_gemma":[0.0030545637,0.00052525353,0.0010367552,0.0020933652,0.0017411568,0.0032114005,0.0017985505,0.002168508,0.0012079887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060941966,0.000049401606,0.0008696519,0.0001415344,0.00001810419,0.00022160333,0.00032288817,0.0069890097,0.0031304513,0.96245927,0.0026985228,0.023038635],"study_design_scores_gemma":[0.000011215253,0.000047433496,0.001140562,0.000046172016,0.000027382117,0.00041241795,0.00026164716,0.026224574,0.0025516127,0.9531322,0.016124988,0.000019874555],"about_ca_topic_score_codex":0.0011441038,"about_ca_topic_score_gemma":0.0011223722,"teacher_disagreement_score":0.011270775,"about_ca_system_score_codex":0.0007733845,"about_ca_system_score_gemma":0.00052295957,"threshold_uncertainty_score":0.037704468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6907412,0.0016206446,0.15725857,0.0015559285,0.0010746985,0.000048715334,0.00016165145,0.0004977343,0.14704086],"genre_scores_gemma":[0.96386683,0.00056158047,0.0122728385,0.00029893316,0.00036800836,0.000038354083,0.000116437164,0.00015234892,0.02232465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989674,0.00022677498,0.00006572614,0.00017895973,0.00023461842,0.00032647033],"domain_scores_gemma":[0.99808097,0.0009291047,0.00018076769,0.00019417304,0.00030117217,0.00031387783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014330973,0.0007616404,0.0010026514,0.003133574,0.004196262,0.003240813,0.00095724745,0.0016848809,0.0057476163],"category_scores_gemma":[0.0030263353,0.0006250464,0.0015139009,0.002739854,0.0056208335,0.00476937,0.003115746,0.0023245995,0.00093027536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035858196,0.000015480566,0.0001372805,0.000011580198,0.000004183192,0.00014010725,0.00053161086,0.00024376345,0.00059256406,0.9950767,0.00030125465,0.0029095768],"study_design_scores_gemma":[0.000008946771,0.000018373066,0.0001787773,0.0000089132855,0.000007819381,0.00011109983,0.00014500464,0.0011573404,0.0004887195,0.99603516,0.001825011,0.000014812561],"about_ca_topic_score_codex":0.0017352824,"about_ca_topic_score_gemma":0.0015749279,"teacher_disagreement_score":0.0057476163,"about_ca_system_score_codex":0.001959137,"about_ca_system_score_gemma":0.00073370145,"threshold_uncertainty_score":0.019227684},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47445148,0.0034513832,0.4670675,0.0050384435,0.00044803892,0.00015590109,0.001544794,0.000693747,0.04714862],"genre_scores_gemma":[0.9455699,0.0016167728,0.03270546,0.0003640113,0.00025247628,0.00015339084,0.00046374073,0.00011136201,0.01876292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870145,0.0004927707,0.000071262,0.0002456316,0.00023839492,0.00025042397],"domain_scores_gemma":[0.99023366,0.0071202293,0.0009772186,0.0007527877,0.0003892154,0.0005269731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012697291,0.0005888405,0.0009072211,0.0015412522,0.0008601644,0.003326123,0.0011048212,0.0014561712,0.0048586647],"category_scores_gemma":[0.011642838,0.0005816682,0.0004870895,0.0013795557,0.0017382337,0.003961822,0.0014500342,0.0016492585,0.0006709203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009982753,0.000019356914,0.00034314976,0.00005031592,0.000008858219,0.000056551857,0.000060713708,0.014311559,0.0005433656,0.9787804,0.0010212619,0.004704682],"study_design_scores_gemma":[0.00006541016,0.000022239474,0.00025163728,0.000030918825,0.000011701533,0.0000738154,0.000032261276,0.08633321,0.00035803125,0.90990233,0.0028965762,0.000021791673],"about_ca_topic_score_codex":0.000978434,"about_ca_topic_score_gemma":0.0012225634,"teacher_disagreement_score":0.0048586647,"about_ca_system_score_codex":0.0014125253,"about_ca_system_score_gemma":0.0007244449,"threshold_uncertainty_score":0.016253889},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44864124,0.0009671006,0.34664026,0.0013700651,0.00030845392,0.00011223577,0.0012222641,0.0010701343,0.1996682],"genre_scores_gemma":[0.9299872,0.00044104859,0.021954646,0.00022448698,0.0001284288,0.00008496522,0.0014070247,0.0002153101,0.045556985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987993,0.00023014493,0.000104481165,0.0003104165,0.00033382105,0.00022171292],"domain_scores_gemma":[0.9984561,0.0005059753,0.00012853359,0.00024789677,0.00027757406,0.00038389183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008948019,0.0009957772,0.00091180066,0.002027614,0.0024278644,0.005028249,0.0009434138,0.00082486327,0.021157322],"category_scores_gemma":[0.0017785914,0.00075459405,0.0009324058,0.002509713,0.002950491,0.008946635,0.0053719264,0.0032178834,0.0025654875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041792708,0.000040072206,0.00037160414,0.00003592892,0.000011639344,0.00019175133,0.00068609783,0.00041555363,0.0010610871,0.99154526,0.00094645924,0.0046528196],"study_design_scores_gemma":[0.000019269752,0.000024691277,0.0002216881,0.000018567274,0.000014784301,0.00042240287,0.0006118944,0.0016363248,0.0010345594,0.9885361,0.007446435,0.000013341226],"about_ca_topic_score_codex":0.00043245463,"about_ca_topic_score_gemma":0.00063166744,"teacher_disagreement_score":0.021157322,"about_ca_system_score_codex":0.00079402945,"about_ca_system_score_gemma":0.0004453432,"threshold_uncertainty_score":0.07077831},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6052933,0.0014171622,0.26065442,0.0032857037,0.0003486041,0.00023084765,0.0020441946,0.002515321,0.12421051],"genre_scores_gemma":[0.94319284,0.00053371786,0.021133412,0.0005910032,0.00020012532,0.00016536664,0.000875969,0.0007620711,0.032545492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998295,0.00051769346,0.00008166936,0.000363205,0.00034686064,0.0003955229],"domain_scores_gemma":[0.9923781,0.003679879,0.0008052344,0.0009755313,0.0009933253,0.001167842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021166347,0.0006446117,0.0012095447,0.0020170528,0.0020547425,0.0026933467,0.00085242203,0.0012237354,0.016572796],"category_scores_gemma":[0.009530796,0.00061792607,0.0012776983,0.0012259883,0.0029131933,0.003625759,0.0015335155,0.0014597914,0.003165705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023085001,0.000053396063,0.0013364825,0.000080077065,0.000023952498,0.00018057816,0.00026659845,0.005861657,0.0009308457,0.97492796,0.009644981,0.006462613],"study_design_scores_gemma":[0.0000536841,0.000027115611,0.0005474441,0.000036879093,0.00001585403,0.00017124966,0.00008950435,0.018253066,0.0010547035,0.97581553,0.0039081317,0.000026848926],"about_ca_topic_score_codex":0.0034251737,"about_ca_topic_score_gemma":0.005846193,"teacher_disagreement_score":0.016572796,"about_ca_system_score_codex":0.0017192316,"about_ca_system_score_gemma":0.0014830884,"threshold_uncertainty_score":0.05544156},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04714458,0.00048125122,0.36818033,0.0015129895,0.001297686,0.0007471378,0.017912675,0.016719645,0.5460038],"genre_scores_gemma":[0.3892804,0.0009689044,0.20581469,0.001975274,0.0005914719,0.001098651,0.027524421,0.008326463,0.36441973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952126,0.00009596482,0.000026562378,0.00012796828,0.000113718284,0.00011454954],"domain_scores_gemma":[0.99822575,0.0005072609,0.00009176601,0.00045330983,0.0005959776,0.00012597279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042951363,0.00042443327,0.00036833304,0.0012680123,0.0012399553,0.00191994,0.0009029218,0.00059042167,0.10718934],"category_scores_gemma":[0.0025695332,0.0003753393,0.00038295944,0.0015725393,0.00083396985,0.0026755128,0.0015455959,0.001053523,0.02430186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033004835,0.000105917,0.0009823203,0.00037516476,0.000022942646,0.00036834567,0.0006335085,0.0015332134,0.017758207,0.70784426,0.17439538,0.09565071],"study_design_scores_gemma":[0.000059628303,0.000063238534,0.0009596064,0.00012487733,0.0000355476,0.0005449367,0.00033004358,0.009124845,0.035378728,0.24735385,0.7059569,0.000067790264],"about_ca_topic_score_codex":0.0032400447,"about_ca_topic_score_gemma":0.0051525203,"teacher_disagreement_score":0.10718934,"about_ca_system_score_codex":0.000989593,"about_ca_system_score_gemma":0.001327318,"threshold_uncertainty_score":0.35858405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80696565,0.0012586028,0.12863052,0.0017058788,0.0002601555,0.000092005546,0.0004672788,0.00042699874,0.06019301],"genre_scores_gemma":[0.9898471,0.00043403808,0.0065575843,0.00019465931,0.00012891508,0.0000358665,0.00017759006,0.000081548635,0.0025425921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903643,0.00025435392,0.000051168656,0.00024972917,0.00020560702,0.0002027631],"domain_scores_gemma":[0.991193,0.0052881544,0.0009650832,0.0015083482,0.00040231325,0.00064306054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013698688,0.00061635417,0.0010556298,0.001339639,0.0014480354,0.0029246744,0.0016130997,0.0011517423,0.0060621],"category_scores_gemma":[0.0057207868,0.0006688295,0.00118693,0.0013799131,0.004104944,0.007158592,0.0021651562,0.0019878387,0.00028862982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001813043,0.00003887923,0.0011533891,0.00011291244,0.000033223783,0.00036963474,0.0006114071,0.002670267,0.002436108,0.9848251,0.0015431927,0.006024617],"study_design_scores_gemma":[0.000029001383,0.00002591427,0.0005995477,0.000012717184,0.000024175175,0.00022969558,0.00013415821,0.0042837122,0.0007408359,0.99246585,0.0014427132,0.000011752257],"about_ca_topic_score_codex":0.0009893234,"about_ca_topic_score_gemma":0.00096397294,"teacher_disagreement_score":0.0060621,"about_ca_system_score_codex":0.0010113625,"about_ca_system_score_gemma":0.00043160826,"threshold_uncertainty_score":0.020279706},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53110546,0.0027293947,0.33058247,0.00490345,0.0004525154,0.00007363618,0.00032949183,0.0004349516,0.12938863],"genre_scores_gemma":[0.95947164,0.0011125538,0.018073063,0.0005397212,0.00054775993,0.00009705286,0.0001999081,0.000223197,0.019734988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989361,0.0003044641,0.00006885447,0.00020799252,0.00030331756,0.00017924585],"domain_scores_gemma":[0.9945738,0.0030701857,0.00042652222,0.0004189574,0.00083545956,0.00067512173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018909735,0.000543891,0.0011388307,0.002589128,0.0017935674,0.0027902832,0.0015601328,0.0013177138,0.005497874],"category_scores_gemma":[0.008370473,0.00062937575,0.0011438646,0.0011398346,0.004361643,0.009143427,0.005352354,0.003429889,0.0007053763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029071925,0.000025874719,0.0002362705,0.000027667229,0.000008089799,0.00009344826,0.00019560705,0.00037893103,0.0009084362,0.9953667,0.000453582,0.0022761882],"study_design_scores_gemma":[0.000013553445,0.000014293736,0.00026933907,0.000008706793,0.000008137206,0.00015042388,0.00009653496,0.00579183,0.0005893103,0.99171865,0.001326961,0.000012362484],"about_ca_topic_score_codex":0.000793565,"about_ca_topic_score_gemma":0.00047880432,"teacher_disagreement_score":0.005497874,"about_ca_system_score_codex":0.00086739974,"about_ca_system_score_gemma":0.0005972329,"threshold_uncertainty_score":0.018392205},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43878382,0.00076198945,0.5354197,0.0009419607,0.0001834769,0.00013725091,0.0008792348,0.00069329597,0.022199221],"genre_scores_gemma":[0.76213336,0.0004270602,0.21855865,0.0003339548,0.00013579303,0.00014133201,0.0011971854,0.00044662828,0.016625991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986284,0.00052838714,0.00006711009,0.00027546517,0.00025814332,0.00024257816],"domain_scores_gemma":[0.9950447,0.002205593,0.00049530383,0.0011369126,0.0005525179,0.0005649307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016663015,0.0009819996,0.001326285,0.0017814356,0.0012162651,0.0024390311,0.0025129346,0.0013175318,0.0052559087],"category_scores_gemma":[0.007974883,0.0007784527,0.000777439,0.0026856484,0.0011127408,0.0034935358,0.0019372985,0.0015939502,0.0006821316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007235257,0.00040471242,0.0072307154,0.0004920554,0.00015444205,0.00021379507,0.00053733727,0.13465688,0.015420238,0.65642196,0.015438735,0.16830562],"study_design_scores_gemma":[0.000052007395,0.00006147701,0.0015234429,0.000040348186,0.00006210571,0.00016497365,0.00014048534,0.28355324,0.0043673646,0.7041999,0.0058071585,0.000027479146],"about_ca_topic_score_codex":0.0024738149,"about_ca_topic_score_gemma":0.0035499344,"teacher_disagreement_score":0.0052559087,"about_ca_system_score_codex":0.0015862965,"about_ca_system_score_gemma":0.0007838244,"threshold_uncertainty_score":0.017582774},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85952014,0.0009795,0.080050655,0.0015718162,0.00021925432,0.00009958879,0.00039225124,0.00068138936,0.05648534],"genre_scores_gemma":[0.9304304,0.0005271568,0.046367146,0.0003631581,0.00030336835,0.000059971146,0.0012148166,0.00017969728,0.020554291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996153,0.000080233745,0.000021560256,0.0000654687,0.000110841414,0.00010652179],"domain_scores_gemma":[0.99875784,0.00050401886,0.00016804322,0.0001446889,0.0002400444,0.00018543887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005307475,0.00061920244,0.00063158857,0.0040106857,0.0016408445,0.0025970133,0.00073614967,0.0012733612,0.0056826565],"category_scores_gemma":[0.0026645244,0.00029197015,0.0004567043,0.0012971046,0.0019425481,0.0023347917,0.0012460622,0.0018067798,0.0012029938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034914352,0.0001612436,0.008947341,0.00015374678,0.000023500856,0.00022695446,0.0016777008,0.0037323288,0.008827853,0.83131504,0.0075123967,0.13707279],"study_design_scores_gemma":[0.00003891455,0.000112400856,0.0022299085,0.00008143056,0.000017897322,0.00031127295,0.00048062913,0.015544416,0.0036475908,0.94767547,0.029829018,0.000031132593],"about_ca_topic_score_codex":0.0017605812,"about_ca_topic_score_gemma":0.0013228228,"teacher_disagreement_score":0.0056826565,"about_ca_system_score_codex":0.0009758287,"about_ca_system_score_gemma":0.0006742657,"threshold_uncertainty_score":0.019010365},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6089128,0.00037570824,0.26473865,0.00039910915,0.00018083001,0.00014254118,0.0009744834,0.0006231949,0.12365266],"genre_scores_gemma":[0.93907905,0.0003506681,0.036265288,0.00021018017,0.000101189755,0.00010797234,0.0006453453,0.00013251814,0.023107905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919385,0.0001864864,0.00004392573,0.00020609236,0.0002063303,0.00016327894],"domain_scores_gemma":[0.9961622,0.0017408152,0.00036629508,0.00056885456,0.00059389375,0.0005678724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005945213,0.00038140424,0.0006065056,0.0015800159,0.0016350633,0.0022336151,0.00089724065,0.0007224283,0.008364689],"category_scores_gemma":[0.0040279836,0.0005730781,0.00039469096,0.0016148954,0.0010293713,0.002766722,0.0015355174,0.0009180379,0.00090744504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018534512,0.00006961116,0.0011908368,0.00010570139,0.000034189146,0.0005000438,0.00045425806,0.0029098478,0.008716269,0.9651043,0.0026111545,0.018118521],"study_design_scores_gemma":[0.00006447726,0.00006053723,0.0014299866,0.000046395366,0.000082041726,0.0010635979,0.00041393127,0.026570661,0.009079766,0.9505162,0.0106404135,0.00003197315],"about_ca_topic_score_codex":0.00063942384,"about_ca_topic_score_gemma":0.0010110837,"teacher_disagreement_score":0.008364689,"about_ca_system_score_codex":0.0006633464,"about_ca_system_score_gemma":0.0005347375,"threshold_uncertainty_score":0.027982652},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13604164,0.0019923432,0.13196014,0.0066643814,0.0005171564,0.000085597356,0.0015958351,0.0005373223,0.7206056],"genre_scores_gemma":[0.77522105,0.0025723241,0.02213842,0.0015903905,0.0006776441,0.00018879729,0.0019264265,0.00081038906,0.19487454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945945,0.000111076704,0.00002194181,0.00014569072,0.00016116453,0.0001006599],"domain_scores_gemma":[0.9991959,0.00029501048,0.00008435788,0.0001600778,0.00014162455,0.00012304929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047829133,0.00083993556,0.0012465175,0.001638293,0.0017481353,0.0029374715,0.0011754833,0.001025589,0.035131995],"category_scores_gemma":[0.0021505244,0.0005809275,0.0011374485,0.0018168662,0.0019058961,0.0051076435,0.0035850024,0.004874601,0.0047485316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028210723,0.000011899669,0.00012933442,0.000047034664,0.000011978093,0.00007335485,0.00007867726,0.0010639115,0.00059667253,0.9836,0.007472101,0.006886813],"study_design_scores_gemma":[0.000012762844,0.000009158168,0.00027358858,0.0000141659675,0.000017553464,0.00027781219,0.000090059955,0.0033307194,0.00056294777,0.98358524,0.011818317,0.0000077639825],"about_ca_topic_score_codex":0.00075548474,"about_ca_topic_score_gemma":0.00096114835,"teacher_disagreement_score":0.035131995,"about_ca_system_score_codex":0.0015026311,"about_ca_system_score_gemma":0.0006137193,"threshold_uncertainty_score":0.1175282},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80030423,0.00066254055,0.14854835,0.0031366388,0.00040267804,0.000087702785,0.00071533606,0.0012027108,0.044939823],"genre_scores_gemma":[0.94841194,0.00041022743,0.027107535,0.00033029425,0.00040932547,0.00018245653,0.000604088,0.00036984906,0.02217438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983285,0.00031056,0.000088597255,0.00039813804,0.00046251906,0.0004118083],"domain_scores_gemma":[0.98407364,0.010270346,0.0010894648,0.0011018247,0.001059582,0.0024051515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017022202,0.0008980412,0.0019433451,0.004036574,0.003106711,0.004848158,0.0039300593,0.0028036374,0.01598533],"category_scores_gemma":[0.013339563,0.0008444802,0.0015401989,0.0023032024,0.0043426766,0.009136535,0.004457192,0.0046540364,0.001055821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037542268,0.0000771235,0.0011968168,0.000111813024,0.000028824885,0.0001182146,0.00046037463,0.003932998,0.003072569,0.97555393,0.0030378876,0.012033873],"study_design_scores_gemma":[0.000038303897,0.000044239434,0.0007692758,0.000017976763,0.000027353293,0.00011604707,0.000112156406,0.020316418,0.0014718069,0.9757859,0.0012717486,0.00002873709],"about_ca_topic_score_codex":0.0010408658,"about_ca_topic_score_gemma":0.0011556383,"teacher_disagreement_score":0.01598533,"about_ca_system_score_codex":0.0022621783,"about_ca_system_score_gemma":0.0010231038,"threshold_uncertainty_score":0.053476274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8545347,0.0019352755,0.098515354,0.0055417847,0.00024634792,0.00007724185,0.00074255565,0.00027390412,0.03813295],"genre_scores_gemma":[0.9555597,0.001073693,0.032997616,0.00033276813,0.0005580412,0.00014867247,0.0007029357,0.00021754355,0.008409061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984201,0.0005399642,0.00008060967,0.00040953798,0.00031047655,0.00023922222],"domain_scores_gemma":[0.9654958,0.028010327,0.0019535297,0.0009951069,0.0009590535,0.0025860965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030525734,0.0011344451,0.001959009,0.003941556,0.0026777158,0.004287483,0.0040835044,0.0030926147,0.007268356],"category_scores_gemma":[0.01954498,0.0014314394,0.0012550767,0.0023792607,0.0057349456,0.011161357,0.003168156,0.0028411653,0.0004566888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008187449,0.00019851256,0.005248912,0.00060053775,0.00013960034,0.00049160124,0.00141412,0.046026416,0.009450701,0.91495496,0.005103449,0.015552451],"study_design_scores_gemma":[0.00007785391,0.00007305208,0.002034888,0.0000758699,0.00006271286,0.00033468983,0.00041517927,0.113719,0.0013980606,0.87963486,0.0021234434,0.000050363284],"about_ca_topic_score_codex":0.0016107293,"about_ca_topic_score_gemma":0.0022837222,"teacher_disagreement_score":0.007268356,"about_ca_system_score_codex":0.0018700868,"about_ca_system_score_gemma":0.0006632215,"threshold_uncertainty_score":0.024315119},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79037136,0.0012477684,0.082344204,0.0033179303,0.00044950988,0.000081152466,0.00079320295,0.0003780532,0.12101679],"genre_scores_gemma":[0.9473413,0.0011564887,0.022562923,0.000333696,0.00073185546,0.000121149904,0.0011153824,0.00021064376,0.026426457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990376,0.0002459016,0.000041897285,0.00019980244,0.00029943854,0.00017542116],"domain_scores_gemma":[0.9932522,0.0037796579,0.00080073864,0.00033094132,0.0004890898,0.0013472569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011803962,0.0010850898,0.0014320395,0.0061268792,0.002601611,0.003961207,0.0026103994,0.0019592748,0.013005939],"category_scores_gemma":[0.0061780144,0.0006889497,0.00085521303,0.003025415,0.0048785023,0.008077167,0.0025979832,0.0039038719,0.0013138234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030301168,0.00005675255,0.0016509974,0.0001242512,0.000022244209,0.00018941617,0.00060538936,0.0071836296,0.00207425,0.9709779,0.003925618,0.01288664],"study_design_scores_gemma":[0.000038656566,0.00007928242,0.0023223865,0.00004503646,0.000025751464,0.000210656,0.00024323828,0.024964355,0.0010267572,0.9669357,0.0040713856,0.000036745696],"about_ca_topic_score_codex":0.00211903,"about_ca_topic_score_gemma":0.0019874922,"teacher_disagreement_score":0.013005939,"about_ca_system_score_codex":0.002371068,"about_ca_system_score_gemma":0.0006794096,"threshold_uncertainty_score":0.043509185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73002905,0.0030837907,0.13231769,0.0025139682,0.0007610345,0.00022682859,0.007419213,0.002446933,0.12120151],"genre_scores_gemma":[0.9577132,0.00087706384,0.01446038,0.00031336027,0.00021865414,0.00020397159,0.0026555448,0.00030634014,0.023251524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682957,0.0004440636,0.0004166961,0.0009422956,0.0005679235,0.00079937506],"domain_scores_gemma":[0.9921549,0.0038472419,0.001086836,0.0011150362,0.0009122558,0.0008837793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016064438,0.0014143378,0.0018777488,0.002953416,0.004922861,0.011301946,0.0024822154,0.0021564604,0.011082357],"category_scores_gemma":[0.006508674,0.0012657064,0.001461762,0.0025687816,0.0076001487,0.01372809,0.0042863595,0.0018821054,0.0043215333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025482094,0.0001958944,0.009057846,0.0015341208,0.0004166843,0.0033242442,0.007195071,0.0018659417,0.017952323,0.88558143,0.009227318,0.061100855],"study_design_scores_gemma":[0.000066057044,0.00014483689,0.0021234744,0.00030279817,0.00019663431,0.0024043273,0.0022598878,0.0033840854,0.015423784,0.95559144,0.017955748,0.0001469709],"about_ca_topic_score_codex":0.0005273897,"about_ca_topic_score_gemma":0.00036321714,"teacher_disagreement_score":0.011301946,"about_ca_system_score_codex":0.0011090038,"about_ca_system_score_gemma":0.0013204751,"threshold_uncertainty_score":0.03707415},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16684806,0.00077079126,0.8215179,0.00023492216,0.00013577462,0.00003666823,0.00011018712,0.00028521943,0.010060517],"genre_scores_gemma":[0.8841508,0.00046196146,0.10577862,0.000058259106,0.000089813904,0.00009003241,0.00014441134,0.00017076907,0.009055313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933344,0.000150638,0.000034525132,0.00016845642,0.00022222043,0.00009066464],"domain_scores_gemma":[0.99750936,0.00088002265,0.00063389674,0.0004055434,0.00033151294,0.000239556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012008579,0.0010423517,0.00075449154,0.0016279055,0.0010725735,0.0020859712,0.0027211667,0.0023531432,0.004917725],"category_scores_gemma":[0.007888722,0.0006681969,0.0006105516,0.0011198907,0.0034550058,0.003801297,0.003669009,0.0028979601,0.0009066197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027919476,0.00006243089,0.00035012007,0.00010231964,0.000014696509,0.000081789614,0.00035113626,0.05492324,0.0046873726,0.8927263,0.0009114985,0.045509834],"study_design_scores_gemma":[0.00006858174,0.00016409157,0.00037977932,0.000050189636,0.000023818566,0.00012348163,0.00017631473,0.16601402,0.0047830218,0.8245538,0.003592439,0.00007057679],"about_ca_topic_score_codex":0.00046107086,"about_ca_topic_score_gemma":0.0005162265,"teacher_disagreement_score":0.004917725,"about_ca_system_score_codex":0.0005945247,"about_ca_system_score_gemma":0.00048197602,"threshold_uncertainty_score":0.016451359},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25528178,0.0033679793,0.47579908,0.0034044057,0.00118646,0.00009548965,0.00036091055,0.00048209992,0.26002178],"genre_scores_gemma":[0.9100114,0.002239679,0.045964155,0.0007651284,0.001441099,0.000073894684,0.00024943263,0.0001450118,0.039110165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889153,0.00032173653,0.00008975822,0.00024317535,0.00029379045,0.00016006842],"domain_scores_gemma":[0.9984219,0.00043531816,0.00020588993,0.00033082344,0.00035294614,0.00025318278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016877145,0.00080475095,0.0009555248,0.0016843411,0.0016170563,0.0030111934,0.0011395589,0.00093537645,0.005919374],"category_scores_gemma":[0.0036685888,0.0004649174,0.001677764,0.0011683939,0.0033515305,0.008185239,0.0031415394,0.0028867894,0.00076470437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070394613,0.000010485785,0.000104110586,0.000009689049,0.000003781282,0.000039510534,0.0001061892,0.00027546272,0.00024523653,0.9965114,0.00027012496,0.0024168966],"study_design_scores_gemma":[0.0000045166244,0.000007847075,0.00013744195,0.0000056875333,0.000005923045,0.000107673455,0.00003060513,0.0021208895,0.00017580521,0.99468356,0.0027127238,0.0000073158612],"about_ca_topic_score_codex":0.0018197412,"about_ca_topic_score_gemma":0.0013143357,"teacher_disagreement_score":0.005919374,"about_ca_system_score_codex":0.0017081479,"about_ca_system_score_gemma":0.0011164268,"threshold_uncertainty_score":0.019802272},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8982736,0.00046843066,0.061974846,0.0011045075,0.000195144,0.000034258424,0.00020349633,0.00027949808,0.037466276],"genre_scores_gemma":[0.9696415,0.00033842566,0.015279729,0.00025859615,0.00018671012,0.000048951842,0.00032290845,0.00021861374,0.013704651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896145,0.00030234823,0.000058971265,0.0001927483,0.00025732524,0.00022721416],"domain_scores_gemma":[0.9950446,0.0019544552,0.0005761064,0.0005617496,0.0005930707,0.0012699326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012130978,0.0005291299,0.0011082444,0.0033445738,0.0027513811,0.0038699976,0.0017154972,0.0015522365,0.0057699136],"category_scores_gemma":[0.0059313867,0.0009881529,0.0011883598,0.0015665039,0.0042468226,0.0048427316,0.0026145568,0.0024591098,0.0005381746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007155878,0.000033283923,0.0009437656,0.000028304245,0.0000062185786,0.00010636959,0.0005789176,0.0017296637,0.0008615715,0.99185586,0.00093444384,0.0028500464],"study_design_scores_gemma":[0.000014990318,0.000009852329,0.00044813153,0.000012240063,0.0000061419896,0.00010864596,0.000264815,0.0078716315,0.0003623095,0.98988414,0.0010068541,0.000010251104],"about_ca_topic_score_codex":0.002360652,"about_ca_topic_score_gemma":0.0030875364,"teacher_disagreement_score":0.0057699136,"about_ca_system_score_codex":0.0018026703,"about_ca_system_score_gemma":0.0007768665,"threshold_uncertainty_score":0.019302249},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15828441,0.003370543,0.79184514,0.0017891098,0.00032898056,0.00004275404,0.00026931497,0.00020730191,0.043862425],"genre_scores_gemma":[0.896226,0.0030479233,0.080448166,0.00030020764,0.00050559215,0.00008570053,0.00034619754,0.00017473122,0.018865513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997951,0.00083438226,0.000057816585,0.00026242647,0.0005470596,0.0003473673],"domain_scores_gemma":[0.99214995,0.005228259,0.00063679693,0.0004873334,0.0009666591,0.00053096906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029431107,0.00080514204,0.0011904235,0.0017019316,0.0007394359,0.0025431714,0.0020145483,0.0011709426,0.006930711],"category_scores_gemma":[0.02339988,0.00048451917,0.00077684683,0.0019489743,0.002745283,0.004034518,0.0024818752,0.0035246138,0.0011010388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100493766,0.0000186236,0.00031046916,0.00005820305,0.0000121143785,0.000048215457,0.0001210899,0.0114268875,0.00078974356,0.9752935,0.0011087208,0.01071189],"study_design_scores_gemma":[0.00003271937,0.000037665224,0.00032783052,0.000038243918,0.000016086793,0.000121998426,0.00009787091,0.135889,0.0005689522,0.86023235,0.002608357,0.000028930972],"about_ca_topic_score_codex":0.0029919767,"about_ca_topic_score_gemma":0.0018700449,"teacher_disagreement_score":0.006930711,"about_ca_system_score_codex":0.0017269817,"about_ca_system_score_gemma":0.0009405526,"threshold_uncertainty_score":0.023185551},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46881333,0.0039948495,0.108895645,0.07138227,0.0050372863,0.000103499005,0.0016961003,0.0010331193,0.33904392],"genre_scores_gemma":[0.951427,0.0015672762,0.0142263835,0.0047002058,0.0038607642,0.00014048336,0.001105509,0.00033170852,0.022640646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975261,0.0005474826,0.00015228335,0.00074571726,0.0005539462,0.0004744655],"domain_scores_gemma":[0.988091,0.007695714,0.00092474686,0.00143913,0.0008468584,0.001002539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036367571,0.0010185756,0.002802122,0.0033276174,0.004787707,0.007983197,0.003229719,0.0048055956,0.015889486],"category_scores_gemma":[0.017832913,0.0008325149,0.001966668,0.004279269,0.011920211,0.019161182,0.0062680785,0.008909581,0.0021173481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010860883,0.000027106618,0.00039316367,0.00005297878,0.0000099800745,0.00005948277,0.00030467886,0.00058475026,0.00027655423,0.9905759,0.0043212757,0.0032853861],"study_design_scores_gemma":[0.000024345805,0.000010198644,0.00016008138,0.000014779044,0.000007441618,0.000040469815,0.000057825393,0.0011164052,0.000112649366,0.9966857,0.0017588352,0.000011216497],"about_ca_topic_score_codex":0.0020047484,"about_ca_topic_score_gemma":0.0011192065,"teacher_disagreement_score":0.015889486,"about_ca_system_score_codex":0.003299741,"about_ca_system_score_gemma":0.0012925565,"threshold_uncertainty_score":0.05315566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6896503,0.00058938435,0.22401647,0.0010794473,0.0005987732,0.0001777396,0.0005496085,0.0018455564,0.0814928],"genre_scores_gemma":[0.7853267,0.00092258415,0.15690461,0.00055924425,0.00022431668,0.00019467424,0.0009000718,0.0011371574,0.053830605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961674,0.0000803786,0.000012334784,0.000074713396,0.00008757777,0.00012821871],"domain_scores_gemma":[0.9989506,0.0004280378,0.00006318027,0.00020532034,0.00015073219,0.00020206737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026585817,0.00073068304,0.0006807892,0.0010771557,0.001498184,0.002413362,0.001033915,0.00090324495,0.016469287],"category_scores_gemma":[0.0013012803,0.0006570353,0.0006035935,0.0013518719,0.00087846175,0.0018784165,0.0016602839,0.0015900506,0.002028195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073335867,0.00028982142,0.003717709,0.00047186998,0.00007486109,0.0006877444,0.0012712787,0.038269646,0.06356352,0.657261,0.027223807,0.20643538],"study_design_scores_gemma":[0.00012494595,0.00013664333,0.0026242074,0.0000798616,0.000065219945,0.0003639196,0.0011368785,0.07917879,0.02285234,0.8605718,0.032824647,0.00004077057],"about_ca_topic_score_codex":0.002300605,"about_ca_topic_score_gemma":0.004416,"teacher_disagreement_score":0.016469287,"about_ca_system_score_codex":0.001296899,"about_ca_system_score_gemma":0.00051385385,"threshold_uncertainty_score":0.055095315},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016347032,0.011355944,0.17022394,0.09377461,0.14378932,0.0001534052,0.0023634494,0.0013114356,0.56068075],"genre_scores_gemma":[0.23772396,0.0142605435,0.06784486,0.021815822,0.11577871,0.00033093037,0.0044690706,0.0020735932,0.5357025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863476,0.00020093311,0.000074236144,0.00034086106,0.00059160736,0.00015744385],"domain_scores_gemma":[0.9955562,0.0015669488,0.00020857889,0.0008072372,0.0012985625,0.00056251144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001342273,0.0018249116,0.0015753485,0.0029320703,0.0025695625,0.003835434,0.0028465376,0.0014455988,0.055792987],"category_scores_gemma":[0.0065186904,0.0006583498,0.002542337,0.0031292585,0.0024775844,0.008478883,0.006552422,0.0058691236,0.017037818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014158967,0.00010580251,0.0004636794,0.00042685284,0.00007914733,0.0002520617,0.00031821238,0.00068072014,0.001993109,0.7332698,0.20111835,0.061150726],"study_design_scores_gemma":[0.000022674949,0.00004410245,0.0006166145,0.00004097743,0.000088561734,0.0005406486,0.000076653516,0.001017381,0.0010347998,0.67555475,0.3209097,0.00005314183],"about_ca_topic_score_codex":0.00121954,"about_ca_topic_score_gemma":0.0016301303,"teacher_disagreement_score":0.055792987,"about_ca_system_score_codex":0.0019123253,"about_ca_system_score_gemma":0.0010720029,"threshold_uncertainty_score":0.18664616},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09830376,0.0011004645,0.5580331,0.0021162515,0.0009524998,0.00022022358,0.002302646,0.0013601719,0.33561096],"genre_scores_gemma":[0.73068553,0.002265038,0.12569435,0.0011634543,0.0011284611,0.00028526766,0.004319312,0.0019480493,0.13251063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934405,0.00016371513,0.000036444257,0.00015224723,0.00019411677,0.000109425244],"domain_scores_gemma":[0.99857736,0.0006203427,0.00012580473,0.00021195332,0.0003016204,0.00016283059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009845523,0.00078424846,0.0005369656,0.0024460824,0.0012387519,0.003468569,0.0011997159,0.001033084,0.035452124],"category_scores_gemma":[0.0045088422,0.00042094523,0.0010388681,0.0019817434,0.002194706,0.0050004385,0.0025675944,0.0028189297,0.010294416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004133737,0.00003218406,0.00018826268,0.00007409908,0.000004487358,0.00008986681,0.00035158434,0.0013240018,0.00074919907,0.9623445,0.012060228,0.02274019],"study_design_scores_gemma":[0.000013757012,0.000017899903,0.00021417892,0.000029880195,0.0000067117653,0.00016534294,0.00011682247,0.0043515046,0.00075450324,0.9769508,0.017356237,0.00002226657],"about_ca_topic_score_codex":0.0015136423,"about_ca_topic_score_gemma":0.002826802,"teacher_disagreement_score":0.035452124,"about_ca_system_score_codex":0.0013390565,"about_ca_system_score_gemma":0.00060344907,"threshold_uncertainty_score":0.11859918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86048186,0.00046628795,0.08420524,0.001127511,0.000085740576,0.000043893226,0.000590276,0.0001949736,0.052804165],"genre_scores_gemma":[0.9761377,0.0003453018,0.011609167,0.00015485777,0.00007928119,0.000053070562,0.000528623,0.00008369045,0.011008396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993303,0.00014855353,0.000028791192,0.00016591288,0.00015369448,0.00017271486],"domain_scores_gemma":[0.99499303,0.0031825288,0.00053974695,0.00040973746,0.00040333736,0.00047165484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006186288,0.00035991243,0.0008045277,0.0011415591,0.0015679186,0.0029453533,0.0008352104,0.0007299237,0.008220494],"category_scores_gemma":[0.003694766,0.00066417415,0.0006762594,0.0014752545,0.0030414115,0.0036137137,0.0019540808,0.0020549607,0.00058499136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017175543,0.000041054995,0.0022219957,0.00009124028,0.000018790575,0.0002041974,0.00095009163,0.0031986504,0.0021503363,0.979736,0.0017144636,0.009501495],"study_design_scores_gemma":[0.000027968254,0.000018396775,0.00095090613,0.000015827176,0.000012653496,0.00014213791,0.00019623581,0.0058925627,0.0006946288,0.9896054,0.0024300285,0.000013193338],"about_ca_topic_score_codex":0.0035804454,"about_ca_topic_score_gemma":0.004388543,"teacher_disagreement_score":0.008220494,"about_ca_system_score_codex":0.0010254199,"about_ca_system_score_gemma":0.000757621,"threshold_uncertainty_score":0.027500272},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76124805,0.001090168,0.16393426,0.0012614208,0.00028896314,0.000067492045,0.0010363042,0.0004501236,0.070623204],"genre_scores_gemma":[0.9616744,0.0004229771,0.019362275,0.0003939671,0.0002466847,0.0001712203,0.0011236524,0.0002290901,0.016375689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845254,0.00038920992,0.00011269215,0.00039102774,0.00042760614,0.00022685768],"domain_scores_gemma":[0.99559695,0.002138224,0.00075058866,0.00046580803,0.00040750112,0.0006410049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000915993,0.0009847761,0.0015736087,0.0037601085,0.002957907,0.0063806404,0.003004633,0.0016147754,0.0059177186],"category_scores_gemma":[0.0047101583,0.0010727549,0.0011702195,0.0026837091,0.0043600677,0.004344081,0.0036820986,0.002211238,0.0010312231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000736731,0.00002854066,0.00031601108,0.000032167012,0.00001969652,0.00009803731,0.00023622294,0.0009810441,0.0006795711,0.99408877,0.00079385197,0.0026524416],"study_design_scores_gemma":[0.000022998047,0.000012437922,0.0003139663,0.000015691896,0.000016864207,0.00015304066,0.00016282874,0.0043823784,0.0006737871,0.99268675,0.0015390323,0.000020254463],"about_ca_topic_score_codex":0.00090334605,"about_ca_topic_score_gemma":0.00072570663,"teacher_disagreement_score":0.0063806404,"about_ca_system_score_codex":0.0015667754,"about_ca_system_score_gemma":0.00050658954,"threshold_uncertainty_score":0.019796789},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9291671,0.0008203432,0.023650784,0.000636412,0.000048779835,0.00002117153,0.00042471124,0.00011584552,0.04511485],"genre_scores_gemma":[0.98592585,0.00053865224,0.0037538472,0.00008056581,0.00011316334,0.000023448538,0.00035422057,0.000037457725,0.009172707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994535,0.00007830014,0.00001832684,0.0000944417,0.00018074752,0.00017466051],"domain_scores_gemma":[0.9986557,0.00079111126,0.00017109806,0.0001238261,0.00008367794,0.00017458835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024308516,0.00039811042,0.00076078443,0.001346254,0.0015750335,0.0029497505,0.00076059595,0.0009084425,0.007957469],"category_scores_gemma":[0.002099759,0.0004339431,0.00060720346,0.0019959148,0.0012515939,0.0023540456,0.0012214343,0.0012312486,0.00035495523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037579134,0.00007703641,0.0021144405,0.0001272003,0.000048742142,0.0004219317,0.00069444574,0.017237976,0.00548701,0.9481491,0.0028425418,0.022423632],"study_design_scores_gemma":[0.000057632034,0.00005215586,0.0029713195,0.000035174362,0.00006849536,0.00056864455,0.00028074023,0.049884334,0.0029996156,0.934191,0.0088687455,0.000022279348],"about_ca_topic_score_codex":0.0026473955,"about_ca_topic_score_gemma":0.0028105623,"teacher_disagreement_score":0.007957469,"about_ca_system_score_codex":0.0016900726,"about_ca_system_score_gemma":0.00041769168,"threshold_uncertainty_score":0.026620328},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057889283,0.0064958376,0.7300163,0.010812771,0.0038228524,0.00016186203,0.0011415596,0.0011122901,0.18854724],"genre_scores_gemma":[0.638605,0.010175528,0.28089446,0.0058284714,0.004974871,0.0005432424,0.0012896232,0.0010441773,0.056644667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983954,0.00036119067,0.0001409934,0.0003936626,0.0005378585,0.00017092399],"domain_scores_gemma":[0.9945281,0.0028710885,0.00041034824,0.00082331366,0.00093516754,0.00043197811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026431445,0.0017645326,0.0020412276,0.0050229128,0.0024507293,0.0034092146,0.0023070022,0.002178104,0.01424417],"category_scores_gemma":[0.008704247,0.000990381,0.0027373638,0.0033736532,0.004417854,0.01133045,0.0070501566,0.0076191984,0.0025995292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003927751,0.00004939653,0.00037904872,0.0002093761,0.000035842448,0.00021956682,0.00030356218,0.0010730495,0.0015733624,0.97300446,0.0059712804,0.01714177],"study_design_scores_gemma":[0.000025064332,0.000026563192,0.00039865598,0.00006276942,0.000057631056,0.00043191132,0.000098161436,0.0052859117,0.0008508506,0.9654656,0.027251352,0.00004544411],"about_ca_topic_score_codex":0.0008951805,"about_ca_topic_score_gemma":0.0009259785,"teacher_disagreement_score":0.01424417,"about_ca_system_score_codex":0.0019054617,"about_ca_system_score_gemma":0.0009498292,"threshold_uncertainty_score":0.04765147},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3170109,0.00041496241,0.5436571,0.0009457385,0.00047810233,0.00015819972,0.00078896066,0.0015239911,0.135022],"genre_scores_gemma":[0.7754089,0.00076592306,0.12914144,0.0005382768,0.00010198564,0.00017895778,0.0012513592,0.0009000026,0.09171311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999424,0.0000989901,0.00003140529,0.00017656843,0.00013450692,0.00013447512],"domain_scores_gemma":[0.9984327,0.0007676515,0.00007876219,0.00026184804,0.00016198959,0.00029706262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039066642,0.0010867734,0.00071205804,0.0010655762,0.0014189605,0.002221455,0.0009715748,0.0013554895,0.0185156],"category_scores_gemma":[0.0021134717,0.0009956653,0.0009612317,0.00079556496,0.001318619,0.0046768123,0.0064031202,0.0034690404,0.0022894277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011654342,0.00011271014,0.00049639406,0.00014305941,0.000034928595,0.00077074836,0.001751802,0.00615895,0.009634755,0.9431695,0.0030668506,0.0345438],"study_design_scores_gemma":[0.000039329116,0.00007426427,0.00027043436,0.000052761447,0.000031153813,0.00037375648,0.00081184023,0.013467366,0.0040242164,0.95890266,0.021928022,0.000024091165],"about_ca_topic_score_codex":0.0007919921,"about_ca_topic_score_gemma":0.0017708483,"teacher_disagreement_score":0.0185156,"about_ca_system_score_codex":0.000520455,"about_ca_system_score_gemma":0.00031887056,"threshold_uncertainty_score":0.06194079},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04863934,0.003037284,0.6823288,0.0021043145,0.0031028094,0.00020438054,0.0018119613,0.008672797,0.25009835],"genre_scores_gemma":[0.5182657,0.003274092,0.23911919,0.0027256869,0.0034093924,0.0006945188,0.003150691,0.0053853393,0.22397535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844605,0.0002272954,0.00018217652,0.00043023395,0.0004534427,0.0002607794],"domain_scores_gemma":[0.99806386,0.0005131371,0.0001353291,0.00066182384,0.00037833213,0.0002475377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001131746,0.0010095268,0.0009829932,0.0020163676,0.0019213689,0.0042725126,0.0015392562,0.0013827059,0.024424454],"category_scores_gemma":[0.0024595228,0.00051263865,0.0013215119,0.0018038661,0.0031197413,0.008508483,0.0039746626,0.003762503,0.0074817142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004507552,0.000037794885,0.0003308451,0.00010013478,0.000009150036,0.00016090323,0.00039597086,0.00022574395,0.0021612472,0.93632597,0.013211168,0.046995882],"study_design_scores_gemma":[0.000037256155,0.00007532649,0.0006293149,0.00008801068,0.000027610984,0.0012465143,0.0003158896,0.0030199038,0.005203641,0.64879924,0.34046924,0.00008814373],"about_ca_topic_score_codex":0.0007255915,"about_ca_topic_score_gemma":0.0007570837,"teacher_disagreement_score":0.024424454,"about_ca_system_score_codex":0.0012926494,"about_ca_system_score_gemma":0.0010721848,"threshold_uncertainty_score":0.081707954},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3713726,0.00043908245,0.55735254,0.00055638776,0.00022231412,0.00029514605,0.0011918027,0.0007844035,0.06778567],"genre_scores_gemma":[0.7390316,0.0005605062,0.22390245,0.0003326319,0.00012134033,0.00029095405,0.002034201,0.00024965705,0.033476714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992685,0.00013885603,0.000061411374,0.00023619442,0.00011906449,0.0001759181],"domain_scores_gemma":[0.99834085,0.0005621172,0.00020743744,0.00035105852,0.00022108867,0.00031743723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050604955,0.0005560457,0.00063833484,0.0016038785,0.0014236125,0.002268441,0.00061245245,0.0006641659,0.010288422],"category_scores_gemma":[0.0020489634,0.0006932833,0.0009409721,0.0012851371,0.0011348337,0.0021811053,0.0020428086,0.001526672,0.0017043459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015270378,0.00012851114,0.0009454861,0.00012846875,0.000030521798,0.00032656154,0.0006516548,0.0049925284,0.005078763,0.9447648,0.0037735773,0.039026488],"study_design_scores_gemma":[0.000040256797,0.000049004597,0.0005509501,0.00004527566,0.000034654084,0.00033387094,0.00033271918,0.018466782,0.00158205,0.96714836,0.01139596,0.000019995305],"about_ca_topic_score_codex":0.0011449902,"about_ca_topic_score_gemma":0.0022323297,"teacher_disagreement_score":0.010288422,"about_ca_system_score_codex":0.00062078517,"about_ca_system_score_gemma":0.0006514505,"threshold_uncertainty_score":0.034418166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6303376,0.0004229019,0.25837702,0.0015062498,0.00032932774,0.00012504224,0.00059358025,0.0008521023,0.10745626],"genre_scores_gemma":[0.95310533,0.00030132078,0.020332972,0.0002131226,0.0001509874,0.00009096345,0.00047879934,0.0001492655,0.02517716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954814,0.00010942849,0.00002894019,0.000095053176,0.00011650346,0.00010190931],"domain_scores_gemma":[0.99877757,0.00045684664,0.00020470336,0.00017037819,0.00018488892,0.00020564844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005929393,0.00058834744,0.00046516693,0.001348343,0.0007550882,0.0030914124,0.00075032114,0.0008439075,0.0065133935],"category_scores_gemma":[0.0018412102,0.00035178603,0.0005892745,0.0010271036,0.0012538662,0.0026048175,0.0015116113,0.0014932525,0.000738055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034687884,0.000021335683,0.00014538929,0.000016295668,0.0000035837616,0.00007301311,0.00029030853,0.00084596704,0.0013469126,0.99146336,0.00056965597,0.0051893773],"study_design_scores_gemma":[0.000018788629,0.000019333755,0.00012669987,0.0000092416985,0.000008671984,0.000085034786,0.0001554386,0.0072220275,0.0006098338,0.98898965,0.0027461597,0.000009098732],"about_ca_topic_score_codex":0.0005250386,"about_ca_topic_score_gemma":0.0006603417,"teacher_disagreement_score":0.0065133935,"about_ca_system_score_codex":0.0008830854,"about_ca_system_score_gemma":0.0003637303,"threshold_uncertainty_score":0.021789432},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6808788,0.00086425146,0.14220218,0.004123705,0.000746667,0.00015691223,0.0005285996,0.0020350744,0.16846383],"genre_scores_gemma":[0.95658845,0.00047820882,0.010326036,0.00046708994,0.0003779658,0.00011241156,0.0004121905,0.00044066092,0.030797042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99774843,0.00046715135,0.000097166936,0.00043113885,0.0006029882,0.00065308716],"domain_scores_gemma":[0.99388313,0.0029913525,0.0004864575,0.00059766317,0.000410419,0.0016309887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011522131,0.0009527693,0.0012396176,0.0042058113,0.0039375704,0.004873805,0.0018753578,0.002204641,0.016263196],"category_scores_gemma":[0.00669178,0.0010773009,0.0016169155,0.0024085175,0.004549136,0.009424191,0.009524775,0.0056324787,0.0015167848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005566729,0.00006261289,0.00026883677,0.000045077948,0.000009552413,0.00018603285,0.00060952845,0.0004638266,0.00059144234,0.9932594,0.0013337516,0.0031143604],"study_design_scores_gemma":[0.00003073184,0.000015749669,0.00030178693,0.000012787039,0.00001821173,0.0001882665,0.00020594354,0.0023458619,0.00050398824,0.99345446,0.0029043085,0.000017838309],"about_ca_topic_score_codex":0.0010885649,"about_ca_topic_score_gemma":0.0009744155,"teacher_disagreement_score":0.016263196,"about_ca_system_score_codex":0.0014180379,"about_ca_system_score_gemma":0.0006740106,"threshold_uncertainty_score":0.05440581},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82234967,0.001094144,0.15168576,0.000993504,0.00023672816,0.000080284946,0.0004838245,0.00040814735,0.022667931],"genre_scores_gemma":[0.9582558,0.00082682585,0.020961508,0.00009991229,0.00014398352,0.000059600083,0.00053129083,0.00031578692,0.018805282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999511,0.000097783035,0.000037297592,0.00008886239,0.00016336021,0.00010166576],"domain_scores_gemma":[0.9975266,0.0007031311,0.00043061154,0.00028830435,0.00044834695,0.00060308806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008490227,0.0010824094,0.00089935947,0.0036891566,0.0016511235,0.0032161234,0.0015451491,0.001405132,0.011471873],"category_scores_gemma":[0.005039888,0.00074700755,0.0007477497,0.0017821345,0.0030205215,0.003459305,0.0034220438,0.0020071904,0.0011131788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016427199,0.00012728492,0.0027444293,0.00013216933,0.000019817411,0.00035830546,0.0011288661,0.019372666,0.004143042,0.94781303,0.0019352299,0.022060923],"study_design_scores_gemma":[0.000026676173,0.00008980296,0.002548559,0.00008889175,0.000013811491,0.0003059458,0.00060846965,0.12299417,0.0015048406,0.8669309,0.0048438436,0.0000441514],"about_ca_topic_score_codex":0.0024189465,"about_ca_topic_score_gemma":0.0029436396,"teacher_disagreement_score":0.011471873,"about_ca_system_score_codex":0.0017783967,"about_ca_system_score_gemma":0.00063993444,"threshold_uncertainty_score":0.038377225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58259094,0.0036366156,0.25677028,0.0018507417,0.00038110474,0.000038167072,0.0002378872,0.00039943797,0.1540949],"genre_scores_gemma":[0.96977645,0.0012537689,0.011292624,0.00014967538,0.00011953699,0.000017346618,0.00011642798,0.000069509006,0.01720463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996325,0.000082466795,0.00001748954,0.00008630001,0.00009061689,0.00009066625],"domain_scores_gemma":[0.9989741,0.00044153346,0.00019437182,0.00015121402,0.00012111667,0.000117680276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040423032,0.00035753005,0.00040691198,0.0014670878,0.0009015902,0.0024205649,0.0007061858,0.0010871963,0.006906121],"category_scores_gemma":[0.0028370828,0.00031858642,0.00028929513,0.001411039,0.0020625375,0.0057879714,0.0015568807,0.0017503285,0.0009053365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034907338,0.000011092232,0.0002504435,0.00002539057,0.0000027792164,0.00004650458,0.00014166815,0.000984695,0.0007724376,0.98504883,0.0005904314,0.012090918],"study_design_scores_gemma":[0.000007780938,0.000010392265,0.00020946287,0.000009223048,0.000007293472,0.00011327598,0.000084488,0.0023717163,0.0005911342,0.9912991,0.005288332,0.000007841704],"about_ca_topic_score_codex":0.0007805404,"about_ca_topic_score_gemma":0.0009795855,"teacher_disagreement_score":0.006906121,"about_ca_system_score_codex":0.00070870796,"about_ca_system_score_gemma":0.00026693023,"threshold_uncertainty_score":0.023103297},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4016828,0.0002796797,0.47570816,0.0022328258,0.00027647233,0.000095834745,0.0004238278,0.001121586,0.11817879],"genre_scores_gemma":[0.923421,0.00020040844,0.047454372,0.00046962846,0.0001738378,0.00012231286,0.00028486334,0.00044667066,0.027426897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984686,0.0004362233,0.00007180185,0.00038467138,0.00026443624,0.00037421306],"domain_scores_gemma":[0.99348044,0.0031485343,0.0007670321,0.00096763053,0.0006197056,0.0010165556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014622366,0.0006394949,0.0008065723,0.0019456752,0.0036212844,0.004238686,0.0012551383,0.0016980771,0.018543787],"category_scores_gemma":[0.006076975,0.0008862671,0.0012092614,0.0014601251,0.004527785,0.008158494,0.004209831,0.003249296,0.0019921286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000075202704,0.000036694833,0.00030744867,0.000022561024,0.0000046120376,0.000135432,0.00050929264,0.0006693845,0.0015069629,0.99010706,0.000732619,0.005892697],"study_design_scores_gemma":[0.000018795812,0.000014809783,0.00017835674,0.000011117284,0.000011860884,0.00016696636,0.00012915801,0.0031397466,0.0012376298,0.9933537,0.0017232897,0.000014546403],"about_ca_topic_score_codex":0.0007665433,"about_ca_topic_score_gemma":0.0010393992,"teacher_disagreement_score":0.018543787,"about_ca_system_score_codex":0.0010094432,"about_ca_system_score_gemma":0.00066239404,"threshold_uncertainty_score":0.062035143},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81868947,0.00027984183,0.084677525,0.0007829527,0.00013899083,0.000117714764,0.0006622833,0.00045163382,0.09419957],"genre_scores_gemma":[0.932477,0.00036585145,0.028984286,0.00030207034,0.00007692996,0.00011529033,0.0013331833,0.00025052307,0.0360949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995291,0.000077725075,0.000027849139,0.000117989366,0.00012512032,0.00012214246],"domain_scores_gemma":[0.99909294,0.00025402042,0.00022433948,0.00008929764,0.00009014438,0.00024915117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003545009,0.0009624872,0.0008024521,0.002070602,0.001790899,0.0035139418,0.0014929496,0.0011156354,0.017566076],"category_scores_gemma":[0.0013347332,0.0009361093,0.00083976914,0.0010361208,0.0017956885,0.0030667388,0.002488882,0.002470319,0.0017655015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024153509,0.00007683671,0.0013167325,0.00011467004,0.000039038743,0.0005510837,0.0005112372,0.0048285024,0.006436137,0.9729945,0.002228059,0.010661791],"study_design_scores_gemma":[0.00008952558,0.00007465618,0.004146567,0.00007539853,0.00007837089,0.00074872683,0.0009085583,0.022634687,0.00477774,0.9546488,0.011752792,0.00006421284],"about_ca_topic_score_codex":0.0015815648,"about_ca_topic_score_gemma":0.0021479046,"teacher_disagreement_score":0.017566076,"about_ca_system_score_codex":0.0010023401,"about_ca_system_score_gemma":0.00038021983,"threshold_uncertainty_score":0.058764398},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67887986,0.00087516446,0.27795732,0.00066376734,0.00020393475,0.000118009026,0.0006778437,0.0011327284,0.039491367],"genre_scores_gemma":[0.9218754,0.00047961433,0.062145393,0.00017133643,0.00016445192,0.00012717304,0.0007057947,0.00033393936,0.013996936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856144,0.00021020208,0.000082060484,0.00029646352,0.00060748804,0.00024244926],"domain_scores_gemma":[0.9921699,0.004462753,0.0008704759,0.0007712879,0.0011513338,0.0005742635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076323084,0.0008419312,0.001143272,0.004366777,0.001305082,0.0036233687,0.0028892267,0.0024104132,0.008680827],"category_scores_gemma":[0.012197419,0.00063302467,0.0005232647,0.003261462,0.0022241052,0.005894636,0.0026299348,0.0016574141,0.00089146773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003740971,0.00012817273,0.0041922103,0.0006281214,0.00006192528,0.00057655264,0.0007204531,0.037315805,0.01712229,0.86832374,0.004308515,0.06624819],"study_design_scores_gemma":[0.000028836605,0.000060941227,0.0010172363,0.00006397869,0.00005419088,0.00044452053,0.00021371718,0.15594323,0.009744638,0.82822007,0.00417367,0.00003497615],"about_ca_topic_score_codex":0.00084477034,"about_ca_topic_score_gemma":0.0011628657,"teacher_disagreement_score":0.008680827,"about_ca_system_score_codex":0.0013427876,"about_ca_system_score_gemma":0.0005064264,"threshold_uncertainty_score":0.029040217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6005462,0.0007819614,0.18745624,0.0011350015,0.00029114162,0.000082213475,0.00057989813,0.00082305615,0.20830432],"genre_scores_gemma":[0.9442895,0.0003793845,0.022663236,0.0003799631,0.00015627635,0.00013350921,0.0008769282,0.00026504093,0.0308563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988416,0.00030311654,0.000058451566,0.00026268073,0.00029245135,0.00024174417],"domain_scores_gemma":[0.9978976,0.0010935366,0.00022571954,0.00022856198,0.00025142133,0.0003031043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009490675,0.0010841809,0.00088567956,0.0021581426,0.0027855332,0.0032707835,0.001237648,0.0013096425,0.008682169],"category_scores_gemma":[0.0029567415,0.00076016044,0.0010311828,0.0016164075,0.0021626872,0.0033925006,0.0018591336,0.002428026,0.0013027294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011656486,0.000053268683,0.0006521511,0.000053361226,0.000025152844,0.0007244427,0.00035960652,0.0010775543,0.002320371,0.9842265,0.0017604806,0.008630627],"study_design_scores_gemma":[0.00004584313,0.000047273006,0.0007289563,0.000029380371,0.000032906493,0.0013215092,0.00019005292,0.0063855303,0.0021691492,0.97908163,0.009927865,0.00003991434],"about_ca_topic_score_codex":0.0003284017,"about_ca_topic_score_gemma":0.00031800836,"teacher_disagreement_score":0.008682169,"about_ca_system_score_codex":0.0011263996,"about_ca_system_score_gemma":0.0005164025,"threshold_uncertainty_score":0.029044747},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8514628,0.000533841,0.08913822,0.0008923499,0.00037597003,0.00006144675,0.00024109628,0.0002531865,0.057040986],"genre_scores_gemma":[0.9573267,0.0004550053,0.015946362,0.00024546456,0.00026493327,0.000063811414,0.0002292765,0.00008816327,0.025380163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949574,0.00012356408,0.00003740253,0.00007540646,0.00014801665,0.000119857476],"domain_scores_gemma":[0.99934715,0.00017011547,0.00012801238,0.00008176712,0.000100666446,0.00017224453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005527078,0.0005188376,0.0006426041,0.002204597,0.0017624233,0.0026358915,0.0008527836,0.001146509,0.0061373007],"category_scores_gemma":[0.0014206343,0.00041624028,0.00075230974,0.0019005699,0.0023203935,0.0033122743,0.00160029,0.0015519991,0.0008960411],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032037235,0.00001748108,0.0003044235,0.000013383462,0.00000457868,0.0001609526,0.00020156735,0.000426688,0.0012850967,0.99291855,0.000349114,0.0042860154],"study_design_scores_gemma":[0.0000115545445,0.0000092470555,0.00019902727,0.000004659695,0.0000042647084,0.0001154956,0.00007418873,0.0016486116,0.0003217713,0.99660254,0.0009996021,0.00000902893],"about_ca_topic_score_codex":0.0009238911,"about_ca_topic_score_gemma":0.0015596605,"teacher_disagreement_score":0.0061373007,"about_ca_system_score_codex":0.0008666042,"about_ca_system_score_gemma":0.00057717034,"threshold_uncertainty_score":0.020531356},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4742987,0.006997583,0.23996982,0.007959105,0.0037364918,0.00012519733,0.0008757909,0.00063316664,0.26540413],"genre_scores_gemma":[0.9396981,0.0029614838,0.019600496,0.000997473,0.0025200066,0.00015881717,0.0005121882,0.0002477468,0.033303637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819,0.00052409,0.00012151647,0.00030589034,0.00048337688,0.00037513295],"domain_scores_gemma":[0.99144125,0.00481765,0.0009445373,0.00039455536,0.0007467581,0.0016552755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034070816,0.0020592697,0.0024309997,0.0076289712,0.004408386,0.008078891,0.0017390009,0.0023935225,0.014310746],"category_scores_gemma":[0.010720952,0.0010469427,0.001911148,0.0051685967,0.008909775,0.013487018,0.005366866,0.004845113,0.0014250388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007139959,0.00001632022,0.00026042818,0.000055119788,0.0000103938355,0.0000759912,0.00020061898,0.0009811412,0.00027536484,0.9931779,0.0012092511,0.0036660768],"study_design_scores_gemma":[0.00001019769,0.000018649725,0.00022475696,0.000017432114,0.000008193677,0.00008730416,0.00005326099,0.0026919197,0.00011946808,0.9952799,0.0014645566,0.000024408875],"about_ca_topic_score_codex":0.0027392064,"about_ca_topic_score_gemma":0.0028637839,"teacher_disagreement_score":0.014310746,"about_ca_system_score_codex":0.0030152262,"about_ca_system_score_gemma":0.001733778,"threshold_uncertainty_score":0.047874212},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50015205,0.0014996761,0.2356641,0.002661701,0.0010925443,0.0001012419,0.0008760169,0.0010884602,0.25686416],"genre_scores_gemma":[0.87625355,0.0007319266,0.027164513,0.0005589992,0.00036972074,0.00007322907,0.00070502807,0.0005547054,0.09358829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994236,0.000080516045,0.000031681426,0.00014114627,0.00020627976,0.00011680388],"domain_scores_gemma":[0.9992797,0.00020419525,0.00011380459,0.00018252053,0.000086231055,0.00013365691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054945744,0.0008161021,0.0009053201,0.002828952,0.0017841671,0.002306728,0.00095095235,0.00087005564,0.017668564],"category_scores_gemma":[0.0017710692,0.00051789434,0.0009333316,0.0011285412,0.0020721012,0.0038448335,0.0037354042,0.002774804,0.001979242],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029254112,0.000011077346,0.00009775058,0.000015407706,0.0000073993424,0.000049483562,0.000114135175,0.0008740494,0.0011121635,0.99039334,0.0009456596,0.0063502146],"study_design_scores_gemma":[0.0000100457855,0.000020157104,0.00026793603,0.000011824305,0.000011309007,0.00013618554,0.00010881166,0.004746443,0.001154473,0.9836713,0.0098484075,0.000013130294],"about_ca_topic_score_codex":0.0007372216,"about_ca_topic_score_gemma":0.0007532839,"teacher_disagreement_score":0.017668564,"about_ca_system_score_codex":0.0014085894,"about_ca_system_score_gemma":0.0003211177,"threshold_uncertainty_score":0.059107244},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6188197,0.0008759039,0.17208017,0.0009200231,0.0004428761,0.00025032254,0.0013698888,0.00035789725,0.20488317],"genre_scores_gemma":[0.8717049,0.0012587412,0.05186726,0.00054758764,0.00044160744,0.00040954773,0.0020451955,0.00040682204,0.07131828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933976,0.00009495319,0.000032309086,0.00016322522,0.00020854559,0.0001611394],"domain_scores_gemma":[0.998168,0.00086732826,0.00024512425,0.00020666033,0.00017560442,0.000337186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026115644,0.0006838532,0.0008194228,0.0017931764,0.0014453736,0.0026660946,0.0009046105,0.0007719683,0.021021483],"category_scores_gemma":[0.001549275,0.0008297197,0.00069570396,0.0019280454,0.0016103927,0.0021377646,0.0019495887,0.0024589333,0.0019314646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014623832,0.000093549694,0.00060644175,0.0001512801,0.00002386897,0.00033391165,0.0002900278,0.0055780294,0.003884891,0.9680876,0.0050588553,0.015745323],"study_design_scores_gemma":[0.000056777895,0.00008598212,0.0012819261,0.00005650446,0.00003243952,0.00065156893,0.00033436867,0.02055406,0.0026638017,0.9513354,0.02291679,0.000030462079],"about_ca_topic_score_codex":0.00088577444,"about_ca_topic_score_gemma":0.0010369903,"teacher_disagreement_score":0.021021483,"about_ca_system_score_codex":0.00067208346,"about_ca_system_score_gemma":0.00035987486,"threshold_uncertainty_score":0.070323884},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61154014,0.0019395975,0.17256348,0.004779199,0.00051471865,0.00012204357,0.00084376463,0.001277861,0.20641924],"genre_scores_gemma":[0.96210235,0.0005685586,0.010086784,0.00046305574,0.00031378926,0.000116757146,0.0006655611,0.0002070866,0.02547606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981433,0.000488242,0.000082111124,0.00050614536,0.00039941375,0.0003807756],"domain_scores_gemma":[0.9950105,0.0029468546,0.00026685258,0.00055730954,0.0003226245,0.00089586544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013123251,0.00087238004,0.001178973,0.0030472423,0.0029023602,0.0055334275,0.0021920914,0.0015901838,0.014161344],"category_scores_gemma":[0.005747802,0.00090811367,0.0012037525,0.002416635,0.0039204075,0.0103037525,0.005072013,0.004826267,0.0011178827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038635095,0.000025648707,0.00027344192,0.000021550744,0.0000064026376,0.000037746842,0.00030091582,0.00029536363,0.00040358547,0.99457586,0.00095585943,0.0030650692],"study_design_scores_gemma":[0.000021683385,0.000010078096,0.00037446138,0.000010350954,0.000011991696,0.00008154811,0.00010497933,0.0017812978,0.00034507195,0.99433595,0.0029128504,0.000009704016],"about_ca_topic_score_codex":0.0018770064,"about_ca_topic_score_gemma":0.0014441946,"teacher_disagreement_score":0.014161344,"about_ca_system_score_codex":0.0030832277,"about_ca_system_score_gemma":0.0007398366,"threshold_uncertainty_score":0.047374427},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5511532,0.00043436754,0.40046868,0.00059746904,0.00011519895,0.00016668907,0.00045234716,0.0012346951,0.04537743],"genre_scores_gemma":[0.85786253,0.00041052978,0.12867188,0.000112115886,0.000063980966,0.00013478164,0.0007142434,0.00025027402,0.011779669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975115,0.000069397625,0.000011518563,0.000053274252,0.00007496777,0.000039600334],"domain_scores_gemma":[0.9984676,0.00081890955,0.00019493396,0.00021532473,0.0001423883,0.00016078581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022020371,0.00039152618,0.0004210341,0.0009353965,0.0006876614,0.001060271,0.0009454109,0.00067191856,0.007948884],"category_scores_gemma":[0.00203001,0.00043504316,0.00050074403,0.00090935006,0.00094673375,0.0015291527,0.001477471,0.0011684374,0.0008219038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047453627,0.00032307155,0.0038584548,0.00042410818,0.000036719062,0.0008291583,0.00094284286,0.1516464,0.030752819,0.6092049,0.010221904,0.19128509],"study_design_scores_gemma":[0.00006782572,0.00021800611,0.002194723,0.00007889351,0.000044104705,0.00076650607,0.000460405,0.4566003,0.011518138,0.51195115,0.016066948,0.000032960743],"about_ca_topic_score_codex":0.00079590396,"about_ca_topic_score_gemma":0.0010115751,"teacher_disagreement_score":0.007948884,"about_ca_system_score_codex":0.0003621175,"about_ca_system_score_gemma":0.00025777676,"threshold_uncertainty_score":0.026591659},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15106925,0.002031024,0.7391998,0.0018428813,0.0023009626,0.00036399017,0.0012658669,0.00205828,0.09986801],"genre_scores_gemma":[0.58810735,0.0017692096,0.31188673,0.0012497214,0.0009893366,0.0009476971,0.001314859,0.0016450605,0.09208994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807286,0.00043043506,0.00027499127,0.00067551364,0.00031412835,0.00023212038],"domain_scores_gemma":[0.99589264,0.001768157,0.0003607537,0.0007094123,0.0008164585,0.00045253552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012506085,0.0008421122,0.00088658085,0.002919118,0.004263327,0.005329414,0.001386738,0.0025143214,0.015486735],"category_scores_gemma":[0.004862385,0.0013953143,0.0017780808,0.002794216,0.002843337,0.01236509,0.0043436293,0.0029124608,0.0042980304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093602925,0.000053892894,0.0003270559,0.00016184043,0.000020413203,0.00034019465,0.0012942499,0.00035192753,0.004351305,0.9651078,0.0030235616,0.024874138],"study_design_scores_gemma":[0.00003834105,0.000072358016,0.0003527809,0.0000989919,0.000058348935,0.001345025,0.00072091084,0.0025899322,0.0039613396,0.94455147,0.046135202,0.000075299584],"about_ca_topic_score_codex":0.0005170965,"about_ca_topic_score_gemma":0.00048770063,"teacher_disagreement_score":0.015486735,"about_ca_system_score_codex":0.00084809493,"about_ca_system_score_gemma":0.0007545484,"threshold_uncertainty_score":0.051808357},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72711927,0.00085344975,0.2194636,0.0009889861,0.00026239635,0.000097518336,0.00088194764,0.0005869118,0.049745865],"genre_scores_gemma":[0.93336433,0.00045634274,0.04907365,0.00019760072,0.00011265351,0.00006637924,0.0010043624,0.00020218678,0.015522563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785334,0.00045977166,0.00014476205,0.0004497282,0.00076848123,0.00032395564],"domain_scores_gemma":[0.99672264,0.0012368566,0.00074569875,0.00038758075,0.00028081625,0.000626489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082718756,0.00105808,0.0013862381,0.0025503885,0.0028547295,0.0036363842,0.0026627318,0.0019597765,0.009151734],"category_scores_gemma":[0.0037039998,0.0011885716,0.0014642105,0.0020223544,0.003967618,0.0033610784,0.004592013,0.0035340004,0.0015895624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042404418,0.00006729493,0.0011152143,0.00014577743,0.000040163643,0.00036642884,0.0008531694,0.019181669,0.0041979295,0.9605218,0.001592651,0.011493857],"study_design_scores_gemma":[0.000049568444,0.00013108809,0.0019573185,0.000046298937,0.000027392081,0.0003962049,0.0004884769,0.035414882,0.0017792217,0.9539911,0.0056439466,0.00007450152],"about_ca_topic_score_codex":0.0042494065,"about_ca_topic_score_gemma":0.00399798,"teacher_disagreement_score":0.009151734,"about_ca_system_score_codex":0.0011206997,"about_ca_system_score_gemma":0.00066320447,"threshold_uncertainty_score":0.030615568},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7505735,0.00059613143,0.20544818,0.0005794845,0.00012361981,0.00005648609,0.00072725763,0.0012669587,0.040628314],"genre_scores_gemma":[0.9784143,0.00027450355,0.015966287,0.00013824576,0.00020468236,0.00006199933,0.0004840774,0.00023301368,0.004222871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977278,0.00035106347,0.00017276712,0.000817931,0.0004846617,0.000445714],"domain_scores_gemma":[0.98532957,0.007917439,0.0016013476,0.0021242488,0.0012164878,0.0018108771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012939963,0.00045179055,0.0014801712,0.003203395,0.0018963071,0.005420952,0.002254334,0.001136031,0.006202626],"category_scores_gemma":[0.010917337,0.00089377986,0.0012410862,0.002299806,0.003622558,0.0068704477,0.0023266731,0.0027672208,0.0006042859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015033038,0.00007398254,0.0024436868,0.0000743814,0.0000310221,0.00019773807,0.001210894,0.0017651571,0.0023267365,0.98066497,0.0007305673,0.010330524],"study_design_scores_gemma":[0.00005068708,0.000059749724,0.0017222312,0.00003559846,0.00004492584,0.00036363688,0.00038450988,0.0085825715,0.0017341571,0.98405784,0.002926658,0.000037502738],"about_ca_topic_score_codex":0.001418682,"about_ca_topic_score_gemma":0.0008284023,"teacher_disagreement_score":0.006202626,"about_ca_system_score_codex":0.0013943871,"about_ca_system_score_gemma":0.0006001316,"threshold_uncertainty_score":0.020749867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6723989,0.0017515415,0.20181884,0.0053891465,0.0006098825,0.0000880693,0.00070665684,0.00045981022,0.11677706],"genre_scores_gemma":[0.94449574,0.0007452648,0.033448044,0.00032592943,0.00028753435,0.000067757646,0.00040273735,0.00011497399,0.020111922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890816,0.00029575193,0.00007890867,0.00023634467,0.00028233635,0.00019847421],"domain_scores_gemma":[0.9963903,0.0019577488,0.00036561003,0.00044302526,0.0003215997,0.00052161666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009931552,0.0003395427,0.00077873544,0.0011448027,0.0024938413,0.0042313645,0.0013691155,0.001036689,0.0067290864],"category_scores_gemma":[0.0036687215,0.00054794207,0.00062074023,0.0018232898,0.0039498,0.0057693967,0.0027904238,0.003432369,0.0009985518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006241657,0.000023719118,0.0003926472,0.000032101147,0.000004937107,0.00013476502,0.000454403,0.00046853253,0.0012403167,0.9897815,0.00066823524,0.0067364364],"study_design_scores_gemma":[0.000024017972,0.000011128077,0.00015739606,0.000008598971,0.0000052566966,0.00014528533,0.0002607433,0.0008874959,0.0002736781,0.9946491,0.00356778,0.0000095635605],"about_ca_topic_score_codex":0.0015037976,"about_ca_topic_score_gemma":0.002202918,"teacher_disagreement_score":0.0067290864,"about_ca_system_score_codex":0.001520486,"about_ca_system_score_gemma":0.00093164877,"threshold_uncertainty_score":0.022511065},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27305138,0.0057191504,0.07740957,0.15786298,0.0066638673,0.00007272037,0.00095037324,0.00065941655,0.4776106],"genre_scores_gemma":[0.9297878,0.0012231529,0.007462267,0.007970051,0.00342133,0.000067518005,0.00038277078,0.00022798263,0.0494572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984328,0.00041462475,0.00005818665,0.00046974246,0.0002641304,0.00036048706],"domain_scores_gemma":[0.99414635,0.0032899347,0.00034898228,0.0010969555,0.00070537685,0.00041239825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023877635,0.0005966258,0.0012902011,0.0016016855,0.005639272,0.0036006046,0.0013873866,0.003807823,0.024078695],"category_scores_gemma":[0.015012773,0.0004997058,0.0010180828,0.002462413,0.0093449885,0.012262453,0.0038383976,0.00469721,0.0027334238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007012635,0.000011834668,0.00026580345,0.00003409371,0.000007132166,0.000045968496,0.00033725734,0.00018415214,0.00010598957,0.9844067,0.010370875,0.00415995],"study_design_scores_gemma":[0.000018336714,0.0000056136323,0.00012910111,0.00001117189,0.000004323164,0.000033453736,0.00011249096,0.00032243205,0.00006855724,0.9928848,0.006402737,0.000006922411],"about_ca_topic_score_codex":0.0035604783,"about_ca_topic_score_gemma":0.0024574192,"teacher_disagreement_score":0.024078695,"about_ca_system_score_codex":0.0020057887,"about_ca_system_score_gemma":0.001164535,"threshold_uncertainty_score":0.08055127},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12561536,0.0021137462,0.7781333,0.002041421,0.00085683586,0.00007289709,0.0003710984,0.0012640789,0.08953121],"genre_scores_gemma":[0.71000016,0.0021087555,0.19288638,0.00039484582,0.0003582729,0.0000883804,0.0006991348,0.0011243206,0.09233975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967575,0.00008691008,0.000018123817,0.00007084625,0.00011125491,0.00003714413],"domain_scores_gemma":[0.9994019,0.00022260835,0.00004655719,0.00016381974,0.00009875577,0.00006626147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030934066,0.0005567558,0.0006002111,0.0012905569,0.0007118155,0.0020712782,0.00066001236,0.00079042016,0.010612193],"category_scores_gemma":[0.0018691211,0.00055509515,0.00050644716,0.0010083959,0.0013777792,0.002216994,0.0026329271,0.0021206178,0.0021587147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037303435,0.000019246789,0.00026563063,0.000057741003,0.00001003346,0.0000567079,0.00022758586,0.014040026,0.0020123515,0.93476903,0.004452381,0.04405192],"study_design_scores_gemma":[0.000011377312,0.000020897023,0.00019011114,0.00002686757,0.000007961216,0.000093320166,0.00013789261,0.051913127,0.0015792558,0.91913086,0.02687838,0.00000982023],"about_ca_topic_score_codex":0.0009876724,"about_ca_topic_score_gemma":0.0010294871,"teacher_disagreement_score":0.010612193,"about_ca_system_score_codex":0.00061586854,"about_ca_system_score_gemma":0.0002467014,"threshold_uncertainty_score":0.0355013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88847613,0.00050386356,0.04697298,0.0006966565,0.00006630185,0.00004797084,0.00032100413,0.00021420633,0.06270091],"genre_scores_gemma":[0.9824868,0.00044600383,0.00761455,0.00014217246,0.00010776466,0.00003722127,0.00050879986,0.00008894279,0.008567795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943143,0.0001672553,0.000028866636,0.00010338733,0.00018485088,0.000084110885],"domain_scores_gemma":[0.99721473,0.0012740206,0.00061851676,0.00025394533,0.0003736202,0.00026522836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005807885,0.0008661617,0.0006009512,0.0027311277,0.0017470022,0.0028431774,0.0010844475,0.0009154441,0.008590885],"category_scores_gemma":[0.0029369479,0.00051167107,0.0006005158,0.0017834888,0.0020776421,0.0026137524,0.0015252096,0.0012105267,0.00086801534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009531067,0.000035049095,0.0022595692,0.00006391092,0.000017742428,0.00024876947,0.00051867426,0.009066416,0.0038451985,0.97014767,0.0014443932,0.012257306],"study_design_scores_gemma":[0.00001858651,0.000064231645,0.0021711595,0.000022544224,0.000029145443,0.00046547977,0.0005615711,0.02249476,0.0021831905,0.96626204,0.005703458,0.000023693992],"about_ca_topic_score_codex":0.0012886678,"about_ca_topic_score_gemma":0.0012856092,"teacher_disagreement_score":0.008590885,"about_ca_system_score_codex":0.00084638986,"about_ca_system_score_gemma":0.0003818774,"threshold_uncertainty_score":0.028739333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88026935,0.0004237402,0.04438073,0.00058866333,0.0001236435,0.00004320909,0.0001935476,0.00014160314,0.073835455],"genre_scores_gemma":[0.9864574,0.00025902488,0.005852201,0.00014480593,0.000078611236,0.0000342235,0.00020289954,0.000028735863,0.006942239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955064,0.00009522389,0.000019371035,0.00010007694,0.00011948822,0.00011515908],"domain_scores_gemma":[0.99827933,0.000797996,0.00023805589,0.00015069956,0.00016522502,0.00036883372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043596228,0.0005516541,0.000641913,0.0021483584,0.0020259551,0.0024698277,0.00072179525,0.0010952094,0.004699465],"category_scores_gemma":[0.0018957278,0.0005274842,0.00068980776,0.0013581954,0.0021297622,0.0027696192,0.0022830507,0.0011850981,0.00036610532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077807716,0.000029160621,0.0007332417,0.00003798492,0.000016329383,0.00044130205,0.00042214297,0.0008108273,0.002287087,0.9910685,0.0005089446,0.0035666975],"study_design_scores_gemma":[0.000033326272,0.000018937522,0.0009587831,0.00001621591,0.000027360582,0.00055933243,0.0003113624,0.004011357,0.0016250056,0.99028534,0.0021383674,0.0000147697265],"about_ca_topic_score_codex":0.0007929059,"about_ca_topic_score_gemma":0.00077476207,"teacher_disagreement_score":0.004699465,"about_ca_system_score_codex":0.0007270748,"about_ca_system_score_gemma":0.00038889993,"threshold_uncertainty_score":0.015721262},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9289176,0.0004947326,0.059960548,0.0014666888,0.000043711552,0.000046170713,0.0004100343,0.0003501501,0.008310277],"genre_scores_gemma":[0.9900803,0.0001794401,0.004596081,0.0001088894,0.0000650905,0.000034972592,0.00024515143,0.00009771558,0.0045924513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988519,0.00034954134,0.00004165589,0.00034371452,0.00016380534,0.00024927265],"domain_scores_gemma":[0.9777541,0.013592971,0.0028066467,0.0016098014,0.0011695216,0.0030668578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025774315,0.0006144547,0.001561043,0.0026594643,0.0018334744,0.0027784782,0.0037334668,0.0027396416,0.011101144],"category_scores_gemma":[0.0252659,0.0010371049,0.0007643218,0.0016263648,0.003177106,0.007223727,0.0021824962,0.0020571786,0.0006764522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071574666,0.00022833438,0.006648823,0.0003110027,0.00018202476,0.0007551083,0.002242459,0.13892531,0.0071225315,0.824429,0.0045136106,0.013926097],"study_design_scores_gemma":[0.000080640675,0.00014564184,0.0038421191,0.00004425112,0.00009637756,0.00030186446,0.00031486675,0.5127291,0.0013380821,0.47962505,0.0014110648,0.00007096793],"about_ca_topic_score_codex":0.0060217977,"about_ca_topic_score_gemma":0.0047772825,"teacher_disagreement_score":0.011101144,"about_ca_system_score_codex":0.0019176304,"about_ca_system_score_gemma":0.0008778701,"threshold_uncertainty_score":0.03713709},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016350206,0.0034788034,0.0013393986,0.039319366,0.9426764,0.000049444894,0.0010760328,0.00049518584,0.01140186],"genre_scores_gemma":[0.01320343,0.018985832,0.005800483,0.0859087,0.42571527,0.0003423723,0.0057268343,0.0018046362,0.4425125],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954007,0.0007220309,0.00058615074,0.0009355441,0.0018993422,0.00045620004],"domain_scores_gemma":[0.9869467,0.0029687225,0.00063116185,0.0011016207,0.007531357,0.0008204097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002623882,0.003339063,0.00373971,0.0062212036,0.0042582005,0.004115044,0.00525088,0.0054270797,0.14901397],"category_scores_gemma":[0.024425043,0.00169125,0.0037834498,0.003928992,0.0027482717,0.005311336,0.0032220904,0.0065656304,0.068824776],"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.000029595156,0.000010464618,0.000037132217,0.00014452724,0.000017733983,0.00009056195,0.000013105333,0.00007160344,0.00006810356,0.0014664665,0.99378574,0.0042650774],"study_design_scores_gemma":[0.00006541529,0.000062799634,0.0014511363,0.00030898416,0.00007494495,0.00039384232,0.000057378224,0.00062674587,0.0005307081,0.011480555,0.9848492,0.00009823051],"about_ca_topic_score_codex":0.015446553,"about_ca_topic_score_gemma":0.022418842,"teacher_disagreement_score":0.14901397,"about_ca_system_score_codex":0.006404655,"about_ca_system_score_gemma":0.0030544882,"threshold_uncertainty_score":0.49850136},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89861965,0.00047735352,0.034681547,0.0012795336,0.00022937292,0.0001007325,0.00042241323,0.00027067025,0.06391878],"genre_scores_gemma":[0.9670264,0.00044884067,0.008035813,0.00039462736,0.00015277401,0.00007070948,0.00046657026,0.000075069554,0.02332926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972564,0.000074164665,0.000010852595,0.000060145605,0.00006235262,0.000066891414],"domain_scores_gemma":[0.99871826,0.00048054638,0.00027765092,0.00010521278,0.00011038703,0.00030796614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000245914,0.0006628828,0.000617288,0.0018930943,0.0017853839,0.0022625572,0.0011190834,0.0011836597,0.010575198],"category_scores_gemma":[0.0013877599,0.00068531337,0.0005619384,0.0017920989,0.0015582289,0.0024060775,0.0015710479,0.0012787502,0.00069025427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005963062,0.00004029207,0.00051887805,0.000044045457,0.00001706077,0.00023927205,0.00043356515,0.0017508973,0.0018570836,0.9885423,0.0019048771,0.0045921486],"study_design_scores_gemma":[0.000037493548,0.000014941035,0.0005202548,0.000009176367,0.000016229991,0.00008794836,0.0002085359,0.0048727677,0.0004385246,0.992388,0.0013964727,0.000009690604],"about_ca_topic_score_codex":0.002927048,"about_ca_topic_score_gemma":0.0057811015,"teacher_disagreement_score":0.010575198,"about_ca_system_score_codex":0.0010177637,"about_ca_system_score_gemma":0.00062493054,"threshold_uncertainty_score":0.035377562},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38827145,0.002369197,0.1985404,0.004992119,0.0015482195,0.000095534204,0.00072513573,0.0007823512,0.4026756],"genre_scores_gemma":[0.9092097,0.0010454669,0.01856012,0.0005551101,0.00084711326,0.00006450828,0.00036703816,0.0003153505,0.069035545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989579,0.0002618384,0.000045587036,0.00019617635,0.00033119586,0.0002073674],"domain_scores_gemma":[0.9987048,0.00046348438,0.00016466655,0.0001877938,0.00025231627,0.00022704531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010362171,0.00083805044,0.00085827557,0.002548938,0.0018074353,0.004635054,0.0009852059,0.0012291793,0.0154090775],"category_scores_gemma":[0.0026530358,0.0006211092,0.0008704387,0.0024192675,0.002937639,0.0057590613,0.0031379396,0.0032129409,0.0024073813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000148536965,0.0000116485535,0.00004517621,0.000009785296,0.00000254416,0.000027985965,0.00016225596,0.0001342061,0.00026898223,0.9954672,0.00061319704,0.0032421437],"study_design_scores_gemma":[0.000008809348,0.000011211141,0.00009378115,0.000006988628,0.0000056130357,0.000098994366,0.00006594214,0.0013180419,0.00028602878,0.99383837,0.0042564957,0.000009570284],"about_ca_topic_score_codex":0.00092007994,"about_ca_topic_score_gemma":0.0007719689,"teacher_disagreement_score":0.0154090775,"about_ca_system_score_codex":0.0016039121,"about_ca_system_score_gemma":0.0006614547,"threshold_uncertainty_score":0.05154854},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5696169,0.0009877601,0.3630454,0.0020297465,0.0004374221,0.00007570322,0.00053091365,0.0004823474,0.06279383],"genre_scores_gemma":[0.954439,0.00055436237,0.024240162,0.00038519347,0.00042014496,0.00010238559,0.00045796155,0.0002195874,0.019181196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995728,0.0000680671,0.000020733256,0.00012789313,0.000109209854,0.00010120586],"domain_scores_gemma":[0.9968466,0.0019260007,0.00023981479,0.0002610611,0.00041906966,0.00030738662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006646411,0.00057427364,0.00080244214,0.0018000364,0.001909836,0.0021148922,0.0013889108,0.001260008,0.009972369],"category_scores_gemma":[0.0056050136,0.00047965258,0.0011082292,0.0010305876,0.001620825,0.0031305086,0.0023432316,0.0014745959,0.00082922174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037343905,0.000056521894,0.0019641866,0.00015603159,0.00004964993,0.00031925872,0.0007966453,0.012420009,0.01939603,0.9329308,0.0052953945,0.02624198],"study_design_scores_gemma":[0.00006454666,0.000115621384,0.0014096728,0.000040703013,0.00004741676,0.00048253514,0.00032441944,0.12565103,0.0069579715,0.85807806,0.006793807,0.000034235385],"about_ca_topic_score_codex":0.0022398895,"about_ca_topic_score_gemma":0.0011631193,"teacher_disagreement_score":0.009972369,"about_ca_system_score_codex":0.0010742776,"about_ca_system_score_gemma":0.00036239103,"threshold_uncertainty_score":0.0333609},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4867101,0.0055083456,0.10870385,0.061223365,0.0029671402,0.00016954007,0.006124205,0.0036618575,0.32493153],"genre_scores_gemma":[0.9525164,0.002118299,0.015208469,0.0057490687,0.0013326667,0.00012539614,0.0032566749,0.0006192631,0.019073712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977465,0.00043364783,0.00008629111,0.0007368411,0.0005034927,0.0004933076],"domain_scores_gemma":[0.9901984,0.0055629057,0.0006652357,0.0023332033,0.0007472865,0.00049292954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015123816,0.0011708573,0.0018700084,0.0013388474,0.0036767425,0.0056039775,0.0028461898,0.003795907,0.020632718],"category_scores_gemma":[0.017032323,0.0010290717,0.0014309018,0.0021932882,0.004351673,0.015159612,0.005200255,0.007555521,0.0036480748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012180287,0.00013991649,0.003941486,0.0008330767,0.00014024219,0.0005296191,0.0005478096,0.009827381,0.0030551115,0.8795639,0.058934662,0.041268736],"study_design_scores_gemma":[0.00007079233,0.00002495737,0.0005412002,0.000052396896,0.00005023074,0.00019707756,0.00026535694,0.0053739017,0.0013965645,0.98047274,0.011530919,0.000023867486],"about_ca_topic_score_codex":0.002068603,"about_ca_topic_score_gemma":0.002275625,"teacher_disagreement_score":0.020632718,"about_ca_system_score_codex":0.0016145717,"about_ca_system_score_gemma":0.0011468546,"threshold_uncertainty_score":0.06902331},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30460566,0.00040804918,0.6293769,0.000654697,0.00054248376,0.00009391756,0.00023483274,0.0009941201,0.06308933],"genre_scores_gemma":[0.87741685,0.00034698978,0.093462676,0.00037197876,0.00020374903,0.00011353728,0.00033848823,0.00040461138,0.02734109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828917,0.0004552041,0.0001159607,0.000326309,0.00044573026,0.00036774014],"domain_scores_gemma":[0.9958807,0.0020649466,0.000297275,0.00049599994,0.0006286726,0.00063238334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017911887,0.00056777225,0.00058124785,0.0023151548,0.0016027328,0.0032952495,0.0012993241,0.001315971,0.007781953],"category_scores_gemma":[0.004893498,0.00067679683,0.0009948096,0.0012068019,0.0026132665,0.0051548183,0.0032745262,0.0031129906,0.0011112251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038928698,0.000045884357,0.00018210913,0.000017111886,0.000004988769,0.00012287736,0.00036633015,0.0008989785,0.0013807828,0.98969406,0.00041207604,0.0068358565],"study_design_scores_gemma":[0.000012610942,0.00001602073,0.00007003617,0.000011206908,0.000007718123,0.00007374943,0.00012031821,0.0055345343,0.0010235482,0.99046993,0.0026488656,0.000011403557],"about_ca_topic_score_codex":0.00076344435,"about_ca_topic_score_gemma":0.0010119057,"teacher_disagreement_score":0.007781953,"about_ca_system_score_codex":0.00085419137,"about_ca_system_score_gemma":0.00061090203,"threshold_uncertainty_score":0.026033223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.838251,0.0010252178,0.12080894,0.004016042,0.000352052,0.000058590707,0.00025820066,0.0008140284,0.034416005],"genre_scores_gemma":[0.98119557,0.00031450667,0.010778832,0.000320496,0.00030604965,0.00007358513,0.00014434787,0.00016338643,0.006703134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932516,0.00021330462,0.000022709113,0.00011139997,0.0002249841,0.000102314625],"domain_scores_gemma":[0.99391276,0.0039571286,0.0005484273,0.00040538269,0.0004288149,0.00074746896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007318914,0.0006435497,0.001010283,0.0025059818,0.001641611,0.0026105684,0.00092686375,0.0020081182,0.0070927674],"category_scores_gemma":[0.009287249,0.00072891853,0.0005210603,0.0012216344,0.0028357112,0.0034107994,0.0018818626,0.0020241144,0.0008070555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025789795,0.00013618317,0.002226042,0.00020813671,0.000048815113,0.00067615515,0.0007909583,0.014690583,0.007941676,0.9459133,0.008968854,0.018141376],"study_design_scores_gemma":[0.00004417927,0.000019515843,0.00075026904,0.000016272603,0.000012162074,0.00024994457,0.00023932496,0.03345209,0.00061320496,0.9637143,0.0008692684,0.000019381965],"about_ca_topic_score_codex":0.0005202715,"about_ca_topic_score_gemma":0.00095039356,"teacher_disagreement_score":0.0070927674,"about_ca_system_score_codex":0.00066530117,"about_ca_system_score_gemma":0.0003747949,"threshold_uncertainty_score":0.023727715},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055396583,0.0049818903,0.26349384,0.20105703,0.033052687,0.00052190566,0.005229899,0.0038067906,0.43245935],"genre_scores_gemma":[0.651387,0.004055518,0.1285717,0.037139826,0.012984411,0.0009763472,0.008306351,0.0023105752,0.15426831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99587905,0.0010904007,0.00020899146,0.0008563605,0.0013227474,0.00064250623],"domain_scores_gemma":[0.9841487,0.007712679,0.0007933481,0.0028177027,0.0032917315,0.0012358241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037153845,0.001961204,0.0016210343,0.002682465,0.0034498447,0.0034735252,0.002709558,0.002895203,0.04997019],"category_scores_gemma":[0.024692502,0.0010094657,0.0029248495,0.0018111296,0.004536577,0.009749104,0.0076982984,0.0074826805,0.015004645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002694781,0.00019537291,0.0013177419,0.0006149825,0.00013444647,0.00038975416,0.0012457209,0.0014014741,0.0012322797,0.7360571,0.23473522,0.022406368],"study_design_scores_gemma":[0.00018904365,0.000112439164,0.0021286649,0.00021181598,0.00011136696,0.0007087352,0.0003321585,0.0059959176,0.0014796145,0.88963854,0.09901236,0.0000794616],"about_ca_topic_score_codex":0.0028363923,"about_ca_topic_score_gemma":0.0022028533,"teacher_disagreement_score":0.04997019,"about_ca_system_score_codex":0.002634672,"about_ca_system_score_gemma":0.0025730284,"threshold_uncertainty_score":0.16716695},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4255181,0.003206909,0.5162168,0.0032786925,0.0012288545,0.00025935913,0.0042860447,0.007496983,0.03850834],"genre_scores_gemma":[0.6440767,0.00093742984,0.3233006,0.00034214233,0.00046650926,0.0001383976,0.0062171076,0.0016565733,0.022864424],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981187,0.00014715378,0.00016277288,0.0006635796,0.00047283337,0.0004348976],"domain_scores_gemma":[0.9951704,0.0016560882,0.00030812193,0.0016480412,0.00085711555,0.0003602355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010514546,0.0013829811,0.0015698321,0.0032285799,0.0016944718,0.003820418,0.001993001,0.0012543394,0.025432708],"category_scores_gemma":[0.008964866,0.00059640605,0.0017676979,0.0036248392,0.0017285362,0.0076178354,0.00210506,0.0017840364,0.00783012],"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.0039452687,0.00058747036,0.012907401,0.00096614956,0.00030631357,0.00072939915,0.00081620394,0.03705762,0.04721626,0.12059319,0.039240234,0.7356345],"study_design_scores_gemma":[0.00039155636,0.00082303747,0.0052935965,0.00028017227,0.0005382453,0.001581245,0.0009486027,0.28318644,0.09332986,0.5588759,0.054512974,0.00023832828],"about_ca_topic_score_codex":0.0031741366,"about_ca_topic_score_gemma":0.0058320784,"teacher_disagreement_score":0.025432708,"about_ca_system_score_codex":0.0017811303,"about_ca_system_score_gemma":0.0020015514,"threshold_uncertainty_score":0.08508086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61034393,0.0013668486,0.22050883,0.00347849,0.00027247795,0.00007066607,0.00033787813,0.00029687473,0.16332401],"genre_scores_gemma":[0.9710758,0.00045161898,0.012038999,0.0005578745,0.00018646597,0.00006466346,0.000156557,0.0000525968,0.0154155195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993845,0.00021432523,0.000023780463,0.00008028349,0.00015456228,0.00014245871],"domain_scores_gemma":[0.99855965,0.0005311904,0.00025038054,0.0002547123,0.00023060263,0.0001735419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009818878,0.00034862637,0.0005834277,0.0014111672,0.0015225578,0.0022554724,0.0007747765,0.0014902026,0.0074102357],"category_scores_gemma":[0.0030597548,0.0002821653,0.0003651825,0.0009663578,0.0022411004,0.0029074429,0.0013370431,0.0015913032,0.00085057656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020006211,0.000014432779,0.00011116582,0.000007148738,0.0000030638153,0.00002833173,0.00005497867,0.0010004672,0.00023927857,0.9955296,0.0005930959,0.0023984457],"study_design_scores_gemma":[0.0000086753735,0.000007491617,0.00005641032,0.0000063696325,0.0000026816933,0.00004007957,0.000051987154,0.0055007916,0.00014697888,0.9933669,0.0008057255,0.000005915515],"about_ca_topic_score_codex":0.000824065,"about_ca_topic_score_gemma":0.0011202439,"teacher_disagreement_score":0.0074102357,"about_ca_system_score_codex":0.00059390056,"about_ca_system_score_gemma":0.00046700405,"threshold_uncertainty_score":0.024789691},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71404827,0.0015023907,0.045478404,0.0133943055,0.0010617893,0.000032924472,0.00031554038,0.0003760658,0.22379032],"genre_scores_gemma":[0.9832608,0.00024181372,0.0045839255,0.0005699896,0.00026261172,0.000021861773,0.0000945533,0.000037341404,0.010927099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934703,0.00018010919,0.000021330186,0.00012593484,0.00011104536,0.00021451454],"domain_scores_gemma":[0.9979873,0.000946337,0.0001592083,0.00044949757,0.00018163372,0.00027606732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015471935,0.00040599814,0.0008867291,0.0013019615,0.003171136,0.0033928342,0.001186744,0.0020421068,0.0064063882],"category_scores_gemma":[0.0048425845,0.0003679496,0.0006749504,0.001227678,0.0054604607,0.0056165676,0.0025263508,0.0027272187,0.00056881574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004524739,0.000016490472,0.0002661156,0.000011593868,0.0000023009834,0.000046911573,0.00013629263,0.00085579394,0.00017721303,0.9956132,0.0010683411,0.0017604546],"study_design_scores_gemma":[0.0000098878845,0.0000025575544,0.000059637772,0.0000033873757,0.0000014688201,0.000014566552,0.000039045553,0.0014202818,0.0000831655,0.99749136,0.0008715736,0.0000030525994],"about_ca_topic_score_codex":0.003476859,"about_ca_topic_score_gemma":0.0029982363,"teacher_disagreement_score":0.0064063882,"about_ca_system_score_codex":0.0025303015,"about_ca_system_score_gemma":0.0011124718,"threshold_uncertainty_score":0.021431506},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106101185,0.001503262,0.8323163,0.00252838,0.0003525144,0.000278412,0.0010707477,0.0008657958,0.054983407],"genre_scores_gemma":[0.4651228,0.0021897194,0.4731112,0.00090700906,0.0007017702,0.00053090736,0.0024520538,0.00066192914,0.054322574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823296,0.00057199644,0.00010119568,0.00047003155,0.00036289232,0.00026094617],"domain_scores_gemma":[0.9954145,0.0024727567,0.0004573699,0.0008561051,0.00050206203,0.0002972243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014970617,0.0011825816,0.0013040104,0.0023755436,0.002018988,0.0039697313,0.0016784774,0.0016057786,0.0135412095],"category_scores_gemma":[0.008011941,0.0011419904,0.0017302863,0.0034344231,0.0022389765,0.007766957,0.0036454068,0.0025833407,0.0021229056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102620164,0.00008371797,0.00044759086,0.00011019274,0.000025357724,0.00004791663,0.0002317823,0.008140958,0.0008184543,0.9454897,0.0067618024,0.037739825],"study_design_scores_gemma":[0.000025974952,0.000015589007,0.00011152575,0.000019899777,0.000016332295,0.00009113489,0.000070146096,0.020070879,0.00038518533,0.9742398,0.004943699,0.00000984314],"about_ca_topic_score_codex":0.001709643,"about_ca_topic_score_gemma":0.002186035,"teacher_disagreement_score":0.0135412095,"about_ca_system_score_codex":0.0013696816,"about_ca_system_score_gemma":0.001127442,"threshold_uncertainty_score":0.045299888},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13317089,0.00084176956,0.8056769,0.0005066887,0.00012871693,0.00020592421,0.0004660825,0.00033074952,0.058672283],"genre_scores_gemma":[0.7167881,0.002084542,0.23837888,0.00059651927,0.00025707943,0.00055592984,0.00078170927,0.00023614638,0.04032105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811673,0.0008347147,0.00007274795,0.0002476398,0.00046307984,0.00026515074],"domain_scores_gemma":[0.9950831,0.0027882638,0.00064117956,0.000695672,0.0005693178,0.00022261533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016994592,0.0014426983,0.0010009177,0.001138078,0.0008370074,0.0018208355,0.001031771,0.0011160467,0.008336192],"category_scores_gemma":[0.005892211,0.0008355085,0.00051700085,0.0016149367,0.0012918438,0.002307719,0.0015647977,0.0010037066,0.0015622771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004412558,0.0000752293,0.00050800294,0.00017306113,0.000043670247,0.00023278197,0.00027238205,0.06969604,0.0111066615,0.86789554,0.004064126,0.045491256],"study_design_scores_gemma":[0.00015127589,0.00022193341,0.0003323894,0.00012233427,0.000064140855,0.00026571096,0.00009161129,0.18083635,0.004292972,0.8026752,0.010899834,0.000046271503],"about_ca_topic_score_codex":0.0015311496,"about_ca_topic_score_gemma":0.0026315902,"teacher_disagreement_score":0.008336192,"about_ca_system_score_codex":0.0013324902,"about_ca_system_score_gemma":0.0011410154,"threshold_uncertainty_score":0.027887344},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6215377,0.0007399752,0.3298253,0.00091298396,0.00061151414,0.00032107948,0.00081212464,0.001969097,0.04327012],"genre_scores_gemma":[0.8421352,0.00032828536,0.14600685,0.0004187501,0.00009709299,0.00022783923,0.00070156204,0.0008200159,0.00926445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790597,0.0007889031,0.00011566817,0.00032026856,0.00030763174,0.0005616106],"domain_scores_gemma":[0.9942762,0.0020097794,0.00025579103,0.002192334,0.0005770761,0.00068879995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001284748,0.0008313511,0.0011720413,0.0011203373,0.0018782449,0.0026101586,0.0017994335,0.0012636074,0.01178932],"category_scores_gemma":[0.007121732,0.00087333226,0.0006734841,0.0013737084,0.0013547783,0.0027390409,0.0038501532,0.0017437738,0.0020883686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008439247,0.00082571164,0.005520758,0.0006250307,0.00023958083,0.0012014348,0.00214761,0.18507291,0.13471687,0.39005163,0.02664988,0.24450924],"study_design_scores_gemma":[0.00055887894,0.000519909,0.0029157985,0.00020718476,0.00018491261,0.0006590141,0.0015572621,0.3691611,0.056849267,0.5376371,0.029619394,0.00013015972],"about_ca_topic_score_codex":0.0013020538,"about_ca_topic_score_gemma":0.0040542437,"teacher_disagreement_score":0.01178932,"about_ca_system_score_codex":0.0011368239,"about_ca_system_score_gemma":0.0008422418,"threshold_uncertainty_score":0.0394392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18520093,0.0058889766,0.669038,0.0077097714,0.0012571677,0.00022339045,0.001286605,0.0015358966,0.12785923],"genre_scores_gemma":[0.7884899,0.007908884,0.12032376,0.0025746638,0.0018676424,0.00050119194,0.0016839773,0.0015834958,0.075066514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812204,0.000652493,0.00008411909,0.00025888273,0.0006739234,0.00020850035],"domain_scores_gemma":[0.98748326,0.008723185,0.00079012994,0.001421259,0.0011371254,0.00044508904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011691945,0.0017291213,0.0013914057,0.004579078,0.0023379514,0.0035409082,0.0015391243,0.0021429057,0.007921099],"category_scores_gemma":[0.014755139,0.0010747915,0.0010692395,0.0049158935,0.0031627708,0.006505927,0.0053775953,0.0045103407,0.0017733866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006313008,0.000015436854,0.00021970608,0.00008323616,0.000014798282,0.00009044071,0.00028633,0.009219635,0.0007497677,0.96659774,0.0037234537,0.018936288],"study_design_scores_gemma":[0.000009170368,0.00001179191,0.00007019136,0.0000498683,0.000010682555,0.000084943786,0.000033736917,0.017815657,0.00067090924,0.9767736,0.0044528954,0.000016478933],"about_ca_topic_score_codex":0.0032025746,"about_ca_topic_score_gemma":0.002509269,"teacher_disagreement_score":0.007921099,"about_ca_system_score_codex":0.002440678,"about_ca_system_score_gemma":0.0013289117,"threshold_uncertainty_score":0.026498735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70226026,0.0013166831,0.25208628,0.0017275135,0.00022877642,0.00007279182,0.00048251526,0.00023000543,0.04159521],"genre_scores_gemma":[0.9702252,0.000437551,0.0215797,0.00014946614,0.00011964466,0.0000617775,0.00039620925,0.000055655746,0.00697474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981072,0.00063364,0.00012913483,0.00040099636,0.00027088597,0.0004580741],"domain_scores_gemma":[0.98981386,0.006345909,0.0009852949,0.00083824457,0.00087324594,0.0011434052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018305472,0.0007286102,0.0010939128,0.0014339356,0.002438668,0.0058349078,0.0013859556,0.0016075347,0.007615791],"category_scores_gemma":[0.007990742,0.0012278067,0.0011101924,0.0010859356,0.0051067304,0.007286442,0.0068393066,0.003432839,0.0008742573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011693892,0.000021122432,0.00072354963,0.00006320684,0.000016527409,0.00009097213,0.00029459907,0.0014591091,0.0011321238,0.9932215,0.0005287928,0.0023316864],"study_design_scores_gemma":[0.000042665975,0.000035489018,0.00035051053,0.000019069743,0.0000150389105,0.00020752203,0.00025845578,0.009542586,0.0013984173,0.9867931,0.0013153882,0.00002166289],"about_ca_topic_score_codex":0.00033860718,"about_ca_topic_score_gemma":0.00027792258,"teacher_disagreement_score":0.007615791,"about_ca_system_score_codex":0.0009057179,"about_ca_system_score_gemma":0.0007550447,"threshold_uncertainty_score":0.02547741},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5433483,0.0019980306,0.16747618,0.0050035235,0.0018829113,0.00013622202,0.00051393325,0.0006440849,0.27899683],"genre_scores_gemma":[0.9196949,0.0007353633,0.014256015,0.0007425174,0.00083764043,0.00008449587,0.00025112033,0.00033483288,0.063063085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855214,0.0003835723,0.00008624967,0.000293824,0.00033982657,0.0003442454],"domain_scores_gemma":[0.99733883,0.0012025473,0.000288693,0.00034174082,0.00033245984,0.00049575925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017795287,0.0009176845,0.0012375725,0.0030282896,0.0035545654,0.0042043272,0.0014292146,0.0015501059,0.019358007],"category_scores_gemma":[0.0041858675,0.0007476605,0.0010944341,0.0022315865,0.005592218,0.008048305,0.0031132053,0.003833494,0.0023958634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012078498,0.000015509911,0.00007713106,0.00000790106,0.0000026918872,0.00004950276,0.0001795651,0.0000865628,0.00019765014,0.9973035,0.0005114922,0.0015565287],"study_design_scores_gemma":[0.000007136468,0.0000058128016,0.00008023193,0.000003508754,0.0000034269376,0.00007613714,0.00003528335,0.00053841004,0.00020100005,0.9977174,0.0013211311,0.000010580868],"about_ca_topic_score_codex":0.0012390162,"about_ca_topic_score_gemma":0.0017141984,"teacher_disagreement_score":0.019358007,"about_ca_system_score_codex":0.0011060375,"about_ca_system_score_gemma":0.0008820246,"threshold_uncertainty_score":0.064759016},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8686571,0.00033986985,0.12097352,0.0010479736,0.000031415184,0.00007891927,0.0007642147,0.00033523358,0.007771664],"genre_scores_gemma":[0.97304577,0.00039875408,0.020825611,0.00020850246,0.000082258724,0.00016856147,0.00096895685,0.00011766859,0.004183884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987858,0.00051794155,0.00006168721,0.00023524293,0.000250173,0.00014922764],"domain_scores_gemma":[0.98183423,0.012688766,0.0024660057,0.0010573418,0.00071866706,0.0012350671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012280126,0.0005279009,0.00091166125,0.002509615,0.0009293752,0.0021358542,0.00153204,0.0012763329,0.0034477143],"category_scores_gemma":[0.012956291,0.0010132669,0.0006856158,0.001906327,0.0015681598,0.003663505,0.0015951967,0.0013102907,0.00032706067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005196494,0.00023861679,0.009832525,0.00029570606,0.00009290139,0.0005610862,0.001038839,0.07754356,0.008480496,0.87430656,0.003521515,0.023568563],"study_design_scores_gemma":[0.000090368965,0.00005981449,0.0029580658,0.000039563667,0.000056257537,0.00049010495,0.0002368662,0.21902725,0.0022607828,0.7733238,0.0014308651,0.00002626265],"about_ca_topic_score_codex":0.0007978419,"about_ca_topic_score_gemma":0.0016982041,"teacher_disagreement_score":0.0034477143,"about_ca_system_score_codex":0.0011686962,"about_ca_system_score_gemma":0.000517862,"threshold_uncertainty_score":0.011533737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91321784,0.0003904398,0.024831086,0.0005979386,0.00036398685,0.000079634636,0.00019286558,0.0002599015,0.060066372],"genre_scores_gemma":[0.97394323,0.00035360423,0.0049263714,0.00020403753,0.00020069827,0.000048347847,0.00023448323,0.00009636793,0.01999282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994442,0.00012370826,0.000030371923,0.00011797529,0.00012646186,0.0001572802],"domain_scores_gemma":[0.99846184,0.00045478245,0.00033290972,0.00023765046,0.00015984522,0.00035294058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039668672,0.0007079027,0.000660399,0.0018725538,0.0015472604,0.0021435113,0.0008413774,0.001112032,0.005794942],"category_scores_gemma":[0.0018207983,0.0005012419,0.0008805576,0.001310461,0.0024649338,0.001736217,0.0022641874,0.0016436935,0.00080249406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010647228,0.000032668333,0.00075127353,0.000039636645,0.000012421479,0.00039521014,0.0008350234,0.0024619335,0.0037072673,0.9844862,0.0009679156,0.006204009],"study_design_scores_gemma":[0.00004253394,0.000048442325,0.0011566638,0.000023196932,0.00001704922,0.00025608938,0.00036552642,0.0051601343,0.001389213,0.98734283,0.00417425,0.000023916788],"about_ca_topic_score_codex":0.0024377946,"about_ca_topic_score_gemma":0.0024870832,"teacher_disagreement_score":0.005794942,"about_ca_system_score_codex":0.0010746086,"about_ca_system_score_gemma":0.0005225866,"threshold_uncertainty_score":0.019385993},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8949759,0.0005229428,0.025598092,0.0009877305,0.00006107955,0.00002205307,0.00033089242,0.00017970025,0.07732163],"genre_scores_gemma":[0.9882234,0.00024456752,0.003723362,0.00009659775,0.00007080175,0.000023018669,0.00016118528,0.00005006543,0.0074070916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965024,0.00007395764,0.000015017054,0.0000659546,0.000090971786,0.00010384737],"domain_scores_gemma":[0.9985746,0.00083217793,0.00017126962,0.00006677885,0.00008342009,0.0002716831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000523914,0.0005419907,0.0005502386,0.0024374225,0.0022635874,0.0025104436,0.00076993357,0.00080111204,0.00992244],"category_scores_gemma":[0.0016742822,0.00036718557,0.00032666212,0.0012835725,0.002313762,0.0023226035,0.0014747145,0.0011065281,0.0006541462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035816588,0.000050745195,0.0010887088,0.000050847215,0.000009401879,0.00035684212,0.0005966827,0.0032211144,0.0040119677,0.98102796,0.0013499106,0.007877666],"study_design_scores_gemma":[0.00005390491,0.000028147339,0.0011559905,0.000038409355,0.00001071206,0.00023403483,0.00029832625,0.012827372,0.002028517,0.9811767,0.0021302258,0.000017561319],"about_ca_topic_score_codex":0.0012451386,"about_ca_topic_score_gemma":0.0011879746,"teacher_disagreement_score":0.00992244,"about_ca_system_score_codex":0.0011961659,"about_ca_system_score_gemma":0.0005323965,"threshold_uncertainty_score":0.033193886},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32625496,0.0004960723,0.14740105,0.0033134543,0.00048165282,0.00016417493,0.0004981905,0.0009418103,0.5204486],"genre_scores_gemma":[0.9599851,0.00020894657,0.020022288,0.0005450419,0.000115144365,0.00017806716,0.000474068,0.00028398013,0.018187346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786395,0.00058715034,0.00011795647,0.00039565313,0.0004517333,0.0005835018],"domain_scores_gemma":[0.993238,0.0036930614,0.00046428706,0.0009591363,0.0006103273,0.0010351641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015344826,0.00083302945,0.0010151037,0.0024399396,0.004483291,0.0061232485,0.0020580618,0.004050864,0.02500054],"category_scores_gemma":[0.013918031,0.00094229716,0.00093732757,0.0015712468,0.005703911,0.007460721,0.004611312,0.0043210145,0.0029885068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001596249,0.00007249497,0.0006030616,0.0000530201,0.000008696656,0.00094556634,0.00046984493,0.0011025226,0.0009854339,0.9868875,0.0034165669,0.005295721],"study_design_scores_gemma":[0.00003884595,0.000009084159,0.00012814793,0.00003562978,0.000009383808,0.0005239396,0.00037429103,0.004981145,0.00082927756,0.9908524,0.002202342,0.000015481544],"about_ca_topic_score_codex":0.00090071786,"about_ca_topic_score_gemma":0.0009847601,"teacher_disagreement_score":0.02500054,"about_ca_system_score_codex":0.0009193823,"about_ca_system_score_gemma":0.0009481871,"threshold_uncertainty_score":0.08363515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7798339,0.0011108827,0.14676069,0.0013941459,0.00020828473,0.00008216898,0.00046979068,0.0003534405,0.06978665],"genre_scores_gemma":[0.97039276,0.00021600813,0.021223307,0.00019577751,0.00011087771,0.00004542044,0.00026171582,0.00007488364,0.007479251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998027,0.0006141343,0.00017189074,0.0004769541,0.00036413153,0.00034578476],"domain_scores_gemma":[0.99492115,0.002422916,0.0005508221,0.0007218575,0.0006921384,0.0006910831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018838842,0.00044509344,0.0009518539,0.0021785456,0.0029160425,0.0063859667,0.0012427262,0.001392648,0.005125025],"category_scores_gemma":[0.004706882,0.0011665102,0.0012066339,0.001614903,0.0057759895,0.010717291,0.0031492964,0.00426912,0.00052342855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005243031,0.00002580741,0.00043365767,0.00002595595,0.000008411753,0.00009503215,0.00066597015,0.00021943916,0.0009328547,0.994873,0.00015122505,0.002516218],"study_design_scores_gemma":[0.0000195068,0.000015134357,0.0003324657,0.000015066285,0.000015793805,0.000111951435,0.00024919937,0.0011925781,0.0008535563,0.9959895,0.0011918123,0.000013447177],"about_ca_topic_score_codex":0.0016822458,"about_ca_topic_score_gemma":0.0031704186,"teacher_disagreement_score":0.0063859667,"about_ca_system_score_codex":0.0019304914,"about_ca_system_score_gemma":0.0008934486,"threshold_uncertainty_score":0.017144859},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48207465,0.0010662331,0.3826166,0.0034369717,0.0006405838,0.0002763066,0.0008971949,0.0018079495,0.12718359],"genre_scores_gemma":[0.91411215,0.0006666692,0.031735446,0.00068896275,0.00048036384,0.0002816313,0.00070861407,0.0005530357,0.05077308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969631,0.00094504445,0.00015972556,0.00088548043,0.00061055477,0.00043613292],"domain_scores_gemma":[0.98955137,0.005999265,0.0009988648,0.0012092051,0.0007353794,0.0015059089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017903699,0.0008278023,0.0011036667,0.0033238588,0.0024837435,0.0042832186,0.0019076666,0.0016846114,0.013689537],"category_scores_gemma":[0.011778292,0.001048317,0.0017273938,0.0019942997,0.0029492767,0.009066451,0.005171488,0.003913232,0.0017509226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060397953,0.000036245012,0.00024165887,0.000029649735,0.000012032863,0.0000921247,0.0002923434,0.00057146646,0.00055449817,0.9928479,0.0006874406,0.004574222],"study_design_scores_gemma":[0.0000328601,0.000027247077,0.00023796382,0.000012831853,0.000020197951,0.0002902557,0.000110173474,0.0046381536,0.0007242873,0.9909815,0.0029051243,0.0000193512],"about_ca_topic_score_codex":0.0005916784,"about_ca_topic_score_gemma":0.00035846603,"teacher_disagreement_score":0.013689537,"about_ca_system_score_codex":0.001495884,"about_ca_system_score_gemma":0.0007283915,"threshold_uncertainty_score":0.045796096},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5682385,0.00023810288,0.30660573,0.008499104,0.0010567943,0.00033017376,0.0014042036,0.0035298779,0.11009744],"genre_scores_gemma":[0.91217357,0.00011091736,0.058033,0.00088910374,0.00020624833,0.00012636815,0.0007076004,0.0009868502,0.02676632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991775,0.00011033211,0.00003705926,0.00022241918,0.00019362464,0.00025894993],"domain_scores_gemma":[0.9962559,0.0017764082,0.00024596218,0.00076736405,0.00033490133,0.0006194614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064265303,0.00061392196,0.001231688,0.00042843382,0.0021041748,0.002150585,0.0017464177,0.0019905241,0.026573136],"category_scores_gemma":[0.005653868,0.00080068386,0.0012470465,0.0006178121,0.001525487,0.0038725298,0.0031529013,0.0031538773,0.0032324507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008682834,0.00027676017,0.00195823,0.00033951655,0.0000539269,0.0010376795,0.00072977884,0.010220454,0.03141451,0.8935058,0.037995182,0.021600002],"study_design_scores_gemma":[0.0002973296,0.000119131684,0.0007326514,0.000020912918,0.000038222228,0.00097281416,0.00035386923,0.0451258,0.0065536555,0.929687,0.016064169,0.00003432943],"about_ca_topic_score_codex":0.0012799345,"about_ca_topic_score_gemma":0.002543191,"teacher_disagreement_score":0.026573136,"about_ca_system_score_codex":0.00083300413,"about_ca_system_score_gemma":0.00082342804,"threshold_uncertainty_score":0.088896036},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48311412,0.0069881147,0.23845445,0.009693202,0.0007357022,0.00009724026,0.0007827436,0.00087638013,0.2592581],"genre_scores_gemma":[0.9420362,0.0019326466,0.028840492,0.0007692308,0.0005298273,0.00012081386,0.0003265828,0.00015098263,0.025293263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989472,0.00046451474,0.000060992814,0.0001857833,0.00020508716,0.00013645357],"domain_scores_gemma":[0.99602216,0.0026456392,0.00032350488,0.0003476919,0.00027215198,0.0003888476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002760048,0.00080437865,0.0012958958,0.0035220427,0.0026390825,0.0035403783,0.001966302,0.001844804,0.00848483],"category_scores_gemma":[0.0065408205,0.00076117634,0.0013018623,0.002411917,0.0057882867,0.010779796,0.0033434296,0.004193726,0.0007864063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012145714,0.0000057572233,0.00009993026,0.00001530723,0.0000030735307,0.000026713346,0.00012449683,0.00019194488,0.000098584605,0.9980076,0.0003794032,0.0010350662],"study_design_scores_gemma":[0.00001724948,0.0000074943864,0.000119809825,0.000008051007,0.0000087398685,0.000047396705,0.000060297676,0.0008329062,0.00011864211,0.99731535,0.0014578928,0.0000061333],"about_ca_topic_score_codex":0.0010054758,"about_ca_topic_score_gemma":0.0009375937,"teacher_disagreement_score":0.00848483,"about_ca_system_score_codex":0.0020518485,"about_ca_system_score_gemma":0.0007067962,"threshold_uncertainty_score":0.028384626},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53864163,0.0038355887,0.14920485,0.01229314,0.000622753,0.00006983414,0.0008480452,0.00031636743,0.29416776],"genre_scores_gemma":[0.9726561,0.00060589233,0.0059419596,0.0005296124,0.0002540992,0.000049442646,0.00015349995,0.000060118437,0.019749364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977017,0.0006467718,0.00019159293,0.0006254842,0.00042090897,0.0004135478],"domain_scores_gemma":[0.984846,0.008556138,0.0013151757,0.0025152338,0.0013322644,0.001435248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003219669,0.0006146392,0.0013763288,0.0023793527,0.0036710124,0.0055352617,0.0014481877,0.0020834752,0.010038916],"category_scores_gemma":[0.014098621,0.00075244234,0.0012116047,0.0018645329,0.009011273,0.01825285,0.006977883,0.005932807,0.0008876785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035183395,0.000009312,0.00038647428,0.000015874362,0.000005088938,0.000043057924,0.00032220627,0.00014618466,0.0001241439,0.996874,0.000252013,0.0017865056],"study_design_scores_gemma":[0.000008280857,0.000007267687,0.00016327108,0.00000826284,0.0000074919694,0.00011362343,0.00012702051,0.000417114,0.00012909267,0.99707925,0.0019323364,0.0000070246156],"about_ca_topic_score_codex":0.000699052,"about_ca_topic_score_gemma":0.0004888239,"teacher_disagreement_score":0.010038916,"about_ca_system_score_codex":0.0014327508,"about_ca_system_score_gemma":0.00083497615,"threshold_uncertainty_score":0.03358352},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58341074,0.00088114943,0.056548998,0.0018700723,0.0012865622,0.000086063046,0.00030215003,0.00073079875,0.35488346],"genre_scores_gemma":[0.8995535,0.00067015056,0.009337868,0.0007542973,0.00080484047,0.00006565043,0.0003153519,0.00021273436,0.08828568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959487,0.000072803174,0.000018380128,0.00009064486,0.00012505866,0.000098319775],"domain_scores_gemma":[0.9990453,0.00020243508,0.00011675921,0.00010096914,0.0002161342,0.00031837184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048216718,0.0006270022,0.00050811196,0.0023844105,0.00169338,0.002948556,0.0006632054,0.0010155665,0.010798198],"category_scores_gemma":[0.0015123924,0.00046797597,0.000513541,0.0009787906,0.0014491769,0.0028362034,0.0020450377,0.0020567842,0.0017808676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030780855,0.000022045908,0.00013383722,0.0000139730355,0.00000646306,0.00009014812,0.00012322798,0.00015179273,0.00097344414,0.9940402,0.0011657103,0.0032483311],"study_design_scores_gemma":[0.000027893917,0.00001939279,0.0003834059,0.000007311656,0.000012887987,0.00035157372,0.000138198,0.0016383358,0.0012526457,0.9896528,0.00650217,0.000013405018],"about_ca_topic_score_codex":0.00071675406,"about_ca_topic_score_gemma":0.000710256,"teacher_disagreement_score":0.010798198,"about_ca_system_score_codex":0.000859794,"about_ca_system_score_gemma":0.0005489712,"threshold_uncertainty_score":0.036123514},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5693979,0.0045015165,0.31320038,0.0040295264,0.00023902813,0.00017681303,0.0008814579,0.00045772214,0.10711561],"genre_scores_gemma":[0.93073714,0.001719376,0.046826255,0.0002915414,0.00017804834,0.0002598055,0.00048591464,0.000111292364,0.019390637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989023,0.00032070393,0.00008645139,0.00024330695,0.00031792215,0.00012928183],"domain_scores_gemma":[0.9955995,0.003073211,0.00032916828,0.00025541236,0.0003475341,0.0003952333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010611103,0.00063977594,0.0011578089,0.0037057577,0.0034078523,0.005275823,0.001533593,0.001761764,0.008496982],"category_scores_gemma":[0.0064954874,0.0010091272,0.0010516649,0.00496887,0.0052666296,0.009887285,0.0035816617,0.0030144393,0.00049275055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015135649,0.000008292939,0.00016983267,0.000033137545,0.000004910884,0.00003160599,0.00034024112,0.000846136,0.00015105418,0.9952958,0.00027706358,0.002826807],"study_design_scores_gemma":[0.0000045403917,0.0000032815435,0.000047938698,0.0000073104507,0.0000046833625,0.000028719896,0.00006865827,0.0012791231,0.0000816745,0.99746335,0.0010071063,0.0000035072885],"about_ca_topic_score_codex":0.0028222115,"about_ca_topic_score_gemma":0.0031180705,"teacher_disagreement_score":0.008496982,"about_ca_system_score_codex":0.0023524156,"about_ca_system_score_gemma":0.0011172013,"threshold_uncertainty_score":0.028425217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.438769,0.0037964014,0.08683373,0.037016198,0.0023380711,0.000063352694,0.00068310817,0.0005597706,0.42994034],"genre_scores_gemma":[0.9521302,0.00072169007,0.011209134,0.002815609,0.0009741939,0.00008596045,0.00044755856,0.00009262704,0.031522956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987986,0.0003113012,0.00007010549,0.00034208733,0.00021980575,0.00025812158],"domain_scores_gemma":[0.9970151,0.0017785345,0.00016973581,0.0004528162,0.0003589563,0.00022490502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018205479,0.0008047382,0.0015768876,0.001964695,0.005162189,0.0034896554,0.001418316,0.003714751,0.01148304],"category_scores_gemma":[0.0061434144,0.00078748097,0.0013556638,0.0022538335,0.006910946,0.011291586,0.0035590914,0.003963433,0.0013692778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043201013,0.000014645903,0.00015415618,0.000021412252,0.00000470024,0.000058235077,0.00024164579,0.00033277227,0.00013307863,0.9948992,0.0020548208,0.002042112],"study_design_scores_gemma":[0.0000102021495,0.0000044862218,0.000082414095,0.0000046655955,0.0000031498084,0.00003333802,0.000056308985,0.00054560596,0.00006877601,0.99684477,0.0023402113,0.000005930703],"about_ca_topic_score_codex":0.0022662492,"about_ca_topic_score_gemma":0.002714845,"teacher_disagreement_score":0.01148304,"about_ca_system_score_codex":0.0020680951,"about_ca_system_score_gemma":0.00085885846,"threshold_uncertainty_score":0.038414598},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07413577,0.0040341606,0.7054272,0.012489936,0.0058941822,0.00031830056,0.0010105022,0.0019409703,0.19474894],"genre_scores_gemma":[0.66892904,0.0038646706,0.24972665,0.0063054073,0.0038108297,0.00059373764,0.0014614924,0.002194186,0.06311411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980909,0.0005663946,0.000110235036,0.00030762306,0.0006488871,0.00027599777],"domain_scores_gemma":[0.9941076,0.0039745476,0.00017686795,0.0005437686,0.0008473755,0.00034992048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029291236,0.002524394,0.0020999487,0.003421208,0.0042535854,0.0045630415,0.0030317672,0.002630474,0.020564474],"category_scores_gemma":[0.012489517,0.0014224043,0.0037672564,0.003266468,0.004945892,0.011508817,0.009540412,0.00857015,0.003772941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008685,0.0001366109,0.00027994273,0.00026760256,0.00004339733,0.0004552898,0.0008549794,0.001080535,0.0023785408,0.96403396,0.010053753,0.020328576],"study_design_scores_gemma":[0.000047445483,0.00003527675,0.00026906113,0.00007147662,0.0000450095,0.00023055647,0.00012668839,0.003791095,0.0011637082,0.9810377,0.013124641,0.000057310517],"about_ca_topic_score_codex":0.003093047,"about_ca_topic_score_gemma":0.0035074763,"teacher_disagreement_score":0.020564474,"about_ca_system_score_codex":0.0024775537,"about_ca_system_score_gemma":0.001362363,"threshold_uncertainty_score":0.068794966},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7836333,0.00040045654,0.06873111,0.001806252,0.0004687485,0.00010452852,0.00032701038,0.0013682056,0.14316027],"genre_scores_gemma":[0.96994823,0.00030493928,0.0059375796,0.00024205669,0.00016151724,0.000059742288,0.00024019426,0.00041867082,0.022687035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975696,0.00035459883,0.0001299506,0.00030575471,0.0007285529,0.0009115414],"domain_scores_gemma":[0.9940329,0.002840055,0.00060876383,0.00086888974,0.00035136717,0.001298082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012763554,0.0011232606,0.0012264415,0.0028248096,0.0038353882,0.0056031034,0.0017414446,0.0024105406,0.01496308],"category_scores_gemma":[0.006236127,0.001488566,0.001647042,0.002325626,0.0056161657,0.0056751096,0.009472018,0.0059655854,0.0017402257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012835154,0.000092674134,0.0013527845,0.00007484623,0.00001695586,0.00080044183,0.0013142646,0.0012170045,0.0022994813,0.9868123,0.0017482166,0.004142804],"study_design_scores_gemma":[0.00006910822,0.000026881175,0.0011850062,0.00003439083,0.0000542629,0.0005541381,0.00061660126,0.0041553206,0.0021981485,0.9849978,0.006060777,0.000047595044],"about_ca_topic_score_codex":0.001607456,"about_ca_topic_score_gemma":0.0019403083,"teacher_disagreement_score":0.01496308,"about_ca_system_score_codex":0.0015829931,"about_ca_system_score_gemma":0.0007373717,"threshold_uncertainty_score":0.050056517},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5749542,0.00046192735,0.39002776,0.00082733645,0.0002723128,0.00016970676,0.00091910746,0.0009283378,0.031439252],"genre_scores_gemma":[0.94013274,0.00032851048,0.03303549,0.00025018683,0.0004529879,0.00023853334,0.000924197,0.00043819923,0.024199149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984395,0.0004684719,0.00009466836,0.0003719186,0.0003093264,0.0003161329],"domain_scores_gemma":[0.99571395,0.001886443,0.0005546315,0.00044203096,0.0004693138,0.0009335351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014289634,0.0008818716,0.0011890358,0.0025595813,0.0016145048,0.003984323,0.001456832,0.00084714557,0.008048611],"category_scores_gemma":[0.0048369877,0.00077872875,0.0017269235,0.0015395435,0.0019506968,0.003999727,0.0020379694,0.0020690262,0.001006136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037191462,0.00012226863,0.000758402,0.00008364413,0.000052899286,0.00028000458,0.00082087936,0.0022566349,0.0070637297,0.97106946,0.0019808349,0.015139281],"study_design_scores_gemma":[0.00007071193,0.000071708106,0.0008795062,0.00001340836,0.00004527303,0.000410278,0.00018284694,0.013031859,0.003011516,0.97871965,0.003524022,0.00003922608],"about_ca_topic_score_codex":0.0010942353,"about_ca_topic_score_gemma":0.0010334093,"teacher_disagreement_score":0.008048611,"about_ca_system_score_codex":0.0012224743,"about_ca_system_score_gemma":0.00068063865,"threshold_uncertainty_score":0.026925325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39728585,0.00080478285,0.5186018,0.0010339128,0.0004163429,0.0002308045,0.0006580322,0.00045715377,0.08051129],"genre_scores_gemma":[0.8282719,0.0006558586,0.117009476,0.00026041397,0.0001736156,0.00019994433,0.00094975723,0.0004055357,0.052073453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994881,0.00010947849,0.000028280605,0.00008914147,0.00020305818,0.00008198207],"domain_scores_gemma":[0.9988146,0.00048939453,0.00016516767,0.00019307922,0.0001845512,0.00015331236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005644761,0.00043072045,0.0005246666,0.0017029463,0.0010222893,0.0018917305,0.0012948219,0.00097096537,0.012445104],"category_scores_gemma":[0.0026512952,0.00054168,0.00087324326,0.0010511366,0.0010481417,0.0019210269,0.0017842989,0.0018374458,0.0012036768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042040836,0.000045917564,0.00037952,0.00004741008,0.000009394841,0.00011376472,0.00020394742,0.0079102125,0.0027093848,0.960729,0.003077735,0.024731666],"study_design_scores_gemma":[0.000031091822,0.00004640583,0.0005133364,0.000030736188,0.000015227346,0.00036830964,0.00015297015,0.07816285,0.0034729724,0.9078824,0.009298647,0.00002507732],"about_ca_topic_score_codex":0.0005159754,"about_ca_topic_score_gemma":0.00061770884,"teacher_disagreement_score":0.012445104,"about_ca_system_score_codex":0.0007419335,"about_ca_system_score_gemma":0.00034483528,"threshold_uncertainty_score":0.04163301},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87544227,0.0002926618,0.095972255,0.00081568817,0.000055311997,0.00006351108,0.0004915996,0.00093069405,0.025935952],"genre_scores_gemma":[0.9709986,0.0002264755,0.020017806,0.00019282122,0.000052644456,0.000047976857,0.0005833187,0.00015982971,0.007720535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926084,0.00017003834,0.00004347391,0.00019896071,0.00020733933,0.00011925086],"domain_scores_gemma":[0.9952749,0.002330305,0.00080041133,0.00058911834,0.00034745358,0.00065789383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005894307,0.0004863219,0.0007268029,0.002249877,0.0019294932,0.003180501,0.0011067195,0.001313034,0.0057352614],"category_scores_gemma":[0.004723576,0.00087933935,0.00063799793,0.0023871604,0.0017166277,0.0043953005,0.0017570574,0.0014324083,0.00065785897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028606315,0.00014991287,0.0055541354,0.00017371419,0.000037225807,0.00081012776,0.0017200938,0.008757829,0.007494241,0.95160496,0.0031557602,0.02025593],"study_design_scores_gemma":[0.000028779346,0.000032042277,0.0015190201,0.000021621174,0.000047048947,0.0006749491,0.00045135833,0.018858278,0.0020562478,0.97358465,0.00270128,0.000024651612],"about_ca_topic_score_codex":0.0012584686,"about_ca_topic_score_gemma":0.0026582477,"teacher_disagreement_score":0.0057352614,"about_ca_system_score_codex":0.00070958625,"about_ca_system_score_gemma":0.0004555349,"threshold_uncertainty_score":0.019186318},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87660676,0.00069244346,0.07381462,0.0013305467,0.00008397745,0.00006466805,0.00063433865,0.00053649413,0.046236113],"genre_scores_gemma":[0.9778022,0.0002962926,0.014087213,0.00013394738,0.00010544778,0.00013595077,0.0003365029,0.00010361179,0.006998781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998295,0.0003557124,0.00013123389,0.000358825,0.0005680678,0.00029116176],"domain_scores_gemma":[0.98630667,0.009587063,0.001283518,0.00087341,0.00069228193,0.0012570785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017489145,0.0005203632,0.0016796243,0.004415252,0.0048286356,0.007291062,0.0024991718,0.002214347,0.006254718],"category_scores_gemma":[0.010603379,0.0017237369,0.0012765512,0.0035174903,0.0052759983,0.010415655,0.0035100954,0.0024404645,0.0005776429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019985183,0.000047452762,0.0012271596,0.000080471684,0.00002247351,0.00015885632,0.0009767463,0.0023375866,0.0021872388,0.9882465,0.0007362673,0.0037793084],"study_design_scores_gemma":[0.00003901227,0.000017351622,0.00048958923,0.000017253014,0.000027881342,0.00019685163,0.00034560252,0.0051203645,0.001322369,0.9915141,0.00088875304,0.000020874515],"about_ca_topic_score_codex":0.0009871023,"about_ca_topic_score_gemma":0.0017836476,"teacher_disagreement_score":0.007291062,"about_ca_system_score_codex":0.0019741294,"about_ca_system_score_gemma":0.00087399664,"threshold_uncertainty_score":0.020924151},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6349702,0.0008247761,0.24551982,0.0014427513,0.00021678377,0.00011681649,0.00078964734,0.0006335311,0.11548566],"genre_scores_gemma":[0.94398624,0.00028025347,0.039796546,0.00028457126,0.00021324544,0.00009945399,0.0007984485,0.00018956895,0.014351653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988404,0.0002926103,0.00013792343,0.00022204239,0.00029216942,0.00021487003],"domain_scores_gemma":[0.9964142,0.0020817546,0.00037984183,0.00028455906,0.000482629,0.00035702868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008346424,0.00053519994,0.0006382783,0.0025817072,0.001780982,0.0045199962,0.0008336048,0.0010380123,0.0070951246],"category_scores_gemma":[0.0037769454,0.00056075485,0.0007749183,0.0017971557,0.0031554396,0.004975653,0.0019345916,0.0017289354,0.0009735164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069748414,0.000031662865,0.00053404213,0.000047479443,0.0000063031575,0.00020843153,0.00082504,0.000482442,0.0029770364,0.9874536,0.0005810231,0.0067831026],"study_design_scores_gemma":[0.000019934962,0.000030573545,0.00055758376,0.000029032568,0.000016935339,0.00044039782,0.00051751314,0.005701387,0.0018509931,0.9855456,0.0052596196,0.000030411336],"about_ca_topic_score_codex":0.0004338548,"about_ca_topic_score_gemma":0.00068488304,"teacher_disagreement_score":0.0070951246,"about_ca_system_score_codex":0.0008924893,"about_ca_system_score_gemma":0.0005121368,"threshold_uncertainty_score":0.023735583},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.635992,0.007928861,0.21006028,0.008569436,0.0005395061,0.000085719774,0.000602731,0.00026785018,0.1359536],"genre_scores_gemma":[0.96041185,0.0025451886,0.017389642,0.00076233305,0.00076990406,0.00011422575,0.00045095166,0.00012897316,0.01742692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971073,0.0008417791,0.00027358186,0.0005702583,0.0007193618,0.00048761925],"domain_scores_gemma":[0.9857218,0.00917885,0.001156771,0.0015636742,0.0010041514,0.001374871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051902127,0.0015991094,0.0021452836,0.004877007,0.005228727,0.0073280837,0.0034190025,0.0027270308,0.007050674],"category_scores_gemma":[0.012433009,0.0015843856,0.0031823232,0.0057887235,0.008360103,0.020151429,0.0085991705,0.010469442,0.0005498205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006809953,0.000040022573,0.0005528514,0.00007973974,0.0000317979,0.00014345354,0.0005201768,0.00070731755,0.00054249354,0.99429375,0.00046184805,0.0025584188],"study_design_scores_gemma":[0.000014944972,0.00003589553,0.00042574914,0.000022748969,0.00003198005,0.00010764915,0.00022553852,0.003005589,0.00043082915,0.9943264,0.0013573852,0.000015268568],"about_ca_topic_score_codex":0.0010810874,"about_ca_topic_score_gemma":0.0008797692,"teacher_disagreement_score":0.0073280837,"about_ca_system_score_codex":0.0029778513,"about_ca_system_score_gemma":0.0009475897,"threshold_uncertainty_score":0.027448773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9460535,0.0010013296,0.025515959,0.002273813,0.00022456457,0.00005616776,0.0003979783,0.00016323435,0.024313409],"genre_scores_gemma":[0.9846299,0.0004771154,0.009456963,0.00018483019,0.00022558999,0.000095308795,0.00032756416,0.00006093321,0.004541726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982685,0.0004987526,0.00014473875,0.00031719301,0.00043465602,0.0003362867],"domain_scores_gemma":[0.98022735,0.013720116,0.0025777207,0.0009850059,0.00085769413,0.0016320489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025483065,0.0008249132,0.001629879,0.004258912,0.0030105151,0.005467752,0.0033293383,0.0029188597,0.0101362085],"category_scores_gemma":[0.017934376,0.00076944695,0.0009508623,0.00268797,0.00449036,0.0070824316,0.0030037286,0.002371542,0.0005290865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012512456,0.00020948694,0.0063679535,0.00042856063,0.00012592043,0.00038539624,0.0011070272,0.01427022,0.008373619,0.9410181,0.0035867682,0.02287569],"study_design_scores_gemma":[0.00014675956,0.00011374939,0.0022694785,0.000087513705,0.000077931676,0.00051601464,0.00058401906,0.046624873,0.003337798,0.94433784,0.001838921,0.00006507443],"about_ca_topic_score_codex":0.0005189355,"about_ca_topic_score_gemma":0.00065510604,"teacher_disagreement_score":0.0101362085,"about_ca_system_score_codex":0.0019097069,"about_ca_system_score_gemma":0.0009980049,"threshold_uncertainty_score":0.033909023},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12561065,0.0019086017,0.7944769,0.0034858924,0.00069824903,0.00013341283,0.00088218384,0.00021026387,0.07259383],"genre_scores_gemma":[0.74909776,0.0022983667,0.10902379,0.0013164029,0.0012760129,0.00044889655,0.0015341212,0.00057152816,0.13443315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980849,0.00042605808,0.00013521456,0.0004152326,0.0005835067,0.0003552069],"domain_scores_gemma":[0.9963852,0.0023230617,0.00029920458,0.00017791745,0.0005291138,0.00028543003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019199627,0.0013658329,0.0018683589,0.0022390278,0.0017785897,0.0036251734,0.0032612418,0.0021626728,0.014359844],"category_scores_gemma":[0.00791204,0.0011459237,0.0019700758,0.0023633938,0.002835691,0.009537064,0.0044188504,0.0060000024,0.00193211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020831167,0.000025633035,0.00037274248,0.00009763134,0.00002050723,0.00013522309,0.0003626597,0.0064472063,0.0009839195,0.98144424,0.0029074624,0.007182],"study_design_scores_gemma":[0.000013019145,0.000027468432,0.0004273842,0.000035694356,0.000032999957,0.00022972752,0.00024927294,0.071739055,0.00077105,0.92088896,0.0055368952,0.00004837338],"about_ca_topic_score_codex":0.0038659116,"about_ca_topic_score_gemma":0.00419339,"teacher_disagreement_score":0.014359844,"about_ca_system_score_codex":0.0022090047,"about_ca_system_score_gemma":0.0012455484,"threshold_uncertainty_score":0.048038423},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.780918,0.0016516768,0.0813464,0.013153713,0.00039981143,0.000070622744,0.0011730961,0.00044058493,0.12084598],"genre_scores_gemma":[0.9780895,0.0007104288,0.008236546,0.0010073195,0.00032450145,0.000067093075,0.00085448526,0.0000970611,0.010613147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797636,0.0004921246,0.000085778585,0.00057078915,0.0004740861,0.00040085948],"domain_scores_gemma":[0.99092263,0.0050263503,0.00087651116,0.0012885734,0.0008365443,0.0010493487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014238382,0.00065669726,0.0017384008,0.0018044105,0.0034664266,0.0045498963,0.001961923,0.002864323,0.010039271],"category_scores_gemma":[0.009461693,0.0008338089,0.0013666748,0.002500576,0.0046681347,0.010204334,0.0045806062,0.0044629555,0.0008726648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081239035,0.000031818578,0.00075182103,0.0000839215,0.000017884984,0.00007408463,0.0003254915,0.0030237036,0.00051806186,0.98889565,0.0027974756,0.0033988892],"study_design_scores_gemma":[0.000030035451,0.000013042033,0.00046875403,0.00001576451,0.000011769917,0.00009179023,0.00014402754,0.008275256,0.0003618725,0.9883936,0.002177892,0.000016171281],"about_ca_topic_score_codex":0.0030147787,"about_ca_topic_score_gemma":0.002876114,"teacher_disagreement_score":0.010039271,"about_ca_system_score_codex":0.0024841547,"about_ca_system_score_gemma":0.001066095,"threshold_uncertainty_score":0.033584714},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09405539,0.0008377709,0.89619124,0.001664188,0.00018216371,0.00007667488,0.00026518467,0.0006143108,0.0061131273],"genre_scores_gemma":[0.64436644,0.0008104227,0.33689693,0.0009499497,0.00048745732,0.0005928597,0.000949697,0.0005949457,0.01435128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99313724,0.0038754574,0.00034660913,0.0007870332,0.0012295991,0.00062402914],"domain_scores_gemma":[0.9670984,0.023257898,0.0016239068,0.005068185,0.0017383922,0.0012130952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056300545,0.0011994473,0.002381153,0.001957086,0.0011990463,0.0037667481,0.0032433048,0.0021922218,0.004876225],"category_scores_gemma":[0.045300316,0.0010029776,0.00079658796,0.0036123178,0.0041474253,0.0046185995,0.006375784,0.0028901251,0.0013759552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013008086,0.00016731842,0.0014863296,0.00026959332,0.00009760407,0.0001978488,0.00051520154,0.19958363,0.0057563614,0.71055967,0.0073796017,0.07268603],"study_design_scores_gemma":[0.00008980798,0.00007859456,0.00023078779,0.000032165262,0.000013139943,0.00013054902,0.00007675672,0.3641691,0.0016398034,0.6314836,0.002022302,0.000033489],"about_ca_topic_score_codex":0.0011931781,"about_ca_topic_score_gemma":0.0010132843,"teacher_disagreement_score":0.0056300545,"about_ca_system_score_codex":0.0020094612,"about_ca_system_score_gemma":0.0017205824,"threshold_uncertainty_score":0.029774964},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8147716,0.00048114976,0.09448699,0.00222089,0.000699066,0.00007567271,0.00029496953,0.00034357162,0.086626165],"genre_scores_gemma":[0.96868193,0.00028192654,0.006579903,0.00027917261,0.00043475203,0.000057711048,0.00014069176,0.00007415837,0.023469739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939716,0.000118955315,0.000024268536,0.00007962676,0.00019006757,0.0001899208],"domain_scores_gemma":[0.9986124,0.00048160678,0.00028038013,0.00012362629,0.0001643926,0.0003376123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008181332,0.00070358446,0.00064634345,0.0021239624,0.002223556,0.0033564444,0.00094589114,0.0010751463,0.009821353],"category_scores_gemma":[0.0030197848,0.00034159937,0.00062925374,0.0018487682,0.00373241,0.0042624036,0.0020743448,0.00247097,0.001169961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052343657,0.000018017121,0.00014791853,0.000014766051,0.0000026760606,0.000060095634,0.00020691502,0.00047077902,0.00063962623,0.9937736,0.0005816836,0.0040316493],"study_design_scores_gemma":[0.000023941084,0.00002632339,0.0003147568,0.000009505557,0.000008465018,0.000083668005,0.00011562703,0.0026917583,0.0005930388,0.9935275,0.002580987,0.00002445317],"about_ca_topic_score_codex":0.0011720285,"about_ca_topic_score_gemma":0.0018579866,"teacher_disagreement_score":0.009821353,"about_ca_system_score_codex":0.0018532358,"about_ca_system_score_gemma":0.0009804948,"threshold_uncertainty_score":0.03285569},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69392717,0.0008969893,0.26959547,0.0012933385,0.00024810142,0.00006128763,0.00030971272,0.0006005607,0.03306734],"genre_scores_gemma":[0.96232575,0.00063841237,0.025321033,0.00025707626,0.0005588606,0.00011089384,0.00037175845,0.00046032763,0.009955962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99658906,0.00077973236,0.0002688907,0.00083221163,0.0008770781,0.00065308274],"domain_scores_gemma":[0.98195803,0.0098023955,0.0022530528,0.0012057634,0.001894385,0.0028865049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004034039,0.0018309236,0.0021552427,0.00861723,0.0032723371,0.007866618,0.0051349686,0.0022615304,0.0063464073],"category_scores_gemma":[0.018905552,0.0014542858,0.002126289,0.0052091996,0.007694121,0.017119136,0.0063077467,0.0040549175,0.00073595886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006863748,0.00004576377,0.00093039364,0.000049254893,0.000025406018,0.00017123006,0.00055635447,0.00081088947,0.0016236964,0.9909943,0.000475255,0.004249023],"study_design_scores_gemma":[0.000014427488,0.000046410758,0.0008627389,0.00003777921,0.00006892626,0.00072601996,0.00033473826,0.014119881,0.0018134107,0.97969776,0.0022298004,0.00004813416],"about_ca_topic_score_codex":0.0010784524,"about_ca_topic_score_gemma":0.00061143615,"teacher_disagreement_score":0.00861723,"about_ca_system_score_codex":0.0027498193,"about_ca_system_score_gemma":0.001190652,"threshold_uncertainty_score":0.02133429},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8029935,0.000898699,0.08991525,0.0018157196,0.0002196974,0.00023804046,0.0019675759,0.00056743436,0.101384126],"genre_scores_gemma":[0.9529288,0.0004224246,0.02342432,0.00030150122,0.00015207366,0.00012674641,0.0025089919,0.00019684805,0.019938376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912304,0.00020539045,0.000027653663,0.00020095737,0.00025979686,0.00018324406],"domain_scores_gemma":[0.99674535,0.0015033268,0.00035066812,0.00048459004,0.0003584628,0.0005576065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042104116,0.00050780375,0.00084675325,0.0014952032,0.0019201026,0.0027689845,0.0024342386,0.0011285885,0.013576798],"category_scores_gemma":[0.0032351313,0.000662705,0.0008788945,0.0015171965,0.0013544892,0.0020469138,0.0015034239,0.002118381,0.0009924244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041022123,0.00019322072,0.0016977029,0.00034822978,0.00010453381,0.000505783,0.00096503866,0.011596434,0.014252382,0.94225055,0.010047378,0.017628444],"study_design_scores_gemma":[0.0001351549,0.00004353633,0.0025288542,0.000036074303,0.0000752617,0.00034583622,0.0004373658,0.03869013,0.003648664,0.94235545,0.011672891,0.00003063984],"about_ca_topic_score_codex":0.0038278496,"about_ca_topic_score_gemma":0.006234085,"teacher_disagreement_score":0.013576798,"about_ca_system_score_codex":0.0014036401,"about_ca_system_score_gemma":0.0008448899,"threshold_uncertainty_score":0.045418918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8714228,0.00024981837,0.07532489,0.0005921629,0.00009130933,0.00005204078,0.0005100887,0.00018471466,0.051572192],"genre_scores_gemma":[0.97904384,0.00025676607,0.010203714,0.00011500934,0.0001635239,0.000080160615,0.0004339658,0.00008669215,0.009616398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992242,0.00015300677,0.00005155193,0.00017339246,0.0002586718,0.00013907478],"domain_scores_gemma":[0.995564,0.0020110125,0.00075221556,0.00032881298,0.0005567503,0.00078734366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008660458,0.0008624734,0.0009988829,0.0029980026,0.002753928,0.00399247,0.0015769453,0.0011634944,0.010537167],"category_scores_gemma":[0.006127908,0.0012188787,0.0010163501,0.0021518213,0.00383496,0.004438099,0.0035767627,0.0022935062,0.0011865998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019717112,0.000029629378,0.0010751154,0.000049909653,0.000019177656,0.0003609821,0.0006365406,0.0011033049,0.0030722187,0.98756045,0.00062048185,0.0052750385],"study_design_scores_gemma":[0.000036114536,0.000030210877,0.00074592297,0.00001795512,0.00002214934,0.00041410438,0.00029689746,0.004530562,0.0011970875,0.99137056,0.0013171191,0.000021342537],"about_ca_topic_score_codex":0.0006221579,"about_ca_topic_score_gemma":0.00075929926,"teacher_disagreement_score":0.010537167,"about_ca_system_score_codex":0.0007156797,"about_ca_system_score_gemma":0.00045601564,"threshold_uncertainty_score":0.035250366},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2591119,0.0032701504,0.41353247,0.0077306814,0.002827867,0.0001912861,0.0011388019,0.00070743717,0.31148937],"genre_scores_gemma":[0.8766246,0.0012438776,0.07067962,0.002627439,0.0015568858,0.00026556323,0.0007100986,0.00023697068,0.046055056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938095,0.00008728375,0.000042411386,0.000250537,0.00012611857,0.00011259725],"domain_scores_gemma":[0.9991748,0.00032044313,0.000078668214,0.0001774678,0.0001341433,0.00011455745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008357466,0.00056019315,0.000946075,0.0020089105,0.0019506216,0.001834341,0.0012905606,0.0010639066,0.009099713],"category_scores_gemma":[0.002236648,0.00039114492,0.002118129,0.0011475841,0.0026029663,0.0067901667,0.0038296282,0.002533084,0.0010246031],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031513497,0.000013097674,0.00026845338,0.00005397036,0.000014226587,0.00007759676,0.00024862026,0.00041460327,0.0011168015,0.99027866,0.00230766,0.005174827],"study_design_scores_gemma":[0.0000111244735,0.00002415963,0.0006115419,0.000019602418,0.00001856017,0.00020127678,0.00008007345,0.002090759,0.0006706067,0.9848134,0.011445909,0.000013087973],"about_ca_topic_score_codex":0.0011757559,"about_ca_topic_score_gemma":0.0007878649,"teacher_disagreement_score":0.009099713,"about_ca_system_score_codex":0.0013289086,"about_ca_system_score_gemma":0.0004794592,"threshold_uncertainty_score":0.030441582},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64819694,0.001665009,0.12656698,0.0025633087,0.0012656593,0.00016620618,0.00082320854,0.0005733512,0.21817939],"genre_scores_gemma":[0.93717945,0.00063490326,0.011106176,0.0003267021,0.00057641737,0.00007710254,0.0006851775,0.00017797957,0.049236193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947625,0.00008294375,0.00002140137,0.00006499573,0.00019792459,0.00015648971],"domain_scores_gemma":[0.999416,0.00010425176,0.000066049724,0.00007334287,0.00012154083,0.0002189509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000606747,0.00064277,0.0009132757,0.0026976666,0.0021707069,0.0034259409,0.0015425509,0.000780111,0.012850245],"category_scores_gemma":[0.0014322358,0.00047420425,0.00053516217,0.0014930385,0.0019959821,0.0030848915,0.002251317,0.002724984,0.0017051965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041176638,0.000021407679,0.00009764909,0.000020731532,0.0000058422283,0.000055092918,0.00012506003,0.000423706,0.0010292894,0.99235016,0.0013332457,0.0044966047],"study_design_scores_gemma":[0.00002046395,0.000014068088,0.00016800944,0.00000965613,0.000007111833,0.000051607298,0.000098536206,0.0033366347,0.00060867704,0.99184215,0.0038316415,0.000011548952],"about_ca_topic_score_codex":0.0013144228,"about_ca_topic_score_gemma":0.001785252,"teacher_disagreement_score":0.012850245,"about_ca_system_score_codex":0.0015139962,"about_ca_system_score_gemma":0.0005927834,"threshold_uncertainty_score":0.04298836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33604038,0.003156447,0.3303786,0.006151035,0.0007191487,0.00030058465,0.001557814,0.0015029189,0.3201931],"genre_scores_gemma":[0.8126265,0.0021761064,0.103212155,0.0016885317,0.00068978907,0.00033714465,0.0021784613,0.00072246057,0.07636885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966989,0.00080658065,0.00025908425,0.0006191831,0.0009665316,0.0006496125],"domain_scores_gemma":[0.9933078,0.0040863743,0.0006184441,0.00083647325,0.0004916702,0.00065915455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019338496,0.0010842124,0.0018937043,0.004581317,0.008790053,0.010550285,0.0029045066,0.0034297425,0.020212164],"category_scores_gemma":[0.010585201,0.0017224099,0.0021486008,0.005463543,0.004524122,0.012769493,0.00574999,0.005635476,0.0026582668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029519997,0.000049719627,0.00014459724,0.000043528402,0.000012463677,0.00007845034,0.00048543958,0.0010593646,0.00032165038,0.9912157,0.0016992666,0.0048602344],"study_design_scores_gemma":[0.000011246206,0.0000058760893,0.0000918735,0.000016005253,0.000019339137,0.00007932486,0.00021916693,0.0020083282,0.0003323288,0.9931225,0.004077496,0.000016437269],"about_ca_topic_score_codex":0.0029270046,"about_ca_topic_score_gemma":0.0038000743,"teacher_disagreement_score":0.020212164,"about_ca_system_score_codex":0.0022562654,"about_ca_system_score_gemma":0.0016566316,"threshold_uncertainty_score":0.06761646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7732889,0.0025262274,0.11403655,0.004333775,0.00026727014,0.000059690876,0.0004508906,0.00025920375,0.104777604],"genre_scores_gemma":[0.97469795,0.0007269796,0.00729638,0.00018777115,0.0003081825,0.00006649029,0.0003432695,0.00007983402,0.0162932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981128,0.0005072427,0.00013677416,0.00051471003,0.0004881288,0.00024030518],"domain_scores_gemma":[0.99041593,0.0055594794,0.00085227983,0.0012019707,0.00080252945,0.0011677602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022804195,0.0009515954,0.001565742,0.0038831371,0.0035805902,0.0057075606,0.0020213614,0.001623552,0.0068080835],"category_scores_gemma":[0.009027643,0.0011103225,0.0014293833,0.0023271965,0.008556858,0.012776888,0.006740244,0.0053705075,0.00049632846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057092253,0.00001835519,0.0004213665,0.00004215126,0.00001647396,0.00009463154,0.00047175938,0.0005006097,0.00056112325,0.995533,0.00027854345,0.0020048597],"study_design_scores_gemma":[0.000011802986,0.0000112906,0.00020071401,0.0000073910383,0.0000055034907,0.00009377154,0.00008654794,0.0010083641,0.00018410018,0.99744415,0.0009389409,0.0000073916663],"about_ca_topic_score_codex":0.0007418607,"about_ca_topic_score_gemma":0.0006362458,"teacher_disagreement_score":0.0068080835,"about_ca_system_score_codex":0.0023918017,"about_ca_system_score_gemma":0.00066864974,"threshold_uncertainty_score":0.022775292},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2041208,0.014962373,0.45103344,0.0265358,0.004340289,0.00079830963,0.0122543685,0.013633665,0.27232093],"genre_scores_gemma":[0.7017838,0.0067741815,0.20502439,0.005652887,0.0048864894,0.000987947,0.0076402524,0.0030605404,0.064189486],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99122953,0.0014516542,0.00033117097,0.001798283,0.0029940829,0.0021953257],"domain_scores_gemma":[0.96508425,0.024567833,0.00103666,0.0054764585,0.001950724,0.0018840593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004852087,0.003723394,0.0039012511,0.003821596,0.003057924,0.010292075,0.010537729,0.004473877,0.047898155],"category_scores_gemma":[0.02954782,0.0022212297,0.0031579847,0.0065699304,0.0038815902,0.022720546,0.009821653,0.009096054,0.011531301],"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.0075589195,0.0020111667,0.0072525064,0.004496317,0.00060743245,0.00094496313,0.0009650079,0.19759463,0.042826023,0.28151646,0.15247433,0.30175218],"study_design_scores_gemma":[0.00067486963,0.00050610775,0.0027009272,0.00031031494,0.00053143315,0.00056705537,0.00028340507,0.5064681,0.015361563,0.44324553,0.029137954,0.00021266947],"about_ca_topic_score_codex":0.0061429194,"about_ca_topic_score_gemma":0.011070041,"teacher_disagreement_score":0.047898155,"about_ca_system_score_codex":0.0084687555,"about_ca_system_score_gemma":0.005795266,"threshold_uncertainty_score":0.16023523},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71619827,0.004987273,0.16546704,0.009822017,0.00048933696,0.00011470819,0.0021367753,0.0013652192,0.09941942],"genre_scores_gemma":[0.96135503,0.00276248,0.018014044,0.00093779276,0.0011041551,0.00026097693,0.0013913161,0.00082845165,0.013345627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99546367,0.0017645938,0.00017324986,0.00087357097,0.0011855512,0.0005394388],"domain_scores_gemma":[0.92322665,0.061695497,0.0037644817,0.0044666296,0.003446437,0.0034003176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005179642,0.0009922888,0.0025815782,0.0050180345,0.002580266,0.0072990456,0.0047806143,0.0030849737,0.01949605],"category_scores_gemma":[0.07564776,0.001554914,0.0011442963,0.003694048,0.0053679636,0.011503442,0.005170019,0.0044419225,0.002245454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094185275,0.00020944368,0.012776727,0.0005507838,0.00015309044,0.00033095834,0.00096032204,0.03687952,0.0068718395,0.89217037,0.013520192,0.034634896],"study_design_scores_gemma":[0.0001076981,0.00010201028,0.0048719877,0.00016207986,0.00012227605,0.0012378591,0.00041252252,0.17142183,0.0028774226,0.8128333,0.005784106,0.0000668964],"about_ca_topic_score_codex":0.0011276895,"about_ca_topic_score_gemma":0.0010570191,"teacher_disagreement_score":0.01949605,"about_ca_system_score_codex":0.0030406641,"about_ca_system_score_gemma":0.00095754885,"threshold_uncertainty_score":0.06522077},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18977071,0.010505584,0.47471118,0.025919132,0.0057431012,0.00011630916,0.0010099667,0.00079150364,0.2914325],"genre_scores_gemma":[0.8209679,0.012672567,0.095490575,0.004192102,0.0066381427,0.0001574935,0.00084131653,0.0010898716,0.05795005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989642,0.00037262525,0.000047774833,0.00024095901,0.00022617748,0.00014832006],"domain_scores_gemma":[0.99466175,0.0031005533,0.000419387,0.00082533865,0.0003136294,0.00067930884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013823148,0.00084909395,0.0010142849,0.0014713599,0.0017781816,0.0034523834,0.0016131826,0.0016936653,0.007396118],"category_scores_gemma":[0.007963694,0.0007546612,0.001247018,0.002099926,0.0047882134,0.0072005205,0.0026812458,0.004866904,0.001356896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016407846,0.000007258586,0.00022034862,0.000019316878,0.0000030494998,0.0000650474,0.000112804286,0.00096534437,0.0003250491,0.9915104,0.0022903173,0.0044648056],"study_design_scores_gemma":[0.000004423536,0.000006567496,0.00019095905,0.000010993138,0.000004858179,0.000070819195,0.000056161407,0.0024464705,0.0001729969,0.98899114,0.0080320705,0.0000124977305],"about_ca_topic_score_codex":0.0030088054,"about_ca_topic_score_gemma":0.0033662254,"teacher_disagreement_score":0.007396118,"about_ca_system_score_codex":0.0015385147,"about_ca_system_score_gemma":0.00065682776,"threshold_uncertainty_score":0.024742544},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28390846,0.0060212263,0.15021506,0.03750741,0.0034792926,0.00008357874,0.0013436119,0.00087787636,0.5165635],"genre_scores_gemma":[0.92960536,0.002796126,0.019908505,0.0034713726,0.0021001936,0.00008172798,0.0011241917,0.00027134948,0.040641107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984352,0.0003682702,0.00007375638,0.00036471672,0.0004928259,0.00026509853],"domain_scores_gemma":[0.9954987,0.0024706603,0.00033934263,0.00074925413,0.0005025582,0.00043950562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015395135,0.00070310384,0.002088628,0.001786312,0.004062458,0.00514133,0.0020720293,0.0040310114,0.020835582],"category_scores_gemma":[0.010075646,0.00078034325,0.0011344446,0.0021856523,0.0063851466,0.013907093,0.005581378,0.0077095916,0.00262091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071194045,0.000020435695,0.00019322782,0.000062132975,0.000009733786,0.000073613664,0.00016535014,0.0012961819,0.00014492411,0.98854,0.005259108,0.0041641113],"study_design_scores_gemma":[0.000008275722,0.0000033892018,0.000057107325,0.000010082358,0.0000025378115,0.000032316795,0.000057550173,0.0011930736,0.000043102144,0.99670225,0.0018851253,0.000005082843],"about_ca_topic_score_codex":0.0027227288,"about_ca_topic_score_gemma":0.0022482236,"teacher_disagreement_score":0.020835582,"about_ca_system_score_codex":0.0015642234,"about_ca_system_score_gemma":0.00093983364,"threshold_uncertainty_score":0.06970197},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12833421,0.0008177399,0.7016626,0.0007095994,0.00020205633,0.00042096013,0.008121663,0.0025350961,0.15719607],"genre_scores_gemma":[0.5884139,0.0012784963,0.25932845,0.00048661084,0.00013271545,0.00048457965,0.02411355,0.0018147347,0.12394693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996964,0.000053855245,0.00001830551,0.00007244279,0.00008742962,0.00007153335],"domain_scores_gemma":[0.9989278,0.000295504,0.000076813245,0.00022465906,0.00033693554,0.00013830776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028166725,0.000454747,0.00027695208,0.0012367395,0.00050032564,0.0012945574,0.00069172314,0.0003507036,0.02182305],"category_scores_gemma":[0.0014487113,0.00026255453,0.0004691191,0.0010136531,0.0004183747,0.0015846654,0.0009155898,0.00067080936,0.0058807926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002981355,0.0001596609,0.0014524494,0.00053794315,0.000040988984,0.00045038873,0.00087164337,0.014019824,0.01836351,0.78482896,0.041845463,0.13713099],"study_design_scores_gemma":[0.00004625206,0.000049851453,0.002114568,0.00014579119,0.000054306336,0.0004220238,0.00036418161,0.036422625,0.008963781,0.83243644,0.11895583,0.000024230312],"about_ca_topic_score_codex":0.0026581136,"about_ca_topic_score_gemma":0.0035306853,"teacher_disagreement_score":0.02182305,"about_ca_system_score_codex":0.0006873715,"about_ca_system_score_gemma":0.00046814285,"threshold_uncertainty_score":0.07300538},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7326434,0.004465487,0.1123961,0.006182958,0.0005660449,0.00008622724,0.00036397422,0.00015110192,0.14314474],"genre_scores_gemma":[0.97855604,0.0010751102,0.009335994,0.00024639867,0.0005465686,0.00003145066,0.00014360661,0.00002515285,0.010039682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937314,0.00016558912,0.00004600683,0.00011488657,0.00019126546,0.00010921471],"domain_scores_gemma":[0.99846435,0.0006479696,0.00032851566,0.0001900206,0.00014596894,0.0002232887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008987157,0.000544412,0.00074678793,0.0019001295,0.0023989643,0.0040722415,0.00080044696,0.0012574543,0.0044476283],"category_scores_gemma":[0.0035859207,0.00043730627,0.0007634014,0.0014772563,0.0051814057,0.007163654,0.0017930954,0.0017093648,0.00044361773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014539077,0.000010029672,0.00012292672,0.000012821273,0.0000022499705,0.00004395021,0.00015467804,0.0004429667,0.00021796735,0.99699616,0.0004138633,0.0015678375],"study_design_scores_gemma":[0.0000062234685,0.0000068811682,0.00006418492,0.000004158292,0.0000019969518,0.000056587596,0.000064056985,0.0010008825,0.00005186192,0.9980198,0.00071951805,0.0000037238874],"about_ca_topic_score_codex":0.0013419566,"about_ca_topic_score_gemma":0.0014627242,"teacher_disagreement_score":0.0044476283,"about_ca_system_score_codex":0.0012800217,"about_ca_system_score_gemma":0.00082256075,"threshold_uncertainty_score":0.014878809},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45289946,0.003617724,0.3350046,0.049449455,0.0010517465,0.00026210918,0.002003561,0.0015860669,0.15412538],"genre_scores_gemma":[0.9201861,0.0017433582,0.047861382,0.0036050072,0.0013526495,0.00051819556,0.0011605287,0.00045803093,0.023114793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646145,0.001050532,0.0001443536,0.0008498632,0.000841087,0.0006526884],"domain_scores_gemma":[0.97642446,0.018799204,0.00080319354,0.0016134826,0.00067891134,0.0016807031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032573396,0.0012817584,0.0031798466,0.002548046,0.003426527,0.008133502,0.0046406346,0.0058812606,0.022123067],"category_scores_gemma":[0.021694317,0.0014264134,0.0019439593,0.0030765075,0.005419374,0.018986477,0.0072645075,0.011036713,0.0021956833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028803528,0.00014076475,0.00033448098,0.00021401067,0.000028734099,0.0000699871,0.0002538305,0.004174164,0.0011441142,0.96973825,0.008871938,0.014741775],"study_design_scores_gemma":[0.00005237043,0.000027808315,0.00012056744,0.000020604008,0.000015008802,0.000070597576,0.00005241655,0.01108717,0.00022230587,0.9871221,0.0011986454,0.000010481891],"about_ca_topic_score_codex":0.00066974515,"about_ca_topic_score_gemma":0.0005568537,"teacher_disagreement_score":0.022123067,"about_ca_system_score_codex":0.003952605,"about_ca_system_score_gemma":0.0014967197,"threshold_uncertainty_score":0.07400906},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24287613,0.031307295,0.59129226,0.012669821,0.001473653,0.00025744262,0.0032243321,0.003817396,0.113081716],"genre_scores_gemma":[0.8147514,0.012436987,0.14830504,0.0025296542,0.0029396096,0.0006038579,0.0020556913,0.002391808,0.013985975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99507,0.0014032191,0.00020073817,0.00140091,0.0010370003,0.0008882597],"domain_scores_gemma":[0.94026613,0.046674903,0.00207397,0.0052366783,0.0023510954,0.003397279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004965978,0.0036883557,0.005056989,0.0065021906,0.0034199401,0.007004054,0.008924706,0.0054516895,0.011130675],"category_scores_gemma":[0.042001016,0.0023484787,0.0026799594,0.0047787474,0.0052584,0.013029612,0.006609341,0.0071961517,0.0037240486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017191161,0.0003827674,0.0034090905,0.0021342475,0.0004494355,0.0005327735,0.0014183569,0.11579267,0.035320494,0.7383924,0.036140732,0.06430795],"study_design_scores_gemma":[0.0001241691,0.00028351488,0.002770475,0.00045743806,0.00041379168,0.0011526914,0.000379404,0.29798102,0.010218994,0.6665935,0.019420626,0.00020433619],"about_ca_topic_score_codex":0.0013462488,"about_ca_topic_score_gemma":0.0013360757,"teacher_disagreement_score":0.011130675,"about_ca_system_score_codex":0.0038648979,"about_ca_system_score_gemma":0.0011170949,"threshold_uncertainty_score":0.037235796},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22657946,0.014842194,0.16264354,0.03203017,0.0028135078,0.000069394504,0.0007786983,0.00042379068,0.5598193],"genre_scores_gemma":[0.89858854,0.0058496636,0.021628695,0.002668754,0.002351018,0.00008566838,0.0005023751,0.00021056991,0.06811472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986865,0.00041266688,0.000059294704,0.00023981102,0.00037810035,0.00022366515],"domain_scores_gemma":[0.9975915,0.001135983,0.00030548105,0.00037773748,0.0002976508,0.00029161217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001024522,0.000867537,0.0016852515,0.0025809682,0.0024651976,0.004859956,0.0017535682,0.003209203,0.015830623],"category_scores_gemma":[0.0063391104,0.00070387655,0.0011352347,0.0037360783,0.004264892,0.0073057064,0.004718658,0.005294145,0.00208164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008927204,0.000004216454,0.000071560025,0.000015303664,0.000003936589,0.000031545515,0.000082661354,0.00059169985,0.00008009811,0.9936179,0.0025483049,0.0029437968],"study_design_scores_gemma":[0.000006543156,0.0000056258004,0.00019247449,0.000018602992,0.000006155848,0.00013996409,0.00012572184,0.0037768853,0.00011686634,0.9874772,0.0081276735,0.000006231382],"about_ca_topic_score_codex":0.0026230772,"about_ca_topic_score_gemma":0.0017893022,"teacher_disagreement_score":0.015830623,"about_ca_system_score_codex":0.0018230833,"about_ca_system_score_gemma":0.0006288044,"threshold_uncertainty_score":0.052958727},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4637476,0.00069887115,0.33083296,0.0016213809,0.00045523213,0.00015304245,0.00038966822,0.00074509194,0.2013562],"genre_scores_gemma":[0.925975,0.0004182021,0.045434434,0.00030475698,0.00021134534,0.000090826405,0.00018977243,0.0002477659,0.027127689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863476,0.0003974486,0.00007471842,0.0002680157,0.00039156355,0.00023350699],"domain_scores_gemma":[0.9984487,0.0005219396,0.00020093322,0.00038024245,0.00020705842,0.00024106285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001334134,0.00058845285,0.0008387559,0.0022642983,0.0017653509,0.0035318867,0.0012534956,0.0014694773,0.012667066],"category_scores_gemma":[0.003982476,0.00052796886,0.00085602014,0.0013840748,0.0032664216,0.005951422,0.0036447414,0.00290873,0.0018148654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028060738,0.0000060751267,0.000080990874,0.000008194795,0.000002636046,0.000033564454,0.00009657482,0.00047843604,0.00047686129,0.99509406,0.0003350861,0.0033595841],"study_design_scores_gemma":[0.000016370186,0.000019741678,0.000090983,0.0000087026765,0.0000067294627,0.00014123974,0.000075038966,0.0056147752,0.0007817179,0.9907376,0.002492674,0.00001435802],"about_ca_topic_score_codex":0.0006132702,"about_ca_topic_score_gemma":0.0005084366,"teacher_disagreement_score":0.012667066,"about_ca_system_score_codex":0.001375773,"about_ca_system_score_gemma":0.00044726126,"threshold_uncertainty_score":0.042375565},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84417236,0.0006274872,0.09125254,0.0011463859,0.00028542322,0.00015007691,0.0008869772,0.00049310783,0.060985755],"genre_scores_gemma":[0.9239477,0.0007372009,0.051088337,0.0005371146,0.00022762436,0.00023111173,0.0017676774,0.00037280956,0.02109035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992205,0.00019651651,0.000037268263,0.00014501651,0.00015608114,0.00024467116],"domain_scores_gemma":[0.9961041,0.0018300794,0.00063857104,0.00046500826,0.00038006582,0.00058209297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051408337,0.0006658923,0.0006176473,0.0015492995,0.0017966965,0.0025705146,0.0015615566,0.0011392073,0.009705337],"category_scores_gemma":[0.003025038,0.0011235554,0.0009419691,0.001960689,0.001515191,0.0016954674,0.0014940341,0.0019203548,0.0009528756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006604533,0.00021242065,0.0037876398,0.00023244297,0.000075523305,0.0008599878,0.0013074221,0.018652244,0.014606136,0.9097792,0.0133011,0.0365254],"study_design_scores_gemma":[0.00017311705,0.00011646929,0.0030720192,0.00007038812,0.00009041152,0.0005905459,0.00071229215,0.043272126,0.0056425487,0.93096125,0.015239444,0.000059516533],"about_ca_topic_score_codex":0.0046301554,"about_ca_topic_score_gemma":0.006275898,"teacher_disagreement_score":0.009705337,"about_ca_system_score_codex":0.0014577648,"about_ca_system_score_gemma":0.0010669769,"threshold_uncertainty_score":0.032467604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67754704,0.00089127664,0.122568384,0.002694073,0.0002339747,0.0000871803,0.0006515212,0.00043557864,0.194891],"genre_scores_gemma":[0.96111625,0.00040394632,0.017580505,0.00022063682,0.00013423343,0.00016530766,0.0005592326,0.00015162412,0.019668171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99717915,0.0007642917,0.00016937433,0.0006644047,0.0007343616,0.0004883349],"domain_scores_gemma":[0.99113524,0.005431159,0.0009340562,0.0008905205,0.0006080866,0.0010008363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014335588,0.00066634506,0.0013209967,0.0036055413,0.0065519037,0.0069920653,0.002999053,0.0021266656,0.012685824],"category_scores_gemma":[0.00898852,0.0015425186,0.0013257855,0.0043766876,0.0061945366,0.009801308,0.006009862,0.0057543833,0.0012576232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041454477,0.000033034885,0.0004495275,0.00002249868,0.000008969675,0.00013669084,0.00043753162,0.0007129981,0.00029151698,0.9944547,0.00059431023,0.002816757],"study_design_scores_gemma":[0.000007576918,0.0000043536234,0.00011374188,0.00000869448,0.000009626381,0.00020676308,0.00018499178,0.0014560639,0.0002614124,0.99641055,0.0013276245,0.000008518747],"about_ca_topic_score_codex":0.001143887,"about_ca_topic_score_gemma":0.0011859557,"teacher_disagreement_score":0.012685824,"about_ca_system_score_codex":0.0017254682,"about_ca_system_score_gemma":0.0010756827,"threshold_uncertainty_score":0.04243833},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7227351,0.0007962552,0.24692722,0.004244338,0.00012182243,0.00014837453,0.0015525039,0.0015929024,0.021881457],"genre_scores_gemma":[0.9459418,0.00037019874,0.04562789,0.00037129677,0.0002220305,0.00019499668,0.0011502967,0.0004983348,0.005623096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663913,0.00097575795,0.00017584988,0.0009460853,0.000666925,0.0005962601],"domain_scores_gemma":[0.96656245,0.026431255,0.0014355408,0.0033635704,0.0007919225,0.001415285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003645637,0.0015256143,0.0019691994,0.001851841,0.0017166351,0.009336208,0.0056874733,0.0024182033,0.013888397],"category_scores_gemma":[0.031200845,0.0012651363,0.0022935965,0.0030892764,0.0037424183,0.019227603,0.004855042,0.0053274883,0.0012047901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019052372,0.00050415535,0.0097098,0.0006985247,0.00022697334,0.00024882806,0.0020224187,0.054682896,0.009072023,0.8337575,0.0074908854,0.07968073],"study_design_scores_gemma":[0.00013678672,0.000056024568,0.0007693655,0.000045106266,0.00009070283,0.00011791156,0.00021532504,0.08914429,0.00295996,0.90534157,0.001096327,0.000026554186],"about_ca_topic_score_codex":0.0017558694,"about_ca_topic_score_gemma":0.0026975807,"teacher_disagreement_score":0.013888397,"about_ca_system_score_codex":0.003176775,"about_ca_system_score_gemma":0.001973343,"threshold_uncertainty_score":0.046461284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68757015,0.0036301173,0.135931,0.0027540848,0.000708722,0.00006489835,0.00036288745,0.00046917386,0.16850898],"genre_scores_gemma":[0.9669954,0.0010269014,0.011064131,0.00030844938,0.00023178391,0.000054054613,0.00017792787,0.0000730461,0.020068139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999416,0.00018322736,0.000036817397,0.000084374136,0.0001593236,0.0001203093],"domain_scores_gemma":[0.99852896,0.0007066864,0.00021508426,0.00014221993,0.00015056672,0.00025644107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010002776,0.00042158572,0.0007112395,0.0027831078,0.0026646827,0.0032239873,0.0006843158,0.0013495372,0.009730469],"category_scores_gemma":[0.0031664516,0.00035804918,0.00053283054,0.0015337734,0.0021787093,0.0051736697,0.0018067997,0.0016682032,0.0011055372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002534714,0.000015089522,0.00015903421,0.000016939157,0.0000021339658,0.000050983756,0.00017758596,0.00033825918,0.00024421886,0.99502015,0.00045105783,0.0034991833],"study_design_scores_gemma":[0.0000065891386,0.00000689744,0.00007532374,0.0000085084985,0.0000023897574,0.00006757774,0.0000645805,0.0009779998,0.00014846849,0.99748564,0.0011513481,0.000004754976],"about_ca_topic_score_codex":0.0005226329,"about_ca_topic_score_gemma":0.0006314453,"teacher_disagreement_score":0.009730469,"about_ca_system_score_codex":0.0009599096,"about_ca_system_score_gemma":0.00045856877,"threshold_uncertainty_score":0.032551646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35619962,0.0055128927,0.33003548,0.011407173,0.0012015277,0.00014997383,0.0012369097,0.0007893462,0.29346707],"genre_scores_gemma":[0.9154422,0.0031962825,0.037596423,0.0021651152,0.0012159671,0.0002577592,0.00063778803,0.00027112974,0.039217446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986909,0.00028671327,0.00010069421,0.00040451877,0.0003096924,0.00020755945],"domain_scores_gemma":[0.99693763,0.0017155678,0.00029724167,0.0004214905,0.00030627058,0.00032182486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019087464,0.00092194165,0.0017490167,0.0028632747,0.0027619635,0.0034780456,0.0016598982,0.0018352834,0.008436639],"category_scores_gemma":[0.0045853113,0.00067432574,0.0017014245,0.0019939162,0.004914487,0.011098182,0.0050406675,0.0045490214,0.0013268631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028052182,0.000014625129,0.0001521744,0.000044774068,0.000009747473,0.00004299245,0.00020554982,0.00038437318,0.00044110083,0.99405473,0.0011946158,0.0034273174],"study_design_scores_gemma":[0.000014543702,0.000009490828,0.00014254195,0.000011027637,0.000012648012,0.00007108203,0.000046613804,0.0011973629,0.00021347207,0.9937605,0.0045101643,0.000010526048],"about_ca_topic_score_codex":0.0007794165,"about_ca_topic_score_gemma":0.00054498675,"teacher_disagreement_score":0.008436639,"about_ca_system_score_codex":0.0015174457,"about_ca_system_score_gemma":0.000700852,"threshold_uncertainty_score":0.028223395},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62367064,0.0014098107,0.2048099,0.0030650063,0.0006161865,0.000105171806,0.0007823849,0.0010236617,0.16451725],"genre_scores_gemma":[0.9309964,0.00081052183,0.020486608,0.0007142162,0.0004550706,0.00011859526,0.00070677744,0.00046290417,0.045248903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868363,0.00036638897,0.00007464814,0.0003483491,0.00028848133,0.00023856557],"domain_scores_gemma":[0.99699724,0.0011863617,0.00039119204,0.00038154563,0.00049136893,0.0005524268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007191971,0.00091500586,0.00058541633,0.0022151722,0.0015085255,0.0043529975,0.001374072,0.0013987515,0.011611467],"category_scores_gemma":[0.0047003324,0.000617188,0.0006265715,0.0013520289,0.002732171,0.006467187,0.003745061,0.0023683726,0.0016470733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005290495,0.00003103106,0.00025709282,0.000039849307,0.000005811517,0.00006863145,0.0003025223,0.0006079502,0.0008029341,0.9913326,0.0011824026,0.005316214],"study_design_scores_gemma":[0.000014311537,0.000015628317,0.00019383657,0.000017148477,0.000007838098,0.00008314599,0.00016596648,0.004336795,0.00057997706,0.99152863,0.0030468702,0.000009884764],"about_ca_topic_score_codex":0.0009456803,"about_ca_topic_score_gemma":0.0011282734,"teacher_disagreement_score":0.011611467,"about_ca_system_score_codex":0.0014621217,"about_ca_system_score_gemma":0.0004286054,"threshold_uncertainty_score":0.038844228},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88372004,0.0016306513,0.0645752,0.0028145988,0.0003173396,0.00014474653,0.0009778087,0.00030418893,0.045515597],"genre_scores_gemma":[0.94977903,0.00090066023,0.03877913,0.0004196892,0.00024278491,0.00015528189,0.0012399548,0.0003040884,0.008179365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991178,0.00024422037,0.00004539813,0.0002188889,0.0001651723,0.0002085122],"domain_scores_gemma":[0.989778,0.0067699184,0.0009901535,0.0004727456,0.00061105605,0.0013780912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011703824,0.0013518397,0.0016327819,0.0026687079,0.002240708,0.0030974727,0.0030820845,0.0027051072,0.014180203],"category_scores_gemma":[0.010520952,0.0010915472,0.00082185713,0.0015169322,0.002407592,0.004667849,0.0018284232,0.00223358,0.0010201848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030591039,0.00044638797,0.009388336,0.0020558606,0.00022518223,0.0012411355,0.0018254197,0.061922166,0.035395555,0.7982724,0.022911487,0.06325699],"study_design_scores_gemma":[0.00031477603,0.00017325078,0.0029983523,0.00021133224,0.00010981635,0.0006513466,0.00083055155,0.06477255,0.0054561575,0.91953075,0.0049005956,0.000050470324],"about_ca_topic_score_codex":0.0010313679,"about_ca_topic_score_gemma":0.0018099551,"teacher_disagreement_score":0.014180203,"about_ca_system_score_codex":0.0015338236,"about_ca_system_score_gemma":0.0007699978,"threshold_uncertainty_score":0.04743755},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8314861,0.0007522348,0.13981998,0.0005939668,0.00012691687,0.00009722872,0.00066346454,0.0003216184,0.026138598],"genre_scores_gemma":[0.9686013,0.00043602166,0.020245032,0.00013889238,0.00009580472,0.00008886892,0.0007398067,0.00010481338,0.0095494855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874485,0.00034300218,0.000086885055,0.00034565103,0.0001909896,0.0002885312],"domain_scores_gemma":[0.9933785,0.0035796391,0.00082634384,0.000818913,0.00036694898,0.0010296099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010146995,0.000605166,0.0007585157,0.0024568862,0.002378203,0.0050695376,0.0012804295,0.0012251618,0.005105585],"category_scores_gemma":[0.005150345,0.00096578297,0.0010152193,0.0019906093,0.0031182026,0.0055318456,0.0022314142,0.001871784,0.0005445962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024890376,0.000100116835,0.0022493957,0.00010146143,0.00003912683,0.00020822189,0.0019592096,0.0049599535,0.0036768315,0.9682332,0.0013399918,0.016883587],"study_design_scores_gemma":[0.000031107524,0.00003444849,0.0010417928,0.000027005248,0.000036297173,0.0001783433,0.0004172796,0.008122924,0.0010528432,0.9866173,0.0024190133,0.000021705908],"about_ca_topic_score_codex":0.0019854372,"about_ca_topic_score_gemma":0.0030190903,"teacher_disagreement_score":0.005105585,"about_ca_system_score_codex":0.0017566176,"about_ca_system_score_gemma":0.0007897313,"threshold_uncertainty_score":0.01707989},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6526202,0.001772714,0.20759052,0.0023402157,0.00026771126,0.000090470385,0.00051944616,0.00024258325,0.13455616],"genre_scores_gemma":[0.9591248,0.0009890124,0.023472458,0.00029014892,0.00017044845,0.00008563578,0.0003415117,0.00008228054,0.0154436575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940383,0.00015114684,0.000027497732,0.00014696532,0.00013086497,0.00013976252],"domain_scores_gemma":[0.9953034,0.0028822129,0.00045399804,0.00047270767,0.00044173872,0.00044605692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073179026,0.0005109347,0.00063342147,0.0017128052,0.0014523158,0.0023805492,0.001149439,0.0013534216,0.010867121],"category_scores_gemma":[0.0061414526,0.0006741153,0.00049052696,0.0011450028,0.002107272,0.005108538,0.0029666966,0.002387299,0.0007777761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009436901,0.000030067602,0.00044379375,0.00008037872,0.000012831914,0.00009989813,0.0002143279,0.0059913476,0.001400167,0.9818649,0.00136999,0.008397865],"study_design_scores_gemma":[0.000017990766,0.000019216934,0.00016281297,0.000023814191,0.000007881229,0.000078477,0.00009614277,0.015777728,0.0005493337,0.9807982,0.0024589617,0.000009443893],"about_ca_topic_score_codex":0.0005962396,"about_ca_topic_score_gemma":0.00075872213,"teacher_disagreement_score":0.010867121,"about_ca_system_score_codex":0.00080998667,"about_ca_system_score_gemma":0.00064874074,"threshold_uncertainty_score":0.036354125},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76419824,0.004436542,0.1594469,0.0035622155,0.00026216515,0.00006665517,0.00043280402,0.0006063686,0.0669881],"genre_scores_gemma":[0.9803304,0.0009737857,0.011974972,0.00022029511,0.00029817497,0.000052949847,0.00018768753,0.00010247079,0.0058592902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843305,0.0005992906,0.000077622884,0.0003305818,0.00030545893,0.00025406847],"domain_scores_gemma":[0.99304223,0.0041398993,0.0012248694,0.00040959488,0.00039290372,0.0007905455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015840085,0.00077379,0.0017068994,0.005338815,0.0024124747,0.004530124,0.002226122,0.002569879,0.008597947],"category_scores_gemma":[0.012347597,0.00084809976,0.00070775195,0.0031780954,0.0044398354,0.00701911,0.0029558884,0.0017223532,0.0011110323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013028832,0.00002903803,0.0005509063,0.00007648758,0.000012562662,0.000063430154,0.00037764641,0.0038518056,0.001141199,0.98658586,0.0011578886,0.0060229655],"study_design_scores_gemma":[0.000022812957,0.000016907925,0.0004030947,0.000030185272,0.000020597136,0.00018800741,0.0002327472,0.01982175,0.00060283503,0.9766758,0.0019693465,0.00001589627],"about_ca_topic_score_codex":0.0012342352,"about_ca_topic_score_gemma":0.00082065706,"teacher_disagreement_score":0.008597947,"about_ca_system_score_codex":0.0018768606,"about_ca_system_score_gemma":0.0004705431,"threshold_uncertainty_score":0.028762996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91568816,0.0017321022,0.05773733,0.002018559,0.000110302106,0.000075284304,0.0003474514,0.00039891913,0.021891983],"genre_scores_gemma":[0.9765054,0.0010589522,0.014505938,0.0002924816,0.00015895748,0.00017543751,0.0002912966,0.0001945288,0.0068169106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918,0.00026095595,0.000036857462,0.0001958909,0.00016393448,0.00016243922],"domain_scores_gemma":[0.98913527,0.0073476913,0.0012233511,0.00062068144,0.0005414841,0.0011315647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008491004,0.00080349925,0.0011361988,0.0038212256,0.002370495,0.0036814304,0.0021660784,0.0022248905,0.0045680846],"category_scores_gemma":[0.011317263,0.0014981799,0.0009308521,0.0026788013,0.004065094,0.0056943703,0.003158585,0.0019314997,0.00044337628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021568264,0.0000696253,0.0019389818,0.00019184235,0.000036519392,0.00030962008,0.0011105302,0.013976316,0.0032041706,0.9665374,0.0023552442,0.010054169],"study_design_scores_gemma":[0.000036813428,0.000024418108,0.0004510332,0.000041238443,0.000029323479,0.0001769728,0.00022550789,0.018624866,0.0007807832,0.97831774,0.0012730033,0.000018385092],"about_ca_topic_score_codex":0.0016786963,"about_ca_topic_score_gemma":0.002231787,"teacher_disagreement_score":0.0045680846,"about_ca_system_score_codex":0.0015251915,"about_ca_system_score_gemma":0.0008657908,"threshold_uncertainty_score":0.015281737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95377904,0.00048637923,0.033268716,0.001101347,0.00005205385,0.00012470313,0.0033307588,0.0005108797,0.0073460885],"genre_scores_gemma":[0.9797798,0.000226267,0.016260622,0.000112524955,0.00004969156,0.00015477126,0.0017348386,0.00011430634,0.0015673065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988612,0.00027256724,0.00007345974,0.00025340845,0.0002978899,0.00024146275],"domain_scores_gemma":[0.98210585,0.0128112165,0.0016862397,0.0012055287,0.0010411636,0.0011500131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081491395,0.0008060126,0.0018043675,0.0010424654,0.0012158632,0.0025479307,0.002771481,0.0022288796,0.004923907],"category_scores_gemma":[0.014589254,0.0009810013,0.0008958986,0.0011610255,0.001098492,0.0030018704,0.0016233681,0.0010981649,0.00045516077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010488026,0.0010154452,0.03078809,0.0037238086,0.00067252823,0.0015217442,0.0031317165,0.2907438,0.16599526,0.33671936,0.027658435,0.1275418],"study_design_scores_gemma":[0.0009851032,0.00088707457,0.011741383,0.00030506004,0.00037419444,0.0016288575,0.0013845684,0.3790289,0.049009275,0.5485711,0.0059470884,0.0001375145],"about_ca_topic_score_codex":0.0008474571,"about_ca_topic_score_gemma":0.0012179468,"teacher_disagreement_score":0.004923907,"about_ca_system_score_codex":0.0012531077,"about_ca_system_score_gemma":0.001218184,"threshold_uncertainty_score":0.016472101},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31972593,0.0006759751,0.42588872,0.002596688,0.0009962782,0.00013384596,0.0005003994,0.0013438141,0.24813843],"genre_scores_gemma":[0.88030076,0.00063603197,0.078794375,0.00087391696,0.00029928208,0.00016152542,0.000570874,0.0007560821,0.03760713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992473,0.00017308767,0.00004078102,0.00009948428,0.0002481254,0.00019125541],"domain_scores_gemma":[0.99928826,0.00029896403,0.00005524796,0.00009604086,0.00011675376,0.0001447464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072464964,0.0008205336,0.00082782074,0.0020514305,0.0020754654,0.0035840094,0.0013746846,0.0011405727,0.013379115],"category_scores_gemma":[0.0018332386,0.0006014583,0.0009815706,0.0016224202,0.0023855825,0.004428115,0.0031336232,0.0040307147,0.0021117115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025778807,0.000023093873,0.00007640966,0.000021052274,0.0000028860832,0.00006562221,0.0001542236,0.00027042392,0.00056212494,0.993056,0.0010022653,0.004740183],"study_design_scores_gemma":[0.00002098225,0.000011863375,0.00006116776,0.000010982171,0.000008195058,0.000089389425,0.00007663586,0.0023660962,0.00064220227,0.9936306,0.003070237,0.000011628126],"about_ca_topic_score_codex":0.00073880976,"about_ca_topic_score_gemma":0.0012658619,"teacher_disagreement_score":0.013379115,"about_ca_system_score_codex":0.0012309093,"about_ca_system_score_gemma":0.0006138336,"threshold_uncertainty_score":0.044757664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5779067,0.00026030795,0.41055945,0.00036505595,0.00006479083,0.00006296564,0.0010459024,0.0010181915,0.008716698],"genre_scores_gemma":[0.8551599,0.0002608683,0.13485314,0.000101120255,0.00007962455,0.00005677073,0.0023137499,0.00055391126,0.0066209617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958414,0.0000947308,0.000027835009,0.00011778179,0.00011750591,0.0000579501],"domain_scores_gemma":[0.9980854,0.00071459915,0.00033652494,0.00040041667,0.0002273067,0.00023592851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037051726,0.00083347526,0.0006643539,0.0012610249,0.00051393395,0.0028053082,0.0013066323,0.0009825812,0.004405675],"category_scores_gemma":[0.0031248408,0.0007482116,0.0008277521,0.0007908209,0.0012032762,0.0022832723,0.0018884084,0.0019139979,0.0014803649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013235605,0.0003837763,0.009502663,0.0006364099,0.00012108231,0.002065303,0.0033447286,0.06116212,0.07262877,0.68782514,0.010280098,0.1507264],"study_design_scores_gemma":[0.00005316465,0.000119080956,0.002470729,0.00007757396,0.000044609984,0.0010882923,0.0007184011,0.27075014,0.011602089,0.7039037,0.009119189,0.000053070577],"about_ca_topic_score_codex":0.0005752597,"about_ca_topic_score_gemma":0.0007061229,"teacher_disagreement_score":0.004405675,"about_ca_system_score_codex":0.0004196923,"about_ca_system_score_gemma":0.00025949895,"threshold_uncertainty_score":0.0147384405},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8212736,0.0011009044,0.14064766,0.0042655426,0.00022462444,0.00015125553,0.0010962957,0.0018441745,0.02939598],"genre_scores_gemma":[0.9693955,0.00055703754,0.01656597,0.0011888029,0.00028690888,0.00026733693,0.0010842336,0.00054910453,0.010104954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680734,0.0011882444,0.000117507254,0.00062234595,0.0006900142,0.00057452515],"domain_scores_gemma":[0.9689586,0.01951434,0.0031449497,0.003496262,0.002030956,0.0028548054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041577974,0.0015844158,0.0029128275,0.0038970786,0.0022453621,0.004927331,0.0036896404,0.0040948954,0.009228887],"category_scores_gemma":[0.032066938,0.002001455,0.0021098314,0.0018333636,0.0053913468,0.007005563,0.0040601916,0.0044657784,0.0017037953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011968137,0.00021014802,0.0048006317,0.0004027664,0.00018994455,0.0004885048,0.00097292557,0.031191511,0.0071256016,0.929848,0.010891014,0.01268215],"study_design_scores_gemma":[0.00014427492,0.00006663953,0.0016221058,0.000052420324,0.000064344495,0.000371717,0.0002516946,0.0919882,0.0014649251,0.902359,0.0015626128,0.00005191129],"about_ca_topic_score_codex":0.0012717316,"about_ca_topic_score_gemma":0.0018354608,"teacher_disagreement_score":0.009228887,"about_ca_system_score_codex":0.0026160432,"about_ca_system_score_gemma":0.0014936784,"threshold_uncertainty_score":0.030873716},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53420615,0.0041400297,0.3744506,0.0068545747,0.00052257295,0.00012341046,0.001091949,0.00051620265,0.07809447],"genre_scores_gemma":[0.9563016,0.001417666,0.023742441,0.0005860635,0.00047491092,0.00015401539,0.0005881621,0.00013393576,0.016601268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981134,0.0008165555,0.00008180072,0.00040373788,0.00038571976,0.00019878153],"domain_scores_gemma":[0.9924716,0.0048692846,0.0009352607,0.0006246147,0.0004392951,0.00065996713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017115329,0.0009483231,0.0013818088,0.0043436065,0.0020632804,0.005150406,0.001804578,0.0021925536,0.0071668117],"category_scores_gemma":[0.009346291,0.0007857827,0.0011587053,0.0027562433,0.0042448062,0.0066056983,0.003435476,0.0025650496,0.0011049296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020205272,0.000008542764,0.00022611217,0.000026000307,0.0000071488366,0.00003080636,0.000092301714,0.0014128825,0.0001745251,0.99589384,0.00039522763,0.0017124654],"study_design_scores_gemma":[0.000013404565,0.0000112454945,0.0001954515,0.000014531311,0.000010376407,0.00010366808,0.00007102933,0.007947098,0.00019461359,0.98989874,0.001530078,0.000009731357],"about_ca_topic_score_codex":0.0006644419,"about_ca_topic_score_gemma":0.0004920724,"teacher_disagreement_score":0.0071668117,"about_ca_system_score_codex":0.0017200526,"about_ca_system_score_gemma":0.0005666429,"threshold_uncertainty_score":0.023975372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22679433,0.0007154838,0.6441137,0.0023890596,0.00095634407,0.00022458736,0.0006986268,0.0024553922,0.121652395],"genre_scores_gemma":[0.8409957,0.0010218705,0.093196586,0.00079293095,0.00057559926,0.00029716868,0.0006644418,0.00093915267,0.061516546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985927,0.00043838623,0.00006064659,0.00036550482,0.0002617896,0.00028108753],"domain_scores_gemma":[0.9977964,0.0010075761,0.00022141996,0.00031771074,0.0002769537,0.0003799268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094337785,0.00081319496,0.00057547877,0.0022946498,0.0013223466,0.0036665658,0.0012249803,0.0010088255,0.012087942],"category_scores_gemma":[0.0033094597,0.0007201792,0.00096137915,0.0019319041,0.0019765547,0.0056149918,0.0027566038,0.0028249947,0.0021440194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044301167,0.00005508702,0.00013272585,0.00004212871,0.000008496767,0.000043539785,0.00017119224,0.0011631267,0.0012248683,0.98076713,0.0018936462,0.014453813],"study_design_scores_gemma":[0.0000191662,0.000016873288,0.00009556953,0.0000107826445,0.000011738073,0.00008572265,0.00006809878,0.0079561295,0.00089565385,0.98628926,0.004536698,0.000014284124],"about_ca_topic_score_codex":0.0010276762,"about_ca_topic_score_gemma":0.00068417855,"teacher_disagreement_score":0.012087942,"about_ca_system_score_codex":0.0013611128,"about_ca_system_score_gemma":0.0006064239,"threshold_uncertainty_score":0.040438175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79293007,0.0011892791,0.04254953,0.00096568617,0.0003494629,0.00007840329,0.0014260772,0.0010210812,0.15949035],"genre_scores_gemma":[0.94786704,0.00037643773,0.004984484,0.00011510533,0.00016565305,0.000026673519,0.0009657372,0.0001476836,0.04535132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972636,0.000049370577,0.000014882208,0.000057490528,0.000071992676,0.00007989598],"domain_scores_gemma":[0.99963045,0.00007988062,0.00007990646,0.00003017138,0.00006753137,0.00011190471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003185597,0.00037718116,0.00037552576,0.0020877814,0.0015607895,0.0027602003,0.00041182767,0.00048215158,0.0146685615],"category_scores_gemma":[0.0008354381,0.00039679583,0.0004304005,0.0013695869,0.0016797715,0.0020791148,0.0013594313,0.0010201155,0.0024871565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002597214,0.000040850773,0.00211504,0.00010236862,0.00002010708,0.0007067177,0.0008607044,0.0014248195,0.0039623654,0.96539414,0.0067011877,0.01841186],"study_design_scores_gemma":[0.0001095508,0.00016979377,0.014275785,0.00010620478,0.00007345276,0.0015955844,0.0016353031,0.009121411,0.0072904397,0.9106141,0.054898147,0.00011013901],"about_ca_topic_score_codex":0.002444491,"about_ca_topic_score_gemma":0.0023533886,"teacher_disagreement_score":0.0146685615,"about_ca_system_score_codex":0.0010715205,"about_ca_system_score_gemma":0.00053566333,"threshold_uncertainty_score":0.049071193},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34120163,0.007230459,0.44566563,0.0143708,0.001066566,0.0002949297,0.0015602852,0.0012034066,0.18740629],"genre_scores_gemma":[0.89779454,0.0044974503,0.052141152,0.00224991,0.0010460673,0.000494055,0.0007776416,0.00033971737,0.040659357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963744,0.0010938976,0.0002949109,0.0009066646,0.0007809109,0.0005491542],"domain_scores_gemma":[0.99013746,0.0059145796,0.0012102891,0.001125516,0.0006721007,0.0009400936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003746851,0.0017224475,0.0036285107,0.0058620144,0.004512645,0.006298399,0.0036863254,0.004400443,0.011429374],"category_scores_gemma":[0.022343878,0.00158789,0.0023836973,0.0044607227,0.00637463,0.018374937,0.0088169705,0.0063305893,0.0025151933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054470984,0.00002364166,0.00017016527,0.00008516336,0.000019241588,0.00004765369,0.00020238753,0.0016996367,0.00026851348,0.9910227,0.0016140935,0.0047923885],"study_design_scores_gemma":[0.000018097617,0.0000092983155,0.00006685593,0.000021771448,0.00002178196,0.00007330975,0.000049314625,0.0045442637,0.00013517073,0.9930282,0.002016276,0.000015538475],"about_ca_topic_score_codex":0.0013264682,"about_ca_topic_score_gemma":0.001057505,"teacher_disagreement_score":0.011429374,"about_ca_system_score_codex":0.003583497,"about_ca_system_score_gemma":0.0018669296,"threshold_uncertainty_score":0.03823507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91703,0.0006719314,0.04432269,0.001206414,0.00015836197,0.000029921686,0.00018376707,0.00014229835,0.036254495],"genre_scores_gemma":[0.9870083,0.00029020713,0.0047418717,0.00013770298,0.00012838376,0.00003474515,0.00012982046,0.000047662863,0.0074813394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998705,0.00035350476,0.000076082586,0.00032217806,0.0002935771,0.00024965394],"domain_scores_gemma":[0.99471587,0.002670295,0.00086061825,0.0004121696,0.00038591263,0.0009551679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013201112,0.0005713565,0.0009236592,0.0022095523,0.0024532452,0.0056903246,0.0019609923,0.0016218795,0.006114601],"category_scores_gemma":[0.007802101,0.0006685599,0.0006757878,0.0016959751,0.0041108546,0.005372031,0.0027026846,0.0024313962,0.0004050991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009916445,0.00003171627,0.0009920925,0.000034677298,0.000010248986,0.00011849092,0.00032200819,0.001964495,0.0011096217,0.9910841,0.00057956803,0.0036539426],"study_design_scores_gemma":[0.00003196805,0.00001543829,0.0003687151,0.000009970902,0.000011995979,0.00013092971,0.0000922445,0.006364825,0.00044578014,0.99147004,0.0010449867,0.0000130628305],"about_ca_topic_score_codex":0.0012619572,"about_ca_topic_score_gemma":0.001270922,"teacher_disagreement_score":0.006114601,"about_ca_system_score_codex":0.0019408873,"about_ca_system_score_gemma":0.0006630332,"threshold_uncertainty_score":0.02045536},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7776269,0.0017497445,0.104008734,0.0034261404,0.00017624279,0.000073404495,0.00077289564,0.0006471302,0.111518875],"genre_scores_gemma":[0.9719614,0.000733352,0.012203071,0.000331545,0.00016500207,0.00011515552,0.0004606994,0.00012181804,0.013907991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860543,0.0005424576,0.000056118643,0.00027660734,0.0002965247,0.00022296615],"domain_scores_gemma":[0.9950899,0.0026796542,0.00046988463,0.00039576835,0.00052431267,0.00084044057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016310883,0.00068017986,0.0010963216,0.0034377084,0.0034734954,0.0039619748,0.0015544787,0.0015778736,0.007225871],"category_scores_gemma":[0.006658301,0.0010901251,0.001100644,0.0018428944,0.0038748777,0.0075694714,0.0038483727,0.00222011,0.00058007234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034638077,0.000011052522,0.0003552621,0.000028376386,0.0000076292986,0.00009076392,0.00039258,0.0003989623,0.000263469,0.99627185,0.00072874094,0.0014166966],"study_design_scores_gemma":[0.000021960013,0.000010849908,0.0004544403,0.000019260326,0.000017544988,0.00028095927,0.00022672047,0.0027074504,0.00019057833,0.99379057,0.0022652077,0.000014364392],"about_ca_topic_score_codex":0.0014048852,"about_ca_topic_score_gemma":0.0017262051,"teacher_disagreement_score":0.007225871,"about_ca_system_score_codex":0.0018842133,"about_ca_system_score_gemma":0.00067413494,"threshold_uncertainty_score":0.024172962},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2784428,0.0020157148,0.41953498,0.00386671,0.0014110876,0.00018086878,0.0014892617,0.00090325746,0.2921553],"genre_scores_gemma":[0.8412925,0.0017031038,0.07052353,0.0014341325,0.00089679926,0.00036817134,0.0022561299,0.0007872992,0.08073838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977041,0.00069923996,0.00021553857,0.00047697077,0.00049707585,0.00040714798],"domain_scores_gemma":[0.9933994,0.0040394277,0.00043233015,0.0009680689,0.00069936796,0.0004613422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001902465,0.00080840715,0.0011728142,0.0058149155,0.005341305,0.0064540496,0.0021368626,0.0027830587,0.025870671],"category_scores_gemma":[0.00934435,0.00101058,0.001294667,0.0065951715,0.0042807767,0.013001606,0.0049069677,0.004800367,0.0026442686],"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.000021441354,0.000022096756,0.00021560457,0.000032219006,0.0000036069146,0.00006346983,0.0003564245,0.0001896837,0.00022474599,0.9902175,0.0015150937,0.007138045],"study_design_scores_gemma":[0.0000046161645,0.0000035263313,0.000120813595,0.000014919448,0.0000064120945,0.000079564736,0.00009730947,0.00073322415,0.0001485354,0.9946827,0.0041001397,0.00000818915],"about_ca_topic_score_codex":0.0014180568,"about_ca_topic_score_gemma":0.0020185325,"teacher_disagreement_score":0.025870671,"about_ca_system_score_codex":0.0015607985,"about_ca_system_score_gemma":0.0008599361,"threshold_uncertainty_score":0.08654606},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76634663,0.0007149865,0.12338306,0.0014116315,0.00075084495,0.00012179596,0.00053201406,0.00071121077,0.10602779],"genre_scores_gemma":[0.96041375,0.00026666225,0.016884662,0.00026789543,0.00011969696,0.00013932922,0.00041848505,0.00020829562,0.021281378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994355,0.00024175992,0.000021958784,0.0000740757,0.0001047593,0.000121976664],"domain_scores_gemma":[0.99860877,0.000449805,0.00016696264,0.0002456477,0.00019938173,0.00032937448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004719311,0.0005095039,0.00066627836,0.0013796812,0.0012013911,0.0018188606,0.0008022713,0.0011892086,0.014891596],"category_scores_gemma":[0.0030802742,0.0004202103,0.00038197442,0.0009118931,0.0012426013,0.0019101643,0.0023301812,0.0013685992,0.0015951822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057461247,0.0000523392,0.0006586366,0.00011927051,0.000030952717,0.0005069378,0.0002356512,0.030159412,0.009011613,0.94294715,0.0054514157,0.010251966],"study_design_scores_gemma":[0.00014349454,0.00014312909,0.00072455057,0.000079045116,0.000030090141,0.00064710603,0.00044240148,0.13571647,0.0064805904,0.844155,0.011388437,0.000049764352],"about_ca_topic_score_codex":0.00023351003,"about_ca_topic_score_gemma":0.0003418628,"teacher_disagreement_score":0.014891596,"about_ca_system_score_codex":0.00060915167,"about_ca_system_score_gemma":0.00035912602,"threshold_uncertainty_score":0.049817324},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15200125,0.0018156312,0.39582822,0.016942931,0.00068686926,0.00043084036,0.0047125584,0.00084153377,0.42674017],"genre_scores_gemma":[0.81652844,0.002191104,0.09788188,0.0032212914,0.0009286676,0.0010972986,0.005899124,0.001338441,0.07091373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976428,0.00065662747,0.0001118023,0.0006063122,0.0004972221,0.00048518967],"domain_scores_gemma":[0.986586,0.0089461915,0.0006298818,0.0013476216,0.0017215767,0.0007687507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023118705,0.0009324627,0.001122969,0.0011418065,0.0024910066,0.0048388704,0.0033004642,0.0019905772,0.040571667],"category_scores_gemma":[0.01886861,0.00078888057,0.0013208488,0.0015890222,0.0031094695,0.011083611,0.0033666429,0.0058649266,0.0059542577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015193009,0.000118217926,0.0014470944,0.00041226158,0.000034467746,0.0001281634,0.00034303387,0.0030254757,0.002931413,0.9370486,0.0275418,0.026817692],"study_design_scores_gemma":[0.00005294224,0.00006791257,0.0017223919,0.00011949518,0.000035633137,0.0006157262,0.000291234,0.021820283,0.004647692,0.9491683,0.021428507,0.000029962386],"about_ca_topic_score_codex":0.0019643137,"about_ca_topic_score_gemma":0.0026645483,"teacher_disagreement_score":0.040571667,"about_ca_system_score_codex":0.0015758346,"about_ca_system_score_gemma":0.002012105,"threshold_uncertainty_score":0.13572574},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058446802,0.000514296,0.8305521,0.0010292755,0.0007932562,0.0003333716,0.002331672,0.004925167,0.10107398],"genre_scores_gemma":[0.3351353,0.00082901795,0.5904583,0.0004804515,0.00029647446,0.00028371115,0.0054659257,0.003016237,0.06403461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990896,0.00024648965,0.00008846311,0.00018108691,0.00024581287,0.0001485574],"domain_scores_gemma":[0.9981406,0.0007964607,0.000105232575,0.000463079,0.00038122365,0.00011343402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007818722,0.00090039225,0.0006122199,0.0014827895,0.0013672092,0.0021002365,0.0007283346,0.00070694234,0.018070592],"category_scores_gemma":[0.004285597,0.00068178255,0.00084072916,0.0014643882,0.0009802156,0.002385822,0.0019888482,0.0014957101,0.012055057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034997094,0.00015261288,0.0009057381,0.0005505432,0.000045044402,0.00059783587,0.0008824772,0.009544612,0.018970734,0.73527896,0.038272902,0.19444855],"study_design_scores_gemma":[0.00012372033,0.0001293236,0.00042323628,0.00018970277,0.000043349268,0.0008440674,0.00030400688,0.03719109,0.0620243,0.7683407,0.13029796,0.00008862018],"about_ca_topic_score_codex":0.0011776205,"about_ca_topic_score_gemma":0.0022948452,"teacher_disagreement_score":0.018070592,"about_ca_system_score_codex":0.00068198534,"about_ca_system_score_gemma":0.0015859719,"threshold_uncertainty_score":0.060452104},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00517604,0.00036361837,0.12724213,0.0038492146,0.0018053296,0.00016015291,0.034942504,0.05268299,0.77377796],"genre_scores_gemma":[0.07393161,0.0008075903,0.08138518,0.0019653344,0.00073900097,0.0003186989,0.05080291,0.07400547,0.7160442],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950016,0.00009023996,0.000035646633,0.000101144375,0.00019818146,0.000074701624],"domain_scores_gemma":[0.99896145,0.00026757258,0.00005929429,0.00023782131,0.0003599992,0.00011389841],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00062888797,0.00085832743,0.00070391776,0.0018848797,0.001505884,0.003980296,0.0014254113,0.0010283568,0.42267886],"category_scores_gemma":[0.0024479271,0.00058460585,0.0008159093,0.0020512033,0.0009046519,0.0051399185,0.0020927258,0.0020902369,0.27194428],"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.000116788055,0.000046525314,0.00031654263,0.00023538395,0.00001009895,0.00011696094,0.00036899475,0.00036168337,0.003423765,0.23659717,0.7085556,0.04985048],"study_design_scores_gemma":[0.00003281171,0.000015388074,0.00068922,0.00005728273,0.0000074186396,0.00016670393,0.000120824145,0.0020185243,0.008064932,0.08035237,0.908428,0.000046516514],"about_ca_topic_score_codex":0.0042198217,"about_ca_topic_score_gemma":0.006011668,"teacher_disagreement_score":0.42267886,"about_ca_system_score_codex":0.0014666609,"about_ca_system_score_gemma":0.0008965211,"threshold_uncertainty_score":0.8234785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43419957,0.0013566337,0.48343378,0.0012763502,0.00030683188,0.00019646306,0.0004717423,0.00079602236,0.077962585],"genre_scores_gemma":[0.9437928,0.0008759146,0.041252606,0.0004537542,0.00018881029,0.00022908617,0.0006327239,0.00026965883,0.012304641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883527,0.00016278803,0.000072386676,0.00034082498,0.0003383007,0.00025046998],"domain_scores_gemma":[0.9936841,0.003266697,0.00068601535,0.0006090188,0.00083543063,0.00091869495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017398389,0.001243256,0.0009174236,0.0030512114,0.0015051824,0.0021298463,0.0012715765,0.0013410662,0.010051273],"category_scores_gemma":[0.006908031,0.00075122365,0.002213876,0.0008909361,0.0031410228,0.008160022,0.006560597,0.0038842,0.0013178342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100034194,0.00004762378,0.0012859826,0.00012737556,0.000045479002,0.0004961301,0.0012285868,0.0029049185,0.0052284594,0.973434,0.0018935468,0.013207897],"study_design_scores_gemma":[0.000041503954,0.00013873959,0.00097199465,0.000052028936,0.000047124333,0.00066209026,0.0005478337,0.017688109,0.0061125783,0.967748,0.005956591,0.000033443448],"about_ca_topic_score_codex":0.00042364097,"about_ca_topic_score_gemma":0.00034674085,"teacher_disagreement_score":0.010051273,"about_ca_system_score_codex":0.0011610333,"about_ca_system_score_gemma":0.00030358377,"threshold_uncertainty_score":0.033624887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4642244,0.007621884,0.2216997,0.010018788,0.0011876296,0.00008265227,0.0010518513,0.00054765673,0.29356545],"genre_scores_gemma":[0.91356117,0.003896864,0.024300063,0.00079661235,0.0013370378,0.000052887324,0.000637292,0.00048267908,0.0549354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940073,0.0001796334,0.000018000766,0.00013568508,0.00014354523,0.00012245004],"domain_scores_gemma":[0.996923,0.0021265799,0.00022975443,0.00023140012,0.00024748215,0.00024182511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064666383,0.0006872984,0.0011350033,0.0018806725,0.0010806142,0.002268876,0.0014299258,0.001521163,0.015589625],"category_scores_gemma":[0.00776155,0.00045825198,0.0007464319,0.002116535,0.002746142,0.0047833147,0.0023843015,0.004129922,0.0030590293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011882899,0.00004116811,0.00041941926,0.00013994148,0.000011602058,0.00015514636,0.0003377693,0.0037869082,0.0021146308,0.9660371,0.005543792,0.021293754],"study_design_scores_gemma":[0.000021436359,0.000013413508,0.00032803137,0.000026431928,0.000010914407,0.0001028961,0.00008275925,0.008717559,0.00040999855,0.9866089,0.0036672591,0.000010294286],"about_ca_topic_score_codex":0.0021000467,"about_ca_topic_score_gemma":0.0020707105,"teacher_disagreement_score":0.015589625,"about_ca_system_score_codex":0.0014037498,"about_ca_system_score_gemma":0.0007025131,"threshold_uncertainty_score":0.052152514},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03392608,0.0036273764,0.30411586,0.004827776,0.0029854353,0.0001340393,0.0015051685,0.002074186,0.6468041],"genre_scores_gemma":[0.47984812,0.0040269727,0.07494237,0.002731134,0.0024489525,0.00035422307,0.0025089795,0.0019545637,0.43118474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807847,0.00039015943,0.0001546482,0.0005505017,0.0004922384,0.00033397417],"domain_scores_gemma":[0.99825877,0.00055429654,0.00011316564,0.0005539112,0.00038879793,0.00013111165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014143828,0.001643447,0.0012846281,0.0029906458,0.0032724768,0.006427578,0.0015123232,0.0019523825,0.03538464],"category_scores_gemma":[0.003962101,0.0008266565,0.0013952538,0.0029710366,0.0036130082,0.016069388,0.0040990436,0.004636649,0.017743485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017947239,0.0000106495745,0.000049803926,0.000028946444,0.0000042489946,0.00004235621,0.00012351724,0.00006056356,0.00036701406,0.9800745,0.0041890303,0.015031426],"study_design_scores_gemma":[0.000008434548,0.000014931265,0.00012714144,0.000032682,0.000017496252,0.00032333317,0.00007537243,0.0004519561,0.0015760246,0.91295,0.084403545,0.000019113011],"about_ca_topic_score_codex":0.00037139995,"about_ca_topic_score_gemma":0.00032465524,"teacher_disagreement_score":0.03538464,"about_ca_system_score_codex":0.001553477,"about_ca_system_score_gemma":0.0008244456,"threshold_uncertainty_score":0.118373334},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20645511,0.0018158351,0.20910308,0.0044999067,0.0006046887,0.00010631494,0.0009873612,0.001011442,0.5754163],"genre_scores_gemma":[0.9240908,0.0007109314,0.021817366,0.0006383039,0.0006007171,0.00009392554,0.0005772202,0.00028819905,0.051182576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984043,0.00033920124,0.0001329004,0.00050633657,0.00038370502,0.00023349785],"domain_scores_gemma":[0.9971468,0.0012622948,0.00022205437,0.00071130286,0.00036201585,0.00029556904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001267583,0.00061631453,0.0013306703,0.0022820844,0.0026528512,0.004275796,0.00095987215,0.0009786936,0.021763388],"category_scores_gemma":[0.0037250975,0.0006008295,0.0012098321,0.0017306283,0.0036842802,0.01045702,0.004335294,0.0033262768,0.0029923252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001535847,0.000008727323,0.00008851457,0.000022000959,0.000004172785,0.000034412773,0.00016239956,0.00007695305,0.00038084228,0.9949183,0.0006641338,0.003624074],"study_design_scores_gemma":[0.000009170837,0.000010785398,0.00014333539,0.000008962154,0.000009728679,0.00022652034,0.00007917296,0.00043150794,0.0004032926,0.991546,0.007124041,0.000007465685],"about_ca_topic_score_codex":0.00020965347,"about_ca_topic_score_gemma":0.00021907182,"teacher_disagreement_score":0.021763388,"about_ca_system_score_codex":0.00093383814,"about_ca_system_score_gemma":0.0004637166,"threshold_uncertainty_score":0.07280576},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20832442,0.0024859551,0.18965368,0.011308812,0.002942236,0.00015289053,0.0021236981,0.00079431845,0.582214],"genre_scores_gemma":[0.7823075,0.0017667244,0.051457353,0.0026164397,0.0012833718,0.00033611548,0.0020869677,0.00053024635,0.15761538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978447,0.00048910826,0.0001799987,0.00063407293,0.0006101589,0.00024208284],"domain_scores_gemma":[0.9964868,0.0013166888,0.0003871928,0.00044796139,0.0006208407,0.0007406902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015367307,0.0010531553,0.0012476144,0.0028434058,0.0034962923,0.0039473283,0.0013899078,0.0012632158,0.0154579785],"category_scores_gemma":[0.004194288,0.0008430604,0.0012626912,0.0021531733,0.003800847,0.00901947,0.006886464,0.0049030925,0.002892084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002796076,0.00002117575,0.00022917842,0.000027886066,0.0000092278,0.000054828422,0.00014309664,0.00011176904,0.0003721901,0.98960924,0.0031070167,0.006286335],"study_design_scores_gemma":[0.000010840843,0.000016784223,0.00039001106,0.000015379992,0.000009309241,0.00037201826,0.000113552305,0.00089853787,0.00042996818,0.9783288,0.019404726,0.0000099963345],"about_ca_topic_score_codex":0.00059317646,"about_ca_topic_score_gemma":0.0007404015,"teacher_disagreement_score":0.0154579785,"about_ca_system_score_codex":0.0018219573,"about_ca_system_score_gemma":0.000703555,"threshold_uncertainty_score":0.051712096},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59879863,0.00057463854,0.14816327,0.003034989,0.001600771,0.00021542187,0.0035447034,0.0019954098,0.24207221],"genre_scores_gemma":[0.9227648,0.00026609565,0.017342629,0.00046570794,0.00020572949,0.000114227034,0.0024725155,0.00040858667,0.055959888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873084,0.00022009478,0.000077773286,0.00023652457,0.00022195137,0.00051287847],"domain_scores_gemma":[0.99790037,0.0006329184,0.00022508646,0.00040829534,0.00039965828,0.00043361174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094174343,0.0009417102,0.00084812444,0.0019311357,0.0037940268,0.005872625,0.0012099204,0.0016797986,0.0233953],"category_scores_gemma":[0.003320136,0.0006581349,0.00082722306,0.0016986527,0.0026628647,0.004288212,0.0036169067,0.0025924142,0.004021416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005444456,0.00009009533,0.0014350223,0.00011061083,0.000021349984,0.0006979701,0.0006124794,0.00073169806,0.0036639774,0.9668568,0.01006979,0.015165648],"study_design_scores_gemma":[0.00006981036,0.00006445704,0.0015256574,0.000070947186,0.000031524713,0.00087761733,0.0005655788,0.003186853,0.0038020918,0.9700338,0.019728461,0.00004326566],"about_ca_topic_score_codex":0.0013605219,"about_ca_topic_score_gemma":0.0015007856,"teacher_disagreement_score":0.0233953,"about_ca_system_score_codex":0.0013802724,"about_ca_system_score_gemma":0.0009751177,"threshold_uncertainty_score":0.07826507},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44082448,0.001339519,0.5055852,0.0022704946,0.00029827518,0.00019992655,0.002148345,0.0012838539,0.046049956],"genre_scores_gemma":[0.79485923,0.0012277421,0.17995429,0.0007638205,0.00019703366,0.00024976634,0.0020941999,0.00065023877,0.020003747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986702,0.0003648433,0.00007459149,0.0003166571,0.00024780008,0.00032585507],"domain_scores_gemma":[0.9915523,0.0056358804,0.0006498136,0.00053499686,0.00068050507,0.000946526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011407455,0.0008025794,0.0011127536,0.0020334658,0.0019322259,0.0049267425,0.0022242279,0.0021063825,0.008663171],"category_scores_gemma":[0.008216972,0.0015880232,0.001130857,0.0030323307,0.0017324449,0.005182411,0.0026023102,0.0022512614,0.0012207028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004164215,0.0001745525,0.0023717298,0.00058610813,0.00007433692,0.00048022196,0.00088128267,0.02776881,0.0125096515,0.9145274,0.0084972475,0.031712286],"study_design_scores_gemma":[0.00006422589,0.000029378856,0.0008924977,0.00009608202,0.000056459146,0.000298635,0.00021655453,0.05602704,0.0033237867,0.93439585,0.004575257,0.000024262361],"about_ca_topic_score_codex":0.0020628152,"about_ca_topic_score_gemma":0.003986111,"teacher_disagreement_score":0.008663171,"about_ca_system_score_codex":0.0018037483,"about_ca_system_score_gemma":0.0012143668,"threshold_uncertainty_score":0.028981209},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7866426,0.00067028624,0.09605084,0.0024743315,0.0006817201,0.00009471198,0.00050405524,0.0004281308,0.11245334],"genre_scores_gemma":[0.926019,0.00036138995,0.043481488,0.0006914539,0.00013727449,0.00009681715,0.000651843,0.00024162508,0.028319158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846953,0.00042079002,0.00008537576,0.00029487873,0.00040767336,0.0003217785],"domain_scores_gemma":[0.9935104,0.0035356993,0.0005758938,0.000578582,0.00072598126,0.001073296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094271475,0.00059301336,0.000801236,0.0017604629,0.002526144,0.0035341023,0.00145763,0.0020165585,0.009274232],"category_scores_gemma":[0.005933231,0.0008993419,0.00060557685,0.0014699376,0.002704742,0.0029303492,0.0027624078,0.0030511373,0.0011698026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041877056,0.00009528533,0.001257706,0.00011475927,0.000022308564,0.00031199888,0.0011065158,0.0020932308,0.007749813,0.97050774,0.0030353032,0.013286524],"study_design_scores_gemma":[0.00008234596,0.00004124044,0.0013616194,0.000053227992,0.000027708917,0.00029040675,0.0005532754,0.0071085673,0.0028002448,0.9773793,0.010266175,0.000035897523],"about_ca_topic_score_codex":0.0017127565,"about_ca_topic_score_gemma":0.0029462974,"teacher_disagreement_score":0.009274232,"about_ca_system_score_codex":0.0014743599,"about_ca_system_score_gemma":0.00057565485,"threshold_uncertainty_score":0.03102541},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40141833,0.005022928,0.1590401,0.04438408,0.002001342,0.00023078258,0.0027164388,0.0015119764,0.38367403],"genre_scores_gemma":[0.91565883,0.0015978602,0.026853291,0.0030340992,0.0010345837,0.00027493856,0.0016824853,0.00072969997,0.049134295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965808,0.0009118154,0.00012944889,0.0010590077,0.0006126983,0.0007062965],"domain_scores_gemma":[0.96005815,0.02976313,0.0011856813,0.004742042,0.0015128145,0.0027382404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004150625,0.0012692515,0.0022435351,0.0021051774,0.005958156,0.005537244,0.003994205,0.0041163475,0.03634649],"category_scores_gemma":[0.027409775,0.0011573298,0.0023171636,0.0027149029,0.007849733,0.018550327,0.00547562,0.007669096,0.004218914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013470156,0.00021344011,0.0053457194,0.00062250806,0.00007122889,0.00019764266,0.0008780957,0.011265519,0.0020498217,0.9137115,0.038914334,0.025383104],"study_design_scores_gemma":[0.000090681504,0.000050823877,0.000962747,0.000102396785,0.00004760476,0.00010288062,0.00025263213,0.017897243,0.0010259375,0.9703902,0.009040441,0.000036489746],"about_ca_topic_score_codex":0.003863602,"about_ca_topic_score_gemma":0.0061682435,"teacher_disagreement_score":0.03634649,"about_ca_system_score_codex":0.0033169424,"about_ca_system_score_gemma":0.002161355,"threshold_uncertainty_score":0.12159115},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5698498,0.0033515699,0.31845227,0.009095696,0.0005170119,0.00021430088,0.0028063874,0.0019095986,0.09380349],"genre_scores_gemma":[0.97877514,0.00095503044,0.010227169,0.0008484376,0.00042819252,0.00022317845,0.0010173408,0.0006653689,0.006860103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9934942,0.0030661905,0.00027574983,0.0011757233,0.0011225947,0.00086556916],"domain_scores_gemma":[0.80908936,0.14484651,0.013082932,0.020395841,0.006347296,0.0062380536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011242827,0.0013499921,0.0023713952,0.0041421545,0.002414509,0.004653221,0.0043002577,0.0032487554,0.009766494],"category_scores_gemma":[0.10832898,0.0010877972,0.0016412265,0.0015510551,0.007405022,0.0088133495,0.006123669,0.0044168704,0.0014479217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008120835,0.0001275972,0.0038082446,0.0003487123,0.00025563198,0.00026258387,0.00044611673,0.12860012,0.002334012,0.83754796,0.012184534,0.013272415],"study_design_scores_gemma":[0.00007030486,0.00010277671,0.0015022068,0.00012782207,0.00006496477,0.00016755763,0.00012498403,0.23891312,0.0014745268,0.75586337,0.0015105254,0.00007775881],"about_ca_topic_score_codex":0.0029018342,"about_ca_topic_score_gemma":0.0018848188,"teacher_disagreement_score":0.011242827,"about_ca_system_score_codex":0.0034448875,"about_ca_system_score_gemma":0.0016611938,"threshold_uncertainty_score":0.059458435},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89107496,0.0006468454,0.029644044,0.0015777734,0.00031669304,0.000038346727,0.00019421273,0.00029071962,0.076216504],"genre_scores_gemma":[0.9743807,0.00021701647,0.0029603234,0.00018483317,0.00039879594,0.000026170728,0.000106741594,0.00006633225,0.021659097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994553,0.0001304076,0.000020520309,0.00008884252,0.00014853413,0.00015645883],"domain_scores_gemma":[0.9991698,0.00019751569,0.00014106685,0.000055263386,0.000113092115,0.00032341434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006285662,0.00079572684,0.000532549,0.0024159634,0.001874494,0.0024990838,0.00074145535,0.00090436445,0.0084077725],"category_scores_gemma":[0.0018056141,0.00039236087,0.0005608158,0.0009870859,0.003306391,0.002814158,0.0017542036,0.001159872,0.001113543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008262294,0.000026691634,0.00041445167,0.000022830152,0.0000072984717,0.00018936547,0.00044669374,0.00077515724,0.0020305752,0.9906324,0.0007018718,0.0046699243],"study_design_scores_gemma":[0.000023600789,0.000042121654,0.0009602582,0.000013109074,0.0000087432745,0.0002109522,0.0001918995,0.0041652047,0.00080288306,0.9906888,0.002861407,0.000030958017],"about_ca_topic_score_codex":0.0015414371,"about_ca_topic_score_gemma":0.0015121793,"teacher_disagreement_score":0.0084077725,"about_ca_system_score_codex":0.001425801,"about_ca_system_score_gemma":0.00065772387,"threshold_uncertainty_score":0.028126776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49112284,0.0008933968,0.36579794,0.00067183696,0.0007698081,0.00017327002,0.00033098346,0.0010204245,0.13921948],"genre_scores_gemma":[0.8824519,0.0009887115,0.07363939,0.00044366304,0.00030095104,0.00022025165,0.00037028553,0.0008026539,0.040782128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992824,0.00018176695,0.00004913742,0.0001406719,0.0001669714,0.00017903563],"domain_scores_gemma":[0.9990933,0.0003541086,0.00012326826,0.00010372174,0.00011769914,0.00020795024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076618,0.00070964306,0.0005817652,0.003421398,0.0027364632,0.0033855797,0.0011477694,0.0012366287,0.008063684],"category_scores_gemma":[0.0021063697,0.0007038899,0.0010557601,0.0018585136,0.0014851615,0.0041555767,0.002128673,0.0020761369,0.0016649845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045062905,0.000043242693,0.00014456453,0.000037078906,0.000009190601,0.00012901181,0.0003551544,0.0007802492,0.0019930964,0.988311,0.0008864405,0.0072658486],"study_design_scores_gemma":[0.000025207082,0.000036702262,0.00025764733,0.000035251345,0.000030025043,0.00024843245,0.00036153465,0.0063269697,0.002586428,0.981157,0.008894855,0.00003982238],"about_ca_topic_score_codex":0.0007134448,"about_ca_topic_score_gemma":0.0013057198,"teacher_disagreement_score":0.008063684,"about_ca_system_score_codex":0.000623097,"about_ca_system_score_gemma":0.00042822765,"threshold_uncertainty_score":0.026975691},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71409863,0.00260193,0.15654157,0.0026325919,0.00032465832,0.00009421103,0.0005437745,0.00059153466,0.12257111],"genre_scores_gemma":[0.9385271,0.0012340576,0.019686544,0.00043583332,0.00030528364,0.00015711809,0.0004091693,0.00024505725,0.038999725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836534,0.0005225081,0.000083417326,0.0003182793,0.00037771626,0.0003326903],"domain_scores_gemma":[0.988791,0.006958184,0.0012879861,0.00074494875,0.0008876478,0.0013302355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013296107,0.0009265852,0.0018420016,0.0045133433,0.0030769769,0.0046551563,0.0024422968,0.0019897239,0.010138759],"category_scores_gemma":[0.010428351,0.0011383264,0.0011477525,0.00271046,0.004457543,0.0077463835,0.003840502,0.0027495984,0.0012326193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004354621,0.000024945486,0.00021390128,0.00004410989,0.00001116342,0.00014148142,0.00042181587,0.001345198,0.00038252404,0.99325573,0.0011841734,0.0029312905],"study_design_scores_gemma":[0.000013130982,0.00000928783,0.00015819252,0.000018089244,0.000012170607,0.00014458173,0.00015759756,0.00711027,0.00023490052,0.9905461,0.0015816897,0.000014022398],"about_ca_topic_score_codex":0.0029024582,"about_ca_topic_score_gemma":0.0028900206,"teacher_disagreement_score":0.010138759,"about_ca_system_score_codex":0.0013872947,"about_ca_system_score_gemma":0.0008741907,"threshold_uncertainty_score":0.033917487},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08030112,0.0026586356,0.86378455,0.006550833,0.00062446314,0.00022148082,0.00170525,0.0016291982,0.042524572],"genre_scores_gemma":[0.88088334,0.0029925958,0.09291661,0.0015780223,0.0013504376,0.00077740004,0.0014731652,0.0017998151,0.016228713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98786175,0.00353849,0.00050132815,0.0023617994,0.0029327406,0.0028039208],"domain_scores_gemma":[0.7340075,0.2359094,0.005369608,0.011292264,0.006331278,0.0070899553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016634911,0.003799024,0.0045719543,0.004078055,0.0030429764,0.00978803,0.009403328,0.0048833312,0.020431407],"category_scores_gemma":[0.107405476,0.002822158,0.004186812,0.0034377053,0.007932886,0.018789982,0.0091502,0.012516469,0.0022565576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017425095,0.00033543032,0.0024160508,0.0009990982,0.00034938075,0.00028189216,0.00075940613,0.20101789,0.006849366,0.7477846,0.009106062,0.02835833],"study_design_scores_gemma":[0.00010111397,0.00011810164,0.0005490856,0.00015454326,0.00016603901,0.00018996226,0.00009261703,0.32638606,0.0023430558,0.6683641,0.0014447888,0.00009054034],"about_ca_topic_score_codex":0.0017106703,"about_ca_topic_score_gemma":0.0021678116,"teacher_disagreement_score":0.020431407,"about_ca_system_score_codex":0.0068281544,"about_ca_system_score_gemma":0.006694338,"threshold_uncertainty_score":0.08797485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77752936,0.00038365007,0.061518125,0.0036862842,0.0008251216,0.00012488174,0.00050022395,0.001096984,0.15433541],"genre_scores_gemma":[0.94610244,0.00021767688,0.018263033,0.0003746542,0.00035143597,0.000107787055,0.00034931285,0.00028566053,0.033948004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991467,0.00012752082,0.000039296465,0.00014985124,0.00031757535,0.00021902869],"domain_scores_gemma":[0.9981686,0.000703982,0.00017101623,0.0002578137,0.00023332631,0.00046524912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003366274,0.0007083754,0.0006188812,0.0026935516,0.0022966922,0.003174084,0.0007521889,0.002264224,0.011350487],"category_scores_gemma":[0.0022984575,0.0005818055,0.0008122641,0.0012124602,0.0018031278,0.002831423,0.0026606128,0.0017664732,0.0015621381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025085168,0.000096860094,0.0011610144,0.000091866,0.00002537156,0.0015962792,0.0008492632,0.0014324711,0.013049292,0.95993304,0.0070671104,0.014446695],"study_design_scores_gemma":[0.0001335921,0.00008596563,0.003475413,0.000046131092,0.00005568533,0.0028471013,0.00077006785,0.018117845,0.008558628,0.94532275,0.020516038,0.000070725066],"about_ca_topic_score_codex":0.0004767769,"about_ca_topic_score_gemma":0.00056489516,"teacher_disagreement_score":0.011350487,"about_ca_system_score_codex":0.0009295611,"about_ca_system_score_gemma":0.00035978327,"threshold_uncertainty_score":0.03797114},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7949329,0.0005550308,0.18758662,0.0006672023,0.00020394691,0.00012834797,0.0016111188,0.0011089973,0.013205876],"genre_scores_gemma":[0.950491,0.00017845786,0.040523734,0.0002507627,0.00006980331,0.00011766583,0.0032043322,0.00044822265,0.004716093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984226,0.00061085535,0.000062101266,0.0003895064,0.00033606947,0.00017878557],"domain_scores_gemma":[0.9901906,0.0055941576,0.0006653199,0.0013672468,0.0014089888,0.0007736837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014242376,0.0005519147,0.0009161452,0.0032297308,0.0009782247,0.0018601489,0.0025161982,0.0019988024,0.008014996],"category_scores_gemma":[0.020617528,0.00077810005,0.00094424473,0.0017676617,0.0016545895,0.0030924662,0.0020076097,0.002128511,0.0009373454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001637558,0.0003195016,0.01284899,0.00049017044,0.00017466769,0.0010172059,0.0013508792,0.16444269,0.020768004,0.7561659,0.0091751125,0.0316094],"study_design_scores_gemma":[0.00016871048,0.00019484237,0.003589321,0.00010817683,0.000055913904,0.00051117566,0.00065527175,0.4803423,0.006451256,0.5019285,0.0059246253,0.000069941525],"about_ca_topic_score_codex":0.0023025353,"about_ca_topic_score_gemma":0.004073684,"teacher_disagreement_score":0.008014996,"about_ca_system_score_codex":0.0015647373,"about_ca_system_score_gemma":0.0007931722,"threshold_uncertainty_score":0.026812851},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39096144,0.00095997844,0.057061348,0.0025333343,0.0010392242,0.00014666464,0.001248397,0.0005750016,0.54547465],"genre_scores_gemma":[0.8740111,0.00056945515,0.014671694,0.00063657056,0.0005078144,0.00018130161,0.0012728826,0.00035460762,0.107794546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993967,0.000118983626,0.00003296263,0.00014909508,0.00014792266,0.00015432054],"domain_scores_gemma":[0.999358,0.00020137243,0.00009544045,0.00012532939,0.00009687364,0.00012297939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039985083,0.0009291764,0.0008374458,0.0019565085,0.0024229977,0.0038514852,0.0008483948,0.0013066516,0.025326107],"category_scores_gemma":[0.001814374,0.00054579607,0.00076990644,0.0011383904,0.0019425665,0.002553379,0.0024286949,0.0021220571,0.003499474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011123145,0.000028155597,0.00022998532,0.000049343125,0.000009854574,0.0001639612,0.00015864726,0.00049383304,0.0012963432,0.9863815,0.0047767176,0.0063005043],"study_design_scores_gemma":[0.000027594415,0.00001677505,0.00043233027,0.000024385543,0.000013342578,0.00035295362,0.00013455661,0.0025045362,0.0009754856,0.98777777,0.007729295,0.000011086014],"about_ca_topic_score_codex":0.00045343116,"about_ca_topic_score_gemma":0.0005302886,"teacher_disagreement_score":0.025326107,"about_ca_system_score_codex":0.00094139494,"about_ca_system_score_gemma":0.00043573583,"threshold_uncertainty_score":0.08472425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6874482,0.00071139267,0.25641558,0.0030279867,0.00016275737,0.00016362095,0.0018049589,0.001316985,0.048948538],"genre_scores_gemma":[0.9646085,0.00033596499,0.027741505,0.00027227195,0.00011800505,0.00016246214,0.00054128567,0.0002535865,0.0059664063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998159,0.0004755693,0.00009076723,0.0005322663,0.000315555,0.00042677613],"domain_scores_gemma":[0.984201,0.010240054,0.0011854306,0.0015695891,0.0008187095,0.00198518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021899932,0.001087548,0.0015322763,0.0017609666,0.0017266119,0.0042862236,0.002906203,0.0016621692,0.018123994],"category_scores_gemma":[0.014951038,0.00075291324,0.0010631871,0.0017749285,0.0025333767,0.01195926,0.0036582767,0.002716773,0.0010931711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021519088,0.00029420358,0.0054283277,0.00052560016,0.00010934226,0.00032214777,0.0007541631,0.044980127,0.010163818,0.89744246,0.008159905,0.02966805],"study_design_scores_gemma":[0.000109596454,0.00014379703,0.0013443043,0.00005860488,0.00008577102,0.00031332535,0.00025635082,0.12120515,0.0030776993,0.871116,0.002225361,0.000064047934],"about_ca_topic_score_codex":0.0010512087,"about_ca_topic_score_gemma":0.0013024006,"teacher_disagreement_score":0.018123994,"about_ca_system_score_codex":0.0021359406,"about_ca_system_score_gemma":0.0013797415,"threshold_uncertainty_score":0.06063074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64452934,0.0016542355,0.1247969,0.0012206481,0.0006759757,0.00014841366,0.0007615428,0.00045194486,0.22576103],"genre_scores_gemma":[0.9380775,0.00059083075,0.014059236,0.00019337295,0.0004069653,0.00006597278,0.0003276587,0.00011514956,0.046163417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924207,0.00015266844,0.00003682209,0.00010155063,0.00029273998,0.00017407868],"domain_scores_gemma":[0.999108,0.0003227861,0.000106994565,0.00008794522,0.00015688025,0.00021746586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071878085,0.00057628343,0.0007127187,0.0017091013,0.0016484625,0.00390681,0.00091244717,0.0008246039,0.012026507],"category_scores_gemma":[0.001879309,0.00055427273,0.00063382305,0.0013432935,0.0024895878,0.0045586447,0.0014420458,0.0019225103,0.0018132488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030007719,0.000015335101,0.00011797202,0.000016828953,0.0000036130984,0.000059694667,0.00014482535,0.0003246117,0.0007312392,0.9950523,0.00042106747,0.0030825895],"study_design_scores_gemma":[0.0000131655615,0.000017202387,0.00018720952,0.000007757681,0.0000035417465,0.00007970302,0.000056071396,0.0018612476,0.00074409053,0.994787,0.0022325674,0.000010468709],"about_ca_topic_score_codex":0.0010199861,"about_ca_topic_score_gemma":0.0011700613,"teacher_disagreement_score":0.012026507,"about_ca_system_score_codex":0.0015206547,"about_ca_system_score_gemma":0.00085721025,"threshold_uncertainty_score":0.040232718},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6798052,0.0013714352,0.28010172,0.0014837005,0.00044348266,0.0001509307,0.00083268946,0.00087094,0.03493995],"genre_scores_gemma":[0.9371825,0.00096723187,0.033629265,0.0004588223,0.0004060454,0.00029920813,0.0011360814,0.00039466593,0.025526274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813265,0.0005419912,0.00014263077,0.00035208877,0.0005867105,0.00024395001],"domain_scores_gemma":[0.9780092,0.014865773,0.0020856224,0.0017652842,0.0016516743,0.001622354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023082276,0.0008377495,0.0010834287,0.0033717956,0.001368207,0.002641232,0.0020815013,0.0018787957,0.007851092],"category_scores_gemma":[0.024270946,0.0009762667,0.0012739641,0.0021329161,0.0019551374,0.004149923,0.002192658,0.0026371942,0.0009766909],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002933003,0.0001314114,0.0028416826,0.00023709591,0.00005893533,0.001037657,0.0005703675,0.017859386,0.009007011,0.9441861,0.0027344034,0.021042608],"study_design_scores_gemma":[0.00006388062,0.000139458,0.0030577986,0.0001096266,0.000044353597,0.0013495173,0.00018031981,0.1481828,0.0034590089,0.83914924,0.004210041,0.00005392453],"about_ca_topic_score_codex":0.0005793665,"about_ca_topic_score_gemma":0.0006601007,"teacher_disagreement_score":0.007851092,"about_ca_system_score_codex":0.0012185032,"about_ca_system_score_gemma":0.00077918044,"threshold_uncertainty_score":0.026264548},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002496217,0.00052259717,0.06343903,0.011430312,0.0014079309,0.00026947472,0.11743816,0.054344486,0.7486517],"genre_scores_gemma":[0.043217916,0.0022360377,0.069535084,0.0031639866,0.0010747726,0.000723045,0.1705856,0.049848717,0.6596149],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995234,0.00007962482,0.0000390358,0.000104289014,0.00019953486,0.000054026474],"domain_scores_gemma":[0.9972792,0.0009863934,0.00016896926,0.00059834064,0.00067514426,0.00029195883],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00082721555,0.0012640998,0.0012499398,0.001933881,0.0012207614,0.0063147326,0.0030140108,0.0017795457,0.67286],"category_scores_gemma":[0.0046224548,0.00083412084,0.0009498056,0.0041102297,0.00089887757,0.0061093206,0.0022418066,0.0025818716,0.48899293],"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.00006273318,0.000044071217,0.00018268076,0.00024261743,0.000007589582,0.000050674553,0.00009373595,0.00036533902,0.0007114464,0.04357841,0.91839975,0.03626086],"study_design_scores_gemma":[0.000074309144,0.000020619718,0.0009224762,0.000092220565,0.000007664586,0.00018628674,0.00011593301,0.0030807895,0.0023501625,0.05267413,0.94043237,0.000043041262],"about_ca_topic_score_codex":0.009127233,"about_ca_topic_score_gemma":0.01026458,"teacher_disagreement_score":0.67286,"about_ca_system_score_codex":0.002648942,"about_ca_system_score_gemma":0.001477108,"threshold_uncertainty_score":0.46662545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8288275,0.0010959418,0.10886456,0.0020362083,0.0003466157,0.000040955885,0.0002854035,0.00044612217,0.05805673],"genre_scores_gemma":[0.9562892,0.00071129744,0.0215082,0.0003042328,0.00024983202,0.000062339175,0.00033648484,0.00032107317,0.02021732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943775,0.00014365325,0.000023682058,0.00012979252,0.00012688774,0.0001382143],"domain_scores_gemma":[0.99572045,0.0022282475,0.00038111096,0.00038351514,0.0004777607,0.0008088874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006508376,0.00065557606,0.0007704066,0.0017606919,0.0016979309,0.003397781,0.0014360688,0.0009921266,0.0056921025],"category_scores_gemma":[0.0042478815,0.0008211084,0.0006514023,0.0011651297,0.0022267979,0.0037852328,0.002434141,0.001978561,0.00071365084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010086251,0.00003382291,0.0012612637,0.000079141246,0.000008687916,0.00012439984,0.00050183124,0.0033328151,0.003908007,0.9823961,0.002239474,0.0060135447],"study_design_scores_gemma":[0.000020283735,0.000020062953,0.00090010505,0.000030551357,0.00001307677,0.00015576994,0.00029903735,0.015413772,0.001718006,0.9774889,0.003927572,0.000012924285],"about_ca_topic_score_codex":0.0015984906,"about_ca_topic_score_gemma":0.0016127256,"teacher_disagreement_score":0.0056921025,"about_ca_system_score_codex":0.0015205279,"about_ca_system_score_gemma":0.00054825837,"threshold_uncertainty_score":0.019041955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6969633,0.003179366,0.101695925,0.06349928,0.0006376123,0.00017452559,0.0017602849,0.0008823402,0.13120729],"genre_scores_gemma":[0.9902436,0.0006893332,0.0034028618,0.00069551903,0.00048544476,0.00006035517,0.000298063,0.00012064963,0.004004236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953656,0.0018891401,0.00018925969,0.001240043,0.00080449984,0.00051149726],"domain_scores_gemma":[0.96548194,0.021877654,0.0038416812,0.003416256,0.002310911,0.0030715724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004493019,0.0004076897,0.0015492565,0.0021931776,0.0023817827,0.007899063,0.0017567748,0.0035009624,0.011366777],"category_scores_gemma":[0.04744826,0.0010128119,0.00076750334,0.0020524296,0.009785654,0.018871328,0.0034047458,0.0035007144,0.0013607317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009440496,0.00004667906,0.005169575,0.0001231758,0.00004769505,0.00037484526,0.00092511805,0.0013309666,0.00045654675,0.97594565,0.00529444,0.010190944],"study_design_scores_gemma":[0.000026204709,0.00002473676,0.0023525306,0.000039619317,0.000030033187,0.0006370113,0.0011023218,0.0048384424,0.0004260002,0.9855886,0.0048956815,0.0000387361],"about_ca_topic_score_codex":0.0012656352,"about_ca_topic_score_gemma":0.0008395939,"teacher_disagreement_score":0.011366777,"about_ca_system_score_codex":0.0015647857,"about_ca_system_score_gemma":0.000772246,"threshold_uncertainty_score":0.038025677},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027563309,0.00056027505,0.12061327,0.005823994,0.001206082,0.00019918411,0.0998664,0.060551383,0.708423],"genre_scores_gemma":[0.042240698,0.0020803653,0.09832152,0.0021144124,0.001046711,0.0005616981,0.17359795,0.06992983,0.61010677],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996277,0.000051981206,0.00003126131,0.00007611143,0.0001633824,0.000049540107],"domain_scores_gemma":[0.9984952,0.0004891434,0.00010644881,0.00035968953,0.0003830803,0.00016644511],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00053879205,0.001168094,0.0010066289,0.0022343316,0.0010428246,0.0048974776,0.0025191251,0.0013201677,0.5694078],"category_scores_gemma":[0.0030746183,0.0008203451,0.0008057591,0.0037597138,0.00067488546,0.005653683,0.0018554184,0.0026041735,0.41058263],"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.00005996974,0.00003408934,0.00015240614,0.00021428773,0.000007656891,0.00004058019,0.00009701642,0.00038094074,0.0010949586,0.05542219,0.8981038,0.044392146],"study_design_scores_gemma":[0.00003924436,0.000015711712,0.0008282132,0.00006606455,0.000009420677,0.00016988904,0.000068739966,0.0025908656,0.0036731872,0.05644835,0.93605024,0.000040089435],"about_ca_topic_score_codex":0.006252558,"about_ca_topic_score_gemma":0.006643658,"teacher_disagreement_score":0.43059218,"about_ca_system_score_codex":0.0020782996,"about_ca_system_score_gemma":0.0010011723,"threshold_uncertainty_score":0.6141875},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015760262,0.010704113,0.017861161,0.040347565,0.3146622,0.00056787446,0.020161744,0.002748273,0.59137106],"genre_scores_gemma":[0.009917684,0.005417431,0.0054601077,0.009537016,0.04390224,0.00039050705,0.013365381,0.0020114994,0.9099982],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999164,0.00013696235,0.00005394579,0.00015274592,0.000422466,0.000069927446],"domain_scores_gemma":[0.99330187,0.0012145693,0.0002279774,0.00072254345,0.0037351297,0.00079795043],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014521588,0.0011032011,0.00072058593,0.0038028571,0.002600772,0.0029670931,0.0013656438,0.0008539879,0.42421418],"category_scores_gemma":[0.014803547,0.00030961298,0.0006977023,0.0025198332,0.00068878237,0.0029517498,0.002127541,0.0033529021,0.28900605],"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.000023768642,0.000017796985,0.0000818243,0.00008163847,0.0000024347398,0.000026597792,0.00003849237,0.00006704084,0.00010632788,0.007154257,0.9647404,0.027659437],"study_design_scores_gemma":[0.000005294748,0.000010975441,0.0002489316,0.000101556834,0.0000030895833,0.00003971311,0.00004580119,0.000045120658,0.00015027674,0.008282333,0.9910595,0.000007366076],"about_ca_topic_score_codex":0.0040461863,"about_ca_topic_score_gemma":0.0047768834,"teacher_disagreement_score":0.5757858,"about_ca_system_score_codex":0.0020682337,"about_ca_system_score_gemma":0.0017020062,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18713944,0.013814768,0.5354586,0.011635665,0.0018017477,0.000322637,0.0044773575,0.005157271,0.24019247],"genre_scores_gemma":[0.74995464,0.0073947404,0.18385978,0.0025100694,0.0024069862,0.0007051977,0.0037276044,0.0017956749,0.047645353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968863,0.0005361439,0.000105543295,0.00085011247,0.00086459,0.0007573694],"domain_scores_gemma":[0.9802182,0.0137991,0.00074831827,0.0025695679,0.0011971191,0.0014677079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023930226,0.0026831478,0.0020172093,0.005993534,0.0028125716,0.0068224785,0.0056093344,0.0031458775,0.023644846],"category_scores_gemma":[0.014181236,0.0013836313,0.0016421512,0.0048118597,0.0036362663,0.009788108,0.0046560424,0.0064890315,0.0046671047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017150607,0.0005804286,0.0051218565,0.001505958,0.0002838632,0.0005042057,0.0008530975,0.11207543,0.046333164,0.641627,0.062437087,0.12696281],"study_design_scores_gemma":[0.00014356003,0.00024771155,0.0045987405,0.00038378336,0.00032642667,0.0006760862,0.00024553938,0.28677282,0.015993953,0.6370895,0.053314414,0.0002074924],"about_ca_topic_score_codex":0.0028473458,"about_ca_topic_score_gemma":0.0054752617,"teacher_disagreement_score":0.023644846,"about_ca_system_score_codex":0.0052648215,"about_ca_system_score_gemma":0.0014938918,"threshold_uncertainty_score":0.079099834},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020018965,0.0002963608,0.1741042,0.0032997383,0.0012016747,0.00022439161,0.10929198,0.09153028,0.61804944],"genre_scores_gemma":[0.041778885,0.0011719528,0.14381965,0.0021660791,0.0010699477,0.00069426064,0.19086634,0.12127095,0.49716192],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941015,0.00009336506,0.000051126717,0.00010597986,0.00028061264,0.00005881641],"domain_scores_gemma":[0.99824286,0.0005640636,0.00010003716,0.00045377607,0.0004962645,0.00014305332],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006577533,0.0012855326,0.0010162533,0.0021932411,0.0010658395,0.0051813326,0.0026962648,0.0012215793,0.52347547],"category_scores_gemma":[0.0040753754,0.0008805702,0.0009825933,0.0037704469,0.0006294702,0.006348528,0.0020881612,0.0023507758,0.3866744],"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.00005931335,0.000028717315,0.00014214605,0.00022856185,0.000008326007,0.000054739445,0.00009648059,0.00039879495,0.0011854658,0.06709246,0.89111775,0.039587338],"study_design_scores_gemma":[0.000042917214,0.000010905386,0.00042969408,0.0000524651,0.0000064004694,0.00017561905,0.000046035853,0.002883798,0.0042504193,0.06421225,0.9278566,0.000032926673],"about_ca_topic_score_codex":0.0028881114,"about_ca_topic_score_gemma":0.0046226196,"teacher_disagreement_score":0.52347547,"about_ca_system_score_codex":0.0015921125,"about_ca_system_score_gemma":0.0008868948,"threshold_uncertainty_score":0.6797044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6055572,0.0036072535,0.12932692,0.006624897,0.00062735373,0.000107341395,0.0009221692,0.00047628232,0.2527505],"genre_scores_gemma":[0.97268516,0.00069119775,0.0081194565,0.00036878823,0.00028309296,0.00007400657,0.00022960379,0.000053897595,0.017494727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991855,0.00021461942,0.000053263357,0.00023440774,0.00014991855,0.00016229194],"domain_scores_gemma":[0.99735934,0.0013470185,0.0004687454,0.00019864783,0.00023832853,0.00038781686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010951025,0.00054146064,0.0008319371,0.0014401849,0.0029612249,0.0044869212,0.00077421,0.0012569268,0.0076629184],"category_scores_gemma":[0.0033423954,0.0006791008,0.0007845792,0.0017068052,0.002712349,0.004655764,0.0026575185,0.0024248012,0.00091422244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078007484,0.000024390616,0.00063732796,0.00004600853,0.000014256652,0.000115450646,0.00014244742,0.00051281333,0.00078940415,0.99007154,0.0015223726,0.006045955],"study_design_scores_gemma":[0.000044341592,0.000021675425,0.0005150201,0.000010688606,0.000020037163,0.00025723552,0.000087492524,0.0028096845,0.0005516833,0.9921942,0.0034762751,0.000011644041],"about_ca_topic_score_codex":0.0009035738,"about_ca_topic_score_gemma":0.0007339365,"teacher_disagreement_score":0.0076629184,"about_ca_system_score_codex":0.0010197156,"about_ca_system_score_gemma":0.00055757543,"threshold_uncertainty_score":0.025635004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74356586,0.0005929136,0.19576582,0.0019412785,0.0001460509,0.00015019753,0.00071799906,0.0010591946,0.0560607],"genre_scores_gemma":[0.9441015,0.0004397496,0.036111772,0.0003140999,0.00009443084,0.0000879854,0.00095882296,0.0003145057,0.017577177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990397,0.00020903564,0.000041957468,0.00022980066,0.00017788282,0.0003015515],"domain_scores_gemma":[0.9956809,0.002146866,0.00072973187,0.0006907862,0.0002483254,0.00050341507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070786796,0.0006870152,0.0013853868,0.0010619952,0.0016787092,0.0020595666,0.0019355136,0.0016809818,0.010089568],"category_scores_gemma":[0.0061205872,0.0010786502,0.0012094001,0.0011579468,0.002582369,0.0041337796,0.0033817608,0.0021399204,0.0009884151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004560398,0.0002200886,0.0029927639,0.0003704432,0.000065389344,0.0009984393,0.0014856753,0.030833276,0.0055976156,0.90670794,0.009058115,0.041214246],"study_design_scores_gemma":[0.00006472042,0.000072516275,0.0015266825,0.000049932238,0.000055124186,0.00057880743,0.00062551105,0.05578768,0.003313995,0.93208975,0.0057990504,0.000036310194],"about_ca_topic_score_codex":0.0032517186,"about_ca_topic_score_gemma":0.0032924835,"teacher_disagreement_score":0.010089568,"about_ca_system_score_codex":0.0006825774,"about_ca_system_score_gemma":0.0006490082,"threshold_uncertainty_score":0.033752978},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25011483,0.0024894108,0.6536037,0.001274146,0.0004717714,0.0001937694,0.0004754607,0.00097159366,0.09040531],"genre_scores_gemma":[0.7856128,0.0027706043,0.1735361,0.00043798907,0.00048467974,0.00015038611,0.0006437144,0.0006941122,0.035669684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994784,0.00014686279,0.000034315017,0.00013164985,0.00012427299,0.00008451527],"domain_scores_gemma":[0.9964193,0.0022609602,0.00038711025,0.00030013447,0.0003005194,0.00033192628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082657696,0.0010792583,0.0012790072,0.0054252245,0.002062145,0.0024207698,0.0018549938,0.0019909884,0.012440915],"category_scores_gemma":[0.006248654,0.0008945833,0.001424532,0.00609519,0.0027707918,0.0040040454,0.0029486318,0.0026667363,0.00087594916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006973891,0.0000665626,0.001350336,0.00016115411,0.00002297849,0.0004701029,0.0007158086,0.045435984,0.0020046153,0.91058433,0.0041952175,0.034923207],"study_design_scores_gemma":[0.000016257056,0.00004305155,0.0005198471,0.00007469122,0.000023852723,0.00025036436,0.00023747102,0.16730943,0.0006221501,0.8240394,0.0068371207,0.000026351016],"about_ca_topic_score_codex":0.0034948708,"about_ca_topic_score_gemma":0.004159523,"teacher_disagreement_score":0.012440915,"about_ca_system_score_codex":0.0016033349,"about_ca_system_score_gemma":0.00047712607,"threshold_uncertainty_score":0.041619003},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8832438,0.00040511045,0.077324964,0.0007678721,0.00007079925,0.000044040316,0.00094682473,0.0004619043,0.03673468],"genre_scores_gemma":[0.9799009,0.0001952968,0.008158436,0.00013062383,0.00010100472,0.000060918544,0.0007680755,0.00010902795,0.010575663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906856,0.00016511392,0.00005490358,0.0002296327,0.00021633513,0.00026556794],"domain_scores_gemma":[0.994863,0.003280071,0.0004730375,0.00038110808,0.00022890781,0.00077383954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082962395,0.00046725495,0.0006038032,0.0019514451,0.0017776595,0.0036723607,0.0013871553,0.00064714625,0.010711509],"category_scores_gemma":[0.0037486015,0.0008102039,0.00063255726,0.0015030783,0.0020932716,0.004752276,0.0015563545,0.0012300115,0.0005228818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028428118,0.000107023814,0.0034211369,0.00009604281,0.00004455795,0.00024838164,0.000759168,0.0024902786,0.0033087863,0.97400224,0.0032350263,0.012003018],"study_design_scores_gemma":[0.00010627461,0.000070182025,0.0048237382,0.000046090187,0.00007802678,0.0005502736,0.00054851547,0.018443586,0.004469215,0.96394813,0.006871601,0.000044270764],"about_ca_topic_score_codex":0.0010907245,"about_ca_topic_score_gemma":0.0013303966,"teacher_disagreement_score":0.010711509,"about_ca_system_score_codex":0.0017335477,"about_ca_system_score_gemma":0.00064537395,"threshold_uncertainty_score":0.035833597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9175661,0.0003075201,0.061900616,0.0008248145,0.00016156731,0.000061085884,0.00018402713,0.00018346916,0.018810712],"genre_scores_gemma":[0.9882207,0.00013437183,0.00491373,0.00009185673,0.000076998585,0.000032366133,0.00009410539,0.00007810805,0.0063577266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995646,0.00014812754,0.000019941665,0.00007327,0.00011666582,0.00007747318],"domain_scores_gemma":[0.9955778,0.0021763921,0.0006431394,0.00035162558,0.00033190384,0.0009191002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068263104,0.0005509153,0.0009792999,0.0020347338,0.0009223392,0.0018950369,0.0014874834,0.0011503509,0.0063456646],"category_scores_gemma":[0.006716516,0.0007198698,0.00060169224,0.00079060247,0.0023360483,0.0026259993,0.0016362969,0.0010897575,0.00037733364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003858094,0.00013583322,0.0020041957,0.000117257245,0.000056301807,0.0010517184,0.0005471088,0.08693123,0.008938379,0.8912512,0.0024675028,0.0061134277],"study_design_scores_gemma":[0.000057106306,0.00006225669,0.0010970216,0.000019417885,0.000022269489,0.00027277746,0.00027749562,0.3008521,0.0012310701,0.69514924,0.00092940585,0.000029784582],"about_ca_topic_score_codex":0.001850589,"about_ca_topic_score_gemma":0.0016920151,"teacher_disagreement_score":0.0063456646,"about_ca_system_score_codex":0.00083239545,"about_ca_system_score_gemma":0.00038849603,"threshold_uncertainty_score":0.021228373},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74685204,0.00061044964,0.21204852,0.0067209657,0.00017235182,0.00028507184,0.0029816963,0.0030747647,0.02725412],"genre_scores_gemma":[0.956369,0.0003934319,0.029572312,0.00090275274,0.00020310572,0.00015901348,0.0031869295,0.00073210057,0.008481391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951865,0.00092809036,0.00042923487,0.0016903684,0.000986434,0.00077941065],"domain_scores_gemma":[0.9444982,0.04086083,0.0037248028,0.005953552,0.0014677405,0.0034948396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028985431,0.002041011,0.0032123898,0.0018567629,0.003731974,0.009363857,0.0039823004,0.0048625255,0.015413519],"category_scores_gemma":[0.029520638,0.0027298022,0.0029489389,0.0024580387,0.004345626,0.023157295,0.00682053,0.008306177,0.0023802854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005831688,0.0016561088,0.018484004,0.0019167841,0.00072274654,0.0033455177,0.004004763,0.07295468,0.039973967,0.77068055,0.019574614,0.060854558],"study_design_scores_gemma":[0.00024322305,0.00013537453,0.00093170267,0.00007122235,0.00012365339,0.00061862415,0.0006803856,0.07346383,0.00711356,0.91429,0.0022664203,0.00006206338],"about_ca_topic_score_codex":0.0013362494,"about_ca_topic_score_gemma":0.0014685014,"teacher_disagreement_score":0.015413519,"about_ca_system_score_codex":0.0017571888,"about_ca_system_score_gemma":0.0013721681,"threshold_uncertainty_score":0.051563382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45585623,0.0019352962,0.21881612,0.0033964862,0.0006191876,0.00007852367,0.0005634693,0.0005459457,0.31818876],"genre_scores_gemma":[0.91006917,0.00104875,0.02270514,0.0006399899,0.00055689365,0.00010693178,0.00048779076,0.0003791976,0.06400618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986411,0.00030687786,0.000096967415,0.0003110364,0.0004122009,0.00023189087],"domain_scores_gemma":[0.99734795,0.0014072754,0.00027174034,0.00023015353,0.00036127862,0.00038151495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007533313,0.0009393038,0.0014048136,0.003464882,0.002621992,0.006044983,0.0013977428,0.0010540547,0.015487882],"category_scores_gemma":[0.0034248093,0.0009106316,0.0014067045,0.002481403,0.0042532943,0.0071712034,0.0040753577,0.0039542466,0.0022352396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020910391,0.000015086763,0.000090747046,0.000018232957,0.0000050400677,0.0000823029,0.00021738214,0.00027533455,0.0003581263,0.99615026,0.00040308773,0.0023635752],"study_design_scores_gemma":[0.000009124111,0.000015757956,0.00021471764,0.000015186713,0.0000142333565,0.0001666129,0.00019087878,0.0022018717,0.00056311203,0.9937856,0.0028120691,0.000010819186],"about_ca_topic_score_codex":0.0010611957,"about_ca_topic_score_gemma":0.0010667705,"teacher_disagreement_score":0.015487882,"about_ca_system_score_codex":0.0014956276,"about_ca_system_score_gemma":0.0004972386,"threshold_uncertainty_score":0.051812112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82523346,0.0020026967,0.12826204,0.0015756666,0.00006939605,0.00009583049,0.001056207,0.00082999223,0.040874686],"genre_scores_gemma":[0.9760884,0.0009363702,0.017291954,0.0001382438,0.0001413595,0.00018712952,0.0010679527,0.00026292654,0.0038856429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980405,0.00069469854,0.00007101138,0.000356415,0.00046660987,0.00037077698],"domain_scores_gemma":[0.97805095,0.01612427,0.0017733112,0.0010717827,0.0014273674,0.0015523834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020356362,0.0007572792,0.0011867863,0.0046384367,0.0025402484,0.0024696493,0.0020816093,0.001027179,0.0060191867],"category_scores_gemma":[0.018698413,0.0008134647,0.0007571147,0.0030016333,0.0039944383,0.0057426756,0.0023135077,0.0021700643,0.0007766907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055233843,0.00020200781,0.013552104,0.00029698832,0.00008731848,0.00035025514,0.0019109335,0.04146602,0.003135986,0.9062585,0.008037899,0.02414968],"study_design_scores_gemma":[0.00006110113,0.00020788622,0.012063949,0.00018447352,0.00010964691,0.00108042,0.0014878872,0.342091,0.0055761198,0.62901676,0.007989792,0.00013100958],"about_ca_topic_score_codex":0.0052355896,"about_ca_topic_score_gemma":0.0035652742,"teacher_disagreement_score":0.0060191867,"about_ca_system_score_codex":0.0026886335,"about_ca_system_score_gemma":0.00091322867,"threshold_uncertainty_score":0.020136118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8955769,0.00021576411,0.065957256,0.00026781435,0.00011279594,0.00007461552,0.00047936884,0.0010300807,0.036285434],"genre_scores_gemma":[0.9783588,0.00011602131,0.014828882,0.00007226469,0.000028662673,0.00004024472,0.0006174575,0.00021590323,0.0057217176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993129,0.00011408319,0.000034819965,0.00019800794,0.00010692388,0.00023322518],"domain_scores_gemma":[0.9972076,0.00096219947,0.00043282995,0.0007424205,0.00018564875,0.00046933113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002402064,0.0003940578,0.0004854477,0.0008002941,0.0008667256,0.0015597793,0.0011755516,0.0007089346,0.008319822],"category_scores_gemma":[0.0023206782,0.0004630165,0.00058440753,0.0010316544,0.00092637824,0.0013974706,0.0009627476,0.0007654403,0.00075524795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002714267,0.0007871568,0.013517788,0.00058701815,0.00017008766,0.0051904987,0.0017563307,0.13851954,0.22079057,0.45002267,0.011543551,0.15440062],"study_design_scores_gemma":[0.000242315,0.00030575975,0.014286799,0.00006795318,0.00014626898,0.002808699,0.00095121557,0.20997873,0.064322524,0.6875893,0.019190602,0.00010992558],"about_ca_topic_score_codex":0.001519496,"about_ca_topic_score_gemma":0.0017080259,"teacher_disagreement_score":0.008319822,"about_ca_system_score_codex":0.0007820607,"about_ca_system_score_gemma":0.0004492465,"threshold_uncertainty_score":0.027832568},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5797981,0.0009148361,0.40329942,0.0008765361,0.00004844583,0.0000696846,0.00049458025,0.00056052714,0.013937917],"genre_scores_gemma":[0.89253926,0.0005143693,0.10001293,0.00034283698,0.000046679103,0.00013686884,0.0005616885,0.0001061126,0.005739236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891937,0.00029652033,0.000060206665,0.00035382013,0.0002215601,0.00014843438],"domain_scores_gemma":[0.99305797,0.0036282756,0.0009317423,0.00140006,0.0004923934,0.00048954005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001105297,0.0004462873,0.0005301794,0.001004445,0.0010240196,0.0015072562,0.0014235935,0.0008643006,0.003270796],"category_scores_gemma":[0.0066246996,0.0006761215,0.00075863925,0.0012624977,0.0018481171,0.0046385294,0.0024453844,0.0015577088,0.0004097711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003626037,0.00009858635,0.004890904,0.0002979879,0.00008596361,0.00042581483,0.0005790402,0.03249235,0.016258786,0.91068685,0.0020935799,0.031727605],"study_design_scores_gemma":[0.000056357618,0.00007728058,0.0013083018,0.000049207018,0.000045990906,0.0004102136,0.00021727664,0.061216287,0.0076777753,0.923167,0.005744153,0.000030084984],"about_ca_topic_score_codex":0.0011881691,"about_ca_topic_score_gemma":0.0014570589,"teacher_disagreement_score":0.003270796,"about_ca_system_score_codex":0.0012366882,"about_ca_system_score_gemma":0.0005457485,"threshold_uncertainty_score":0.010941923},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18480542,0.007685204,0.55111784,0.009635159,0.0012021416,0.00025592584,0.0071503543,0.002990014,0.23515803],"genre_scores_gemma":[0.7221006,0.0039346716,0.21834202,0.0020477101,0.0014329053,0.00079908926,0.0060405317,0.0025400696,0.04276245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99563223,0.0009801425,0.00018715089,0.00089685025,0.0012327812,0.0010707779],"domain_scores_gemma":[0.9685789,0.023098987,0.0010430124,0.0037327758,0.0020104062,0.0015358543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047092596,0.0019119758,0.001982166,0.0046898504,0.0024956854,0.0070391023,0.006820495,0.002784176,0.036539312],"category_scores_gemma":[0.030446557,0.0014661456,0.0020837074,0.0040831477,0.003724682,0.014950829,0.0061372253,0.007500501,0.008418616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067050953,0.00024098506,0.0029965602,0.00064203073,0.000117872,0.00015980327,0.00056369865,0.03737636,0.002644898,0.86347955,0.040346537,0.050761268],"study_design_scores_gemma":[0.000055667508,0.000056047214,0.0011839239,0.00019340689,0.00008411324,0.00018080068,0.00014349112,0.064235434,0.0021371453,0.9219306,0.009731209,0.000068149275],"about_ca_topic_score_codex":0.0026787515,"about_ca_topic_score_gemma":0.005613434,"teacher_disagreement_score":0.036539312,"about_ca_system_score_codex":0.004777423,"about_ca_system_score_gemma":0.0023234377,"threshold_uncertainty_score":0.12223619},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046280507,0.007864828,0.005935806,0.056462944,0.84142494,0.00013438365,0.0044147777,0.0013299886,0.081969604],"genre_scores_gemma":[0.012198574,0.014242511,0.010172723,0.0406612,0.1681383,0.00038902758,0.009111128,0.0023154144,0.74277115],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99701715,0.00055728434,0.00026327284,0.00057754363,0.001325699,0.0002590409],"domain_scores_gemma":[0.99470115,0.0014178983,0.0002902921,0.0004988178,0.002609026,0.00048283354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017351073,0.002845958,0.0028800126,0.005857484,0.003426351,0.0042716605,0.0040949984,0.004591945,0.25157103],"category_scores_gemma":[0.0123760775,0.0013705251,0.002898386,0.004493068,0.0018900414,0.004493275,0.0026891334,0.004965302,0.10447935],"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.000021360083,0.000010034985,0.0000314744,0.00011808794,0.00001492997,0.00006738485,0.000011278582,0.00009244331,0.000092634036,0.0029149703,0.9916578,0.004967655],"study_design_scores_gemma":[0.000037245,0.000039704195,0.0008266767,0.00017248838,0.000042981803,0.00030121522,0.000035425124,0.0006434564,0.00035293828,0.016277151,0.98121166,0.000059095863],"about_ca_topic_score_codex":0.0142645035,"about_ca_topic_score_gemma":0.024410998,"teacher_disagreement_score":0.25157103,"about_ca_system_score_codex":0.0057938844,"about_ca_system_score_gemma":0.0021651129,"threshold_uncertainty_score":0.8415889},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8601578,0.00040273604,0.12228866,0.00064687553,0.00004512501,0.000040794348,0.00038934578,0.0004260457,0.015602627],"genre_scores_gemma":[0.98949337,0.00031075696,0.0061443364,0.00010289758,0.000107619075,0.00010270269,0.00046344183,0.00021786742,0.0030569518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991549,0.0002194271,0.000020838903,0.00025643012,0.00018645317,0.00016191548],"domain_scores_gemma":[0.99218035,0.0046526305,0.0006919796,0.0012250089,0.00052823196,0.00072182436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014860231,0.00044483706,0.0007448181,0.0014773175,0.00082774943,0.0015596969,0.0015044457,0.00064498314,0.005450588],"category_scores_gemma":[0.013717139,0.0003814468,0.00060183735,0.00058530166,0.0022077383,0.0032508392,0.0017123204,0.0015057456,0.00065380154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008141531,0.00029744237,0.031732354,0.00034488342,0.00013251317,0.00090345065,0.0014104831,0.10731158,0.04720715,0.7525703,0.007770704,0.049505107],"study_design_scores_gemma":[0.000062017956,0.00023001552,0.01956577,0.00007313964,0.00006510251,0.0012871822,0.00056596467,0.50456184,0.019899301,0.4498588,0.0037227245,0.00010814081],"about_ca_topic_score_codex":0.0009654735,"about_ca_topic_score_gemma":0.00064888387,"teacher_disagreement_score":0.005450588,"about_ca_system_score_codex":0.0014540725,"about_ca_system_score_gemma":0.0003424431,"threshold_uncertainty_score":0.018234015},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3003108,0.0022979935,0.44416964,0.0060766707,0.0006641422,0.00016183921,0.000867037,0.0005462605,0.24490559],"genre_scores_gemma":[0.8851247,0.0023641067,0.078724064,0.0019505647,0.00070434646,0.00036088892,0.0013110841,0.0002731174,0.029187204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989973,0.00019442195,0.000047050384,0.0003239147,0.00018959929,0.0002477744],"domain_scores_gemma":[0.99700147,0.0016615357,0.00026651027,0.000422651,0.00032482014,0.00032309187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000957408,0.0008267211,0.0007793185,0.0012547402,0.002145588,0.0033055474,0.0012503094,0.0012691983,0.008245115],"category_scores_gemma":[0.005034833,0.00052828575,0.00090949656,0.0011288841,0.0040756986,0.0081546055,0.0029927052,0.0028611461,0.0017259307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007939795,0.000023356137,0.0010445003,0.000077911645,0.000012373819,0.00009009855,0.00017690794,0.0031372267,0.0013656563,0.9820426,0.0030123063,0.008937514],"study_design_scores_gemma":[0.000012187485,0.000017362576,0.0004860902,0.000028175042,0.000015565643,0.00009730179,0.00015542362,0.007443875,0.0010646686,0.98172474,0.008937434,0.000017324897],"about_ca_topic_score_codex":0.002128904,"about_ca_topic_score_gemma":0.0027307759,"teacher_disagreement_score":0.008245115,"about_ca_system_score_codex":0.0013998303,"about_ca_system_score_gemma":0.00072996574,"threshold_uncertainty_score":0.027582645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6815648,0.00084747863,0.15530255,0.0019297596,0.0005097797,0.00015845282,0.0016410998,0.0007058811,0.15734017],"genre_scores_gemma":[0.97929573,0.00046490988,0.010244077,0.00033020222,0.00016065982,0.00007740913,0.00074671983,0.00007844,0.008601818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902356,0.00013719067,0.00013732197,0.00022784714,0.0002589298,0.00021524129],"domain_scores_gemma":[0.99746037,0.000784188,0.00047809875,0.0006450527,0.00035101306,0.00028127668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001022262,0.0007881284,0.0012492376,0.0011548179,0.0020336988,0.0023356613,0.0007631945,0.0011515717,0.005965161],"category_scores_gemma":[0.002239539,0.00050654757,0.0012706474,0.001104211,0.003026941,0.0036646414,0.0029077565,0.0018186694,0.0015782965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026158255,0.000044254473,0.0016301882,0.00013916717,0.000051043175,0.0003887345,0.00053571945,0.00053070555,0.0058179065,0.9717012,0.0024116335,0.016487865],"study_design_scores_gemma":[0.00007101063,0.000057448382,0.0012767694,0.00001848172,0.000036163165,0.00064797763,0.000257059,0.0011233874,0.0030567867,0.9859622,0.007465984,0.000026689062],"about_ca_topic_score_codex":0.0003419764,"about_ca_topic_score_gemma":0.00047103854,"teacher_disagreement_score":0.005965161,"about_ca_system_score_codex":0.0003977434,"about_ca_system_score_gemma":0.00058188505,"threshold_uncertainty_score":0.019955516},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7329223,0.00021509099,0.20168586,0.00012939282,0.00006788106,0.000096831944,0.00029475728,0.00039562458,0.06419224],"genre_scores_gemma":[0.92957896,0.00021898386,0.056224924,0.00009389312,0.00002422219,0.000116533716,0.00076220906,0.000114886985,0.012865391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963915,0.00004825178,0.00001659924,0.000105305975,0.00009300428,0.00009781684],"domain_scores_gemma":[0.99915445,0.00018903309,0.00014977012,0.00028511562,0.00008446991,0.00013725735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018879853,0.0002625285,0.00027336334,0.00035546793,0.00045320063,0.0007884868,0.0009342306,0.00030334422,0.0055136234],"category_scores_gemma":[0.001277475,0.00029672022,0.00046159176,0.00041645422,0.0008244884,0.0012082275,0.001730844,0.0011154021,0.00078574155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003225178,0.00019624176,0.0051412596,0.00017673327,0.00004624974,0.00078798673,0.0013345955,0.021126352,0.043466575,0.85981756,0.0021785498,0.06540529],"study_design_scores_gemma":[0.0001331045,0.00040363363,0.006594347,0.00009832216,0.00013371532,0.00084561924,0.0008002158,0.09192501,0.04629743,0.811266,0.041462664,0.00003989907],"about_ca_topic_score_codex":0.00092010933,"about_ca_topic_score_gemma":0.0017429646,"teacher_disagreement_score":0.0055136234,"about_ca_system_score_codex":0.00046909993,"about_ca_system_score_gemma":0.00036010015,"threshold_uncertainty_score":0.018444955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.614461,0.0039384947,0.24688144,0.0022800823,0.0004539476,0.00032247626,0.0018054404,0.00040882474,0.12944828],"genre_scores_gemma":[0.862987,0.0016608099,0.089636594,0.0004136289,0.00024568036,0.00017387883,0.0017484836,0.0002173131,0.04291656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972993,0.00005047508,0.000015382318,0.00006526948,0.00005798813,0.00008084693],"domain_scores_gemma":[0.9992343,0.00032638444,0.00015031944,0.0000795241,0.00007785413,0.00013159735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030119382,0.0003515822,0.0005771588,0.0013297139,0.0013243897,0.0020453308,0.00092545187,0.0009776601,0.009333418],"category_scores_gemma":[0.0014634355,0.00058550393,0.000880316,0.0017827937,0.0011453955,0.0023619507,0.0014335554,0.001397426,0.0012224003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011295316,0.0001077749,0.0016392004,0.00019441154,0.000022649005,0.000681223,0.0013415515,0.004944691,0.007850683,0.94927806,0.006005251,0.027821617],"study_design_scores_gemma":[0.000026320846,0.000030132276,0.0017568413,0.000063126696,0.000040902352,0.0006072292,0.0007332829,0.016933357,0.0014695044,0.96638453,0.011940068,0.000014712228],"about_ca_topic_score_codex":0.0015697193,"about_ca_topic_score_gemma":0.0023987142,"teacher_disagreement_score":0.009333418,"about_ca_system_score_codex":0.0006150092,"about_ca_system_score_gemma":0.00031851538,"threshold_uncertainty_score":0.031223416},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67530274,0.0014087097,0.2057418,0.0027707492,0.00040547532,0.00018292372,0.0009824035,0.0006723463,0.1125329],"genre_scores_gemma":[0.91052437,0.0010839535,0.03595938,0.00052592036,0.00028090848,0.00009778313,0.00091603084,0.0003009245,0.050310772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925464,0.00021381561,0.000031648713,0.00016426083,0.00012205418,0.00021352097],"domain_scores_gemma":[0.99415684,0.0034748886,0.00057993596,0.00035036338,0.00035886155,0.0010791206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007883643,0.0007814953,0.0014135164,0.0019248055,0.0032787605,0.0028886236,0.0014738552,0.001984978,0.01000926],"category_scores_gemma":[0.0046227113,0.0010607556,0.0011994621,0.001655081,0.0022023125,0.0048708925,0.0028831132,0.00308687,0.0010937471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017033957,0.0000690439,0.00083569705,0.00011914321,0.000022333463,0.0004230912,0.0007060157,0.0077841873,0.0011095793,0.97772104,0.0034860948,0.007553516],"study_design_scores_gemma":[0.00005156183,0.000036508216,0.00034415704,0.00005796014,0.00002331913,0.00021581411,0.00031760946,0.027590211,0.00044074262,0.96676517,0.0041390355,0.000017767974],"about_ca_topic_score_codex":0.0036655331,"about_ca_topic_score_gemma":0.006067435,"teacher_disagreement_score":0.01000926,"about_ca_system_score_codex":0.0016914166,"about_ca_system_score_gemma":0.0007253983,"threshold_uncertainty_score":0.03348428},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.891688,0.0005018017,0.079546176,0.00035009108,0.000039758746,0.000034363926,0.00028927188,0.0002631094,0.02728743],"genre_scores_gemma":[0.98214173,0.00030472587,0.014422565,0.00011645347,0.000034542034,0.0000343789,0.00028430292,0.00007451543,0.0025868372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951875,0.00007847885,0.000021804017,0.000121222576,0.0001015678,0.00015828146],"domain_scores_gemma":[0.99696225,0.00151862,0.00046486678,0.00048756428,0.00020352071,0.0003632806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004653958,0.0003944156,0.00029860713,0.0013696416,0.0008104626,0.0012854541,0.0007874577,0.0003290137,0.0027761648],"category_scores_gemma":[0.003074991,0.00033180302,0.0004705276,0.0009622176,0.0020605656,0.001982114,0.0014602329,0.0010175843,0.00021444175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006964251,0.00026197138,0.041220315,0.00027627213,0.00008546962,0.00048474927,0.0013244114,0.08336797,0.039645962,0.75611496,0.004444832,0.07207662],"study_design_scores_gemma":[0.00007048327,0.0001476254,0.020990632,0.00008206888,0.00008809719,0.0009050568,0.0006352418,0.19909503,0.019621154,0.74627656,0.012009612,0.000078551515],"about_ca_topic_score_codex":0.0025405118,"about_ca_topic_score_gemma":0.0028938393,"teacher_disagreement_score":0.0027761648,"about_ca_system_score_codex":0.001493554,"about_ca_system_score_gemma":0.00059480837,"threshold_uncertainty_score":0.010836601},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62709224,0.0011640853,0.31304017,0.003712037,0.00020200778,0.00023031388,0.0015467876,0.0008708492,0.052141454],"genre_scores_gemma":[0.9595966,0.00042672426,0.03254961,0.0006079591,0.0001820744,0.00024791533,0.00076848833,0.0001205499,0.0055001765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979372,0.0004891911,0.00020364787,0.00058061455,0.00040355173,0.00038583894],"domain_scores_gemma":[0.986498,0.00969603,0.0010549038,0.00087156775,0.0007414888,0.0011380387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021222006,0.0006385813,0.000971796,0.0010733963,0.0011473366,0.0025889075,0.0019194384,0.001652225,0.008592238],"category_scores_gemma":[0.014982426,0.0006765882,0.0010001808,0.001249985,0.0022313697,0.009763003,0.0026187967,0.0024462102,0.0005244111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043164258,0.00017828296,0.0037505173,0.00039641833,0.00006532477,0.0004102775,0.0007401219,0.020739002,0.008639853,0.9391988,0.0064412556,0.019008601],"study_design_scores_gemma":[0.000059790975,0.00007363476,0.001150061,0.000038515296,0.000025638641,0.00036767623,0.00024399241,0.06510563,0.002663523,0.92778647,0.0024494962,0.00003570085],"about_ca_topic_score_codex":0.0009758747,"about_ca_topic_score_gemma":0.00073967205,"teacher_disagreement_score":0.008592238,"about_ca_system_score_codex":0.0015748071,"about_ca_system_score_gemma":0.0008055081,"threshold_uncertainty_score":0.028743923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71841156,0.0005247599,0.18588454,0.00093061023,0.00017416233,0.00007606499,0.0004470242,0.00031070452,0.09324052],"genre_scores_gemma":[0.9755307,0.00026271865,0.014565238,0.000102940794,0.00010120904,0.000037170532,0.0003043387,0.00007956158,0.009016149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995702,0.000051342628,0.000016887509,0.00007949061,0.0001635412,0.0001185885],"domain_scores_gemma":[0.99928975,0.00029191142,0.000107206884,0.00011745416,0.00010714189,0.000086565466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036982258,0.00040337234,0.00040156714,0.001489472,0.00079739455,0.0020904236,0.0007698917,0.00055367954,0.0051107025],"category_scores_gemma":[0.003059736,0.00038004282,0.0006966123,0.00091758533,0.0018433945,0.0033409216,0.001539117,0.0020135331,0.00062199245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046956444,0.000013589765,0.00054404157,0.000030394594,0.0000043802643,0.000095144445,0.00014870675,0.0019673943,0.0015497571,0.9864131,0.0006677386,0.008518706],"study_design_scores_gemma":[0.000018739402,0.000027035225,0.00079485925,0.000026620854,0.000012137944,0.00020862602,0.00012524064,0.01753719,0.0053128223,0.97065204,0.005260251,0.000024383982],"about_ca_topic_score_codex":0.0012207696,"about_ca_topic_score_gemma":0.0012599084,"teacher_disagreement_score":0.0051107025,"about_ca_system_score_codex":0.00087499194,"about_ca_system_score_gemma":0.00043500873,"threshold_uncertainty_score":0.017097056},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8454016,0.0004378811,0.11007111,0.0018904337,0.00014357083,0.00010540191,0.0017593561,0.00039408493,0.039796636],"genre_scores_gemma":[0.9739987,0.00032857875,0.014965933,0.00038138928,0.0002625591,0.00011539591,0.00198011,0.00017307489,0.0077942107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948394,0.00013371739,0.00002257286,0.00011423196,0.00013688474,0.000108603905],"domain_scores_gemma":[0.9926675,0.0040766075,0.0010902572,0.0005051397,0.0008122753,0.00084831176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056583516,0.0005262518,0.0008245616,0.002336408,0.00095379166,0.0019467692,0.001217441,0.0010249711,0.010149072],"category_scores_gemma":[0.007197944,0.00056901557,0.00044196396,0.0012582889,0.0014960641,0.0025306419,0.0011030503,0.0015963498,0.0007551123],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041971606,0.00016394643,0.0054310923,0.0003015025,0.000046399287,0.0004939188,0.0006710582,0.01381581,0.008836808,0.93474215,0.013029114,0.022048539],"study_design_scores_gemma":[0.000053507076,0.000037100686,0.0020858312,0.000041217932,0.000018894967,0.00034190115,0.00020882425,0.04412466,0.0016375546,0.9481803,0.0032519116,0.000018241848],"about_ca_topic_score_codex":0.001168448,"about_ca_topic_score_gemma":0.0015373087,"teacher_disagreement_score":0.010149072,"about_ca_system_score_codex":0.00068402436,"about_ca_system_score_gemma":0.0005740665,"threshold_uncertainty_score":0.033951998},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6504624,0.001243512,0.19889995,0.0028060027,0.0010213089,0.00014585645,0.00089761434,0.0006729399,0.1438504],"genre_scores_gemma":[0.9195562,0.0007607191,0.033097412,0.00040988188,0.00029847506,0.00016259239,0.00052594347,0.0001805472,0.045008305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989926,0.00024940312,0.000106464366,0.00019086324,0.00028387245,0.00017677556],"domain_scores_gemma":[0.99746895,0.0010469875,0.00048597378,0.00045652402,0.00024135901,0.00030016253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005774838,0.0005656864,0.000735632,0.002213042,0.0017254206,0.00404753,0.0011522499,0.0015947758,0.010760817],"category_scores_gemma":[0.0039488524,0.0007662705,0.0008773993,0.0029479617,0.0021247598,0.0046050213,0.0028150668,0.0020008313,0.0018295489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008461544,0.00003439077,0.0006654305,0.00005480948,0.000010551868,0.0003311976,0.00036052614,0.0011179977,0.0013216526,0.977123,0.0015222933,0.017373608],"study_design_scores_gemma":[0.000014893519,0.00001697019,0.00024207223,0.000015974894,0.000007399262,0.0003344712,0.00012503665,0.0032196399,0.00041245652,0.9927296,0.0028726151,0.000008947901],"about_ca_topic_score_codex":0.00058337883,"about_ca_topic_score_gemma":0.0006722971,"teacher_disagreement_score":0.010760817,"about_ca_system_score_codex":0.00071245374,"about_ca_system_score_gemma":0.000429788,"threshold_uncertainty_score":0.035998523},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8571551,0.00048801248,0.12513456,0.0005045022,0.00005249586,0.00009005672,0.00036953684,0.0004137835,0.015791932],"genre_scores_gemma":[0.987976,0.00015670476,0.0062149637,0.00007557236,0.000114783965,0.000083700776,0.00041381555,0.00008214435,0.00488226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991855,0.00013846012,0.00007303869,0.00024726582,0.0002258831,0.00012988555],"domain_scores_gemma":[0.99644756,0.0019687677,0.00046689296,0.00035215047,0.00046314232,0.00030134933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071864045,0.0003653087,0.00046546786,0.0015346593,0.0010005969,0.002176027,0.00044323833,0.0006676726,0.0041449564],"category_scores_gemma":[0.004233909,0.00020638804,0.00077782985,0.00054183416,0.0019887167,0.0029810185,0.0013137751,0.0009069683,0.0009347746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028772868,0.00008057834,0.005391645,0.00010987736,0.000035639754,0.00057199446,0.0028388475,0.0051715993,0.033924233,0.9328241,0.0009351434,0.017828612],"study_design_scores_gemma":[0.000048112342,0.00020579399,0.0020773713,0.00002847948,0.00004190179,0.0006172457,0.00072353345,0.029664177,0.025228452,0.9356071,0.0057072146,0.000050648057],"about_ca_topic_score_codex":0.0003592039,"about_ca_topic_score_gemma":0.00018904495,"teacher_disagreement_score":0.0041449564,"about_ca_system_score_codex":0.00071725255,"about_ca_system_score_gemma":0.00030549508,"threshold_uncertainty_score":0.013866305},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.832319,0.00076468795,0.11978178,0.0020815642,0.0003071227,0.000113593,0.0028266392,0.0015703805,0.0402353],"genre_scores_gemma":[0.9517883,0.0008907753,0.02402251,0.0002588625,0.00023203711,0.00023685135,0.0026701223,0.0008206065,0.019080047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874866,0.00029989486,0.000055485652,0.00022920042,0.00025834976,0.0004083748],"domain_scores_gemma":[0.9701671,0.019465977,0.0020119003,0.0022502171,0.0028106396,0.0032942323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002416313,0.00083649467,0.0010376757,0.0032718517,0.0019127149,0.003959206,0.0024140186,0.0019123836,0.013549257],"category_scores_gemma":[0.03665587,0.00068680604,0.0010268771,0.0018807523,0.0018579289,0.004221998,0.002025925,0.0022594924,0.0019025003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007951221,0.0001363843,0.0110254055,0.0003324964,0.000062500854,0.0004662775,0.0008364293,0.04461433,0.015069958,0.8840739,0.012553963,0.030033277],"study_design_scores_gemma":[0.00007728924,0.00016847553,0.005506123,0.00015749736,0.00008400388,0.0012465705,0.0006802267,0.27730763,0.014032431,0.69385713,0.006758897,0.00012373432],"about_ca_topic_score_codex":0.0017023464,"about_ca_topic_score_gemma":0.001518584,"teacher_disagreement_score":0.013549257,"about_ca_system_score_codex":0.0019247184,"about_ca_system_score_gemma":0.0016121792,"threshold_uncertainty_score":0.04532683},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.313598,0.0007892459,0.51816815,0.001317235,0.00021833193,0.000112669026,0.0014026376,0.0007957528,0.16359797],"genre_scores_gemma":[0.9687685,0.00020091212,0.021121837,0.00027947518,0.0001475973,0.000054371903,0.00035587623,0.000087273205,0.008984207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989924,0.000121201265,0.00005133091,0.00034226643,0.00026558337,0.00022726884],"domain_scores_gemma":[0.9976816,0.0010772396,0.00027443003,0.00050299964,0.0002386023,0.00022514896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008312759,0.00030718435,0.00053451373,0.0008789963,0.000979423,0.0015833556,0.0006799984,0.0006456231,0.010595163],"category_scores_gemma":[0.004110989,0.00030505972,0.00059044384,0.0006514535,0.0026340117,0.0044326815,0.001950395,0.0012818364,0.0009025515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025986239,0.000011745623,0.0007805409,0.000041905103,0.0000071889103,0.00011673034,0.00018112925,0.0013174128,0.00239031,0.9817456,0.0009800005,0.01240154],"study_design_scores_gemma":[0.000017300901,0.000053355256,0.0013941168,0.000027369731,0.000016907137,0.0007639199,0.00012388197,0.009104479,0.002992214,0.96827817,0.017203934,0.000024452407],"about_ca_topic_score_codex":0.00052963773,"about_ca_topic_score_gemma":0.0004969171,"teacher_disagreement_score":0.010595163,"about_ca_system_score_codex":0.0005584019,"about_ca_system_score_gemma":0.00039786135,"threshold_uncertainty_score":0.03544438},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9313165,0.00023777594,0.051786497,0.00048374492,0.00003719388,0.000029852028,0.00017013984,0.00010890922,0.01582932],"genre_scores_gemma":[0.9874713,0.0002565752,0.005872679,0.000041540614,0.000031904863,0.00004034241,0.00013174576,0.000025569545,0.006128413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996902,0.000040475574,0.000022408782,0.00008168583,0.00007908568,0.00008621097],"domain_scores_gemma":[0.9993362,0.00015443662,0.00017468266,0.00008668316,0.000079130165,0.00016890344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044209795,0.00031768772,0.0003045407,0.0012002256,0.0007063305,0.0015281695,0.00046247087,0.00043885555,0.0035385604],"category_scores_gemma":[0.0018742329,0.0002516595,0.00036813488,0.000544926,0.00145234,0.0041205464,0.0017623511,0.0007106362,0.00039115758],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090357215,0.00003972085,0.0018537277,0.000044388322,0.000016477317,0.00042602728,0.0011521335,0.006832141,0.008779632,0.97192705,0.00037452718,0.008463781],"study_design_scores_gemma":[0.000039202056,0.00007597293,0.0023078253,0.000038262624,0.000017976705,0.00028048863,0.000621388,0.03321589,0.0053686495,0.9510893,0.0069122273,0.00003281392],"about_ca_topic_score_codex":0.00094728684,"about_ca_topic_score_gemma":0.0008520716,"teacher_disagreement_score":0.0035385604,"about_ca_system_score_codex":0.0007042164,"about_ca_system_score_gemma":0.00032961054,"threshold_uncertainty_score":0.011837602},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20317465,0.0016212536,0.4051077,0.0030644904,0.00065189885,0.00017705362,0.001736368,0.0009244614,0.38354215],"genre_scores_gemma":[0.84415144,0.0009534317,0.08146296,0.00066722004,0.00046225885,0.00016637781,0.0013777119,0.0002315951,0.07052693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992065,0.00024841336,0.000053702406,0.0001758738,0.00019965714,0.000115857685],"domain_scores_gemma":[0.99838877,0.00046574886,0.00021162107,0.00020077883,0.00029530088,0.00043786387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064573385,0.0004646285,0.0005036382,0.0023113403,0.0013759152,0.004484796,0.00072825927,0.00075155165,0.021756401],"category_scores_gemma":[0.0031909538,0.00043719957,0.00056057906,0.0023850969,0.0016638585,0.0035194578,0.0019013598,0.0020267863,0.0025661928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040023562,0.000016875289,0.00012726485,0.000025409994,0.000005730331,0.000051409555,0.00014843141,0.0004941376,0.00041393426,0.9870876,0.0016956242,0.00989355],"study_design_scores_gemma":[0.000014079827,0.000017553402,0.00015584823,0.000019726076,0.000008865321,0.00016767034,0.00016065007,0.0030866233,0.0005706361,0.98036593,0.015420613,0.000011797414],"about_ca_topic_score_codex":0.00063371856,"about_ca_topic_score_gemma":0.00046135092,"teacher_disagreement_score":0.021756401,"about_ca_system_score_codex":0.0010174172,"about_ca_system_score_gemma":0.00047829613,"threshold_uncertainty_score":0.07278246},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7290369,0.00079120835,0.13288227,0.0030350212,0.000533032,0.0002071863,0.010658719,0.0022926077,0.120563045],"genre_scores_gemma":[0.8357244,0.000429092,0.08487999,0.0003246604,0.0002808614,0.00031275002,0.007960093,0.00080067216,0.06928751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842525,0.00031498936,0.00018798652,0.0004158593,0.00034366112,0.00031232834],"domain_scores_gemma":[0.98942786,0.003634996,0.0019590764,0.0011989792,0.0019636627,0.0018154227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010007594,0.0007886423,0.00068587787,0.0015664233,0.0022181387,0.0039523165,0.0018696595,0.0013170061,0.02324801],"category_scores_gemma":[0.0063718944,0.00059777615,0.00074259954,0.0011254504,0.0018265333,0.0043575964,0.0017395108,0.0013376373,0.0061108926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036647806,0.0005056705,0.026584143,0.0011835998,0.0003518238,0.0017556506,0.0024521286,0.010728956,0.06495962,0.70041466,0.07376563,0.113633335],"study_design_scores_gemma":[0.00038424073,0.0011694677,0.021436052,0.00039543834,0.00039196832,0.008794985,0.003000573,0.04741483,0.09326805,0.62094665,0.20248225,0.00031550782],"about_ca_topic_score_codex":0.0011160556,"about_ca_topic_score_gemma":0.0015555694,"teacher_disagreement_score":0.02324801,"about_ca_system_score_codex":0.0012694866,"about_ca_system_score_gemma":0.00068834366,"threshold_uncertainty_score":0.07777238},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7161135,0.0022214793,0.24718545,0.0015467171,0.00009978611,0.0000719198,0.0009663517,0.000373939,0.031420816],"genre_scores_gemma":[0.96527916,0.00054396974,0.030885428,0.00016156535,0.000053677162,0.000075972406,0.0002578241,0.000075232805,0.0026672028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912935,0.00024076222,0.000037638172,0.00024583837,0.00015343746,0.00019305997],"domain_scores_gemma":[0.9942258,0.0037530074,0.00051317416,0.0005562085,0.0004145905,0.000537265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013190937,0.0005541003,0.0006517597,0.0011996118,0.0009902447,0.0014570978,0.00096547755,0.0005545632,0.0028744203],"category_scores_gemma":[0.007641425,0.00049540156,0.00048576482,0.000753742,0.0021428077,0.004562299,0.0014998985,0.0015010344,0.00028550733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033081142,0.00006008028,0.003679798,0.00017877962,0.000039035673,0.000094305615,0.0004976894,0.038462844,0.007736214,0.9267354,0.0033371313,0.018847808],"study_design_scores_gemma":[0.000033697448,0.00005987293,0.0015787232,0.000052795465,0.00001888976,0.00022038932,0.00020752843,0.13519117,0.004529623,0.85248667,0.0055830204,0.000037505415],"about_ca_topic_score_codex":0.0012098571,"about_ca_topic_score_gemma":0.0014223699,"teacher_disagreement_score":0.0028744203,"about_ca_system_score_codex":0.0015592849,"about_ca_system_score_gemma":0.0006442377,"threshold_uncertainty_score":0.011313498},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88837856,0.00037801603,0.045806166,0.000866155,0.00032366035,0.00005714399,0.00015353637,0.00021274781,0.06382402],"genre_scores_gemma":[0.9770603,0.00021819722,0.004689587,0.0001845617,0.00018199376,0.00004608488,0.00015857043,0.000101344056,0.017359294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905795,0.00019440854,0.00006346074,0.00016877738,0.00019646373,0.0003188672],"domain_scores_gemma":[0.99868864,0.0005711575,0.0001795965,0.0001529961,0.000101828286,0.00030581758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010807614,0.0005575125,0.0007352883,0.0024104535,0.003354692,0.0034621255,0.0012281804,0.0016801585,0.011456473],"category_scores_gemma":[0.0020653533,0.00053894025,0.00092252594,0.0013875768,0.0036914586,0.004949007,0.0023682094,0.0019712322,0.0010254761],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030120533,0.000021197213,0.00028690865,0.000011153497,0.000004242969,0.000118007876,0.00053319475,0.00027929654,0.0007822312,0.9951687,0.00042755296,0.0023373975],"study_design_scores_gemma":[0.000027614806,0.000018221106,0.00036736106,0.0000082136485,0.0000068800928,0.00012274095,0.00020334043,0.002169542,0.0005023484,0.9947378,0.0018214539,0.000014486362],"about_ca_topic_score_codex":0.0020526387,"about_ca_topic_score_gemma":0.0024210012,"teacher_disagreement_score":0.011456473,"about_ca_system_score_codex":0.0013449821,"about_ca_system_score_gemma":0.00066437485,"threshold_uncertainty_score":0.038325667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34528872,0.0003616657,0.5773423,0.00094074267,0.00053866603,0.00019751156,0.0013998817,0.016457306,0.05747327],"genre_scores_gemma":[0.85030806,0.0003246221,0.1316758,0.00022875439,0.00006488412,0.00012727316,0.0011387941,0.002589015,0.01354279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995161,0.00015036484,0.000024846531,0.000052661646,0.00017526415,0.00008061401],"domain_scores_gemma":[0.99781895,0.0011391042,0.00016784972,0.0002680686,0.00028174216,0.00032422974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005902923,0.0010215912,0.00065519725,0.0010283353,0.00080719433,0.0021451632,0.0008414596,0.0011007315,0.025758179],"category_scores_gemma":[0.0034438646,0.000593347,0.00047869934,0.00092807045,0.00053842727,0.003001592,0.0025391502,0.00131074,0.0035290483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037741004,0.00055671093,0.00559186,0.0011760241,0.00008487221,0.0034402956,0.0026435913,0.0657237,0.17675298,0.4101265,0.045729075,0.28440017],"study_design_scores_gemma":[0.00044153532,0.0006170029,0.002395301,0.00029302912,0.0001361691,0.0015500132,0.0016628024,0.36614966,0.10597913,0.42545912,0.0951484,0.0001678708],"about_ca_topic_score_codex":0.0008405878,"about_ca_topic_score_gemma":0.0012674677,"teacher_disagreement_score":0.025758179,"about_ca_system_score_codex":0.0005294252,"about_ca_system_score_gemma":0.0005424941,"threshold_uncertainty_score":0.08616966},"labels":[],"label_agreement":null}]}