{"meta":{"query_hash":"a15dcbaaeb2a","filters":{"venue":"Contributions to Discrete Mathematics"},"cohort_total":412,"direct_labels_cover":0,"predictions_cover":412,"exported":412,"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/a15dcbaaeb2a","api":"https://metacan.xera.ac/api/v1/cohort?venue=Contributions+to+Discrete+Mathematics"},"results":[{"id":"W1489838207","doi":"10.55016/ojs/cdm.v8i2.62171","title":"Elements of finite order in automorphism groups of homogeneous structures","year":2014,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Homogeneous; Automorphism; Order (exchange); Mathematics; Pure mathematics; Automorphism group; Combinatorics; Business","score_opus":0.021424856153386008,"score_gpt":0.3408321053292531,"score_spread":0.3194072491758671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489838207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2525706,0.0002709212,0.74057966,0.0002564059,0.00038474897,0.001676545,0.0030568128,0.00009321736,0.0011110941],"genre_scores_gemma":[0.87179345,0.000032359454,0.12745517,0.000047205416,0.000066461194,0.00013446182,0.00020108995,0.00005812552,0.00021167555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99673474,0.00023205514,0.0017659375,0.00042444098,0.0003682667,0.00047453865],"domain_scores_gemma":[0.99518484,0.0016305514,0.0011792323,0.0012821406,0.00060070603,0.00012255703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009879,0.00046385833,0.0014999289,0.000409137,0.00008140458,0.000014123745,0.00071125163,0.0005577168,0.0002167499],"category_scores_gemma":[0.0061782743,0.0004280381,0.0002560306,0.00032783457,0.00032556202,0.000038504935,0.0008194216,0.000618531,0.000013786894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058841153,0.00035095777,0.00012748336,0.0017021789,0.00027563784,0.000011634551,0.0021146373,0.005615311,0.0004867845,0.9886391,0.00035847625,0.0002589257],"study_design_scores_gemma":[0.0007485597,0.00009584121,0.000095148,0.00065632805,0.0002304811,0.000009108834,0.0002317995,0.0056282817,0.002986276,0.9887638,0.00017251223,0.00038186507],"about_ca_topic_score_codex":0.000011385169,"about_ca_topic_score_gemma":0.00004944873,"teacher_disagreement_score":0.6192229,"about_ca_system_score_codex":0.00014263553,"about_ca_system_score_gemma":0.00017960936,"threshold_uncertainty_score":0.99981713},"labels":[],"label_agreement":null},{"id":"W1572300247","doi":"10.55016/ojs/cdm.v5i2.62000","title":"Connected domination dot-critical graphs","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.012747377189052157,"score_gpt":0.3389732156815263,"score_spread":0.3262258384924741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572300247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02224597,0.000019857871,0.96877486,0.0050607375,0.00037418207,0.0005225535,0.000109715525,0.00032562413,0.0025664957],"genre_scores_gemma":[0.82028884,0.000002108556,0.179228,0.00012439118,0.0000490848,0.0001201428,0.000014674646,0.000014846859,0.00015789592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981536,0.000088372755,0.0003766685,0.0003846022,0.00043762635,0.00055910496],"domain_scores_gemma":[0.9965044,0.00119221,0.00006664158,0.0010743471,0.00080325553,0.0003591323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084271457,0.00018644828,0.00024983293,0.00029919512,0.0003995367,0.0002888505,0.001090078,0.00011454397,0.000082837105],"category_scores_gemma":[0.0070957523,0.00016676645,0.00011402191,0.00095791253,0.00023692784,0.00049428537,0.0003733575,0.0004250608,0.00035439807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004187463,0.00008200142,0.000014232729,0.000014831991,0.000010834505,0.000006769892,0.0003512691,0.000006975698,0.024429329,0.9736198,0.00026801688,0.001191741],"study_design_scores_gemma":[0.0004281454,0.00008127985,0.0002584172,0.000030253948,0.000014153257,0.00004427215,0.0000514977,0.022613436,0.01424653,0.959069,0.002873883,0.00028911966],"about_ca_topic_score_codex":0.0000019778536,"about_ca_topic_score_gemma":0.000010970465,"teacher_disagreement_score":0.7980429,"about_ca_system_score_codex":0.00005074346,"about_ca_system_score_gemma":0.000085166,"threshold_uncertainty_score":0.8494791},"labels":[],"label_agreement":null},{"id":"W1586346388","doi":"10.55016/ojs/cdm.v5i1.61965","title":"On the number of components of a graph","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Graph; Mathematics; Computer science; Combinatorics","score_opus":0.02451514538843506,"score_gpt":0.33137306333273153,"score_spread":0.30685791794429645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1586346388","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95940024,0.0000025495185,0.03103494,0.0011592174,0.00006897129,0.00069337746,0.00056109147,0.0000419305,0.0070376857],"genre_scores_gemma":[0.98929864,0.00000110899,0.010342101,0.000048437945,0.000017824184,0.00011447061,0.000013711863,0.00001667724,0.00014703993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988855,0.00005282986,0.00050237955,0.0001296225,0.00024128788,0.00018834922],"domain_scores_gemma":[0.99661607,0.0018759307,0.00027540966,0.00085986627,0.00029172451,0.00008102063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065544085,0.00014210505,0.0003085886,0.000070730726,0.00016052686,0.00001293612,0.00041444696,0.00007682035,0.00032165096],"category_scores_gemma":[0.0019408148,0.000093700924,0.00018278474,0.0004118208,0.00023499802,0.000029775229,0.00007749765,0.00021696767,0.00008316444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008631991,0.00032247437,0.00005053089,0.00004771885,0.00004679575,1.5637809e-7,0.00042083728,0.0000018594213,0.023510268,0.9744146,0.0011561718,0.000019978046],"study_design_scores_gemma":[0.00020655117,0.000021969674,0.00020109737,0.00007077347,0.00007079672,0.0000053607655,0.00016673584,0.00014132072,0.018632168,0.9800066,0.00037737534,0.000099285564],"about_ca_topic_score_codex":0.0000040793093,"about_ca_topic_score_gemma":0.000005374117,"teacher_disagreement_score":0.029898394,"about_ca_system_score_codex":0.000008836122,"about_ca_system_score_gemma":0.000019581084,"threshold_uncertainty_score":0.38210127},"labels":[],"label_agreement":null},{"id":"W1594941289","doi":"10.55016/ojs/cdm.v6i1.62040","title":"2L-convex polyominoes: Geometrical aspects","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polyomino; Regular polygon; Mathematics; Combinatorics; Geometry","score_opus":0.029822366137084208,"score_gpt":0.2946020199361581,"score_spread":0.26477965379907387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594941289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010198118,0.000102574435,0.9495856,0.00076762197,0.00010732683,0.00034422526,0.00004740025,0.0009829855,0.04704241],"genre_scores_gemma":[0.5800063,0.0000030602478,0.4192042,0.00027681433,0.0000315419,0.000066197426,0.000004276452,0.000016485435,0.00039113767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982831,0.000027211241,0.00043480357,0.0003988393,0.0003456301,0.0005104109],"domain_scores_gemma":[0.9979738,0.0001550052,0.00013945247,0.0010347774,0.00039106447,0.00030588312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037764423,0.00022739959,0.00032700357,0.00038567596,0.00017208455,0.00044713466,0.0015233306,0.000093719245,0.00003458122],"category_scores_gemma":[0.0016597722,0.0002001638,0.00011866346,0.001424955,0.00010445784,0.0008760829,0.0007313419,0.00015892915,0.00059444085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029343241,0.0002789553,0.000039473023,0.00003517861,0.000029707806,0.00003146027,0.0012447658,4.4092968e-7,0.0005101069,0.9870689,0.0033911983,0.0073668715],"study_design_scores_gemma":[0.0004271071,0.00032473722,0.00064861216,0.00019554967,0.000050074872,0.00011933872,0.00010268007,0.0114258425,0.08547495,0.89549124,0.0049022096,0.0008376318],"about_ca_topic_score_codex":0.00000914685,"about_ca_topic_score_gemma":0.0000013997338,"teacher_disagreement_score":0.57898647,"about_ca_system_score_codex":0.00012787517,"about_ca_system_score_gemma":0.00011782448,"threshold_uncertainty_score":0.8162443},"labels":[],"label_agreement":null},{"id":"W1687767907","doi":"10.55016/ojs/cdm.v8i1.62180","title":"Colouring isonemal fabrics with more than two colours by thick striping","year":2013,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Textile materials and evaluations","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"University of Manitoba; Queen's University; McKnight Foundation","keywords":"Data striping; Computer science; Operating system","score_opus":0.019956162451677733,"score_gpt":0.3164408958202696,"score_spread":0.2964847333685918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1687767907","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8470269,0.00019363993,0.13684636,0.0035934006,0.00082702277,0.0029078326,0.007538234,0.00042908505,0.0006375526],"genre_scores_gemma":[0.9667545,0.000020675756,0.029414393,0.0002319223,0.00033810988,0.001421004,0.00074370555,0.00012038045,0.0009553107],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9959812,0.00020038975,0.0010525004,0.0008739846,0.00089648535,0.0009954299],"domain_scores_gemma":[0.9962225,0.00031370754,0.00075974804,0.0013081302,0.0009526388,0.00044328065],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011890584,0.0007013223,0.0010903717,0.00018337667,0.0007053599,0.0012773768,0.0010179486,0.00039652048,0.0010749882],"category_scores_gemma":[0.0008273112,0.0005817887,0.00018484837,0.00031407614,0.00026676516,0.0002363511,0.0012976006,0.000549193,0.0008784385],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028453118,0.0019004396,0.00054330094,0.0036639634,0.0008999772,0.000069600996,0.021404535,0.07504648,0.65274817,0.11382364,0.12899773,0.0006176342],"study_design_scores_gemma":[0.015021055,0.0025037816,0.0039860383,0.017858295,0.006796089,0.00040575795,0.019878956,0.20066462,0.54673636,0.14419538,0.02552336,0.016430324],"about_ca_topic_score_codex":0.00028509696,"about_ca_topic_score_gemma":0.00007176785,"teacher_disagreement_score":0.12561814,"about_ca_system_score_codex":0.00052010844,"about_ca_system_score_gemma":0.0005173918,"threshold_uncertainty_score":0.9998995},"labels":[],"label_agreement":null},{"id":"W1752350786","doi":"10.55016/ojs/cdm.v13i1.62788","title":"Density dichotomy in random words","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Substring; Combinatorics; Word (group theory); Mathematics; Alphabet; Sigma; Rank (graph theory); Limit (mathematics); Physics; Linguistics; Computer science; Philosophy; Geometry","score_opus":0.008632125033444954,"score_gpt":0.27738556260323755,"score_spread":0.2687534375697926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1752350786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08843079,0.000041758703,0.90663624,0.0014702542,0.00020731833,0.00038658595,0.000026814521,0.00019829889,0.0026019246],"genre_scores_gemma":[0.95591515,0.0000036623462,0.043305784,0.0003903344,0.00011403175,0.00005174167,0.0000052494024,0.000009332416,0.00020470409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986783,0.00006941705,0.0003492101,0.00028993996,0.00021713675,0.00039597572],"domain_scores_gemma":[0.99854755,0.0002605622,0.00007732135,0.0007867387,0.00017501393,0.00015280479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007882061,0.00015406094,0.00028530564,0.00015686608,0.00018067751,0.0001725619,0.00076341414,0.00006708593,0.000045140827],"category_scores_gemma":[0.0006547309,0.00013113592,0.0000764556,0.0007256998,0.0000969571,0.0002586623,0.00035763197,0.00011564451,0.00047733943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018319524,0.00015516866,0.00027831725,0.000020290345,0.000023703295,0.00002168542,0.0034878582,0.000011909478,0.0016545765,0.9890803,0.0022901937,0.002957646],"study_design_scores_gemma":[0.0056112334,0.00029959134,0.005661219,0.0005329018,0.000052648673,0.00009710758,0.0005165644,0.2710859,0.023896042,0.6731094,0.017922128,0.0012152798],"about_ca_topic_score_codex":0.000013234902,"about_ca_topic_score_gemma":0.00003779595,"teacher_disagreement_score":0.8674844,"about_ca_system_score_codex":0.00010035648,"about_ca_system_score_gemma":0.000073268486,"threshold_uncertainty_score":0.61353916},"labels":[],"label_agreement":null},{"id":"W1819051592","doi":"10.55016/ojs/cdm.v8i1.62144","title":"2L convex polyominoes: discrete tomographical aspects","year":2013,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polyomino; Regular polygon; Mathematics; Computer science; Geometry","score_opus":0.009520367845906751,"score_gpt":0.28103065848989117,"score_spread":0.2715102906439844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1819051592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003046811,0.00011467063,0.9712786,0.008223908,0.00012466528,0.00088687375,0.00007750391,0.0013064393,0.014940509],"genre_scores_gemma":[0.7581951,0.0000052746836,0.24019998,0.0006297187,0.00005916169,0.0003134819,0.00001578922,0.000027664495,0.0005538071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766,0.000047604623,0.00057185645,0.00053469307,0.00047718795,0.0007086848],"domain_scores_gemma":[0.9972801,0.0002389178,0.00017193095,0.0012678035,0.00058199227,0.0004592211],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003158094,0.00033606638,0.00044075624,0.00028245978,0.0002707603,0.0015983498,0.0016601543,0.00013228283,0.00005738399],"category_scores_gemma":[0.0010009645,0.00028359235,0.00018658095,0.0010477228,0.00020905105,0.0016003543,0.000830416,0.0002398866,0.00094306027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020143848,0.00018210236,0.00006216637,0.000067383095,0.000051778832,0.000016710277,0.0006342143,0.0000028510167,0.003143974,0.97758555,0.012764614,0.0054866173],"study_design_scores_gemma":[0.0004864825,0.00024996148,0.0006330779,0.00033125532,0.00004717966,0.0000960879,0.00014112942,0.04243757,0.025866495,0.92349863,0.0052227806,0.0009893195],"about_ca_topic_score_codex":0.000020865184,"about_ca_topic_score_gemma":0.0000034101554,"teacher_disagreement_score":0.7551483,"about_ca_system_score_codex":0.000111325215,"about_ca_system_score_gemma":0.00011824738,"threshold_uncertainty_score":0.9999616},"labels":[],"label_agreement":null},{"id":"W1847349865","doi":"10.55016/ojs/cdm.v11i1.62389","title":"Diagonal recurrence relations for the Stirling numbers of the first kind","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Diagonal; Stirling engine; Stirling numbers of the first kind; Stirling number; Recurrence relation; Stirling numbers of the second kind; Mathematics; Bell polynomials; Algebra over a field; Combinatorics; Pure mathematics; Physics; Geometry; Thermodynamics","score_opus":0.029239544590278495,"score_gpt":0.3350296788509379,"score_spread":0.3057901342606594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1847349865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009367191,0.00008048024,0.97422147,0.011104111,0.0007988465,0.002638177,0.0009769725,0.00009396909,0.00071879866],"genre_scores_gemma":[0.92704,0.000019544681,0.070127025,0.00008673862,0.00025231155,0.00087811716,0.000004992834,0.000080824546,0.0015104862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978752,0.000054049964,0.0008818634,0.00026425946,0.00047415332,0.0004504417],"domain_scores_gemma":[0.9868856,0.010528798,0.0005792598,0.0012294926,0.00066860736,0.00010822701],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.000885236,0.0002737701,0.00043297693,0.00006232955,0.00072520215,0.000043793072,0.0009179785,0.00012200358,0.00005853291],"category_scores_gemma":[0.019976463,0.0001337557,0.00032433157,0.0005123127,0.00029390378,0.00014721442,0.0002936083,0.00017175125,0.00004253567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013634612,0.00012405387,0.00009446074,0.0001254236,0.000085229076,1.8588294e-7,0.0010929818,0.00006281494,0.00029648223,0.9928856,0.0048404024,0.0003787211],"study_design_scores_gemma":[0.00083906954,0.00005338086,0.00012393759,0.0008133883,0.00026819814,0.0000071608056,0.0003336712,0.0012680852,0.0027076118,0.98254883,0.010782519,0.00025415618],"about_ca_topic_score_codex":0.0000026634073,"about_ca_topic_score_gemma":0.000035802954,"teacher_disagreement_score":0.91767275,"about_ca_system_score_codex":0.0002359778,"about_ca_system_score_gemma":0.00013825181,"threshold_uncertainty_score":0.9882787},"labels":[],"label_agreement":null},{"id":"W1918750269","doi":"10.55016/ojs/cdm.v10i1.62186","title":"Graphs embedded into finite projective planes","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"California State University, Fresno; National Science Foundation","keywords":"Projective test; Projective plane; Mathematics; Pure mathematics; Computer science; Algebra over a field; Geometry","score_opus":0.03742679694509653,"score_gpt":0.34990496707552243,"score_spread":0.3124781701304259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1918750269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4087312,0.0004994241,0.53069526,0.0023535558,0.0018386155,0.0051118596,0.0017261929,0.0014723869,0.047571532],"genre_scores_gemma":[0.9225346,0.0000067329215,0.07581647,0.00021944051,0.00018193033,0.00022643253,0.0000616907,0.000065264016,0.00088743016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787045,0.00014015239,0.0006180596,0.00036255972,0.0004895942,0.000519199],"domain_scores_gemma":[0.996833,0.0010200212,0.00021934975,0.00085067353,0.00065421767,0.00042269874],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009226863,0.00036160764,0.0005630296,0.00027875474,0.0004702398,0.000104708415,0.0004939417,0.00018612586,0.000057268884],"category_scores_gemma":[0.0071358117,0.0002802197,0.00019803167,0.0006035044,0.00019096643,0.00016259808,0.00032267906,0.00026869107,0.00010243375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004440249,0.000118020296,0.00006392766,0.000093257586,0.00012763489,0.000011225341,0.018591825,0.000038477465,0.00008202116,0.9715134,0.009124827,0.00019101833],"study_design_scores_gemma":[0.00075005577,0.00015862967,0.000027906977,0.00010401981,0.00013566669,0.000028489767,0.003445255,0.0011993728,0.0009977571,0.9893091,0.0034385181,0.00040523623],"about_ca_topic_score_codex":0.000012451669,"about_ca_topic_score_gemma":0.000023225395,"teacher_disagreement_score":0.5138034,"about_ca_system_score_codex":0.00016474137,"about_ca_system_score_gemma":0.00013278761,"threshold_uncertainty_score":0.999965},"labels":[],"label_agreement":null},{"id":"W2150373920","doi":"10.55016/ojs/cdm.v12i2.62601","title":"Group Irregular Labelings of Disconnected Graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Group (periodic table); Totally disconnected space; Mathematics; Geography; Physics; Locally compact space","score_opus":0.013796895176866024,"score_gpt":0.28265791971028714,"score_spread":0.26886102453342114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150373920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14636703,0.00023990966,0.8453747,0.0050032837,0.00042378603,0.0005876187,0.00017242174,0.0002843895,0.0015468883],"genre_scores_gemma":[0.9088077,0.000010380917,0.090901986,0.000086286505,0.0000069366506,0.000033535744,0.000012323116,0.000012108183,0.00012875663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984364,0.00003772813,0.000494936,0.00033793788,0.00032648855,0.00036649214],"domain_scores_gemma":[0.9968365,0.0001278504,0.00037900364,0.002002297,0.00044823406,0.00020615383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006062865,0.00018910166,0.00036577054,0.00016562558,0.0006951067,0.00031984018,0.0015380882,0.000083467305,0.0000119808],"category_scores_gemma":[0.0011107649,0.00015818556,0.0001580198,0.00025404117,0.00018629894,0.00037497474,0.0005725112,0.00011616164,0.00007122692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022955041,0.000098724864,0.00010714458,0.00003285834,0.000035537978,0.000003015472,0.00039141276,0.000018763956,0.007809533,0.9904187,0.00043518675,0.0006468696],"study_design_scores_gemma":[0.00084592134,0.00013828729,0.00082030083,0.0002646817,0.000056963185,0.000012037075,0.0000631561,0.0187968,0.01005871,0.9677651,0.00081798364,0.00036008467],"about_ca_topic_score_codex":0.00003495342,"about_ca_topic_score_gemma":0.000011563189,"teacher_disagreement_score":0.7624407,"about_ca_system_score_codex":0.000023407434,"about_ca_system_score_gemma":0.000043184344,"threshold_uncertainty_score":0.64506197},"labels":[],"label_agreement":null},{"id":"W2178834151","doi":"10.55016/ojs/cdm.v6i2.62073","title":"Signed star k-domatic number of a graph","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Star (game theory); Mathematics; Graph; Combinatorics","score_opus":0.027351266769131025,"score_gpt":0.3223965417862386,"score_spread":0.2950452750171076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2178834151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027759798,0.000038496502,0.96573085,0.00018060947,0.00006245528,0.0005626143,0.00009377507,0.00014439103,0.005427024],"genre_scores_gemma":[0.64446884,0.0000035449523,0.3552036,0.00003929795,0.000009998817,0.00008124674,0.0000037896764,0.000014028114,0.00017565564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822646,0.00010509652,0.0005200088,0.00028018557,0.00040341192,0.00046482266],"domain_scores_gemma":[0.99766445,0.0003143006,0.00017260105,0.0011461264,0.00046745036,0.0002350433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006672001,0.00018109196,0.00035593545,0.0001993692,0.00015020736,0.000046010955,0.0012142655,0.00006207006,0.0001629494],"category_scores_gemma":[0.00079240097,0.0001554583,0.00015192165,0.0011371948,0.00016631,0.00033738572,0.0004164238,0.00012733403,0.00032814904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009340799,0.00016100964,0.0000754513,0.000059325877,0.000044109165,0.0000065305167,0.0026235292,0.0000053188296,0.0016075011,0.9949111,0.00014490617,0.00035187867],"study_design_scores_gemma":[0.00042116607,0.00011950884,0.00025269977,0.00010031235,0.000023811075,0.000022095113,0.00024921267,0.004970149,0.013278857,0.9801914,0.0001248332,0.00024594914],"about_ca_topic_score_codex":0.000007616863,"about_ca_topic_score_gemma":0.0000030153114,"teacher_disagreement_score":0.61670905,"about_ca_system_score_codex":0.000050907685,"about_ca_system_score_gemma":0.00007605847,"threshold_uncertainty_score":0.6339405},"labels":[],"label_agreement":null},{"id":"W2269982198","doi":"10.55016/ojs/cdm.v12i2.62777","title":"Shellability, vertex decomposability, and lexicographical products of graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McMaster University; Redeemer University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Vertex (graph theory); Combinatorics; Mathematics; Graph; Computer science","score_opus":0.024110148435130374,"score_gpt":0.34976466714273247,"score_spread":0.3256545187076021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269982198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41555417,0.00017486079,0.571466,0.009734269,0.0001867316,0.0013057585,0.00016652908,0.00014395935,0.0012677299],"genre_scores_gemma":[0.9310724,0.000017344886,0.06877781,0.0000231902,0.000012601553,0.000043773474,0.0000030915664,0.000010179644,0.00003957914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809635,0.00010500701,0.00045231037,0.00051744515,0.000400467,0.0004284021],"domain_scores_gemma":[0.9957772,0.00046509408,0.00019913855,0.0026367882,0.0006582505,0.0002635269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012955819,0.00018990262,0.00039633253,0.0001911572,0.0006356952,0.00030607748,0.0017775232,0.00007965813,0.000007392689],"category_scores_gemma":[0.0052079996,0.00016366185,0.00010794078,0.00044291202,0.0008929003,0.00048229028,0.0015591484,0.00019303018,0.0000151450895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010713037,0.0001699567,0.00474934,0.00012596905,0.000030189474,0.0000023928656,0.00030338854,0.0000055214146,0.0027257367,0.9896106,0.00007884942,0.0021873147],"study_design_scores_gemma":[0.0004054291,0.0001594748,0.017569091,0.00007813001,0.000017728982,0.000016071775,0.000034029857,0.0049626473,0.008595069,0.96768457,0.00025593792,0.0002218342],"about_ca_topic_score_codex":0.00000875235,"about_ca_topic_score_gemma":0.000013276623,"teacher_disagreement_score":0.5155183,"about_ca_system_score_codex":0.000036926514,"about_ca_system_score_gemma":0.00008400063,"threshold_uncertainty_score":0.6673937},"labels":[],"label_agreement":null},{"id":"W2346145792","doi":"10.55016/ojs/cdm.v14i1.62582","title":"Hamiltonian-connectedness of triangulations with few separating triangles","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universiteit Gent; Vlaamse regering; Vlaams Supercomputer Centrum","keywords":"Social connectedness; Combinatorics; Mathematics; Corollary; Hamiltonian (control theory)","score_opus":0.014064088123411764,"score_gpt":0.3166775454202772,"score_spread":0.30261345729686545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2346145792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111574754,0.00006683992,0.8836561,0.00070911046,0.00007429051,0.0010911982,0.00012764626,0.00013791182,0.0025621762],"genre_scores_gemma":[0.86626893,0.0000019181373,0.13274124,0.000035081965,0.000021565245,0.00008358493,0.000015516642,0.000018177469,0.00081395876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823046,0.000112386544,0.0004840164,0.00033952887,0.00041765996,0.0004159712],"domain_scores_gemma":[0.99714303,0.00078270986,0.00022354709,0.0010925604,0.00059179397,0.0001663614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062752655,0.00018831661,0.00042791566,0.0002744674,0.00018460426,0.00011737682,0.00082818634,0.00006575001,0.000051816696],"category_scores_gemma":[0.0007827336,0.00014834346,0.00010532287,0.0015132127,0.00009229766,0.0004104654,0.00023756991,0.00015089811,0.00015197661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029536812,0.000097138676,0.00021590781,0.00006592441,0.000064812215,0.0000036708568,0.0014070197,0.0019999654,0.0052887336,0.98999745,0.00007175787,0.00075805996],"study_design_scores_gemma":[0.011665386,0.002336029,0.00516258,0.0017201543,0.00021451713,0.00016070403,0.0035155832,0.35581177,0.07065283,0.5412105,0.0051409877,0.0024089892],"about_ca_topic_score_codex":0.0000042232036,"about_ca_topic_score_gemma":0.000012253332,"teacher_disagreement_score":0.7546942,"about_ca_system_score_codex":0.000082477934,"about_ca_system_score_gemma":0.00017141202,"threshold_uncertainty_score":0.60492706},"labels":[],"label_agreement":null},{"id":"W2398485268","doi":"","title":"Explicit upper bounds for f(n)=Π p ω(n) p/p-1.","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.038412197028717364,"score_gpt":0.3822763062692632,"score_spread":0.34386410924054583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398485268","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015503185,0.000022537264,0.962398,0.0020477676,0.00016948985,0.0020668947,0.00027584378,0.00032629305,0.017189974],"genre_scores_gemma":[0.18808442,0.0000034500617,0.80265707,0.00069387566,0.00041050685,0.00072361325,0.00013402883,0.00010476227,0.007188291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743086,0.00002858223,0.0010676789,0.00034786435,0.00043399542,0.00069099216],"domain_scores_gemma":[0.996235,0.0017424428,0.00024349564,0.0006659474,0.0007545718,0.00035852112],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020349137,0.00032807118,0.00052779075,0.00024337514,0.00038115433,0.00015800794,0.000346342,0.000189729,0.00038805426],"category_scores_gemma":[0.0070982575,0.00026861794,0.0002968457,0.00045740715,0.00006013451,0.00020304338,0.00008254475,0.00017172171,0.00028548687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025871133,0.00024791423,0.0000057050815,0.00019104114,0.000041069172,7.6563276e-7,0.0011717663,6.104343e-7,0.0013067129,0.984109,0.012047665,0.0008519233],"study_design_scores_gemma":[0.00073638133,0.00014505672,0.00002536064,0.00015030771,0.00010284227,0.000014953899,0.0011157139,0.005263316,0.014105639,0.945032,0.03289655,0.00041186446],"about_ca_topic_score_codex":0.0000022461127,"about_ca_topic_score_gemma":0.000018788167,"teacher_disagreement_score":0.17258124,"about_ca_system_score_codex":0.00023883377,"about_ca_system_score_gemma":0.00006164734,"threshold_uncertainty_score":0.9999766},"labels":[],"label_agreement":null},{"id":"W2398997308","doi":"10.55016/ojs/cdm.v8i2.62172","title":"The Erdős-Ko-Rado basis for a Leonard system","year":2014,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Basis (linear algebra); Generalization; Mathematics; Eigenvalues and eigenvectors; Combinatorics; Mathematical proof; Vector space; Discrete mathematics; Space (punctuation); Pure mathematics; Computer science","score_opus":0.009733530655127777,"score_gpt":0.2591611842764233,"score_spread":0.24942765362129554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398997308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016630718,0.000052616957,0.9878479,0.008123973,0.00050780654,0.00065055874,0.00007432796,0.00024709888,0.00083260157],"genre_scores_gemma":[0.9160942,0.0000021966302,0.08253724,0.0002362411,0.00032979657,0.000329859,0.000010171638,0.0000148159115,0.0004454857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871707,0.0000656403,0.0003677834,0.00025121667,0.00021299299,0.0003853179],"domain_scores_gemma":[0.9975897,0.0011970026,0.0001314557,0.0006305985,0.00029790096,0.00015331493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081881846,0.00015024566,0.00021978446,0.00005826952,0.0007532156,0.0003739749,0.0008185376,0.000048239574,0.0000012672588],"category_scores_gemma":[0.0012975298,0.0001026831,0.00014418615,0.00030898093,0.000041526077,0.000145099,0.00021317,0.00006888628,0.00011683464],"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.000003436251,0.000017169676,0.0000021193296,0.00003796097,0.00001964952,2.481229e-7,0.00035959523,0.00012458363,0.00008581998,0.97961545,0.0031246645,0.016609313],"study_design_scores_gemma":[0.0004705205,0.00013092165,0.0001248242,0.00014250808,0.000038361966,0.000013899189,0.00018496154,0.8520462,0.00079220615,0.08212738,0.06364869,0.0002795554],"about_ca_topic_score_codex":0.0000044305834,"about_ca_topic_score_gemma":0.000007804234,"teacher_disagreement_score":0.9144311,"about_ca_system_score_codex":0.00013782625,"about_ca_system_score_gemma":0.000069905516,"threshold_uncertainty_score":0.57932013},"labels":[],"label_agreement":null},{"id":"W2401383348","doi":"10.55016/ojs/cdm.v20i2.62715","title":"Reversed Dickson polynomials of the (k+1)-th kind over finite fields, II","year":2025,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Finite field; Combinatorics; Permutation (music); Mathematics; Prime (order theory); Generalization; Polynomial; Algebraic number; Discrete mathematics; Physics","score_opus":0.007535830103252515,"score_gpt":0.26938227219524385,"score_spread":0.2618464420919913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401383348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032725427,0.0000835667,0.9540989,0.0065583833,0.00044991067,0.0004710826,0.00013071447,0.00008180393,0.0054002022],"genre_scores_gemma":[0.99150914,0.000007145915,0.0065576276,0.00074314966,0.000028237188,0.000028340146,0.0000027137123,0.0000048412307,0.0011187892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989207,0.00008587363,0.00036310413,0.00020718477,0.00018558942,0.00023755335],"domain_scores_gemma":[0.99816865,0.00047555997,0.00014266874,0.001018732,0.0001335932,0.000060771086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004827638,0.00013561237,0.00024831985,0.00013809622,0.00039159288,0.000073201096,0.0010507923,0.00008200753,0.000039600065],"category_scores_gemma":[0.0008747748,0.00009792823,0.0002162165,0.0010038929,0.00008948166,0.000117696814,0.00070187007,0.00013676535,0.000009967486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072113485,0.00007736235,0.000122054094,0.000035638997,0.00004849967,5.407182e-7,0.0009374016,0.000088913024,0.00095682766,0.9903699,0.006563886,0.00079172524],"study_design_scores_gemma":[0.0015093719,0.00021075556,0.0034359153,0.0010226744,0.00020904481,0.0000044855133,0.00024572262,0.018247312,0.033455305,0.88548714,0.05560552,0.000566774],"about_ca_topic_score_codex":0.000009441919,"about_ca_topic_score_gemma":0.000010137151,"teacher_disagreement_score":0.95878375,"about_ca_system_score_codex":0.000037275568,"about_ca_system_score_gemma":0.00009673182,"threshold_uncertainty_score":0.39933974},"labels":[],"label_agreement":null},{"id":"W2438977958","doi":"10.55016/ojs/cdm.v12i1.62598","title":"First-Fit coloring of Cartesian product graphs and its defining sets","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Product (mathematics); Mathematics; Combinatorics; Geometry","score_opus":0.03617069705655002,"score_gpt":0.3428559451413638,"score_spread":0.3066852480848138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2438977958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5019066,0.0012752741,0.4836165,0.0070778765,0.0003165304,0.0020009764,0.00041412466,0.00029732336,0.0030948413],"genre_scores_gemma":[0.957943,0.000027462247,0.04182323,0.000013548816,0.000007976605,0.00006751612,0.00000224707,0.000011847908,0.00010316706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859154,0.000038859365,0.00032092424,0.0003481572,0.00028802364,0.00041251347],"domain_scores_gemma":[0.9976574,0.0002777771,0.00023006338,0.0012627518,0.00037563534,0.00019633932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072196627,0.00015842282,0.00030827653,0.00016121035,0.0009265283,0.0002542961,0.001155944,0.000043664062,0.0000045275383],"category_scores_gemma":[0.002881974,0.0001450097,0.000067714136,0.00025838372,0.0001501861,0.00052970194,0.00082291634,0.00014333383,0.000026316027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045316524,0.000033377655,0.0003877297,0.000100016274,0.000026625106,0.000005902818,0.00089395535,0.000085608,0.0008122796,0.99686176,0.000048607544,0.00073963037],"study_design_scores_gemma":[0.0010609732,0.000277761,0.008058263,0.0006396817,0.000056401936,0.0000649327,0.00022412477,0.083408505,0.025925197,0.8788249,0.00082081696,0.0006384502],"about_ca_topic_score_codex":0.000005407473,"about_ca_topic_score_gemma":0.00001704047,"teacher_disagreement_score":0.45603645,"about_ca_system_score_codex":0.000040759653,"about_ca_system_score_gemma":0.00005630582,"threshold_uncertainty_score":0.71262},"labels":[],"label_agreement":null},{"id":"W2471328753","doi":"10.55016/ojs/cdm.v16i1.62653","title":"Schröder partitions, Schröder tableaux and weak poset patterns","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per il Calcolo Scientifico; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Partially ordered set; Young tableau; Mathematics; Combinatorics; Order (exchange); Discrete mathematics","score_opus":0.02329135072473103,"score_gpt":0.3404212909613175,"score_spread":0.31712994023658647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2471328753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.134215,0.0006870582,0.8458451,0.0070539494,0.00083349657,0.0018854538,0.0021442217,0.000749589,0.006586154],"genre_scores_gemma":[0.69193906,0.00019769876,0.30091068,0.0005571301,0.00047846793,0.00061212946,0.00026347485,0.0002491367,0.0047922004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968519,0.00014271132,0.0010102035,0.0005966218,0.0005827059,0.0008158584],"domain_scores_gemma":[0.9957906,0.0011562357,0.0002997367,0.0013024099,0.0009585307,0.00049251114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005681553,0.00049447874,0.0008415592,0.00016611863,0.000535515,0.0002953923,0.0003465181,0.00023273703,0.0004286672],"category_scores_gemma":[0.006787905,0.00047793044,0.00018904966,0.00066218775,0.00012648712,0.00032782814,0.0005279908,0.0003998956,0.0002487517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007877413,0.00043442167,0.00015825682,0.0004416132,0.0001416487,0.00003655162,0.0006850756,0.00002206236,0.0013694443,0.98972976,0.0067887907,0.00018449352],"study_design_scores_gemma":[0.0012384669,0.000084784944,0.00012316479,0.00065151585,0.0003129066,0.00019526595,0.0019353474,0.0009707534,0.0075889905,0.9739304,0.012227255,0.0007411341],"about_ca_topic_score_codex":0.0000044089343,"about_ca_topic_score_gemma":0.000031402044,"teacher_disagreement_score":0.55772406,"about_ca_system_score_codex":0.00021804121,"about_ca_system_score_gemma":0.0002110147,"threshold_uncertainty_score":0.99976724},"labels":[],"label_agreement":null},{"id":"W2557475083","doi":"10.55016/ojs/cdm.v14i1.62485","title":"Eulerian polynomials and polynomial congruences","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Congruence relation; Eulerian path; Mathematics; Polynomial; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.01779657745515862,"score_gpt":0.3358188767292266,"score_spread":0.318022299274068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557475083","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87718326,0.00030517674,0.07978046,0.0038309873,0.0007794282,0.0036101616,0.0008834183,0.0006586286,0.032968458],"genre_scores_gemma":[0.91585386,0.000023638484,0.07101086,0.00018415273,0.00021437395,0.00016000925,0.000018238747,0.00008516838,0.0124496855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977292,0.00006662795,0.00078424363,0.00042493973,0.00038314654,0.00061183923],"domain_scores_gemma":[0.9970906,0.001340855,0.00025046928,0.0007286076,0.0002433174,0.00034616524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061126053,0.00036065673,0.000784556,0.00018235462,0.00022573375,0.0002294813,0.00037264562,0.00015127807,0.0005868559],"category_scores_gemma":[0.0032367387,0.00031390865,0.00013923217,0.0002819367,0.00020296763,0.00035015054,0.00031733137,0.00019775704,0.00075943896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025776555,0.00015164223,0.00018499947,0.0004366805,0.00011266545,0.0000064237447,0.001548457,0.0000087135595,0.007309237,0.9823497,0.0076989434,0.00016678132],"study_design_scores_gemma":[0.0011965769,0.00018871966,0.00019958736,0.00041458904,0.00018059448,0.00006426563,0.0022149477,0.0009439133,0.0063962657,0.98108745,0.0063397414,0.00077334937],"about_ca_topic_score_codex":0.000013509512,"about_ca_topic_score_gemma":0.000023657121,"teacher_disagreement_score":0.038670596,"about_ca_system_score_codex":0.00014128086,"about_ca_system_score_gemma":0.00008228383,"threshold_uncertainty_score":0.9999313},"labels":[],"label_agreement":null},{"id":"W2620630814","doi":"10.55016/ojs/cdm.v14i1.62425","title":"Generating Special Arithmetic Functions by Lambert Series Factorizations","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Factorization; Euler's formula; Series (stratigraphy); Partition (number theory); Lambert W function; Inverse; Arithmetic function; Generating function; Divergent series; Algebra over a field; Arithmetic; Pure mathematics; Combinatorics; Discrete mathematics; Algorithm; Mathematical analysis","score_opus":0.015079649829586414,"score_gpt":0.3020657537032398,"score_spread":0.28698610387365336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2620630814","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055357363,0.000073274205,0.9089156,0.001994529,0.0010947323,0.0022050184,0.002204353,0.00063438306,0.027520793],"genre_scores_gemma":[0.2207695,0.000048519894,0.40531588,0.0004022611,0.0031077117,0.0011381232,0.0008873531,0.00045864494,0.36787203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972826,0.00007619684,0.0009387162,0.00045623182,0.00057033706,0.0006759172],"domain_scores_gemma":[0.9971009,0.0008975709,0.0002763145,0.000902816,0.0005239414,0.000298455],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00036796264,0.00042722802,0.00069737306,0.00018448273,0.0004967232,0.00028420766,0.00037963758,0.00017405825,0.0017581129],"category_scores_gemma":[0.0037091884,0.00039790402,0.0002165859,0.000638125,0.00012698837,0.00055776746,0.00024584358,0.00030171665,0.0018285115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010334912,0.00034588296,0.00010184656,0.00029626008,0.0001392656,0.000003321733,0.0014725035,0.0002548516,0.008794555,0.9235099,0.064997196,0.00007407946],"study_design_scores_gemma":[0.0009103562,0.00021330963,0.000024833735,0.00032209713,0.00031554062,0.00005893037,0.003063683,0.0045033,0.0051219193,0.938594,0.04580448,0.0010675536],"about_ca_topic_score_codex":0.0000049016085,"about_ca_topic_score_gemma":0.000026737272,"teacher_disagreement_score":0.5035997,"about_ca_system_score_codex":0.0003002787,"about_ca_system_score_gemma":0.00009660324,"threshold_uncertainty_score":0.9998473},"labels":[],"label_agreement":null},{"id":"W2626654879","doi":"10.55016/ojs/cdm.v15i1.62606","title":"Pell Coding and Pell Decoding Methods with Some Applications","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Decoding methods; Coding (social sciences); Mathematics; Coding theory; Combinatorics; Algorithm; Arithmetic; Discrete mathematics; Statistics","score_opus":0.016173886170146118,"score_gpt":0.3439716188136487,"score_spread":0.32779773264350254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2626654879","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010531344,0.000054406482,0.9886966,0.003129381,0.000008241971,0.0008678648,0.00032342866,0.000088775945,0.0057781767],"genre_scores_gemma":[0.3959118,0.000008671859,0.60258406,0.00029414316,0.00026930933,0.00057454495,0.00005706495,0.000039855884,0.0002605565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989627,0.000026683825,0.00031728155,0.00029103423,0.00010996983,0.00029235936],"domain_scores_gemma":[0.9986997,0.00040949197,0.0001230252,0.00030158664,0.00012410402,0.00034208404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001649446,0.00019818448,0.00032239876,0.00003127912,0.00035626726,0.00009996943,0.00018207083,0.00003083558,0.00013455279],"category_scores_gemma":[0.00007920224,0.00016094882,0.00006602182,0.00032218936,0.000104131286,0.00014162523,0.00013685608,0.00014830353,0.0001071862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004092683,0.00004538463,0.000021541586,0.00004644011,0.000042277476,1.7698585e-7,0.0005024742,0.00008031799,0.0016468731,0.99451303,0.00011812538,0.0029792613],"study_design_scores_gemma":[0.00066090457,0.00008750314,0.000013203157,0.00008712698,0.00023293073,0.000003910626,0.0031552631,0.021528032,0.008503676,0.93443257,0.03075824,0.0005366292],"about_ca_topic_score_codex":0.0000016728591,"about_ca_topic_score_gemma":1.9556781e-7,"teacher_disagreement_score":0.3948587,"about_ca_system_score_codex":0.000023481598,"about_ca_system_score_gemma":0.000029491031,"threshold_uncertainty_score":0.6563302},"labels":[],"label_agreement":null},{"id":"W2730815467","doi":"","title":"A note on monochromatic linear recurrence sequences.","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Mathematics; Combinatorics; Physics; Optics","score_opus":0.025640256055861232,"score_gpt":0.3353129503080017,"score_spread":0.30967269425214045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2730815467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005850344,0.000025748013,0.98019844,0.007985406,0.00016096515,0.00056133507,0.00014457725,0.00023054925,0.0048426073],"genre_scores_gemma":[0.84539795,0.000010178083,0.15362369,0.00021444049,0.00008150277,0.00019300764,0.000018365632,0.0000128257225,0.00044801983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986115,0.000027266318,0.00034056534,0.00037522358,0.00029496197,0.00035046972],"domain_scores_gemma":[0.99669045,0.00017586039,0.00024280253,0.0024957862,0.00017913071,0.0002159459],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00034271672,0.00018764938,0.00024993232,0.00008464813,0.0010860275,0.00058243994,0.0021118396,0.000068887,0.000018656521],"category_scores_gemma":[0.001074459,0.00016333541,0.00010446094,0.00020394633,0.00010667497,0.000358532,0.00045713282,0.00015337874,0.0013607723],"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.0000016672934,0.00017226159,0.000012060233,0.000045325734,0.000021096957,0.000013170107,0.0010010232,0.00016993159,0.0027071864,0.9840422,0.0018339809,0.009980089],"study_design_scores_gemma":[0.0005278144,0.00014438193,0.00081269693,0.00040526217,0.000043256794,0.000035409896,0.000038622038,0.83857864,0.013988259,0.1309127,0.013887856,0.00062507036],"about_ca_topic_score_codex":0.000013559381,"about_ca_topic_score_gemma":0.000008222034,"teacher_disagreement_score":0.8531295,"about_ca_system_score_codex":0.0001034841,"about_ca_system_score_gemma":0.000111015215,"threshold_uncertainty_score":0.99941677},"labels":[],"label_agreement":null},{"id":"W2751951661","doi":"10.55016/ojs/cdm.v14i1.62638","title":"On the classification of automorphisms of trees","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Automorphism; Mathematics; Countable set; Conjugacy class; Combinatorics; Branching (polymer chemistry); Conjugacy problem; Tree (set theory); Discrete mathematics","score_opus":0.036291431646673734,"score_gpt":0.3321746786927396,"score_spread":0.29588324704606583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751951661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08242784,0.00001538488,0.9114609,0.0013553542,0.00009423753,0.00086316234,0.00068055635,0.000037968868,0.0030646487],"genre_scores_gemma":[0.9775492,0.0000018135548,0.022041392,0.00004165997,0.000013644417,0.00005332991,0.000009767111,0.000017168693,0.00027200536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986972,0.000037359256,0.00056448224,0.00015329095,0.00035756783,0.00019005928],"domain_scores_gemma":[0.99532634,0.0032793838,0.00032212492,0.0006027507,0.00040365197,0.000065770175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047520784,0.00013973922,0.00038605044,0.00007161465,0.00005940978,0.000013542833,0.00030845468,0.000071397175,0.00035849496],"category_scores_gemma":[0.006485979,0.000089094494,0.00010116237,0.0003101158,0.00006959525,0.000028639846,0.00006187304,0.00010699016,0.00010556524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014559501,0.00014542424,0.0000043823143,0.00014589915,0.000034458484,1.8621226e-7,0.00030341808,0.000018026283,0.006680921,0.99105847,0.0014218331,0.00017240811],"study_design_scores_gemma":[0.00027107864,0.0002626091,0.00015770897,0.00027059336,0.00008086364,0.00000194964,0.00034312307,0.029353013,0.006073928,0.9629776,0.000103802806,0.00010374341],"about_ca_topic_score_codex":0.0000019388397,"about_ca_topic_score_gemma":0.000004002026,"teacher_disagreement_score":0.8951214,"about_ca_system_score_codex":0.000043601474,"about_ca_system_score_gemma":0.00005861048,"threshold_uncertainty_score":0.7764791},"labels":[],"label_agreement":null},{"id":"W2797717882","doi":"10.55016/ojs/cdm.v17i1.69514","title":"Some relational structures with polynomial growth and their associated algebras II. Finite generation.","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Permutation (music); Bounded function; Invariant (physics); Combinatorics; Conjecture; Polynomial; Discrete mathematics; Pure mathematics","score_opus":0.02508052111001085,"score_gpt":0.2819581800075086,"score_spread":0.25687765889749775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2797717882","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71211797,0.0004450383,0.27176672,0.0074492437,0.00044686836,0.0019462673,0.004568687,0.0007036914,0.0005554984],"genre_scores_gemma":[0.94128394,0.000009568738,0.056637913,0.0003897328,0.00035801713,0.0002973647,0.00035530483,0.000093507835,0.0005746403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981455,0.00012895894,0.00051716826,0.00036669243,0.00043869863,0.00040298828],"domain_scores_gemma":[0.99796945,0.00091265596,0.00030414623,0.00043018925,0.00021742679,0.00016614656],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00038294925,0.00031394765,0.000424362,0.00017059379,0.0013255556,0.00007426508,0.00026588113,0.000092855254,0.00012297071],"category_scores_gemma":[0.0026322762,0.00025781762,0.000085637505,0.00039056723,0.00012544515,0.00022408097,0.0004839451,0.00041037516,0.0000037972702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017065076,0.00012368419,0.00006550762,0.000021585882,0.00014475631,0.0000041515314,0.0016428328,0.00032723448,0.00092922535,0.9937702,0.002923194,0.000030568386],"study_design_scores_gemma":[0.0010853675,0.0002570078,0.00013237378,0.000025854568,0.00009999619,0.000040367213,0.00041104053,0.006283032,0.0019409069,0.98732674,0.0019614028,0.00043593952],"about_ca_topic_score_codex":0.000004226406,"about_ca_topic_score_gemma":0.00001691593,"teacher_disagreement_score":0.22916597,"about_ca_system_score_codex":0.00028872053,"about_ca_system_score_gemma":0.00013476475,"threshold_uncertainty_score":0.9999874},"labels":[],"label_agreement":null},{"id":"W2799119604","doi":"10.55016/ojs/cdm.v15i2.62327","title":"A method to determine algebraically integral Cayley digraphs on finite abelian group","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cayley graph; Mathematics; Cayley transform; Abelian group; Cayley's theorem; Combinatorics; Eigenvalues and eigenvectors; Commutative property; Algebraic number; Finite field; Group (periodic table); Discrete mathematics; Graph; Mathematical analysis","score_opus":0.041047431846359034,"score_gpt":0.34807745104441473,"score_spread":0.3070300191980557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799119604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03179296,0.000014668123,0.9461514,0.015993908,0.00005130467,0.0018016433,0.001231909,0.00043588874,0.0025263426],"genre_scores_gemma":[0.5041291,0.0000032778064,0.48959938,0.0047163246,0.00018097716,0.0008054764,0.00009424399,0.000089843255,0.0003813373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974157,0.00017528838,0.0008214391,0.0005845916,0.00038829204,0.00061466306],"domain_scores_gemma":[0.9957412,0.0020786817,0.00019343695,0.0008499477,0.00026792748,0.00086879404],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075527496,0.00043852275,0.0006733765,0.00023179156,0.0003729731,0.00014057205,0.0007071988,0.00015795528,0.00014944572],"category_scores_gemma":[0.0039589475,0.00037154133,0.00034678166,0.0013301262,0.000079285244,0.000097933895,0.00023197055,0.00038329465,0.00070938416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053876058,0.00026550516,0.00001104064,0.00008126877,0.000082940795,0.000007354291,0.0022361428,0.000045257515,0.004397738,0.98683727,0.004505939,0.0014756394],"study_design_scores_gemma":[0.00083363295,0.00071001274,0.000061456136,0.00028231292,0.00025769556,0.000013259277,0.0006307542,0.005951946,0.0060738344,0.9587988,0.025643699,0.0007425973],"about_ca_topic_score_codex":0.000005141773,"about_ca_topic_score_gemma":0.000020627396,"teacher_disagreement_score":0.47233617,"about_ca_system_score_codex":0.000076370496,"about_ca_system_score_gemma":0.000043411605,"threshold_uncertainty_score":0.99987364},"labels":[],"label_agreement":null},{"id":"W2895411163","doi":"10.55016/ojs/cdm.v10i1.62303","title":"Visibility-monotonic polygon deflation","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Polygon (computer graphics); Visibility; Visibility polygon; Rectilinear polygon; Star-shaped polygon; Point in polygon; Simple polygon; Monotonic function; Polygon covering; Computer science; Monotone polygon; Computer vision; Regular polygon; Combinatorics; Computer graphics (images); Mathematics; Artificial intelligence; Polygon mesh; Geometry; Mathematical analysis; Physics; Optics; Convex set","score_opus":0.024631269072147997,"score_gpt":0.31846043104266714,"score_spread":0.2938291619705191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895411163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022575824,0.000093245915,0.9709751,0.0028727,0.00027949238,0.00040493134,0.000029923513,0.00019359075,0.0025752091],"genre_scores_gemma":[0.86306673,0.0000017658634,0.13609554,0.00022685665,0.00011046745,0.000050235503,0.000042833562,0.0000073885844,0.00039816837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987076,0.00006324527,0.00034324467,0.00028578195,0.00034982985,0.00025032109],"domain_scores_gemma":[0.9983851,0.00013868019,0.00009322853,0.0005477855,0.00055324635,0.00028200686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070397876,0.00013318831,0.00016945212,0.0001698649,0.00016451438,0.00021521354,0.00040859502,0.00005866528,0.000009032182],"category_scores_gemma":[0.00095493026,0.00012586128,0.00006810418,0.00080443773,0.000020542246,0.00043684215,0.00019768349,0.000084209016,0.00040230903],"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.0000072665243,0.00014772122,0.000040978135,0.000015231729,0.00002303177,0.0000027695849,0.0015721779,0.012178498,0.0016170373,0.97361314,0.0040555494,0.006726593],"study_design_scores_gemma":[0.00071519025,0.00019438687,0.0005710798,0.000034150125,0.000025079906,0.000028014972,0.000109410525,0.72811455,0.0062572616,0.2505297,0.013050419,0.0003707262],"about_ca_topic_score_codex":0.000004134146,"about_ca_topic_score_gemma":0.000005886126,"teacher_disagreement_score":0.84049094,"about_ca_system_score_codex":0.00021724045,"about_ca_system_score_gemma":0.00022298709,"threshold_uncertainty_score":0.5171003},"labels":[],"label_agreement":null},{"id":"W2907170940","doi":"10.55016/ojs/cdm.v13i2.62730","title":"Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo; Deutscher Akademischer Austauschdienst","keywords":"Hypergraph; Mathematics; Combinatorics; Hamiltonian (control theory); Hamiltonian path; Degree (music); Upper and lower bounds; Discrete mathematics; Mathematical analysis; Physics; Graph","score_opus":0.0222772638909818,"score_gpt":0.32917001272122837,"score_spread":0.3068927488302466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907170940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39925566,0.00046704043,0.537957,0.002553426,0.0012720141,0.002697898,0.009693929,0.0010265161,0.045076538],"genre_scores_gemma":[0.97395134,0.000014459472,0.021626513,0.0004682545,0.00035932666,0.00007137715,0.00014928888,0.00008520816,0.0032742217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752074,0.00009557219,0.0006549743,0.00043842918,0.0004726266,0.0008176341],"domain_scores_gemma":[0.9973563,0.0005006099,0.00023530738,0.0011010143,0.00045911164,0.00034766653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007617291,0.0004016867,0.0005455475,0.00017625533,0.0012321016,0.00012453599,0.00066916656,0.0002452165,0.0008366462],"category_scores_gemma":[0.0020344655,0.00032787546,0.00025036503,0.00042827096,0.00026693055,0.00018845357,0.00051110703,0.0002522739,0.00039848837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041440017,0.00017483569,0.000055666904,0.00009778592,0.0001173291,0.0000047503004,0.0023327773,5.493972e-7,0.0021520113,0.8778206,0.11667119,0.00053102843],"study_design_scores_gemma":[0.0016631241,0.00027163958,0.00020262793,0.00026206477,0.00024590272,0.000024975829,0.0006722788,0.002058734,0.010160009,0.90952486,0.0741618,0.0007519764],"about_ca_topic_score_codex":0.0000047269477,"about_ca_topic_score_gemma":0.00002778578,"teacher_disagreement_score":0.5746957,"about_ca_system_score_codex":0.0001614504,"about_ca_system_score_gemma":0.00004689102,"threshold_uncertainty_score":0.9999173},"labels":[],"label_agreement":null},{"id":"W2945144629","doi":"10.55016/ojs/cdm.v16i3.71284","title":"Homotopy Type of Independence Complexes of Certain Families of Graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Indian Institute of Technology Bombay; Infosys Foundation","keywords":"Mathematics; Homotopy; Combinatorics; Homotopy sphere; Regular homotopy; Categorical variable; Discrete mathematics; Independence (probability theory); Graph; n-connected; Wedge (geometry); Pure mathematics; Geometry","score_opus":0.024733293724966722,"score_gpt":0.306981659783901,"score_spread":0.2822483660589343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2945144629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14991082,0.00039736542,0.8475088,0.000502471,0.00005794265,0.0001383121,0.00071460224,0.000026203339,0.00074350927],"genre_scores_gemma":[0.9449788,0.00006065416,0.054768488,0.00002299401,0.0000045212087,0.0000043383916,0.000031512573,0.0000026321643,0.00012606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986887,0.00005766065,0.0005371693,0.00019248399,0.00035104164,0.00017294768],"domain_scores_gemma":[0.99761224,0.00038503538,0.00024411909,0.0007091947,0.0009751411,0.00007425746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030315414,0.000101390775,0.00047102032,0.0002455542,0.000050526345,0.000019948875,0.00069210154,0.000061040475,0.000069893315],"category_scores_gemma":[0.0017712087,0.00008040067,0.00014755677,0.0028761728,0.00014741992,0.00011138862,0.00043616336,0.00007164947,0.000008853235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003820347,0.0002484351,0.0011001737,0.000102552476,0.00010173196,0.000004354014,0.000445453,0.00013825655,0.011117208,0.9851909,0.00019889657,0.0013481767],"study_design_scores_gemma":[0.0010260107,0.0007282798,0.018897109,0.0003820599,0.00034529282,0.00003194218,0.0024119979,0.01829089,0.3732343,0.58173287,0.002266981,0.0006522883],"about_ca_topic_score_codex":0.000053099284,"about_ca_topic_score_gemma":0.000018705805,"teacher_disagreement_score":0.79506797,"about_ca_system_score_codex":0.000013621531,"about_ca_system_score_gemma":0.000088911685,"threshold_uncertainty_score":0.32786444},"labels":[],"label_agreement":null},{"id":"W2950772534","doi":"10.55016/ojs/cdm.v8i1.62123","title":"Convex sublattices of a lattice and a fixed point property","year":2013,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Fixed-point property; Property (philosophy); Lattice (music); Regular polygon; Fixed point; Mathematics; Pure mathematics; Fixed-point theorem; Mathematical analysis; Geometry; Physics; Philosophy; Epistemology","score_opus":0.02203956187181659,"score_gpt":0.31975800643464714,"score_spread":0.29771844456283053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950772534","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5673825,0.0003305344,0.41114852,0.0073190737,0.00014946208,0.0031009007,0.00034928907,0.00027289265,0.009946806],"genre_scores_gemma":[0.91482925,0.0000149809475,0.08259431,0.00018542053,0.000036717964,0.0001887399,0.000010098244,0.000029429842,0.0021110657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986196,0.00009535672,0.0005537166,0.00022724562,0.00016235038,0.00034172653],"domain_scores_gemma":[0.99754405,0.0011650722,0.00022798694,0.0004802156,0.00040342,0.00017924313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047998744,0.00020997504,0.000524913,0.00009548083,0.00016719711,0.000035346104,0.0002064096,0.00012927364,0.00040603508],"category_scores_gemma":[0.003340861,0.00013793336,0.000080972466,0.00018969653,0.0003122639,0.00022487235,0.00016222388,0.00016545519,0.00012543239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020926618,0.00018926569,0.00012133403,0.00034165647,0.00010706789,0.0000027235849,0.0027244287,0.000003392538,0.0021466613,0.99218905,0.0017581327,0.0003953551],"study_design_scores_gemma":[0.0006672924,0.00014247683,0.00019310557,0.00017881351,0.00014960661,0.000035143745,0.0018051693,0.0025216003,0.00408975,0.9892324,0.0007143348,0.00027029516],"about_ca_topic_score_codex":0.000015345644,"about_ca_topic_score_gemma":0.0000097294605,"teacher_disagreement_score":0.3474467,"about_ca_system_score_codex":0.000037777452,"about_ca_system_score_gemma":0.000041518855,"threshold_uncertainty_score":0.56247586},"labels":[],"label_agreement":null},{"id":"W2951867195","doi":"10.55016/ojs/cdm.v9i1.62101","title":"Determination of the prime bound of a graph","year":2014,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Omega; Graph; Mathematics; Prime (order theory); Integer (computer science); Discrete mathematics; Physics; Computer science","score_opus":0.01369475596781104,"score_gpt":0.27628647856044986,"score_spread":0.2625917225926388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951867195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029517801,0.0001473351,0.9674235,0.0011068763,0.0004490092,0.00073680456,0.0001773578,0.00006778396,0.0003735623],"genre_scores_gemma":[0.8739129,0.000007707571,0.12583192,0.000057747777,0.000008746005,0.000059273418,0.00001273792,0.0000122841175,0.000096706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980861,0.00012118945,0.00078461634,0.00032157518,0.0004580945,0.00022844323],"domain_scores_gemma":[0.9962214,0.00022574852,0.000807414,0.0018284294,0.0008297756,0.00008718279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000843231,0.00021547444,0.00049493037,0.00020878072,0.00013353108,0.00008267564,0.0014910337,0.00018718305,0.000003561763],"category_scores_gemma":[0.0008945053,0.00015304139,0.00031642415,0.00049448706,0.00017069568,0.000059625618,0.0015681834,0.00024748273,0.000008132347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028114364,0.00020351556,0.000037985912,0.0005500603,0.00006273059,4.9217823e-7,0.0016030896,0.0007964797,0.006630905,0.98762655,0.0004643462,0.0020210382],"study_design_scores_gemma":[0.00025423535,0.000058810576,0.00023102964,0.0009579852,0.00010173117,0.000006779098,0.000017652024,0.07726591,0.024722805,0.89599735,0.00015219461,0.00023352048],"about_ca_topic_score_codex":0.000019280304,"about_ca_topic_score_gemma":0.000005413257,"teacher_disagreement_score":0.8443951,"about_ca_system_score_codex":0.000043110616,"about_ca_system_score_gemma":0.00019492928,"threshold_uncertainty_score":0.62408465},"labels":[],"label_agreement":null},{"id":"W2952171248","doi":"10.55016/ojs/cdm.v9i1.62183","title":"The rigidity of periodic frameworks as graphs on a fixed torus","year":2014,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Torus; Infinitesimal; Rigidity (electromagnetism); Mathematics; Pure mathematics; Geometry; Mathematical analysis; Structural engineering; Engineering","score_opus":0.00675325704669728,"score_gpt":0.25773424508849585,"score_spread":0.2509809880417986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952171248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22486597,0.00089898304,0.76394176,0.0014605378,0.0014370299,0.0015019163,0.001194607,0.00042631943,0.0042728456],"genre_scores_gemma":[0.9944028,0.00020377134,0.004818585,0.0000487127,0.0001142424,0.00011434747,0.00016512061,0.000033842407,0.0000985325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985558,0.000047959307,0.000587506,0.00021875167,0.00030945553,0.00028056616],"domain_scores_gemma":[0.99818015,0.0003504568,0.00019265585,0.00086246955,0.00029739607,0.00011684751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028198736,0.00030557014,0.000538257,0.00011340945,0.00025632448,0.00016783242,0.0004428951,0.00044499175,0.00007173421],"category_scores_gemma":[0.00092781585,0.00020699845,0.00033720228,0.0002519565,0.00008806915,0.000024663665,0.00018283201,0.00071832543,0.000051224615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016859682,0.000034785615,0.000022891729,0.00034962877,0.0005259381,0.0000012354346,0.00088149804,0.8140693,0.00016038411,0.17749764,0.0047964095,0.0016434466],"study_design_scores_gemma":[0.00028956006,0.000089370194,0.0004303894,0.000769598,0.00048045604,0.0000034548561,0.00019246234,0.79411185,0.0021166229,0.1970222,0.003848574,0.0006454907],"about_ca_topic_score_codex":0.000015048479,"about_ca_topic_score_gemma":0.000012055678,"teacher_disagreement_score":0.76953685,"about_ca_system_score_codex":0.00013063508,"about_ca_system_score_gemma":0.00003588717,"threshold_uncertainty_score":0.8441152},"labels":[],"label_agreement":null},{"id":"W2952374475","doi":"10.55016/ojs/cdm.v13i2.62737","title":"Face Module for Realizable Z-matroids","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Royal Swedish Academy of Sciences; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Matroid; Mathematics; Combinatorics; Face (sociological concept); Tutte polynomial; Hilbert–Poincaré series; Graphic matroid; Discrete mathematics; Sociology; Graph","score_opus":0.03275326053272644,"score_gpt":0.3737193537021035,"score_spread":0.3409660931693771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952374475","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063343965,0.000035770234,0.98116964,0.0010766308,0.00066387677,0.0026325898,0.00080307195,0.0005533673,0.0067306375],"genre_scores_gemma":[0.3135343,0.000006862366,0.6784759,0.00020740076,0.0011047648,0.0011132141,0.000069283524,0.00021384962,0.005274412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99705195,0.00005615395,0.000977506,0.0005090554,0.0004755698,0.00092973316],"domain_scores_gemma":[0.99517155,0.0013537589,0.00036499833,0.0014158583,0.0013192871,0.00037456132],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008694303,0.0004579839,0.00080161885,0.0001839873,0.00061978615,0.00014226626,0.0007139885,0.0002152687,0.00011101559],"category_scores_gemma":[0.009307507,0.00042204076,0.00027044807,0.00062421325,0.00020322068,0.0002368183,0.0002778437,0.00017532035,0.00039479398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033173317,0.00025013616,0.0000030235103,0.00024973045,0.00007956522,0.0000012964911,0.0010660564,0.00002689455,0.0009824953,0.9710943,0.026033232,0.00018009171],"study_design_scores_gemma":[0.0010790573,0.00039420775,0.0000028099219,0.00020211951,0.00016960039,0.00001654761,0.00042268584,0.011737073,0.013260462,0.95170134,0.020491464,0.0005226486],"about_ca_topic_score_codex":0.0000034021832,"about_ca_topic_score_gemma":0.0000121177945,"teacher_disagreement_score":0.3071999,"about_ca_system_score_codex":0.00034469712,"about_ca_system_score_gemma":0.0001195403,"threshold_uncertainty_score":0.99982315},"labels":[],"label_agreement":null},{"id":"W2952565476","doi":"10.55016/ojs/cdm.v5i2.62032","title":"The Cops and Robber game on graphs with forbidden (induced) subgraphs","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fédération Wallonie-Bruxelles; Fonds De La Recherche Scientifique - FNRS","keywords":"Combinatorics; Mathematical economics; Computer science; Mathematics","score_opus":0.012035481921575131,"score_gpt":0.2990309502276869,"score_spread":0.2869954683061118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952565476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34640738,0.00008682585,0.6408681,0.0072761984,0.0002553661,0.0014908437,0.000086778724,0.0002791337,0.0032493575],"genre_scores_gemma":[0.97910476,0.000016624876,0.020175092,0.00014819588,0.000031253985,0.00016833782,0.0000036454906,0.000021786997,0.0003303026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982656,0.00006764928,0.00026321842,0.00037946555,0.00044369287,0.0005803252],"domain_scores_gemma":[0.9970501,0.00093724206,0.00009849998,0.0012824473,0.00033707614,0.00029461517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008063306,0.00022012785,0.00022060935,0.00016714107,0.00068972167,0.00044503983,0.0010232542,0.00007844134,0.000007654773],"category_scores_gemma":[0.0006920805,0.00013086296,0.000072650895,0.0008176734,0.00029381723,0.00025833867,0.00031285625,0.00047919282,0.00006461663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016174747,0.00003915272,0.00007448087,0.000007694067,0.000028856686,0.0000053114777,0.00038691214,0.000008516524,0.0023161506,0.9949141,0.00020286381,0.001999792],"study_design_scores_gemma":[0.0008113131,0.0005248323,0.0011845013,0.00007996738,0.000026162636,0.000090019465,0.0002450492,0.0066726017,0.0061271577,0.9775484,0.006236429,0.0004535693],"about_ca_topic_score_codex":0.000003917024,"about_ca_topic_score_gemma":0.00008356959,"teacher_disagreement_score":0.63269734,"about_ca_system_score_codex":0.000027075315,"about_ca_system_score_gemma":0.00007229372,"threshold_uncertainty_score":0.53364366},"labels":[],"label_agreement":null},{"id":"W2963698001","doi":"10.55016/ojs/cdm.v7i2.62148","title":"Antichains and counterpoint dichotomies","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Counterpoint; Dichotomy; Mathematics; Combinatorics; Mathematical economics; Genealogy; Sociology; History; Statistics","score_opus":0.019638630347670088,"score_gpt":0.3332550051339457,"score_spread":0.3136163747862756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963698001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7438132,0.00063788926,0.24307276,0.0011033431,0.0005654936,0.0011142363,0.0005707385,0.0002973967,0.008824936],"genre_scores_gemma":[0.9751916,0.00002577688,0.023851668,0.00022553434,0.00020542115,0.000056640867,0.000008199473,0.000033287117,0.00040188225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857444,0.000059127095,0.00040884444,0.0001771305,0.00024010614,0.00054037577],"domain_scores_gemma":[0.99829,0.0006242749,0.0001198962,0.0004967783,0.0001503761,0.00031864326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075305713,0.00023982757,0.00038475462,0.0001228612,0.0004683548,0.00007077219,0.00019445833,0.00010471139,0.00008762969],"category_scores_gemma":[0.0018179505,0.00018339811,0.00009923694,0.00018924083,0.00016814891,0.00018009939,0.00027500727,0.00015889724,0.000031986212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000803046,0.00008082072,0.0006170182,0.00009279573,0.00006354898,0.0000011723822,0.0048980475,4.2918245e-7,0.00032256742,0.99178016,0.0019909025,0.0001444761],"study_design_scores_gemma":[0.0005442072,0.000066952445,0.0014665044,0.00015824306,0.00020546916,0.00008517141,0.001293642,0.00052168145,0.0019913577,0.98381805,0.009374943,0.00047377078],"about_ca_topic_score_codex":0.0000023575537,"about_ca_topic_score_gemma":0.0000031159946,"teacher_disagreement_score":0.23137838,"about_ca_system_score_codex":0.0000668246,"about_ca_system_score_gemma":0.000016913766,"threshold_uncertainty_score":0.74787575},"labels":[],"label_agreement":null},{"id":"W2963986177","doi":"10.55016/ojs/cdm.v6i1.62075","title":"Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Claw; Homogeneous; Combinatorics; Mathematics; Graph; Computer science; Biology","score_opus":0.01797061144220087,"score_gpt":0.2587732794256537,"score_spread":0.24080266798345284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963986177","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012368813,0.00015905417,0.981809,0.00018590078,0.000041613643,0.0003885783,0.00006507753,0.0003167167,0.0046652085],"genre_scores_gemma":[0.47021225,0.00001248858,0.52964836,0.000024050347,0.000006335567,0.000050396353,0.0000025542197,0.000008330508,0.00003523224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893034,0.000024271962,0.00038666948,0.00026099753,0.000161981,0.00023576392],"domain_scores_gemma":[0.9987301,0.000051998395,0.00018963081,0.0005311793,0.0003778676,0.00011921891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027829772,0.00014938056,0.00025312763,0.000169632,0.00010210056,0.00013415086,0.0005204359,0.00006729753,0.000005112622],"category_scores_gemma":[0.0002316352,0.0001350929,0.00005903146,0.00048247832,0.00016449686,0.000562437,0.00031583128,0.00007163347,0.000009400052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012346944,0.00027406603,0.0004024103,0.0003008147,0.000065430555,0.0000139905,0.0033150795,0.0000021287403,0.0052438583,0.92811704,0.0004765549,0.061776254],"study_design_scores_gemma":[0.00026204746,0.00017116821,0.0002382672,0.0003457536,0.000037847385,0.00030357466,0.00007282631,0.0041051838,0.069603644,0.9243619,0.00018106439,0.0003167663],"about_ca_topic_score_codex":0.000014075463,"about_ca_topic_score_gemma":0.00000781471,"teacher_disagreement_score":0.45784345,"about_ca_system_score_codex":0.00003091851,"about_ca_system_score_gemma":0.000065086206,"threshold_uncertainty_score":0.55089283},"labels":[],"label_agreement":null},{"id":"W2977736301","doi":"10.55016/ojs/cdm.v19i3.69171","title":"Lifting Properties for A-Homotopy Theory","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada","keywords":"Homotopy; Mathematics; Homotopy analysis method; Computer science; Pure mathematics","score_opus":0.03620231459925545,"score_gpt":0.34655100236155506,"score_spread":0.3103486877622996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977736301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04836729,0.00083499984,0.9368649,0.0057337913,0.0007600056,0.002004714,0.0004377206,0.0008615319,0.0041350294],"genre_scores_gemma":[0.93841404,0.000012286928,0.05167002,0.0003225352,0.0004921715,0.0012839655,0.0000299604,0.0000934814,0.007681535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981023,0.00012229195,0.0006061575,0.0003946925,0.00017626764,0.00059830217],"domain_scores_gemma":[0.9968412,0.0021456706,0.000079572594,0.0005349629,0.00023730317,0.00016132554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014688208,0.0002857531,0.0004726595,0.00018001988,0.00037531124,0.00014580348,0.00036435397,0.00021715758,0.00021295162],"category_scores_gemma":[0.0055420366,0.00022189501,0.00025323033,0.00030474464,0.00020174797,0.00012228372,0.00014262929,0.00024750532,0.00028161035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002349836,0.00007858707,0.0000051774646,0.0004899576,0.00015875747,0.000011796436,0.0026905385,0.000003615559,0.0016011597,0.98941547,0.0042688856,0.0012525744],"study_design_scores_gemma":[0.0002683424,0.00015186408,0.000004406193,0.00036438694,0.00022006301,0.000082011444,0.00070067967,0.002470697,0.008896538,0.9690023,0.017521452,0.0003172436],"about_ca_topic_score_codex":0.0000016995021,"about_ca_topic_score_gemma":0.0000063773327,"teacher_disagreement_score":0.8900468,"about_ca_system_score_codex":0.00012726922,"about_ca_system_score_gemma":0.00015283487,"threshold_uncertainty_score":0.9048616},"labels":[],"label_agreement":null},{"id":"W2980419801","doi":"10.55016/ojs/cdm.v15i2.69344","title":"Further generalizations of the parallelogram law","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Generalization; Diagonal; Parallelogram; Combinatorics; Quadratic equation; Dimension (graph theory); Mathematical analysis; Geometry; Physics","score_opus":0.01288978099078789,"score_gpt":0.2897470439051441,"score_spread":0.2768572629143562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980419801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032365536,0.000014404183,0.9704217,0.009519895,0.00002542745,0.0005778944,0.000689206,0.000039960843,0.01547497],"genre_scores_gemma":[0.97986805,6.474151e-7,0.019231616,0.00042347045,0.00010997087,0.00013135708,0.000030120978,0.00001592278,0.00018885225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992443,0.00002096699,0.00031081703,0.00012884328,0.00012093852,0.00017418693],"domain_scores_gemma":[0.9991323,0.00011915402,0.00011842948,0.00036039855,0.00014407269,0.00012566413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005632588,0.00011424901,0.00020212971,0.000008705885,0.00020165897,0.000025561985,0.00028486416,0.000023042488,0.00031952318],"category_scores_gemma":[0.0001086574,0.000076926975,0.00014095302,0.00035452162,0.00012984051,0.000045215806,0.00013360636,0.00007921288,0.00006617913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011778764,0.000060056063,0.000033340315,0.000011250371,0.000028395596,2.4542336e-8,0.00061738235,0.0012274313,0.0008768586,0.9965126,0.0005125459,0.00011896413],"study_design_scores_gemma":[0.00031420073,0.000028619801,0.000027707989,0.000053100805,0.00009812755,3.9573092e-7,0.0011091519,0.00784391,0.0078144595,0.9541507,0.02835151,0.00020815904],"about_ca_topic_score_codex":0.0000068351087,"about_ca_topic_score_gemma":0.0000012651358,"teacher_disagreement_score":0.97663146,"about_ca_system_score_codex":0.000010156662,"about_ca_system_score_gemma":0.000023156219,"threshold_uncertainty_score":0.34985548},"labels":[],"label_agreement":null},{"id":"W2990801125","doi":"10.55016/ojs/cdm.v16i3.70415","title":"The Tutte Polynomial of Complex Reflection Groups","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Tutte polynomial; Mathematics; Hyperplane; Graph","score_opus":0.03231126392902599,"score_gpt":0.3491339595641797,"score_spread":0.3168226956351537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990801125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09084458,0.00029984012,0.8861963,0.005839687,0.0017638565,0.0020461357,0.00076952064,0.00045227702,0.011787776],"genre_scores_gemma":[0.86000097,0.000056851644,0.13645989,0.00011721574,0.0004911432,0.00020432132,0.00006802284,0.00012209718,0.0024795227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972725,0.0001587739,0.001143307,0.00031291656,0.00056632975,0.00054615445],"domain_scores_gemma":[0.9943127,0.002579319,0.0005070443,0.0012962824,0.0011120036,0.00019265068],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00084499014,0.0003070099,0.0006556387,0.0000847978,0.00061710423,0.000114169714,0.00049931457,0.00013971659,0.000073366355],"category_scores_gemma":[0.010259732,0.00023979406,0.00027706363,0.0007631765,0.00019624273,0.00013075511,0.00035625242,0.00026467603,0.00007275344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002324164,0.00025685653,0.000007105137,0.00013868653,0.00011437124,0.0000066917046,0.0007413056,0.000021828304,0.010233151,0.97767264,0.010401299,0.00038284104],"study_design_scores_gemma":[0.00086998485,0.00010124918,0.000055188255,0.00018906518,0.00018903689,0.000065938664,0.0011249267,0.0016353254,0.024295053,0.9578713,0.013253885,0.00034902222],"about_ca_topic_score_codex":0.0000034739514,"about_ca_topic_score_gemma":0.00003053832,"teacher_disagreement_score":0.7691564,"about_ca_system_score_codex":0.00025421058,"about_ca_system_score_gemma":0.00018248509,"threshold_uncertainty_score":0.9980773},"labels":[],"label_agreement":null},{"id":"W2991942175","doi":"10.55016/ojs/cdm.v15i2.68115","title":"On irreversible spread of influence in edge-weighted graphs","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enhanced Data Rates for GSM Evolution; Mathematics; Undirected graph; Weighted network; Combinatorics; Graph; Process (computing); Graph theory; Topology (electrical circuits); Computer science; Discrete mathematics; Complex network; Artificial intelligence","score_opus":0.01114365547724431,"score_gpt":0.28134584542862057,"score_spread":0.27020218995137624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991942175","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.728488,0.000029070687,0.2619705,0.0013352627,0.000019450179,0.00068837975,0.00042619745,0.00009688861,0.006946256],"genre_scores_gemma":[0.99465996,0.0000014050988,0.005072974,0.00010433861,0.000028628823,0.00004157128,0.000045187615,0.000011053188,0.000034866494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989883,0.000034440625,0.0004066671,0.00019290693,0.0001584834,0.00021920644],"domain_scores_gemma":[0.99908257,0.00017348168,0.00013684695,0.00031629117,0.00016847276,0.00012233811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012623866,0.0001460268,0.00035669687,0.00012830763,0.000054666845,0.000024611796,0.0002678866,0.000031507712,0.00020579732],"category_scores_gemma":[0.00010744999,0.0001371135,0.00013882913,0.00090497814,0.000045769328,0.00007315181,0.000106831365,0.0001389009,0.00006015038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020427948,0.00022755137,0.0060578096,0.000037913916,0.0000911032,0.0000015264643,0.0007966559,0.001107975,0.0019505591,0.98527133,0.003766719,0.0006703941],"study_design_scores_gemma":[0.0015391022,0.00041571056,0.0046448624,0.0006861458,0.0002590486,5.5442405e-7,0.00068921375,0.05473686,0.035785932,0.8969201,0.0034824808,0.0008400026],"about_ca_topic_score_codex":0.00004332173,"about_ca_topic_score_gemma":0.000005453659,"teacher_disagreement_score":0.26617196,"about_ca_system_score_codex":0.000033502973,"about_ca_system_score_gemma":0.00003547853,"threshold_uncertainty_score":0.5591326},"labels":[],"label_agreement":null},{"id":"W3016867789","doi":"10.55016/ojs/cdm.v17i2.70232","title":"Designs for graphs with six vertices and ten edges - II","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Computer science; Artificial intelligence","score_opus":0.01315523726742908,"score_gpt":0.23704203511170552,"score_spread":0.22388679784427643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016867789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44645867,0.0008654527,0.5465981,0.00060094555,0.00027718773,0.001876731,0.0016286746,0.00047963837,0.0012145964],"genre_scores_gemma":[0.9959932,0.0000049410055,0.0029464273,0.000027784334,0.000022771224,0.00075761386,0.00003266476,0.00002727602,0.00018729627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992867,0.000026828515,0.00019240618,0.00012853362,0.00011766331,0.00024788664],"domain_scores_gemma":[0.9994328,0.00016683924,0.000032160504,0.00021386746,0.000056018725,0.00009828442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002799705,0.00013778289,0.00020779925,0.00009343921,0.000619539,0.0000442307,0.00014132631,0.000027603846,0.000023978697],"category_scores_gemma":[0.000066267545,0.00011635735,0.000051522955,0.00024030608,0.000040550396,0.00007063603,0.000066268054,0.000084713975,0.000003543845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067282526,0.00011592296,0.00019367095,0.00046685568,0.00034660564,0.0000050778926,0.0055837925,0.010653747,0.0072950213,0.97043467,0.004270644,0.00056674005],"study_design_scores_gemma":[0.006040844,0.0036191728,0.00077137526,0.00053898257,0.0013073063,0.00030611514,0.021398949,0.147488,0.018796109,0.64398867,0.15291503,0.002829461],"about_ca_topic_score_codex":0.0000014738409,"about_ca_topic_score_gemma":0.0000051898933,"teacher_disagreement_score":0.54953456,"about_ca_system_score_codex":0.000042287054,"about_ca_system_score_gemma":0.000012677268,"threshold_uncertainty_score":0.47650555},"labels":[],"label_agreement":null},{"id":"W3023069363","doi":"10.55016/ojs/cdm.v19i3.75096","title":"note on total co-independent domination in trees","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Junta de Andalucía","keywords":"Mathematics; Combinatorics","score_opus":0.015496870354148162,"score_gpt":0.3529796377747737,"score_spread":0.33748276742062555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023069363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01377313,0.00008983337,0.9784585,0.0033987053,0.00018779913,0.0005717541,0.00012293113,0.00021990253,0.0031774472],"genre_scores_gemma":[0.9836233,0.000005944388,0.015349314,0.00005628101,0.00004899489,0.00013022577,0.000015651965,0.000015436703,0.0007548359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834013,0.00008407029,0.0003288017,0.00037860614,0.00046940884,0.0003990103],"domain_scores_gemma":[0.9985866,0.00055450515,0.00003535362,0.0005765749,0.000108770604,0.00013818465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008174633,0.00016037936,0.00020121304,0.0004985198,0.000120125274,0.0003315489,0.00055549026,0.00007091531,0.000029685301],"category_scores_gemma":[0.00065333734,0.00013780137,0.00009018124,0.0009576983,0.00005034887,0.0003725839,0.00018641757,0.0002684942,0.0005328507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008358721,0.00008176541,0.0000061364462,0.000030119816,0.000010758827,0.00004861194,0.0014209945,0.0008866149,0.0021009028,0.987972,0.00027783582,0.007155902],"study_design_scores_gemma":[0.0007577944,0.0003120024,0.00077980175,0.00052403763,0.0000133220465,0.000053863034,0.00020876943,0.45371816,0.013478427,0.5264587,0.0032094915,0.0004856364],"about_ca_topic_score_codex":0.0000023595776,"about_ca_topic_score_gemma":0.000017155544,"teacher_disagreement_score":0.9698502,"about_ca_system_score_codex":0.0003494688,"about_ca_system_score_gemma":0.00009293205,"threshold_uncertainty_score":0.68488955},"labels":[],"label_agreement":null},{"id":"W3028574858","doi":"10.55016/ojs/cdm.v5i2.61924","title":"Strictly chained (p,q)-ary partitions","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences","funders":"","keywords":"Combinatorics; Mathematics","score_opus":0.02391838388147406,"score_gpt":0.3561073157416324,"score_spread":0.33218893186015835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3028574858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08562334,0.000049442486,0.84824353,0.006528718,0.00094597024,0.002584114,0.001556226,0.0014919427,0.052976742],"genre_scores_gemma":[0.6827422,0.000011195616,0.3053192,0.00036101203,0.00053240935,0.00078076485,0.0000869278,0.00014686557,0.010019455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731374,0.000052254847,0.0009217164,0.00040799638,0.00053624634,0.0007680448],"domain_scores_gemma":[0.9958068,0.0014911229,0.0002549348,0.001244904,0.0005627991,0.0006394043],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006680673,0.0003996116,0.0006310959,0.00025488602,0.00051614747,0.00018145512,0.0005763055,0.00021300648,0.0012606285],"category_scores_gemma":[0.014937213,0.000359976,0.00025515887,0.0006628835,0.0002373931,0.00033593402,0.00028987578,0.00058409903,0.00085867895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054862676,0.00032547832,0.000010610555,0.00013203773,0.000054338867,0.000009832421,0.0006026608,0.0000104375595,0.006403627,0.980989,0.011391338,0.00006515426],"study_design_scores_gemma":[0.00046056046,0.00006167842,0.000033981087,0.000107470936,0.00015242184,0.00004522949,0.00047025507,0.0010002067,0.004890483,0.98472387,0.0075896997,0.00046413956],"about_ca_topic_score_codex":0.000004556044,"about_ca_topic_score_gemma":0.00008491812,"teacher_disagreement_score":0.59711885,"about_ca_system_score_codex":0.00011168024,"about_ca_system_score_gemma":0.00013429666,"threshold_uncertainty_score":0.9999193},"labels":[],"label_agreement":null},{"id":"W3035268094","doi":"10.55016/ojs/cdm.v18i1.71282","title":"Confining the robber on cographs","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Sociology; Computer science","score_opus":0.027986143969503535,"score_gpt":0.34651970039259955,"score_spread":0.318533556423096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035268094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060071726,0.000031814412,0.97332495,0.012280765,0.00019860711,0.00068383454,0.000104624036,0.0006217475,0.0067464975],"genre_scores_gemma":[0.97999805,0.000021553527,0.016180906,0.00089380244,0.00008436044,0.00037248773,0.00002468814,0.000033138538,0.0023909935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982935,0.00011045681,0.00027482986,0.00030312393,0.00045139896,0.00056669774],"domain_scores_gemma":[0.9971029,0.0012843738,0.000070558046,0.001147835,0.0002280815,0.00016626027],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001133375,0.00015923256,0.00019024784,0.00027363474,0.0005956905,0.0002482029,0.0013116605,0.00004866733,0.00002545367],"category_scores_gemma":[0.0013456228,0.00010585582,0.00012060851,0.0023725128,0.00013664507,0.00014895883,0.00048267393,0.00024354158,0.0017324571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003235941,0.000022228822,0.0000105239515,0.000006806576,0.000022694669,0.000008216109,0.0007833515,0.00079930096,0.00028048028,0.99273163,0.0039293985,0.001402144],"study_design_scores_gemma":[0.00057209376,0.00022061054,0.00065715925,0.00014115465,0.000019840885,0.00001971873,0.0007058844,0.09088482,0.003011286,0.86952287,0.03380365,0.00044093805],"about_ca_topic_score_codex":0.0000014861891,"about_ca_topic_score_gemma":0.0000027893082,"teacher_disagreement_score":0.9739909,"about_ca_system_score_codex":0.000046463872,"about_ca_system_score_gemma":0.000051542353,"threshold_uncertainty_score":0.99904484},"labels":[],"label_agreement":null},{"id":"W3048753990","doi":"10.55016/ojs/cdm.v18i1.71209","title":"The localization number and metric dimension of graphs of diameter 2","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Vancouver Island University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metric dimension; Mathematics; Dimension (graph theory); Metric (unit); Combinatorics; Upper and lower bounds; Chordal graph; Discrete mathematics; Metric space; Graph; 1-planar graph; Mathematical analysis","score_opus":0.011312506953026867,"score_gpt":0.2742144988106574,"score_spread":0.2629019918576305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048753990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12659276,0.00026619885,0.8708092,0.0013452495,0.00017583136,0.0003964519,0.000050896437,0.00013508754,0.00022834465],"genre_scores_gemma":[0.9864028,0.00008434257,0.0133755775,0.000037732585,0.0000018657195,0.00001200623,0.0000069058156,0.0000065889544,0.00007218636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989723,0.00005132829,0.00038680783,0.00015313397,0.00025343854,0.00018296862],"domain_scores_gemma":[0.9984009,0.00054483843,0.00016175026,0.00046261257,0.00035803157,0.00007185537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007150348,0.000088690875,0.00018787828,0.00018700701,0.00019375133,0.00004445819,0.0002567572,0.000042307223,0.0000018717329],"category_scores_gemma":[0.00081739237,0.000058264097,0.00006290033,0.002076775,0.00010887788,0.00008678139,0.0002388506,0.000046219477,0.0000240991],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021911321,0.00003354554,0.0004308376,0.000045926772,0.000029069124,5.457344e-7,0.00067240896,0.0005336164,0.0020003957,0.993642,0.0014173418,0.0011921598],"study_design_scores_gemma":[0.00042708626,0.00009779765,0.00079763524,0.00015398025,0.000051204166,0.000006613796,0.00024738465,0.2791075,0.015036867,0.703374,0.0005222338,0.00017764716],"about_ca_topic_score_codex":0.000008560813,"about_ca_topic_score_gemma":0.0000016584621,"teacher_disagreement_score":0.85981005,"about_ca_system_score_codex":0.000009224515,"about_ca_system_score_gemma":0.000022328537,"threshold_uncertainty_score":0.2375941},"labels":[],"label_agreement":null},{"id":"W3088613651","doi":"10.55016/ojs/cdm.v16i1.71194","title":"A survey of graph burning","year":2021,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graph; Conjecture; Combinatorics; Computer science; Discrete mathematics; Theoretical computer science; Mathematics","score_opus":0.04110074314837459,"score_gpt":0.35548392388664524,"score_spread":0.31438318073827065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088613651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016959326,0.0007507601,0.9793805,0.00036616778,0.00026192915,0.0007262146,0.00085467024,0.00013948741,0.0005609724],"genre_scores_gemma":[0.8091154,0.00005675521,0.19015533,0.000039593888,0.000028691702,0.0001637001,0.00024982207,0.000032482327,0.00015819712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99677664,0.00046580646,0.0008372392,0.0006757662,0.00067910424,0.0005654313],"domain_scores_gemma":[0.9936331,0.0010880379,0.00042776894,0.002426808,0.002147767,0.00027651136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002315444,0.00034012605,0.00084020593,0.0004356835,0.00017633065,0.00034297595,0.0023613975,0.00023430743,0.000028080087],"category_scores_gemma":[0.005609651,0.00032925067,0.00029166113,0.0015738597,0.00015213068,0.0001852405,0.0045617814,0.00071445067,0.00002608579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021028143,0.0005571348,0.00079160393,0.0011712322,0.000584998,0.00007143668,0.005494094,0.010905764,0.0026085004,0.9735563,0.00071257656,0.003525359],"study_design_scores_gemma":[0.0009914131,0.00023275927,0.009727581,0.0028821153,0.00013489678,0.000039571558,0.0005344877,0.1604033,0.012830037,0.8100673,0.00029632085,0.0018602412],"about_ca_topic_score_codex":0.000069692695,"about_ca_topic_score_gemma":0.00006632196,"teacher_disagreement_score":0.7921561,"about_ca_system_score_codex":0.00013305942,"about_ca_system_score_gemma":0.0005145166,"threshold_uncertainty_score":0.99991596},"labels":[],"label_agreement":null},{"id":"W3089570406","doi":"10.55016/ojs/cdm.v20i2.74490","title":"Orthogonal colourings of tensor graphs","year":2025,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.004453893162943379,"score_gpt":0.24175436573638104,"score_spread":0.23730047257343767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089570406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77331537,0.00047155653,0.19120015,0.00028818933,0.0005113525,0.0008420785,0.00073982956,0.0004295446,0.032201946],"genre_scores_gemma":[0.99798566,0.000007506194,0.0014006281,0.000026137384,0.00001298639,0.0000705291,0.000012546158,0.000012519817,0.00047148374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991749,0.000020082864,0.00038029067,0.000100176214,0.00010732118,0.00021724544],"domain_scores_gemma":[0.99931943,0.00012928875,0.000039417606,0.0002955366,0.00014524756,0.00007107884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023833184,0.00013157059,0.0002856577,0.0001889058,0.000079612946,0.000020408346,0.00018202861,0.00007339693,0.00003180802],"category_scores_gemma":[0.0001805133,0.000121301826,0.00012329257,0.0005228649,0.00005471469,0.000042485524,0.000037333524,0.00009179843,0.00003739056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059721206,0.000035726665,0.00033138925,0.00029177833,0.000120489036,0.0000013945054,0.0002801829,0.0011083989,0.005444502,0.99021554,0.0020493905,0.00011522074],"study_design_scores_gemma":[0.0028663308,0.00023013976,0.008983219,0.0025864833,0.0006851848,0.000040120125,0.002692601,0.036769684,0.08732378,0.8073341,0.049006864,0.0014814798],"about_ca_topic_score_codex":0.0000012865268,"about_ca_topic_score_gemma":0.0000034540599,"teacher_disagreement_score":0.22467032,"about_ca_system_score_codex":0.000037272617,"about_ca_system_score_gemma":0.000021005311,"threshold_uncertainty_score":0.4946545},"labels":[],"label_agreement":null},{"id":"W3099079581","doi":"10.55016/ojs/cdm.v16i3.71526","title":"Polytopal balls arising in optimization","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Dual polyhedron; Polytope; Mathematics; Combinatorics; Unit sphere; Ball (mathematics); Hypercube; Unit cube; Norm (philosophy); Geometry","score_opus":0.008618149046474167,"score_gpt":0.25580223212039116,"score_spread":0.24718408307391698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099079581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022687248,0.00016697531,0.98686296,0.000557297,0.00018027415,0.00019411568,0.0000906027,0.00021811992,0.00946092],"genre_scores_gemma":[0.78997445,0.00009589162,0.20875631,0.00018026543,0.00007945324,0.000046415113,0.00023651466,0.000054882665,0.0005757997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991814,0.000022111079,0.00031460857,0.00012501783,0.000115412746,0.00024148119],"domain_scores_gemma":[0.99945605,0.00006346819,0.000025083229,0.00022737535,0.00013554764,0.00009249177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001431084,0.00012090565,0.00018457625,0.00011431352,0.00006352854,0.00010530575,0.00008355221,0.00007664035,0.00020867024],"category_scores_gemma":[0.00030151202,0.00013288876,0.000043746113,0.00058386876,0.000012782429,0.00010215748,0.00003547247,0.00011402926,0.000070073074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.53775e-7,0.000026297044,0.000064925094,0.00003862307,0.000011470457,0.000006114958,0.00045702548,0.98680425,0.00051314256,0.01150087,0.00041870176,0.00015781264],"study_design_scores_gemma":[0.00036773403,0.0000077935665,0.00009125631,0.00015487283,0.00001647098,0.000013705089,0.00016823168,0.9930158,0.0027470964,0.0012748356,0.0019208983,0.00022129179],"about_ca_topic_score_codex":0.0000019997026,"about_ca_topic_score_gemma":0.000017172873,"teacher_disagreement_score":0.7877057,"about_ca_system_score_codex":0.00012281419,"about_ca_system_score_gemma":0.000038402337,"threshold_uncertainty_score":0.5419047},"labels":[],"label_agreement":null},{"id":"W3100427284","doi":"","title":"Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Hamiltonian path; Hamiltonian (control theory); Degree (music); Upper and lower bounds; Discrete mathematics; Mathematical analysis; Physics; Graph; Mathematical optimization","score_opus":0.0222772638909818,"score_gpt":0.32917001272122837,"score_spread":0.3068927488302466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100427284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39925566,0.00046704043,0.537957,0.002553426,0.0012720141,0.002697898,0.009693929,0.0010265161,0.045076538],"genre_scores_gemma":[0.97395134,0.000014459472,0.021626513,0.0004682545,0.00035932666,0.00007137715,0.00014928888,0.00008520816,0.0032742217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752074,0.00009557219,0.0006549743,0.00043842918,0.0004726266,0.0008176341],"domain_scores_gemma":[0.9973563,0.0005006099,0.00023530738,0.0011010143,0.00045911164,0.00034766653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007617291,0.0004016867,0.0005455475,0.00017625533,0.0012321016,0.00012453599,0.00066916656,0.0002452165,0.0008366462],"category_scores_gemma":[0.0020344655,0.00032787546,0.00025036503,0.00042827096,0.00026693055,0.00018845357,0.00051110703,0.0002522739,0.00039848837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041440017,0.00017483569,0.000055666904,0.00009778592,0.0001173291,0.0000047503004,0.0023327773,5.493972e-7,0.0021520113,0.8778206,0.11667119,0.00053102843],"study_design_scores_gemma":[0.0016631241,0.00027163958,0.00020262793,0.00026206477,0.00024590272,0.000024975829,0.0006722788,0.002058734,0.010160009,0.90952486,0.0741618,0.0007519764],"about_ca_topic_score_codex":0.0000047269477,"about_ca_topic_score_gemma":0.00002778578,"teacher_disagreement_score":0.5746957,"about_ca_system_score_codex":0.0001614504,"about_ca_system_score_gemma":0.00004689102,"threshold_uncertainty_score":0.9999173},"labels":[],"label_agreement":null},{"id":"W3103428152","doi":"10.55016/ojs/cdm.v12i1.62551","title":"The conjugacy problem for automorphism groups of homogeneous digraphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conjugacy class; Combinatorics; Automorphism; Homogeneous; Automorphism group; Conjugacy problem; Outer automorphism group; Discrete mathematics","score_opus":0.047924952731339794,"score_gpt":0.3849457489432524,"score_spread":0.3370207962119126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3103428152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19944939,0.0006653044,0.737726,0.015016578,0.00079837494,0.015502017,0.0074787773,0.0005764545,0.02278715],"genre_scores_gemma":[0.94326645,0.000040893025,0.05229409,0.00003969767,0.00016354899,0.0011780219,0.00003869596,0.00009961176,0.0028790038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973723,0.00010462171,0.0009096228,0.0003271924,0.0005157539,0.0007705043],"domain_scores_gemma":[0.9915285,0.0041375873,0.00070554856,0.0023463177,0.0010479549,0.00023408352],"candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.0026253886,0.0003025036,0.0006145795,0.00012749346,0.002268792,0.00041664185,0.0017333502,0.0001487172,0.00003976537],"category_scores_gemma":[0.013993858,0.00021229201,0.00036023578,0.00017810879,0.000709302,0.00016440898,0.00049188663,0.00022692021,0.00005237065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006882094,0.00017332098,0.00004187861,0.0002847022,0.00017020856,0.0000035103742,0.000732906,0.0000038249527,0.0014772224,0.9909534,0.0052723764,0.0008178305],"study_design_scores_gemma":[0.0010872589,0.000256603,0.000102590675,0.00021024313,0.00015828907,0.000021988184,0.00036189926,0.0020498105,0.0044471174,0.98309547,0.007911001,0.00029772098],"about_ca_topic_score_codex":0.000010261006,"about_ca_topic_score_gemma":0.000057272166,"teacher_disagreement_score":0.74381703,"about_ca_system_score_codex":0.00011249759,"about_ca_system_score_gemma":0.00014682364,"threshold_uncertainty_score":0.9990301},"labels":[],"label_agreement":null},{"id":"W3114956369","doi":"10.55016/ojs/cdm.v16i3.72075","title":"On the real roots of domination polynomials","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Dominating set; Closure (psychology); Cardinality (data modeling); Graph; Domination analysis; Order (exchange); Discrete mathematics","score_opus":0.019161338421442364,"score_gpt":0.3299928174266208,"score_spread":0.31083147900517843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114956369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037718117,0.00003912935,0.9493649,0.006685999,0.00009979719,0.00038680632,0.00010808852,0.00005394469,0.005543233],"genre_scores_gemma":[0.9746316,0.00001412027,0.024468144,0.00013708687,0.000032187687,0.00006560995,0.000009207659,0.000009430726,0.00063259306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867415,0.00017255396,0.0003191825,0.0002136221,0.00036381054,0.00025666782],"domain_scores_gemma":[0.9968015,0.001488501,0.00011647816,0.0009684969,0.000535439,0.00008957427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084401795,0.000105452564,0.00020265418,0.00009644876,0.00019905774,0.00009070773,0.0006898917,0.000043626176,0.00004294753],"category_scores_gemma":[0.003194045,0.00007400691,0.000095899304,0.0007756103,0.000081343176,0.00013545029,0.00031803985,0.000118992575,0.0000853962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004667977,0.00006292908,0.0000044247786,0.000010376478,0.000016267717,0.0000037499915,0.00029225662,0.00011555667,0.012286637,0.98595923,0.00052056916,0.0007233236],"study_design_scores_gemma":[0.000346224,0.000096645854,0.00041452964,0.000101448204,0.000013359615,0.000009124705,0.00021523375,0.01176219,0.12660186,0.8597077,0.0005724753,0.0001591654],"about_ca_topic_score_codex":0.000002195792,"about_ca_topic_score_gemma":0.000005527066,"teacher_disagreement_score":0.9369135,"about_ca_system_score_codex":0.00008115144,"about_ca_system_score_gemma":0.00012293555,"threshold_uncertainty_score":0.3823801},"labels":[],"label_agreement":null},{"id":"W3115384833","doi":"10.55016/ojs/cdm.v15i1.62630","title":"Nordhaus-Gaddum type inequalities for multiple domination and packing parameters in graphs","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Upper and lower bounds; Domination analysis; Type (biology); Discrete mathematics","score_opus":0.0494903473845529,"score_gpt":0.33917181318300416,"score_spread":0.2896814657984513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115384833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09813225,0.000078143516,0.89738965,0.0032917815,0.000050727223,0.00081951724,0.00010715585,0.000080038066,0.0000507505],"genre_scores_gemma":[0.86763173,0.000010881071,0.13194926,0.0002162035,0.000013822457,0.00012924685,0.000017227203,0.000011276327,0.000020345045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998805,0.00007083454,0.0003190531,0.00028789492,0.00018138158,0.00033587238],"domain_scores_gemma":[0.9981879,0.0010341369,0.000079831516,0.00028467248,0.00024906464,0.00016438028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005175965,0.00013370096,0.0002391439,0.00017051546,0.0001448626,0.00014838371,0.0003713117,0.000050329527,0.0000017987418],"category_scores_gemma":[0.004078943,0.00012539538,0.00005115637,0.00076978956,0.000070314876,0.0003276106,0.00022216397,0.000112843896,0.000010181282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043774755,0.00004062684,0.0004963802,0.00012579019,0.000021140037,0.0000029797104,0.005815108,0.00045955332,0.0014456317,0.9888055,0.00014480676,0.0025987646],"study_design_scores_gemma":[0.0017402695,0.00039941247,0.00062580075,0.00012900982,0.000017462695,0.000004669176,0.0014448852,0.3556331,0.0061630933,0.63236225,0.0010492502,0.00043079414],"about_ca_topic_score_codex":0.000004530174,"about_ca_topic_score_gemma":0.00001584604,"teacher_disagreement_score":0.7694995,"about_ca_system_score_codex":0.000053534157,"about_ca_system_score_gemma":0.000038058326,"threshold_uncertainty_score":0.5113475},"labels":[],"label_agreement":null},{"id":"W3118184077","doi":"10.11575/cdm.vi.62290","title":"A complete solution to the spectrum problem for graphs with six vertices and up to nine edges","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Cograph; 1-planar graph; Indifference graph; Chordal graph; Pathwidth; Metric dimension; Vertex (graph theory); Discrete mathematics; Neighbourhood (mathematics); Clique-sum; Graph; Line graph","score_opus":0.02038946915703298,"score_gpt":0.2462494282127911,"score_spread":0.22585995905575812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118184077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08920434,0.00024077196,0.9001954,0.0056578205,0.00026871625,0.0027341351,0.00074718584,0.00024567163,0.0007059199],"genre_scores_gemma":[0.99204975,0.000002316895,0.0069076885,0.00009225428,0.0000777222,0.00058963354,0.000028028617,0.000029673207,0.00022293383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990358,0.0000288317,0.00025699392,0.00016730698,0.00015372783,0.00035737807],"domain_scores_gemma":[0.9990872,0.00012644,0.0000350629,0.00031688914,0.00015007031,0.00028433287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047679222,0.00018383609,0.0002558865,0.00010312151,0.00020635415,0.00011310383,0.00018860406,0.000042711745,0.0000043918176],"category_scores_gemma":[0.0001647716,0.0001229724,0.000046629844,0.00037819234,0.00003816852,0.00008285907,0.00005399857,0.000070471695,0.00005334447],"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.00025928864,0.00007952229,0.00016118417,0.00066765735,0.0004351149,0.0000028782995,0.02276992,0.023898834,0.0076456154,0.8975325,0.04581174,0.0007357427],"study_design_scores_gemma":[0.0068858806,0.0041223615,0.0009636285,0.002299945,0.0011346457,0.000216178,0.016881047,0.1863515,0.013115458,0.3395561,0.42537686,0.0030963875],"about_ca_topic_score_codex":0.000009269601,"about_ca_topic_score_gemma":0.00016451314,"teacher_disagreement_score":0.9028454,"about_ca_system_score_codex":0.00006186308,"about_ca_system_score_gemma":0.000018223036,"threshold_uncertainty_score":0.50146693},"labels":[],"label_agreement":null},{"id":"W3118723405","doi":"10.11575/cdm.v15i1.62606","title":"Pell Coding and Pell Decoding Methods with Some Applications","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Decoding methods; Coding (social sciences); Coding theory; Mathematics; Combinatorics; Algorithm; Arithmetic; Computer science; Discrete mathematics; Statistics","score_opus":0.011925442076098415,"score_gpt":0.3222616855712542,"score_spread":0.31033624349515576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118723405","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046327566,0.00011595792,0.9918056,0.0019199795,0.000073155315,0.00045310892,0.000030183915,0.00022125877,0.00074797595],"genre_scores_gemma":[0.13296682,0.000007807644,0.8663838,0.0002209393,0.00021585288,0.000049043912,0.000003962992,0.000015097819,0.00013665414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871075,0.00006538902,0.00027099007,0.0003940952,0.00017308025,0.00038572316],"domain_scores_gemma":[0.99841917,0.00038970468,0.00011489216,0.00062223984,0.00023423399,0.00021979067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005809476,0.00019050529,0.00025208216,0.0001361844,0.0006021138,0.00030379798,0.0005334638,0.00005298094,0.0000064685796],"category_scores_gemma":[0.00015834639,0.00014762623,0.00004725902,0.00052684953,0.00014396859,0.00018284225,0.00039336816,0.0001530723,0.000061235725],"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.000003438419,0.00006471499,0.00002254682,0.000056432134,0.000050908726,0.0000034905618,0.0026340524,0.00022099752,0.0021749162,0.9571927,0.0003130714,0.03726271],"study_design_scores_gemma":[0.00036422248,0.00020273663,0.00010303432,0.00013417382,0.000043591164,0.00010383611,0.00012687297,0.89923555,0.0047764294,0.08531166,0.009206235,0.00039163243],"about_ca_topic_score_codex":0.0000034194838,"about_ca_topic_score_gemma":0.000003032849,"teacher_disagreement_score":0.8990146,"about_ca_system_score_codex":0.000044905082,"about_ca_system_score_gemma":0.00005786517,"threshold_uncertainty_score":0.60200226},"labels":[],"label_agreement":null},{"id":"W3119622264","doi":"10.55016/ojs/cdm.v15i1.62679","title":"Total colouring of some cartesian and direct product graphs","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cartesian product; Combinatorics; Mathematics; Bipartite graph; Chromatic scale; Graph; Direct product; Windmill graph; Discrete mathematics; Graph power; Line graph","score_opus":0.01224504562014082,"score_gpt":0.24493825443889572,"score_spread":0.2326932088187549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119622264","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7015033,0.0022590675,0.25988623,0.03179319,0.00034775777,0.001620506,0.00029878045,0.00072221394,0.0015689777],"genre_scores_gemma":[0.9679458,0.000009853262,0.03178486,0.000187042,0.000010419916,0.000019205663,0.0000034141237,0.000007682154,0.000031708278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989363,0.000032842167,0.00031827547,0.000290444,0.00019051795,0.0002316444],"domain_scores_gemma":[0.9990436,0.00009034663,0.000101330035,0.00036411016,0.00017113816,0.00022949789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024168739,0.00012788156,0.00028112213,0.00008197605,0.00013712919,0.000075724995,0.00026565674,0.00003223851,0.000002726415],"category_scores_gemma":[0.000511629,0.00011076878,0.00006630031,0.0004872398,0.00006774523,0.00017986738,0.00024234595,0.000080770944,0.000013567327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039925426,0.00006251668,0.00014280195,0.00012380553,0.00004365755,0.00000466524,0.0025947893,0.00022225281,0.016670246,0.9787825,0.0008155613,0.0005332081],"study_design_scores_gemma":[0.0025490972,0.0011824301,0.0020987373,0.00064463465,0.00024915248,0.00009333685,0.0005440617,0.21192247,0.15401419,0.6237539,0.0014520603,0.0014959411],"about_ca_topic_score_codex":0.0000061360724,"about_ca_topic_score_gemma":7.420834e-7,"teacher_disagreement_score":0.35502863,"about_ca_system_score_codex":0.000011806377,"about_ca_system_score_gemma":0.000041498653,"threshold_uncertainty_score":0.45170197},"labels":[],"label_agreement":null},{"id":"W3123301734","doi":"10.55016/ojs/cdm.v15i3.62663","title":"Two properties of maximal antichains in strict chain product posets","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Partially ordered set; Bijection; Combinatorics; Mathematics; Product (mathematics); Chain (unit); Discrete mathematics; Physics","score_opus":0.05162957173494855,"score_gpt":0.331628948203587,"score_spread":0.2799993764686385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123301734","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7668748,0.0003848602,0.21793054,0.009533525,0.00014473232,0.0028058186,0.00050010125,0.0002717096,0.0015539128],"genre_scores_gemma":[0.91415554,0.000010104666,0.085315734,0.00013671331,0.00012746114,0.00008722089,0.000011674499,0.000047349058,0.000108198146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765253,0.0001140821,0.0009416801,0.00038594985,0.0004100218,0.0004957246],"domain_scores_gemma":[0.9982783,0.0002828483,0.00028485837,0.0006215728,0.00032628953,0.0002061372],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005818766,0.00029613185,0.00069550285,0.00016931484,0.00009294762,0.000035376037,0.00045934002,0.00007309007,0.000035404653],"category_scores_gemma":[0.009961986,0.0002571818,0.00012358864,0.0008273219,0.00012933406,0.00015033665,0.0002825013,0.0002894112,0.00004169704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066390334,0.00037657714,0.00027217588,0.00077478075,0.00006920056,0.00001867095,0.0055837994,0.00009733136,0.02986387,0.96224,0.00036642392,0.00027077284],"study_design_scores_gemma":[0.0038251907,0.00050398696,0.0004528512,0.0013844119,0.00023599042,0.00003787812,0.003110407,0.018378256,0.18080632,0.7889167,0.0010125763,0.0013354068],"about_ca_topic_score_codex":0.0000068014215,"about_ca_topic_score_gemma":0.000017742512,"teacher_disagreement_score":0.17332329,"about_ca_system_score_codex":0.0001397333,"about_ca_system_score_gemma":0.00011900987,"threshold_uncertainty_score":0.999988},"labels":[],"label_agreement":null},{"id":"W3125851689","doi":"10.55016/ojs/cdm.v18i1.72779","title":"Beck-type companion identities for Franklin's identity","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Identity (music); Mathematics; Combinatorics; Type (biology); Conjecture; Euler's formula; Element (criminal law); Order (exchange); Discrete mathematics; Pure mathematics; Law; Mathematical analysis; Philosophy","score_opus":0.06141344593056062,"score_gpt":0.4058369316031631,"score_spread":0.34442348567260245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125851689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08018536,0.0001036485,0.9086658,0.0014624058,0.0009959886,0.002909006,0.0013170074,0.0016734672,0.0026873145],"genre_scores_gemma":[0.6416097,0.00018844195,0.29577112,0.0003740652,0.0013475063,0.00240222,0.0008562298,0.000529919,0.05692079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968706,0.00006343301,0.0010253274,0.00045393378,0.0007059404,0.0008807727],"domain_scores_gemma":[0.99515545,0.002336063,0.00029929567,0.00090771634,0.0010071608,0.0002942883],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001256616,0.00041288,0.0008323654,0.00040885754,0.000648624,0.00033427327,0.0006829207,0.00018305326,0.00016736622],"category_scores_gemma":[0.011596664,0.00039402593,0.00034567981,0.0012751183,0.00018681785,0.00073669787,0.00042670628,0.00021404457,0.0014210762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014541962,0.00014103446,0.000023402545,0.0007890107,0.00011223725,0.000006493568,0.0011908667,0.000069122325,0.001006248,0.96013135,0.03647669,0.00003902888],"study_design_scores_gemma":[0.0006565447,0.00009604395,0.000060670183,0.0002677084,0.00022499327,0.000013093403,0.0022007737,0.0046589244,0.0016911764,0.9869635,0.0026928687,0.00047370433],"about_ca_topic_score_codex":0.0000052759433,"about_ca_topic_score_gemma":0.00003121637,"teacher_disagreement_score":0.6128947,"about_ca_system_score_codex":0.00023635942,"about_ca_system_score_gemma":0.00008488896,"threshold_uncertainty_score":0.99985117},"labels":[],"label_agreement":null},{"id":"W3134287918","doi":"10.55016/ojs/cdm.v17i2.72263","title":"Coverings with congruent and non-congruent hyperballs generated by doubly truncated Coxeter orthoschemes","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Supramolecular Self-Assembly in Materials","field":"Materials Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Coxeter group; Combinatorics; Mathematics; Upper and lower bounds; Space (punctuation); Simplex; Hyperbolic space; Tetrahedron; Complement (music); Geometry; Mathematical analysis","score_opus":0.005797694538495067,"score_gpt":0.2437620962796846,"score_spread":0.23796440174118952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134287918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9638733,0.00013329422,0.030794818,0.00069272495,0.00032294937,0.0013429385,0.0023734416,0.00020150536,0.00026501744],"genre_scores_gemma":[0.9887069,0.000009369624,0.009023956,0.00062467763,0.000039780443,0.00076628505,0.00033733711,0.0000696594,0.00042205193],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9973206,0.0001756701,0.0006578619,0.0006057679,0.0005671649,0.00067292707],"domain_scores_gemma":[0.9982263,0.00015000365,0.00028541518,0.00065608317,0.0003594836,0.00032270717],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008336893,0.00040597864,0.00061938213,0.00011143779,0.0006825438,0.0004600438,0.00047590034,0.00008488155,0.0012690291],"category_scores_gemma":[0.00024124957,0.0003494159,0.00007051355,0.0004091165,0.00014452213,0.00020039466,0.00054051407,0.00017188852,0.00016716823],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108647524,0.00017337859,0.0001206892,0.000057436806,0.00007515064,0.00003482358,0.00068374485,0.0003815476,0.99081373,0.0015482634,0.0059883767,0.000014210752],"study_design_scores_gemma":[0.0033779088,0.00075383676,0.00024205685,0.000093469695,0.00029807302,0.00021444626,0.0010467094,0.0035835933,0.967352,0.00044937266,0.021447686,0.0011408806],"about_ca_topic_score_codex":0.000120913435,"about_ca_topic_score_gemma":0.000017593342,"teacher_disagreement_score":0.024833571,"about_ca_system_score_codex":0.00033505115,"about_ca_system_score_gemma":0.00017753067,"threshold_uncertainty_score":0.9998958},"labels":[],"label_agreement":null},{"id":"W3136082331","doi":"10.55016/ojs/cdm.v15i2.62672","title":"Equality Perfect Graphs and Digraphs","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Vertex (graph theory); Graph; Chromatic scale; Alice and Bob; Discrete mathematics; Alice (programming language); Computer science","score_opus":0.030712067699897636,"score_gpt":0.3319881593684025,"score_spread":0.30127609166850483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136082331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019665772,0.00019954612,0.9693465,0.008532583,0.000039087106,0.0005185224,0.00013042646,0.0003191596,0.0012483583],"genre_scores_gemma":[0.94416195,0.000024935742,0.054927018,0.0007048172,0.000022523778,0.00006575655,0.000007390263,0.000014279314,0.00007133675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834424,0.00012445688,0.00032116135,0.00042931078,0.00033557953,0.00044522414],"domain_scores_gemma":[0.9981771,0.00038599866,0.00007415554,0.00062602625,0.00021283158,0.0005238607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056915655,0.00018595175,0.000293438,0.00011944559,0.00030542864,0.00023413645,0.00077744253,0.000056375702,0.000016541471],"category_scores_gemma":[0.0013783481,0.0001612908,0.00010834295,0.0011070146,0.00014724859,0.00034790943,0.00061906123,0.0002072157,0.00009775398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063220036,0.000029715904,0.00014122154,0.000044605706,0.000023493074,0.000004725784,0.0015895168,0.000019420093,0.0015373041,0.99501514,0.0003415816,0.0012469671],"study_design_scores_gemma":[0.0007158113,0.00034169247,0.0007111371,0.0000587859,0.000028678673,0.000021966482,0.00031622397,0.047077913,0.0038979906,0.94141865,0.00488006,0.000531067],"about_ca_topic_score_codex":0.0000025915606,"about_ca_topic_score_gemma":0.0000022836118,"teacher_disagreement_score":0.9244962,"about_ca_system_score_codex":0.00003066053,"about_ca_system_score_gemma":0.000045466157,"threshold_uncertainty_score":0.6577248},"labels":[],"label_agreement":null},{"id":"W3137542213","doi":"10.11575/cdm.v15i2.68165","title":"Hyperball packings related to truncated cube and octahedron tilings in hyperbolic space","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Supramolecular Self-Assembly in Materials","field":"Materials Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Coxeter group; Combinatorics; Mathematics; Hyperbolic space; Cube (algebra); Octahedron; Space (punctuation); Hypersphere; Voronoi diagram; Crystallography; Geometry; Crystal structure","score_opus":0.011037282932389036,"score_gpt":0.2798916512988554,"score_spread":0.26885436836646637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137542213","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98045194,0.00010733192,0.0059556603,0.011217453,0.00017408113,0.0011481456,0.00023345453,0.00028733027,0.00042462233],"genre_scores_gemma":[0.98523074,0.000010375027,0.0133147845,0.0011216329,0.00005017032,0.0001092154,0.0000324914,0.000057385176,0.00007321685],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997461,0.0001542085,0.000764754,0.0006041584,0.00036642808,0.0006494544],"domain_scores_gemma":[0.99841726,0.0002071676,0.00016081361,0.00048900564,0.00021487895,0.00051085587],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00078766095,0.00034125778,0.00065697514,0.00015262168,0.00015190717,0.0002939439,0.0004412049,0.00018211982,0.0002135383],"category_scores_gemma":[0.0031889863,0.00032503658,0.000070963324,0.0008207131,0.00007637412,0.0001982542,0.0003766119,0.00016666934,0.0012200533],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004273088,0.0000600469,0.00016274763,0.00008068606,0.000015459562,0.00002951415,0.0049242936,0.00016117521,0.9809992,0.012897229,0.00057384244,0.00005311377],"study_design_scores_gemma":[0.0028552462,0.00062389794,0.0021985006,0.0005616976,0.00021429698,0.00013805121,0.0022387642,0.00887076,0.96062666,0.012005132,0.008065365,0.001601644],"about_ca_topic_score_codex":0.00004521593,"about_ca_topic_score_gemma":0.000012894936,"teacher_disagreement_score":0.020372517,"about_ca_system_score_codex":0.00016506926,"about_ca_system_score_gemma":0.00008324554,"threshold_uncertainty_score":0.9999202},"labels":[],"label_agreement":null},{"id":"W3140032042","doi":"10.55016/ojs/cdm.v20i1.73743","title":"Saved by the rook: a case of matchings and Hamiltonian cycles","year":2025,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Combinatorics; Cartesian product; Hamiltonian path; Graph; Vertex (graph theory); Mathematics; Complete graph; Hamiltonian (control theory); Complement graph; Discrete mathematics; Line graph; Graph power","score_opus":0.015544680755604775,"score_gpt":0.3371160409681031,"score_spread":0.3215713602124983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140032042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021211924,0.00085068704,0.96882886,0.0043215207,0.00011130736,0.0013092685,0.0021539822,0.00009569397,0.0011167873],"genre_scores_gemma":[0.83251554,0.00014626549,0.16383901,0.0003032931,0.000047376634,0.0005368641,0.000063684456,0.0000362447,0.0025117348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979652,0.00019360725,0.00059030065,0.00051831425,0.00030527008,0.00042726658],"domain_scores_gemma":[0.99638045,0.0009963998,0.00027701535,0.0017768015,0.00039296248,0.00017639407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010204437,0.00031377297,0.0005427715,0.00021102489,0.0003967295,0.00029138714,0.0015951706,0.00017548582,0.000008074868],"category_scores_gemma":[0.0009131595,0.00023009755,0.0001599596,0.0004744099,0.00030014777,0.000121875215,0.003950286,0.00058943057,0.000009689202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009066433,0.000092721864,0.00001541212,0.00048758657,0.00015468671,0.00005051391,0.0045216503,0.0003026918,0.00054509577,0.98826796,0.0016298988,0.003922696],"study_design_scores_gemma":[0.0004297956,0.00005985506,0.000034599416,0.00076898036,0.00010147221,0.0003279152,0.0006109322,0.06807298,0.002902712,0.92452306,0.001697177,0.00047054063],"about_ca_topic_score_codex":0.00007292452,"about_ca_topic_score_gemma":0.00004429592,"teacher_disagreement_score":0.8113036,"about_ca_system_score_codex":0.00010704106,"about_ca_system_score_gemma":0.0001933533,"threshold_uncertainty_score":0.93831056},"labels":[],"label_agreement":null},{"id":"W3140444966","doi":"10.55016/ojs/cdm.v3i2.61933","title":"LC reductions yield isomorphic simplicial complexes","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Yield (engineering); Combinatorics; Simplicial complex; Materials science","score_opus":0.03808600290545455,"score_gpt":0.2923542278538305,"score_spread":0.2542682249483759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140444966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014659768,0.00008398052,0.97273916,0.009425271,0.0001636761,0.00024843644,0.00069526874,0.00027339984,0.0017110339],"genre_scores_gemma":[0.9521113,0.000036235797,0.046108622,0.00050239835,0.00016067519,0.00006187326,0.00009187787,0.0000068540744,0.0009201672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984212,0.000037973845,0.0004284053,0.00036642436,0.00032167247,0.0004243483],"domain_scores_gemma":[0.9981453,0.00034256495,0.000111219815,0.0008704137,0.00026577996,0.00026475525],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021781096,0.00018046553,0.00035895818,0.00030163533,0.00074739597,0.000119603355,0.0009779542,0.00008199855,0.00022020658],"category_scores_gemma":[0.0015582422,0.00014587192,0.00017888998,0.0021900542,0.00015912722,0.00027706163,0.0004464032,0.00016119244,0.00085551874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034711045,0.00036354412,0.00011602348,0.000010763145,0.00010699217,0.000032512235,0.0006534663,0.00033220657,0.0014213863,0.93956786,0.05626707,0.0011246707],"study_design_scores_gemma":[0.0023707491,0.001363701,0.01274196,0.00020768019,0.0006577794,0.0018184916,0.0011599658,0.07964888,0.011761933,0.5680877,0.31624377,0.0039374195],"about_ca_topic_score_codex":0.000044928234,"about_ca_topic_score_gemma":0.0000121483745,"teacher_disagreement_score":0.93745154,"about_ca_system_score_codex":0.000066307555,"about_ca_system_score_gemma":0.00006535998,"threshold_uncertainty_score":0.99992245},"labels":[],"label_agreement":null},{"id":"W3156518500","doi":"10.55016/ojs/cdm.v16i1.67834","title":"Note on group distance magicness on product graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Bijection; Abelian group; Vertex (graph theory); MAGIC (telescope); Lexicographical order; Discrete mathematics; Graph; Physics","score_opus":0.012756938084583776,"score_gpt":0.2739200354274208,"score_spread":0.26116309734283705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156518500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011071259,0.0002415016,0.97198606,0.011429075,0.0007035488,0.000506124,0.0001753167,0.0004034576,0.0034836584],"genre_scores_gemma":[0.93278396,0.000018615354,0.06475095,0.0013548266,0.000026221995,0.00009244533,0.000048832877,0.000023200442,0.00090092607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797654,0.00008385546,0.00039669304,0.0006271554,0.0004660204,0.00044975817],"domain_scores_gemma":[0.9975019,0.00024310629,0.0001144585,0.0014794043,0.00043679334,0.00022430881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004267327,0.0002434506,0.00030712283,0.00014283459,0.00036459806,0.0002641458,0.00058477104,0.00006010366,0.000016105489],"category_scores_gemma":[0.00083514996,0.0002045206,0.00014297514,0.0011192082,0.00008122889,0.00015070986,0.00021055306,0.00021540035,0.00038453334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005337785,0.0002652416,0.0000115044,0.000030291261,0.000015482121,0.000027509015,0.00028417047,0.00027609133,0.0016592166,0.9940256,0.0022358554,0.0011637398],"study_design_scores_gemma":[0.0008808297,0.0002491794,0.00024738573,0.0005743322,0.00004038547,0.000039953702,0.00005915371,0.016407324,0.025914943,0.9393755,0.01552109,0.0006899196],"about_ca_topic_score_codex":0.0000022403742,"about_ca_topic_score_gemma":0.0000064316864,"teacher_disagreement_score":0.9217127,"about_ca_system_score_codex":0.00007641469,"about_ca_system_score_gemma":0.00007608363,"threshold_uncertainty_score":0.83401084},"labels":[],"label_agreement":null},{"id":"W3158320605","doi":"10.55016/ojs/cdm.v16i1.62636","title":"Equivalent classes of degree sequences for triangulated polyhedra and their convex realization","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polyhedron; Mathematics; Combinatorics; Regular polygon; Degree (music); Equivalence (formal languages); Set (abstract data type); Convex polytope; Realization (probability); Dual polyhedron; Discrete mathematics; Convex set; Convex optimization; Geometry; Computer science","score_opus":0.04225962854213899,"score_gpt":0.3325056220029084,"score_spread":0.2902459934607694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158320605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002810302,0.00043768785,0.99320483,0.0017886871,0.000047359936,0.000413347,0.00027344012,0.00020186318,0.00082249666],"genre_scores_gemma":[0.722088,0.000028122633,0.27742422,0.00010812196,0.000017639519,0.000075679534,0.000053117426,0.0000120285695,0.00019313689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998975,0.000034280136,0.00039027596,0.0002518929,0.00013693687,0.00021161466],"domain_scores_gemma":[0.99814427,0.00031509827,0.00018019511,0.00042756152,0.0008434349,0.0000894413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030748692,0.00013877841,0.00029826004,0.00009023633,0.00010957901,0.00029315503,0.00035555993,0.000062725,0.000003441526],"category_scores_gemma":[0.0015505982,0.00011387741,0.000069516616,0.00046792746,0.000094196825,0.00043820005,0.00025293246,0.00004139781,0.0000015019245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000081410435,0.00013946727,0.000027711967,0.00033489842,0.00006444963,0.000004041346,0.0014681078,0.000012457981,0.0346129,0.9450307,0.0009888912,0.017308252],"study_design_scores_gemma":[0.00050765014,0.00016726922,0.000074027565,0.00042039936,0.000040567174,0.000043816464,0.00032115864,0.059144937,0.43980965,0.49771076,0.0014699878,0.00028978704],"about_ca_topic_score_codex":0.000002966504,"about_ca_topic_score_gemma":0.0000043781947,"teacher_disagreement_score":0.7192776,"about_ca_system_score_codex":0.000046252117,"about_ca_system_score_gemma":0.00017980071,"threshold_uncertainty_score":0.4643786},"labels":[],"label_agreement":null},{"id":"W3159958616","doi":"10.55016/ojs/cdm.v20i2.75407","title":"Enumeration of parallelogram polycubes","year":2025,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Direction Générale de la Recherche Scientifique et du Développement Technologique","keywords":"Parallelogram; Mathematics; Polyomino; Enumeration; Function (biology); Generating function; Dirichlet distribution; Pure mathematics; Combinatorics; Mathematical analysis; Applied mathematics; Geometry; Computer science; Regular polygon; Artificial intelligence","score_opus":0.017091246355771864,"score_gpt":0.36991035817255113,"score_spread":0.3528191118167793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159958616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03166561,0.00011857185,0.95626414,0.0013330014,0.00044038324,0.0013374412,0.00016578319,0.00026041415,0.008414655],"genre_scores_gemma":[0.79474115,0.000013277655,0.20318012,0.000086989756,0.00006665474,0.00022920493,0.0000221224,0.000038719263,0.00162178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787766,0.00007322823,0.0010228448,0.00027423885,0.00034781662,0.00040420002],"domain_scores_gemma":[0.9968303,0.0011940743,0.0003192244,0.00090885017,0.00062147767,0.00012609061],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053731364,0.0002878968,0.0006919332,0.00028737652,0.00019625637,0.000053291522,0.00044489861,0.00015906632,0.000049048293],"category_scores_gemma":[0.0064146086,0.00026442838,0.0001964145,0.00088262523,0.00011516214,0.00013862115,0.00020656321,0.0001796187,0.00004311879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015475245,0.00031839003,0.000026913342,0.00030544173,0.000099315774,0.000001130281,0.0005426696,0.00004291011,0.0024655212,0.992983,0.0027359733,0.0004632618],"study_design_scores_gemma":[0.00065170124,0.00008406538,0.000029339903,0.00038060543,0.00017063109,0.0000034189045,0.0003711314,0.0015123142,0.017487416,0.97689945,0.0021676454,0.00024230809],"about_ca_topic_score_codex":0.000004461733,"about_ca_topic_score_gemma":0.000007769224,"teacher_disagreement_score":0.76307553,"about_ca_system_score_codex":0.00016749726,"about_ca_system_score_gemma":0.00013526683,"threshold_uncertainty_score":0.9999808},"labels":[],"label_agreement":null},{"id":"W3161412004","doi":"10.55016/ojs/cdm.v17i2.72886","title":"Heesch numbers of unmarked polyforms","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Compute Canada","keywords":"Simple (philosophy); Computation; Computer science; Solver; Algorithm; Mathematics; Theoretical computer science","score_opus":0.008354561850720256,"score_gpt":0.26144257709851504,"score_spread":0.2530880152477948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161412004","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9794363,0.000192712,0.011589186,0.0010097295,0.00034464017,0.0005359731,0.0021412696,0.00008681453,0.004663369],"genre_scores_gemma":[0.99554896,0.0000023036855,0.0034515117,0.000117183336,0.00003139272,0.00007969894,0.000027393879,0.000013998188,0.00072752626],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987813,0.000060166134,0.00037107407,0.00015905879,0.00034679435,0.00028159708],"domain_scores_gemma":[0.99923056,0.00007525687,0.00013861844,0.00034710392,0.000108055734,0.00010037547],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044932307,0.0001209601,0.00025572165,0.00005677951,0.00040339227,0.000042336014,0.00035537634,0.00002782754,0.0029539904],"category_scores_gemma":[0.0002419872,0.00009387122,0.00009178928,0.00026698704,0.000084327534,0.00007656348,0.0003457588,0.00009918585,0.00005987034],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012730673,0.00016069114,0.00010156176,0.00015705932,0.000042304295,0.000005633051,0.003717612,0.0013867661,0.8013072,0.18580669,0.00665745,0.00052971736],"study_design_scores_gemma":[0.0023333123,0.0012464941,0.00091379497,0.00017490458,0.0002295447,0.0001737567,0.010153116,0.004388228,0.68786216,0.15241168,0.13864236,0.0014706282],"about_ca_topic_score_codex":0.000084657775,"about_ca_topic_score_gemma":0.000008307265,"teacher_disagreement_score":0.13198492,"about_ca_system_score_codex":0.00011163662,"about_ca_system_score_gemma":0.000063678744,"threshold_uncertainty_score":0.99795747},"labels":[],"label_agreement":null},{"id":"W3175217316","doi":"10.55016/ojs/cdm.v16i2.71725","title":"Completing graphs to metric spaces","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Deutsche Forschungsgemeinschaft; Grantová Agentura, Univerzita Karlova; Austrian Science Fund; Grantová Agentura České Republiky; Univerzita Karlova v Praze","keywords":"Mathematics; Perimeter; Combinatorics; Homogeneous; Extension (predicate logic); Automorphism; Property (philosophy); Metric space; Metric (unit); Discrete mathematics; Computer science; Geometry","score_opus":0.030580161571091034,"score_gpt":0.3587711210130111,"score_spread":0.32819095944192006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175217316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0826027,0.0002404175,0.90014553,0.0053735166,0.00028414954,0.0006889232,0.00044406907,0.00030801352,0.009912688],"genre_scores_gemma":[0.67459196,0.000014572727,0.320755,0.0008847175,0.00012352697,0.00013467489,0.000057740242,0.00005941246,0.0033783803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99808043,0.00014840372,0.00054808735,0.00037042933,0.00027818407,0.00057448354],"domain_scores_gemma":[0.9964933,0.0017632457,0.00014118127,0.0007424853,0.0005324761,0.00032735357],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006759308,0.00026369217,0.0005660017,0.00027094706,0.00044540793,0.00008246046,0.00031018932,0.00012650351,0.00038663525],"category_scores_gemma":[0.011380008,0.0002460521,0.00018425284,0.0013769448,0.00008869916,0.000089543406,0.00029326108,0.00023500896,0.00046271557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009385399,0.00014410622,0.000034899298,0.00007256809,0.000077582285,0.00003191455,0.0009930015,0.000064485204,0.0014607295,0.992688,0.0041782195,0.00024509462],"study_design_scores_gemma":[0.00038425368,0.0000642567,0.00007496855,0.00013121808,0.00012691635,0.0000680052,0.002004606,0.00026505938,0.0059891557,0.97670925,0.013804763,0.00037754138],"about_ca_topic_score_codex":0.0000021646485,"about_ca_topic_score_gemma":0.000025290508,"teacher_disagreement_score":0.5919893,"about_ca_system_score_codex":0.000115076014,"about_ca_system_score_gemma":0.00008278257,"threshold_uncertainty_score":0.99999917},"labels":[],"label_agreement":null},{"id":"W3183587779","doi":"10.55016/ojs/cdm.v16i2.71729","title":"Reconstructing the topology on monoids and polymorphism clones of reducts of the rationals","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rational number; Monoid; Endomorphism; Mathematics; Combinatorics","score_opus":0.011116799403799933,"score_gpt":0.2674111510308947,"score_spread":0.25629435162709474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183587779","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80370754,0.00064626784,0.16048051,0.03267952,0.00056112657,0.00037630618,0.00016959477,0.00003992128,0.0013392292],"genre_scores_gemma":[0.9879912,0.000012734844,0.011597776,0.00021491328,0.000038340826,0.000010956462,0.0000021428887,0.000003955598,0.00012794205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991659,0.00010963649,0.00031160619,0.00014347924,0.00014068087,0.00012873349],"domain_scores_gemma":[0.99837136,0.0006180144,0.00018273761,0.000598007,0.0001976758,0.000032225405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003855848,0.00008023084,0.00018580367,0.000033334047,0.00018277783,0.000035367215,0.0003960162,0.00003978109,0.000012061385],"category_scores_gemma":[0.0010049692,0.000047191188,0.00006334795,0.0003126599,0.00018480099,0.000066879904,0.00028932063,0.000077672994,0.0000024791245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012928062,0.000025633593,0.00008205228,0.000015244584,0.000020772653,6.1787676e-7,0.00095492415,0.000023607496,0.011912752,0.9857627,0.000164437,0.001035974],"study_design_scores_gemma":[0.0004676672,0.00007530849,0.0028277223,0.00031767032,0.000057375193,0.00020177366,0.0018980642,0.018291138,0.3833062,0.59185153,0.00049364025,0.0002119388],"about_ca_topic_score_codex":0.000005155668,"about_ca_topic_score_gemma":0.0000017819418,"teacher_disagreement_score":0.39391118,"about_ca_system_score_codex":0.00001573142,"about_ca_system_score_gemma":0.00009182598,"threshold_uncertainty_score":0.19244008},"labels":[],"label_agreement":null},{"id":"W3185146491","doi":"10.55016/ojs/cdm.v17i2.72680","title":"simplicity index of tournaments","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tournament; Simplicity; Combinatorics; Mathematics; Vertex (graph theory); Simple (philosophy); Index (typography); Class (philosophy); Discrete mathematics; Physics; Computer science; Graph; Philosophy","score_opus":0.017368946544547556,"score_gpt":0.3296349611501178,"score_spread":0.31226601460557024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185146491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034417175,0.000033794768,0.96275806,0.0010382696,0.00007914281,0.0004174399,0.00025106402,0.000072257644,0.0009327691],"genre_scores_gemma":[0.9767244,0.0000013352277,0.022726677,0.00011400948,0.000012193269,0.0001325684,0.000006473355,0.0000089585965,0.00027340214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984105,0.00011420462,0.00035056102,0.00021945342,0.000563404,0.00034186593],"domain_scores_gemma":[0.9984495,0.00023507826,0.00014235238,0.0008031492,0.00022059245,0.00014933612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000723105,0.0001071078,0.00022358348,0.00020595141,0.00039202516,0.000046777845,0.0013068836,0.000021338976,0.00009930789],"category_scores_gemma":[0.0004857518,0.000104122344,0.00009259038,0.0010224496,0.000056409626,0.00016766948,0.0014938767,0.00021354531,0.000024197552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010662282,0.00020596824,0.00024060221,0.000020840125,0.000035298668,0.0000065899044,0.00089323387,0.003281765,0.002561779,0.9896074,0.00070447515,0.0024314015],"study_design_scores_gemma":[0.0008733424,0.0003726332,0.0009865451,0.000031654123,0.000015817759,0.000059042646,0.00058407884,0.09435756,0.006630395,0.8886975,0.0070187985,0.000372644],"about_ca_topic_score_codex":0.0000044052745,"about_ca_topic_score_gemma":0.0000012716567,"teacher_disagreement_score":0.94230723,"about_ca_system_score_codex":0.00018573167,"about_ca_system_score_gemma":0.00008608885,"threshold_uncertainty_score":0.4245986},"labels":[],"label_agreement":null},{"id":"W3185544879","doi":"10.55016/ojs/cdm.v16i2.71727","title":"Siblings of an ℵ0-categorical relational structure","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Banff International Research Station for Mathematical Innovation and Discovery; Université de Lyon; Agence Nationale de la Recherche","keywords":"Countable set; Mathematics; Isomorphism (crystallography); Combinatorics; Categorical variable; Discrete mathematics","score_opus":0.02671381009991368,"score_gpt":0.3539586292768096,"score_spread":0.3272448191768959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185544879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24827516,0.000115745075,0.74640393,0.0013119559,0.00018023067,0.00033592142,0.00087861455,0.00012193331,0.0023765138],"genre_scores_gemma":[0.80708754,0.0000041388807,0.19167478,0.00010712165,0.000105127816,0.000015751462,0.00018664297,0.000026926871,0.0007919783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851525,0.0001146934,0.00056152785,0.0002582354,0.00025979907,0.0002904882],"domain_scores_gemma":[0.9976071,0.00083774066,0.00019276052,0.0005846386,0.0006052107,0.00017253919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003106706,0.00018404465,0.00042987897,0.0001037646,0.00019728832,0.000018085806,0.00020316947,0.00020333091,0.0006355531],"category_scores_gemma":[0.0041392012,0.00016586624,0.00012140098,0.00044520627,0.00014345167,0.000161103,0.00011638413,0.0002555166,0.000031458127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016764763,0.0001705728,0.000019975516,0.000059314458,0.000054455362,0.000015981417,0.00070868066,0.000089454916,0.0049068346,0.9934785,0.00035445733,0.00012500948],"study_design_scores_gemma":[0.00041641353,0.000056714678,0.000101875805,0.000035779623,0.00009679868,0.000095410454,0.0005758191,0.0013093092,0.013057121,0.98308,0.0009836314,0.00019110236],"about_ca_topic_score_codex":7.6033257e-7,"about_ca_topic_score_gemma":0.000011278913,"teacher_disagreement_score":0.5588124,"about_ca_system_score_codex":0.00007498235,"about_ca_system_score_gemma":0.00014453381,"threshold_uncertainty_score":0.6958861},"labels":[],"label_agreement":null},{"id":"W3185882927","doi":"10.55016/ojs/cdm.v16i2.71728","title":"Fraïssé theory and the Poulsen simplex","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simplex; Perspective (graphical); Mathematics; Combinatorics; Geometry","score_opus":0.016239517176395084,"score_gpt":0.34737493152052024,"score_spread":0.33113541434412513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185882927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03534093,0.0009620745,0.9360628,0.010614201,0.00018856238,0.0008692052,0.00037023835,0.00020893238,0.01538302],"genre_scores_gemma":[0.940673,0.00009865039,0.04667483,0.0020865093,0.00023212422,0.00020836081,0.000049832663,0.0000663851,0.009910305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982189,0.00051093113,0.00043628106,0.00026788304,0.00017865686,0.00038738013],"domain_scores_gemma":[0.9925236,0.006184867,0.00012642362,0.00074370543,0.00027686424,0.00014454468],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0017788769,0.00021873174,0.00047385233,0.000048515856,0.0005307085,0.00006427604,0.00023895147,0.00013171215,0.00036536687],"category_scores_gemma":[0.012828274,0.0001442078,0.00014155115,0.00025350793,0.00054515305,0.00008328377,0.00029052698,0.0002721153,0.00009166265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006875954,0.000056936937,0.000005151701,0.00003974304,0.00009660786,0.000014980391,0.0018521067,0.000004917736,0.0001481015,0.99582696,0.0013593202,0.00052640925],"study_design_scores_gemma":[0.0012176262,0.000016479953,0.000019594254,0.00004722938,0.00016931877,0.000102865364,0.002710231,0.00024950888,0.001240023,0.98643255,0.0076015247,0.00019304147],"about_ca_topic_score_codex":9.307689e-7,"about_ca_topic_score_gemma":0.000010833208,"teacher_disagreement_score":0.9053321,"about_ca_system_score_codex":0.000046105128,"about_ca_system_score_gemma":0.000074078926,"threshold_uncertainty_score":0.9954871},"labels":[],"label_agreement":null},{"id":"W3186474464","doi":"10.55016/ojs/cdm.v16i2.71724","title":"Canonical functions: a proof via topological dynamics","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Austrian Science Fund; Grantová Agentura České Republiky","keywords":"Mathematics; Countable set; Algebraic number; Topological dynamics; Algebraic properties; Argument (complex analysis); Topology (electrical circuits); Pure mathematics; Combinatorics; Discrete mathematics; Functional analysis","score_opus":0.021472327807081037,"score_gpt":0.3424850571934865,"score_spread":0.32101272938640546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186474464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017396724,0.00016301907,0.96741986,0.0051842546,0.00030646636,0.0005544252,0.0005194589,0.00024114,0.00821468],"genre_scores_gemma":[0.8561866,0.00001547454,0.12816511,0.00072131515,0.00028263297,0.00036887964,0.00029532507,0.000069669964,0.013894971],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979011,0.00018491977,0.00064808567,0.00042417363,0.00025524147,0.0005865244],"domain_scores_gemma":[0.997026,0.0012106372,0.00014522257,0.00082569587,0.0005141574,0.0002782507],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050173624,0.00028573372,0.00056942645,0.00008386353,0.00045961203,0.000046997353,0.00027444036,0.00029118813,0.00082313776],"category_scores_gemma":[0.006205693,0.00024834476,0.00022662165,0.00047494422,0.00026388344,0.00010862073,0.00026933482,0.0004218978,0.00027575393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023172632,0.00039409654,0.00003377172,0.00005629694,0.00009075791,0.00006710656,0.0002807045,0.000029996781,0.00034938552,0.99648064,0.0016141993,0.00057989324],"study_design_scores_gemma":[0.0005107577,0.000101185215,0.000024606903,0.00006383458,0.0001561698,0.00029174963,0.00093375787,0.0038745154,0.0019139681,0.98805577,0.0037307863,0.00034289018],"about_ca_topic_score_codex":0.000002431954,"about_ca_topic_score_gemma":0.00015300675,"teacher_disagreement_score":0.83925474,"about_ca_system_score_codex":0.00035698852,"about_ca_system_score_gemma":0.00022587251,"threshold_uncertainty_score":0.9999969},"labels":[],"label_agreement":null},{"id":"W3192511544","doi":"10.55016/ojs/cdm.v16i2.71726","title":"Conant's generalised metric spaces are Ramsey","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Grantová Agentura České Republiky; Univerzita Karlova v Praze","keywords":"Mathematics; Monoid; Metric (unit); Extension (predicate logic); Combinatorics; Metric space; Property (philosophy); Commutative property; Ramsey's theorem; Automorphism; Discrete mathematics; Computer science","score_opus":0.029580346795944446,"score_gpt":0.34943987807521587,"score_spread":0.3198595312792714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192511544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11227422,0.001224599,0.86754733,0.0074260524,0.00059355644,0.00093883515,0.001257629,0.0004911909,0.008246601],"genre_scores_gemma":[0.8315268,0.000097931195,0.15607347,0.0010012556,0.00034057238,0.00019683094,0.00015625246,0.00009602452,0.010510867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793094,0.00019694539,0.00058722886,0.0004015867,0.00030203725,0.00058122934],"domain_scores_gemma":[0.9965713,0.0013601754,0.00027640146,0.00086999964,0.00064798666,0.0002741191],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005551326,0.0003139191,0.00069141085,0.00018645378,0.00040921583,0.00009528871,0.00031614548,0.00021593312,0.00055000826],"category_scores_gemma":[0.008586476,0.000279952,0.00022498758,0.00089773367,0.00016331005,0.00014162989,0.00022154137,0.00027982355,0.00029706585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015255093,0.00023275778,0.00006744074,0.00011010001,0.00014381888,0.00009499142,0.0005854961,0.000056243232,0.0013657932,0.9906718,0.0064828168,0.00017348904],"study_design_scores_gemma":[0.0010360201,0.000049122347,0.00013200378,0.0001582616,0.0002538683,0.000116397794,0.0022075316,0.0006996831,0.013320292,0.9642134,0.01728347,0.00052996114],"about_ca_topic_score_codex":0.0000019652737,"about_ca_topic_score_gemma":0.000026247068,"teacher_disagreement_score":0.7192526,"about_ca_system_score_codex":0.00014487172,"about_ca_system_score_gemma":0.00013886901,"threshold_uncertainty_score":0.99996525},"labels":[],"label_agreement":null},{"id":"W3196602131","doi":"","title":"Sun toughness and P ≥3 -factors in graphs.","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Toughness; Discrete mathematics; Composite material; Materials science","score_opus":0.010436303664367408,"score_gpt":0.25557560084099556,"score_spread":0.24513929717662816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196602131","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9207708,0.00014473115,0.07616392,0.0012933087,0.00020916121,0.00045099028,0.000029636922,0.00013342773,0.0008039958],"genre_scores_gemma":[0.986694,0.000008582967,0.012960369,0.000121772995,0.0000019868319,0.000017901468,0.0000061177807,0.000007451358,0.00018184588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891335,0.000032094158,0.00028858954,0.00028697023,0.0001781859,0.00030080174],"domain_scores_gemma":[0.9989887,0.00016892012,0.000060730083,0.0005287037,0.00011098821,0.00014196998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003461852,0.000140234,0.00024138593,0.00021420597,0.00008462017,0.00013327057,0.0003428036,0.00006305846,0.000013327046],"category_scores_gemma":[0.00018639988,0.0001145067,0.000048892038,0.00066113827,0.000036442674,0.000210273,0.00022678185,0.000107683416,0.00008709869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011386339,0.000049327115,0.0052782986,0.000027813652,0.00000794698,0.0000020376704,0.0009918517,0.00010551457,0.0009611105,0.9922553,0.00017573005,0.00014394232],"study_design_scores_gemma":[0.0013268221,0.00016489989,0.012067814,0.0003023963,0.000020369094,0.000018094346,0.0004337718,0.057505563,0.0042072935,0.9219741,0.0013374675,0.0006413915],"about_ca_topic_score_codex":0.000021736703,"about_ca_topic_score_gemma":0.000011795781,"teacher_disagreement_score":0.07028117,"about_ca_system_score_codex":0.000029680481,"about_ca_system_score_gemma":0.000032405398,"threshold_uncertainty_score":0.46694475},"labels":[],"label_agreement":null},{"id":"W3196775760","doi":"10.55016/ojs/cdm.v15i2.68165","title":"Hyperball packings related to truncated cube and octahedron tilings in hyperbolic space","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Supramolecular Self-Assembly in Materials","field":"Materials Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Coxeter group; Combinatorics; Mathematics; Hyperbolic space; Cube (algebra); Octahedron; Space (punctuation); Hypersphere; Voronoi diagram; Crystallography; Geometry; Crystal structure","score_opus":0.011037282932389036,"score_gpt":0.2798916512988554,"score_spread":0.26885436836646637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196775760","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98045194,0.00010733192,0.0059556603,0.011217453,0.00017408113,0.0011481456,0.00023345453,0.00028733027,0.00042462233],"genre_scores_gemma":[0.98523074,0.000010375027,0.0133147845,0.0011216329,0.00005017032,0.0001092154,0.0000324914,0.000057385176,0.00007321685],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997461,0.0001542085,0.000764754,0.0006041584,0.00036642808,0.0006494544],"domain_scores_gemma":[0.99841726,0.0002071676,0.00016081361,0.00048900564,0.00021487895,0.00051085587],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00078766095,0.00034125778,0.00065697514,0.00015262168,0.00015190717,0.0002939439,0.0004412049,0.00018211982,0.0002135383],"category_scores_gemma":[0.0031889863,0.00032503658,0.000070963324,0.0008207131,0.00007637412,0.0001982542,0.0003766119,0.00016666934,0.0012200533],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004273088,0.0000600469,0.00016274763,0.00008068606,0.000015459562,0.00002951415,0.0049242936,0.00016117521,0.9809992,0.012897229,0.00057384244,0.00005311377],"study_design_scores_gemma":[0.0028552462,0.00062389794,0.0021985006,0.0005616976,0.00021429698,0.00013805121,0.0022387642,0.00887076,0.96062666,0.012005132,0.008065365,0.001601644],"about_ca_topic_score_codex":0.00004521593,"about_ca_topic_score_gemma":0.000012894936,"teacher_disagreement_score":0.020372517,"about_ca_system_score_codex":0.00016506926,"about_ca_system_score_gemma":0.00008324554,"threshold_uncertainty_score":0.9999202},"labels":[],"label_agreement":null},{"id":"W3199372147","doi":"10.55016/ojs/cdm.v17i1.73727","title":"Metric properties of incomparability graphs with an emphasis on paths","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Fixed Point Theorems Analysis","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Lyon; Agence Nationale de la Recherche; Canadian Defence Academy","keywords":"Combinatorics; Mathematics; Partially ordered set; Discrete mathematics; Distance-hereditary graph; Graph; Split graph; Line graph; Pathwidth; Graph power","score_opus":0.03238023183835661,"score_gpt":0.3065640118442675,"score_spread":0.2741837800059109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199372147","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96579254,0.000069519876,0.03035066,0.00043212692,0.0000491907,0.001130335,0.00082850293,0.00017053231,0.0011765799],"genre_scores_gemma":[0.97999144,0.0000018502839,0.019298963,0.000056640685,0.000017826309,0.00039433077,0.00003431731,0.000048800608,0.0001558496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971429,0.0003591422,0.00081660296,0.00040760514,0.0008636514,0.00041010353],"domain_scores_gemma":[0.99702066,0.00050840306,0.00040560705,0.0013883254,0.0004725648,0.00020443699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015870584,0.0003142056,0.00081283576,0.000619216,0.0005125348,0.000048139766,0.0005958664,0.000055759137,0.00028792577],"category_scores_gemma":[0.0017319605,0.00023418508,0.00024990947,0.002140782,0.00018118646,0.0001298122,0.00026681105,0.00028915278,0.000018960225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002589015,0.0023015412,0.00034360742,0.0002774555,0.0004272729,0.000007476086,0.0042088223,0.0013597546,0.001731287,0.98810405,0.00055093755,0.00042889777],"study_design_scores_gemma":[0.0022845613,0.0038596033,0.00044035382,0.00034176707,0.0014552664,0.00006290371,0.010181031,0.013182734,0.02920088,0.9363627,0.0013326926,0.001295508],"about_ca_topic_score_codex":0.00004022267,"about_ca_topic_score_gemma":0.000040507115,"teacher_disagreement_score":0.051741347,"about_ca_system_score_codex":0.0003167231,"about_ca_system_score_gemma":0.00011577355,"threshold_uncertainty_score":0.954979},"labels":[],"label_agreement":null},{"id":"W3213466060","doi":"10.55016/ojs/cdm.v18i2.74415","title":"On some new families of $k$-Mersenne and generalized $k$-Gaussian Mersenne numbers and their polynomials","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mersenne prime; Mathematics; Gaussian; Combinatorics; Physics; Quantum mechanics","score_opus":0.01022743975645085,"score_gpt":0.28953938956164044,"score_spread":0.2793119498051896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213466060","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62387806,0.00015269818,0.35626075,0.0076394784,0.00011050844,0.0015526091,0.0028667294,0.00022460942,0.007314533],"genre_scores_gemma":[0.9900958,0.000056164747,0.007922145,0.0000755531,0.00011308577,0.00009539832,0.00009356112,0.00003337472,0.0015149132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989927,0.0000219238,0.00036712058,0.00022521868,0.0000944638,0.00029857017],"domain_scores_gemma":[0.9987771,0.00046816544,0.00013228865,0.00033439035,0.00005328841,0.00023477919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016940357,0.00020768447,0.00042885158,0.00009041466,0.00019887622,0.000040399413,0.00010979425,0.00004192689,0.00007665075],"category_scores_gemma":[0.000114680355,0.00015916025,0.00008651669,0.00031028764,0.00015451846,0.00008386434,0.00012087603,0.0000838591,0.00005075988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000852647,0.000041425643,0.000011875338,0.000029676716,0.00006671608,1.8013468e-7,0.0010597978,0.000056481655,0.003297975,0.99252224,0.0010330746,0.0018720359],"study_design_scores_gemma":[0.0006423665,0.000050454375,0.00004906971,0.0000865263,0.000053994347,0.0000010081914,0.004008872,0.0013590707,0.0057493327,0.9848232,0.0029545843,0.00022148907],"about_ca_topic_score_codex":0.000034465098,"about_ca_topic_score_gemma":0.0000023786247,"teacher_disagreement_score":0.36621773,"about_ca_system_score_codex":0.000016421554,"about_ca_system_score_gemma":0.000029782796,"threshold_uncertainty_score":0.6490367},"labels":[],"label_agreement":null},{"id":"W4226336034","doi":"10.55016/ojs/cdm.v20i1.76009","title":"On the double covers of a line graph.","year":2025,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Prime (order theory); Mathematics; Graph; Coprime integers; Discrete mathematics","score_opus":0.04081099044575935,"score_gpt":0.35660132929703264,"score_spread":0.3157903388512733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226336034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13155402,0.0002342651,0.7613076,0.018696127,0.00072720804,0.01028278,0.019943446,0.0005582561,0.05669629],"genre_scores_gemma":[0.9773612,0.000050113325,0.015623718,0.00044023633,0.000103691425,0.0020150002,0.00024043492,0.000056725636,0.004108852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784493,0.000114663926,0.0009006188,0.0004032795,0.00038204,0.00035444918],"domain_scores_gemma":[0.9937155,0.003009812,0.0005446263,0.0020592867,0.00054724,0.000123488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010754262,0.0004144995,0.00075502996,0.00027671442,0.0003293959,0.00007529839,0.001027238,0.00030274302,0.00015007006],"category_scores_gemma":[0.0021658875,0.00029279562,0.0005264653,0.00066977006,0.00021831492,0.000026379355,0.00070879754,0.0006763839,0.000056365105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004087351,0.0003332289,0.0000011917264,0.00037262106,0.00023674943,5.683223e-7,0.0006835184,0.00056934124,0.00013804236,0.98590064,0.011696479,0.000026761723],"study_design_scores_gemma":[0.0004354697,0.00005150117,0.0000029906194,0.0010214437,0.000407437,0.0000012839256,0.00028089577,0.00075541704,0.004346575,0.991047,0.0013777917,0.00027218647],"about_ca_topic_score_codex":0.000011093786,"about_ca_topic_score_gemma":0.000013467272,"teacher_disagreement_score":0.8458072,"about_ca_system_score_codex":0.00010231447,"about_ca_system_score_gemma":0.00020560114,"threshold_uncertainty_score":0.99995244},"labels":[],"label_agreement":null},{"id":"W4390712968","doi":"10.55016/ojs/cdm.v18i1.73590","title":"Intriguing sets of strongly regular graphs and their related structures","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hrvatska Zaklada za Znanost","keywords":"Mathematics; Combinatorics; Indifference graph; Chordal graph; Strongly regular graph; Rank (graph theory); Discrete mathematics; Pathwidth; Graph; Line graph","score_opus":0.01991071899593015,"score_gpt":0.29235962726682346,"score_spread":0.2724489082708933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390712968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98551446,0.00019194558,0.011275419,0.0006680731,0.00013219498,0.0006969698,0.0005281697,0.0003834848,0.00060927495],"genre_scores_gemma":[0.9905749,0.000044111446,0.008853646,0.000015978578,0.000028427208,0.000037334812,0.00006506243,0.00005106454,0.00032949145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981712,0.000069334725,0.00073596044,0.0003066628,0.00026030588,0.00045653834],"domain_scores_gemma":[0.99800074,0.0006397726,0.00028521207,0.00064463017,0.00025155648,0.00017807547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007022411,0.0002901157,0.0005976018,0.00032621753,0.00024161107,0.00006683465,0.000284249,0.0001584105,0.000042175747],"category_scores_gemma":[0.0020297589,0.00022717522,0.00015943518,0.00075513293,0.00018044213,0.000119375094,0.00022292342,0.00020505005,0.0000264291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008604366,0.000046208548,0.00009481741,0.0002922034,0.00016873822,0.0000052477735,0.003759199,0.000048522787,0.0038226605,0.98821443,0.002810081,0.00072926725],"study_design_scores_gemma":[0.00053009484,0.000066597364,0.00069432583,0.00025589403,0.000095175965,0.000020212592,0.0019186245,0.0028702589,0.008621287,0.9843232,0.0003317111,0.0002725866],"about_ca_topic_score_codex":0.0000058307496,"about_ca_topic_score_gemma":0.000007311356,"teacher_disagreement_score":0.0050604152,"about_ca_system_score_codex":0.000049842864,"about_ca_system_score_gemma":0.00004488339,"threshold_uncertainty_score":0.9263936},"labels":[],"label_agreement":null},{"id":"W4390712990","doi":"10.55016/ojs/cdm.v18i1.74400","title":"On a generalized basic series and Rogers–Ramanujan type identities - II","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Series (stratigraphy); Ramanujan's sum; Type (biology); Ramanujan theta function; Continuation; Combinatorics; Generating function; Algebra over a field; Pure mathematics; Computer science","score_opus":0.03394376022461132,"score_gpt":0.3492758703111695,"score_spread":0.3153321100865582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390712990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9434361,0.00018828847,0.03552961,0.004711094,0.00065449503,0.0022435188,0.0008870928,0.002049699,0.010300119],"genre_scores_gemma":[0.71891797,0.00047270706,0.09879675,0.00067109027,0.0005658269,0.0011075779,0.00030784289,0.00046144228,0.17869881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976609,0.00007176514,0.00068591983,0.00040236497,0.00051915523,0.00065991015],"domain_scores_gemma":[0.99739826,0.0010513251,0.00018661753,0.0007528908,0.00033599068,0.00027492153],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059297634,0.00039504532,0.00068610854,0.00035208816,0.0007190051,0.00022831875,0.0003198755,0.00013962112,0.00025368427],"category_scores_gemma":[0.0065688156,0.00035079458,0.00014452306,0.00085250195,0.00024160462,0.00036054823,0.00049541076,0.00021092559,0.0006733757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003110834,0.000093404815,0.000004333579,0.00030872555,0.00008626678,0.000019934543,0.0018383062,0.000032079264,0.00070851104,0.9711467,0.025695113,0.00003548972],"study_design_scores_gemma":[0.00053452235,0.00027255065,0.000018840945,0.00029165388,0.00013475378,0.00003752438,0.0013178666,0.0010262958,0.002090175,0.992159,0.0017021465,0.000414659],"about_ca_topic_score_codex":0.0000033464225,"about_ca_topic_score_gemma":0.000016722193,"teacher_disagreement_score":0.22451812,"about_ca_system_score_codex":0.00013594195,"about_ca_system_score_gemma":0.000054692708,"threshold_uncertainty_score":0.9998944},"labels":[],"label_agreement":null},{"id":"W4390712995","doi":"10.55016/ojs/cdm.v18i1.73025","title":"On a generalized basic series and Rogers-Ramanujan type identities","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University Grants Commission","keywords":"Mathematics; Bijection; Combinatorics; Type (biology); Ramanujan theta function; Combinatorial proof; Generating function; Series (stratigraphy); Ramanujan's sum; Generalization; Class (philosophy); Ramanujan tau function; Combinatorial principles; Discrete mathematics; Combinatorial explosion; Computer science","score_opus":0.03593593663408055,"score_gpt":0.35439882126449296,"score_spread":0.3184628846304124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390712995","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9132844,0.00022458544,0.061195973,0.0049211388,0.00078945624,0.0027256792,0.0010175172,0.0025220788,0.013319156],"genre_scores_gemma":[0.73542523,0.00054260134,0.117216,0.0007381084,0.00061972294,0.0012077244,0.00031040428,0.0005154031,0.14342478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775666,0.00007521194,0.00065058045,0.00038673356,0.0004992343,0.000631566],"domain_scores_gemma":[0.99726135,0.001247467,0.00017345943,0.0007230895,0.00032889703,0.00026574565],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058120233,0.00037419674,0.00065019645,0.00034748536,0.0004282008,0.00026515854,0.000301212,0.00013089448,0.00021613238],"category_scores_gemma":[0.006804373,0.00033158742,0.00013511056,0.0008359429,0.00022649487,0.00033043406,0.00032125262,0.00019966338,0.0009821315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029618444,0.00007081286,0.0000058566975,0.00032943548,0.000076831755,0.000023319179,0.0012838197,0.000032172113,0.0006716721,0.9765727,0.020866282,0.000037493668],"study_design_scores_gemma":[0.00049567,0.00018020064,0.000024920899,0.00027267862,0.00012224958,0.000038089296,0.0013331652,0.0010082196,0.0020495004,0.99300104,0.001082332,0.00039192077],"about_ca_topic_score_codex":0.0000029352398,"about_ca_topic_score_gemma":0.000015480733,"teacher_disagreement_score":0.17785916,"about_ca_system_score_codex":0.00012930324,"about_ca_system_score_gemma":0.00005076695,"threshold_uncertainty_score":0.99991363},"labels":[],"label_agreement":null},{"id":"W4390714284","doi":"10.55016/ojs/cdm.v17i2.62707","title":"Brooks' theorem for 2-fold coloring","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Brooks' theorem; Graph; Edge coloring; Vertex (graph theory); Wheel graph; Windmill graph; Graph coloring; List coloring; Discrete mathematics; Complete coloring; Graph power; Line graph","score_opus":0.016673213339947403,"score_gpt":0.27662019205305416,"score_spread":0.25994697871310674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007820285,0.00013050257,0.98472136,0.00403387,0.00042383972,0.00083931966,0.00026571215,0.00032648363,0.0014386071],"genre_scores_gemma":[0.8442783,0.0000020987152,0.15295964,0.0007261263,0.000018626604,0.00095127994,0.00002797239,0.000020266625,0.0010157131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986618,0.00004884296,0.00032406673,0.00030071285,0.00028105656,0.00038350737],"domain_scores_gemma":[0.99859834,0.00031074355,0.0001017104,0.0006395053,0.00020618385,0.00014354347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086810545,0.00013481406,0.00021020162,0.00013848428,0.000917626,0.00013802105,0.00077385386,0.00002853253,0.000027805521],"category_scores_gemma":[0.0003874595,0.00012640998,0.00012863932,0.00052706915,0.000031803283,0.00010992872,0.0006134176,0.00012417635,0.000051602747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003877864,0.00006610804,0.000004822699,0.000014932899,0.000017802397,0.0000014876201,0.000644729,0.0012827476,0.0013640244,0.99224186,0.0040233796,0.00033424693],"study_design_scores_gemma":[0.00068360794,0.00024846935,0.000010197534,0.000027668928,0.00002970793,0.000022538217,0.00025839487,0.12083241,0.0026864833,0.8428227,0.032080524,0.00029729505],"about_ca_topic_score_codex":0.0000034575842,"about_ca_topic_score_gemma":0.0000011883081,"teacher_disagreement_score":0.83645797,"about_ca_system_score_codex":0.00010806684,"about_ca_system_score_gemma":0.00007801236,"threshold_uncertainty_score":0.70577306},"labels":[],"label_agreement":null},{"id":"W4390714288","doi":"10.55016/ojs/cdm.v17i2.72522","title":"Some notes on generic rectangulations","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rectangle; Subdivision; Combinatorics; Mathematics; Polytope; Planar; Geometry; Computer science; Computer graphics (images)","score_opus":0.04387160354192173,"score_gpt":0.33940400049216923,"score_spread":0.2955323969502475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17219193,0.000524271,0.7433705,0.037914168,0.0010890656,0.008780892,0.009891913,0.0021034172,0.024133887],"genre_scores_gemma":[0.8653041,0.000012653704,0.12582518,0.0009904284,0.0004571567,0.0034851392,0.0002131977,0.00014001809,0.0035721012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977341,0.000098765806,0.00068800856,0.00038189383,0.0006156491,0.00048157462],"domain_scores_gemma":[0.9967825,0.0014206071,0.00026780745,0.0011148567,0.00018191262,0.00023230806],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00069482694,0.00030120582,0.00044948296,0.00026105612,0.0013347163,0.00009059836,0.00053873926,0.000060100057,0.0007187546],"category_scores_gemma":[0.0019688825,0.0002778035,0.0002222176,0.00081239466,0.00005372685,0.000078035846,0.00036285762,0.00031234798,0.00029195126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058620553,0.0005143681,0.000004560978,0.000042735875,0.00004920643,0.0000027564256,0.00074175326,0.0006506849,0.00088851916,0.9539805,0.042947643,0.00017137853],"study_design_scores_gemma":[0.0004977907,0.00020377075,0.00003108296,0.000051254097,0.00014884092,0.00003267763,0.00059866346,0.011425312,0.0017773587,0.93483126,0.049847156,0.00055484567],"about_ca_topic_score_codex":0.0000048749826,"about_ca_topic_score_gemma":0.0000044037733,"teacher_disagreement_score":0.6931122,"about_ca_system_score_codex":0.00034818775,"about_ca_system_score_gemma":0.00009396907,"threshold_uncertainty_score":0.9999674},"labels":[],"label_agreement":null},{"id":"W4390714305","doi":"10.55016/ojs/cdm.v17i2.70452","title":"Refining overpartitions by properties of non-overlined parts","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bijection; Mathematics; Divisibility rule; Congruence relation; Combinatorics; Mathematical proof; Enumeration; Modulo; Combinatorial proof; Generating function; Discrete mathematics","score_opus":0.03374710155494807,"score_gpt":0.32667215621551215,"score_spread":0.29292505466056407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31603855,0.00060877076,0.652609,0.0047653057,0.000576025,0.0029352142,0.0071389014,0.00077442173,0.014553834],"genre_scores_gemma":[0.9550009,0.0000060608863,0.035315488,0.000100367724,0.000050724866,0.0010398781,0.00007105196,0.00007781761,0.008337718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731344,0.00009799541,0.0010390837,0.00031414683,0.00071439747,0.0005209545],"domain_scores_gemma":[0.9977423,0.000536098,0.00042195286,0.00078138814,0.0003282913,0.00018995484],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068967487,0.00029030733,0.0006862263,0.00016630402,0.0006507301,0.00005719948,0.00046835697,0.00006223528,0.000598775],"category_scores_gemma":[0.0027620578,0.00027291573,0.00020909586,0.00046954537,0.00017231115,0.00021297148,0.0005839282,0.0002900946,0.00007220549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047079408,0.0011364378,0.0000240672,0.0007535372,0.0001922021,0.000006944107,0.0037078937,0.00047172228,0.08106601,0.8649023,0.04762604,0.000065721346],"study_design_scores_gemma":[0.0012137527,0.00035409507,0.000011558379,0.00046894874,0.00034557073,0.000041148138,0.0045711957,0.004948977,0.054946344,0.9228874,0.009420411,0.0007906126],"about_ca_topic_score_codex":0.000012342385,"about_ca_topic_score_gemma":0.000009981308,"teacher_disagreement_score":0.6389623,"about_ca_system_score_codex":0.00028454466,"about_ca_system_score_gemma":0.000108972316,"threshold_uncertainty_score":0.9999723},"labels":[],"label_agreement":null},{"id":"W4390714306","doi":"10.55016/ojs/cdm.v17i2.69706","title":"On $D_{\\alpha}$ spectrum of connected graphs","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Spectral radius; Combinatorics; Mathematics; Diagonal; Alpha (finance); Graph; Eigenvalues and eigenvectors; Physics; Geometry","score_opus":0.01871690452322534,"score_gpt":0.3125228308750543,"score_spread":0.29380592635182895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714306","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8837522,0.000065268185,0.090748005,0.0044830134,0.000266242,0.0026084124,0.0052068126,0.0004594484,0.012410551],"genre_scores_gemma":[0.99412453,0.0000025581726,0.004442598,0.00015606452,0.000023511842,0.0005605676,0.00008220598,0.00003938166,0.0005685905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981083,0.00015143349,0.0006424074,0.0002898713,0.000426842,0.000381129],"domain_scores_gemma":[0.99712795,0.0013412865,0.0003042935,0.00091417885,0.00015363788,0.00015865981],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00074849324,0.00023094882,0.0004583191,0.00029322322,0.0006388578,0.000025153366,0.00051575317,0.000054498694,0.0010634545],"category_scores_gemma":[0.0012955868,0.00022210402,0.00024593374,0.0010783469,0.000112894944,0.000045172812,0.00023293235,0.00028797204,0.000072722236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031279567,0.00056603726,0.000011134018,0.000049676255,0.00007618896,0.0000024032095,0.0006694593,0.000099644785,0.0018165141,0.9911109,0.005533118,0.000033648543],"study_design_scores_gemma":[0.0005525086,0.0002690758,0.000046631074,0.00004146507,0.00011140055,0.00001607514,0.0007441754,0.0004871568,0.0066089663,0.9886539,0.0022210116,0.00024765386],"about_ca_topic_score_codex":0.0000041032495,"about_ca_topic_score_gemma":0.0000053057324,"teacher_disagreement_score":0.110372275,"about_ca_system_score_codex":0.000114470036,"about_ca_system_score_gemma":0.000060336042,"threshold_uncertainty_score":0.99984974},"labels":[],"label_agreement":null},{"id":"W4390714307","doi":"10.55016/ojs/cdm.v17i2.62734","title":"Hamilton cycles in bidirected complete graphs","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Generalization; Indifference graph; 1-planar graph; Chordal graph; Discrete mathematics; Graph","score_opus":0.03429892041570055,"score_gpt":0.32880357045648684,"score_spread":0.2945046500407863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714307","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95866966,0.00011074541,0.02666123,0.002232559,0.00016938255,0.0022127966,0.0033037544,0.00051245897,0.0061274073],"genre_scores_gemma":[0.9863543,0.0000067255787,0.01154553,0.0001725864,0.000022997177,0.0012851392,0.00013978127,0.00004275363,0.00043020607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804693,0.0002089409,0.0006240506,0.00032100148,0.00034043728,0.0004586101],"domain_scores_gemma":[0.9980724,0.0007579001,0.00017219705,0.0007252877,0.000121396755,0.00015085154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087255414,0.00022863367,0.00041474486,0.00038576307,0.0006955742,0.000048161524,0.0005033625,0.00005313173,0.00045235085],"category_scores_gemma":[0.00053603423,0.00023321886,0.000166348,0.0012696772,0.00008756614,0.000069674155,0.00023778378,0.00033380222,0.000103242484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013047297,0.00036775888,0.000098768745,0.00003519815,0.000030573086,0.0000054568195,0.001706991,0.00012321993,0.0026717512,0.9923719,0.0024918115,0.00008353387],"study_design_scores_gemma":[0.00056623225,0.000056711127,0.0004939005,0.0000378089,0.000054327655,0.000021665746,0.0012290536,0.0015499785,0.0005219628,0.9824601,0.012691775,0.00031652738],"about_ca_topic_score_codex":0.000014306638,"about_ca_topic_score_gemma":0.00004915818,"teacher_disagreement_score":0.027684616,"about_ca_system_score_codex":0.00018984178,"about_ca_system_score_gemma":0.00004555688,"threshold_uncertainty_score":0.9510389},"labels":[],"label_agreement":null},{"id":"W4390714308","doi":"10.55016/ojs/cdm.v17i2.67832","title":"On uniformly resolvable $(C_4,K_{1,3})$-designs","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Graph; Resolution (logic); Class (philosophy); Complete graph; Discrete mathematics; Computer science","score_opus":0.011618421720882403,"score_gpt":0.24143616208692215,"score_spread":0.22981774036603975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26800495,0.0006797322,0.56596214,0.001300196,0.0022454371,0.0032738978,0.004742517,0.0027352348,0.1510559],"genre_scores_gemma":[0.9970798,0.0000033611227,0.000707963,0.00010747644,0.00005386231,0.00039998628,0.00006684446,0.000047574897,0.0015331355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866354,0.00007517508,0.00036193203,0.00017439842,0.0003035112,0.00042143886],"domain_scores_gemma":[0.99897623,0.00020875766,0.000046023648,0.0005494697,0.000058098092,0.00016143089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057607674,0.00020303472,0.00027472634,0.00018031018,0.0005453243,0.00006149773,0.00034717514,0.000050245144,0.0005250017],"category_scores_gemma":[0.00015756511,0.00020078944,0.000121910394,0.0005425424,0.00002816867,0.000071054375,0.0000991965,0.00027323648,0.00038265076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001697861,0.00008296043,0.0000052621085,0.00007103639,0.00007294847,0.000011733725,0.0009838709,0.067330815,0.0025333865,0.904243,0.024547728,0.00010027714],"study_design_scores_gemma":[0.002293266,0.0010866321,0.00008592767,0.00031044937,0.00021918012,0.00014148057,0.006116873,0.1525592,0.0109720575,0.5468063,0.27743545,0.001973214],"about_ca_topic_score_codex":0.0000029346106,"about_ca_topic_score_gemma":0.0000028770341,"teacher_disagreement_score":0.72907484,"about_ca_system_score_codex":0.00025771733,"about_ca_system_score_gemma":0.00002564639,"threshold_uncertainty_score":0.81879556},"labels":[],"label_agreement":null},{"id":"W4390714589","doi":"10.55016/ojs/cdm.v17i1.70935","title":"A note on the fully degenerate Bell polynomials of the second kind","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bell polynomials; Degenerate energy levels; Difference polynomials; Hahn polynomials; Wilson polynomials; Orthogonal polynomials; Classical orthogonal polynomials; Discrete orthogonal polynomials; Combinatorics; Koornwinder polynomials; Pure mathematics; Algebra over a field; Discrete mathematics; Gegenbauer polynomials; Quantum mechanics; Physics","score_opus":0.028878925340430597,"score_gpt":0.31982503541355634,"score_spread":0.29094611007312576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7676494,0.00026161564,0.1499532,0.02621288,0.0013550784,0.008009998,0.009543709,0.0003699245,0.03664418],"genre_scores_gemma":[0.9623772,0.0000030731132,0.011132908,0.0007911687,0.00014158923,0.00081452104,0.000013175694,0.00009598623,0.02463041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712443,0.0003187867,0.00094269135,0.0003014985,0.0008011378,0.00051147805],"domain_scores_gemma":[0.99461627,0.0029476653,0.0005651163,0.0014886209,0.00025982835,0.00012248944],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013601372,0.00032278584,0.00058502186,0.00011423434,0.0011490749,0.000078308316,0.0011489164,0.000070549075,0.0018395473],"category_scores_gemma":[0.0044423724,0.00019680131,0.00034933919,0.0006521706,0.00025553704,0.000083852276,0.0009797203,0.00048057194,0.00009128249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020355257,0.00025692888,0.0000039253673,0.00015033859,0.00007789806,0.0000024633086,0.0020800442,0.00024789784,0.006931834,0.97396547,0.016236495,0.000026329031],"study_design_scores_gemma":[0.00042899224,0.00013186356,0.000018433,0.00012275857,0.00015003163,0.000025561465,0.0013831428,0.0010572838,0.05090359,0.93432665,0.011146974,0.0003047365],"about_ca_topic_score_codex":0.0000038161656,"about_ca_topic_score_gemma":0.000043679738,"teacher_disagreement_score":0.19472775,"about_ca_system_score_codex":0.0003097863,"about_ca_system_score_gemma":0.00015464371,"threshold_uncertainty_score":0.9990729},"labels":[],"label_agreement":null},{"id":"W4390714603","doi":"10.55016/ojs/cdm.v17i1.62338","title":"The endomorphisms monoids of Helm graph and its generalization","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Chemical Synthesis and Analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Endomorphism; Mathematics; Combinatorics; Generalization; Monoid; Graph; Discrete mathematics","score_opus":0.006460612361203112,"score_gpt":0.24955127750351558,"score_spread":0.24309066514231248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714603","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94796765,0.0029062321,0.0457085,0.0018424707,0.00005316696,0.00037076126,0.00073925225,0.000012454592,0.00039952132],"genre_scores_gemma":[0.9987763,0.0001896329,0.0003543718,0.00006032603,0.000034394176,0.00008301166,0.00010684247,0.000008310165,0.00038677198],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993617,0.00004380212,0.00021122102,0.00013035095,0.00012400426,0.00012891977],"domain_scores_gemma":[0.9995098,0.00004355842,0.00008619184,0.00020739685,0.00009753683,0.000055488887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023641357,0.000076436416,0.00012450092,0.000024253002,0.00033155375,0.000017999453,0.00014471542,0.000028285122,0.000026261107],"category_scores_gemma":[0.00032655185,0.000057467194,0.00008512867,0.00015910105,0.00003946919,0.0000016426219,0.00020607095,0.00004064575,0.0000012924269],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015029601,0.000053216274,0.00006475469,0.000012775247,0.00008815937,3.0020806e-7,0.000067629095,0.0003367818,0.9633034,0.03456423,0.0011500551,0.00034369822],"study_design_scores_gemma":[0.00047496633,0.00016694076,0.00009175054,0.000012789123,0.00016041663,0.0000123984855,0.0004126996,0.006046218,0.93791294,0.0054273196,0.049036305,0.0002452729],"about_ca_topic_score_codex":0.0000033474034,"about_ca_topic_score_gemma":0.0000039011206,"teacher_disagreement_score":0.050808698,"about_ca_system_score_codex":0.000010928967,"about_ca_system_score_gemma":0.000017851466,"threshold_uncertainty_score":0.25500768},"labels":[],"label_agreement":null},{"id":"W4390714611","doi":"10.55016/ojs/cdm.v17i1.67951","title":"Pushes in words-a primitive sorting algorithm","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation","keywords":"Alphabet; Sorting; Combinatorics; Mathematics; Statistic; Order (exchange); Word (group theory); Degree (music); Function (biology); Algorithm; Discrete mathematics; Arithmetic; Statistics; Geometry","score_opus":0.010191505785043426,"score_gpt":0.2709214146603092,"score_spread":0.2607299088752658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014120199,0.00013614866,0.98102736,0.0020641228,0.00019569248,0.0004415725,0.00016118799,0.0002217604,0.0016319661],"genre_scores_gemma":[0.81541014,0.0000042039283,0.18312915,0.0005716966,0.00005948912,0.00041729145,0.000029837385,0.000020045065,0.00035816955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983857,0.000113637165,0.0004198815,0.00031823086,0.00033049882,0.00043200175],"domain_scores_gemma":[0.9988398,0.00029169148,0.00013411559,0.0005553816,0.000070983144,0.000108054155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009339133,0.00015041728,0.00025306092,0.00019323909,0.000406183,0.00014359024,0.000891198,0.000029826511,0.00006788693],"category_scores_gemma":[0.0003801153,0.00014898725,0.000084023595,0.0009052229,0.000032932116,0.00024003278,0.001042254,0.00023555846,0.00005458295],"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.0000022179827,0.00019496353,0.000052061376,0.000013544712,0.000020346377,0.000042433778,0.0056133713,0.0006578742,0.0005361619,0.9652336,0.00056680903,0.027066581],"study_design_scores_gemma":[0.00085620163,0.00015843251,0.0007340172,0.000100398545,0.000020600295,0.00008629031,0.0043396913,0.6785365,0.0019042018,0.30612874,0.0065045212,0.0006304199],"about_ca_topic_score_codex":0.000011895671,"about_ca_topic_score_gemma":0.0000040491964,"teacher_disagreement_score":0.8012899,"about_ca_system_score_codex":0.00027183053,"about_ca_system_score_gemma":0.0000886851,"threshold_uncertainty_score":0.60755235},"labels":[],"label_agreement":null},{"id":"W4390714620","doi":"10.55016/ojs/cdm.v17i1.71829","title":"Spirals in Periodic Tilings","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Substitution tiling; Hexagonal tiling; Penrose tiling; Combinatorics; Mathematics; Spiral (railway); Tessellation (computer graphics); Tile; Set (abstract data type); Square tiling; Quasicrystal; Geometry; Computer science; Mathematical analysis","score_opus":0.012832943442732734,"score_gpt":0.2737523537030152,"score_spread":0.2609194102602825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9926602,0.00026656946,0.0029018444,0.0014844825,0.0002028444,0.0004423427,0.00066803384,0.00007567178,0.001297993],"genre_scores_gemma":[0.99704844,0.0000021098344,0.0018970307,0.00030355094,0.000038703194,0.00016804623,0.00001775782,0.000013039144,0.0005113375],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988094,0.00006984317,0.00032925227,0.00019823606,0.00026634193,0.0003269555],"domain_scores_gemma":[0.99945664,0.000054602133,0.0000710886,0.00027851097,0.00005323377,0.00008594355],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005085569,0.000120025084,0.00022565202,0.000082813975,0.00042331597,0.00009945912,0.00031579184,0.000026704978,0.0027010809],"category_scores_gemma":[0.00020903825,0.000101426005,0.000058601956,0.0002766943,0.000055820416,0.00007610564,0.00032934392,0.00013370781,0.00015490875],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085893895,0.00021652934,0.0004238067,0.00013187765,0.000013651719,0.000040213938,0.011788423,0.004483559,0.8612676,0.11633692,0.004481687,0.0007298168],"study_design_scores_gemma":[0.003825968,0.0015982544,0.003054021,0.0003106848,0.0001388233,0.00027834982,0.015605304,0.013888197,0.28312394,0.23142016,0.44409418,0.0026621157],"about_ca_topic_score_codex":0.000057411864,"about_ca_topic_score_gemma":0.000019132414,"teacher_disagreement_score":0.57814366,"about_ca_system_score_codex":0.0001813562,"about_ca_system_score_gemma":0.00005812271,"threshold_uncertainty_score":0.9982106},"labels":[],"label_agreement":null},{"id":"W4390714624","doi":"10.55016/ojs/cdm.v17i1.69695","title":"Kn(λ) is fully {P5,C6}-decomposable","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University Grants Commission","keywords":"Multigraph; Mathematics; Combinatorics; Lambda; Path (computing); Decomposition; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Physics; Computer science","score_opus":0.006452648171387555,"score_gpt":0.2344828851408915,"score_spread":0.22803023696950395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42951354,0.0021086487,0.4464679,0.0030724593,0.003070479,0.0032125637,0.008502179,0.002833472,0.10121877],"genre_scores_gemma":[0.9961616,0.0000060853845,0.0012943334,0.00015704622,0.00007531576,0.00029111022,0.00006508818,0.000046096353,0.0019033194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987006,0.000053368054,0.00038702856,0.00017696775,0.00025909304,0.0004229457],"domain_scores_gemma":[0.9990965,0.0000956468,0.000046703837,0.00052273175,0.00007171428,0.00016671077],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00044190823,0.00019539925,0.0002962087,0.00013494387,0.00042929166,0.000070608825,0.00035709457,0.00004736653,0.001241714],"category_scores_gemma":[0.000065954904,0.00020356957,0.00014481401,0.00049693295,0.000027493454,0.00008353138,0.00014872315,0.00022378421,0.0005384888],"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.000024272878,0.0002672879,0.00009906024,0.00037343812,0.00041819937,0.0000340276,0.009040821,0.06358071,0.012963431,0.7316359,0.18096405,0.0005987611],"study_design_scores_gemma":[0.001559036,0.00029200368,0.00011773871,0.00014880576,0.00022519311,0.00020522873,0.0055800807,0.16381831,0.012071193,0.16104428,0.6533697,0.0015684015],"about_ca_topic_score_codex":0.0000033544372,"about_ca_topic_score_gemma":0.0000019656889,"teacher_disagreement_score":0.5705917,"about_ca_system_score_codex":0.00018262179,"about_ca_system_score_gemma":0.000023229904,"threshold_uncertainty_score":0.9996713},"labels":[],"label_agreement":null},{"id":"W4390714631","doi":"10.55016/ojs/cdm.v17i1.72482","title":"Homothetic covering of convex hulls of compact convex sets","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Shanxi Province; National Natural Science Foundation of China","keywords":"Mathematics; Convex hull; Combinatorics; Homothetic transformation; Convex set; Convex polytope; Orthogonal convex hull; Convex body; Cover (algebra); Regular polygon; Convex combination; Parallelepiped; Subderivative; Convex analysis; Integer (computer science); Geometry; Convex optimization; Computer science","score_opus":0.03718798935189808,"score_gpt":0.346655638837027,"score_spread":0.3094676494851289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390714631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76789045,0.00060422503,0.20848024,0.0013121841,0.00037207405,0.0018177138,0.0096985055,0.00019276659,0.0096318275],"genre_scores_gemma":[0.9942999,0.000011474676,0.0047919946,0.000062351224,0.000022242832,0.000058723905,0.000046844587,0.000036203124,0.00067025475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974765,0.00011255614,0.0011262795,0.0002178802,0.0006521856,0.00041460723],"domain_scores_gemma":[0.9967189,0.0013558147,0.00066624023,0.00063761545,0.00048608176,0.00013538108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011533652,0.00024025369,0.00096538325,0.00038447254,0.00024638392,0.000026674541,0.0004820732,0.00006021759,0.0008841195],"category_scores_gemma":[0.0025552327,0.00022892214,0.000249148,0.0010221502,0.00014196936,0.00009191303,0.00030902235,0.00021529787,0.000017115173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056293622,0.0007523802,0.00017599124,0.0020685815,0.00029101406,0.0000072686444,0.00698266,0.0005621428,0.002579018,0.9815166,0.004832081,0.00017598883],"study_design_scores_gemma":[0.0030829217,0.001304731,0.00025066035,0.0006861474,0.00063496595,0.00013227278,0.017860519,0.009252562,0.048205543,0.9070277,0.010444672,0.0011172873],"about_ca_topic_score_codex":0.00003120639,"about_ca_topic_score_gemma":0.0000028196725,"teacher_disagreement_score":0.22640945,"about_ca_system_score_codex":0.00015095084,"about_ca_system_score_gemma":0.00015673824,"threshold_uncertainty_score":0.9680488},"labels":[],"label_agreement":null},{"id":"W4391148148","doi":"10.55016/ojs/cdm.v18i2.73491","title":"Combinatorial settlement planning","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Urban Design and Spatial Analysis","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Sveučilište u Zagrebu","keywords":"Settlement (finance); Combinatorics; Mathematics; Combinatorial analysis; Computer science; World Wide Web","score_opus":0.014891184586600393,"score_gpt":0.2701460217193458,"score_spread":0.25525483713274544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148148","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07304995,0.00017906628,0.90580636,0.0015105709,0.0013857516,0.0008356872,0.0014402005,0.0029766224,0.012815791],"genre_scores_gemma":[0.99805933,0.00000766955,0.0010051396,0.00003210179,0.00017292585,0.00008479149,0.0001928438,0.000028986595,0.00041619435],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915206,0.000012407382,0.00025049143,0.0001038816,0.00018473915,0.00029638968],"domain_scores_gemma":[0.9994712,0.000088380955,0.000019939513,0.00022770638,0.00006455779,0.00012825726],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019925048,0.00012524064,0.00020480127,0.00015649521,0.000119122145,0.000057810455,0.00014166927,0.000050380757,0.00009178263],"category_scores_gemma":[0.00014575581,0.00011781565,0.000082047445,0.00064350443,0.0000143423995,0.000045224646,0.00004753786,0.00008458059,0.0009614509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014976292,0.00013057543,0.00063641416,0.00031350655,0.0008911028,0.00008368749,0.006123971,0.17450024,0.013521701,0.37851042,0.42376924,0.0015041643],"study_design_scores_gemma":[0.0010192025,0.000091870425,0.00066175027,0.00016559892,0.00024758957,0.0000040861596,0.00068338873,0.8715115,0.0053975196,0.059387166,0.060085714,0.00074459915],"about_ca_topic_score_codex":0.0000023765238,"about_ca_topic_score_gemma":0.0000017625733,"teacher_disagreement_score":0.92500937,"about_ca_system_score_codex":0.00009341793,"about_ca_system_score_gemma":0.000011392326,"threshold_uncertainty_score":0.9998164},"labels":[],"label_agreement":null},{"id":"W4391148150","doi":"10.55016/ojs/cdm.v18i2.73457","title":"On Colouring Oriented Graphs of Large Girth","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Girth (graph theory); Discrete mathematics","score_opus":0.016449777144991736,"score_gpt":0.3373477100802734,"score_spread":0.3208979329352817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098910965,0.000016186717,0.8977815,0.00087561127,0.00012261618,0.0005179705,0.00031992712,0.00034852634,0.0011066868],"genre_scores_gemma":[0.9808406,0.000008905682,0.018375827,0.00007591654,0.000013252284,0.00009528154,0.000023793438,0.000017418899,0.0005489606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827814,0.00007612248,0.0003532859,0.00028529082,0.00045659914,0.0005505741],"domain_scores_gemma":[0.9978382,0.00065561215,0.000107611784,0.000885566,0.00033352003,0.00017947263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008819115,0.00014394613,0.0002644227,0.0004756136,0.00024603787,0.00004768577,0.00079498295,0.000052554908,0.000019904366],"category_scores_gemma":[0.0016791802,0.00012668218,0.000116516436,0.0026738353,0.00006968532,0.00015990582,0.00050640776,0.00015634713,0.0003451782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007836867,0.00008393755,0.00003346282,0.00003111592,0.00002241046,0.000008694389,0.0005521384,0.00032089598,0.0011520246,0.99679846,0.0008259518,0.00016305438],"study_design_scores_gemma":[0.0008593142,0.00029537137,0.00051225926,0.00018596917,0.000012373009,0.0000052073615,0.00027263418,0.060753305,0.013471126,0.9211809,0.0021690766,0.00028243897],"about_ca_topic_score_codex":9.328048e-7,"about_ca_topic_score_gemma":0.000002779816,"teacher_disagreement_score":0.8819297,"about_ca_system_score_codex":0.000060525093,"about_ca_system_score_gemma":0.000054072774,"threshold_uncertainty_score":0.5165949},"labels":[],"label_agreement":null},{"id":"W4391148153","doi":"10.55016/ojs/cdm.v18i2.73143","title":"On some partition theorems of M. V. Subbarao","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Combinatorics; Discrete mathematics","score_opus":0.035257067068527846,"score_gpt":0.36723579070121876,"score_spread":0.33197872363269093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60526013,0.000091726535,0.35853353,0.0040237987,0.00067462696,0.0034626971,0.0021673664,0.0021276907,0.023658402],"genre_scores_gemma":[0.97754437,0.000033057222,0.015855985,0.00010863312,0.00012005749,0.00037297388,0.00008409359,0.000105728446,0.005775083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766994,0.00007117692,0.0008392566,0.0002897525,0.00058103947,0.00054884853],"domain_scores_gemma":[0.9959929,0.0023617717,0.0002792468,0.0008475052,0.00032156345,0.0001970091],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00084641273,0.00028234837,0.0006217512,0.0003400312,0.00019350198,0.000051502215,0.00036170724,0.00012250246,0.00019926426],"category_scores_gemma":[0.008423127,0.0002406711,0.00022447994,0.0008026116,0.00018833834,0.00022020227,0.00018137199,0.00017710487,0.0012695766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013920416,0.00018419349,0.0000029055482,0.00030246683,0.000048973245,0.000005689382,0.0006991839,0.0001361039,0.0017702744,0.98734593,0.009446039,0.00004431031],"study_design_scores_gemma":[0.00037719018,0.00013104682,0.000026377456,0.0003842199,0.000081206505,0.0000044891667,0.0005134158,0.0018420308,0.013688351,0.98244685,0.00024842276,0.0002564112],"about_ca_topic_score_codex":0.0000018775868,"about_ca_topic_score_gemma":0.000003384192,"teacher_disagreement_score":0.37228423,"about_ca_system_score_codex":0.0001275729,"about_ca_system_score_gemma":0.000045818888,"threshold_uncertainty_score":0.99992937},"labels":[],"label_agreement":null},{"id":"W4391148156","doi":"10.55016/ojs/cdm.v18i2.62607","title":"Resolvability in Hypergraphs","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.015678541215553475,"score_gpt":0.29367569208763117,"score_spread":0.2779971508720777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43461895,0.00016049316,0.53510654,0.021885045,0.00059983775,0.0012225185,0.00014682903,0.0020064223,0.0042534],"genre_scores_gemma":[0.9666509,0.0000110159535,0.03273264,0.00021079423,0.0000058724745,0.00009720982,0.000013754566,0.000009685168,0.000268109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985886,0.00005525315,0.00038028724,0.0003209264,0.00024297323,0.00041194627],"domain_scores_gemma":[0.99857396,0.00023483852,0.00004973226,0.000827596,0.00015954136,0.0001543627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010080718,0.00012438526,0.00021179026,0.0003682169,0.00014660213,0.000103217295,0.00056058465,0.000062659805,0.0000076991155],"category_scores_gemma":[0.0009530464,0.000109235414,0.00008057541,0.0025987802,0.000047943333,0.00014829825,0.00031802003,0.00012141663,0.0006046554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015358991,0.00007583124,0.00039271583,0.000022360779,0.0000072965936,0.000007914515,0.00086427695,0.00061940326,0.0013233502,0.99259377,0.0034718818,0.0006196608],"study_design_scores_gemma":[0.00045491668,0.000054813816,0.0026040173,0.00009651143,0.0000067481337,0.000004702507,0.00011828452,0.094170734,0.0012269848,0.89867437,0.0023207702,0.00026716746],"about_ca_topic_score_codex":0.00001610904,"about_ca_topic_score_gemma":0.000018207691,"teacher_disagreement_score":0.53203195,"about_ca_system_score_codex":0.000050047398,"about_ca_system_score_gemma":0.0000531031,"threshold_uncertainty_score":0.7771824},"labels":[],"label_agreement":null},{"id":"W4391148160","doi":"10.55016/ojs/cdm.v18i2.73182","title":"A graph related to the sum of element orders of a finite group","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Group (periodic table); Finite group; Discrete mathematics; Chemistry","score_opus":0.03771115176451516,"score_gpt":0.3573950771517207,"score_spread":0.3196839253872055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148160","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6916412,0.000101456455,0.28088376,0.011788746,0.00031636114,0.0066880407,0.0038222077,0.0005341003,0.0042241295],"genre_scores_gemma":[0.9879311,0.00001959098,0.010323303,0.00006743942,0.000024969617,0.0003950088,0.00009195308,0.000067760004,0.0010789146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697495,0.0002297256,0.0011217069,0.00028097146,0.00076016074,0.00063246663],"domain_scores_gemma":[0.99442255,0.0032663085,0.00030227008,0.0012129823,0.0005988884,0.00019698293],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0032173702,0.00024828556,0.0005960544,0.00055300014,0.00020530971,0.000034362132,0.0007949853,0.000114958624,0.00018820644],"category_scores_gemma":[0.00937987,0.00018013931,0.00026326682,0.003322977,0.0001946349,0.00006396081,0.0005050695,0.00025000088,0.0003400353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054482018,0.00025109225,0.00008844022,0.0003969459,0.00024738765,0.000005016032,0.0055152806,0.0004070069,0.0029351788,0.97981375,0.01010634,0.00017908047],"study_design_scores_gemma":[0.0012738307,0.00059510046,0.00035117232,0.0006031599,0.00022990875,0.000006955552,0.0051455535,0.008601685,0.0040948736,0.97408706,0.0045897667,0.0004209531],"about_ca_topic_score_codex":0.000016642212,"about_ca_topic_score_gemma":0.000049746228,"teacher_disagreement_score":0.29628986,"about_ca_system_score_codex":0.00008696449,"about_ca_system_score_gemma":0.00007924331,"threshold_uncertainty_score":0.99896455},"labels":[],"label_agreement":null},{"id":"W4391148170","doi":"10.55016/ojs/cdm.v18i2.73995","title":"Hankel Determinants of shifted sequences of Bernoulli and Euler numbers","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bernoulli's principle; Euler's formula; Combinatorics; Euler number (physics); Hankel transform; Euler equations; Semi-implicit Euler method; Mathematical analysis; Backward Euler method; Physics","score_opus":0.041519369895329145,"score_gpt":0.36173281081238956,"score_spread":0.3202134409170604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148170","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97620136,0.00006743665,0.019499684,0.00043950588,0.00014335403,0.0007069968,0.0010782687,0.0001381446,0.0017252557],"genre_scores_gemma":[0.95603865,0.00004604741,0.042454686,0.000021941654,0.000053713644,0.00010699221,0.000022980408,0.00004430888,0.0012106937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979956,0.000065647844,0.0010099534,0.00022824372,0.0003340913,0.00036644662],"domain_scores_gemma":[0.9965352,0.002078373,0.00036926847,0.00053422665,0.00029999306,0.00018298598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088177103,0.00022769699,0.0007723556,0.00022827204,0.00013356001,0.000029376215,0.00023709219,0.00013637109,0.00023665772],"category_scores_gemma":[0.0039647347,0.00018548251,0.00015410238,0.0006793383,0.00022672776,0.00009482757,0.00017525353,0.000102943755,0.00009183237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004447397,0.00044470927,0.0016413707,0.0030334734,0.00023201355,0.000011753841,0.0058005936,0.000016426751,0.01281635,0.96566886,0.009185852,0.001104148],"study_design_scores_gemma":[0.0011200414,0.0003313283,0.0010584934,0.0014460845,0.00051429286,0.00004144099,0.0023691938,0.0072475616,0.05725265,0.9265609,0.0013959055,0.0006621564],"about_ca_topic_score_codex":0.00002465729,"about_ca_topic_score_gemma":0.000026808291,"teacher_disagreement_score":0.0444363,"about_ca_system_score_codex":0.000033598073,"about_ca_system_score_gemma":0.000068540605,"threshold_uncertainty_score":0.75637573},"labels":[],"label_agreement":null},{"id":"W4391148171","doi":"10.55016/ojs/cdm.v18i2.73074","title":"Extended inverse theorems for $h$-fold sumsets in integers","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board; Council of Scientific and Industrial Research, India","keywords":"Mathematics; Fold (higher-order function); Combinatorics; Inverse; Computer science; Geometry","score_opus":0.03397540666762246,"score_gpt":0.36110881993711624,"score_spread":0.3271334132694938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7282675,0.000098811826,0.24270388,0.004388334,0.001638055,0.006699652,0.0032761325,0.0014510967,0.011476531],"genre_scores_gemma":[0.9716053,0.000022861936,0.025553027,0.0002605021,0.00015413553,0.0006507194,0.00012178706,0.00009104408,0.0015406199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978854,0.000086355045,0.0006866502,0.00035921656,0.0002818509,0.00070051214],"domain_scores_gemma":[0.9968608,0.0018154004,0.0001578294,0.0007409896,0.0002279315,0.00019705688],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015007716,0.00030441082,0.0005393432,0.00047242947,0.00034400064,0.000066720895,0.00047618884,0.00018338278,0.000072009825],"category_scores_gemma":[0.005976377,0.00024936692,0.00026108132,0.0009776454,0.00014952313,0.000115197625,0.00026172466,0.0002210407,0.000083300576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003736513,0.000072640774,0.00004228418,0.00015966276,0.00005934741,0.0000085917145,0.0035439464,0.000035970577,0.0004150385,0.9814054,0.013851354,0.00036842082],"study_design_scores_gemma":[0.00094041915,0.000072782976,0.00017464545,0.00017212424,0.000067838315,0.0000069942284,0.0018781783,0.0072211022,0.0011091449,0.9850436,0.002974208,0.00033899015],"about_ca_topic_score_codex":0.00000470352,"about_ca_topic_score_gemma":0.000047855505,"teacher_disagreement_score":0.2433378,"about_ca_system_score_codex":0.00016088743,"about_ca_system_score_gemma":0.000059622736,"threshold_uncertainty_score":0.9999958},"labels":[],"label_agreement":null},{"id":"W4391148175","doi":"10.55016/ojs/cdm.v18i2.74005","title":"Structural theory of trees II. Completeness and completions of trees","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Completeness (order theory); Combinatorics; Discrete mathematics","score_opus":0.028014663443532727,"score_gpt":0.2949397485622686,"score_spread":0.2669250851187359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30237284,0.000102749735,0.69560975,0.00076973304,0.00007113553,0.000265592,0.0004233346,0.00012821912,0.0002566582],"genre_scores_gemma":[0.97873765,0.00000846482,0.02103877,0.000026604914,0.000015929689,0.000019712139,0.000029181017,0.000006880549,0.000116798255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989323,0.000057631234,0.0003916473,0.0001929542,0.00018915502,0.00023634003],"domain_scores_gemma":[0.9985927,0.00048685927,0.00015972501,0.000465324,0.00020617049,0.00008922836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027294856,0.00013381972,0.00035994523,0.00016259127,0.00025376433,0.000026357946,0.00046442877,0.000040102066,0.00001578277],"category_scores_gemma":[0.00035958303,0.0001063831,0.000096754215,0.000687817,0.00020142677,0.00014853693,0.00044616943,0.00006328462,0.000007834488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003339132,0.000023095252,0.00013552653,0.000035242232,0.000029256247,0.0000012377699,0.0012159959,0.0005074662,0.0031893945,0.9937151,0.00010392687,0.0010404221],"study_design_scores_gemma":[0.0005407612,0.00020354283,0.030441275,0.00012289447,0.00004938761,0.000016546006,0.0007977962,0.064381875,0.0025520562,0.90031165,0.00032649876,0.00025569208],"about_ca_topic_score_codex":0.0000027274118,"about_ca_topic_score_gemma":0.000021048063,"teacher_disagreement_score":0.6763648,"about_ca_system_score_codex":0.000017960489,"about_ca_system_score_gemma":0.000029459463,"threshold_uncertainty_score":0.4338177},"labels":[],"label_agreement":null},{"id":"W4391148177","doi":"10.55016/ojs/cdm.v18i2.73702","title":"Further Rogers-Ramanujan type identities for modified lattice paths","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Ramanujan's sum; Type (biology); Lattice (music); Biology; Paleontology; Physics","score_opus":0.061742362360772435,"score_gpt":0.38184891160686896,"score_spread":0.3201065492460965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.093744144,0.00013891136,0.8837439,0.003300148,0.00094774715,0.004371048,0.0019111062,0.002303112,0.009539927],"genre_scores_gemma":[0.5880089,0.000119423814,0.29629138,0.00046787353,0.0010103012,0.0025316046,0.00055399665,0.0006488587,0.1103677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970487,0.00006487943,0.0009346936,0.0004580885,0.00056061783,0.00093303534],"domain_scores_gemma":[0.9949993,0.0026120183,0.00027502558,0.0009825202,0.00083777617,0.00029334697],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010205545,0.00043243205,0.0007686857,0.0003447503,0.0004453056,0.0002618009,0.0005729271,0.00019622702,0.00016161919],"category_scores_gemma":[0.01023981,0.00039890653,0.0003097691,0.0009996778,0.00016249437,0.00034503874,0.00031223363,0.00020476134,0.001233457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024748555,0.00014391015,0.000006758967,0.00072052603,0.00014790693,0.000010934915,0.0029920728,0.0001302497,0.00081237283,0.9663707,0.028558059,0.00008173112],"study_design_scores_gemma":[0.0006707797,0.00010826852,0.000013386105,0.00023435311,0.00025664322,0.000013038825,0.0028713397,0.008432524,0.0017247974,0.9824905,0.002679508,0.0005048529],"about_ca_topic_score_codex":0.0000029535322,"about_ca_topic_score_gemma":0.000014020961,"teacher_disagreement_score":0.5874525,"about_ca_system_score_codex":0.00020318343,"about_ca_system_score_gemma":0.00009107368,"threshold_uncertainty_score":0.9998463},"labels":[],"label_agreement":null},{"id":"W4391148179","doi":"10.55016/ojs/cdm.v18i2.74004","title":"Structural theory of trees I. Branching and condensations of trees","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Branching (polymer chemistry); Mathematics; Combinatorics; Tree (set theory); Chemistry","score_opus":0.02636778410779442,"score_gpt":0.3287260191071142,"score_spread":0.30235823499931974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37265766,0.000092293114,0.6257914,0.00046901952,0.000044547123,0.00030935125,0.00025860302,0.00010122825,0.00027594678],"genre_scores_gemma":[0.9792119,0.00000934876,0.02051461,0.000011536144,0.000011806086,0.000022088707,0.0000108507065,0.000008948008,0.00019888575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987638,0.000112790505,0.00038791046,0.00019752668,0.00027246654,0.00026549067],"domain_scores_gemma":[0.99782056,0.0011247065,0.00014322957,0.0005454281,0.00026327616,0.00010277832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073589827,0.00011868761,0.00029025742,0.0003064346,0.00017319647,0.000045812365,0.00050714513,0.000043395004,0.000013331585],"category_scores_gemma":[0.0013598455,0.00009939854,0.00007707543,0.0009804891,0.00023840311,0.00024292259,0.00035514505,0.000097126314,0.000009115117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000603283,0.000012443289,0.0002141432,0.00004241925,0.000033921286,0.0000012747003,0.002314822,0.00048161595,0.010617403,0.98464274,0.00004203591,0.001591128],"study_design_scores_gemma":[0.00038274878,0.00008392675,0.008787989,0.00009884611,0.000020208128,0.000008104723,0.0008069118,0.05812155,0.008468802,0.92303914,0.000034665347,0.00014709549],"about_ca_topic_score_codex":0.0000021375056,"about_ca_topic_score_gemma":0.000019541902,"teacher_disagreement_score":0.60655427,"about_ca_system_score_codex":0.000021627393,"about_ca_system_score_gemma":0.000048556263,"threshold_uncertainty_score":0.40533546},"labels":[],"label_agreement":null},{"id":"W4391148181","doi":"10.55016/ojs/cdm.v18i2.73022","title":"On signs of certain Toeplitz-Hessenberg determinants whose elements involve Bernoulli numbers","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Toeplitz matrix; Mathematics; Bernoulli's principle; Combinatorics; Bernoulli number; Pure mathematics","score_opus":0.06309121257354112,"score_gpt":0.39221205056856345,"score_spread":0.32912083799502234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148181","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80061364,0.000025259496,0.1758409,0.0030648885,0.00023751473,0.0038197846,0.00465444,0.00080613425,0.010937449],"genre_scores_gemma":[0.9626076,0.000025677391,0.028083965,0.00024600973,0.00013030459,0.0010329544,0.00020563578,0.000138574,0.007529227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99657065,0.00009578942,0.0014640534,0.0004323412,0.00067759573,0.0007595524],"domain_scores_gemma":[0.9947934,0.0027569025,0.00048518748,0.0012300661,0.00039455458,0.00033987357],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010712266,0.0004039318,0.0008298929,0.00026020655,0.00031374715,0.00007493435,0.0005810857,0.00017570476,0.00039497428],"category_scores_gemma":[0.004285121,0.0003503741,0.0002948746,0.0010690786,0.00014007278,0.00010380995,0.00027951872,0.0002145891,0.00081127806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000149703565,0.00048599628,0.000054288834,0.00059489836,0.000098338605,0.0000060646516,0.0019531716,0.000033472006,0.0014367163,0.9767949,0.018243792,0.00028339282],"study_design_scores_gemma":[0.0007222123,0.00024775515,0.000043043052,0.0007035746,0.00017516641,0.000005026915,0.002524717,0.007188513,0.007642772,0.97720456,0.0029962682,0.000546409],"about_ca_topic_score_codex":0.000024134451,"about_ca_topic_score_gemma":0.00004199154,"teacher_disagreement_score":0.16199403,"about_ca_system_score_codex":0.00016085392,"about_ca_system_score_gemma":0.00008177792,"threshold_uncertainty_score":0.9999667},"labels":[],"label_agreement":null},{"id":"W4391148187","doi":"10.55016/ojs/cdm.v18i2.70912","title":"Total dominator total coloring of a graph","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Fractional coloring; List coloring; Complete coloring; Total coloring; Edge coloring; Graph coloring; Greedy coloring; Graph; Graph power; Line graph","score_opus":0.012886857894524775,"score_gpt":0.27473355643379,"score_spread":0.26184669853926523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5856014,0.00008672665,0.40986246,0.001890523,0.00047248355,0.00053258246,0.00016481178,0.00060245744,0.000786582],"genre_scores_gemma":[0.9709804,0.000004925846,0.02847102,0.000034595865,0.0000092648825,0.000068475776,0.000011003505,0.000011293456,0.00040903996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858207,0.00003239246,0.00043313095,0.00026126005,0.00031276673,0.00037838882],"domain_scores_gemma":[0.998565,0.00023000881,0.0001228511,0.0006113233,0.0002933227,0.00017747078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005562154,0.00014461722,0.00028886044,0.00031136652,0.00018475871,0.00008031677,0.00041199411,0.00006370158,0.0000093590315],"category_scores_gemma":[0.0005506359,0.0001280902,0.00014454233,0.0016753301,0.00006656996,0.00015894917,0.00039196567,0.0000945684,0.00021502523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036229758,0.00007339579,0.000029254763,0.000055293258,0.000038538405,0.000008696649,0.0011422925,0.0009735352,0.011502736,0.9838758,0.0018774262,0.00041942287],"study_design_scores_gemma":[0.0019815087,0.00047866904,0.0015575534,0.0005335802,0.00009833219,0.00010037899,0.0007210026,0.22642171,0.043810904,0.72281516,0.0005885698,0.00089261465],"about_ca_topic_score_codex":0.000007961328,"about_ca_topic_score_gemma":0.0000010863336,"teacher_disagreement_score":0.38537902,"about_ca_system_score_codex":0.00003143269,"about_ca_system_score_gemma":0.000061826555,"threshold_uncertainty_score":0.5223367},"labels":[],"label_agreement":null},{"id":"W4391148188","doi":"10.55016/ojs/cdm.v18i2.73497","title":"q-Analogues of $\\pi$-Series by Applying Carlitz Inversions to q-Pfaff-Saalschutz Theorem","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pi; Series (stratigraphy); Pure mathematics; Combinatorics; Geometry","score_opus":0.033504270999982905,"score_gpt":0.34612237007474433,"score_spread":0.31261809907476146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391148188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15094367,0.00032421591,0.80403584,0.007353037,0.0005657959,0.0072548185,0.008465541,0.002354967,0.018702108],"genre_scores_gemma":[0.7343661,0.00019450736,0.2298122,0.00038191065,0.00031986224,0.0029565138,0.0006069291,0.00040231665,0.030959629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99655765,0.00011389591,0.0012377873,0.00046768683,0.00077008776,0.00085287227],"domain_scores_gemma":[0.99538946,0.0020065776,0.0003524433,0.0011668954,0.0006131217,0.0004714845],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010876502,0.00045834802,0.0010759991,0.00046059626,0.00042301934,0.000115116796,0.0007403355,0.00017653473,0.00019236754],"category_scores_gemma":[0.010430158,0.00041033927,0.0003158361,0.0016644045,0.00028802222,0.0003500487,0.0006657558,0.00024426926,0.00086018204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001840069,0.00018808871,0.000015646157,0.00061999675,0.00015430304,0.0000073599354,0.0034421321,0.00007427305,0.008828361,0.90699655,0.079556145,0.0000987422],"study_design_scores_gemma":[0.00038617838,0.00015277362,0.000009588802,0.0005386374,0.00024342688,0.0000110325345,0.0071853236,0.00062107726,0.01963998,0.9617857,0.008887533,0.000538792],"about_ca_topic_score_codex":0.000014532844,"about_ca_topic_score_gemma":0.000032518226,"teacher_disagreement_score":0.5834225,"about_ca_system_score_codex":0.00020031733,"about_ca_system_score_gemma":0.00008882172,"threshold_uncertainty_score":0.99991775},"labels":[],"label_agreement":null},{"id":"W4396627085","doi":"10.55016/ojs/cdm.v19i1","title":"Prime 2-structures","year":2024,"lang":"en","type":"paratext","venue":"Contributions to Discrete Mathematics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Université de Nantes","keywords":"Mathematics; Combinatorics; Prime (order theory)","score_opus":0.025313247317834218,"score_gpt":0.3304641257187605,"score_spread":0.30515087840092625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396627085","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006231137,0.012323424,0.4846025,0.0072086696,0.015572098,0.008381516,0.02890305,0.002045053,0.43473256],"genre_scores_gemma":[0.026812421,0.0005244256,0.07435851,0.0006029028,0.0061116517,0.0010108803,0.0022150176,0.00092319003,0.887441],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958194,0.00009712579,0.0013490799,0.0009238617,0.00077872106,0.0010318238],"domain_scores_gemma":[0.9961244,0.00070949155,0.0004646577,0.0017508642,0.0004909352,0.00045965656],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005753153,0.0010118443,0.001575979,0.00051737414,0.00036975616,0.0005915658,0.0010242369,0.00078351103,0.0035131797],"category_scores_gemma":[0.0020869786,0.00084009266,0.0006716982,0.0006201491,0.00018649013,0.00012507856,0.00060514436,0.0011029653,0.03395504],"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.000005523575,0.00007492591,1.6434015e-7,0.0011937968,0.0003067531,0.000015489952,0.00069522276,0.00000785118,0.00020154916,0.35207024,0.6452164,0.00021204725],"study_design_scores_gemma":[0.00027851624,0.00006837666,0.000001893179,0.0013943686,0.0006249806,0.00005776464,0.00016385596,0.00019210871,0.0029311164,0.5877903,0.40552217,0.0009745353],"about_ca_topic_score_codex":0.000013210248,"about_ca_topic_score_gemma":0.000014684589,"teacher_disagreement_score":0.45270845,"about_ca_system_score_codex":0.00049798447,"about_ca_system_score_gemma":0.00041603937,"threshold_uncertainty_score":0.99940497},"labels":[],"label_agreement":null},{"id":"W4396627087","doi":"10.55016/ojs/cdm.v19i1.73551","title":"Prime 2-structures","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Prime (order theory)","score_opus":0.023146051329267083,"score_gpt":0.3225657235785452,"score_spread":0.2994196722492781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396627087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12756301,0.0014183235,0.8440139,0.0051693744,0.0012499583,0.0016460711,0.00095196976,0.0019000081,0.016087338],"genre_scores_gemma":[0.9323408,0.00002501859,0.061621077,0.00017359457,0.00063677016,0.00013672128,0.000049185463,0.000106249674,0.004910594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981377,0.00004122452,0.0005543127,0.00038546897,0.00036725917,0.0005140333],"domain_scores_gemma":[0.99824643,0.0005680138,0.000076432996,0.0006952199,0.00017409309,0.00023981955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045876138,0.00030684576,0.00042260005,0.00020908058,0.00023248774,0.00034408396,0.00036446695,0.00013492443,0.00034646702],"category_scores_gemma":[0.0017035989,0.00024584454,0.000228516,0.00045080876,0.0000908814,0.0001752235,0.00016006222,0.000264181,0.0007562116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032697242,0.000050623992,0.000005477446,0.00026637455,0.00009952753,0.00001982518,0.0011850082,0.0000050123417,0.001547218,0.9748053,0.020958893,0.0010534601],"study_design_scores_gemma":[0.00018568532,0.0000457708,0.000052241856,0.00033687172,0.00015733637,0.000059346647,0.00021333374,0.0020703555,0.008325639,0.9557923,0.032383475,0.0003776251],"about_ca_topic_score_codex":0.0000047863837,"about_ca_topic_score_gemma":0.0000072204507,"teacher_disagreement_score":0.80477774,"about_ca_system_score_codex":0.00016785515,"about_ca_system_score_gemma":0.00011236348,"threshold_uncertainty_score":0.9999994},"labels":[],"label_agreement":null},{"id":"W4400596696","doi":"10.55016/ojs/cdm.v13i2.62733","title":"The Complexity of Power Graphs Associated With Finite Groups","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; King Saud University; Division of Mathematical Sciences; Kent State University","keywords":"Combinatorics; Mathematics; Clique graph; Vertex (graph theory); Graph; Finite group; Simplex graph; Discrete mathematics; Split graph; Simple graph; Clique; Graph power; Group (periodic table); Line graph; Pathwidth","score_opus":0.014652087546509748,"score_gpt":0.23763441569815247,"score_spread":0.2229823281516427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7083325,0.00024450888,0.26764736,0.00042403888,0.00053933455,0.0011282456,0.0013263021,0.00053645024,0.019821279],"genre_scores_gemma":[0.99946266,0.0000031171032,0.00033236062,0.000014697733,0.00002170416,0.000038481576,0.000019689842,0.000020982854,0.00008632728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990552,0.000052728177,0.00032902526,0.00009525495,0.00017959309,0.00028820615],"domain_scores_gemma":[0.9987738,0.000350753,0.00008331326,0.0004100343,0.0002962993,0.00008578308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047401164,0.00014758497,0.00024480032,0.00005818959,0.00030126396,0.000044627945,0.00024392486,0.0000606846,0.000035139874],"category_scores_gemma":[0.00041670623,0.000095126066,0.0000816252,0.00047353006,0.00052897993,0.000053114964,0.00003346296,0.00010083506,0.000048954214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015012158,0.00004333356,0.000102358594,0.000029933273,0.00022868249,9.980788e-7,0.0014192257,0.00019828489,0.0007513153,0.99612856,0.0010486636,0.00003360606],"study_design_scores_gemma":[0.0020455548,0.0009808935,0.008089576,0.0010997014,0.00034014814,0.000023125218,0.0036283534,0.04784311,0.013454648,0.9135846,0.007770359,0.0011399158],"about_ca_topic_score_codex":0.0000018921656,"about_ca_topic_score_gemma":0.000057802936,"teacher_disagreement_score":0.29113016,"about_ca_system_score_codex":0.000040405383,"about_ca_system_score_gemma":0.000012506684,"threshold_uncertainty_score":0.38791284},"labels":[],"label_agreement":null},{"id":"W4400596698","doi":"10.55016/ojs/cdm.v14i1.62415","title":"Feedback vertex number of Sierpi\\'{n}ski-type graphs","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Upper and lower bounds; Clique number; Wheel graph; Discrete mathematics; Graph power; Line graph","score_opus":0.016495107194708706,"score_gpt":0.32924276054402213,"score_spread":0.3127476533493134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596698","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9540914,0.00003570714,0.01667218,0.00071550126,0.00027482817,0.0015884374,0.00057317404,0.00020322057,0.02584553],"genre_scores_gemma":[0.9760566,0.000008962407,0.021102482,0.000082824816,0.000025942254,0.00008352441,0.000050456336,0.0000470917,0.0025421265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817663,0.00006878966,0.0007019356,0.0003047272,0.00032577603,0.00042216657],"domain_scores_gemma":[0.9970196,0.00085817516,0.00027518225,0.0011213172,0.0005265265,0.00019919095],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005501849,0.00026892452,0.00057439297,0.00012680003,0.00015678433,0.000048188733,0.00047342214,0.00015075282,0.0011517947],"category_scores_gemma":[0.0010716132,0.00024041133,0.00025154077,0.00094318384,0.00012202855,0.00011893038,0.0001455455,0.00019330639,0.002004578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018912202,0.00026312572,0.00065388344,0.00016945468,0.000093795934,6.337016e-7,0.000539088,0.000007761819,0.0036089437,0.99027604,0.0042943885,0.00007399809],"study_design_scores_gemma":[0.00056554284,0.000067619745,0.00031354377,0.0001848626,0.00014892977,0.00001376217,0.00045561237,0.00035112907,0.004300172,0.98969656,0.0035904928,0.00031176547],"about_ca_topic_score_codex":0.000004123643,"about_ca_topic_score_gemma":0.0000023680113,"teacher_disagreement_score":0.023303403,"about_ca_system_score_codex":0.000057735208,"about_ca_system_score_gemma":0.00006897325,"threshold_uncertainty_score":0.9997613},"labels":[],"label_agreement":null},{"id":"W4400596699","doi":"10.55016/ojs/cdm.v13i2.62378","title":"Decomposition of the complete bipartite graph with a 1-factor removed into paths and stars","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Council","keywords":"Combinatorics; Bipartite graph; Mathematics; Complete bipartite graph; Decomposition; Disjoint sets; Star (game theory); Stars; Graph; Path (computing); Discrete mathematics; Chemistry; Physics; Computer science; Astrophysics","score_opus":0.007471612639337897,"score_gpt":0.23914193056462946,"score_spread":0.23167031792529155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89198494,0.00008598562,0.106424846,0.00011699211,0.000107642336,0.00042214055,0.0003560815,0.00008507697,0.0004162876],"genre_scores_gemma":[0.9973499,0.0000045081715,0.0025226125,0.000021714937,0.000030333007,0.000028761582,0.0000084544545,0.000017415266,0.000016275224],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928015,0.00004122385,0.0002627737,0.00010646451,0.0001297352,0.00017967283],"domain_scores_gemma":[0.99928284,0.00007652137,0.000064743406,0.00034662668,0.00014661394,0.000082652696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014616018,0.00013473367,0.00021424264,0.00006682583,0.00017446215,0.000033527667,0.00013957337,0.000045566994,0.000015488595],"category_scores_gemma":[0.000051293315,0.00008885267,0.000054267875,0.00032059665,0.00017831622,0.00006736126,0.000040725525,0.00007162535,0.0000121199755],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001539182,0.00018229253,0.0030375528,0.0012411961,0.0007295214,0.0000050955805,0.02285543,0.0012048109,0.55738884,0.4108849,0.0011868103,0.0011296198],"study_design_scores_gemma":[0.007805735,0.0022922568,0.073747285,0.006750357,0.0012196203,0.0003029541,0.007018836,0.18035278,0.3437808,0.35610166,0.017027544,0.0036001974],"about_ca_topic_score_codex":0.000006947353,"about_ca_topic_score_gemma":0.00005008353,"teacher_disagreement_score":0.21360809,"about_ca_system_score_codex":0.000030932748,"about_ca_system_score_gemma":0.000010429727,"threshold_uncertainty_score":0.36233068},"labels":[],"label_agreement":null},{"id":"W4400596703","doi":"10.55016/ojs/cdm.v14i1.62676","title":"Sun toughness and $P_{\\geq3}$-factors in graphs","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Government of Jiangsu Province; National Natural Science Foundation of China","keywords":"Combinatorics; Graph; Mathematics; Discrete mathematics","score_opus":0.014420542068680871,"score_gpt":0.3067048240553862,"score_spread":0.2922842819867053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596703","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5973116,0.000108396605,0.39933676,0.00080867915,0.00013419239,0.0008074464,0.00006782898,0.00011764445,0.001307415],"genre_scores_gemma":[0.98311377,0.000014075284,0.016271764,0.00006243604,0.0000095360765,0.000049424107,0.000008732854,0.000014661964,0.00045560417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835545,0.000083012266,0.00033764887,0.00039528537,0.00030864018,0.0005199512],"domain_scores_gemma":[0.9982023,0.000519879,0.00007158552,0.00083393924,0.00016163898,0.00021062218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005685599,0.00019072629,0.00032404668,0.0003447703,0.00012183405,0.00017210616,0.0007514206,0.000075559896,0.00003015878],"category_scores_gemma":[0.0005247939,0.00016219397,0.00006799369,0.0011202751,0.0000847602,0.00046210794,0.00050406426,0.00021157376,0.00012682342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004849381,0.000056563338,0.006060395,0.00004098084,0.000011938543,0.0000055731284,0.0011486405,0.00008058758,0.0010505744,0.9911135,0.000056314737,0.00037011996],"study_design_scores_gemma":[0.001239087,0.0002011385,0.014101425,0.00021604865,0.000012424055,0.0000226288,0.00082057953,0.023059156,0.005588133,0.9521022,0.0019718637,0.00066536205],"about_ca_topic_score_codex":0.000008823775,"about_ca_topic_score_gemma":0.000017745378,"teacher_disagreement_score":0.38580212,"about_ca_system_score_codex":0.00008817461,"about_ca_system_score_gemma":0.00005385565,"threshold_uncertainty_score":0.6614078},"labels":[],"label_agreement":null},{"id":"W4400596706","doi":"10.55016/ojs/cdm.v13i2.62416","title":"A lower bound on the hypergraph Ramsey number R(4,5;3)","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ramsey's theorem; Hypergraph; Combinatorics; Mathematics; Set (abstract data type); Element (criminal law); Upper and lower bounds; Discrete mathematics; Graph; Computer science","score_opus":0.022868031830504846,"score_gpt":0.3238653703416144,"score_spread":0.30099733851110955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596706","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80562985,0.000043403008,0.048248537,0.0072730416,0.0015885488,0.0020710505,0.0006461621,0.00046413098,0.13403527],"genre_scores_gemma":[0.98904186,0.00000587659,0.006696882,0.0014354209,0.0005582248,0.00013048411,0.0000076033907,0.000060792136,0.0020628744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790263,0.00013773615,0.0005370801,0.0003470839,0.0004779446,0.0005975269],"domain_scores_gemma":[0.99624705,0.0015178501,0.00018133274,0.0013871593,0.00045959957,0.00020701942],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00094788626,0.00035253027,0.00041125948,0.00009833877,0.0013833123,0.00017202667,0.0006859472,0.00016508727,0.0014923944],"category_scores_gemma":[0.0036120457,0.00021033279,0.00028308615,0.0005564941,0.0005411584,0.000081696846,0.00027654853,0.0003178117,0.00087142596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032935237,0.0001228766,0.000029611761,0.000020835347,0.000107486594,0.0000037897523,0.0014395365,6.534803e-7,0.0001698084,0.9610115,0.03694591,0.00011505343],"study_design_scores_gemma":[0.00029266224,0.00016576385,0.000072297495,0.00013114474,0.00011300263,0.000029631594,0.0003607887,0.00023226434,0.0017785814,0.96704525,0.02944112,0.0003375212],"about_ca_topic_score_codex":0.000003810273,"about_ca_topic_score_gemma":0.000012582551,"teacher_disagreement_score":0.183412,"about_ca_system_score_codex":0.00009220697,"about_ca_system_score_gemma":0.000047378802,"threshold_uncertainty_score":0.99991673},"labels":[],"label_agreement":null},{"id":"W4400596709","doi":"10.55016/ojs/cdm.v13i2.62731","title":"Small on-line Ramsey numbers---a new approach","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Ramsey's theorem; Mathematics; Generalization; Line (geometry); Discrete mathematics; Graph","score_opus":0.07199690665834285,"score_gpt":0.3478691049751285,"score_spread":0.27587219831678567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04018408,0.000035769805,0.85193145,0.0012825403,0.0005882242,0.0012943773,0.00035158906,0.000413965,0.10391802],"genre_scores_gemma":[0.6498049,0.000008870563,0.3325178,0.00114573,0.0018537334,0.000101137346,0.000069274945,0.00013085219,0.0143677015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997731,0.00009465418,0.0006624489,0.00047570185,0.0003894189,0.0006468336],"domain_scores_gemma":[0.9969477,0.00067379116,0.00021604513,0.0013276428,0.00038226452,0.00045257556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007397593,0.00040379798,0.00057970616,0.00018428481,0.00068475684,0.000120162855,0.0006847686,0.00022421403,0.0004818496],"category_scores_gemma":[0.0033051083,0.0003145776,0.0002510077,0.00052519114,0.0002509985,0.00007526783,0.0003101344,0.0003148723,0.0005494184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004259768,0.00018399204,0.000009705894,0.000062788946,0.000113753595,0.0000027609713,0.0027885907,0.00001559459,0.00010721185,0.964761,0.031229028,0.0006829557],"study_design_scores_gemma":[0.00091746246,0.00026854992,0.000019763556,0.00013346142,0.00016333736,0.00003641811,0.00044784666,0.0025692289,0.002378119,0.9771574,0.015410574,0.00049784296],"about_ca_topic_score_codex":0.000010483517,"about_ca_topic_score_gemma":0.000014550767,"teacher_disagreement_score":0.6096208,"about_ca_system_score_codex":0.0001328741,"about_ca_system_score_gemma":0.00009995304,"threshold_uncertainty_score":0.9999306},"labels":[],"label_agreement":null},{"id":"W4400596715","doi":"10.55016/ojs/cdm.v13i2.62729","title":"On the order of appearance of product of consecutive Fibonacci numbers","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Silpakorn University; Thailand Research Fund; Institute for the Promotion of Teaching Science and Technology","keywords":"Combinatorics; Fibonacci number; Order (exchange); Integer (computer science); Product (mathematics); Mathematics; Physics; Geometry; Computer science","score_opus":0.008473039852822684,"score_gpt":0.3024948939827146,"score_spread":0.29402185412989196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12629123,0.000024554409,0.8439181,0.0011875132,0.000037405247,0.0010375177,0.0012154992,0.000014788018,0.026273392],"genre_scores_gemma":[0.9912437,8.249571e-7,0.008404393,0.000019405212,0.000045436944,0.00007225298,0.000008383813,0.000010040692,0.00019552634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912626,0.000024711859,0.00042000483,0.00012701243,0.0001471747,0.00015486775],"domain_scores_gemma":[0.9980804,0.00044236335,0.00029952198,0.0005065712,0.0006277225,0.00004342757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002033831,0.00011279282,0.00030401125,0.000026352614,0.00009770469,0.000005292785,0.00021740193,0.000018055416,0.00026056194],"category_scores_gemma":[0.0004164731,0.00007448988,0.00009039143,0.0003818982,0.000461963,0.000028569373,0.00006635959,0.00006827378,0.000031249845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001354725,0.00016222225,0.000023933315,0.000041270778,0.000057312605,1.5341486e-8,0.0006677174,0.000036624337,0.0025285545,0.99589854,0.0003912232,0.00017905321],"study_design_scores_gemma":[0.00022786515,0.00010105075,0.000037008256,0.00025360723,0.000052614316,2.991182e-7,0.0013409052,0.0004834084,0.1308365,0.8658766,0.00068338506,0.00010672895],"about_ca_topic_score_codex":0.000009111505,"about_ca_topic_score_gemma":7.3405954e-7,"teacher_disagreement_score":0.8649525,"about_ca_system_score_codex":0.0000102968725,"about_ca_system_score_gemma":0.000047208803,"threshold_uncertainty_score":0.30376092},"labels":[],"label_agreement":null},{"id":"W4400596716","doi":"10.55016/ojs/cdm.v13i1.62554","title":"Some inequalities for orderings of acyclic digraphs","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Digraph; Combinatorics; Mathematics; Order (exchange); Partially ordered set; Class (philosophy); Dimension (graph theory); Comparability; Discrete mathematics","score_opus":0.028690178979588993,"score_gpt":0.351742915839808,"score_spread":0.323052736860219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019918257,0.00010118822,0.9773736,0.0011107383,0.000115385585,0.0006758536,0.00025814574,0.00012256207,0.00032426472],"genre_scores_gemma":[0.78913695,0.000012763097,0.20980597,0.00014107043,0.00014894483,0.000247958,0.000011659565,0.000020470508,0.00047424098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985657,0.000041927513,0.00042574474,0.00025653333,0.0002661549,0.00044396103],"domain_scores_gemma":[0.99759203,0.0005974552,0.00013846027,0.00081547396,0.0007126457,0.0001439598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006402625,0.00014678907,0.00029828603,0.00024248187,0.00023603377,0.00008407407,0.0009659032,0.0000534447,0.00000960092],"category_scores_gemma":[0.001708921,0.0001282239,0.00012813062,0.00067237654,0.00026379383,0.0004084795,0.00037232452,0.00007409822,0.000039466868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009361304,0.0000471485,0.000012182721,0.0000650464,0.000025645733,3.0189548e-7,0.0013884844,0.000007905993,0.0038015503,0.99369806,0.0003358587,0.0006084684],"study_design_scores_gemma":[0.00041143034,0.00031951212,0.00004663308,0.000077882454,0.000011865358,0.0000033514566,0.00022185787,0.008855207,0.036184702,0.9495029,0.0041693742,0.00019532129],"about_ca_topic_score_codex":0.0000032719217,"about_ca_topic_score_gemma":0.0000044258104,"teacher_disagreement_score":0.7692187,"about_ca_system_score_codex":0.00004252486,"about_ca_system_score_gemma":0.000067537214,"threshold_uncertainty_score":0.52288187},"labels":[],"label_agreement":null},{"id":"W4400596718","doi":"10.55016/ojs/cdm.v14i1.62428","title":"Cyclic Orthogonal Double Covers of Circulants by Certain Nerve Cell Graphs.","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Circulant matrix; Circulant graph; Graph; Discrete mathematics; Line graph; Graph power","score_opus":0.01524160891194308,"score_gpt":0.2983028389239839,"score_spread":0.2830612300120408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596718","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95731163,0.000079110265,0.0294288,0.0003852093,0.00009339889,0.0015431066,0.0020813544,0.00012348825,0.008953927],"genre_scores_gemma":[0.9943032,0.000009117414,0.0039058805,0.000058800862,0.00001753236,0.00015398768,0.00018538722,0.000042226762,0.0013238582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806315,0.00006517501,0.0007169594,0.0003349764,0.0003637406,0.00045598176],"domain_scores_gemma":[0.9976459,0.00060244894,0.00036009232,0.00090907404,0.0002626981,0.00021979264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005583262,0.00028143046,0.00055978616,0.00015958269,0.00017670651,0.00004436693,0.00045876944,0.00015013338,0.0003517701],"category_scores_gemma":[0.00019893397,0.00025774806,0.00029363262,0.00063491135,0.00010985089,0.00011608092,0.00011637807,0.00019300422,0.0003294987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002929319,0.00045025934,0.00041294648,0.0002020377,0.00007815027,0.0000010191429,0.0005309888,0.000041796306,0.045165386,0.94705814,0.0060114576,0.000018518293],"study_design_scores_gemma":[0.0021908623,0.000118958684,0.000129234,0.00016458126,0.00023553564,0.000012415434,0.00090159517,0.00048514907,0.064834386,0.9268915,0.003509226,0.00052652106],"about_ca_topic_score_codex":0.000010055898,"about_ca_topic_score_gemma":0.0000045782867,"teacher_disagreement_score":0.036991604,"about_ca_system_score_codex":0.00006536565,"about_ca_system_score_gemma":0.00006704478,"threshold_uncertainty_score":0.9999875},"labels":[],"label_agreement":null},{"id":"W4400596720","doi":"10.55016/ojs/cdm.v13i1.62549","title":"A characterization of well-founced algebraic lattices","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Semilattice; Omega; Join (topology); Mathematics; Combinatorics; Corollary; Algebraic number; Lattice (music); Distributive lattice; Partially ordered set; Discrete mathematics; Pure mathematics; Distributive property; Physics","score_opus":0.012597248641765868,"score_gpt":0.28048196341450937,"score_spread":0.2678847147727435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09829048,0.00001673141,0.89829034,0.0009327327,0.00016468,0.00029744746,0.00005318336,0.00013084276,0.0018235641],"genre_scores_gemma":[0.9452316,0.00000608275,0.05408529,0.00022551138,0.000105649364,0.00003166032,0.000022722787,0.00000899516,0.00028248888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988754,0.000034791905,0.00036333117,0.00023799982,0.0002188359,0.00026966544],"domain_scores_gemma":[0.99856025,0.00010412673,0.00020215173,0.0005949711,0.00042733442,0.00011114931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002261559,0.00013689678,0.00023926994,0.00010837392,0.00017311925,0.00007636446,0.0006022948,0.000056028992,0.000060256014],"category_scores_gemma":[0.00032119884,0.00011536882,0.00008231685,0.0006231298,0.000105780695,0.00038570038,0.00021845885,0.0000627458,0.00033684843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004053835,0.00007646136,0.00003193553,0.000029208652,0.000025123418,0.0000012918928,0.0010641094,0.000006105932,0.081816845,0.915665,0.00009537356,0.0011845161],"study_design_scores_gemma":[0.001721272,0.0011596875,0.0054940963,0.00049034663,0.00014906494,0.000048034195,0.00029353768,0.10240929,0.33661306,0.5268074,0.023515385,0.0012987594],"about_ca_topic_score_codex":0.0000012923268,"about_ca_topic_score_gemma":0.0000029720763,"teacher_disagreement_score":0.8469411,"about_ca_system_score_codex":0.000041247167,"about_ca_system_score_gemma":0.000052242147,"threshold_uncertainty_score":0.47046039},"labels":[],"label_agreement":null},{"id":"W4400596723","doi":"10.55016/ojs/cdm.v13i2.62459","title":"Regularity in Weighted Graphs a Symmetric Function Approach","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Enumeration; Combinatorics; Scalar (mathematics); Generating function; Class (philosophy); Product (mathematics); Symmetric function; Stanley symmetric function; Finite set; Function (biology); Discrete mathematics; Ring of symmetric functions; Computer science; Mathematical analysis; Geometry","score_opus":0.024336946782796395,"score_gpt":0.318283688302708,"score_spread":0.29394674151991157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070855655,0.00007663208,0.9057482,0.0003818884,0.0007350566,0.0022411412,0.00014402007,0.00052857155,0.01928886],"genre_scores_gemma":[0.74998057,0.000006653237,0.24840604,0.00009431155,0.00027631983,0.0003846631,0.000039629726,0.00009854115,0.0007132642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965685,0.00016185999,0.001169531,0.00059024786,0.00067149993,0.00083834416],"domain_scores_gemma":[0.9964102,0.0007456998,0.0003815265,0.0013305363,0.0008181258,0.00031392157],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013332498,0.00047415163,0.00087262696,0.00084665447,0.00034925234,0.00011580487,0.00058760593,0.00030034126,0.000080843456],"category_scores_gemma":[0.005483613,0.00043647797,0.00021444629,0.0034737515,0.00022629254,0.0002860403,0.0002899226,0.000418337,0.00023766587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040825496,0.0007163662,0.00004742515,0.00019097191,0.00006293554,0.000003656211,0.0008305316,0.0000027985814,0.00031857428,0.99572337,0.001759723,0.0003028081],"study_design_scores_gemma":[0.0012466273,0.00027251977,0.00013960856,0.0001953778,0.00014960775,0.000022570826,0.00042083877,0.008945853,0.0010766352,0.9856118,0.0014050002,0.0005135901],"about_ca_topic_score_codex":0.000008944625,"about_ca_topic_score_gemma":0.000022439683,"teacher_disagreement_score":0.6791249,"about_ca_system_score_codex":0.00047445402,"about_ca_system_score_gemma":0.00010571012,"threshold_uncertainty_score":0.9998087},"labels":[],"label_agreement":null},{"id":"W4400596724","doi":"10.55016/ojs/cdm.v15i1.62323","title":"Construction of strongly regular graphs having an automorphism group of composite order","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hrvatska Zaklada za Znanost","keywords":"Mathematics; Automorphism; Automorphism group; Combinatorics; Isomorphism (crystallography); Outer automorphism group; Order (exchange); Graph automorphism; Discrete mathematics; Group (periodic table); Inner automorphism; Generalization; Orbit (dynamics); Graph; Crystallography; Physics; Chemistry","score_opus":0.040214625618972245,"score_gpt":0.3332336608738456,"score_spread":0.29301903525487333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5993658,0.00005198059,0.3966708,0.0007870795,0.00006833007,0.0010802376,0.0010829252,0.00017550927,0.0007173896],"genre_scores_gemma":[0.78633815,0.0000048890065,0.21335737,0.000031893225,0.000046234003,0.000041643594,0.00009651742,0.000053039083,0.000030277723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99722993,0.00024859892,0.0010783516,0.0003521767,0.0006464915,0.0004444629],"domain_scores_gemma":[0.9966944,0.0006748683,0.00049597415,0.0007997005,0.0009796843,0.00035541027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009247033,0.00028497152,0.00081202306,0.00024054544,0.00016986966,0.00004638462,0.00055509474,0.00016010714,0.00017109998],"category_scores_gemma":[0.0025179512,0.00027326588,0.00019624876,0.001061394,0.00044979062,0.00023719441,0.00024698448,0.00028894722,0.000022530565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008318008,0.00029164559,0.00025126582,0.00056803453,0.00014246843,0.0000047127214,0.0022964887,0.00007632013,0.06149254,0.93432504,0.00022889105,0.00023941648],"study_design_scores_gemma":[0.0027410323,0.0014383072,0.00048966066,0.00071125384,0.00055529625,0.000055017368,0.004588452,0.041626304,0.052702278,0.8939009,0.0003761659,0.00081533554],"about_ca_topic_score_codex":0.000011179851,"about_ca_topic_score_gemma":0.0000068000368,"teacher_disagreement_score":0.18697236,"about_ca_system_score_codex":0.000081101825,"about_ca_system_score_gemma":0.000093810144,"threshold_uncertainty_score":0.9999719},"labels":[],"label_agreement":null},{"id":"W4400596725","doi":"10.55016/ojs/cdm.v15i1.62160","title":"The polar of convex lattice sets","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities","keywords":"Convex hull; Combinatorics; Mathematics; Lattice (music); Polar; Convex set; Regular polygon; Convex polytope; Convex body; Convex analysis; Geometry; Physics; Convex optimization","score_opus":0.017744305992649007,"score_gpt":0.28703961189519955,"score_spread":0.2692953059025506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026596999,0.00027295068,0.97555655,0.019913644,0.00007605505,0.00028175043,0.00008431268,0.000102211205,0.0010528386],"genre_scores_gemma":[0.9324452,0.000017171738,0.06629628,0.0010814155,0.0000438402,0.000022183462,0.000005106136,0.000008495535,0.000080266895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902505,0.000042468237,0.000303571,0.0001723053,0.00020625113,0.00025034446],"domain_scores_gemma":[0.9985907,0.00043004114,0.00012250288,0.00048346727,0.00020475987,0.00016851994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021558182,0.000108126515,0.00019912541,0.000020048526,0.00024913822,0.0000800707,0.0008405167,0.000036115216,0.000008818225],"category_scores_gemma":[0.0011396424,0.000071721006,0.00009570978,0.00043073684,0.000075813514,0.00015098903,0.0002958396,0.00010649763,0.00013554824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024256974,0.000018030176,0.000015126448,0.000018703733,0.000021929185,0.0000022884756,0.0010645648,0.00005600531,0.0005788786,0.9964577,0.00081633066,0.0009480002],"study_design_scores_gemma":[0.0011325768,0.0005032021,0.0006526269,0.00011745914,0.000109095745,0.000028937338,0.0011028327,0.228635,0.01408352,0.6735761,0.07934105,0.00071760773],"about_ca_topic_score_codex":0.0000011101839,"about_ca_topic_score_gemma":0.0000011345809,"teacher_disagreement_score":0.92978555,"about_ca_system_score_codex":0.000022394128,"about_ca_system_score_gemma":0.000051941595,"threshold_uncertainty_score":0.29246977},"labels":[],"label_agreement":null},{"id":"W4400596729","doi":"10.55016/ojs/cdm.v15i1.68264","title":"Some combinatorial properties of hexagonal lattices","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Enumeration; Bijection; Combinatorics; Hexagonal crystal system; Mathematics; Lattice (music); Hexagonal lattice; Order (exchange); Discrete mathematics; Crystallography; Condensed matter physics; Physics; Chemistry","score_opus":0.05046230563172189,"score_gpt":0.3203116130201553,"score_spread":0.26984930738843343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69123447,0.0012572086,0.27500883,0.016617067,0.0030342855,0.0064695706,0.0013815401,0.0016073872,0.003389626],"genre_scores_gemma":[0.9579274,0.000012773724,0.0408267,0.00020503964,0.0007068196,0.00013391553,0.000010758753,0.00008722474,0.00008935643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970642,0.00009598076,0.0011941335,0.00037675165,0.00073379127,0.0005351675],"domain_scores_gemma":[0.9970364,0.0006480445,0.00053283817,0.00067375327,0.00067519373,0.00043379242],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004561727,0.00040388672,0.0009980777,0.00010954822,0.0001968519,0.000070746275,0.00070848,0.00017003927,0.00005444985],"category_scores_gemma":[0.00936678,0.0003467073,0.00024890475,0.00056963344,0.00019158721,0.00033575518,0.0003885735,0.00029352034,0.00013546497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055059325,0.00033891058,0.000007793129,0.000830722,0.00011262789,0.0000038263865,0.0028713874,0.000027054362,0.013654655,0.9807367,0.0013227345,0.000038544626],"study_design_scores_gemma":[0.0013072175,0.000294588,0.000003556098,0.0003759243,0.00020377214,0.000006453996,0.0007214996,0.0020756377,0.06374584,0.92947924,0.0013352804,0.00045098603],"about_ca_topic_score_codex":0.0000023484993,"about_ca_topic_score_gemma":7.513529e-7,"teacher_disagreement_score":0.26669294,"about_ca_system_score_codex":0.0001267257,"about_ca_system_score_gemma":0.0001648898,"threshold_uncertainty_score":0.9998985},"labels":[],"label_agreement":null},{"id":"W4400596730","doi":"10.55016/ojs/cdm.v14i1.62700","title":"Proof of a conjecture of Z.W. Sun","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; National Science Foundation","keywords":"Conjecture; Combinatorics; Mathematics; Limit (mathematics); Sequence (biology); Discrete mathematics; Mathematical analysis; Chemistry","score_opus":0.015218124404647223,"score_gpt":0.324143688988716,"score_spread":0.3089255645840688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51050574,0.00014388826,0.47474656,0.0004964177,0.0005257151,0.0038683543,0.0007937207,0.00017042893,0.008749196],"genre_scores_gemma":[0.8943919,0.0000025802246,0.10468541,0.00001646992,0.000044928925,0.00006832226,0.00001250946,0.000058958572,0.0007189033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975079,0.00006315421,0.0011904303,0.00027538577,0.00055764476,0.0004054671],"domain_scores_gemma":[0.9958313,0.0012876126,0.0007705693,0.0012088794,0.0007486634,0.00015295368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005924279,0.0003102969,0.0010853186,0.00019646346,0.000052689793,0.000015989574,0.00053389155,0.00017835043,0.00021818063],"category_scores_gemma":[0.0039150654,0.00026536206,0.00025772132,0.0006322507,0.00011711434,0.000117613556,0.0002334822,0.00020401929,0.000057679852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002259619,0.000386732,0.00006596997,0.0012573518,0.000106330706,0.0000012939208,0.0013079331,0.00009292204,0.0073580923,0.9888298,0.00047755972,0.00009345421],"study_design_scores_gemma":[0.0010656855,0.00033307087,0.000014927726,0.00061091,0.0001485687,0.000012742699,0.00045474645,0.0010176162,0.09175674,0.90358716,0.00069827784,0.00029956602],"about_ca_topic_score_codex":0.000002854738,"about_ca_topic_score_gemma":0.000002878387,"teacher_disagreement_score":0.3838862,"about_ca_system_score_codex":0.000113825234,"about_ca_system_score_gemma":0.00013480312,"threshold_uncertainty_score":0.99997985},"labels":[],"label_agreement":null},{"id":"W4400596733","doi":"10.55016/ojs/cdm.v15i1.68111","title":"Closed formulas and identities on the Bell polynomials and falling factorials","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation of Korea; National Research Foundation","keywords":"Mathematics; Expression (computer science); Falling (accident); Bessel function; Combinatorics; Bell polynomials; Pure mathematics; Mathematical analysis","score_opus":0.06137965349062514,"score_gpt":0.3260544114094571,"score_spread":0.264674757918832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8380777,0.00027719024,0.12212779,0.028817797,0.00034643855,0.0030185084,0.0012600218,0.0003250679,0.005749488],"genre_scores_gemma":[0.98987687,0.0000667649,0.007453924,0.001233507,0.0005105581,0.000146504,0.000011997518,0.00005542041,0.0006444795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980984,0.000112398186,0.0007470261,0.00032295097,0.00031772483,0.00040149898],"domain_scores_gemma":[0.9947993,0.0040488495,0.0002169993,0.0004354983,0.00014807194,0.00035126146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080436066,0.00032689422,0.0006458604,0.00007670637,0.0005610018,0.00033152095,0.00024027345,0.00013364287,0.0002734192],"category_scores_gemma":[0.008032602,0.00021453829,0.00012693644,0.00021998509,0.00013983296,0.00012668014,0.00022115425,0.00022054535,0.000119918026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030732343,0.00006535581,0.000016888556,0.00027093664,0.00011410355,0.000002183595,0.0039739483,0.0000038356607,0.0027560438,0.9779885,0.014555432,0.00022203458],"study_design_scores_gemma":[0.0009613872,0.00035491062,0.000059556784,0.00031476535,0.00035977474,0.000014787229,0.0019897306,0.0024815202,0.008611797,0.9749096,0.009334702,0.00060744036],"about_ca_topic_score_codex":0.0000054826305,"about_ca_topic_score_gemma":0.0000047234485,"teacher_disagreement_score":0.15179914,"about_ca_system_score_codex":0.000047214795,"about_ca_system_score_gemma":0.000040044142,"threshold_uncertainty_score":0.9616356},"labels":[],"label_agreement":null},{"id":"W4400596734","doi":"10.55016/ojs/cdm.v13i2.62728","title":"Some remarks on the lonely runner conjecture","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Conjecture; Combinatorics; Mathematics; Constant (computer programming); Lonely runner conjecture; Upper and lower bounds; Unit (ring theory); Binary logarithm; Collatz conjecture; Mathematical analysis; Computer science","score_opus":0.013893580866742798,"score_gpt":0.2813669509504867,"score_spread":0.2674733700837439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00853345,0.000059061873,0.9627217,0.02543776,0.00045645263,0.00043139438,0.00005707555,0.00012512805,0.0021779628],"genre_scores_gemma":[0.9617672,0.0000046165496,0.032302972,0.0037044922,0.00091562193,0.00007007589,0.000025214387,0.000011780039,0.0011980333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882025,0.00006764238,0.00025776826,0.0002659004,0.00031863086,0.00026981052],"domain_scores_gemma":[0.9983632,0.00041771686,0.00008925954,0.0006766288,0.0003377733,0.00011541585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005051569,0.00015182463,0.00015240378,0.000107731816,0.0005368611,0.0002509736,0.000627981,0.00006327779,0.000059390408],"category_scores_gemma":[0.0007301504,0.00009867658,0.00007893159,0.00059348653,0.00007904555,0.00019630723,0.00018975022,0.00013403122,0.0007579222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030591125,0.000041049192,0.0000012389476,0.000004072833,0.000017816708,0.0000014806224,0.0004048736,0.00037721213,0.0006658069,0.98078877,0.01690997,0.00078464486],"study_design_scores_gemma":[0.000586181,0.00055297633,0.0005931438,0.00013145323,0.00003933839,0.00004621569,0.0000978162,0.23042421,0.020549828,0.6762604,0.0701659,0.00055248645],"about_ca_topic_score_codex":0.0000016585994,"about_ca_topic_score_gemma":0.0000037714399,"teacher_disagreement_score":0.9532337,"about_ca_system_score_codex":0.00007219953,"about_ca_system_score_gemma":0.00008587887,"threshold_uncertainty_score":0.9741809},"labels":[],"label_agreement":null},{"id":"W4400596743","doi":"10.55016/ojs/cdm.v15i1.67935","title":"3-uniform hypergraphs: modular decomposition and realization by tournaments","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypergraph; Realization (probability); Mathematics; Combinatorics; Modular design; Tournament; Decomposition; Discrete mathematics; Element (criminal law); Computer science","score_opus":0.00590559664333025,"score_gpt":0.23519904584602175,"score_spread":0.22929344920269149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20328484,0.00036870386,0.79311675,0.0005776925,0.00008875478,0.0004307265,0.00049114163,0.0002937052,0.0013476703],"genre_scores_gemma":[0.99837583,0.000053213065,0.0011946938,0.00011797456,0.0000394695,0.000039340994,0.00013719598,0.000021972895,0.00002033492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993093,0.000020733818,0.0002583896,0.00011863612,0.0001141131,0.00017881795],"domain_scores_gemma":[0.9995429,0.00002709797,0.000034699176,0.00013888499,0.0000572331,0.00019920734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001080969,0.00013372592,0.00018333647,0.00004847004,0.00012421,0.00007046277,0.00009172778,0.000062011335,0.000017113081],"category_scores_gemma":[0.00006148335,0.00013029986,0.00004377568,0.00023564948,0.000020609039,0.0001261549,0.000024850171,0.00007164602,0.000033794688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052761694,0.00018950042,0.00044965095,0.0013248654,0.00061001297,0.000015837131,0.0108083105,0.027450286,0.32818154,0.58547866,0.04294573,0.0024928476],"study_design_scores_gemma":[0.0019898857,0.00033578204,0.00028494536,0.00049370906,0.00029616946,0.00005641244,0.001953482,0.8662402,0.0335852,0.06452706,0.028999545,0.0012376277],"about_ca_topic_score_codex":0.0000015514274,"about_ca_topic_score_gemma":9.571776e-7,"teacher_disagreement_score":0.8387899,"about_ca_system_score_codex":0.00003982758,"about_ca_system_score_gemma":0.000003980796,"threshold_uncertainty_score":0.5313474},"labels":[],"label_agreement":null},{"id":"W4400596744","doi":"10.55016/ojs/cdm.v15i1.62718","title":"An elementary, geometric proof of the non-existence of a projective plane of order 6","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Narodowym Centrum Nauki","keywords":"Projective plane; Mathematics; Elementary proof; Projective test; Order (exchange); Combinatorics; Plane (geometry); Collineation; Blocking set; Binary number; Line at infinity; Pure mathematics; Discrete mathematics; Projective space; Geometry; Arithmetic","score_opus":0.014683256317517292,"score_gpt":0.2749188379889225,"score_spread":0.26023558167140526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103223324,0.000022516257,0.8941367,0.0010363907,0.000040004415,0.0007532507,0.00027968816,0.000022654349,0.00048542192],"genre_scores_gemma":[0.96189517,0.0000019125562,0.037963238,0.000086527965,0.000012192283,0.000026044727,0.00000468946,0.000004826416,0.0000053957056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99886537,0.00006498095,0.00042150173,0.00018648218,0.0002963574,0.00016533179],"domain_scores_gemma":[0.99840224,0.00015557928,0.00031175173,0.0006205591,0.00043115966,0.00007868712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037065244,0.00010933619,0.0002866778,0.00014019698,0.00007372008,0.000016782624,0.0010545835,0.000033531138,0.00001114212],"category_scores_gemma":[0.0004676119,0.00007725944,0.000109080225,0.0026840765,0.0001215226,0.00013333265,0.00028209592,0.000083394014,0.0000014105556],"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.00009791536,0.0011696176,0.0018188175,0.0007724591,0.00025679273,0.0000019030064,0.019128934,0.000716185,0.028482262,0.9424297,0.00051431614,0.0046110954],"study_design_scores_gemma":[0.0022686834,0.0040717465,0.0041349474,0.0006672821,0.00029125772,0.000010217678,0.002890622,0.0961175,0.72564256,0.16272728,0.0005055587,0.0006723624],"about_ca_topic_score_codex":0.000011685114,"about_ca_topic_score_gemma":0.000003972758,"teacher_disagreement_score":0.85867184,"about_ca_system_score_codex":0.000016964193,"about_ca_system_score_gemma":0.0000975958,"threshold_uncertainty_score":0.3150549},"labels":[],"label_agreement":null},{"id":"W4400596745","doi":"10.55016/ojs/cdm.v14i1.62673","title":"On 2-adic behavior of the number of domino tilings on torus","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Chongqing Municipal Education Commission; National Natural Science Foundation of China","keywords":"Mathematics; Domino; Combinatorics; Torus; Invariant (physics); Analogy; Discrete mathematics; Geometry; Mathematical physics; Chemistry","score_opus":0.015374319386233775,"score_gpt":0.33304110345313276,"score_spread":0.31766678406689897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596745","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96542156,0.0000056644158,0.008520515,0.00036487894,0.00021122272,0.0016851135,0.0007229179,0.000040883842,0.023027232],"genre_scores_gemma":[0.99163616,0.0000022222396,0.0060318355,0.00008877113,0.000024957824,0.0000887573,0.000008702475,0.00004207605,0.0020765115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783194,0.000063167616,0.00091187796,0.00024713512,0.000609179,0.0003367241],"domain_scores_gemma":[0.99608314,0.0016465047,0.0005139637,0.0012419312,0.0003885861,0.00012589553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005790377,0.0002685429,0.00071490195,0.00008282617,0.00008683458,0.000024361103,0.0005359701,0.00015555596,0.00074489694],"category_scores_gemma":[0.0029734538,0.00017424021,0.00033917415,0.0004004112,0.000120225304,0.000045316512,0.00016899798,0.00023529492,0.00036479378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027322762,0.0007360181,0.00025643883,0.00037369627,0.000052615993,8.896238e-7,0.00042146628,0.000015906387,0.0022624414,0.9950468,0.0007158008,0.00009059542],"study_design_scores_gemma":[0.0014941288,0.00036295864,0.0009256655,0.0016039581,0.0004154343,0.0000183289,0.00032573668,0.0053174305,0.019260408,0.96927637,0.00049734727,0.00050220866],"about_ca_topic_score_codex":0.000005019347,"about_ca_topic_score_gemma":0.000001875815,"teacher_disagreement_score":0.026214594,"about_ca_system_score_codex":0.00009863854,"about_ca_system_score_gemma":0.00006481279,"threshold_uncertainty_score":0.81560993},"labels":[],"label_agreement":null},{"id":"W4400596747","doi":"10.55016/ojs/cdm.v14i1.62646","title":"Anchored Hyperspaces and Multigraphs","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Hyperspace; Multigraph; Mathematics; Combinatorics; Hausdorff distance; Metric (unit); Polytope; Space (punctuation); Metric space; Compact space; Set (abstract data type); Discrete mathematics; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.013491551134297869,"score_gpt":0.3278347807790937,"score_spread":0.3143432296447959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596747","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85430384,0.00038228423,0.13234754,0.002212441,0.0002429907,0.0013339416,0.0002916287,0.00029016123,0.008595178],"genre_scores_gemma":[0.9352359,0.000027352304,0.06197481,0.0001700881,0.000048849008,0.000058518053,0.000013289338,0.00003023242,0.0024409397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988804,0.00005662795,0.00029184672,0.00027185658,0.00014250433,0.0003567693],"domain_scores_gemma":[0.9982872,0.00080609735,0.00010628132,0.00049405976,0.000138717,0.00016762808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036785478,0.00020442976,0.00039470778,0.00011631648,0.00017675637,0.000033809698,0.0001743366,0.00012924548,0.00017126746],"category_scores_gemma":[0.0013501097,0.00017197193,0.000083674415,0.00020442091,0.00014044948,0.00012132481,0.00011246692,0.0001690922,0.00023860384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001978411,0.00007410491,0.00032827733,0.00008540593,0.000058578375,0.000003105963,0.00152595,0.000007915588,0.0022883944,0.9943524,0.0010107782,0.00024529436],"study_design_scores_gemma":[0.0009029938,0.00011131692,0.000279248,0.0001089115,0.00008811013,0.000033071967,0.0023440404,0.0010412112,0.001918451,0.9882852,0.004529642,0.00035784562],"about_ca_topic_score_codex":0.0000017688047,"about_ca_topic_score_gemma":0.0000078969515,"teacher_disagreement_score":0.08093209,"about_ca_system_score_codex":0.000040635266,"about_ca_system_score_gemma":0.00002332427,"threshold_uncertainty_score":0.7012812},"labels":[],"label_agreement":null},{"id":"W4400596748","doi":"10.55016/ojs/cdm.v13i2.62732","title":"Arrangements of Homothets of a Convex Body II","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Nemzeti Kutatási, Fejlesztési és Innovaciós Alap; Emberi Eroforrások Minisztériuma; Magyar Tudományos Akadémia","keywords":"Convex body; Combinatorics; Mathematics; Minkowski space; Regular polygon; Minkowski addition; Euclidean space; Boundary (topology); Center (category theory); Mixed volume; Sequence (biology); Convex set; Convex hull; Geometry; Mathematical analysis; Crystallography; Convex optimization; Chemistry","score_opus":0.03397938438709129,"score_gpt":0.3605655692135098,"score_spread":0.3265861848264185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5120665,0.00015806644,0.46627605,0.0009064419,0.00024249857,0.0010962951,0.0018654261,0.00011462832,0.017274106],"genre_scores_gemma":[0.9771062,0.000009471706,0.02136061,0.000046451005,0.00009726896,0.00004191181,0.000015124729,0.000024706653,0.0012982333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981266,0.000037792033,0.00089111616,0.00018395018,0.00041128098,0.00034920502],"domain_scores_gemma":[0.99718416,0.00044692648,0.00046532578,0.00059935334,0.001190951,0.00011326986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007181798,0.0001973861,0.0006387609,0.00029901692,0.00017110068,0.000017182338,0.0003556338,0.00009132779,0.0003848809],"category_scores_gemma":[0.0038583598,0.00016599313,0.00015689354,0.0008164791,0.00023342243,0.00010088587,0.00022811152,0.00007949429,0.000043799864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003164574,0.0005763029,0.000064150976,0.0009365902,0.00021165278,0.0000010539261,0.0051449,8.9322043e-7,0.004321522,0.9839537,0.004448815,0.00030874702],"study_design_scores_gemma":[0.0014549899,0.0011953433,0.00012880877,0.00078531523,0.00033884696,0.000011956068,0.0022356045,0.0009566469,0.14017299,0.8456162,0.0066419197,0.00046137016],"about_ca_topic_score_codex":0.000012685853,"about_ca_topic_score_gemma":0.0000071334043,"teacher_disagreement_score":0.46503973,"about_ca_system_score_codex":0.000047162994,"about_ca_system_score_gemma":0.00008025703,"threshold_uncertainty_score":0.6769003},"labels":[],"label_agreement":null},{"id":"W4400596750","doi":"10.55016/ojs/cdm.v14i1.62399","title":"Hamiltonian paths in $m \\times n$ projective checkerboards","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Rectangle; Mathematics; Combinatorics; Projective plane; Square (algebra); Twist; Hamiltonian (control theory); Projective test; Checkerboard; Geometry; Pure mathematics","score_opus":0.004960986473503946,"score_gpt":0.23566436345648492,"score_spread":0.23070337698298096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596750","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8828156,0.00034041522,0.033174235,0.0002414055,0.00071309175,0.002557543,0.0005237013,0.0006395097,0.078994475],"genre_scores_gemma":[0.9979369,0.0000054562524,0.0010990725,0.000024666155,0.0000379121,0.00016951014,0.000019150868,0.000032505213,0.00067483773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989213,0.000038495335,0.00034950022,0.00017481504,0.00015065003,0.00036527697],"domain_scores_gemma":[0.9993036,0.00008495896,0.000034703855,0.0004026236,0.00007611458,0.00009800044],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035949697,0.00019311844,0.00033373132,0.00017808424,0.00004874298,0.00004955313,0.00019357202,0.000103772545,0.0001469092],"category_scores_gemma":[0.00012344525,0.00017771481,0.00009187149,0.00046977526,0.000025739455,0.000114415925,0.00004155594,0.00017101582,0.00078024383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024179655,0.00017820715,0.0030614182,0.0006830915,0.00019489262,0.000018343702,0.010384099,0.0075552235,0.009617779,0.96553093,0.002110914,0.00064090785],"study_design_scores_gemma":[0.00845229,0.0008438202,0.030632364,0.004336481,0.0003158021,0.00015017093,0.021083185,0.3983715,0.046307284,0.4203545,0.06368854,0.0054640803],"about_ca_topic_score_codex":0.000007621925,"about_ca_topic_score_gemma":0.000021547869,"teacher_disagreement_score":0.54517645,"about_ca_system_score_codex":0.00016649532,"about_ca_system_score_gemma":0.00002786715,"threshold_uncertainty_score":0.99999774},"labels":[],"label_agreement":null},{"id":"W4400596751","doi":"10.55016/ojs/cdm.v15i1.62708","title":"Latin Squares and their Bruhat Order","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Latin square; Mathematics; Combinatorics; Class (philosophy); Order (exchange); Relation (database); Cover (algebra); Computer science; Biology; Artificial intelligence","score_opus":0.010507876194894855,"score_gpt":0.2220730865490173,"score_spread":0.21156521035412246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38912404,0.0010346263,0.5986108,0.002592335,0.0001891211,0.00079121604,0.0007438149,0.0008255029,0.0060885334],"genre_scores_gemma":[0.99853176,0.000012046427,0.0010811437,0.00013381145,0.00007332941,0.0000389612,0.000016482956,0.000023834064,0.000088631336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937093,0.000020625474,0.00022044999,0.000117139665,0.00006751231,0.00020331072],"domain_scores_gemma":[0.9994489,0.00010391688,0.000021986265,0.00017575703,0.00006506499,0.00018436072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001033615,0.0001521902,0.00022599638,0.00004800277,0.00009742911,0.000066312474,0.0001117642,0.000056996367,0.000054144548],"category_scores_gemma":[0.00022174719,0.000121600104,0.00004603628,0.0003477457,0.000032391268,0.00006345233,0.00004255418,0.000095150936,0.00011030272],"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.000023745268,0.00006490391,0.0004022395,0.0011366729,0.00036768932,0.000010320686,0.036119778,0.008161978,0.03883358,0.8978299,0.014161848,0.0028873815],"study_design_scores_gemma":[0.0025897126,0.0004159515,0.0013507501,0.0007401606,0.00022811547,0.000046417885,0.01850666,0.69225574,0.03782072,0.11793215,0.12579222,0.0023213935],"about_ca_topic_score_codex":0.0000010953071,"about_ca_topic_score_gemma":0.0000024010092,"teacher_disagreement_score":0.7798977,"about_ca_system_score_codex":0.000016356382,"about_ca_system_score_gemma":0.0000073936603,"threshold_uncertainty_score":0.49587083},"labels":[],"label_agreement":null},{"id":"W4400596753","doi":"10.55016/ojs/cdm.v15i1.62385","title":"On the first two entries of the f-vectors of 6-polytopes","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Characterization (materials science); Physics","score_opus":0.008947915511209567,"score_gpt":0.2183748864401502,"score_spread":0.20942697092894064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596753","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94376606,0.00033120147,0.039789975,0.0072743217,0.00038429623,0.0012605828,0.00081436895,0.00016809787,0.0062111127],"genre_scores_gemma":[0.99974763,0.0000034795166,0.00004966997,0.00009881772,0.000031436866,0.000028478187,0.0000019707086,0.000012623119,0.000025903877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992879,0.00003464348,0.00031181204,0.00006925264,0.00015663449,0.00013976403],"domain_scores_gemma":[0.99908346,0.00038454356,0.000074448806,0.00034254848,0.0000665105,0.00004847583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017959549,0.00011291573,0.00022108619,0.000023670074,0.00011037725,0.000015492364,0.00033666583,0.000031456504,0.00005336437],"category_scores_gemma":[0.0005794266,0.000061859115,0.00013453022,0.00034442652,0.0000952452,0.000025731113,0.00005467139,0.00009639931,0.000026690093],"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.000008128025,0.00002317976,0.00014158676,0.00017904327,0.00009668194,2.9207723e-7,0.0038936206,0.0071105813,0.002914198,0.9825577,0.0030529979,0.00002194967],"study_design_scores_gemma":[0.0018464968,0.0004249541,0.0016179736,0.0019869963,0.0005013406,0.000011461327,0.0068873954,0.070778556,0.7209901,0.1621526,0.031818748,0.0009833449],"about_ca_topic_score_codex":0.0000026352936,"about_ca_topic_score_gemma":0.000006810999,"teacher_disagreement_score":0.8204051,"about_ca_system_score_codex":0.000017733126,"about_ca_system_score_gemma":0.0000109461225,"threshold_uncertainty_score":0.25225416},"labels":[],"label_agreement":null},{"id":"W4400596754","doi":"10.55016/ojs/cdm.v15i1.62603","title":"Factorizations of complete graphs into cycles and 1-factors","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph; Focus (optics); Complete graph; Discrete mathematics","score_opus":0.015975935800053572,"score_gpt":0.24105505167068036,"score_spread":0.2250791158706268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6964635,0.00022431317,0.30062163,0.00029343006,0.00010798454,0.0003875714,0.0009520228,0.0002475093,0.00070198555],"genre_scores_gemma":[0.9985918,0.00001267463,0.0012721479,0.000018498336,0.00001919105,0.0000159242,0.000046010722,0.000018555193,0.000005219009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993098,0.000021513864,0.00031043103,0.00010427144,0.00010264571,0.00015137857],"domain_scores_gemma":[0.9994109,0.00012289848,0.0000433236,0.00016690098,0.000075794494,0.00018014047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000069969334,0.000137789,0.00027319964,0.00007070072,0.000098907,0.000028199142,0.00012355551,0.000051933046,0.000022900158],"category_scores_gemma":[0.00020176206,0.00012369188,0.0000670023,0.00033248903,0.000061387,0.00007185776,0.00003818351,0.00007276301,0.000014183631],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056170707,0.00003606368,0.0022644417,0.00073356787,0.00020824646,0.0000013227011,0.016203048,0.0034100942,0.0617359,0.91458595,0.0006817733,0.00013400105],"study_design_scores_gemma":[0.0032136901,0.00073104404,0.019575141,0.0011535685,0.00089443196,0.00002295616,0.02359892,0.30905575,0.10198277,0.5115323,0.025013693,0.0032257298],"about_ca_topic_score_codex":0.000003904355,"about_ca_topic_score_gemma":0.0000036793442,"teacher_disagreement_score":0.40305364,"about_ca_system_score_codex":0.000015852,"about_ca_system_score_gemma":0.0000070795177,"threshold_uncertainty_score":0.50440085},"labels":[],"label_agreement":null},{"id":"W4400596755","doi":"10.55016/ojs/cdm.v14i1.62685","title":"On the illumination of a class of convex bodies","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"North University of China","keywords":"Combinatorics; Hyperplane; Mathematics; Regular polygon; Convex hull; Class (philosophy); Convex body; Convex set; Convex optimization; Geometry; Computer science; Artificial intelligence","score_opus":0.028499293701435523,"score_gpt":0.319293087568204,"score_spread":0.2907937938667685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8861981,0.000110851215,0.08169565,0.0031130305,0.00017637228,0.0014631635,0.0009372333,0.00006372651,0.02624186],"genre_scores_gemma":[0.9959072,0.000008874443,0.0021041934,0.000078389865,0.000019707504,0.00004461213,0.000010601669,0.000015129057,0.0018112819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858063,0.000054000127,0.00062422745,0.00013193155,0.0003937932,0.00021539508],"domain_scores_gemma":[0.9952952,0.003046307,0.0003997719,0.00053179543,0.0006828845,0.0000439962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087852415,0.00014921663,0.0004575356,0.00019314697,0.00007098564,0.000019099223,0.00027930073,0.00007276456,0.0002840682],"category_scores_gemma":[0.0069749714,0.00009580478,0.00013845314,0.00043100302,0.00010730744,0.000066934714,0.000090658774,0.00010509128,0.000077697696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013347081,0.00011852187,0.000020893001,0.00050335715,0.000057507514,1.7922969e-7,0.0021833575,0.000014637032,0.0006062248,0.99499077,0.0014197744,0.00007144418],"study_design_scores_gemma":[0.0004974912,0.00033903855,0.00007876274,0.00051315146,0.00010024879,0.0000030810188,0.00498328,0.0022929031,0.027393278,0.96203303,0.0015600543,0.00020565541],"about_ca_topic_score_codex":0.000006088047,"about_ca_topic_score_gemma":0.0000036458675,"teacher_disagreement_score":0.1097091,"about_ca_system_score_codex":0.000049138074,"about_ca_system_score_gemma":0.00005706167,"threshold_uncertainty_score":0.83501965},"labels":[],"label_agreement":null},{"id":"W4400596757","doi":"10.55016/ojs/cdm.v14i1.62631","title":"A wide class of Combinatorial matrices related with Reciprocal Pascal and Super Catalan matrices","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pascal (unit); Reciprocal; Mathematics; Catalan number; Combinatorics; Catalan; Combinatorial proof; Matrix (chemical analysis); Class (philosophy); Pascal matrix; Algebra over a field; Pure mathematics; Symmetric matrix; Computer science; Nonnegative matrix; Eigenvalues and eigenvectors","score_opus":0.010194493843890153,"score_gpt":0.28756985979341965,"score_spread":0.2773753659495295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9668928,0.0002550209,0.026512416,0.00091627176,0.0002972725,0.0016160748,0.00034316757,0.00018570259,0.0029813128],"genre_scores_gemma":[0.94709694,0.00003141046,0.051908612,0.00003466959,0.00006379591,0.00007460382,0.000043900625,0.00006732272,0.00067871436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977802,0.000072209594,0.0008016262,0.00039514623,0.0005001859,0.00045060227],"domain_scores_gemma":[0.9967931,0.0014929456,0.00037838338,0.0007432937,0.00038536606,0.00020689331],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004870306,0.00032298733,0.00075454987,0.00018939933,0.00013471743,0.00006534883,0.00034459584,0.00021768596,0.000089199406],"category_scores_gemma":[0.0014667562,0.00025828474,0.00012064863,0.0005769252,0.00018939214,0.00024008052,0.00023361768,0.000317085,0.000077165445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007832421,0.00020108835,0.0016328517,0.0005155104,0.00017732401,0.000008249421,0.0017171727,0.000010584858,0.00042288005,0.9946887,0.0004611964,0.00008609961],"study_design_scores_gemma":[0.0028211738,0.0005336622,0.00036474463,0.0006555884,0.0003898634,0.00008141601,0.0012874107,0.00087107066,0.0028144163,0.9875831,0.0020003351,0.0005972145],"about_ca_topic_score_codex":0.000008048554,"about_ca_topic_score_gemma":0.000010950639,"teacher_disagreement_score":0.025396194,"about_ca_system_score_codex":0.00013114768,"about_ca_system_score_gemma":0.000090516376,"threshold_uncertainty_score":0.99998695},"labels":[],"label_agreement":null},{"id":"W4400596768","doi":"10.55016/ojs/cdm.v15i1.67964","title":"On parity and recurrences for certain partition functions","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Parity (physics); Combinatorics; Legendre polynomials; Euler's formula; Recurrence relation; Discrete mathematics; Mathematical analysis","score_opus":0.06222150038527333,"score_gpt":0.3641647935390036,"score_spread":0.30194329315373025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018162811,0.000057883342,0.96611404,0.010032965,0.00011705456,0.0016851396,0.0012922793,0.00030320376,0.0022346254],"genre_scores_gemma":[0.8637659,0.000025842335,0.13185757,0.00084660435,0.0003386713,0.0013159344,0.00012884501,0.000085536536,0.0016350738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845374,0.000046529276,0.00052730716,0.00034446013,0.0002541635,0.0003738122],"domain_scores_gemma":[0.9967512,0.0021678717,0.00016360758,0.0003111087,0.00027264655,0.0003335649],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00033704366,0.00024538196,0.0004482312,0.00006958122,0.0003808065,0.00012233527,0.00016962655,0.00009525352,0.000096607626],"category_scores_gemma":[0.013159642,0.00021455064,0.00012603283,0.00025633373,0.00012101659,0.00017444867,0.00009776986,0.00016174966,0.000118440286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031648044,0.00012838603,0.000006228794,0.0003879945,0.000040804778,9.346826e-7,0.001013374,0.000029319857,0.00017803712,0.9802798,0.0177252,0.00017826378],"study_design_scores_gemma":[0.000493154,0.00031324197,0.000010022621,0.00017261552,0.0001434342,0.0000036440063,0.00093118835,0.007798611,0.00062079245,0.9859933,0.0032480704,0.00027189113],"about_ca_topic_score_codex":0.0000013496687,"about_ca_topic_score_gemma":0.000010086413,"teacher_disagreement_score":0.8456031,"about_ca_system_score_codex":0.00007372434,"about_ca_system_score_gemma":0.000037224567,"threshold_uncertainty_score":0.99515295},"labels":[],"label_agreement":null},{"id":"W4400596773","doi":"10.55016/ojs/cdm.v15i1.62697","title":"Corrigendum to ``\"On the enumeration of a class of toroidal graphs\" [Contrib. Discrete Math. 13 (2018), no. 1, 79-119]","year":2020,"lang":"en","type":"erratum","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Enumeration; Toroid; Class (philosophy); Mathematics; Combinatorics; Discrete mathematics; Computer science; Physics; Plasma; Quantum mechanics; Artificial intelligence","score_opus":0.03011817204652721,"score_gpt":0.2997804728554948,"score_spread":0.2696623008089676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018022558,0.0016659918,0.5609455,0.057104517,0.042359583,0.04175357,0.12546344,0.0017540986,0.15093072],"genre_scores_gemma":[0.5609217,0.00085543573,0.058025725,0.005859148,0.007552868,0.012568444,0.011314663,0.0018992701,0.3410027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947211,0.0003483991,0.0022031602,0.0008092866,0.001106908,0.0008111122],"domain_scores_gemma":[0.9926218,0.001412427,0.0016066481,0.002423372,0.001443932,0.0004918338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013015736,0.00093087676,0.0018838798,0.00040967116,0.00054125756,0.00013723635,0.001573437,0.0007274366,0.00026597027],"category_scores_gemma":[0.007378578,0.0006954638,0.0009195933,0.0013619184,0.0003529861,0.00012463574,0.000440967,0.0011485963,0.000645577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059623482,0.0002015851,0.0000017983,0.00044902306,0.00023965222,0.0000017705115,0.001009917,0.00000842561,0.0009675684,0.5643542,0.4326664,0.00004005131],"study_design_scores_gemma":[0.00081945566,0.0007057235,0.000030191584,0.0019201967,0.0011508301,0.000011099151,0.0009871047,0.0028091792,0.0027794624,0.5623814,0.42526123,0.0011441549],"about_ca_topic_score_codex":0.000031602776,"about_ca_topic_score_gemma":0.000089347304,"teacher_disagreement_score":0.5428992,"about_ca_system_score_codex":0.00021734109,"about_ca_system_score_gemma":0.00038836277,"threshold_uncertainty_score":0.9995496},"labels":[],"label_agreement":null},{"id":"W4400596774","doi":"10.55016/ojs/cdm.v14i1.62644","title":"New parity results of sums of partitions and squares in arithmetic progressions","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; National Science Foundation","keywords":"Mathematics; Combinatorics; Parity (physics); Square (algebra); Arithmetic; Discrete mathematics; Geometry; Physics; Atomic physics","score_opus":0.02405772631396179,"score_gpt":0.35658888369641417,"score_spread":0.33253115738245237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7894828,0.0004137248,0.1944436,0.002228054,0.00016595476,0.0037852726,0.0018994001,0.00017185703,0.0074093314],"genre_scores_gemma":[0.86006486,0.000020607868,0.13829605,0.0000074852264,0.000018849558,0.000069590846,0.000020616224,0.00002756223,0.001474386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978798,0.0000689954,0.0010812952,0.00026383795,0.00035820357,0.00034786752],"domain_scores_gemma":[0.99674916,0.0016791748,0.00041051293,0.00067854987,0.00029312712,0.00018944676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006005556,0.00021513939,0.0007596143,0.0002439092,0.000057662448,0.000028538014,0.000235038,0.000117367475,0.00009297422],"category_scores_gemma":[0.005715525,0.00018554553,0.00011302659,0.0005126556,0.00016278034,0.00017792109,0.00022047423,0.00017724106,0.000027286113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046579946,0.000381564,0.0007358285,0.0011942668,0.000055211796,0.0000026587395,0.002552177,0.000056362867,0.002296427,0.99053293,0.0019762348,0.00016973437],"study_design_scores_gemma":[0.0013819948,0.00016483362,0.0006235624,0.0014402873,0.00010302099,0.00000756372,0.0012532142,0.000995166,0.009460169,0.9841047,0.00023478446,0.00023069038],"about_ca_topic_score_codex":0.00003191796,"about_ca_topic_score_gemma":0.00013350684,"teacher_disagreement_score":0.070582055,"about_ca_system_score_codex":0.000064489104,"about_ca_system_score_gemma":0.00010791256,"threshold_uncertainty_score":0.75663275},"labels":[],"label_agreement":null},{"id":"W4400596775","doi":"10.55016/ojs/cdm.v15i1.62808","title":"Partitioning the $5\\times 5$ array into restrictions of circles","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Partition (number theory); Combinatorics; Mathematics; Lattice (music); Algorithm; Physics","score_opus":0.014238984320288294,"score_gpt":0.25174485062424046,"score_spread":0.23750586630395215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025036419,0.0001651162,0.9842056,0.0061340965,0.000098185476,0.00031141244,0.0001314525,0.0002840598,0.0061664437],"genre_scores_gemma":[0.9834254,0.000036658534,0.016196692,0.00013519566,0.000066470704,0.0000464739,0.000028380797,0.000019286104,0.000045468154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933434,0.000019960375,0.000298618,0.00008385854,0.000118039105,0.00014520905],"domain_scores_gemma":[0.9994047,0.00012696914,0.000047565223,0.0001998846,0.0001208334,0.000100030666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000108808825,0.000095537405,0.00015297969,0.000041365172,0.00017369688,0.00005002961,0.00015174177,0.000041222942,0.000103024635],"category_scores_gemma":[0.00039667287,0.00007729603,0.000063286214,0.00046729008,0.00004651921,0.00006795325,0.000024541234,0.00010382804,0.00008758453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051181596,0.000051936724,0.00019329217,0.0003170695,0.00017555509,9.613884e-7,0.013976923,0.7346564,0.014067334,0.21530996,0.020632768,0.00061271107],"study_design_scores_gemma":[0.0011538719,0.00021987101,0.00075703784,0.0005670803,0.00037815733,0.00001298083,0.0044415616,0.79632914,0.061427806,0.04864398,0.08504504,0.0010234871],"about_ca_topic_score_codex":0.0000040851723,"about_ca_topic_score_gemma":0.000004602676,"teacher_disagreement_score":0.98092175,"about_ca_system_score_codex":0.000029207298,"about_ca_system_score_gemma":0.0000199177,"threshold_uncertainty_score":0.31520405},"labels":[],"label_agreement":null},{"id":"W4400596777","doi":"10.55016/ojs/cdm.v14i1.62665","title":"Distinguishing number and distinguishing index of neighbourhood corona of two graphs","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Neighbourhood (mathematics); Automorphism; Mathematics; Vertex (graph theory); Graph; Star (game theory); Discrete mathematics","score_opus":0.008566774733699252,"score_gpt":0.2773433885324417,"score_spread":0.26877661379874246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67399716,0.00012444981,0.32067406,0.00033335897,0.00023656632,0.0004179641,0.00011000079,0.000103207676,0.0040032417],"genre_scores_gemma":[0.9482863,0.0000035448327,0.051573593,0.000041608015,0.000005467327,0.000008621391,0.000007617322,0.000012013943,0.00006125776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983835,0.000048844937,0.00061587465,0.00030748505,0.00033917357,0.00030512107],"domain_scores_gemma":[0.99789834,0.00042305596,0.00037537646,0.00066026207,0.00049047597,0.0001524682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006666571,0.00017598287,0.00044028813,0.00011538127,0.00012184623,0.00011928717,0.0005018998,0.00006106529,0.000026409023],"category_scores_gemma":[0.0013010753,0.00015522396,0.000100428464,0.00056175434,0.000095809,0.00021675415,0.00043732693,0.00014322023,0.000019626506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030638878,0.000074493066,0.023247616,0.00013780857,0.00003464366,0.000001406514,0.0012527304,0.00017671233,0.00230746,0.97212577,0.000073413656,0.0005648817],"study_design_scores_gemma":[0.0016669835,0.00014804552,0.009062065,0.0010189932,0.000075964206,0.000037579677,0.00030491487,0.10482289,0.0041660047,0.87808514,0.00011113771,0.00050026603],"about_ca_topic_score_codex":0.00009831042,"about_ca_topic_score_gemma":0.000008158369,"teacher_disagreement_score":0.27428913,"about_ca_system_score_codex":0.000022955512,"about_ca_system_score_gemma":0.000053193653,"threshold_uncertainty_score":0.63298494},"labels":[],"label_agreement":null},{"id":"W4400596785","doi":"10.55016/ojs/cdm.v16i1.67968","title":"The estimation of the zeros of some counting polynomials","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Eulerian path; Combinatorics; Difference polynomials; Orthogonal polynomials; Discrete mathematics; Pure mathematics","score_opus":0.022090159754319542,"score_gpt":0.33872961538362895,"score_spread":0.3166394556293094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30687886,0.0011770721,0.6765799,0.0065000313,0.0007555588,0.0025913005,0.0010859228,0.000184856,0.0042464873],"genre_scores_gemma":[0.9359024,0.000047163572,0.06035569,0.000059397753,0.000088642526,0.0001145601,0.000010396005,0.000053107236,0.00336863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761975,0.00012005731,0.0011659334,0.00018131359,0.00056632626,0.00034661518],"domain_scores_gemma":[0.9940801,0.0032625105,0.00071019534,0.0010921687,0.000780518,0.00007449219],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.00095355144,0.0002013264,0.0005450705,0.000048254908,0.00042215388,0.00007714253,0.0005210564,0.000089230045,0.000036561283],"category_scores_gemma":[0.020531101,0.00012434604,0.00026948054,0.00046763502,0.00033845112,0.00018438722,0.00039581957,0.00016616241,0.000019328827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044487365,0.00011016505,0.000009435035,0.0004363413,0.00007238375,6.9469934e-7,0.000700048,0.0002460885,0.008831236,0.98854446,0.0009196516,0.00012506753],"study_design_scores_gemma":[0.00023977234,0.000016538304,0.000041588228,0.0004931109,0.00015712183,0.000011062917,0.0009899865,0.0029396038,0.14307874,0.85166836,0.00023570762,0.00012838379],"about_ca_topic_score_codex":0.0000034699901,"about_ca_topic_score_gemma":0.000011786239,"teacher_disagreement_score":0.62902355,"about_ca_system_score_codex":0.000110801586,"about_ca_system_score_gemma":0.00018741826,"threshold_uncertainty_score":0.98771936},"labels":[],"label_agreement":null},{"id":"W4400596788","doi":"10.55016/ojs/cdm.v15i3.69350","title":"Bounds of characteristic polynomials of regular matroids","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Mathematics; Unimodular matrix; Matroid; Combinatorics; Equivalence (formal languages); Discrete mathematics","score_opus":0.008651262275556838,"score_gpt":0.23158512091227587,"score_spread":0.22293385863671902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7445902,0.00037710075,0.24965626,0.0004350002,0.00021246531,0.0005897187,0.0018312848,0.00020770248,0.0021002474],"genre_scores_gemma":[0.99858105,0.0000071018335,0.0012139429,0.000020581758,0.00006372443,0.000024032382,0.000027987182,0.000022995611,0.000038581176],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99897695,0.000029049848,0.0005724469,0.00009741724,0.00013701129,0.00018711605],"domain_scores_gemma":[0.9992721,0.00008178512,0.00010686974,0.00029341615,0.00010996769,0.00013583452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020505955,0.00013701263,0.00045866068,0.00006501927,0.000037087488,0.000016268907,0.00020356728,0.0000673879,0.00006248425],"category_scores_gemma":[0.00028510884,0.00013090576,0.0001294399,0.0002895768,0.000060060866,0.000054741446,0.000037783015,0.00007026839,0.000047267273],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040365892,0.0000786815,0.00012669606,0.0022569178,0.0003269169,0.000004500019,0.004760995,0.0014304781,0.61648774,0.37127915,0.0029418685,0.00026567705],"study_design_scores_gemma":[0.0030696278,0.0009697125,0.002749949,0.001885009,0.0009445508,0.00005234014,0.0040135575,0.087727055,0.81746686,0.057303976,0.021934163,0.0018832047],"about_ca_topic_score_codex":0.0000014063761,"about_ca_topic_score_gemma":3.6032506e-7,"teacher_disagreement_score":0.3139752,"about_ca_system_score_codex":0.00002558718,"about_ca_system_score_gemma":0.000014924271,"threshold_uncertainty_score":0.5338182},"labels":[],"label_agreement":null},{"id":"W4400596792","doi":"10.55016/ojs/cdm.v16i1.68085","title":"A neighborhood condition for graphs to have restricted fractional (g,f)-factors","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Nuclear Receptors and Signaling","field":"Neuroscience","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Government of Jiangsu Province","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Function (biology); Discrete mathematics","score_opus":0.029987197248491273,"score_gpt":0.3230272442340674,"score_spread":0.2930400469855762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3853016,0.000021856189,0.60073674,0.0055378415,0.00059358147,0.0015314491,0.0039228797,0.00024270739,0.0021113511],"genre_scores_gemma":[0.9939294,0.0000044928206,0.004295187,0.0007539285,0.00009733215,0.00013360335,0.00015919136,0.000033820135,0.0005930606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984998,0.000063987536,0.00036573707,0.00038953437,0.00030389163,0.00037701425],"domain_scores_gemma":[0.9981406,0.0007926063,0.00010545752,0.0003109985,0.00037146683,0.00027887145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012020561,0.00017998255,0.00026303413,0.00015204526,0.00048556874,0.00018049977,0.00017384623,0.000090094974,0.00034212318],"category_scores_gemma":[0.005879248,0.00016829916,0.00017599016,0.00058821664,0.000036981735,0.00014083047,0.0000824529,0.00013690721,0.00013978186],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003692291,0.00028743292,0.0001544506,0.000041316514,0.000029872179,0.000010884625,0.0007991625,0.00037065297,0.48404667,0.50432247,0.009746504,0.0001536963],"study_design_scores_gemma":[0.0018284488,0.00045034577,0.0007887126,0.00021936519,0.000180207,0.00007062845,0.0020932946,0.01167321,0.71167904,0.19745144,0.07256836,0.0009969216],"about_ca_topic_score_codex":0.0000031334266,"about_ca_topic_score_gemma":0.000004852505,"teacher_disagreement_score":0.6086278,"about_ca_system_score_codex":0.00012201037,"about_ca_system_score_gemma":0.00010008144,"threshold_uncertainty_score":0.70384336},"labels":[],"label_agreement":null},{"id":"W4400596793","doi":"10.55016/ojs/cdm.v16i1.71235","title":"Geometric polynomials and integer partitions","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Integer (computer science); Combinatorics; Bernoulli number; Context (archaeology); Bernoulli's principle; Discrete mathematics; Computer science","score_opus":0.03434620968807975,"score_gpt":0.36045388712113957,"score_spread":0.3261076774330598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04929722,0.0006718826,0.92876047,0.0042991946,0.00023076692,0.00087527983,0.0008099134,0.00039873706,0.014656526],"genre_scores_gemma":[0.6918364,0.00015357038,0.28726014,0.00041620372,0.00029330634,0.00046884184,0.00008254135,0.00013185848,0.019357126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997903,0.000078429046,0.00075275055,0.00037791423,0.00035438864,0.0005335124],"domain_scores_gemma":[0.99629486,0.0018329371,0.00016842065,0.0007351043,0.0006102433,0.0003584629],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004860472,0.00028816407,0.00062904466,0.00026283212,0.00033506544,0.00021741116,0.00020522332,0.0001258276,0.00056753797],"category_scores_gemma":[0.015442516,0.00026740893,0.00015710245,0.0009644392,0.00016569464,0.00024970237,0.00036961297,0.0002164247,0.00029800984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036037984,0.00025502572,0.00002320763,0.0002566275,0.00009247928,0.000026381573,0.0006105953,0.0000100262005,0.001488427,0.9862979,0.010776054,0.00015964592],"study_design_scores_gemma":[0.0004043893,0.000037218404,0.000056761495,0.00022513041,0.00019581882,0.00011253361,0.0011766088,0.00028016962,0.010138201,0.98284113,0.0041699614,0.0003621007],"about_ca_topic_score_codex":0.0000027448073,"about_ca_topic_score_gemma":0.00002156742,"teacher_disagreement_score":0.6425392,"about_ca_system_score_codex":0.00015522013,"about_ca_system_score_gemma":0.000106039966,"threshold_uncertainty_score":0.9999778},"labels":[],"label_agreement":null},{"id":"W4400596794","doi":"10.55016/ojs/cdm.v16i1.62666","title":"Bounds on r-identifying codes in q-ary Lee space","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Hypercube; Combinatorics; Cardinality (data modeling); Upper and lower bounds; Mathematics; Discrete mathematics; Computer science","score_opus":0.012316153291424704,"score_gpt":0.2664175244968444,"score_spread":0.2541013712054197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596794","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7754367,0.0013629025,0.18593879,0.000974299,0.0010500569,0.0007005129,0.0005656214,0.0006123629,0.033358756],"genre_scores_gemma":[0.99787337,0.000021569023,0.0011745632,0.000050172654,0.000058436555,0.00006636608,0.000042406744,0.000028712166,0.0006844257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895847,0.0000540617,0.00033262456,0.00016700942,0.0001617817,0.00032607318],"domain_scores_gemma":[0.9991711,0.0001808554,0.000029170627,0.00040467817,0.00008020827,0.00013403034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003177356,0.0001681574,0.00029114215,0.00013677923,0.000113588634,0.00011896963,0.0001429625,0.0000852401,0.00009722342],"category_scores_gemma":[0.0004136502,0.00017154432,0.00009339183,0.0004945387,0.00002777242,0.00008900373,0.000045243556,0.00017950092,0.00028287355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009660195,0.00014349305,0.00024657452,0.0004738719,0.0001233527,0.00012320047,0.002909973,0.012574831,0.02555939,0.95380616,0.0037771177,0.0002523553],"study_design_scores_gemma":[0.0046352968,0.00025647244,0.004867464,0.0067054406,0.0003474776,0.00034113706,0.016365428,0.134371,0.27965257,0.488008,0.060865317,0.0035844133],"about_ca_topic_score_codex":0.0000034252062,"about_ca_topic_score_gemma":0.000049056758,"teacher_disagreement_score":0.4657982,"about_ca_system_score_codex":0.00013185636,"about_ca_system_score_gemma":0.0000316065,"threshold_uncertainty_score":0.69953746},"labels":[],"label_agreement":null},{"id":"W4400596797","doi":"10.55016/ojs/cdm.v15i3.62692","title":"Decomposition of complete tripartite graphs into cycles and paths of length three","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Decomposition; Path (computing); Discrete mathematics; Computer science; Chemistry","score_opus":0.013751420812721989,"score_gpt":0.2541824710650604,"score_spread":0.24043105025233844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76551133,0.00047656865,0.23237194,0.00019590367,0.00005582264,0.00038344093,0.00052880595,0.000098007185,0.0003781606],"genre_scores_gemma":[0.99691266,0.000020158906,0.002969304,0.000015698713,0.000017070235,0.000023318747,0.000025572112,0.000014990941,0.0000012414996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999169,0.000028375376,0.0004424178,0.00010311296,0.00011498836,0.00014209036],"domain_scores_gemma":[0.9994019,0.00011715535,0.00008265657,0.00018418275,0.000093017414,0.0001210324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001645687,0.00012729177,0.00035608656,0.000072911054,0.00005792563,0.0000143321495,0.000117903655,0.000052613723,0.000011848472],"category_scores_gemma":[0.00008210887,0.00011931617,0.00008744093,0.00026028836,0.000075803306,0.000068830384,0.000038772378,0.000068882924,0.000008678716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048622827,0.00008939061,0.0007504931,0.0020126784,0.00030950372,0.0000029233129,0.009328158,0.0031853393,0.23991823,0.7427364,0.00040801422,0.0012102424],"study_design_scores_gemma":[0.0033372126,0.0008265202,0.0051347385,0.0014921473,0.0006152919,0.000027358306,0.0039005475,0.36351952,0.1468956,0.47116467,0.0018763338,0.001210056],"about_ca_topic_score_codex":0.0000051067545,"about_ca_topic_score_gemma":0.000010431313,"teacher_disagreement_score":0.3603342,"about_ca_system_score_codex":0.000013030829,"about_ca_system_score_gemma":0.000006503757,"threshold_uncertainty_score":0.48655722},"labels":[],"label_agreement":null},{"id":"W4400596798","doi":"10.55016/ojs/cdm.v15i3.68674","title":"On the uniformity of the approximation for $r$-associated Stirling numbers of the second Kind","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Stirling numbers of the second kind; Stirling numbers of the first kind; Stirling number; Mathematics; Stirling engine; Bell polynomials; Extension (predicate logic); Range (aeronautics); Generating function; Partition (number theory); Combinatorics; Function (biology); Spouge's approximation; Natural number; Discrete mathematics; Applied mathematics; Minimax approximation algorithm; Computer science; Physics","score_opus":0.03972416383204305,"score_gpt":0.3168064005049099,"score_spread":0.2770822366728668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596798","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5775784,0.000027759388,0.3936993,0.013645765,0.00025800406,0.006330242,0.003105073,0.00012046701,0.0052349623],"genre_scores_gemma":[0.989737,0.000001002857,0.0086352,0.00027047758,0.000038311253,0.0001711709,0.000008373842,0.00004057785,0.0010979206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979779,0.00013137712,0.000873491,0.00019128284,0.0005195405,0.00030641683],"domain_scores_gemma":[0.99403244,0.0037598074,0.0008395253,0.0007786746,0.00050955947,0.00007999562],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0008210148,0.00023091315,0.00050339027,0.000031694075,0.00038591854,0.00004048667,0.0008113406,0.00011001049,0.00009702729],"category_scores_gemma":[0.023363618,0.000118137745,0.00038393194,0.00056314986,0.00028101855,0.00009862886,0.00028290463,0.00025212023,0.000008674207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015755455,0.00014241372,0.000018723515,0.0006245598,0.00010699262,6.4861844e-8,0.003221469,0.00016407773,0.0016414254,0.99131525,0.0027377869,0.000011481549],"study_design_scores_gemma":[0.0004906455,0.00006412032,0.000066542365,0.00044599612,0.0001990793,0.000001128477,0.0017760937,0.009206893,0.036894836,0.95048904,0.00020993662,0.00015566197],"about_ca_topic_score_codex":0.0000022599302,"about_ca_topic_score_gemma":0.000035614747,"teacher_disagreement_score":0.41215852,"about_ca_system_score_codex":0.00012708447,"about_ca_system_score_gemma":0.00009048664,"threshold_uncertainty_score":0.984863},"labels":[],"label_agreement":null},{"id":"W4400596802","doi":"10.55016/ojs/cdm.v16i1.62556","title":"Combinatorial interpretations of two identities of Guo and Yang","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Class (philosophy); Combinatorial analysis; Combinatorial principles; Combinatorial explosion; Computer science; Artificial intelligence","score_opus":0.0212955601876057,"score_gpt":0.3677586141242663,"score_spread":0.3464630539366606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3030169,0.00047605048,0.6813371,0.0004622084,0.00042563115,0.0008052637,0.0010203468,0.00012461655,0.01233188],"genre_scores_gemma":[0.9084777,0.000030242772,0.09016626,0.00001543476,0.000049328428,0.00005808175,0.000021948626,0.000035173543,0.0011458072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998141,0.00007663706,0.00094995945,0.00020687879,0.0003697976,0.0002557111],"domain_scores_gemma":[0.9964304,0.0015684031,0.00035743124,0.0005486451,0.0009710087,0.00012413721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003866899,0.0001980689,0.0007027538,0.00014790353,0.000109577246,0.000051884585,0.00020650464,0.0000732459,0.00014129866],"category_scores_gemma":[0.0075035095,0.00019307264,0.0001581893,0.0003726819,0.00028381665,0.00021660158,0.00031584286,0.0001245758,0.000012234662],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055415585,0.00020123494,0.000039677052,0.0007401713,0.00010275697,0.000004392403,0.0023213415,0.000010432436,0.0055602747,0.99062693,0.00035594616,0.000031287847],"study_design_scores_gemma":[0.0006739076,0.000052060106,0.000024174835,0.0005131682,0.0002293854,0.000025339266,0.0022004421,0.00051617384,0.042627823,0.952914,0.000050876442,0.00017267617],"about_ca_topic_score_codex":0.000005073497,"about_ca_topic_score_gemma":0.000021316895,"teacher_disagreement_score":0.6054608,"about_ca_system_score_codex":0.00006132451,"about_ca_system_score_gemma":0.00009838857,"threshold_uncertainty_score":0.8982944},"labels":[],"label_agreement":null},{"id":"W4400596804","doi":"10.55016/ojs/cdm.v16i3.62468","title":"New cyclic Kautz digraphs with optimal diameter","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación; European Regional Development Fund; Agència de Gestió d'Ajuts Universitaris i de Recerca; European Commission","keywords":"Digraph; Combinatorics; Iterated function; Mathematics; Alphabet; Sequence (biology); Discrete mathematics; Mathematical analysis","score_opus":0.008987353394995507,"score_gpt":0.25575134147274214,"score_spread":0.24676398807774663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043336516,0.00013190309,0.9885842,0.0029472688,0.0003417359,0.0002601066,0.00003299763,0.00018193694,0.0031862033],"genre_scores_gemma":[0.59016764,0.000008861842,0.4033007,0.00062966096,0.00029308145,0.0000811722,0.000023329085,0.000027252532,0.0054682917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985268,0.00006125786,0.000366864,0.00036689916,0.0002791242,0.00039905385],"domain_scores_gemma":[0.99825114,0.00016987816,0.000101429956,0.00084173284,0.00035317772,0.00028262858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021486945,0.00019085845,0.00031218576,0.000095833726,0.00021600911,0.00046695402,0.00047440515,0.00007356735,0.00008198695],"category_scores_gemma":[0.00017528389,0.00014789111,0.00013775231,0.00078462687,0.000025025114,0.00028445042,0.00020361051,0.00014174922,0.0001854819],"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.000008105328,0.00011559063,0.00012776772,0.000036598023,0.00017034113,0.00008048005,0.002365527,0.0020896483,0.0008589502,0.9667956,0.02500337,0.0023479732],"study_design_scores_gemma":[0.0062320386,0.0016361553,0.002007127,0.0022593103,0.00042613523,0.0026820719,0.002765863,0.5418825,0.034341116,0.086840756,0.31470704,0.0042198575],"about_ca_topic_score_codex":0.000013561262,"about_ca_topic_score_gemma":0.00004190333,"teacher_disagreement_score":0.8799549,"about_ca_system_score_codex":0.00007248638,"about_ca_system_score_gemma":0.00016278162,"threshold_uncertainty_score":0.6030825},"labels":[],"label_agreement":null},{"id":"W4400596810","doi":"10.55016/ojs/cdm.v15i3.69846","title":"Binomial transforms of the balancing and Lucas-balancing polynomials","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Catalan number; Mathematics; Binomial (polynomial); Recurrence relation; Binomial coefficient; Catalan; Combinatorics; Discrete mathematics; Statistics","score_opus":0.008304321983629265,"score_gpt":0.2711280594762513,"score_spread":0.262823737492622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16450527,0.000033236098,0.82589746,0.004676682,0.00004449011,0.0006808223,0.0009761436,0.00003565039,0.0031502442],"genre_scores_gemma":[0.99346524,0.0000013729239,0.0061478666,0.00012064634,0.00014729003,0.000050563795,0.0000092490245,0.000014042569,0.00004369877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991367,0.000015052104,0.00037436152,0.00015192908,0.000112903064,0.00020908593],"domain_scores_gemma":[0.9991961,0.00021625702,0.00012342661,0.000237768,0.000074921474,0.00015150239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011214409,0.00013518266,0.00029787543,0.000015015141,0.00020359634,0.000032746186,0.0001885465,0.000028032882,0.00008171747],"category_scores_gemma":[0.00015469626,0.000090233065,0.000113350965,0.00023628597,0.000095705254,0.000063336105,0.00010147578,0.00010612171,0.000015329277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065793047,0.00003448583,0.00021783971,0.000056125693,0.000033845667,7.769372e-8,0.002005034,0.00008904428,0.009761141,0.98659945,0.00015478376,0.0010415782],"study_design_scores_gemma":[0.001904999,0.00010833663,0.0009446438,0.00038076725,0.0003543691,0.000004462812,0.0067733363,0.010527041,0.1085362,0.8605727,0.00912612,0.00076705386],"about_ca_topic_score_codex":0.0000058594424,"about_ca_topic_score_gemma":7.24153e-7,"teacher_disagreement_score":0.82896,"about_ca_system_score_codex":0.00001726937,"about_ca_system_score_gemma":0.000035572768,"threshold_uncertainty_score":0.36795974},"labels":[],"label_agreement":null},{"id":"W4400596815","doi":"10.55016/ojs/cdm.v16i1.69407","title":"Direct and inverse problems for restricted signed sumsets in integers","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Human Resource Development; Ministry of Education, India; Indian Institute of Technology Roorkee","keywords":"Mathematics; Combinatorics; Inverse; Abelian group; Integer (computer science); Lambda; Cardinality (data modeling); Wedge (geometry); Sigma; Discrete mathematics; Physics; Geometry; Computer science","score_opus":0.024886383372675666,"score_gpt":0.31594890040409046,"score_spread":0.2910625170314148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596815","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75421244,0.00067613245,0.22404486,0.0029273722,0.0005976536,0.004866382,0.002286997,0.00040427924,0.009983865],"genre_scores_gemma":[0.93678355,0.000045853973,0.061555028,0.00019391945,0.000070720234,0.00035806125,0.00008866705,0.0000548573,0.0008493319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983938,0.000104724655,0.0005606469,0.00033927095,0.00018068292,0.0004209143],"domain_scores_gemma":[0.997379,0.0014840993,0.0001330677,0.0004887352,0.0003442971,0.0001708244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005047029,0.00023732461,0.00050187483,0.00018565948,0.0002639249,0.00007902305,0.00017887048,0.00015249204,0.00003443064],"category_scores_gemma":[0.0071119033,0.00020408908,0.00012373981,0.00055119244,0.000104489496,0.00009611289,0.00020155315,0.00015119681,0.0000036389204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039734536,0.00017157556,0.00013086035,0.0004989982,0.00010865051,0.00001918194,0.0047035236,0.000035071826,0.004548022,0.98505294,0.004373621,0.00031782204],"study_design_scores_gemma":[0.0015729327,0.00010109664,0.00018471105,0.00038575035,0.00013964144,0.000025690608,0.0012832353,0.0026536104,0.006507494,0.9835568,0.0031689152,0.00042012817],"about_ca_topic_score_codex":0.0000060730367,"about_ca_topic_score_gemma":0.00012584127,"teacher_disagreement_score":0.1825711,"about_ca_system_score_codex":0.00011238741,"about_ca_system_score_gemma":0.000087790744,"threshold_uncertainty_score":0.8514126},"labels":[],"label_agreement":null},{"id":"W4400596816","doi":"10.55016/ojs/cdm.v16i3.62279","title":"Graphs where each spanning tree has a perfect matching","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Spanning tree; Minimum degree spanning tree; Matching (statistics); Graph; Connectivity; Discrete mathematics; Connected dominating set; Tree (set theory); Minimum spanning tree","score_opus":0.02635374451992335,"score_gpt":0.3218086747465916,"score_spread":0.29545493022666824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016433746,0.00067078014,0.9741941,0.0048844703,0.00014740022,0.0003881259,0.00007436494,0.00031920816,0.0028877773],"genre_scores_gemma":[0.70089585,0.00003191165,0.2970657,0.00021223111,0.00007156476,0.00014122749,0.000027354235,0.000042570704,0.0015115949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974582,0.00020948086,0.00045436583,0.0005688948,0.0005475143,0.0007615099],"domain_scores_gemma":[0.99702525,0.0005840179,0.00011342172,0.0013780682,0.00056034926,0.00033889938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008572555,0.00026817547,0.0004070891,0.00023773023,0.0007713956,0.00075126224,0.001098717,0.00009330726,0.00006226888],"category_scores_gemma":[0.0011349662,0.0002517147,0.00023502302,0.0015901445,0.0001241008,0.0005239425,0.00085483294,0.00038917278,0.000252008],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005032791,0.00011453624,0.00007436727,0.000074585376,0.000065152504,0.00010526449,0.0030199657,0.00046416835,0.0077439654,0.9846154,0.0008793495,0.0028382458],"study_design_scores_gemma":[0.0007991024,0.00012020899,0.00026501835,0.00042442098,0.0000447931,0.0002194916,0.0012389104,0.026410053,0.011750535,0.95063734,0.0074180653,0.00067207054],"about_ca_topic_score_codex":0.000006609854,"about_ca_topic_score_gemma":0.000043684322,"teacher_disagreement_score":0.6844621,"about_ca_system_score_codex":0.00014679699,"about_ca_system_score_gemma":0.0002456463,"threshold_uncertainty_score":0.9999935},"labels":[],"label_agreement":null},{"id":"W4400596818","doi":"10.55016/ojs/cdm.v16i1.70710","title":"Symmetric association schemes arising from abstract regular polytopes","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Coxeter group; Mathematics; Combinatorics; Polytope; Coset; Vertex (graph theory); Symmetric group; Type (biology); Finite group; Group (periodic table); Graph; Physics","score_opus":0.009539156373322692,"score_gpt":0.2651140095327008,"score_spread":0.2555748531593781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06560869,0.00082886865,0.9250113,0.005213279,0.0003319452,0.00019345862,0.000281195,0.00033239002,0.0021989064],"genre_scores_gemma":[0.85559285,0.000031004398,0.14263532,0.0005194935,0.00018924357,0.000025559735,0.00010333878,0.000019984747,0.0008832396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982984,0.000062458465,0.00042941188,0.0003758877,0.0004349335,0.00039892845],"domain_scores_gemma":[0.9976612,0.0007306931,0.00022455922,0.000829574,0.00039370457,0.00016031197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005812567,0.00017939143,0.00031951873,0.00013957894,0.0002741799,0.00058372825,0.00057346205,0.00012583213,0.00008347602],"category_scores_gemma":[0.002694092,0.00017231808,0.00014418579,0.0010405224,0.00001724643,0.00041915305,0.00034574425,0.00016939202,0.00030129246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016858022,0.00021005838,0.0002920148,0.000029425664,0.00018212377,0.000044975095,0.00078168523,0.000048387396,0.017805206,0.9663168,0.004032967,0.010254665],"study_design_scores_gemma":[0.0013274893,0.00006494116,0.011024719,0.0005830334,0.00022159705,0.000039107013,0.0008625176,0.08619252,0.20902963,0.64965683,0.039657112,0.0013405058],"about_ca_topic_score_codex":0.000016650252,"about_ca_topic_score_gemma":0.000004883204,"teacher_disagreement_score":0.7899841,"about_ca_system_score_codex":0.00031606603,"about_ca_system_score_gemma":0.0001311841,"threshold_uncertainty_score":0.7026927},"labels":[],"label_agreement":null},{"id":"W4400596821","doi":"10.55016/ojs/cdm.v16i1.62717","title":"Coloring permutation-gain graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Greedy coloring; Edge coloring; Graph coloring; Fractional coloring; Complete coloring; Discrete mathematics; List coloring; Permutation graph; Graph; Line graph; Graph power","score_opus":0.013859159797262998,"score_gpt":0.2784190764770123,"score_spread":0.2645599166797493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026893893,0.00026953866,0.96400636,0.00548477,0.00031189542,0.00023722948,0.000057306126,0.00032458632,0.002414406],"genre_scores_gemma":[0.80181867,0.000014767468,0.19670966,0.0006109692,0.00001114095,0.000073378804,0.00003146284,0.0000133711765,0.00071656035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986346,0.000056808578,0.00035607436,0.00033054972,0.00028065697,0.00034133694],"domain_scores_gemma":[0.9981924,0.00020657436,0.00007988626,0.0006908777,0.0006211937,0.0002090654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037922835,0.00014370037,0.00021540854,0.00012930551,0.00034317104,0.0002692558,0.0003940677,0.000059412643,0.000027687418],"category_scores_gemma":[0.0008610037,0.00013581525,0.00011337615,0.0010273334,0.000038648686,0.00020504603,0.00026066668,0.00011511658,0.0002332026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.816629e-7,0.0000641529,0.00003051056,0.00001683213,0.000021747128,0.000018906592,0.00075605215,0.00054991303,0.0038362967,0.993106,0.0011953271,0.00040369088],"study_design_scores_gemma":[0.0005470521,0.00005677029,0.0001503944,0.000139104,0.000037792943,0.00007321764,0.00033617136,0.07072176,0.021045594,0.90340376,0.0030968364,0.00039154003],"about_ca_topic_score_codex":0.0000040077753,"about_ca_topic_score_gemma":0.000005703797,"teacher_disagreement_score":0.7749248,"about_ca_system_score_codex":0.000052647243,"about_ca_system_score_gemma":0.00014273751,"threshold_uncertainty_score":0.55383855},"labels":[],"label_agreement":null},{"id":"W4400596823","doi":"10.55016/ojs/cdm.v16i1.68557","title":"k-Forcing number for Cartesian product of some graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian product; Bipartite graph; Forcing (mathematics); Mathematics; Combinatorics; Graph coloring; Graph; Product (mathematics); Discrete mathematics; Generalization; Geometry; Mathematical analysis","score_opus":0.019671688235078175,"score_gpt":0.3361353020900227,"score_spread":0.3164636138549445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008478112,0.00017501335,0.9873535,0.002185163,0.00013031076,0.0007040736,0.00022939823,0.00009094481,0.0006534779],"genre_scores_gemma":[0.6449841,0.000011647176,0.35381508,0.00009877469,0.00006260293,0.00022489252,0.000030661275,0.000022826833,0.0007494316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840856,0.00006303557,0.0004089404,0.00036514475,0.00029820012,0.00045611977],"domain_scores_gemma":[0.99734634,0.0004160964,0.000116833195,0.0010398562,0.00091804715,0.00016282711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005919372,0.00014797655,0.0003283401,0.00011006412,0.00021471277,0.00009178951,0.00062999845,0.000042695163,0.000016663698],"category_scores_gemma":[0.0018685724,0.00013788196,0.00017991595,0.0009072357,0.00008364634,0.00036124545,0.00031276597,0.00010742534,0.000034903296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003805473,0.00007104462,0.00005934448,0.00010400423,0.00003489195,0.0000040730006,0.00047727258,0.000081768696,0.0068550343,0.9910939,0.0003766167,0.0008382487],"study_design_scores_gemma":[0.00040789146,0.000048917907,0.00008007032,0.00010097488,0.000023129633,0.0000285086,0.00015739193,0.007343448,0.107020654,0.8829767,0.0016013974,0.00021091047],"about_ca_topic_score_codex":0.0000014296742,"about_ca_topic_score_gemma":0.000003550296,"teacher_disagreement_score":0.63650596,"about_ca_system_score_codex":0.00006074986,"about_ca_system_score_gemma":0.00017964489,"threshold_uncertainty_score":0.56226635},"labels":[],"label_agreement":null},{"id":"W4400596830","doi":"10.55016/ojs/cdm.v15i3.68174","title":"Degree sequence of the generalized Sierpiński graph","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Sierpinski triangle; Combinatorics; Mathematics; Degree (music); Discrete mathematics; Fractal; Graph; Sequence (biology)","score_opus":0.08688189845068182,"score_gpt":0.34426589242265393,"score_spread":0.2573839939719721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41370156,0.00012639431,0.5448371,0.02764938,0.0001653732,0.0031052632,0.0033037462,0.00037962288,0.006731515],"genre_scores_gemma":[0.9642492,0.00000667996,0.034720127,0.0005660705,0.00006198264,0.00016565999,0.000016764558,0.000029272724,0.00018423106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850345,0.000102696344,0.0005825038,0.00023244892,0.0002893098,0.000289621],"domain_scores_gemma":[0.9980026,0.00044997013,0.0002706062,0.0007897717,0.00028039832,0.0002066922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035536522,0.00020117052,0.00038124112,0.00004850841,0.00028789177,0.00003202283,0.0007080824,0.00008447919,0.00010384455],"category_scores_gemma":[0.002457749,0.00014038206,0.00028680582,0.00095222425,0.00020541274,0.000065103006,0.0002065579,0.00017664307,0.000057258454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000752635,0.00007032695,0.000033448185,0.00008626112,0.00004722507,5.4020455e-7,0.0011201586,0.000028939166,0.018783119,0.9767759,0.0029611415,0.000085432664],"study_design_scores_gemma":[0.00039910787,0.000039665174,0.00007010193,0.00008863032,0.00016792578,0.000006837472,0.00029825483,0.00115292,0.020469539,0.97413594,0.0029588037,0.0002122824],"about_ca_topic_score_codex":0.000003229467,"about_ca_topic_score_gemma":0.0000059165855,"teacher_disagreement_score":0.55054766,"about_ca_system_score_codex":0.000034087494,"about_ca_system_score_gemma":0.0000684053,"threshold_uncertainty_score":0.5724614},"labels":[],"label_agreement":null},{"id":"W4400596835","doi":"10.55016/ojs/cdm.v15i3.62290","title":"A complete solution to the spectrum problem for graphs with six vertices and up to nine edges","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Cograph; 1-planar graph; Pathwidth; Indifference graph; Chordal graph; Metric dimension; Discrete mathematics; Vertex (graph theory); Clique-sum; Neighbourhood (mathematics); Graph; Line graph","score_opus":0.0162376995996428,"score_gpt":0.23206859272246858,"score_spread":0.21583089312282577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055546805,0.00016996861,0.9225517,0.017541725,0.00012884675,0.0025601503,0.0009057164,0.00025522918,0.0003398528],"genre_scores_gemma":[0.99331033,0.000003537655,0.0056873844,0.00030146271,0.00008950361,0.00048106947,0.000026743935,0.000029987372,0.00007000146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99907196,0.000024275574,0.00025923367,0.00018585482,0.00012696256,0.00033172648],"domain_scores_gemma":[0.99925005,0.00013659074,0.000033390228,0.00023536982,0.00008495983,0.00025961635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022618554,0.00018381892,0.00026430987,0.00006343334,0.0002473014,0.00010761238,0.00019365079,0.000038324033,0.000009862989],"category_scores_gemma":[0.00014361292,0.00012594138,0.00005581755,0.00042868414,0.00003297221,0.00006971164,0.00005623597,0.00007960123,0.000053753123],"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.00030779737,0.000059624002,0.00013216499,0.0014987245,0.0005681212,0.0000037607128,0.03085269,0.025157856,0.031636324,0.874507,0.0343909,0.00088504504],"study_design_scores_gemma":[0.005854414,0.004788383,0.0011850173,0.002237848,0.001357511,0.00011287456,0.013029746,0.39237764,0.025222898,0.12087844,0.4295595,0.0033957418],"about_ca_topic_score_codex":0.0000041061703,"about_ca_topic_score_gemma":0.00006441464,"teacher_disagreement_score":0.9377635,"about_ca_system_score_codex":0.00003193797,"about_ca_system_score_gemma":0.000010859926,"threshold_uncertainty_score":0.513574},"labels":[],"label_agreement":null},{"id":"W4400596836","doi":"10.55016/ojs/cdm.v15i2.67943","title":"Minimum size blocking sets of certain line sets with respect to an elliptic quadric in $PG(3,q)$","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Human Resource Development; Science and Engineering Research Board; Ministry of Education, India; Council of Scientific and Industrial Research, India","keywords":"Quadric; Combinatorics; Mathematics; Line (geometry); Blocking (statistics); Type (biology); Blocking set; Connection (principal bundle); Discrete mathematics; Geometry; Pure mathematics; Projective space; Statistics","score_opus":0.015431631780813145,"score_gpt":0.26435813305748357,"score_spread":0.24892650127667043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596836","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92176586,0.00012319483,0.075295225,0.0007206639,0.00007038261,0.00089178904,0.0003240316,0.00021427366,0.0005945855],"genre_scores_gemma":[0.9947147,0.0000032660762,0.004975442,0.000085572145,0.00004700615,0.00007511529,0.000020225541,0.00004601544,0.00003268384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984704,0.0000829268,0.00058975845,0.00024033288,0.00022473419,0.00039184577],"domain_scores_gemma":[0.9987671,0.00030140605,0.00007507753,0.00042548316,0.00011443509,0.00031652016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038038613,0.00024928822,0.000511259,0.0001463097,0.0000649748,0.000042948195,0.00028705032,0.00009081188,0.000040195893],"category_scores_gemma":[0.00056979165,0.00022165514,0.00007282846,0.0009891287,0.000033424283,0.0000967522,0.000048884533,0.00017900144,0.000058035796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080679,0.000924648,0.002167388,0.0044724196,0.00082770863,0.00028807076,0.10010247,0.54873127,0.16953608,0.16840532,0.0019846922,0.0017531496],"study_design_scores_gemma":[0.005720237,0.003383455,0.0029906884,0.0038995217,0.0005229089,0.000110568726,0.016410988,0.8658021,0.07080363,0.023499338,0.0037295425,0.0031269905],"about_ca_topic_score_codex":0.000007745922,"about_ca_topic_score_gemma":0.00006047419,"teacher_disagreement_score":0.31707087,"about_ca_system_score_codex":0.00007977418,"about_ca_system_score_gemma":0.000030858995,"threshold_uncertainty_score":0.9038834},"labels":[],"label_agreement":null},{"id":"W4400596839","doi":"10.55016/ojs/cdm.v15i2.62547","title":"Diameter 3","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Class (philosophy); Property (philosophy); Set (abstract data type); Metric space; Metric (unit); Finite set; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.039395814137579276,"score_gpt":0.35431667660441274,"score_spread":0.3149208624668335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012704057,0.0000522254,0.966014,0.012886074,0.00010037593,0.00054447335,0.00030838928,0.00033273993,0.0070576444],"genre_scores_gemma":[0.772197,0.0000069209204,0.2224017,0.0038301423,0.0003231765,0.00012290747,0.000030104326,0.00006271638,0.001025303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874187,0.000065376254,0.00039911453,0.00025490503,0.00016664757,0.00037211188],"domain_scores_gemma":[0.9983323,0.00068918406,0.000102791404,0.00039963413,0.00014629718,0.0003297666],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002480508,0.00020082205,0.00038453276,0.000049472295,0.00019190721,0.00002895209,0.00029422168,0.00010923047,0.00045872264],"category_scores_gemma":[0.005393696,0.00017214278,0.00013668687,0.00028283027,0.00010754447,0.00010038639,0.00014795459,0.00020736975,0.00082857226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019186724,0.00006363296,0.000014977691,0.000058394427,0.0000495767,0.000009684551,0.0019565448,0.000016022615,0.00094462285,0.98675334,0.009852039,0.00026197347],"study_design_scores_gemma":[0.00047988366,0.000117552234,0.000014900886,0.00003851964,0.00009197989,0.000012303392,0.0005489997,0.0012012884,0.003610101,0.97704405,0.016530197,0.00031020085],"about_ca_topic_score_codex":3.999365e-7,"about_ca_topic_score_gemma":0.0000015208623,"teacher_disagreement_score":0.759493,"about_ca_system_score_codex":0.000049896917,"about_ca_system_score_gemma":0.000033568238,"threshold_uncertainty_score":0.9999494},"labels":[],"label_agreement":null},{"id":"W4400596840","doi":"10.55016/ojs/cdm.v16i1.62258","title":"H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs.","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Dirección General de Asuntos del Personal Académico, Universidad Nacional Autónoma de México","keywords":"Digraph; Combinatorics; Mathematics; Transitive relation; Arc (geometry); Kernel (algebra); Independence (probability theory); Discrete mathematics; Geometry","score_opus":0.012375351633211898,"score_gpt":0.3119576176220196,"score_spread":0.2995822659888077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029814584,0.00038143893,0.965131,0.0031316855,0.00006368638,0.00045609812,0.00010236851,0.00009902999,0.0008200999],"genre_scores_gemma":[0.9328882,0.00006883688,0.06652667,0.00017973487,0.000014250663,0.000101322315,0.000007916559,0.0000123081845,0.00020076285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979641,0.00015992211,0.00036720204,0.0005265832,0.00043754163,0.0005446696],"domain_scores_gemma":[0.997898,0.00056410587,0.000065926244,0.0007423102,0.0004718846,0.0002578123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007136882,0.00019074242,0.00032392947,0.0002286382,0.00020783524,0.00021436338,0.0006236634,0.00009708622,0.000016679427],"category_scores_gemma":[0.0013950673,0.00018633444,0.000073455005,0.0015611843,0.0001457545,0.00047600776,0.00043632093,0.00031977345,0.000042815005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009552326,0.00017924365,0.00027364935,0.000043269752,0.000021148095,0.00019441897,0.0025387565,0.000098249235,0.008608002,0.98592544,0.000044931418,0.0020633438],"study_design_scores_gemma":[0.0014234497,0.00020537683,0.005001871,0.00041468025,0.000023496497,0.00021333963,0.0013270397,0.059862055,0.028822703,0.90136766,0.00060794695,0.00073035125],"about_ca_topic_score_codex":0.000005498318,"about_ca_topic_score_gemma":0.00008390928,"teacher_disagreement_score":0.9030736,"about_ca_system_score_codex":0.00009360098,"about_ca_system_score_gemma":0.00018421,"threshold_uncertainty_score":0.7598498},"labels":[],"label_agreement":null},{"id":"W4400596842","doi":"10.55016/ojs/cdm.v16i2.71723","title":"Problems Section BIRS Proceedings","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Section (typography); Homogeneous; Combinatorics; Mathematics; Genealogy; Special section; Library science; Computer science; History; Engineering; Engineering physics","score_opus":0.0065658054730559755,"score_gpt":0.22467358478569605,"score_spread":0.21810777931264008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2016601,0.00036924685,0.78073674,0.00119532,0.00052240264,0.0005451401,0.00017994246,0.0008733603,0.01391775],"genre_scores_gemma":[0.9841616,0.000052045547,0.0147673255,0.000039138897,0.00018023854,0.00005998581,0.00009284977,0.000026314001,0.000620482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932677,0.0000037834177,0.00023469694,0.00012437027,0.00012589153,0.0001845133],"domain_scores_gemma":[0.9994127,0.000016993747,0.000028554512,0.00011643406,0.00033981656,0.00008549463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000069752976,0.00011425383,0.00016856025,0.00006790894,0.00010896019,0.00010908543,0.00006572474,0.000060801867,0.00012990607],"category_scores_gemma":[0.00016517058,0.00010189893,0.00007309178,0.0005991663,0.000011162184,0.00011838838,0.000027387261,0.00008239065,0.0000510229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061587207,0.00013133514,0.0006772823,0.0010469479,0.0006597403,0.000010980791,0.0043737725,0.6305283,0.1572217,0.17331539,0.028955506,0.003072915],"study_design_scores_gemma":[0.00046043354,0.00003563168,0.00083815906,0.00020273695,0.00023163103,0.000059510843,0.00074568985,0.9192184,0.043354947,0.013289173,0.020974461,0.0005892004],"about_ca_topic_score_codex":0.0000013963975,"about_ca_topic_score_gemma":0.0000074955465,"teacher_disagreement_score":0.7825015,"about_ca_system_score_codex":0.000105145526,"about_ca_system_score_gemma":0.000012740686,"threshold_uncertainty_score":0.41553178},"labels":[],"label_agreement":null},{"id":"W4400596848","doi":"10.55016/ojs/cdm.v15i2.62857","title":"A subspace based subspace inclusion graph on vector space","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Nuclear Receptors and Signaling","field":"Neuroscience","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Linear subspace; Geometry","score_opus":0.02762793962611365,"score_gpt":0.287593333763203,"score_spread":0.25996539413708936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46369487,0.00008721034,0.3874748,0.13801652,0.0004806092,0.0023469236,0.00094491633,0.0009939701,0.005960178],"genre_scores_gemma":[0.99292845,0.000006919936,0.0029713174,0.003653734,0.0001306987,0.00003212683,0.000010906458,0.000052683292,0.00021314772],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980355,0.00013511132,0.00030975384,0.000494545,0.00054895505,0.00047614067],"domain_scores_gemma":[0.9983124,0.00052689126,0.00014136708,0.0004256208,0.000111407266,0.00048230018],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002495306,0.00027529307,0.00035435584,0.000119932774,0.0008091976,0.00014119246,0.00044617755,0.00009962804,0.0003348805],"category_scores_gemma":[0.0037440164,0.00023836792,0.00018303587,0.0009413159,0.00008719429,0.00010178568,0.00041505453,0.0002829067,0.00080814736],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013884238,0.0002524991,0.000025573969,0.000100652185,0.000012206571,0.000034576584,0.0044315415,0.0016231523,0.795361,0.18798634,0.009883634,0.00014997703],"study_design_scores_gemma":[0.0016102932,0.0007981658,0.0000497886,0.00032997015,0.000076835146,0.0000076216993,0.00045916025,0.07775519,0.86143786,0.0060967105,0.050512552,0.0008658746],"about_ca_topic_score_codex":0.0000052682426,"about_ca_topic_score_gemma":0.0000039892066,"teacher_disagreement_score":0.5292336,"about_ca_system_score_codex":0.00011565706,"about_ca_system_score_gemma":0.00006853809,"threshold_uncertainty_score":0.99996984},"labels":[],"label_agreement":null},{"id":"W4400596849","doi":"10.55016/ojs/cdm.v15i2.62866","title":"A new mathematical model for tiling finite regions of the plane with polyominoes","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Underdetermined system; MATLAB; Mathematics; Polyomino; Backtracking; Binary number; Linear programming; Computer science; Algorithm; Combinatorics; Discrete mathematics; Geometry","score_opus":0.026359110865044805,"score_gpt":0.2696174514845941,"score_spread":0.2432583406195493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596849","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008050281,0.000022597507,0.97984135,0.017749019,0.000010218099,0.0008550025,0.00026759383,0.00010636033,0.00034281585],"genre_scores_gemma":[0.49731565,0.0000014285022,0.50161386,0.00035563228,0.000038962793,0.00012073978,0.000018218225,0.000015459022,0.00052003213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896854,0.000013277084,0.00034097416,0.00022972605,0.000214095,0.00023336183],"domain_scores_gemma":[0.9984821,0.00032465276,0.0001444777,0.000706475,0.00013803858,0.00020427405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011398426,0.00014013577,0.00025250943,0.00003343959,0.0002010526,0.00007869212,0.00086979585,0.000046487636,0.000007040983],"category_scores_gemma":[0.00040382778,0.00009031249,0.0001220196,0.000454664,0.000050406787,0.0001017574,0.00023290605,0.0000867257,0.000023114053],"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.000005688569,0.000045718836,0.0000032866121,0.00007092727,0.000027097267,3.3909134e-7,0.0026926394,0.004335424,0.0020154654,0.9883347,0.0022675006,0.00020120184],"study_design_scores_gemma":[0.0003172017,0.00004330453,0.000006139467,0.00006681779,0.000054880995,0.0000066816574,0.00007967877,0.91490656,0.0055212774,0.07805355,0.00082122214,0.00012268522],"about_ca_topic_score_codex":0.0000018056877,"about_ca_topic_score_gemma":0.0000037042169,"teacher_disagreement_score":0.91057116,"about_ca_system_score_codex":0.000022957387,"about_ca_system_score_gemma":0.00019513437,"threshold_uncertainty_score":0.36828363},"labels":[],"label_agreement":null},{"id":"W4400596851","doi":"10.55016/ojs/cdm.v15i3.62721","title":"Alternating series of Apéry-type for the Riemann zeta function","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Riemann zeta function; Mathematics; Series (stratigraphy); Particular values of Riemann zeta function; Type (biology); Riemann hypothesis; Transformation (genetics); Class (philosophy); Pure mathematics; Arithmetic zeta function; Function (biology); Mathematical analysis; Prime zeta function; Combinatorics; Computer science; Chemistry","score_opus":0.062275568514576995,"score_gpt":0.3553928450027088,"score_spread":0.2931172764881318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010890987,0.00016925823,0.9799043,0.0051788096,0.00022836527,0.0018115332,0.000489891,0.00020452689,0.0011223368],"genre_scores_gemma":[0.72638845,0.00004627052,0.26896194,0.00048384338,0.00066276616,0.0005588119,0.000065141285,0.00015014075,0.0026826353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981066,0.000038832157,0.0008366837,0.0002569657,0.0003832821,0.00037766568],"domain_scores_gemma":[0.99582857,0.0022994042,0.00039827774,0.00054280134,0.0007644448,0.00016648583],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0004372495,0.00025962433,0.0005533671,0.000054261993,0.00033762667,0.00008416936,0.00047261934,0.00007512357,0.000082346014],"category_scores_gemma":[0.013753389,0.00018712651,0.0002146615,0.00045887617,0.00016479175,0.00025617468,0.00017075757,0.00016525087,0.00005721644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007381563,0.000076247044,0.000011999877,0.0008427586,0.00018403605,8.573838e-7,0.002335494,0.0001865206,0.002109473,0.9881102,0.005963818,0.00010480931],"study_design_scores_gemma":[0.00051751704,0.00035361198,0.000022329343,0.00016900573,0.00049163733,0.000007489042,0.00228726,0.008953953,0.00643764,0.9757106,0.004764298,0.0002846578],"about_ca_topic_score_codex":0.0000022294416,"about_ca_topic_score_gemma":0.0000126091545,"teacher_disagreement_score":0.7154975,"about_ca_system_score_codex":0.000059409595,"about_ca_system_score_gemma":0.00005461131,"threshold_uncertainty_score":0.99455416},"labels":[],"label_agreement":null},{"id":"W4400596853","doi":"10.55016/ojs/cdm.v16i1.69831","title":"Lengths of extremal square-free ternary words","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Square-free integer; Ternary operation; Word (group theory); Mathematics; Square (algebra); Alphabet; Combinatorics; Sigma; Discrete mathematics; Geometry; Computer science; Linguistics; Physics","score_opus":0.010786793229228257,"score_gpt":0.27178721306637393,"score_spread":0.26100041983714567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019864405,0.00041295285,0.9720138,0.0032740352,0.00023370625,0.00019837303,0.00025973766,0.00017933089,0.0035637158],"genre_scores_gemma":[0.8145308,0.000019886373,0.18415865,0.0002601221,0.00010001107,0.000039398245,0.000025835983,0.000019395227,0.00084591337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847823,0.0000702661,0.0004671855,0.00030738642,0.0003361798,0.00034071945],"domain_scores_gemma":[0.9974066,0.000337947,0.00014111112,0.0016386634,0.00032018565,0.00015547987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038736433,0.00017098084,0.00034004523,0.00009734092,0.00012697953,0.00012071788,0.0011683437,0.0000736333,0.00009617811],"category_scores_gemma":[0.0010822874,0.00015526061,0.00016262737,0.00061501854,0.00006123522,0.00025686025,0.00093274977,0.000116622294,0.000084387],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002965144,0.00019758768,0.000058631464,0.000074274125,0.000044389217,0.000048181337,0.0012184465,0.000051290113,0.0052776868,0.9869715,0.0027287286,0.0033263396],"study_design_scores_gemma":[0.0020942613,0.000260424,0.0015334572,0.00092227844,0.00012892486,0.0003194098,0.0015828756,0.16162057,0.092525855,0.7250692,0.012851856,0.0010908575],"about_ca_topic_score_codex":0.0000043732443,"about_ca_topic_score_gemma":0.0000053816116,"teacher_disagreement_score":0.7946664,"about_ca_system_score_codex":0.000060821556,"about_ca_system_score_gemma":0.00013785347,"threshold_uncertainty_score":0.6331344},"labels":[],"label_agreement":null},{"id":"W4400596854","doi":"10.55016/ojs/cdm.v16i3.69926","title":"Degree conditions of nearly induced matching extendable graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Graph; Matching (statistics); Factor-critical graph; Discrete mathematics; Graph power; Line graph","score_opus":0.037133332334841104,"score_gpt":0.34569371354047956,"score_spread":0.30856038120563845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07069926,0.00011100253,0.9243866,0.0012453191,0.00011511775,0.0003487535,0.0002957094,0.00013646825,0.0026617646],"genre_scores_gemma":[0.8551889,0.000009087657,0.14417264,0.00009795114,0.000017833981,0.00007744592,0.000031622993,0.000017558006,0.0003869613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980732,0.00013217241,0.00049900496,0.0003631932,0.0004423129,0.0004900697],"domain_scores_gemma":[0.99696636,0.00051637815,0.00015065061,0.0011996184,0.00092095666,0.0002460129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005424719,0.00017736529,0.00035859708,0.0002443183,0.00035510364,0.00017676938,0.0008595501,0.00007860009,0.00007547502],"category_scores_gemma":[0.0011214858,0.00017133974,0.00017032218,0.001654415,0.00010165395,0.0004852013,0.0005613922,0.00024071724,0.0001085807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022511815,0.0001119592,0.00002370343,0.00003731634,0.000041579147,0.000020771087,0.0007479741,0.00011692732,0.041244697,0.95688486,0.0001617051,0.00060627976],"study_design_scores_gemma":[0.0004005073,0.000077678356,0.0006026572,0.00014450967,0.000023334458,0.000055741635,0.00045613298,0.0035288613,0.057729397,0.93640715,0.0003245123,0.00024949363],"about_ca_topic_score_codex":0.000008724908,"about_ca_topic_score_gemma":0.0000141990795,"teacher_disagreement_score":0.78448963,"about_ca_system_score_codex":0.00007601679,"about_ca_system_score_gemma":0.00025238318,"threshold_uncertainty_score":0.69870317},"labels":[],"label_agreement":null},{"id":"W4400596855","doi":"10.55016/ojs/cdm.v15i3.62247","title":"Normality of one-matching semi-Cayley graphs over finite abelian groups with maximum degree 3","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Cayley graph; Vertex-transitive graph; Abelian group; Graph; Cayley's theorem; Discrete mathematics; Matching (statistics); Finite group; Degree (music); Line graph; Group (periodic table); Voltage graph; Statistics","score_opus":0.07135929301127203,"score_gpt":0.33384762210727553,"score_spread":0.2624883290960035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.434089,0.00007164283,0.5538914,0.0028276986,0.00005788967,0.0018637695,0.0021654202,0.0003406457,0.004692507],"genre_scores_gemma":[0.95165557,0.0000126088335,0.047490887,0.0003021817,0.00009130483,0.00013039431,0.00008758903,0.00010747737,0.00012196165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960981,0.00025403843,0.0011439782,0.00054939307,0.001073068,0.00088142324],"domain_scores_gemma":[0.99483764,0.0021848085,0.0004653712,0.001183971,0.00069815916,0.00063002284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014169889,0.00048553318,0.0010340073,0.0002594527,0.00032164424,0.00013156161,0.0008826747,0.00020833072,0.0003755893],"category_scores_gemma":[0.0042003044,0.0004113792,0.00028660533,0.0014245835,0.00030253513,0.00031739706,0.0005059439,0.0006128298,0.00018313219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036551736,0.0006876924,0.0008728843,0.00199493,0.0005442724,0.000037599766,0.010090979,0.00024276621,0.005932236,0.9776669,0.0012573628,0.00030681788],"study_design_scores_gemma":[0.0026377537,0.0008002383,0.00091713545,0.00094944844,0.00045440614,0.0000233401,0.002079681,0.005995799,0.0067918696,0.9777825,0.0005752019,0.0009926619],"about_ca_topic_score_codex":0.000031466145,"about_ca_topic_score_gemma":0.00006174706,"teacher_disagreement_score":0.5175666,"about_ca_system_score_codex":0.00014579017,"about_ca_system_score_gemma":0.00015763556,"threshold_uncertainty_score":0.9998338},"labels":[],"label_agreement":null},{"id":"W4400596861","doi":"10.55016/ojs/cdm.v15i3.62742","title":"A classification of isomorphism-invariant random digraphs","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Commission","keywords":"Combinatorics; Mathematics; Randomness; Vertex (graph theory); Discrete mathematics; Invariant (physics); Isomorphism (crystallography); Random graph; Graph","score_opus":0.032306691093479986,"score_gpt":0.3125621024309222,"score_spread":0.2802554113374422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035415837,0.00008143039,0.98334396,0.011080591,0.000042007945,0.0006718433,0.0001637455,0.00014730607,0.0009275427],"genre_scores_gemma":[0.9212744,0.000012299644,0.07826671,0.00024931793,0.000033432356,0.000089074274,0.000014688532,0.000012711471,0.000047332265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834746,0.00011185778,0.00050025445,0.0003217094,0.00039486782,0.00032384152],"domain_scores_gemma":[0.9979122,0.00044185997,0.00018382308,0.0007345767,0.0004238195,0.0003037171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005069096,0.0001519552,0.0003487212,0.00014354679,0.00014737215,0.00008442755,0.001030485,0.000058787446,0.000024896843],"category_scores_gemma":[0.0019899195,0.00013197097,0.00014378909,0.0013106915,0.000121369776,0.00027408902,0.00030290955,0.0001528252,0.00012236548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028959746,0.000067276254,0.000031399264,0.00004545825,0.0000320175,0.0000036272456,0.001447656,0.00010527324,0.02279847,0.9743272,0.00059583556,0.0005168],"study_design_scores_gemma":[0.0035685261,0.00049072836,0.0008857495,0.00016926606,0.000070159345,0.000020108744,0.00058043696,0.45842233,0.027401043,0.5031903,0.0045630685,0.00063827756],"about_ca_topic_score_codex":0.0000016149245,"about_ca_topic_score_gemma":0.0000011301959,"teacher_disagreement_score":0.91773283,"about_ca_system_score_codex":0.0000418056,"about_ca_system_score_gemma":0.00009226346,"threshold_uncertainty_score":0.538162},"labels":[],"label_agreement":null},{"id":"W4400596866","doi":"10.55016/ojs/cdm.v15i2.62639","title":"The 2-tuple dominating independent number of a random graph","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Tuple; Graph; Dominating set; Random graph; Discrete mathematics","score_opus":0.01744434532324139,"score_gpt":0.3260284658623288,"score_spread":0.3085841205390874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073473956,0.00008720386,0.9844646,0.0056332806,0.00005820673,0.0006103532,0.000060341867,0.00009230479,0.0016462988],"genre_scores_gemma":[0.9409938,0.000016505008,0.058543798,0.0001556714,0.000038960097,0.00011113783,0.000003406408,0.000014005589,0.00012273031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982237,0.00013871328,0.00048458984,0.00025336756,0.00050044316,0.00039916587],"domain_scores_gemma":[0.9972652,0.0012533895,0.00017939723,0.00065747555,0.00041658303,0.00022792132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010172602,0.0001427328,0.00028678635,0.000050851697,0.00040594264,0.00015693484,0.0013256691,0.000045175402,0.000018647106],"category_scores_gemma":[0.003220927,0.000098016564,0.00015677931,0.0009854202,0.00014429352,0.00020158842,0.0006250586,0.00020896128,0.00010624284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031520296,0.00003576105,0.00006867238,0.000031360865,0.0000433246,0.000003957806,0.001930694,0.0001346569,0.0016570648,0.99393857,0.000323779,0.0018006305],"study_design_scores_gemma":[0.0031811015,0.00016700159,0.00011579671,0.0001248515,0.000041590672,0.000032904936,0.0015813742,0.12105208,0.018408816,0.8510984,0.0037506593,0.000445378],"about_ca_topic_score_codex":0.0000019812712,"about_ca_topic_score_gemma":0.0000025462855,"teacher_disagreement_score":0.9336464,"about_ca_system_score_codex":0.00003995222,"about_ca_system_score_gemma":0.00007195454,"threshold_uncertainty_score":0.39969996},"labels":[],"label_agreement":null},{"id":"W4400596869","doi":"10.55016/ojs/cdm.v15i2.62472","title":"Triple product sums of Catalan triangle numbers","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Catalan number; Combinatorics; Conjecture; Product (mathematics); Transformation (genetics); Catalan; Hypergeometric distribution; Quadratic equation; Pure mathematics; Geometry","score_opus":0.04524312105624283,"score_gpt":0.34983096123410956,"score_spread":0.3045878401778667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08350949,0.000406702,0.87156886,0.013036066,0.00045051237,0.005364349,0.0028542401,0.0010121239,0.021797668],"genre_scores_gemma":[0.82986504,0.000019469811,0.16417223,0.00024235698,0.00036224243,0.00028657375,0.00010072494,0.00014897529,0.0048023867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972876,0.000076639415,0.0011703232,0.00040292597,0.0005432929,0.0005192647],"domain_scores_gemma":[0.9970674,0.00081332464,0.00043160905,0.0007996835,0.00046851792,0.00041946972],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005352507,0.00034063112,0.0010294631,0.00011786125,0.00015293247,0.00006223692,0.0005418922,0.00009508082,0.00027259564],"category_scores_gemma":[0.016110957,0.00030225553,0.00029690907,0.00074932736,0.00018479358,0.00023640216,0.00026078537,0.00022176208,0.00028179013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061669096,0.00034632083,0.000036751386,0.0016074231,0.00020515658,0.000012560753,0.00770408,0.00002894409,0.008952085,0.95008814,0.030808512,0.00014834777],"study_design_scores_gemma":[0.0016984451,0.00024289278,0.00001731281,0.00036464081,0.0003924039,0.000022096536,0.0025142953,0.0015162266,0.06767421,0.91924286,0.0056395885,0.00067504816],"about_ca_topic_score_codex":0.000009025173,"about_ca_topic_score_gemma":0.000013247064,"teacher_disagreement_score":0.74635553,"about_ca_system_score_codex":0.00011808217,"about_ca_system_score_gemma":0.00011192071,"threshold_uncertainty_score":0.99994296},"labels":[],"label_agreement":null},{"id":"W4400596870","doi":"10.55016/ojs/cdm.v15i2.62352","title":"$Q_4$-Factorization of $\\lambda K_n$ and $\\lambda K_x(m)$","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Lambda; Factorization; Combinatorics; Mathematics; Graph; Physics; Algorithm","score_opus":0.008506781654910561,"score_gpt":0.22344907458835542,"score_spread":0.21494229293344486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17148934,0.0003989283,0.82240456,0.0005638098,0.00022477079,0.000635357,0.0006430835,0.00035241482,0.0032877305],"genre_scores_gemma":[0.99863946,0.000021368953,0.0010974084,0.000040223294,0.00007471918,0.000027426808,0.000036340545,0.000025814157,0.000037222817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991103,0.0000271393,0.0003853623,0.00013480708,0.00014150482,0.00020088351],"domain_scores_gemma":[0.9993398,0.000095233714,0.00006037598,0.00021222791,0.00010575815,0.0001865838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014263506,0.00016012973,0.00030939223,0.000060779323,0.000070630376,0.00003779785,0.00013084938,0.000080150654,0.000042318843],"category_scores_gemma":[0.00029389458,0.00015128912,0.000065384214,0.00034016932,0.00004311133,0.00010302858,0.000043595122,0.00009506649,0.000044231267],"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.000032157757,0.0000835512,0.0007461164,0.0019796796,0.0003372305,0.0000075647395,0.0119821,0.005534666,0.10618757,0.8680904,0.0038360453,0.0011829082],"study_design_scores_gemma":[0.0059671593,0.0012343745,0.0042377487,0.0019867956,0.0011032379,0.00009104169,0.010361758,0.4470716,0.26621553,0.18733996,0.070406325,0.003984457],"about_ca_topic_score_codex":0.0000017089073,"about_ca_topic_score_gemma":0.0000016452015,"teacher_disagreement_score":0.82715017,"about_ca_system_score_codex":0.000027529144,"about_ca_system_score_gemma":0.000011998554,"threshold_uncertainty_score":0.6169391},"labels":[],"label_agreement":null},{"id":"W4400596963","doi":"10.55016/ojs/cdm.v16i3.71007","title":"Flag vector pairs, fatness, and their bounds for 4-polytopes","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Chosun University","keywords":"Polytope; Flag (linear algebra); Combinatorics; Mathematics; Regular polygon; Function (biology); Pure mathematics; Algebra over a field; Geometry","score_opus":0.04650167863584513,"score_gpt":0.35150466674295855,"score_spread":0.3050029881071134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023370719,0.00035869482,0.9592593,0.009728802,0.000105922634,0.0014436186,0.0027280967,0.00025342466,0.002751432],"genre_scores_gemma":[0.68589455,0.00008114272,0.3000795,0.00083647657,0.00057415036,0.0025630926,0.0003871069,0.0001712892,0.009412677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812675,0.000057450066,0.00071322324,0.00039112664,0.0001939909,0.0005174469],"domain_scores_gemma":[0.995828,0.002342625,0.00016674529,0.0007831019,0.0005902599,0.00028929784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005709447,0.0003236703,0.00064734375,0.000063328196,0.00050328695,0.00024873778,0.00024462005,0.00014225514,0.00026281975],"category_scores_gemma":[0.0040264297,0.00025614875,0.00021734832,0.00032837753,0.0001244631,0.00010537819,0.00021339662,0.0001384235,0.000037226495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005160973,0.00020757066,0.0000037933182,0.0005027734,0.0000813777,0.0000012771153,0.001283434,0.0000011738766,0.002104056,0.9854552,0.009990106,0.0003640529],"study_design_scores_gemma":[0.0005392867,0.000058971124,0.000015288391,0.0002149495,0.00013133154,0.000033540717,0.0027269856,0.003723542,0.0125467535,0.93331116,0.046288725,0.00040946223],"about_ca_topic_score_codex":0.0000036949777,"about_ca_topic_score_gemma":0.000026773962,"teacher_disagreement_score":0.66252387,"about_ca_system_score_codex":0.000082025,"about_ca_system_score_gemma":0.00011736783,"threshold_uncertainty_score":0.9999891},"labels":[],"label_agreement":null},{"id":"W4400596966","doi":"10.55016/ojs/cdm.v16i3.72114","title":"On the homotopy type of complexes of graphs with bounded domination number","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Mathematics; Combinatorics; Homotopy; Bounded function; Type (biology); Assertion; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.020209359730731957,"score_gpt":0.29798672960534367,"score_spread":0.2777773698746117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16023023,0.000040762778,0.833725,0.0030802286,0.00003853326,0.00019023113,0.0002318225,0.00002602369,0.002437183],"genre_scores_gemma":[0.9722272,0.000008085654,0.027432352,0.00009350351,0.000005158997,0.000010268514,0.000029351322,0.0000027611422,0.00019129108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910426,0.000060996692,0.000265349,0.00015491419,0.00028020085,0.00013428698],"domain_scores_gemma":[0.99794126,0.00063272234,0.00014958184,0.0006141597,0.000614705,0.000047571713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026762212,0.0000859332,0.00024746676,0.00008389311,0.00010677125,0.000052832373,0.00044095,0.000031322168,0.00016146102],"category_scores_gemma":[0.001126997,0.000047826903,0.000080223974,0.002158475,0.00011084911,0.0000773667,0.00015549963,0.00006175521,0.000032944426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046717123,0.00013028743,0.000079457954,0.000011908808,0.00005562084,0.000001913478,0.00014253703,0.000033030687,0.00050906284,0.9982888,0.0005387425,0.0002039341],"study_design_scores_gemma":[0.00064198015,0.00037937966,0.0031676607,0.0001459813,0.00016720456,0.000023995404,0.00041483724,0.008849465,0.04241535,0.94169205,0.0018301008,0.00027198723],"about_ca_topic_score_codex":0.000010392064,"about_ca_topic_score_gemma":0.000011137607,"teacher_disagreement_score":0.811997,"about_ca_system_score_codex":0.000018388202,"about_ca_system_score_gemma":0.000048555117,"threshold_uncertainty_score":0.19503245},"labels":[],"label_agreement":null},{"id":"W4400596989","doi":"10.55016/ojs/cdm.v16i3.71109","title":"Starred Italian domination in graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Dominating set; Domination analysis; Neighbourhood (mathematics); Vertex (graph theory); Graph; Omega; Discrete mathematics; Physics","score_opus":0.015552851451988425,"score_gpt":0.3261180961084776,"score_spread":0.31056524465648916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02089028,0.000121223384,0.9725439,0.0037518023,0.00011127093,0.0003832725,0.00008890189,0.000105792,0.0020035796],"genre_scores_gemma":[0.8743156,0.000013659583,0.12469094,0.00013996057,0.000017820812,0.00011740334,0.00003630666,0.0000137044835,0.0006545939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840593,0.00012697825,0.00035963568,0.000337913,0.00034285715,0.0004266992],"domain_scores_gemma":[0.9982225,0.0002914836,0.000064240325,0.00080453034,0.00044781785,0.00016945144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006144079,0.00013507917,0.00022638026,0.00028296732,0.00014361425,0.00018883929,0.00060843804,0.000058678484,0.000033856315],"category_scores_gemma":[0.001597373,0.00013348694,0.000085300126,0.0018634838,0.000055086766,0.00041321732,0.00035486335,0.0001636344,0.00012648027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031095562,0.000099017125,0.00008544764,0.000019101419,0.00001051819,0.000043683387,0.00080002885,0.00013315321,0.0026124574,0.9944071,0.0002154409,0.0015709377],"study_design_scores_gemma":[0.0006933096,0.000044599412,0.00091306446,0.00010018261,0.0000066781945,0.00002633798,0.00041712847,0.021284975,0.014246897,0.96024615,0.0017480953,0.0002726108],"about_ca_topic_score_codex":0.0000026775597,"about_ca_topic_score_gemma":0.00004259824,"teacher_disagreement_score":0.8534253,"about_ca_system_score_codex":0.00016038824,"about_ca_system_score_gemma":0.00013087774,"threshold_uncertainty_score":0.544344},"labels":[],"label_agreement":null},{"id":"W4400596992","doi":"10.55016/ojs/cdm.v1i1.61879","title":"N-free extensions of posets. Note on a theorem of P.A.Grillet","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Partially ordered set; Combinatorics; Diagonal; Mathematics; Vertex (graph theory); Hasse diagram; Discrete mathematics; Enhanced Data Rates for GSM Evolution; Graph; Geometry; Computer science","score_opus":0.01532253781801179,"score_gpt":0.3206978809269528,"score_spread":0.305375343108941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400596992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16568008,0.00014750224,0.7929323,0.0020438952,0.0007115332,0.0033800672,0.0052686906,0.00044301545,0.029392937],"genre_scores_gemma":[0.84090674,0.0000066452258,0.15820625,0.000043362917,0.00012762111,0.00008734169,0.000050283234,0.0000734288,0.0004983349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966939,0.00010148073,0.0015455039,0.0003474102,0.0007794447,0.00053226977],"domain_scores_gemma":[0.9931147,0.0027137708,0.00086085865,0.0021750613,0.00096877955,0.00016680155],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074085937,0.00042080405,0.0011196529,0.00030595865,0.00016294516,0.000023588189,0.0008352223,0.00020581916,0.00005829864],"category_scores_gemma":[0.01005076,0.0003551207,0.00036534673,0.00074204156,0.00025210367,0.00009831044,0.00038156233,0.0002472204,0.000016846865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041783376,0.000816856,0.000005703328,0.00029767188,0.000052515214,0.0000047895746,0.00044297098,0.0001579452,0.007094261,0.98557717,0.0054327706,0.00007557217],"study_design_scores_gemma":[0.0012218851,0.00029583677,0.000030536867,0.0006186586,0.000193888,0.00001398395,0.00020918465,0.0008910207,0.03712987,0.95834625,0.0007049925,0.0003438999],"about_ca_topic_score_codex":0.000012422878,"about_ca_topic_score_gemma":0.000011091466,"teacher_disagreement_score":0.6752266,"about_ca_system_score_codex":0.00017200674,"about_ca_system_score_gemma":0.000112832044,"threshold_uncertainty_score":0.9998901},"labels":[],"label_agreement":null},{"id":"W4400597008","doi":"10.55016/ojs/cdm.v16i3.71250","title":"Bailey and Daum's q-Kummer Theorem and Extensions","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Mathematics; Integer (computer science); Linearization; Combinatorics; Algebra over a field; Pure mathematics; Nonlinear system; Computer science","score_opus":0.027237223760112214,"score_gpt":0.34811961973209793,"score_spread":0.3208823959719857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400597008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22689508,0.0021330067,0.7351288,0.008788991,0.00029194678,0.0017221024,0.0009365397,0.0006080886,0.023495415],"genre_scores_gemma":[0.60870063,0.00037879852,0.376554,0.00054183626,0.00020066406,0.00024947038,0.000052303574,0.00015244234,0.0131698605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980734,0.0000859042,0.0006000435,0.00043251042,0.00032142614,0.00048669317],"domain_scores_gemma":[0.9964553,0.0017786056,0.000137577,0.0007364678,0.0005142424,0.00037777697],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046405982,0.0003174752,0.0006233831,0.00010707908,0.0003937138,0.00020841138,0.00015837114,0.00012998405,0.00023182218],"category_scores_gemma":[0.008309067,0.0002758525,0.00010089964,0.00031906724,0.0002840146,0.0002310302,0.00051571464,0.00022417979,0.0000799626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004110789,0.00011909337,0.000022694252,0.00023787061,0.000061702325,0.000030890245,0.001032411,0.000001674133,0.0019631141,0.9937861,0.0025534043,0.00018694118],"study_design_scores_gemma":[0.00045770832,0.000035625755,0.000111698464,0.00034062617,0.00021386116,0.00021212564,0.0023216526,0.0007869929,0.0034296168,0.9894214,0.0023075265,0.00036113462],"about_ca_topic_score_codex":0.0000026501568,"about_ca_topic_score_gemma":0.00002635004,"teacher_disagreement_score":0.38180554,"about_ca_system_score_codex":0.00006740834,"about_ca_system_score_gemma":0.000068141955,"threshold_uncertainty_score":0.99996936},"labels":[],"label_agreement":null},{"id":"W4400597021","doi":"10.55016/ojs/cdm.v1i1.61883","title":"Convolution over Lie and Jordan algebras","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Saskatchewan","keywords":"Mathematics; Convolution (computer science); Non-associative algebra; Class (philosophy); Commutative property; Pure mathematics; Lie algebra; Associative property; Jordan algebra; Subalgebra; Lie conformal algebra; Set (abstract data type); Algebra over a field; Algebra representation; Computer science","score_opus":0.016267927703843398,"score_gpt":0.31707918417331477,"score_spread":0.3008112564694714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400597021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49073532,0.0002679118,0.5008557,0.0012781818,0.00018724488,0.0009384798,0.00031237898,0.00032279844,0.0051020174],"genre_scores_gemma":[0.8522658,0.000013815377,0.14448339,0.00015561956,0.00033833017,0.00012931462,0.00005861571,0.000068475034,0.0024866662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815196,0.000049068443,0.00062034925,0.0003498623,0.00033113614,0.00049761235],"domain_scores_gemma":[0.9981599,0.0005960088,0.00020603267,0.00062271743,0.00023653793,0.00017879372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036777902,0.0002958418,0.00043246138,0.00014262681,0.00031485176,0.00010490971,0.0002193143,0.0001484472,0.00012931973],"category_scores_gemma":[0.0015613772,0.00027755514,0.00010227736,0.00031847603,0.00016450121,0.0001912215,0.00019905064,0.0002117916,0.00010486773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005309419,0.00010842694,0.0001245999,0.00007683926,0.000027108596,0.0000050235994,0.00015899175,0.0000031020545,0.0009037293,0.99366355,0.004765302,0.00015799479],"study_design_scores_gemma":[0.0006213197,0.000047539237,0.0007137475,0.00010014661,0.00009493964,0.000027872695,0.00010220567,0.00052874815,0.0019494926,0.98830694,0.007163039,0.00034402273],"about_ca_topic_score_codex":0.000014678245,"about_ca_topic_score_gemma":0.000046122823,"teacher_disagreement_score":0.36153045,"about_ca_system_score_codex":0.0002141168,"about_ca_system_score_gemma":0.000047204045,"threshold_uncertainty_score":0.99996763},"labels":[],"label_agreement":null},{"id":"W4400597037","doi":"10.55016/ojs/cdm.v16i3.71273","title":"Oriented unicyclic graphs with minimal skew Randić energy","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Sigma; Graph; Skew-symmetric matrix; Skew; Eigenvalues and eigenvectors; Physics; Symmetric matrix; Square matrix","score_opus":0.014509283144606405,"score_gpt":0.29761211877887217,"score_spread":0.28310283563426575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400597037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12754168,0.0002419259,0.85672045,0.0023070287,0.00010245997,0.0007260837,0.00090378313,0.00041364925,0.011042928],"genre_scores_gemma":[0.88161004,0.00003814688,0.11175939,0.0003750273,0.000090890295,0.00059699593,0.00028242817,0.00008970069,0.005157417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805063,0.000121979676,0.0005669663,0.00041354971,0.0003355683,0.0005112767],"domain_scores_gemma":[0.9971275,0.0007294679,0.00019068383,0.0010453195,0.00059670483,0.00031032498],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032683986,0.00031485513,0.0005129865,0.00015283366,0.00047219923,0.00009030302,0.00029922655,0.00012508582,0.0002462784],"category_scores_gemma":[0.00081023877,0.0002589532,0.00020880518,0.0013220287,0.00015873279,0.00010659878,0.00013733869,0.00017839705,0.00007743669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022940587,0.00035840526,0.000022680428,0.00004618964,0.00014386352,0.00002047946,0.0004260313,0.0000038849303,0.001505494,0.9946265,0.0026265786,0.00019692376],"study_design_scores_gemma":[0.0013703058,0.00009778818,0.000043010714,0.00019874211,0.00034132457,0.00011578274,0.0007731017,0.0004598176,0.013723976,0.9515043,0.030908965,0.00046286726],"about_ca_topic_score_codex":0.0000045389675,"about_ca_topic_score_gemma":0.00006456403,"teacher_disagreement_score":0.7540683,"about_ca_system_score_codex":0.000071018636,"about_ca_system_score_gemma":0.00014648304,"threshold_uncertainty_score":0.9999863},"labels":[],"label_agreement":null},{"id":"W4403969767","doi":"10.55016/ojs/cdm.v19i3.74134","title":"A linear time approach to three-dimensional reconstruction by discrete tomography","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Università Cattolica del Sacro Cuore; Monash University","keywords":"Mathematics; Tomography; Algorithm; Applied mathematics; Mathematical optimization; Medicine; Radiology","score_opus":0.009945675056371128,"score_gpt":0.27015537570318493,"score_spread":0.2602097006468138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403969767","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009277003,0.00030126466,0.9870292,0.002710829,0.00016675836,0.0006946423,0.00046733892,0.0016996998,0.0060025477],"genre_scores_gemma":[0.07932033,0.0000019657973,0.91870284,0.0003271255,0.00009755689,0.00029073952,0.000098002805,0.000046342648,0.0011150759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792385,0.000031668056,0.0004757853,0.0006568209,0.0004361379,0.00047571657],"domain_scores_gemma":[0.99840957,0.00014188488,0.0000714306,0.00075550826,0.00030064906,0.00032098067],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00046933308,0.0002983508,0.00032735334,0.00037723937,0.0002211406,0.0011148602,0.0008789795,0.00010759996,0.000014123179],"category_scores_gemma":[0.00032277155,0.00025772944,0.0001791469,0.0016308818,0.00010258079,0.0010206788,0.0005426618,0.00021348133,0.0005459976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028962588,0.0007751088,0.00002689778,0.00067760644,0.00043054039,0.00003890467,0.0019127438,0.00043302277,0.03379414,0.6321691,0.24084722,0.08886574],"study_design_scores_gemma":[0.00018145575,0.0001928523,0.000010723336,0.000767403,0.00006345552,0.00022707228,0.000018653778,0.8098752,0.013437072,0.16182822,0.01259638,0.00080152793],"about_ca_topic_score_codex":0.0000052341493,"about_ca_topic_score_gemma":9.587736e-7,"teacher_disagreement_score":0.80944216,"about_ca_system_score_codex":0.00014014596,"about_ca_system_score_gemma":0.000114827104,"threshold_uncertainty_score":0.9999875},"labels":[],"label_agreement":null},{"id":"W4403969777","doi":"10.55016/ojs/cdm.v19i2.72712","title":"Combinatorial proof of Girard-Waring formula","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorial proof; Mathematics; Combinatorics; Combinatorial analysis; Combinatorial algorithms","score_opus":0.008893299956262939,"score_gpt":0.3094824492079608,"score_spread":0.3005891492516979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403969777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00495678,0.0000591592,0.97029406,0.00040694218,0.00015443766,0.00058223953,0.0006121715,0.00008028731,0.022853909],"genre_scores_gemma":[0.98719674,6.384076e-7,0.01192785,0.0000072359558,0.00020728075,0.00019826532,0.000043922184,0.000022698745,0.00039536264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904424,0.000009971186,0.00038980614,0.00017118521,0.00014934674,0.00023546474],"domain_scores_gemma":[0.9991097,0.0002483809,0.00006498677,0.00032979928,0.00013808472,0.0001090588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017258756,0.00014101696,0.0002691576,0.000054970602,0.000121438636,0.00006479987,0.0001751436,0.000032826658,0.00020853491],"category_scores_gemma":[0.000083953746,0.00011639589,0.00014513724,0.00033784224,0.0000654295,0.00010731645,0.00010803048,0.00011600594,0.000075744414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002200605,0.000094429524,0.0000065386193,0.00010576198,0.000052951447,2.803847e-7,0.00030655746,0.000080373444,0.0007488209,0.99663615,0.0002692663,0.0016966638],"study_design_scores_gemma":[0.0001673037,0.00003166263,0.0000021656024,0.00018772295,0.000064937514,7.986578e-7,0.00027080413,0.005119061,0.019098595,0.96484107,0.010074417,0.000141468],"about_ca_topic_score_codex":0.0000033570643,"about_ca_topic_score_gemma":1.6124916e-7,"teacher_disagreement_score":0.98223996,"about_ca_system_score_codex":0.00003477769,"about_ca_system_score_gemma":0.00004982191,"threshold_uncertainty_score":0.47464865},"labels":[],"label_agreement":null},{"id":"W4403969779","doi":"10.55016/ojs/cdm.v19i3.68835","title":"Uniformly resolvable ${P_4, C_k}$-decomposition of $K_n$ - a complete solution","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Atomic Energy, Government of India; University Grants Commission","keywords":"Mathematics; Combinatorics; Decomposition; Discrete mathematics; Chemistry; Organic chemistry","score_opus":0.010436032785876681,"score_gpt":0.26578712690123246,"score_spread":0.2553510941153558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403969779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059657738,0.001691534,0.9225551,0.00033024966,0.00070866896,0.0007564241,0.001703846,0.00085235917,0.011744079],"genre_scores_gemma":[0.9964866,0.00002280286,0.002952335,0.000010440443,0.000078979516,0.000073109026,0.00012733259,0.000034327186,0.00021408436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988263,0.000036429396,0.0004939687,0.00015305492,0.00018361463,0.0003065886],"domain_scores_gemma":[0.99925864,0.00013778756,0.000039824918,0.00033975838,0.000114195245,0.00010982213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041214583,0.00017954929,0.00030132715,0.00021563018,0.00012263148,0.00008383758,0.00017040658,0.00009421627,0.00006832297],"category_scores_gemma":[0.000060085906,0.00016861579,0.00014777722,0.0005273751,0.00005447885,0.00017349068,0.000039113784,0.00014219119,0.00026245796],"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.0000129603195,0.000057108056,0.0000062905915,0.0014125168,0.00022815962,0.00000989054,0.0016289172,0.007461439,0.10568597,0.8755242,0.0073981932,0.00057430624],"study_design_scores_gemma":[0.0006061299,0.0002155186,0.0001240744,0.0023992318,0.00030117383,0.0001000692,0.00073013443,0.7857209,0.026452405,0.13184209,0.050748527,0.0007597716],"about_ca_topic_score_codex":0.0000073966817,"about_ca_topic_score_gemma":0.000008266889,"teacher_disagreement_score":0.93682885,"about_ca_system_score_codex":0.00013136533,"about_ca_system_score_gemma":0.000026058737,"threshold_uncertainty_score":0.68759525},"labels":[],"label_agreement":null},{"id":"W4403975908","doi":"10.55016/ojs/cdm.v19i2.75062","title":"Tilings of a honeycomb strip and higher order Fibonacci numbers","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Fibonacci number; Mathematics; Combinatorics; Order (exchange); Honeycomb; Geometry","score_opus":0.009778313946547112,"score_gpt":0.27882501780632063,"score_spread":0.26904670385977353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975908","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95834947,0.0031448563,0.02811533,0.0031645484,0.00066502433,0.0006322455,0.0014875337,0.00023394614,0.0042070393],"genre_scores_gemma":[0.992517,0.00002181821,0.006098711,0.00006321203,0.00006346344,0.00002066298,0.000012406027,0.000016569238,0.0011861653],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990892,0.000024811816,0.000294738,0.00019366453,0.00017758131,0.00022002158],"domain_scores_gemma":[0.9993821,0.00012298231,0.000048276033,0.0002108414,0.0001360791,0.00009976566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023481788,0.00013458662,0.00023730668,0.000052188356,0.000098738914,0.00015569398,0.0001363484,0.000063941385,0.00064435985],"category_scores_gemma":[0.00017659093,0.000095697775,0.000050510258,0.00023902785,0.000119464916,0.000112851056,0.00011729874,0.000075295495,0.00007953844],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045719185,0.00006292757,0.000033320397,0.0010689603,0.00007872417,0.000012645963,0.003993724,0.00006875234,0.58780485,0.39413834,0.010976167,0.0017158798],"study_design_scores_gemma":[0.0015824075,0.00069414085,0.0012046099,0.0023411324,0.0005481529,0.0001650879,0.0019312892,0.010003803,0.39993906,0.3460914,0.2338429,0.001656059],"about_ca_topic_score_codex":0.00005059107,"about_ca_topic_score_gemma":0.000008277562,"teacher_disagreement_score":0.22286673,"about_ca_system_score_codex":0.00003541593,"about_ca_system_score_gemma":0.000048324684,"threshold_uncertainty_score":0.70552886},"labels":[],"label_agreement":null},{"id":"W4403975911","doi":"10.55016/ojs/cdm.v19i3.74917","title":"Reflexible covers of prisms","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Optics and Image Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.012397782149606924,"score_gpt":0.2903778717439958,"score_spread":0.2779800895943889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06622784,0.00079968583,0.74213356,0.010644697,0.00069375185,0.00092270144,0.00035988932,0.0005350068,0.17768285],"genre_scores_gemma":[0.99357736,0.0000126773175,0.0037716215,0.00031993477,0.000304591,0.000021149432,0.00006254552,0.000023379793,0.0019067549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991184,0.0000028969373,0.0003194393,0.0001608412,0.00019914623,0.000199291],"domain_scores_gemma":[0.99920386,0.000058296813,0.00008013218,0.00028336112,0.00035677772,0.000017574313],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029334804,0.000116763345,0.00022618724,0.00029979885,0.000090500005,0.0004102598,0.00017428632,0.0000406008,0.00027288077],"category_scores_gemma":[0.00047081502,0.0000972315,0.0001532556,0.0009549706,0.000039675622,0.00050253957,0.00013177555,0.00007333176,0.00083040225],"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.000004909941,0.000067235356,0.000048453312,0.00040909497,0.00013954025,0.000008308288,0.00008921721,0.00021041192,0.0039245007,0.9761406,0.01785532,0.0011023784],"study_design_scores_gemma":[0.00049534306,0.000044216064,0.0001931301,0.00077154214,0.0011994394,0.0000041402527,0.0007867952,0.24180809,0.004048669,0.17648585,0.573507,0.0006557738],"about_ca_topic_score_codex":0.000038471997,"about_ca_topic_score_gemma":0.0000078941675,"teacher_disagreement_score":0.9273495,"about_ca_system_score_codex":0.00003746558,"about_ca_system_score_gemma":0.000031325664,"threshold_uncertainty_score":0.99994755},"labels":[],"label_agreement":null},{"id":"W4403975920","doi":"10.55016/ojs/cdm.v19i3.74589","title":"The interlacing properties of generalized Narayana polynomials","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Interlacing; Mathematics; Combinatorics; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.03486424669583746,"score_gpt":0.34345029246839304,"score_spread":0.30858604577255555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23377302,0.0053520086,0.74279284,0.0063158027,0.0027986043,0.0038017598,0.00040111277,0.0011402925,0.0036245263],"genre_scores_gemma":[0.9663402,0.000057525245,0.031123862,0.000032705768,0.0002496265,0.00028661202,0.0000047086482,0.000098399105,0.0018063987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973627,0.00011828129,0.001205574,0.00030247064,0.00048091912,0.0005300679],"domain_scores_gemma":[0.99660665,0.0015875191,0.0002523397,0.000957751,0.0004377879,0.00015794722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012284112,0.0003389358,0.00064717093,0.00016362181,0.00038262556,0.00026565825,0.0006317337,0.000118888536,0.000026591684],"category_scores_gemma":[0.0061723217,0.00021381355,0.00028768918,0.0006038706,0.00021621503,0.0001856769,0.00029449997,0.00025441163,0.00009882264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020207326,0.000074660325,7.6471986e-7,0.00063236046,0.000176333,0.000004046242,0.0025035196,0.000019718645,0.019709924,0.97302943,0.0032984396,0.0005305741],"study_design_scores_gemma":[0.00034253896,0.00008820854,7.1938496e-7,0.0015025091,0.00020455764,0.000027263022,0.0010099916,0.0063029877,0.06785613,0.9156461,0.0066875024,0.0003314916],"about_ca_topic_score_codex":0.0000060375364,"about_ca_topic_score_gemma":0.00001087169,"teacher_disagreement_score":0.73256713,"about_ca_system_score_codex":0.00025462988,"about_ca_system_score_gemma":0.00016414239,"threshold_uncertainty_score":0.87190634},"labels":[],"label_agreement":null},{"id":"W4403975924","doi":"10.55016/ojs/cdm.v19i3.75984","title":"A new trigonometric identity with applications","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Scientific Research and Discoveries","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Identity (music); Trigonometry; Combinatorics; Geometry; Art; Aesthetics","score_opus":0.012579075943925634,"score_gpt":0.3272360181337652,"score_spread":0.31465694218983953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020230908,0.00022505922,0.978118,0.0009067686,0.000061649924,0.0006338377,0.00076405844,0.000089573834,0.01717795],"genre_scores_gemma":[0.9608374,0.0000032894814,0.019560857,0.000020171958,0.00043016227,0.00052251905,0.0002047121,0.000025238322,0.018395638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897474,0.000012148885,0.0001948247,0.00024607583,0.00027606857,0.00029616858],"domain_scores_gemma":[0.99907583,0.00012864533,0.000028117738,0.00035905142,0.00011912158,0.00028925156],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00021328196,0.000118766715,0.00015060209,0.0002481293,0.00020748377,0.00081619294,0.00024896645,0.000018051893,0.0010208229],"category_scores_gemma":[0.000045167722,0.0000867423,0.0000887779,0.001911916,0.000051939547,0.00042367022,0.00008261086,0.00010426948,0.0010832313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004109715,0.000045021985,0.00016181715,0.000029904128,0.00006935554,0.0000011117015,0.00019783701,0.000028332242,0.00013368741,0.98003906,0.015406603,0.003883163],"study_design_scores_gemma":[0.00078838225,0.00014497603,0.0005473473,0.00023057716,0.0002146033,0.0000072766647,0.0019874743,0.003647068,0.0037223613,0.66260016,0.32547075,0.00063901144],"about_ca_topic_score_codex":0.000056739464,"about_ca_topic_score_gemma":0.000009277952,"teacher_disagreement_score":0.9588143,"about_ca_system_score_codex":0.00005622903,"about_ca_system_score_gemma":0.0003071645,"threshold_uncertainty_score":0.99989235},"labels":[],"label_agreement":null},{"id":"W4403975939","doi":"10.55016/ojs/cdm.v19i2.62694","title":"Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete t-partite graph","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Combinatorics; Spanning tree; Mathematics; Discrete mathematics; Minimum spanning tree; Kruskal's algorithm; Minimum degree spanning tree; Trémaux tree; Graph; Line graph; Pathwidth","score_opus":0.0337211460636568,"score_gpt":0.29924187987234085,"score_spread":0.2655207338086841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14550951,0.002185099,0.8449744,0.003645668,0.00054671423,0.0015979799,0.00070561183,0.000595715,0.00023932372],"genre_scores_gemma":[0.92323357,0.00003418517,0.07593866,0.00027413742,0.000028430584,0.00027531578,0.00008869965,0.000047310157,0.00007969303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99605894,0.00012941204,0.0011301294,0.0010158756,0.0006507906,0.0010148762],"domain_scores_gemma":[0.9973846,0.00086954347,0.00020543447,0.00079470914,0.00032778495,0.00041794387],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014087555,0.0005264225,0.0007997878,0.0010417957,0.00058344816,0.0010704654,0.0008725353,0.00017689198,0.000012547356],"category_scores_gemma":[0.0003584326,0.00048188327,0.00030146062,0.0014004575,0.00021351993,0.0005335904,0.00060725486,0.00044879186,0.000045931516],"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.000030263085,0.00018473003,0.00087034184,0.00024149708,0.00016485507,0.00006155517,0.003766819,0.0028684977,0.0075424635,0.9808614,0.0013657318,0.0020418002],"study_design_scores_gemma":[0.002020335,0.0004661562,0.0062423637,0.0014471443,0.00014295419,0.0001363492,0.00061219087,0.5604764,0.00077969907,0.42277423,0.0038636543,0.0010384974],"about_ca_topic_score_codex":0.00009150964,"about_ca_topic_score_gemma":0.00028526623,"teacher_disagreement_score":0.7777241,"about_ca_system_score_codex":0.0001241175,"about_ca_system_score_gemma":0.00011766,"threshold_uncertainty_score":0.9999665},"labels":[],"label_agreement":null},{"id":"W4403975941","doi":"10.55016/ojs/cdm.v19i3.72392","title":"Canonical cuts of path powers","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"History and Theory of Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Path (computing); Combinatorics; Computer science","score_opus":0.021397908840977906,"score_gpt":0.3312595906425476,"score_spread":0.3098616818015697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08543854,0.0010172253,0.8468584,0.002664197,0.001187114,0.001842149,0.0018970909,0.0010414287,0.058053844],"genre_scores_gemma":[0.9266281,0.00001985988,0.06638463,0.00007884233,0.00017421335,0.00010610954,0.000030262938,0.00010409581,0.0064738607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99769855,0.00009647478,0.00093135575,0.00033379032,0.0004775619,0.0004622679],"domain_scores_gemma":[0.99692136,0.001572634,0.00015913635,0.00080207473,0.00026643023,0.0002783754],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012522095,0.0003147718,0.0006615924,0.00023125955,0.00016896165,0.00007263389,0.0004356951,0.00017083634,0.000508636],"category_scores_gemma":[0.0028546632,0.0002665539,0.00033674575,0.0005444637,0.00020829913,0.00014027153,0.00014093766,0.00028579598,0.00042567606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001094641,0.00020635978,0.0000017817787,0.0008875444,0.00013435628,0.000027858596,0.0040103327,0.0000061230835,0.0012787845,0.9735349,0.019616498,0.00028452798],"study_design_scores_gemma":[0.00028606583,0.00014190884,0.000003460684,0.0011122626,0.00028890147,0.000064846456,0.0006217738,0.0025510713,0.0025776513,0.949614,0.042340495,0.00039756732],"about_ca_topic_score_codex":0.0000035580408,"about_ca_topic_score_gemma":0.0000070925603,"teacher_disagreement_score":0.84118956,"about_ca_system_score_codex":0.00023725918,"about_ca_system_score_gemma":0.00027401076,"threshold_uncertainty_score":0.99997866},"labels":[],"label_agreement":null},{"id":"W4403975959","doi":"10.55016/ojs/cdm.v19i3.75377","title":"Split lattice paths and Rogers-Ramanujan type identities","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Ramanujan's sum; Type (biology); Lattice (music); Biology; Physics; Paleontology","score_opus":0.029934202469222636,"score_gpt":0.3631547433422232,"score_spread":0.33322054087300057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24781607,0.0061071943,0.69051975,0.00550314,0.0018929513,0.0036663169,0.0015732163,0.0032643476,0.039657038],"genre_scores_gemma":[0.6910744,0.00040777388,0.24849282,0.0002948104,0.0007084755,0.00042650301,0.00009001232,0.0003530119,0.058152217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976955,0.00005782333,0.0007326613,0.00045428626,0.00047200863,0.0005877242],"domain_scores_gemma":[0.99692744,0.001662181,0.00010364596,0.0006651935,0.00034053464,0.000301018],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006713548,0.00038429766,0.00058752607,0.0002584309,0.00029156936,0.00066208804,0.00031055618,0.00015190309,0.00031104867],"category_scores_gemma":[0.0041458295,0.0003372713,0.00015468708,0.00058540027,0.00023011991,0.0004997151,0.0003416416,0.00030337807,0.00076077494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055761247,0.00006935523,0.000005552636,0.0012131149,0.00011579252,0.00004454314,0.0020552315,0.0000033167194,0.00040955318,0.988286,0.00757094,0.00022100491],"study_design_scores_gemma":[0.00018826935,0.000075429976,0.00001295072,0.0007596402,0.00031657852,0.00010816679,0.0013923909,0.0033061276,0.0008718878,0.98662204,0.0059234006,0.00042314897],"about_ca_topic_score_codex":0.000004109463,"about_ca_topic_score_gemma":0.000010867774,"teacher_disagreement_score":0.4432583,"about_ca_system_score_codex":0.00018676958,"about_ca_system_score_gemma":0.0000848884,"threshold_uncertainty_score":0.9999079},"labels":[],"label_agreement":null},{"id":"W4403975962","doi":"10.55016/ojs/cdm.v19i3.72148","title":"Multicolor compositions and conjugation of N-color compositions","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Pigment Synthesis and Properties","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Chemistry","score_opus":0.012731199784279912,"score_gpt":0.2859918584628363,"score_spread":0.2732606586785564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80507517,0.0019905483,0.14651212,0.0074482714,0.0002202777,0.0008745907,0.0074346806,0.0005408407,0.029903524],"genre_scores_gemma":[0.9931463,0.00003695138,0.005995494,0.000037970298,0.000057545778,0.00012737827,0.00013359111,0.000017594002,0.00044719854],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991025,0.000017806413,0.00037547352,0.00017861006,0.00014589871,0.00017974967],"domain_scores_gemma":[0.9990483,0.00042709935,0.000058981288,0.00022112932,0.00014065501,0.00010381827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013856715,0.00014112363,0.0002501476,0.000089596266,0.00020560896,0.000101151985,0.000104742074,0.000075793076,0.0003948042],"category_scores_gemma":[0.00018048314,0.00011919779,0.00008517406,0.00014286069,0.00012924266,0.000110737754,0.00006941283,0.00009903323,0.00007223296],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020425627,0.00020974147,0.000041229014,0.00090346835,0.00018931631,0.000004642466,0.0015870507,0.0001311492,0.6377052,0.3575282,0.00092415494,0.00075540075],"study_design_scores_gemma":[0.0011221122,0.00021036302,0.0004337572,0.0040521338,0.0009936068,0.00009025891,0.0019825152,0.19977538,0.7420408,0.017981354,0.03041575,0.0009019841],"about_ca_topic_score_codex":0.000011287996,"about_ca_topic_score_gemma":0.000005633953,"teacher_disagreement_score":0.33954686,"about_ca_system_score_codex":0.00007464529,"about_ca_system_score_gemma":0.000046087964,"threshold_uncertainty_score":0.48607448},"labels":[],"label_agreement":null},{"id":"W4403975967","doi":"10.55016/ojs/cdm.v19i3.74031","title":"Unified framework for tableau models of Grothendieck Polynomials","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Algebra over a field; Pure mathematics","score_opus":0.024598212673889248,"score_gpt":0.30908797722307413,"score_spread":0.2844897645491849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014385055,0.000326033,0.9925595,0.0032319028,0.0004395672,0.00077991,0.00037452628,0.000245426,0.0006046598],"genre_scores_gemma":[0.6464044,0.0000070994615,0.3528988,0.00010433198,0.00013826329,0.00014220871,0.000017316383,0.000016288372,0.00027128172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987016,0.000026973741,0.00046936027,0.00029549183,0.0001860821,0.00032050957],"domain_scores_gemma":[0.9982961,0.0008355001,0.00009208359,0.00046747862,0.00017955006,0.00012930922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042016932,0.00016111512,0.00031040263,0.00017827969,0.00012757565,0.0002205079,0.0005725451,0.00008794676,0.000010738253],"category_scores_gemma":[0.00040906,0.00013892981,0.00016720247,0.0005700818,0.00003917467,0.00034397162,0.00018387602,0.00009767433,0.000040908984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043002615,0.000035329915,2.396903e-7,0.00012076578,0.00004073066,9.959646e-7,0.0010422473,0.0014691042,0.0007619658,0.991578,0.0011884563,0.0037578815],"study_design_scores_gemma":[0.00010287214,0.000053493375,0.0000029477117,0.00019137193,0.000021247373,0.000003230626,0.000028372016,0.37572652,0.0036188867,0.61873215,0.0014021128,0.00011678706],"about_ca_topic_score_codex":0.000008843172,"about_ca_topic_score_gemma":0.000001796963,"teacher_disagreement_score":0.6449659,"about_ca_system_score_codex":0.0000821549,"about_ca_system_score_gemma":0.00016299837,"threshold_uncertainty_score":0.56653935},"labels":[],"label_agreement":null},{"id":"W4403975975","doi":"10.55016/ojs/cdm.v19i3.62807","title":"The Fractional Local Metric Dimension of Graphs","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Metric dimension; Dimension (graph theory); Metric (unit); Discrete mathematics; Graph; Chordal graph; 1-planar graph","score_opus":0.01030655384091915,"score_gpt":0.27721046390645254,"score_spread":0.2669039100655334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029626177,0.0020989222,0.989272,0.0041382685,0.0005508428,0.00022694498,0.00004518343,0.00020432439,0.00050090946],"genre_scores_gemma":[0.98082745,0.000047223635,0.01878269,0.00007612259,0.000008933565,0.00003209552,0.0000062841536,0.000009066893,0.00021011953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864423,0.000046355708,0.00040555914,0.00023810109,0.00040824173,0.00025752618],"domain_scores_gemma":[0.9980562,0.00086497783,0.00007156094,0.00055520283,0.00033339416,0.00011870358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076927344,0.00012498745,0.00016956098,0.00026323917,0.000342951,0.00020568627,0.0004636279,0.000056375222,0.0000070862384],"category_scores_gemma":[0.00043308493,0.00007837536,0.00014594341,0.0017392983,0.00012445632,0.00016811228,0.00021042424,0.00015151424,0.00013810511],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015222602,0.000033701846,0.0000045009097,0.00002389596,0.000038989594,0.0000026833686,0.00015665738,0.0006441807,0.00065790577,0.9919562,0.003412049,0.0030677584],"study_design_scores_gemma":[0.00012792593,0.00007634325,0.000042342035,0.0001475074,0.000036765545,0.000024293999,0.00009842552,0.30762094,0.0033008428,0.68055326,0.007829487,0.00014186732],"about_ca_topic_score_codex":0.000008395046,"about_ca_topic_score_gemma":0.000002160461,"teacher_disagreement_score":0.97786486,"about_ca_system_score_codex":0.000047919268,"about_ca_system_score_gemma":0.000098114884,"threshold_uncertainty_score":0.31960544},"labels":[],"label_agreement":null},{"id":"W4403975977","doi":"10.55016/ojs/cdm.v19i2.62669","title":"Combinatorial results for order-preserving partial injective contraction mappings","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Fixed Point Theorems Analysis","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Injective function; Mathematics; Combinatorics; Contraction (grammar); Order (exchange); Combinatorial analysis; Discrete mathematics; Biology","score_opus":0.024771959614914414,"score_gpt":0.34521346992037955,"score_spread":0.32044151030546514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012581091,0.00012527431,0.967748,0.0055109123,0.0016129159,0.002425246,0.0028562562,0.00077380287,0.006366523],"genre_scores_gemma":[0.9460136,0.000011594357,0.049439542,0.000095020194,0.0012941771,0.0009430376,0.0003214849,0.00014009749,0.0017414362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971949,0.00011424262,0.001047227,0.0005660121,0.00044282404,0.00063477975],"domain_scores_gemma":[0.99414694,0.0036508937,0.00023940435,0.000757728,0.0009765663,0.00022844502],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019650033,0.00036779535,0.0006665629,0.0003355769,0.0004177583,0.0003856178,0.00038075633,0.00023774977,0.00008081347],"category_scores_gemma":[0.017848397,0.0003314454,0.0003853759,0.00100708,0.00009381023,0.00034004875,0.00018330028,0.0003371615,0.00017114558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013725519,0.00013986186,0.0000012304647,0.0003426364,0.00041418933,0.0000066628822,0.0021969378,0.000067726905,0.0015452395,0.96616304,0.02877937,0.00020587168],"study_design_scores_gemma":[0.0013943991,0.00018037605,0.000004587539,0.00049907365,0.00065988244,0.000015516669,0.00069973175,0.06500548,0.0042896178,0.8932611,0.033547614,0.00044264822],"about_ca_topic_score_codex":0.000035249275,"about_ca_topic_score_gemma":0.000035230885,"teacher_disagreement_score":0.9334325,"about_ca_system_score_codex":0.00044820047,"about_ca_system_score_gemma":0.00018309058,"threshold_uncertainty_score":0.99991375},"labels":[],"label_agreement":null},{"id":"W4403975978","doi":"10.55016/ojs/cdm.v19i2.73812","title":"Lattice paths in corridors and cyclic corridors","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lattice (music); Combinatorics; Mathematics; Physics","score_opus":0.02055935184930199,"score_gpt":0.3458147296163022,"score_spread":0.32525537776700025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403975978","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5235833,0.001498115,0.45573282,0.0037511752,0.0023498915,0.0037622938,0.0007974788,0.0015613463,0.006963593],"genre_scores_gemma":[0.9251737,0.00008125005,0.072428405,0.00015690154,0.0002406235,0.00037768346,0.000026432412,0.00017103848,0.0013439336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99712384,0.000096955766,0.0010271502,0.00056251074,0.00047031677,0.000719235],"domain_scores_gemma":[0.9959226,0.0026022056,0.00015164977,0.0007850527,0.00019828657,0.0003401588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009636054,0.0004674454,0.0007678242,0.00042898947,0.00018261731,0.00026466846,0.00038184167,0.0002147906,0.00007005258],"category_scores_gemma":[0.0055808187,0.00042432567,0.00014779295,0.0010949175,0.00014406006,0.0003161156,0.00031187432,0.00049640506,0.00026104815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012205025,0.00019891627,0.000039211856,0.0008133955,0.000060880506,0.0000887097,0.0031748512,0.000048321614,0.0004551359,0.99222785,0.0020615878,0.00081891066],"study_design_scores_gemma":[0.00061550445,0.00010545682,0.000052106083,0.0012152089,0.00016204035,0.00009376994,0.00091718324,0.020972718,0.0005222942,0.9700204,0.004763973,0.00055931136],"about_ca_topic_score_codex":0.000008663063,"about_ca_topic_score_gemma":0.000030166148,"teacher_disagreement_score":0.40159044,"about_ca_system_score_codex":0.000381569,"about_ca_system_score_gemma":0.00012371023,"threshold_uncertainty_score":0.9998208},"labels":[],"label_agreement":null},{"id":"W4403976072","doi":"10.55016/ojs/cdm.v19i3.74733","title":"Noncrystallographic tail-triangle C-groups of rank 4 and interlacing number 2","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Materials and Mechanics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Commission on Higher Education","keywords":"Interlacing; Mathematics; Combinatorics; Rank (graph theory); Computer science; Artificial intelligence","score_opus":0.005477877879873135,"score_gpt":0.2520836286754161,"score_spread":0.24660575079554298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403976072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13125132,0.00091002835,0.86466664,0.000084394036,0.0004638843,0.00033897563,0.0004639825,0.0003421577,0.001478629],"genre_scores_gemma":[0.9901173,0.00014105857,0.009509106,0.000008987022,0.000058778394,0.000038082555,0.000018906414,0.00003340346,0.000074337804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999259,0.000009963292,0.00031486523,0.00012594779,0.000086985725,0.00020325776],"domain_scores_gemma":[0.9995413,0.000098668184,0.000023614848,0.00018654585,0.0000627182,0.00008719329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019467213,0.00013926202,0.00027859703,0.000091114096,0.00004095107,0.00006771106,0.00007804813,0.00006564569,0.0000892356],"category_scores_gemma":[0.00011923056,0.00012451959,0.0000708651,0.0002450138,0.000028403438,0.0001226693,0.000056630244,0.00008211615,0.000028455059],"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.000015897847,0.000045501143,0.000011405755,0.0028278988,0.00028606626,0.000025509613,0.0025657427,0.001445533,0.41527206,0.5724526,0.0020492193,0.003002567],"study_design_scores_gemma":[0.0021048086,0.0002873455,0.000055980963,0.004623474,0.0007366497,0.00026432856,0.0023215027,0.44016755,0.16905175,0.32420895,0.05439451,0.0017831593],"about_ca_topic_score_codex":0.0000014735925,"about_ca_topic_score_gemma":0.0000035200862,"teacher_disagreement_score":0.85886604,"about_ca_system_score_codex":0.000037658767,"about_ca_system_score_gemma":0.000010831286,"threshold_uncertainty_score":0.5077762},"labels":[],"label_agreement":null},{"id":"W4403976080","doi":"10.55016/ojs/cdm.v19i3.72597","title":"Some results about star-factors in graphs","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Star (game theory); Combinatorics; Mathematics","score_opus":0.026070265175263486,"score_gpt":0.3353275022472045,"score_spread":0.30925723707194097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403976080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9565961,0.0009612293,0.023430627,0.004677492,0.0005137208,0.0023609423,0.005517696,0.0011022221,0.0048400033],"genre_scores_gemma":[0.9901225,0.000050405408,0.008070808,0.00006682334,0.000104921404,0.0002864449,0.00014011099,0.00005609624,0.0011019044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786377,0.00007938799,0.0008386871,0.00042263474,0.00027908167,0.0005164165],"domain_scores_gemma":[0.9973086,0.0014850809,0.00009654773,0.00077232905,0.000122061785,0.00021534642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009687549,0.00029820378,0.00041610515,0.00044695803,0.0002140995,0.00018478827,0.0003747228,0.00014626479,0.000057786754],"category_scores_gemma":[0.0018104733,0.0002489556,0.00022465219,0.0011853136,0.00010936099,0.00023832373,0.00011117962,0.0003332647,0.0002518524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011136468,0.00015024605,0.000021509653,0.00015197891,0.000048093232,0.0000093819845,0.002157601,0.000009984224,0.0006094264,0.99222255,0.0045386846,0.00006940581],"study_design_scores_gemma":[0.00033900543,0.000039741397,0.00025580067,0.0004454814,0.000081015685,0.000005992881,0.0005925447,0.0010507934,0.0018704248,0.9872509,0.0077567087,0.00031156497],"about_ca_topic_score_codex":0.000011344178,"about_ca_topic_score_gemma":0.000041909836,"teacher_disagreement_score":0.033526417,"about_ca_system_score_codex":0.00015064637,"about_ca_system_score_gemma":0.00008330511,"threshold_uncertainty_score":0.99999624},"labels":[],"label_agreement":null},{"id":"W4403976095","doi":"10.55016/ojs/cdm.v19i3.62620","title":"On characterization and recognition of proper tagged probe interval graphs","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University Grants Commission","keywords":"Characterization (materials science); Combinatorics; Interval (graph theory); Mathematics; Discrete mathematics; Physics","score_opus":0.016638996920622304,"score_gpt":0.27113760204364906,"score_spread":0.25449860512302674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403976095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073807426,0.000035411857,0.92259383,0.0024659866,0.00009017082,0.000542458,0.0001754184,0.0001273118,0.00016197495],"genre_scores_gemma":[0.98492277,0.00002233468,0.014419385,0.00012736955,0.00003439659,0.00016584875,0.0000806158,0.00001001406,0.00021725454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992872,0.000022598173,0.0002403296,0.00020808187,0.000114878676,0.00012692962],"domain_scores_gemma":[0.99942833,0.00008989466,0.00005332071,0.0002407402,0.0001228176,0.000064878834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015803835,0.000094013594,0.00012987909,0.0001002337,0.00008222223,0.00016012964,0.00016989162,0.00003573416,0.000009297748],"category_scores_gemma":[0.000075321,0.00007243063,0.000044913104,0.00044066296,0.00003282859,0.00020169713,0.00009073203,0.00008189098,0.000045699122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034906516,0.00008061141,0.0000038877747,0.00011871256,0.000021850348,0.0000015813972,0.000648407,0.000009263542,0.027742812,0.9401892,0.0004142205,0.030766007],"study_design_scores_gemma":[0.00046865692,0.0005517454,0.0008398757,0.0020298772,0.000097629505,0.00004711193,0.000060375063,0.34266767,0.0347796,0.61171734,0.006148104,0.000592004],"about_ca_topic_score_codex":0.000001094653,"about_ca_topic_score_gemma":7.611712e-7,"teacher_disagreement_score":0.91111535,"about_ca_system_score_codex":0.000020266563,"about_ca_system_score_gemma":0.00002123235,"threshold_uncertainty_score":0.29536355},"labels":[],"label_agreement":null},{"id":"W4403976098","doi":"10.55016/ojs/cdm.v19i3.68885","title":"Construction of the projective plane $PG(2,q^2)$ from the unitary group $PSU(3,q)$","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hrvatska Zaklada za Znanost","keywords":"Mathematics; Unitary state; Projective test; Combinatorics; Projective unitary group; Group (periodic table); Projective plane; Unitary group; Projective linear group; Plane (geometry); Pure mathematics; Projective space; Geometry; Collineation; Physics; Quantum mechanics","score_opus":0.03268176431596116,"score_gpt":0.34012760501372913,"score_spread":0.307445840697768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403976098","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6932688,0.0014491779,0.24897286,0.014814358,0.0019995472,0.007522722,0.018615337,0.0007955839,0.0125616025],"genre_scores_gemma":[0.97964805,0.000022877033,0.01860219,0.0001248513,0.00037637248,0.00027617175,0.00015202812,0.00008654814,0.0007109031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751073,0.00040188222,0.00067603146,0.00033908442,0.0006422989,0.00042994806],"domain_scores_gemma":[0.99300224,0.0052619106,0.00016387326,0.0011438867,0.00032638485,0.00010168109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013867388,0.00027752994,0.00041684267,0.00012665901,0.00041290733,0.00014927189,0.0008391937,0.00015214803,0.000233129],"category_scores_gemma":[0.0040905634,0.00015421388,0.00025236234,0.0011089398,0.00055351073,0.00015217788,0.0004377258,0.00059004873,0.0001432431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003375004,0.00010145972,0.00008454368,0.000171987,0.0002725594,0.000005799733,0.004153229,0.0000050837066,0.0019984543,0.98663855,0.005971943,0.00056262204],"study_design_scores_gemma":[0.0003428606,0.00010164249,0.00042636984,0.00084639405,0.00030802246,0.0000529067,0.0037106934,0.002649667,0.0037928403,0.9838405,0.00367377,0.00025433744],"about_ca_topic_score_codex":0.00010007574,"about_ca_topic_score_gemma":0.0001035189,"teacher_disagreement_score":0.28637925,"about_ca_system_score_codex":0.00022136305,"about_ca_system_score_gemma":0.00019718948,"threshold_uncertainty_score":0.62886596},"labels":[],"label_agreement":null},{"id":"W4403976109","doi":"10.55016/ojs/cdm.v19i3.75983","title":"On the blocking numbers of some special convex bodies","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Blocking (statistics); Regular polygon; Geometry; Statistics","score_opus":0.03721193003695116,"score_gpt":0.34241312391765005,"score_spread":0.3052011938806989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403976109","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48590672,0.0028331804,0.32504627,0.03816062,0.004043161,0.0044398494,0.00578067,0.001277077,0.13251247],"genre_scores_gemma":[0.99237835,0.00004323679,0.0024932597,0.00025529787,0.00096155383,0.00010271092,0.000014890938,0.000045798693,0.003704868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828774,0.000051169056,0.0006259575,0.0002142122,0.00045058643,0.00037035145],"domain_scores_gemma":[0.9951473,0.0039137863,0.00013669094,0.00046133375,0.0002567091,0.000084170424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000933112,0.00022738126,0.00043655135,0.0002452987,0.00022191548,0.00016057542,0.0003305134,0.00008596484,0.00049352396],"category_scores_gemma":[0.006088263,0.00014519755,0.00021404742,0.0005601625,0.00013930304,0.00012742668,0.00013097875,0.00022466505,0.00020977229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000726052,0.00006110142,0.0000014863862,0.00048354268,0.000116380674,0.0000050266126,0.0032524057,0.000009363294,0.00007306694,0.968995,0.026848922,0.00014646398],"study_design_scores_gemma":[0.00014346141,0.000085549524,0.0000032653718,0.0006879061,0.00012626301,0.000009880718,0.0020463888,0.0012050876,0.003381959,0.9811309,0.010971709,0.00020765499],"about_ca_topic_score_codex":0.000006967509,"about_ca_topic_score_gemma":0.0000070086553,"teacher_disagreement_score":0.5064717,"about_ca_system_score_codex":0.000102884806,"about_ca_system_score_gemma":0.00010014489,"threshold_uncertainty_score":0.7288659},"labels":[],"label_agreement":null},{"id":"W4412376432","doi":"10.55016/ojs/cdm.v10i1.62182","title":"Expanding polynomials over finite fields of large characteristic, and a regularity lemma for definable sets","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Lemma (botany); Mathematics; Combinatorics; Finite field; Pure mathematics; Discrete mathematics","score_opus":0.03380846415234004,"score_gpt":0.3295930332362433,"score_spread":0.29578456908390327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412376432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08508471,0.00008549843,0.91180825,0.0012304647,0.00020457912,0.0007453997,0.0006078227,0.000082274826,0.00015101673],"genre_scores_gemma":[0.8375501,0.000003606389,0.16200498,0.00012876539,0.00006437982,0.000095912575,0.000028356159,0.000011188704,0.0001127365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840635,0.00006477603,0.0005116208,0.0003485953,0.00023617526,0.00043248877],"domain_scores_gemma":[0.99767643,0.00073649763,0.00020526427,0.0006970853,0.00043915986,0.0002455575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012971881,0.00018735921,0.00047308957,0.000115910814,0.00017345691,0.00016864233,0.00047408097,0.00011763667,0.000008548843],"category_scores_gemma":[0.0027755795,0.00017306843,0.00010233678,0.00028815184,0.000058044094,0.00026904943,0.0006402288,0.00009942442,0.0000073688893],"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.00007371113,0.00083186175,0.0013131927,0.0006964867,0.00015454629,0.000014095513,0.010563077,0.00026494474,0.0016053304,0.97337246,0.0065789116,0.0045313616],"study_design_scores_gemma":[0.003621273,0.0007307357,0.0038558834,0.00025388954,0.00012950978,0.000045509685,0.00039596148,0.59757394,0.0062733027,0.3797405,0.006514769,0.00086470676],"about_ca_topic_score_codex":0.000018149201,"about_ca_topic_score_gemma":0.0000124534545,"teacher_disagreement_score":0.75246537,"about_ca_system_score_codex":0.000111582325,"about_ca_system_score_gemma":0.00013248755,"threshold_uncertainty_score":0.70575255},"labels":[],"label_agreement":null},{"id":"W4412376449","doi":"10.55016/ojs/cdm.v10i1.62266","title":"On uniformly resolvable {K_2, P_k}-designs with with k=3,4","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Ministero dell’Istruzione, dell’Università e della Ricerca; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.016433725059316805,"score_gpt":0.2377580312302699,"score_spread":0.22132430617095308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412376449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14664507,0.0001382883,0.77824044,0.00032972955,0.00018139639,0.0012635422,0.00043111196,0.0008930457,0.07187737],"genre_scores_gemma":[0.9941909,0.0000017227169,0.0046334397,0.000047997706,0.000048359623,0.00012206611,0.00003678723,0.000054596523,0.0008641713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988411,0.00003490486,0.0002546308,0.00016911827,0.0002981405,0.00040208403],"domain_scores_gemma":[0.9987658,0.000116708405,0.000046746165,0.0005347899,0.00020271541,0.00033319907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003548796,0.00024605315,0.00030832874,0.0001247825,0.00012773219,0.00008914668,0.00021124088,0.000079889505,0.00002646237],"category_scores_gemma":[0.000116717456,0.0001686068,0.000042971144,0.00046334686,0.00005908231,0.00012804475,0.000021240245,0.00016754966,0.0003166597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016810863,0.0001242762,0.0000503509,0.0001433735,0.000229551,0.00003832363,0.0022795964,0.070114404,0.00060041697,0.91257447,0.013597329,0.00007977564],"study_design_scores_gemma":[0.02100444,0.0123753,0.0004167477,0.0072507295,0.0014557015,0.0010297613,0.02037847,0.22317241,0.05629834,0.5236398,0.12518401,0.0077942885],"about_ca_topic_score_codex":0.000005096615,"about_ca_topic_score_gemma":0.000023305263,"teacher_disagreement_score":0.8475458,"about_ca_system_score_codex":0.0001451893,"about_ca_system_score_gemma":0.000044729437,"threshold_uncertainty_score":0.6875586},"labels":[],"label_agreement":null},{"id":"W4412376451","doi":"10.55016/ojs/cdm.v10i1.62293","title":"Chasing robbers on percolated random geometric graphs","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Combinatorics; Mathematics; Random graph; Discrete mathematics; Graph","score_opus":0.025639752924634742,"score_gpt":0.2881849538665438,"score_spread":0.2625452009419091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412376451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035309854,0.000066639215,0.98708135,0.0024665147,0.00037329432,0.0005954569,0.00009416047,0.00030733747,0.0054842597],"genre_scores_gemma":[0.8287363,0.000023601979,0.16794801,0.000905486,0.00014985188,0.00013694774,0.00016862684,0.000039189188,0.0018919538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984029,0.000052613497,0.000334016,0.00033674788,0.0004513232,0.0004224319],"domain_scores_gemma":[0.99834347,0.00017112873,0.00010321701,0.0008209703,0.0002471201,0.0003140823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085727364,0.0001953022,0.0002815379,0.0005728999,0.00021468615,0.0004884126,0.0009471654,0.00005356964,0.000012203503],"category_scores_gemma":[0.0010339478,0.00016532867,0.00010051296,0.0021322072,0.000034994282,0.0005394778,0.00038675734,0.00012826789,0.0005144418],"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.00002763021,0.0003571666,0.000044122346,0.00003629647,0.0001422185,0.00003827533,0.001570507,0.0012435992,0.00008033723,0.94937694,0.03242691,0.0146559905],"study_design_scores_gemma":[0.010903458,0.00095473044,0.00045111877,0.00040083114,0.00022784866,0.0000456363,0.0011418875,0.7178319,0.0015758324,0.19857056,0.06606008,0.0018360934],"about_ca_topic_score_codex":0.000008657873,"about_ca_topic_score_gemma":0.0000018435877,"teacher_disagreement_score":0.8252053,"about_ca_system_score_codex":0.0001385021,"about_ca_system_score_gemma":0.000052874937,"threshold_uncertainty_score":0.67419076},"labels":[],"label_agreement":null},{"id":"W4412376457","doi":"10.55016/ojs/cdm.v10i1.62222","title":"A curious polynomial interpolation of Carlitz-Riordan's q-ballot numbers","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Interpolation (computer graphics); Combinatorics; Polynomial interpolation; Ballot; Polynomial; Linear interpolation; Mathematical analysis; Computer science; Voting; Law; Computer graphics (images); Political science","score_opus":0.04152957417294601,"score_gpt":0.370751454272188,"score_spread":0.32922188009924197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412376457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11439305,0.00016610572,0.85645086,0.0011731907,0.000528827,0.0018836195,0.0007258398,0.00045725246,0.024221271],"genre_scores_gemma":[0.84799653,0.000005141773,0.14882939,0.00005712129,0.0001668866,0.00013945701,0.00003320968,0.00008265703,0.002689619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99719894,0.00009360883,0.0011746277,0.0003250034,0.00066654285,0.00054127077],"domain_scores_gemma":[0.99659836,0.00080705195,0.00047308733,0.0007976982,0.00086968095,0.00045412284],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008191211,0.00035927445,0.00083036977,0.00024047692,0.00012266735,0.00008475785,0.00048256767,0.0001592496,0.00009919743],"category_scores_gemma":[0.008951036,0.00033151294,0.0002467468,0.0004824972,0.00022670782,0.00032816204,0.00030577427,0.00022598082,0.00018148047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006105552,0.00042444377,0.00007092164,0.00039435903,0.00014696522,0.000008885817,0.007544843,0.00004950773,0.0018176216,0.9691171,0.02026126,0.0001030099],"study_design_scores_gemma":[0.0013177054,0.00022060567,0.000020762824,0.0004322154,0.00027082348,0.000043792777,0.0045215203,0.003928032,0.0033365686,0.9834112,0.0019855113,0.00051126024],"about_ca_topic_score_codex":0.000049328577,"about_ca_topic_score_gemma":0.00007459615,"teacher_disagreement_score":0.7336035,"about_ca_system_score_codex":0.00036542767,"about_ca_system_score_gemma":0.00021766034,"threshold_uncertainty_score":0.9999137},"labels":[],"label_agreement":null},{"id":"W4412402095","doi":"10.55016/ojs/cdm.v10i2.62216","title":"On the chromatic index of Latin squares","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Latin square; Mathematics; Index (typography); Combinatorics; Chromatic scale; Statistics; Computer science; Biology","score_opus":0.01604076548206836,"score_gpt":0.2581452710296603,"score_spread":0.24210450554759191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412402095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09460311,0.000034681387,0.8902326,0.0134154,0.00009695463,0.00037227877,0.00006411437,0.0001167976,0.0010640345],"genre_scores_gemma":[0.99188304,0.0000024166172,0.007542624,0.00023897241,0.000004575437,0.000040916217,0.0000010534006,0.0000067393667,0.00027966037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988901,0.000058556594,0.00035609995,0.00017444417,0.00029520938,0.00022559329],"domain_scores_gemma":[0.9976641,0.0010348464,0.00014550716,0.0008558021,0.00021323274,0.00008651718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004961856,0.000118786025,0.00019013796,0.00013480392,0.00015365242,0.000051800318,0.0006220947,0.000043053198,0.000035142464],"category_scores_gemma":[0.0014323262,0.00005597074,0.00008274751,0.0005334991,0.00008912039,0.000083563755,0.00017239056,0.00005733849,0.0002452043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014383169,0.00004952133,0.000026145191,0.0000126024215,0.000014861441,5.4218185e-7,0.00031386595,0.00004298766,0.0034836833,0.99345464,0.0021368954,0.00046281787],"study_design_scores_gemma":[0.00037230217,0.00013750787,0.00028273303,0.00045103885,0.000012960187,0.0000030742992,0.00004534174,0.014875536,0.009797,0.9735576,0.00031451107,0.00015037468],"about_ca_topic_score_codex":0.0000030818005,"about_ca_topic_score_gemma":0.0000017698115,"teacher_disagreement_score":0.8972799,"about_ca_system_score_codex":0.000030036443,"about_ca_system_score_gemma":0.000044421842,"threshold_uncertainty_score":0.31516874},"labels":[],"label_agreement":null},{"id":"W4412402096","doi":"10.55016/ojs/cdm.v10i2.62253","title":"A Lower Bound for Radio k-chromatic Number of an Arbitrary Graph","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Graph; Windmill graph; Upper and lower bounds; Friendship graph; Discrete mathematics; Graph power; Line graph","score_opus":0.012929653346634677,"score_gpt":0.28469703053284234,"score_spread":0.2717673771862077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412402096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14487013,0.000052329764,0.85198474,0.0015363148,0.00020297342,0.0005653757,0.00021359176,0.00016151245,0.0004130613],"genre_scores_gemma":[0.64438254,0.000005474613,0.35492304,0.00016521946,0.000016389728,0.00013799671,0.000009948774,0.000020087213,0.00033928856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849826,0.00004311017,0.0005241072,0.0003122744,0.00025311712,0.00036913142],"domain_scores_gemma":[0.9978895,0.00038546164,0.0001782712,0.0009405365,0.00037664917,0.00022959184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005538105,0.00017787942,0.00033921245,0.00012659443,0.00017817706,0.00008912705,0.0006109513,0.000078886645,0.000027636288],"category_scores_gemma":[0.0004746008,0.000118933276,0.00017643797,0.00041533372,0.00011616472,0.0003648551,0.00011735042,0.000049806575,0.00007524347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008012792,0.00021533706,0.000016670649,0.00006416007,0.00004581084,0.000002213357,0.00037037808,0.000006430713,0.007286986,0.99005765,0.0009717627,0.00095461606],"study_design_scores_gemma":[0.000996248,0.00021009149,0.000043501557,0.0002923324,0.000045973677,0.00003345388,0.000026590287,0.007928127,0.008347183,0.9810984,0.0007152406,0.00026282316],"about_ca_topic_score_codex":0.000005504571,"about_ca_topic_score_gemma":0.0000030375911,"teacher_disagreement_score":0.49951243,"about_ca_system_score_codex":0.000036933816,"about_ca_system_score_gemma":0.0000901908,"threshold_uncertainty_score":0.48499584},"labels":[],"label_agreement":null},{"id":"W4412402110","doi":"10.55016/ojs/cdm.v10i2.62217","title":"A theorem on fractional ID - ( g , f ) - factor-critical graphs","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Government of Jiangsu Province; National Social Science Fund of China; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Discrete mathematics; Factor (programming language); Computer science","score_opus":0.023433605097989585,"score_gpt":0.3495409181538872,"score_spread":0.32610731305589763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412402110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028872255,0.000025262856,0.9835117,0.009743628,0.0001965146,0.00036236152,0.00050701847,0.00025585506,0.0025104764],"genre_scores_gemma":[0.96585524,0.000008900199,0.033150863,0.0003171232,0.00007093022,0.00012360908,0.000005562953,0.00002135665,0.00044644065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783236,0.00013252525,0.000347236,0.00044304656,0.00062404544,0.0006208008],"domain_scores_gemma":[0.9955895,0.002580872,0.000065628185,0.0010193791,0.00037124823,0.000373403],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000472405,0.00021965922,0.0002538051,0.0002709375,0.00036498564,0.00016119587,0.0009922298,0.00008856304,0.0002266248],"category_scores_gemma":[0.0037873639,0.00014001562,0.00014396949,0.0005877537,0.0002591872,0.00049228733,0.00032096644,0.00019984948,0.0012014536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013890409,0.000110641304,0.000022649183,0.000007949134,0.00002070298,0.000008169951,0.00012028074,0.0000063130656,0.0027270312,0.9937373,0.0006001206,0.0026250004],"study_design_scores_gemma":[0.0003799635,0.00018394549,0.00026767622,0.00011102307,0.000006649484,0.000022017282,0.000027766513,0.0011817619,0.0048822793,0.987935,0.0047417344,0.0002602011],"about_ca_topic_score_codex":7.453176e-7,"about_ca_topic_score_gemma":0.0000010644635,"teacher_disagreement_score":0.962968,"about_ca_system_score_codex":0.00016916088,"about_ca_system_score_gemma":0.00008785222,"threshold_uncertainty_score":0.9995762},"labels":[],"label_agreement":null},{"id":"W4412402127","doi":"10.55016/ojs/cdm.v10i2.62371","title":"On bisectors in normed planes","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.006157138654072794,"score_gpt":0.23045405420678156,"score_spread":0.22429691555270875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412402127","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92203665,0.00006232772,0.068686604,0.0003493833,0.00038544205,0.00050380494,0.00050440436,0.00035220227,0.0071191993],"genre_scores_gemma":[0.99946594,0.0000057294396,0.0001213849,0.00001989737,0.000035716996,0.00008055981,0.000007038196,0.000019374294,0.0002443407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992531,0.000023093713,0.00025193937,0.00010500747,0.00010407543,0.00026279435],"domain_scores_gemma":[0.9993076,0.00028547956,0.000020677377,0.00026460885,0.00002715898,0.00009451963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018458746,0.00013317444,0.00019403856,0.00016072839,0.0000421238,0.000019166144,0.00013526095,0.0000634794,0.00007994652],"category_scores_gemma":[0.0002633429,0.000088074026,0.000050553135,0.0002274439,0.000023878007,0.000053561926,0.000014713555,0.00005899156,0.0004915899],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029600238,0.00010606438,0.0005997595,0.00018337756,0.00007965181,0.000020511816,0.0014192103,0.0023660276,0.023169614,0.96562123,0.005304923,0.0011000395],"study_design_scores_gemma":[0.009403704,0.00080219744,0.011689384,0.007150246,0.000170396,0.00010558407,0.0019622971,0.020729415,0.11153572,0.7829173,0.049517937,0.0040158085],"about_ca_topic_score_codex":0.0000017315531,"about_ca_topic_score_gemma":0.000022916194,"teacher_disagreement_score":0.18270391,"about_ca_system_score_codex":0.0000986875,"about_ca_system_score_gemma":0.000007748757,"threshold_uncertainty_score":0.6318557},"labels":[],"label_agreement":null},{"id":"W4412402130","doi":"10.55016/ojs/cdm.v10i2.62320","title":"Triangle-free Uniquely 3-Edge Colorable Cubic Graphs","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Cubic graph; Discrete mathematics; Graph; Computer science; Line graph; Artificial intelligence","score_opus":0.015254640304786907,"score_gpt":0.2641215160142489,"score_spread":0.24886687570946198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412402130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018007062,0.0002703677,0.9589034,0.017327327,0.0004036734,0.0007462312,0.00025808037,0.0007056248,0.0033782334],"genre_scores_gemma":[0.82953507,0.000055834513,0.16509248,0.00085744803,0.000018781817,0.00026263873,0.000012477397,0.000041742533,0.004123503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793434,0.00009995339,0.0005588063,0.00044829305,0.00036252217,0.0005960633],"domain_scores_gemma":[0.99673873,0.00047799628,0.00017236941,0.0017380205,0.0005077226,0.0003651812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091896305,0.00024653433,0.00039900895,0.00028799035,0.0003524761,0.00019649813,0.0014511349,0.00011811765,0.00004636598],"category_scores_gemma":[0.0017358828,0.00016290814,0.00018998198,0.0010457044,0.00011786166,0.00037744542,0.0005572873,0.000110033296,0.0005584735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004840933,0.00009050166,0.000021329406,0.000014853909,0.00002875797,0.000005905372,0.00019054658,0.000009031965,0.0057315496,0.9785949,0.014376734,0.00093105325],"study_design_scores_gemma":[0.0014237523,0.00016108375,0.000042121323,0.00021161172,0.00003192321,0.000019427029,0.00002568865,0.0021508867,0.01004563,0.9786099,0.006938613,0.00033933664],"about_ca_topic_score_codex":0.000009551539,"about_ca_topic_score_gemma":0.000009446358,"teacher_disagreement_score":0.811528,"about_ca_system_score_codex":0.00010060078,"about_ca_system_score_gemma":0.0001393315,"threshold_uncertainty_score":0.7178234},"labels":[],"label_agreement":null},{"id":"W4412402131","doi":"10.55016/ojs/cdm.v10i2.62228","title":"On universally rigid frameworks on the line","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Social Fund; Hungarian Scientific Research Fund; Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Line (geometry); Geometry","score_opus":0.006291910177358452,"score_gpt":0.22915617334711572,"score_spread":0.22286426316975727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412402131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05248965,0.000018879344,0.9353018,0.0073561897,0.00013651293,0.00026038446,0.00021075584,0.00019668612,0.004029185],"genre_scores_gemma":[0.997643,0.000019769963,0.0015198649,0.0002216625,0.00007379669,0.000015418203,0.000012124488,0.000016650307,0.00047771295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993934,0.000015325388,0.0001713318,0.00010160185,0.00014329025,0.00017501849],"domain_scores_gemma":[0.99906963,0.0004099119,0.000030233698,0.00032601273,0.0000962811,0.00006795296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009302648,0.00012703055,0.00014032949,0.00006126544,0.00011929551,0.000041031384,0.0001646978,0.0000964437,0.00033473066],"category_scores_gemma":[0.0004856468,0.000060835555,0.00007886977,0.00023040592,0.0000267724,0.000042449738,0.000021425692,0.00013809511,0.00031601114],"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.00000939208,0.000020035623,0.000006211625,0.000009069572,0.00010135048,0.0000017009262,0.0001688505,0.113949634,0.0011488026,0.876313,0.0064736237,0.0017983419],"study_design_scores_gemma":[0.0012609727,0.0003753888,0.00082902465,0.0010928253,0.00029605738,0.000006244508,0.00029233628,0.7112964,0.017444551,0.25338158,0.012685081,0.001039569],"about_ca_topic_score_codex":6.6352567e-7,"about_ca_topic_score_gemma":0.0000045290653,"teacher_disagreement_score":0.94515336,"about_ca_system_score_codex":0.000113259164,"about_ca_system_score_gemma":0.0000068596964,"threshold_uncertainty_score":0.40617892},"labels":[],"label_agreement":null},{"id":"W4412435891","doi":"10.55016/ojs/cdm.v11i2.62359","title":"On the Equation $\\displaystyle{\\sum_{i=1}^n \\frac{1}{x_i}=1} $ in Distinct Odd or Even Numbers","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"advanced mathematical theories","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.07090141217410696,"score_gpt":0.3981647055043395,"score_spread":0.3272632933302326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412435891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1332153,0.000032405893,0.7985179,0.012819399,0.00046573734,0.004572026,0.0008185571,0.00039079576,0.04916789],"genre_scores_gemma":[0.9668523,0.000007512425,0.028386416,0.00020857903,0.00016330974,0.00065649836,0.000026949145,0.000103391445,0.0035950353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99657434,0.00019929737,0.0011179814,0.00052626047,0.0007419423,0.00084020366],"domain_scores_gemma":[0.98862284,0.007418311,0.00071338064,0.0026687777,0.00030864496,0.00026806243],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020488615,0.0005395778,0.000847277,0.00015038278,0.0012910833,0.00043574633,0.0014200798,0.00020984927,0.00056071917],"category_scores_gemma":[0.06457485,0.00033779148,0.00023487242,0.00034066592,0.0004358373,0.0004023444,0.0004950475,0.00052121776,0.0007464847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009858189,0.00031723877,0.000041433927,0.00016725347,0.000058376907,0.000020624419,0.0015279126,0.000040613577,0.00011173182,0.99507904,0.0022971244,0.00024007646],"study_design_scores_gemma":[0.00088723114,0.00012840169,0.00024052338,0.0008393858,0.00010576339,0.000017702623,0.0010148586,0.0040971763,0.0009600867,0.99027467,0.00093004445,0.00050417683],"about_ca_topic_score_codex":0.000014068812,"about_ca_topic_score_gemma":0.0002133367,"teacher_disagreement_score":0.833637,"about_ca_system_score_codex":0.00044994793,"about_ca_system_score_gemma":0.00012923607,"threshold_uncertainty_score":0.99990743},"labels":[],"label_agreement":null},{"id":"W4412435894","doi":"10.55016/ojs/cdm.v11i2.62576","title":"New combinatorial interpretations of some Rogers-Ramanujan type identities","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Combinatorial proof; Ramanujan's sum; Biology; Paleontology","score_opus":0.03294415499262443,"score_gpt":0.38034389020851955,"score_spread":0.3473997352158951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412435894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101386294,0.00030025814,0.85823035,0.0026449384,0.0034051843,0.0026594207,0.00090681936,0.0005622091,0.02990452],"genre_scores_gemma":[0.87220407,0.00003045052,0.1151101,0.00003998178,0.00041825243,0.00008177574,0.000029740748,0.00009698606,0.0119886715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766266,0.00004764809,0.0009705951,0.00029856307,0.00054798834,0.00047251588],"domain_scores_gemma":[0.9957711,0.000837875,0.0007388582,0.0016495715,0.00069572474,0.00030686054],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046815898,0.0003274158,0.0007968491,0.00019339172,0.0006382031,0.00037502783,0.0010698343,0.0001504183,0.0002882875],"category_scores_gemma":[0.014143032,0.00031009965,0.0002519526,0.00016539665,0.00030753887,0.00083804585,0.0005330142,0.00022195357,0.00023888068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017473047,0.00013778984,0.000020799342,0.00026406875,0.00012236458,0.000004581072,0.0015146374,0.0000076179826,0.0008198859,0.9890314,0.007981094,0.00007832149],"study_design_scores_gemma":[0.0007238167,0.00011313419,0.00004546412,0.00042823816,0.00024435853,0.000010033111,0.0006567546,0.0004539344,0.0073714987,0.98919797,0.00043204735,0.00032277347],"about_ca_topic_score_codex":0.000024583625,"about_ca_topic_score_gemma":0.000021085467,"teacher_disagreement_score":0.77081776,"about_ca_system_score_codex":0.00015830234,"about_ca_system_score_gemma":0.00018699886,"threshold_uncertainty_score":0.9999351},"labels":[],"label_agreement":null},{"id":"W4412435922","doi":"10.55016/ojs/cdm.v11i2.62225","title":"Contractions of Polygons in Abstract Polytopes, Part I","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polytope; Combinatorics; Mathematics","score_opus":0.02321674580177565,"score_gpt":0.32801789323190933,"score_spread":0.3048011474301337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412435922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039985035,0.00009566689,0.9458972,0.0062531726,0.0004227128,0.0004444756,0.00022701858,0.000058559388,0.006616108],"genre_scores_gemma":[0.9774429,0.0000101167225,0.021983948,0.00006234492,0.00007211002,0.000037711856,0.00001704342,0.0000052367063,0.0003685828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989325,0.00002019745,0.00042910688,0.00020427142,0.00018436172,0.00022956477],"domain_scores_gemma":[0.9983702,0.00019285317,0.00025993152,0.00082338945,0.00023851138,0.00011515653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041869874,0.00011245231,0.00022482283,0.00017980966,0.00036744002,0.00021630409,0.0006907002,0.000056206092,0.000030498548],"category_scores_gemma":[0.0011175651,0.0001093486,0.00007802786,0.00022782215,0.0000536218,0.0004918098,0.00018197548,0.00010824479,0.00005973221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006188089,0.00031745262,0.0003133775,0.000027975067,0.000033590182,0.0000065512786,0.0005025595,0.0020486421,0.0043944246,0.98345095,0.0016099401,0.007288328],"study_design_scores_gemma":[0.005110583,0.0004658148,0.3007079,0.0010390577,0.00014194849,0.00012137219,0.0004896758,0.2540094,0.055737715,0.30076766,0.079457186,0.0019517054],"about_ca_topic_score_codex":0.000045563498,"about_ca_topic_score_gemma":0.000085544096,"teacher_disagreement_score":0.93745786,"about_ca_system_score_codex":0.00006315528,"about_ca_system_score_gemma":0.00013448179,"threshold_uncertainty_score":0.44591063},"labels":[],"label_agreement":null},{"id":"W4412435948","doi":"10.55016/ojs/cdm.v11i2.62346","title":"A class of spherical folding subdivisions","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Theoretical and Applied Studies in Material Sciences and Geometry","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Subdivision; Mathematics; Class (philosophy); Combinatorics; Folding (DSP implementation); Computer science; Geography; Artificial intelligence; Archaeology","score_opus":0.009950567006813911,"score_gpt":0.29345142925024453,"score_spread":0.28350086224343063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412435948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09736963,0.000070613874,0.8649517,0.0005192739,0.00036611903,0.00023072984,0.00029106814,0.00010692887,0.036093898],"genre_scores_gemma":[0.9857631,0.000025000194,0.014045278,0.000010853444,0.00005699384,0.000018397131,0.0000022138129,0.000007882741,0.00007031045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999339,0.0000038544686,0.00021111529,0.00009392889,0.000121281635,0.00023085676],"domain_scores_gemma":[0.9993689,0.00007490995,0.00004734559,0.00034977618,0.000055049142,0.00010403577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001372605,0.00009530266,0.00022549935,0.000019610443,0.00037129497,0.00005910598,0.0003174096,0.000038470807,0.00010690154],"category_scores_gemma":[0.0004183444,0.00007296175,0.000058698333,0.000093174385,0.00019422213,0.00005925714,0.00017653604,0.00005913499,0.000039216597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003908494,0.000031718937,0.00004314232,0.000063521045,0.000031075342,0.0000015398624,0.0001975711,0.002215184,0.010504753,0.98373264,0.00062600104,0.0025489717],"study_design_scores_gemma":[0.00077657105,0.00016542248,0.0013510336,0.00035646517,0.00010791671,0.000005984797,0.0011231676,0.06899099,0.04306142,0.84524906,0.038004212,0.00080773485],"about_ca_topic_score_codex":0.0000013985929,"about_ca_topic_score_gemma":0.0000015540376,"teacher_disagreement_score":0.88839346,"about_ca_system_score_codex":0.000025694739,"about_ca_system_score_gemma":0.0000043544787,"threshold_uncertainty_score":0.2975294},"labels":[],"label_agreement":null},{"id":"W4412435968","doi":"10.55016/ojs/cdm.v11i2.62457","title":"Sufficient conditions for certain structural properties of graphs based on Wiener-type indices","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Type (biology); Wiener index; Graph; Biology","score_opus":0.04887605859054891,"score_gpt":0.35994521970138227,"score_spread":0.3110691611108334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412435968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9703124,0.000022355523,0.022448357,0.0016520784,0.00014935003,0.0020765553,0.0023061086,0.00010037207,0.00093240733],"genre_scores_gemma":[0.99094176,0.0000012015839,0.008245096,0.00006469876,0.00003384161,0.0004302831,0.00007976759,0.000028135035,0.00017521731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860793,0.000046021,0.0005116685,0.00025461384,0.00024839785,0.000331391],"domain_scores_gemma":[0.9971334,0.0005185424,0.0004866695,0.0011681307,0.0005566802,0.00013658106],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00047703486,0.00022690932,0.00039690032,0.00018392157,0.0013177122,0.00012477215,0.0005968497,0.00009802622,0.000040975247],"category_scores_gemma":[0.0033315513,0.00017740311,0.00020860933,0.00019026062,0.0003446505,0.000111454414,0.00007557026,0.00011189991,0.000014186496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051779574,0.00020881835,0.000063621184,0.00019976191,0.000049395316,3.575048e-7,0.00051213236,0.0002098534,0.0079794815,0.9901517,0.0005457602,0.000027327038],"study_design_scores_gemma":[0.00090176036,0.00033925794,0.0004673946,0.0004309685,0.00023071181,0.0000029653615,0.00064983236,0.018373745,0.03860618,0.939231,0.00042196966,0.0003442113],"about_ca_topic_score_codex":0.0000067353467,"about_ca_topic_score_gemma":0.000017275994,"teacher_disagreement_score":0.05092071,"about_ca_system_score_codex":0.0000477287,"about_ca_system_score_gemma":0.00008852988,"threshold_uncertainty_score":0.9999824},"labels":[],"label_agreement":null},{"id":"W4412435997","doi":"10.55016/ojs/cdm.v11i2.62553","title":"Fully Indecomposable and Nearly Decomposable Graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Research in Fundamental Sciences; School of Mathematics, Institute for Research in Fundamental Sciences; Sharif University of Technology","keywords":"Combinatorics; Mathematics; Indecomposable module; Cograph; Discrete mathematics; Chordal graph; Graph; 1-planar graph","score_opus":0.018580713753969132,"score_gpt":0.3376772356103748,"score_spread":0.3190965218564057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412435997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036440242,0.0001348348,0.95179564,0.004884601,0.00014866333,0.0006043096,0.0000774357,0.00018021757,0.0057340763],"genre_scores_gemma":[0.77888846,0.000029819623,0.21966548,0.00013439832,0.000035997047,0.00009397817,0.0000064904884,0.000022759294,0.0011226374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817574,0.00006000026,0.0003343982,0.00044482472,0.00034138391,0.00064364745],"domain_scores_gemma":[0.99677235,0.0002688153,0.0001836107,0.002019708,0.00034004022,0.000415454],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008204294,0.00021480865,0.00032886295,0.00019007025,0.0016715736,0.0014747947,0.0019749587,0.000081830345,0.000024350977],"category_scores_gemma":[0.0011787297,0.00019357828,0.00008941376,0.00026811325,0.0002726443,0.0010438715,0.0013129935,0.0002248092,0.00018987826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006729069,0.00005695879,0.0004905168,0.000024106399,0.000030004907,0.0000116480505,0.0003384162,0.00002549576,0.0010240466,0.9955315,0.00066473096,0.0017958735],"study_design_scores_gemma":[0.000722831,0.000127152,0.0020333324,0.00009200656,0.000014538015,0.000049672504,0.000057801288,0.026626786,0.0028440992,0.96115965,0.005874823,0.000397323],"about_ca_topic_score_codex":0.0000104137525,"about_ca_topic_score_gemma":0.000012581331,"teacher_disagreement_score":0.7424482,"about_ca_system_score_codex":0.00006402613,"about_ca_system_score_gemma":0.00008583193,"threshold_uncertainty_score":0.9996281},"labels":[],"label_agreement":null},{"id":"W4412436079","doi":"10.55016/ojs/cdm.v11i2.62453","title":"On monochromatic linear recurrence sequences","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"advanced mathematical theories","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hungarian Scientific Research Fund","keywords":"Monochromatic color; Mathematics; Combinatorics; Physics; Optics","score_opus":0.054490159564570886,"score_gpt":0.4087793426577629,"score_spread":0.354289183093192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412436079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08034561,0.000050217288,0.87917334,0.0039884415,0.00048342746,0.0020269547,0.00064842455,0.00056215987,0.03272143],"genre_scores_gemma":[0.714329,0.00001399108,0.28303313,0.00015473238,0.00020127247,0.00033310216,0.00001363209,0.00008249082,0.0018386134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972679,0.00008258398,0.0008391056,0.0004955187,0.00060867687,0.00070620707],"domain_scores_gemma":[0.993556,0.002447142,0.00062615704,0.0025855503,0.00040251922,0.00038258388],"candidate_categories":["metaresearch","metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009765675,0.0004651917,0.0008084699,0.00013519714,0.0014123032,0.00033205975,0.0013690174,0.00016121494,0.00022293604],"category_scores_gemma":[0.039935414,0.00037379257,0.00022352704,0.00018232824,0.00047234868,0.00039827987,0.00041008502,0.00034477655,0.0010794244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016942027,0.00020228671,0.000004753394,0.00022253119,0.00005379048,0.000013605661,0.0006569743,0.000032298627,0.00028597726,0.9965039,0.0014635532,0.0005434002],"study_design_scores_gemma":[0.00043228362,0.00017437532,0.00002110155,0.0008725417,0.00009383514,0.000020230662,0.00024005205,0.004184133,0.0043857917,0.9885638,0.0005390421,0.00047282042],"about_ca_topic_score_codex":0.0000034767902,"about_ca_topic_score_gemma":0.000007691611,"teacher_disagreement_score":0.63398343,"about_ca_system_score_codex":0.00021088314,"about_ca_system_score_gemma":0.000092061666,"threshold_uncertainty_score":0.9998877},"labels":[],"label_agreement":null},{"id":"W4412439609","doi":"10.55016/ojs/cdm.v11i1.62391","title":"Barnes-type Boole polynomials","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Biology","score_opus":0.034723283528363014,"score_gpt":0.3643940343036846,"score_spread":0.3296707507753216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412439609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03176154,0.00013753863,0.943922,0.0053999396,0.0004697217,0.0014885927,0.0008195599,0.00082094985,0.015180182],"genre_scores_gemma":[0.7909716,0.00006204393,0.17418684,0.00029193962,0.00053289,0.00035613897,0.000018555987,0.00021950768,0.033360522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711967,0.000082576254,0.0009420074,0.00041991597,0.00066183344,0.00077401666],"domain_scores_gemma":[0.9956082,0.0017310283,0.00026655255,0.0011350667,0.0008482202,0.00041091177],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009205912,0.0003983972,0.00073355844,0.00019898645,0.0002768076,0.00011158085,0.0005519293,0.00016352016,0.0009369922],"category_scores_gemma":[0.02026037,0.00026544198,0.0002225695,0.00045517343,0.00020411029,0.00035811553,0.0003209922,0.00013489605,0.0022299413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020836169,0.00018666495,0.000016821148,0.00014511433,0.00008779275,0.000009708029,0.00047170697,0.0000037041727,0.012074112,0.95768577,0.029003683,0.00029409927],"study_design_scores_gemma":[0.0006577468,0.000101029495,0.000023771472,0.00045263753,0.00013223474,0.00002991068,0.00025764472,0.000084212166,0.012400898,0.97146297,0.01392044,0.00047651946],"about_ca_topic_score_codex":0.0000030485608,"about_ca_topic_score_gemma":0.0000128668,"teacher_disagreement_score":0.76973516,"about_ca_system_score_codex":0.00044225552,"about_ca_system_score_gemma":0.00011689905,"threshold_uncertainty_score":0.9999798},"labels":[],"label_agreement":null},{"id":"W4412439628","doi":"10.55016/ojs/cdm.v11i1.62406","title":"The annihilating-ideal graph of Z n is weakly perfect","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Shahid Rajaee Teacher Training University; Kharazmi University","keywords":"Mathematics; Combinatorics; Ideal (ethics); Graph; Discrete mathematics","score_opus":0.021044444024519403,"score_gpt":0.30152784908124763,"score_spread":0.28048340505672825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412439628","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63767457,0.00056434475,0.33089945,0.016421618,0.0004880581,0.0020213143,0.0014765698,0.00038993199,0.010064153],"genre_scores_gemma":[0.9866192,0.00007502712,0.010359342,0.00010575406,0.00016325606,0.000096142496,0.000004751637,0.000054375512,0.0025221538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977663,0.00008281928,0.0008392002,0.00029280095,0.00045640563,0.0005624572],"domain_scores_gemma":[0.99587107,0.0020935766,0.000383159,0.0010006973,0.00046387862,0.00018763385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010276167,0.0002842577,0.00049300754,0.00011413613,0.0005059839,0.000079385216,0.00054183655,0.0001122932,0.00011826766],"category_scores_gemma":[0.00362942,0.00015331061,0.00030897761,0.0003510593,0.0002758505,0.00012782797,0.00018535292,0.00013564377,0.00015616603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021966694,0.000139557,0.00027780744,0.00013079657,0.00016522172,0.0000022409852,0.001756129,0.0000012461833,0.008769679,0.9605024,0.026000371,0.0022326072],"study_design_scores_gemma":[0.0008015209,0.000181759,0.0004729831,0.0006005151,0.00018292906,0.00002099937,0.0006134958,0.00023257606,0.03251498,0.95136434,0.012571192,0.00044272837],"about_ca_topic_score_codex":0.000008198745,"about_ca_topic_score_gemma":0.00001868408,"teacher_disagreement_score":0.34894463,"about_ca_system_score_codex":0.0000921501,"about_ca_system_score_gemma":0.000083622544,"threshold_uncertainty_score":0.6251825},"labels":[],"label_agreement":null},{"id":"W4412439629","doi":"10.55016/ojs/cdm.v11i1.62309","title":"Distinct values of bilinear forms on algebraic curves","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Meromorphic and Entire Functions","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Mathematics; Bilinear interpolation; Algebraic number; Combinatorics; Bilinear form; Pure mathematics; Mathematical analysis; Statistics","score_opus":0.03659989439661144,"score_gpt":0.32775517058884035,"score_spread":0.2911552761922289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412439629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26048142,0.00019603409,0.7110575,0.009302465,0.00042966523,0.0018113179,0.0029185181,0.00042506852,0.013378012],"genre_scores_gemma":[0.9831829,0.00007223762,0.010496884,0.00016722505,0.00013249328,0.0001569868,0.0000476191,0.000057717858,0.005685959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981561,0.000058614303,0.00071991276,0.00026300634,0.0004196052,0.00038280975],"domain_scores_gemma":[0.99687,0.0014808107,0.00026149338,0.00083307904,0.00035265862,0.0002019474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064610905,0.0002488246,0.00051987905,0.00013616329,0.00018248797,0.000018241046,0.0002947084,0.00009219168,0.0006460188],"category_scores_gemma":[0.0066467626,0.00014452697,0.00022598293,0.0003382512,0.00016084005,0.000105456624,0.000109374254,0.000098190976,0.00038241866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002901311,0.0004897172,0.00017249378,0.0005454112,0.00014562145,0.000002875381,0.000284124,0.0000012124117,0.002145954,0.94752747,0.047839805,0.0008162882],"study_design_scores_gemma":[0.0013734245,0.0005950172,0.00062594557,0.004234166,0.0004079594,0.000022182121,0.000242056,0.0003180848,0.013788248,0.9710334,0.0067681726,0.0005913346],"about_ca_topic_score_codex":0.000003274994,"about_ca_topic_score_gemma":0.000007833982,"teacher_disagreement_score":0.7227015,"about_ca_system_score_codex":0.00009634739,"about_ca_system_score_gemma":0.00006796594,"threshold_uncertainty_score":0.79572755},"labels":[],"label_agreement":null},{"id":"W4412439630","doi":"10.55016/ojs/cdm.v11i1.62390","title":"Automorphisms of circulants that respect partitions","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Automorphism; Mathematics; Combinatorics","score_opus":0.04983588222167305,"score_gpt":0.34409065007234896,"score_spread":0.2942547678506759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412439630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25087455,0.000049231207,0.73062,0.0068160216,0.00012382035,0.001368598,0.0035168251,0.00038559354,0.0062453095],"genre_scores_gemma":[0.97987586,0.00001151357,0.018879881,0.000045757002,0.00004386754,0.00025745566,0.000015775833,0.000029847146,0.0008400339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847835,0.00007794327,0.0005431681,0.0002507484,0.00028564202,0.00036412495],"domain_scores_gemma":[0.99720734,0.0011561828,0.0002515915,0.00090620824,0.0002833858,0.00019529193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059773726,0.00019767357,0.0004000071,0.000161769,0.00023320927,0.000024786252,0.0003536736,0.00009481692,0.00041670818],"category_scores_gemma":[0.0017448693,0.00013554125,0.00020105985,0.000418385,0.00020452595,0.00011141833,0.00010118156,0.00007904637,0.00027392688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000628093,0.0001946979,0.000094088966,0.000041396404,0.000059045997,0.0000015946582,0.0002986149,0.0000015100403,0.016914995,0.9771527,0.004995222,0.00023986267],"study_design_scores_gemma":[0.00045998886,0.000045801313,0.00033232695,0.0002767717,0.000115879506,0.00001590564,0.00013566672,0.00003832357,0.033199187,0.96199936,0.0031877256,0.00019308351],"about_ca_topic_score_codex":0.0000019958982,"about_ca_topic_score_gemma":0.0000076845845,"teacher_disagreement_score":0.7290013,"about_ca_system_score_codex":0.00008195408,"about_ca_system_score_gemma":0.000059100214,"threshold_uncertainty_score":0.5527212},"labels":[],"label_agreement":null},{"id":"W4412582169","doi":"10.55016/ojs/cdm.v12i2.62487","title":"Lower Bounds on the Distance Domination Number of a Graph","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; University of Johannesburg; National Research Foundation; National Science Foundation","keywords":"Combinatorics; Mathematics; Domination analysis; Graph; Discrete mathematics; Vertex (graph theory)","score_opus":0.020261008347206164,"score_gpt":0.3484921222010613,"score_spread":0.3282311138538551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021257693,0.000014343768,0.9630835,0.0061212685,0.00014696005,0.00048141964,0.000113399576,0.000046487752,0.008734932],"genre_scores_gemma":[0.9841904,0.0000061905494,0.014875618,0.00007892484,0.000026608683,0.000097405034,0.0000026188775,0.000009974269,0.00071226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986438,0.00007274599,0.00029007098,0.00024138541,0.00043931382,0.00031266944],"domain_scores_gemma":[0.9965122,0.00057079596,0.00026055647,0.002140434,0.00041708085,0.00009894056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089945766,0.00013870405,0.00020797686,0.000069651556,0.00088947115,0.00034650663,0.0019409149,0.000046501456,0.000034302215],"category_scores_gemma":[0.002608732,0.000092858354,0.00012400656,0.0002908726,0.00033467196,0.0003547365,0.00040706556,0.0001581976,0.00014182176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011298061,0.00007714938,0.000060113834,0.000012213132,0.00001730402,0.0000023360546,0.0003132819,0.000017133334,0.00031465624,0.998133,0.00045458868,0.0005868924],"study_design_scores_gemma":[0.0003436709,0.000077501514,0.0008929594,0.0001430576,0.000011373085,0.0000062323006,0.00006949564,0.0076246522,0.0044234917,0.9837378,0.0024887302,0.00018100944],"about_ca_topic_score_codex":0.0000028938564,"about_ca_topic_score_gemma":0.000006403948,"teacher_disagreement_score":0.9629327,"about_ca_system_score_codex":0.00006707037,"about_ca_system_score_gemma":0.000046719822,"threshold_uncertainty_score":0.68411833},"labels":[],"label_agreement":null},{"id":"W4412582188","doi":"10.55016/ojs/cdm.v12i2.62745","title":"Permutations avoiding connected graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":true,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.028515208239438185,"score_gpt":0.35768140537228726,"score_spread":0.32916619713284906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015280558,0.000037654576,0.9747915,0.0038712546,0.00016641204,0.00053089677,0.00014669698,0.00026453528,0.004910461],"genre_scores_gemma":[0.95294017,0.0000072491707,0.046234507,0.00008494033,0.000033454453,0.00012471156,0.000012078385,0.000016456761,0.0005464163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830264,0.00010150538,0.00033332992,0.00037253433,0.00035422842,0.00053573446],"domain_scores_gemma":[0.99634147,0.0005419277,0.00019584758,0.002066498,0.0005568802,0.00029736815],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00079067977,0.00018397736,0.0002600685,0.00022998676,0.0028195737,0.00092167273,0.0021583291,0.00006604244,0.000031026357],"category_scores_gemma":[0.0064657233,0.00016901895,0.00013049369,0.0003926679,0.00019881723,0.0008036791,0.0007437443,0.00026653666,0.00033586373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021617664,0.00004083202,0.000065145905,0.000012107216,0.000025426763,0.000009168285,0.0007314034,0.000060678016,0.0024473553,0.99584687,0.000268071,0.0004907674],"study_design_scores_gemma":[0.00047495967,0.000061000996,0.001102721,0.0000800175,0.000018299022,0.000024664096,0.0002433394,0.031909823,0.0050041797,0.959418,0.0013424181,0.00032057078],"about_ca_topic_score_codex":0.000006232016,"about_ca_topic_score_gemma":0.000015296233,"teacher_disagreement_score":0.9376596,"about_ca_system_score_codex":0.0000928527,"about_ca_system_score_gemma":0.00009089101,"threshold_uncertainty_score":0.9984786},"labels":[],"label_agreement":null},{"id":"W4412582193","doi":"10.55016/ojs/cdm.v12i2.62287","title":"The Forcing Strong Metric Dimension of a Graph","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Dimension (graph theory); Graph; Metric (unit); Forcing (mathematics); Discrete mathematics; Mathematical analysis","score_opus":0.017901472927710552,"score_gpt":0.29517904130806233,"score_spread":0.2772775683803518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029564485,0.00040799886,0.96427447,0.0035485374,0.00034305235,0.00042593517,0.000032676828,0.00009935935,0.001303513],"genre_scores_gemma":[0.9658943,0.000021053944,0.033869997,0.000030733885,0.0000072548337,0.000025781652,0.0000018096189,0.0000074946533,0.00014160397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986784,0.000037403242,0.00040658136,0.00021787794,0.00032678488,0.00033298266],"domain_scores_gemma":[0.99701273,0.00035154968,0.00036092987,0.0017264861,0.00041868573,0.00012959911],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00095771113,0.00013170748,0.00022920893,0.00014776453,0.0016545408,0.0003939218,0.0013056531,0.000048730057,0.0000014486099],"category_scores_gemma":[0.0017924168,0.00008520922,0.00013354018,0.00037253948,0.00014025309,0.0002443892,0.00058879843,0.00010569299,0.0000250243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019601187,0.00003245772,0.00008438269,0.000013662417,0.000027902275,0.0000010825344,0.00022776988,0.00021099106,0.0013658853,0.9958902,0.00047369173,0.0016699947],"study_design_scores_gemma":[0.0009247419,0.00020213584,0.0010861338,0.00032466865,0.00008739141,0.000014875375,0.0002759822,0.16833822,0.016677853,0.8105129,0.0011578815,0.00039719412],"about_ca_topic_score_codex":0.00002350202,"about_ca_topic_score_gemma":0.000009055815,"teacher_disagreement_score":0.9363298,"about_ca_system_score_codex":0.000027515685,"about_ca_system_score_gemma":0.000049360842,"threshold_uncertainty_score":0.9996452},"labels":[],"label_agreement":null},{"id":"W4412582201","doi":"10.55016/ojs/cdm.v12i2.62550","title":"Bounds for the m -Eternal Domination Number of a Graph","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":true,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Mathematics; Domination analysis; Graph; Discrete mathematics; Vertex (graph theory)","score_opus":0.025918743299742482,"score_gpt":0.38280737895624833,"score_spread":0.35688863565650586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054963483,0.000031717387,0.9893625,0.0030956888,0.00014250942,0.00070118567,0.00015803239,0.000032223023,0.0009798257],"genre_scores_gemma":[0.8935595,0.000009042616,0.10555439,0.000037785412,0.00005156559,0.00024432968,0.0000037442715,0.000010089872,0.0005295354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891025,0.00003265892,0.0002842566,0.0001875462,0.00029318192,0.00029210825],"domain_scores_gemma":[0.99690545,0.0007626627,0.00025424323,0.0014348581,0.00055722747,0.00008558864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009519286,0.0001086263,0.00018812451,0.00006613773,0.0009913302,0.0003579861,0.0019036431,0.000041744326,0.000010399971],"category_scores_gemma":[0.00226505,0.00007448847,0.0001532113,0.00016562828,0.00023751687,0.00037905673,0.0004132105,0.00009184684,0.000031837906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001076353,0.000036219597,0.000091105794,0.000024171766,0.000034770543,5.5970474e-7,0.0003759849,0.000027987391,0.00064149353,0.99561405,0.00028804745,0.0028548478],"study_design_scores_gemma":[0.0006533366,0.00006178269,0.0010443467,0.0000636377,0.000028506425,0.000013698255,0.00007416827,0.041591514,0.0053374376,0.9487053,0.0022813848,0.00014487325],"about_ca_topic_score_codex":0.000005897403,"about_ca_topic_score_gemma":0.000007285589,"teacher_disagreement_score":0.8880632,"about_ca_system_score_codex":0.00004294191,"about_ca_system_score_gemma":0.000054476986,"threshold_uncertainty_score":0.7624611},"labels":[],"label_agreement":null},{"id":"W4412582204","doi":"10.55016/ojs/cdm.v12i2.62488","title":"Split (n + t)-color partitions and 2-color F-partitions","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Color Science and Applications","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Council of Scientific and Industrial Research, India","keywords":"Combinatorics; Mathematics","score_opus":0.014824146259061383,"score_gpt":0.33193528487317103,"score_spread":0.31711113861410967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582204","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7851921,0.000026568498,0.14712912,0.021766009,0.0001630983,0.0015039805,0.0030935837,0.00012839853,0.040997185],"genre_scores_gemma":[0.9923615,0.0000028276343,0.005135718,0.00008621593,0.0001619497,0.0007577786,0.00006502407,0.000011481916,0.0014174889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989225,0.000014080459,0.00028578012,0.00027591962,0.00013931627,0.00036235052],"domain_scores_gemma":[0.998472,0.00010797322,0.00016029643,0.0008105145,0.00018490278,0.0002643127],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00020145305,0.00015707218,0.00021929128,0.000056170215,0.0022524886,0.0004853785,0.00038154985,0.00003959368,0.00039334918],"category_scores_gemma":[0.00015771468,0.00014371464,0.000095860654,0.00013823535,0.0002590634,0.00029706897,0.00022941288,0.00011289179,0.0005069786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020777836,0.00016601475,0.0013134101,0.000007874933,0.000032600696,5.8472466e-7,0.0003361519,0.00006370728,0.0012776413,0.99203086,0.0038892082,0.0008798505],"study_design_scores_gemma":[0.0014714198,0.00018609199,0.038491435,0.00019290525,0.00042615508,0.0000094826755,0.0022798455,0.018368071,0.0059760716,0.8043912,0.12712294,0.0010843747],"about_ca_topic_score_codex":0.00004756931,"about_ca_topic_score_gemma":0.000039960112,"teacher_disagreement_score":0.20716946,"about_ca_system_score_codex":0.00003632865,"about_ca_system_score_gemma":0.000076536824,"threshold_uncertainty_score":0.99904644},"labels":[],"label_agreement":null},{"id":"W4412582216","doi":"10.55016/ojs/cdm.v12i2.62496","title":"On combinatorial extensions of Rogers-Ramanujan type identities","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Type (biology); Combinatorics; Combinatorial proof; Ramanujan's sum","score_opus":0.04324982663820147,"score_gpt":0.3888282136038647,"score_spread":0.34557838696566323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66338164,0.00017002432,0.21772179,0.0032872623,0.004687403,0.0043552355,0.0017977193,0.00082808465,0.10377087],"genre_scores_gemma":[0.97237265,0.000017187103,0.022374032,0.000042626096,0.0001627371,0.00007918298,0.000017168168,0.000074598436,0.0048598233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976147,0.000055886932,0.0008579764,0.00032595586,0.0006471369,0.00049838476],"domain_scores_gemma":[0.9947405,0.0014208418,0.00066875754,0.0020317023,0.0008940977,0.0002441136],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005945518,0.00034037663,0.0008239499,0.00018798247,0.0008679744,0.00025617838,0.000915538,0.00015892436,0.00023789897],"category_scores_gemma":[0.024695491,0.00030184368,0.0002447929,0.00016389147,0.00043185658,0.00033940602,0.00046717108,0.00024885338,0.00031429454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000289556,0.00032474607,0.000011385905,0.00022299717,0.00008261996,0.0000104255305,0.000564749,0.000011875128,0.00086499634,0.9909998,0.0068509276,0.000026494612],"study_design_scores_gemma":[0.00073448214,0.00020436669,0.00006613988,0.00052528206,0.00017683933,0.000011097523,0.0004555347,0.00032662935,0.006802747,0.9901068,0.00026856054,0.00032149255],"about_ca_topic_score_codex":0.000008533145,"about_ca_topic_score_gemma":0.000010531476,"teacher_disagreement_score":0.30899104,"about_ca_system_score_codex":0.00015236971,"about_ca_system_score_gemma":0.00008451623,"threshold_uncertainty_score":0.9999434},"labels":[],"label_agreement":null},{"id":"W4412582229","doi":"10.55016/ojs/cdm.v12i2.62481","title":"Ball hulls, ball intersections, and 2-center problems for gauges","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Junta de Extremadura","keywords":"Ball (mathematics); Mathematics; Hull; Combinatorics; Center (category theory); Geometry; Engineering; Marine engineering; Crystallography","score_opus":0.021089062618290574,"score_gpt":0.30980261489859967,"score_spread":0.2887135522803091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007324416,0.00008178368,0.98458415,0.0059646545,0.0003450576,0.0006744114,0.0001849893,0.000077285156,0.0007632566],"genre_scores_gemma":[0.86808234,0.000024088318,0.13008147,0.00024844968,0.00016915891,0.00022981087,0.00006056651,0.000011532427,0.0010925417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990638,0.00001956555,0.0002600205,0.00028158203,0.00014243365,0.00023258988],"domain_scores_gemma":[0.9987028,0.00013512248,0.00014748421,0.00055526395,0.00032455975,0.00013472298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003477679,0.0001339505,0.00017220847,0.00010353619,0.0008383009,0.00069430633,0.0005050406,0.00005145375,0.000007520893],"category_scores_gemma":[0.00064730813,0.00012226947,0.000072025585,0.00008955289,0.000048449587,0.00044054858,0.00031017122,0.00006542257,0.000028121724],"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.0000100627,0.0002401531,0.00023169816,0.00015156053,0.00009227726,0.0000017606078,0.0014622387,0.00063554826,0.0023750688,0.9757342,0.01000979,0.009055674],"study_design_scores_gemma":[0.0031477383,0.0005332439,0.005278471,0.00042719475,0.00010058121,0.00011273109,0.00021539092,0.58770037,0.004788754,0.25470433,0.1420121,0.0009790806],"about_ca_topic_score_codex":0.0000056513636,"about_ca_topic_score_gemma":0.000032128017,"teacher_disagreement_score":0.86075795,"about_ca_system_score_codex":0.00005214334,"about_ca_system_score_gemma":0.000044093773,"threshold_uncertainty_score":0.66952115},"labels":[],"label_agreement":null},{"id":"W4412582233","doi":"10.55016/ojs/cdm.v12i2.62785","title":"Internal and external duality in abstract polytopes","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Duality (order theory)","score_opus":0.016404281631802912,"score_gpt":0.302181869160699,"score_spread":0.2857775875288961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45393986,0.0003337518,0.50934017,0.0015151364,0.00047294263,0.0005837347,0.00040444263,0.00027413917,0.03313586],"genre_scores_gemma":[0.99389786,0.000034880934,0.0057589407,0.000023589864,0.000037683672,0.000013794117,0.0000047869444,0.000012308462,0.00021613484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994372,0.000006249739,0.00022583186,0.0000914652,0.00006890134,0.00017032387],"domain_scores_gemma":[0.99950004,0.00004039579,0.00004696428,0.00028280978,0.000038630897,0.000091137714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021287562,0.00009880258,0.0001493666,0.000057261866,0.00013268972,0.00024703942,0.00016806003,0.000047415495,0.000063875006],"category_scores_gemma":[0.0002593212,0.0000932203,0.00002649358,0.00003258775,0.00004070172,0.00014757457,0.000064933745,0.000110928086,0.000038296523],"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.00011008928,0.0008054387,0.08955087,0.0026971868,0.0005411034,0.00016625373,0.023196377,0.13733287,0.030145029,0.6500524,0.009828266,0.0555741],"study_design_scores_gemma":[0.0037735526,0.000101326594,0.42403343,0.0024701841,0.000088733475,0.000100139354,0.000488851,0.48994645,0.008819373,0.057130028,0.011419744,0.0016281662],"about_ca_topic_score_codex":0.000029950577,"about_ca_topic_score_gemma":0.000057152676,"teacher_disagreement_score":0.5929224,"about_ca_system_score_codex":0.000041326402,"about_ca_system_score_gemma":0.000008004905,"threshold_uncertainty_score":0.38014135},"labels":[],"label_agreement":null},{"id":"W4412582246","doi":"10.55016/ojs/cdm.v12i2.62514","title":"Degree Associated Reconstruction Parameters of Total Graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Degree (music); Combinatorics","score_opus":0.032414841910564075,"score_gpt":0.3101735317346863,"score_spread":0.2777586898241222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057448078,0.00002082482,0.93407536,0.0008101661,0.00017362104,0.00029832628,0.00012161751,0.0003163794,0.006735637],"genre_scores_gemma":[0.710104,0.000002057296,0.2897111,0.00001885232,0.0000052787027,0.000027274536,0.000004415127,0.0000075869725,0.00011944723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988519,0.000024623449,0.00038433057,0.00023851098,0.00023672619,0.00026392043],"domain_scores_gemma":[0.9977063,0.000103805025,0.00048034947,0.0011263397,0.00047255342,0.00011067452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039403012,0.00014508609,0.00028238774,0.00013301846,0.00035711026,0.00066756376,0.0010289914,0.00007880521,0.0000029490213],"category_scores_gemma":[0.0034147198,0.00013559381,0.000120545126,0.00020882754,0.00019718778,0.0010687953,0.00044140068,0.00009957757,0.000018772673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011832935,0.0005250202,0.0011971085,0.00015350993,0.0002565963,0.000016881628,0.001372426,0.00002621841,0.0083786445,0.7630411,0.0025294982,0.22249119],"study_design_scores_gemma":[0.0007231282,0.00028625721,0.005044261,0.0008732681,0.00008667143,0.00010595647,0.00009332125,0.043800775,0.10571063,0.8424964,0.00006954563,0.0007098016],"about_ca_topic_score_codex":0.00001340622,"about_ca_topic_score_gemma":0.000005237365,"teacher_disagreement_score":0.65265596,"about_ca_system_score_codex":0.00007963002,"about_ca_system_score_gemma":0.00006844008,"threshold_uncertainty_score":0.64373326},"labels":[],"label_agreement":null},{"id":"W4412582248","doi":"10.55016/ojs/cdm.v12i2.62380","title":"On Chromatic Number of General Kneser Graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Discrete mathematics","score_opus":0.014544447626875321,"score_gpt":0.30835567676570436,"score_spread":0.293811229138829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5610556,0.00004155038,0.41865808,0.0036113996,0.0005094995,0.0005862516,0.00012119762,0.00017826913,0.015238187],"genre_scores_gemma":[0.92541516,0.000003466068,0.07370066,0.00014744006,0.000007753544,0.000034314864,0.000004297915,0.000010461558,0.0006764498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987013,0.000032584398,0.00039526328,0.00025509694,0.00031961995,0.00029615773],"domain_scores_gemma":[0.99735934,0.00012894283,0.0002796612,0.0017771166,0.00029125906,0.00016367371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039749613,0.00016287254,0.00030451492,0.000098117765,0.0005065675,0.00022980759,0.00110348,0.000066768705,0.000044878903],"category_scores_gemma":[0.00081740983,0.00012984422,0.0001390633,0.00018707642,0.00011794713,0.00021308233,0.0003284804,0.00009574093,0.00042243968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017339878,0.00009760195,0.00010807009,0.000029718694,0.00002592661,0.0000027545043,0.00024720628,0.00007528782,0.0011504869,0.99608207,0.0019824218,0.00019672209],"study_design_scores_gemma":[0.0005055673,0.0000771139,0.0008327802,0.00020671175,0.000025814836,0.000013978409,0.000011892243,0.026779333,0.005219526,0.96592927,0.00017791231,0.00022009501],"about_ca_topic_score_codex":0.000019008972,"about_ca_topic_score_gemma":0.0000026265193,"teacher_disagreement_score":0.3643596,"about_ca_system_score_codex":0.000025483652,"about_ca_system_score_gemma":0.00004603034,"threshold_uncertainty_score":0.5429748},"labels":[],"label_agreement":null},{"id":"W4412582255","doi":"10.55016/ojs/cdm.v12i2.62508","title":"On Cops and Robbers on G Ξ and cop-edge critical graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Center for Research and Development in Mathematics and Applications","keywords":"Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Computer science; Artificial intelligence","score_opus":0.023302382710995946,"score_gpt":0.3636016574214429,"score_spread":0.34029927471044696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07652333,0.00013073681,0.9038384,0.011902648,0.00021169437,0.00075513683,0.00022821133,0.00015984272,0.0062499987],"genre_scores_gemma":[0.9798329,0.000022523778,0.019607432,0.0002620676,0.000020080948,0.000051096344,0.0000026555922,0.000013132131,0.0001881405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862057,0.000064161846,0.00020729906,0.00039323297,0.00029498097,0.00041973012],"domain_scores_gemma":[0.9970974,0.0011148663,0.00006864359,0.0011898964,0.00018153501,0.00034770378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052772753,0.00017880097,0.0002507793,0.00014908343,0.0011053717,0.0006157768,0.0007294475,0.00006959202,0.000008801117],"category_scores_gemma":[0.0044738976,0.00015048355,0.000049388243,0.00013228739,0.0005039362,0.0003169876,0.0005195061,0.00022325527,0.00006908841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012649734,0.000051586438,0.000043614044,0.000024241694,0.0000122541815,0.000011853207,0.0002399878,0.00000733445,0.00015069846,0.9977582,0.00043436096,0.0012531854],"study_design_scores_gemma":[0.000564685,0.00036328653,0.0012496226,0.00017345148,0.000014003731,0.000022633227,0.00005878746,0.011254995,0.0009829648,0.98455334,0.0005102199,0.00025203414],"about_ca_topic_score_codex":0.000002226569,"about_ca_topic_score_gemma":0.0000038610083,"teacher_disagreement_score":0.9033095,"about_ca_system_score_codex":0.00004477719,"about_ca_system_score_gemma":0.000031047184,"threshold_uncertainty_score":0.8501737},"labels":[],"label_agreement":null},{"id":"W4412582259","doi":"10.55016/ojs/cdm.v12i2.62479","title":"On the metric dimension of circulant graphs with 4 generators","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation","keywords":"Circulant matrix; Mathematics; Metric dimension; Dimension (graph theory); Combinatorics; Metric (unit); Discrete mathematics; Graph; Chordal graph; 1-planar graph","score_opus":0.016319587907723282,"score_gpt":0.2642509834178813,"score_spread":0.247931395510158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47062013,0.00012246848,0.52122205,0.005778768,0.00021707607,0.0006458452,0.000066799534,0.000112850656,0.0012140038],"genre_scores_gemma":[0.98243874,0.0000060137636,0.017290676,0.00018290135,0.0000040286964,0.000031134114,0.0000025695201,0.000008631223,0.000035274916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987935,0.00004617044,0.00027941514,0.00024533522,0.00038749713,0.00024810742],"domain_scores_gemma":[0.9971776,0.00027555833,0.0002821385,0.0017936372,0.00035195175,0.000119114506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006076475,0.0001513301,0.00023726112,0.00017774195,0.00080904464,0.00022014484,0.0009980045,0.00004523252,0.000005247276],"category_scores_gemma":[0.0008772316,0.00008157634,0.0000890159,0.0004558856,0.0001369673,0.00012238992,0.00024454558,0.00010846309,0.00003886034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029282496,0.00006506961,0.00007692515,0.0000096326685,0.000033802295,0.0000030124952,0.00018960527,0.00032579587,0.0016079372,0.9968376,0.0006643387,0.00018335451],"study_design_scores_gemma":[0.00095277315,0.00052901584,0.0010343101,0.00043689483,0.000101881415,0.00002688834,0.000116162446,0.06541271,0.047282796,0.8834035,0.00023396025,0.00046913937],"about_ca_topic_score_codex":0.000014810255,"about_ca_topic_score_gemma":0.0000033839162,"teacher_disagreement_score":0.51181865,"about_ca_system_score_codex":0.00002313198,"about_ca_system_score_gemma":0.00005249239,"threshold_uncertainty_score":0.6222599},"labels":[],"label_agreement":null},{"id":"W4412582263","doi":"10.55016/ojs/cdm.v12i2.62445","title":"On the total signed domination number of the Cartesian product of paths","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Cartesian product; Mathematics; Combinatorics; Product (mathematics); Geometry","score_opus":0.015871039270510267,"score_gpt":0.32509482120535843,"score_spread":0.3092237819348482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2407194,0.000018721683,0.7407928,0.011002216,0.00021200666,0.0015229365,0.00018885842,0.00003563445,0.005507434],"genre_scores_gemma":[0.99383473,8.4663975e-7,0.0056207054,0.000020429034,0.000021030663,0.000058149522,0.0000011920217,0.0000073197825,0.00043560885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871254,0.0001326549,0.0003007605,0.00019289862,0.0004361104,0.0002250545],"domain_scores_gemma":[0.99634176,0.00056263007,0.00034253718,0.002235603,0.00046471675,0.000052776264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009398608,0.00011225704,0.00019946763,0.00004107663,0.00057600735,0.00010081505,0.0017390604,0.000032264303,0.000018752875],"category_scores_gemma":[0.0048325122,0.00006141494,0.0001238035,0.00025988682,0.0002998531,0.0001944906,0.00052315975,0.00012830774,0.000027850565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057527054,0.00006527379,0.000054012748,0.000019962745,0.000016892596,4.214498e-7,0.0007407679,0.00006247923,0.0055315173,0.9926744,0.00018140486,0.0006471205],"study_design_scores_gemma":[0.00045933542,0.00010221506,0.0044238716,0.00022352676,0.000026825006,0.00001291961,0.0001844135,0.014028611,0.12337942,0.8568845,0.000085851185,0.0001885206],"about_ca_topic_score_codex":0.0000050877634,"about_ca_topic_score_gemma":0.0000027694712,"teacher_disagreement_score":0.75311536,"about_ca_system_score_codex":0.00004564321,"about_ca_system_score_gemma":0.00007511436,"threshold_uncertainty_score":0.57853174},"labels":[],"label_agreement":null},{"id":"W4412582271","doi":"10.55016/ojs/cdm.v12i2.62342","title":"The Outercoarseness of the n-cube","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cube (algebra); Combinatorics; Mathematics","score_opus":0.01214290612318316,"score_gpt":0.2730259981374543,"score_spread":0.2608830920142712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412582271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041573703,0.00043235152,0.87073225,0.014026551,0.00342967,0.0020127783,0.0008813206,0.0004461465,0.06646526],"genre_scores_gemma":[0.99763644,0.000029769124,0.0013426235,0.000023440722,0.000037230908,0.000028161125,0.0000028466054,0.000015454534,0.00088404317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994433,0.0000136489,0.0002113697,0.000056340014,0.00011821105,0.00015716467],"domain_scores_gemma":[0.9987985,0.00009188071,0.00008067422,0.0008647619,0.00012185176,0.00004236916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021755962,0.00008382467,0.00011609011,0.000014604312,0.00070184766,0.00016678199,0.00055577734,0.000039400024,0.000011645737],"category_scores_gemma":[0.0005183427,0.00004694036,0.000071521,0.0000657061,0.000102483944,0.000058889884,0.00010995287,0.0000778335,0.00003129313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008166145,0.000075597694,0.000943253,0.00032152707,0.00026571748,0.0000013210134,0.003850596,0.1574184,0.0032583703,0.8104262,0.018053124,0.005377762],"study_design_scores_gemma":[0.0014833043,0.000053503412,0.00723773,0.00084269873,0.00023589628,0.000019404351,0.0007407088,0.7257467,0.03910525,0.055090033,0.16856043,0.000884339],"about_ca_topic_score_codex":0.0000030466947,"about_ca_topic_score_gemma":0.00002155608,"teacher_disagreement_score":0.95606273,"about_ca_system_score_codex":0.000027872724,"about_ca_system_score_gemma":0.000016179574,"threshold_uncertainty_score":0.53981155},"labels":[],"label_agreement":null},{"id":"W4412617744","doi":"10.55016/ojs/cdm.v12i1.62349","title":"Comments on the Golden Partition Conjecture","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conjecture; Partition (number theory); Mathematics; Combinatorics; Genealogy; History","score_opus":0.07582106081252431,"score_gpt":0.4071750072494486,"score_spread":0.3313539464369243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617744","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35120964,0.00004978808,0.2807146,0.20084368,0.00068954757,0.006873365,0.0022763466,0.000568906,0.15677413],"genre_scores_gemma":[0.992302,0.0000044524945,0.001771637,0.00050385075,0.00017079935,0.0002120787,0.000019346488,0.000041002706,0.004974861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981072,0.00015744237,0.0004059373,0.00026435137,0.00055180624,0.0005132606],"domain_scores_gemma":[0.99548143,0.0015931043,0.00028664726,0.0021614397,0.00026472815,0.00021267797],"candidate_categories":["metaresearch","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015038238,0.00024403518,0.0003612788,0.00006708687,0.0016710635,0.00046399856,0.0011441461,0.00011067618,0.000623926],"category_scores_gemma":[0.009535108,0.00015483185,0.00016827676,0.0001116497,0.00027846114,0.00012446872,0.00037593048,0.00035554587,0.0011978119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015801092,0.00013892267,0.00008067048,0.00003486015,0.00010077083,0.000007193146,0.00041076963,0.0000036660956,0.00013839711,0.9541535,0.044790126,0.00012531308],"study_design_scores_gemma":[0.0005941157,0.000104180814,0.00030584724,0.00025477633,0.0001164696,0.000012025851,0.0004686771,0.0015698215,0.0021519319,0.98554116,0.008618256,0.00026275218],"about_ca_topic_score_codex":0.000010468636,"about_ca_topic_score_gemma":0.000025363119,"teacher_disagreement_score":0.6410923,"about_ca_system_score_codex":0.00019170188,"about_ca_system_score_gemma":0.00005702929,"threshold_uncertainty_score":0.9996286},"labels":[],"label_agreement":null},{"id":"W4412617745","doi":"10.55016/ojs/cdm.v12i1.62277","title":"Independence complexes and incidence graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Independence (probability theory); Mathematics; Combinatorics; Independence number; Genealogy; Discrete mathematics; Graph; Statistics; History","score_opus":0.01821556129790029,"score_gpt":0.3112182112554097,"score_spread":0.2930026499575094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036113888,0.00013109496,0.9591743,0.0026716173,0.00011048899,0.00027692897,0.00004231281,0.00012394303,0.0013554695],"genre_scores_gemma":[0.9171025,0.000019824676,0.08250148,0.00017581576,0.000021938396,0.000030888397,0.0000018760146,0.000005592728,0.00014006521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988837,0.000022201455,0.000224921,0.00031156463,0.00024832698,0.00030924552],"domain_scores_gemma":[0.9981125,0.00014516347,0.00017109068,0.0011841969,0.00019193836,0.000195083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030069146,0.0001496396,0.00022205235,0.00006958991,0.0010577947,0.00058171817,0.0013325816,0.000059367947,0.000008364652],"category_scores_gemma":[0.0011112436,0.00012608206,0.0000590726,0.000118615615,0.0001849028,0.00074381125,0.00090340246,0.00013874886,0.00007196467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.864648e-7,0.000019225956,0.0005552816,0.00001226085,0.000009068739,0.0000094086145,0.00034699807,0.000011654182,0.00055883464,0.9965305,0.00011398793,0.0018318061],"study_design_scores_gemma":[0.00027936007,0.00006573916,0.016037695,0.00008996136,0.000014944054,0.000055895845,0.00006804611,0.010808256,0.0013714321,0.97025007,0.0006668226,0.00029177038],"about_ca_topic_score_codex":0.00001149997,"about_ca_topic_score_gemma":0.000022051967,"teacher_disagreement_score":0.88098866,"about_ca_system_score_codex":0.000030442508,"about_ca_system_score_gemma":0.000040399544,"threshold_uncertainty_score":0.8135808},"labels":[],"label_agreement":null},{"id":"W4412617746","doi":"10.55016/ojs/cdm.v12i1.62581","title":"Conjectures on uniquely 3-edge-colorable graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Edge coloring; Discrete mathematics; Graph; Computer science; Line graph; Artificial intelligence","score_opus":0.018878948315707942,"score_gpt":0.30164947933759173,"score_spread":0.28277053102188376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.103090696,0.00027371853,0.8270787,0.02689476,0.0014390487,0.0017531071,0.00027247026,0.0011685181,0.03802895],"genre_scores_gemma":[0.9584468,0.000010886721,0.03974871,0.00081923837,0.00000915152,0.00007626424,0.000007054164,0.000015715701,0.0008661884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984778,0.000047275375,0.00033258824,0.00039201495,0.000306402,0.00044390283],"domain_scores_gemma":[0.99693024,0.00018430734,0.00022621409,0.0020336285,0.00036373577,0.00026184766],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005669508,0.00022027805,0.00030191685,0.00017182779,0.0013631058,0.000792619,0.0015266759,0.00010381835,0.000017573828],"category_scores_gemma":[0.001282796,0.00017682422,0.00013422318,0.00021906332,0.00014237367,0.00027765584,0.00040005206,0.00018834465,0.00035748782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036923443,0.00007950138,0.000032266096,0.0000135317005,0.000023560888,0.000007169607,0.00027397144,0.000150028,0.00081435527,0.9926761,0.005516636,0.0004092343],"study_design_scores_gemma":[0.0005579086,0.0002102257,0.00050880836,0.00016402964,0.000024842368,0.0000121382145,0.000027185626,0.011274373,0.008199714,0.9743006,0.004377297,0.00034288177],"about_ca_topic_score_codex":0.000024200946,"about_ca_topic_score_gemma":0.000010550792,"teacher_disagreement_score":0.8553561,"about_ca_system_score_codex":0.000048237966,"about_ca_system_score_gemma":0.00008267759,"threshold_uncertainty_score":0.999937},"labels":[],"label_agreement":null},{"id":"W4412617747","doi":"10.55016/ojs/cdm.v12i1.62236","title":"Congruences modulo powers of 2 and 3 for a restricted binary partition function a la Andrews and Lewis","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Congruence relation; Modulo; Mathematics; Partition (number theory); Combinatorics; Binary number; Arithmetic","score_opus":0.04227631620074517,"score_gpt":0.37314860189541027,"score_spread":0.3308722856946651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617747","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53003854,0.00025578015,0.4630283,0.0014839157,0.0001181376,0.0019809713,0.0009224617,0.00012848082,0.0020433874],"genre_scores_gemma":[0.9535805,0.00007741768,0.045294557,0.0000153608,0.000040782234,0.0002417297,0.000018730989,0.000028813796,0.0007021045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872833,0.000043465032,0.00051426963,0.00025030953,0.00019847277,0.00026517044],"domain_scores_gemma":[0.9973081,0.0012240869,0.00044181346,0.0005301223,0.00034947167,0.00014644132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046163469,0.00020025157,0.00048315534,0.00011793596,0.0005105421,0.00019358835,0.00017925355,0.00012119017,0.000013288431],"category_scores_gemma":[0.007961529,0.00017498924,0.00007831043,0.000083945146,0.00043113602,0.00039103304,0.00017163916,0.000094787916,0.000003038331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007220024,0.00014665486,0.00011236466,0.00095362274,0.00009984132,0.0000024420156,0.000952975,0.000007173992,0.0039607123,0.9919972,0.0013157458,0.00037908374],"study_design_scores_gemma":[0.0009594167,0.00026490793,0.0008481185,0.00040358226,0.00027763026,0.000015629264,0.000977911,0.005010826,0.0012779109,0.9891405,0.0005943601,0.00022920364],"about_ca_topic_score_codex":0.000010817068,"about_ca_topic_score_gemma":0.000023345081,"teacher_disagreement_score":0.42354196,"about_ca_system_score_codex":0.00003813372,"about_ca_system_score_gemma":0.000037377773,"threshold_uncertainty_score":0.95312697},"labels":[],"label_agreement":null},{"id":"W4412617749","doi":"10.55016/ojs/cdm.v12i1.62531","title":"Closing the Gap: Eternal Domination on 3 x n Grids","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Closing (real estate); Combinatorics; Mathematics; Law; Political science","score_opus":0.027804162392918913,"score_gpt":0.3259153034617716,"score_spread":0.2981111410688527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009598521,0.000017655608,0.96729535,0.010030315,0.0011440413,0.0003748085,0.000026493875,0.000079531535,0.011433274],"genre_scores_gemma":[0.9946579,0.0000029734633,0.003662042,0.0002975486,0.0003784243,0.00005555473,0.0000026202172,0.000008094349,0.0009348716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888515,0.000065906555,0.00029913106,0.00021412072,0.0002752266,0.00026043624],"domain_scores_gemma":[0.9979606,0.00021499622,0.000238938,0.0012606046,0.00023954346,0.000085297055],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007961494,0.00013054273,0.00017024938,0.000058399957,0.0015256278,0.0011807571,0.0012473688,0.000057786965,0.000012139025],"category_scores_gemma":[0.0006878565,0.00008458399,0.000110130015,0.00009160757,0.00005609349,0.00030811693,0.0002536807,0.00015231059,0.00022578337],"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.000003562497,0.00003116324,0.00002776213,0.000007937544,0.000020853926,0.000003450149,0.0007777322,0.0002523401,0.00019241769,0.99172467,0.004132642,0.002825467],"study_design_scores_gemma":[0.0011791812,0.00033903084,0.0028559112,0.0007196052,0.000051302493,0.00011932952,0.0003070104,0.82160795,0.0040835845,0.13067003,0.037411943,0.0006551205],"about_ca_topic_score_codex":0.00001769411,"about_ca_topic_score_gemma":0.000016298409,"teacher_disagreement_score":0.9850593,"about_ca_system_score_codex":0.000108178174,"about_ca_system_score_gemma":0.000028643217,"threshold_uncertainty_score":0.9998561},"labels":[],"label_agreement":null},{"id":"W4412617754","doi":"10.55016/ojs/cdm.v12i1.62402","title":"Some non-existence results for distance- j ovoids in small generalized polygons","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.06182706065280062,"score_gpt":0.3743802658007771,"score_spread":0.31255320514797647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617754","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07844204,0.00011564113,0.88662505,0.01265653,0.00033109894,0.0059588887,0.006880515,0.0002400432,0.008750214],"genre_scores_gemma":[0.48410228,0.00005827383,0.50418943,0.00018706979,0.0004965637,0.0029002745,0.00018261421,0.00011609389,0.0077674203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99725705,0.00003229239,0.0011916626,0.0005327012,0.00024833245,0.00073795376],"domain_scores_gemma":[0.995341,0.0009041184,0.00069121225,0.002396486,0.0003735554,0.00029361824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011875902,0.00038700298,0.00077595445,0.00016634267,0.0010593154,0.00039330393,0.0011908809,0.00017980496,0.000013320583],"category_scores_gemma":[0.0065800073,0.00034916948,0.00027346084,0.00019157298,0.00017743927,0.0002058901,0.00030929802,0.00021074181,0.000067074776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046621004,0.00037845652,0.000022123848,0.00029471138,0.000045494126,0.000003616317,0.001030848,0.000015069403,0.000926835,0.98346156,0.013629044,0.000145621],"study_design_scores_gemma":[0.0031171232,0.00008839916,0.00018173837,0.0005357026,0.0001353489,0.0000073379506,0.00029956372,0.02016216,0.0022139393,0.9605553,0.012072548,0.0006308291],"about_ca_topic_score_codex":0.000041336956,"about_ca_topic_score_gemma":0.00037290374,"teacher_disagreement_score":0.40566024,"about_ca_system_score_codex":0.00020834025,"about_ca_system_score_gemma":0.00012728867,"threshold_uncertainty_score":0.99989605},"labels":[],"label_agreement":null},{"id":"W4412617757","doi":"10.55016/ojs/cdm.v12i1.62344","title":"α-Resolvable λ-fold G-designs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fold (higher-order function); Combinatorics; Mathematics; Computer science; Programming language","score_opus":0.019686769001258552,"score_gpt":0.27854811497171394,"score_spread":0.2588613459704554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09197195,0.00042365864,0.7731732,0.000870921,0.0013217191,0.0012600868,0.0008277643,0.0011141752,0.12903649],"genre_scores_gemma":[0.9965375,0.000008584074,0.0018945348,0.00002271781,0.000116630574,0.00009973114,0.000011646559,0.00003309712,0.0012755806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906826,0.000018149289,0.00027503818,0.00013579597,0.00014015475,0.00036259796],"domain_scores_gemma":[0.9985874,0.00007084814,0.00006160938,0.0010146202,0.00008656399,0.00017893342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033996947,0.0001746848,0.0002641296,0.00006704072,0.00060605607,0.00027747257,0.0005053535,0.00008695864,0.000099598816],"category_scores_gemma":[0.00035879816,0.00016085121,0.00010539646,0.00007761854,0.00006002039,0.00017903459,0.000073611984,0.00011525095,0.00070715987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007603373,0.00006593602,0.00014139243,0.00024165185,0.00018516832,0.000017039272,0.0010646537,0.0028229908,0.016836235,0.95693815,0.021119786,0.0005594106],"study_design_scores_gemma":[0.003518991,0.00031425265,0.0028514545,0.0016346787,0.00054792524,0.00012614978,0.0019920205,0.1885662,0.0955096,0.46177676,0.23970598,0.0034559797],"about_ca_topic_score_codex":0.000005434078,"about_ca_topic_score_gemma":0.000009588097,"teacher_disagreement_score":0.9045655,"about_ca_system_score_codex":0.00006200301,"about_ca_system_score_gemma":0.000013437999,"threshold_uncertainty_score":0.9089345},"labels":[],"label_agreement":null},{"id":"W4412617758","doi":"10.55016/ojs/cdm.v12i1.62743","title":"The Spectrum of Balanced P^(3)(1, 5)-Designs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Spectrum (functional analysis); Physics","score_opus":0.012829032395431789,"score_gpt":0.26471875447806387,"score_spread":0.25188972208263205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20672663,0.0008616487,0.7059011,0.003238633,0.0024129918,0.0019247867,0.0009915085,0.00059492566,0.07734778],"genre_scores_gemma":[0.9990089,0.00002192427,0.00039069535,0.0000053694093,0.0000628796,0.00004721259,0.0000033910762,0.000016592589,0.00044305617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992371,0.00002020715,0.00028771767,0.0000794696,0.00012256134,0.0002529006],"domain_scores_gemma":[0.9987192,0.00013529875,0.00009630731,0.00090768846,0.00006280131,0.00007867692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003875164,0.00011670548,0.00021110814,0.000030714553,0.00058604253,0.00012424534,0.000521162,0.000048489106,0.000016381808],"category_scores_gemma":[0.00039309124,0.000081895894,0.00009493025,0.00006675651,0.00011440199,0.00007277566,0.000054727832,0.000084548,0.00007940904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007725783,0.000021010563,0.000101188394,0.00009595632,0.000113637776,0.0000019765766,0.00054051785,0.00058310595,0.009271228,0.98612696,0.0027891924,0.00034752907],"study_design_scores_gemma":[0.0018511164,0.00023382134,0.006541707,0.00083890575,0.00025867543,0.000039953986,0.0018904866,0.071013704,0.14410761,0.7217574,0.050252296,0.0012143059],"about_ca_topic_score_codex":0.0000029147513,"about_ca_topic_score_gemma":0.000014209024,"teacher_disagreement_score":0.7922823,"about_ca_system_score_codex":0.000033080785,"about_ca_system_score_gemma":0.000011874751,"threshold_uncertainty_score":0.45074245},"labels":[],"label_agreement":null},{"id":"W4412617759","doi":"10.55016/ojs/cdm.v12i1.62175","title":"Bounds on several versions of restrained domination number","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Graph","score_opus":0.022056640730318405,"score_gpt":0.3656217373183562,"score_spread":0.3435650965880378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036140222,0.00000441966,0.9448117,0.0035669324,0.00015513581,0.0004307636,0.00017765249,0.00007214012,0.014641022],"genre_scores_gemma":[0.94289,0.0000032836922,0.056011677,0.00004148056,0.000031013406,0.000034788503,0.000009392634,0.000009189819,0.0009691558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987014,0.000057916783,0.00028424896,0.0002438186,0.0003963886,0.0003162582],"domain_scores_gemma":[0.99734795,0.00032648977,0.0002111284,0.0015665076,0.00039062966,0.00015729696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005713218,0.00012988523,0.00022178887,0.000116021234,0.0007576623,0.00022780604,0.0013597724,0.00006252502,0.00004007414],"category_scores_gemma":[0.002586605,0.000115455034,0.000104084385,0.00021409433,0.00019168918,0.00044810204,0.00044129437,0.00014463965,0.00021254091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015214933,0.00008525164,0.00004319676,0.00001563416,0.000018574048,0.000004628001,0.00042663814,0.00010113518,0.0010251455,0.99693894,0.0006770356,0.000648623],"study_design_scores_gemma":[0.0017733916,0.0003014471,0.004564664,0.00028571574,0.000030338375,0.00002050967,0.00017244063,0.048297986,0.013478759,0.9273472,0.0032760743,0.00045148717],"about_ca_topic_score_codex":0.0000052152113,"about_ca_topic_score_gemma":0.000004382359,"teacher_disagreement_score":0.9067498,"about_ca_system_score_codex":0.00010595145,"about_ca_system_score_gemma":0.00008258006,"threshold_uncertainty_score":0.58274025},"labels":[],"label_agreement":null},{"id":"W4412617760","doi":"10.55016/ojs/cdm.v12i1.62559","title":"ON THE SPECTRUM OF OCTAGON QUADRANGLE SYSTEMS OF ANY INDEX","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quadrangle; Mathematics; Index (typography); Spectrum (functional analysis); Combinatorics; Geography; Computer science; Archaeology; Physics","score_opus":0.031044708136879103,"score_gpt":0.33760125708704514,"score_spread":0.30655654895016604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.249794,0.000033519013,0.7433167,0.0009030067,0.00023577955,0.0011595233,0.0006859593,0.0000397539,0.003831773],"genre_scores_gemma":[0.99812424,0.000003185399,0.0012192809,0.000008728195,0.000060614555,0.00008017001,0.000008882637,0.000023248633,0.00047162242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825794,0.00007799941,0.00078665256,0.00018088544,0.00041718825,0.0002793142],"domain_scores_gemma":[0.99604994,0.0012103143,0.0008714098,0.0014778414,0.00028627683,0.00010420376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005950306,0.00019464993,0.00058084563,0.000086290886,0.00041890668,0.00008645547,0.0006246712,0.000101491954,0.000053787848],"category_scores_gemma":[0.004903546,0.00012384074,0.00018491894,0.00013190822,0.00018861808,0.00008582283,0.00015092356,0.00013740754,0.000028658105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017756645,0.00019697426,0.00012694123,0.00019498967,0.00006559296,6.3465995e-7,0.00025018817,0.00021634833,0.0009781854,0.99764377,0.0002742234,0.000034419903],"study_design_scores_gemma":[0.0008023079,0.00023653203,0.0009762673,0.0010065848,0.00014305749,0.000004822891,0.0007234322,0.044946488,0.0035971615,0.9470551,0.00020776666,0.00030045342],"about_ca_topic_score_codex":0.0000942989,"about_ca_topic_score_gemma":0.000048018443,"teacher_disagreement_score":0.7483303,"about_ca_system_score_codex":0.000079592544,"about_ca_system_score_gemma":0.000042348223,"threshold_uncertainty_score":0.5870357},"labels":[],"label_agreement":null},{"id":"W4412617762","doi":"10.55016/ojs/cdm.v12i1.62176","title":"Geometric Algorithms for Minimal Enclosing Disks in Strictly Convex Normed Planes","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Regular polygon; Convex body; Convex analysis; Algorithm; Convex optimization; Geometry","score_opus":0.037614912779776764,"score_gpt":0.3450550316480724,"score_spread":0.30744011886829564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03247984,0.000086097214,0.9637418,0.001687176,0.00035807482,0.0007517109,0.00027378788,0.0000612777,0.00056023395],"genre_scores_gemma":[0.82936156,0.000007965561,0.16987245,0.00009370499,0.00016681645,0.00015957528,0.00008354305,0.000009797875,0.00024460012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985236,0.00002725796,0.00043633598,0.0003416184,0.00028203757,0.00038916318],"domain_scores_gemma":[0.9980797,0.0005644661,0.00023671085,0.0006462397,0.00032017002,0.00015270022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056543306,0.00017320477,0.0002942609,0.00044703583,0.0006794442,0.00061880617,0.0008885328,0.000081595834,0.000009150321],"category_scores_gemma":[0.0023045756,0.0001652276,0.00009273312,0.00056753965,0.000046463007,0.00051155087,0.00026865792,0.000098875076,0.00003433363],"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.00006604901,0.0009311855,0.0017449507,0.00033758982,0.00016851118,0.000045544086,0.003069533,0.008740054,0.0041493587,0.8729887,0.005828891,0.10192961],"study_design_scores_gemma":[0.0024758172,0.00032794464,0.019770926,0.00016719456,0.00005180126,0.00003372449,0.00014932241,0.9094206,0.007181992,0.051708363,0.007973232,0.00073908176],"about_ca_topic_score_codex":0.000015451305,"about_ca_topic_score_gemma":0.00001783987,"teacher_disagreement_score":0.90068054,"about_ca_system_score_codex":0.00012632122,"about_ca_system_score_gemma":0.0001321033,"threshold_uncertainty_score":0.6737786},"labels":[],"label_agreement":null},{"id":"W4412617764","doi":"10.55016/ojs/cdm.v12i1.62318","title":"STAR SUPER EDGE MAGIC DEFICIENCY OF GRAPHS","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Star (game theory); MAGIC (telescope); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Astrophysics; Artificial intelligence; Physics","score_opus":0.018467501203954205,"score_gpt":0.28791336142901,"score_spread":0.2694458602250558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2564186,0.0004640037,0.72934204,0.0045475652,0.00055772736,0.0006703865,0.00023987514,0.00023571082,0.007524092],"genre_scores_gemma":[0.9307654,0.000013450896,0.06885754,0.0000821674,0.0000051771426,0.000016240203,0.0000049675887,0.000009109206,0.00024593362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855816,0.000030070009,0.00043246715,0.00029557163,0.00031828726,0.00036545505],"domain_scores_gemma":[0.9971569,0.00009597415,0.00023346195,0.0018528911,0.00047962245,0.00018111347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005727095,0.00016203188,0.0002933598,0.0001603811,0.00057640916,0.0002616907,0.0014598883,0.00006610419,0.000020044237],"category_scores_gemma":[0.0008378799,0.00013342738,0.00014084713,0.00026053152,0.00018740147,0.00032480012,0.0005008026,0.000105082014,0.00015337273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012988606,0.000102011145,0.00020622382,0.000035349614,0.000011952886,0.0000025915306,0.00049193506,0.000022891956,0.0026727626,0.9951346,0.0010148137,0.0003035525],"study_design_scores_gemma":[0.00067106826,0.00015894468,0.0019124447,0.00018356247,0.00004866748,0.000015505664,0.000099000805,0.0169528,0.008227757,0.97029126,0.0010591944,0.00037982245],"about_ca_topic_score_codex":0.00002644102,"about_ca_topic_score_gemma":0.0000061677024,"teacher_disagreement_score":0.6743468,"about_ca_system_score_codex":0.000024642619,"about_ca_system_score_gemma":0.00007939586,"threshold_uncertainty_score":0.54410106},"labels":[],"label_agreement":null},{"id":"W4412617786","doi":"10.55016/ojs/cdm.v12i1.62435","title":"Characterizations and algorithms for generalized Cops and Robbers games","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Combinatorics","score_opus":0.08899808708330083,"score_gpt":0.4303909892209791,"score_spread":0.3413929021376783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412617786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16158059,0.000074477844,0.8172756,0.016392589,0.00011745077,0.0011902844,0.002216246,0.000053139927,0.001099609],"genre_scores_gemma":[0.9450436,0.00004463363,0.049279504,0.00026076217,0.00012238864,0.00048806946,0.00006181397,0.000019036108,0.0046801604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987432,0.000045184166,0.0004290482,0.00032812016,0.00022633941,0.00022810764],"domain_scores_gemma":[0.9973416,0.00088097487,0.00028839588,0.00087173126,0.00040623138,0.00021106456],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012693346,0.00013776301,0.00031703353,0.00009602767,0.0014687653,0.0009196188,0.00046958763,0.000062944164,0.000046689827],"category_scores_gemma":[0.006573763,0.000106452586,0.00006585388,0.00011889801,0.00027434935,0.00027100605,0.00022084812,0.000056481607,0.00004400125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013555201,0.000054819167,0.00023197885,0.000017456898,0.000035196434,5.4708426e-7,0.0011357295,0.000014524619,0.0044388915,0.98203754,0.0033247254,0.0086950315],"study_design_scores_gemma":[0.0013739959,0.00008366604,0.009319659,0.00006192765,0.00015645676,0.000025306983,0.0008464204,0.0307083,0.0021633743,0.87223923,0.08260225,0.00041941565],"about_ca_topic_score_codex":0.0000037653751,"about_ca_topic_score_gemma":0.000007940761,"teacher_disagreement_score":0.78346306,"about_ca_system_score_codex":0.000017320988,"about_ca_system_score_gemma":0.000032680946,"threshold_uncertainty_score":0.9998312},"labels":[],"label_agreement":null},{"id":"W4412646948","doi":"10.55016/ojs/cdm.v3i1.62009","title":"A complete span of H(4,4) admitting PSL_2(11) and related structures","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Protein Tyrosine Phosphatases","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"PSL; Mathematics; Span (engineering); Combinatorics; Structural engineering; Engineering","score_opus":0.01198715237415992,"score_gpt":0.26939797153786854,"score_spread":0.2574108191637086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412646948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.953067,0.0034561518,0.039428554,0.0005685609,0.00007420532,0.00074961176,0.002277543,0.000040427447,0.00033793022],"genre_scores_gemma":[0.9872228,0.000043050208,0.012186096,0.00006144827,0.000039355946,0.000024754088,0.0003068418,0.00001826733,0.00009738414],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990522,0.00003265346,0.00035190952,0.00021860814,0.00012154196,0.00022303817],"domain_scores_gemma":[0.99913186,0.00003930082,0.00015009323,0.00038407242,0.00017313896,0.00012155006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013431453,0.00015219305,0.00024245329,0.00004655309,0.00016325663,0.000012660632,0.0001583594,0.000095555726,0.00002290279],"category_scores_gemma":[0.0010652919,0.00013924252,0.000068970345,0.00013004785,0.00017425367,0.0000048060183,0.00019686868,0.000064384476,0.0000060455327],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009750602,0.00017740483,0.0040591257,0.00028848552,0.0003332936,0.000027795702,0.00085305265,0.00025130055,0.6906048,0.2957417,0.007018476,0.0005470637],"study_design_scores_gemma":[0.0017656696,0.0005012791,0.007536324,0.00017213108,0.00013597841,0.0004355842,0.00020416631,0.001035168,0.9579901,0.015325439,0.014272849,0.0006252746],"about_ca_topic_score_codex":0.000016935492,"about_ca_topic_score_gemma":0.000007738059,"teacher_disagreement_score":0.28041628,"about_ca_system_score_codex":0.000012873042,"about_ca_system_score_gemma":0.000055942033,"threshold_uncertainty_score":0.5678145},"labels":[],"label_agreement":null},{"id":"W4412646950","doi":"10.55016/ojs/cdm.v3i1.61909","title":"Ferenc Kárteszi (1907--1989): A short biography","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Hungarian Social, Economic and Educational Studies","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Biography; Mathematics; Combinatorics; Genealogy; Art history; Art; History","score_opus":0.04511092601404286,"score_gpt":0.3473952961759649,"score_spread":0.302284370161922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412646950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5722214,0.0011512412,0.04751787,0.041702308,0.0017221377,0.0024920432,0.0013537125,0.0006770013,0.3311623],"genre_scores_gemma":[0.9921794,0.0002644959,0.002982845,0.0003207069,0.00058248773,0.00015755427,0.000037018024,0.000015146966,0.003460379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99854964,0.00007465365,0.0003730348,0.00023463127,0.00026652624,0.0005015364],"domain_scores_gemma":[0.99876034,0.0003044341,0.00007631836,0.00023856293,0.0003203483,0.00030000298],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005563673,0.00015868378,0.000314691,0.0001316738,0.0023735326,0.000080335325,0.00031217883,0.00011199263,0.00034779694],"category_scores_gemma":[0.0011543687,0.00015805129,0.00019268504,0.0005761404,0.0005125189,0.0001416813,0.0000746617,0.00012022073,0.0005831258],"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.0000064569385,0.0002722816,0.011743307,0.000015178419,0.00021177635,0.0000048456013,0.06720002,0.000006127386,0.000033881995,0.82012874,0.09977414,0.0006032205],"study_design_scores_gemma":[0.00060961803,0.000113216825,0.04344793,0.00011853949,0.00021885622,0.000013424834,0.061931416,0.0001070754,0.00012874241,0.12568466,0.76637906,0.0012474733],"about_ca_topic_score_codex":0.00039531372,"about_ca_topic_score_gemma":0.00046592165,"teacher_disagreement_score":0.6944441,"about_ca_system_score_codex":0.0002810187,"about_ca_system_score_gemma":0.0003933982,"threshold_uncertainty_score":0.99892527},"labels":[],"label_agreement":null},{"id":"W4412646968","doi":"10.55016/ojs/cdm.v3i1.62768","title":"Preface","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.024257837233508203,"score_gpt":0.30859356618418876,"score_spread":0.28433572895068054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412646968","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49250895,0.00030453934,0.44103447,0.0030070734,0.0003015108,0.0027124404,0.0049869623,0.0018790404,0.05326503],"genre_scores_gemma":[0.972734,0.000007717147,0.022649378,0.00013642601,0.0001123892,0.00016922387,0.00008469104,0.00008417755,0.004022032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982164,0.000052115094,0.00045244105,0.00028645908,0.00041888913,0.0005736802],"domain_scores_gemma":[0.9981023,0.00017393677,0.00012245972,0.0008186377,0.00042563785,0.00035701788],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033357565,0.00024360335,0.0003561783,0.00015883833,0.00050324417,0.000045174016,0.00037861228,0.00008866624,0.00034875816],"category_scores_gemma":[0.0019003168,0.0002200638,0.00014205479,0.0007219496,0.00015718011,0.00017232476,0.00016726888,0.00016564979,0.023324395],"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.00007615599,0.0012129896,0.0011966499,0.00013401847,0.00034441813,0.0001388559,0.01140259,0.0012092934,0.051097646,0.60708433,0.32586023,0.00024279834],"study_design_scores_gemma":[0.008600118,0.0008965771,0.016479263,0.0008314389,0.00086743984,0.0022682734,0.0026368455,0.03678114,0.108871296,0.10758197,0.7088722,0.00531341],"about_ca_topic_score_codex":0.0000076037654,"about_ca_topic_score_gemma":0.0000075696744,"teacher_disagreement_score":0.49950236,"about_ca_system_score_codex":0.00027971595,"about_ca_system_score_gemma":0.00012333736,"threshold_uncertainty_score":0.97743607},"labels":[],"label_agreement":null},{"id":"W4412646976","doi":"10.55016/ojs/cdm.v3i1.61981","title":"Partitioning the flags of PG(2,q) into strong representative systems","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"FLAGS register; Mathematics; Combinatorics; Computer science","score_opus":0.014457357920457273,"score_gpt":0.26399478753059696,"score_spread":0.2495374296101397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412646976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39401817,0.0009405061,0.5945789,0.00017674912,0.0005146512,0.001088108,0.00029932882,0.00029617938,0.0080874],"genre_scores_gemma":[0.9989032,0.000016787953,0.0006115482,0.000006400818,0.00007306804,0.00017128506,0.000019346575,0.000019883873,0.0001784583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988938,0.00008367759,0.00046871556,0.000117115414,0.00020000114,0.00023666993],"domain_scores_gemma":[0.9989473,0.00026724293,0.000088116394,0.0004460595,0.00016678717,0.00008445555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037993604,0.00014466955,0.00028479527,0.00006960589,0.00030815054,0.000031421645,0.00022281216,0.000056850102,0.0000211306],"category_scores_gemma":[0.0002394428,0.00010764883,0.00010234277,0.0003387767,0.00013559168,0.000105292456,0.000043362783,0.00012501939,0.00006765495],"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.00001175267,0.000061735365,0.00054640416,0.00041583544,0.00034062317,0.000011863132,0.021391299,0.0706237,0.0067525203,0.8944851,0.005312817,0.000046349094],"study_design_scores_gemma":[0.0036381227,0.00054259517,0.0040435996,0.0034856526,0.00083967345,0.00067210954,0.08487205,0.63430786,0.10920235,0.13716863,0.018389141,0.0028381879],"about_ca_topic_score_codex":0.00002441599,"about_ca_topic_score_gemma":0.000006355434,"teacher_disagreement_score":0.75731647,"about_ca_system_score_codex":0.000062804866,"about_ca_system_score_gemma":0.000018605931,"threshold_uncertainty_score":0.4389792},"labels":[],"label_agreement":null},{"id":"W4412646978","doi":"10.55016/ojs/cdm.v3i1.61998","title":"On geometric constructions of (k, g)-graphs","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hungarian Scientific Research Fund","keywords":"Mathematics; Combinatorics","score_opus":0.015445024210330022,"score_gpt":0.25903407828659775,"score_spread":0.2435890540762677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412646978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15294403,0.000117778785,0.8418565,0.0009308335,0.000262059,0.0003406692,0.00012355782,0.00021771181,0.0032068572],"genre_scores_gemma":[0.91943544,0.000017426317,0.080222115,0.00012619453,0.0000036114845,0.000025933241,0.0000057224793,0.0000073841243,0.00015618598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868584,0.000033018016,0.00042938616,0.00024628427,0.00033169813,0.00027377738],"domain_scores_gemma":[0.9981691,0.0003299865,0.000145624,0.00075392344,0.00042417162,0.00017718493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025082254,0.00014166938,0.00027281532,0.00063723297,0.00031666982,0.00003048785,0.00047447928,0.00006213363,0.00002123025],"category_scores_gemma":[0.00083859963,0.00012118585,0.00013579357,0.0022183037,0.00015937482,0.00011445234,0.00013350783,0.00011557283,0.00014196036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015841907,0.00012134569,0.0000627812,0.0000109892235,0.00002270186,0.000003458948,0.00025996316,0.00032740543,0.0005612907,0.9959357,0.0024406204,0.00025218047],"study_design_scores_gemma":[0.0010154223,0.00041182342,0.00071651395,0.00015899591,0.000041590683,0.00019655956,0.00008973997,0.012313886,0.014555377,0.96917284,0.0008825544,0.0004446943],"about_ca_topic_score_codex":0.0000072873895,"about_ca_topic_score_gemma":7.403129e-7,"teacher_disagreement_score":0.7664914,"about_ca_system_score_codex":0.000031548247,"about_ca_system_score_gemma":0.00008088383,"threshold_uncertainty_score":0.49418154},"labels":[],"label_agreement":null},{"id":"W4412646979","doi":"10.55016/ojs/cdm.v3i1.61962","title":"Two character sets in finite linear spaces","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Character (mathematics); Combinatorics; Geometry","score_opus":0.013650253567308255,"score_gpt":0.259812493195392,"score_spread":0.24616223962808376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412646979","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93712467,0.00024253581,0.054673795,0.00027280248,0.00036423013,0.00060543086,0.00042122093,0.00038875124,0.005906561],"genre_scores_gemma":[0.9978417,0.000023731021,0.0016088921,0.00003913546,0.00008012477,0.0000803862,0.000037023914,0.000026692363,0.00026231058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904805,0.000032679764,0.00034077614,0.00012770532,0.00012727543,0.0003235309],"domain_scores_gemma":[0.999324,0.00014785961,0.000033756645,0.00031378088,0.000062547726,0.00011804924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023222246,0.00016994296,0.00027951403,0.00015763444,0.00010134548,0.000025656718,0.00015829316,0.00006904559,0.000058432113],"category_scores_gemma":[0.00018948199,0.00015750484,0.000077888115,0.00036161547,0.00004014838,0.000111735295,0.000032020907,0.00015737303,0.00049729017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011514176,0.0010508256,0.010323271,0.002123718,0.0007983094,0.0007572113,0.05951793,0.1425519,0.036183484,0.73354536,0.011259547,0.0017732815],"study_design_scores_gemma":[0.006336163,0.00026977397,0.0095196385,0.0023652157,0.00018627239,0.00048380066,0.0030420576,0.8305228,0.025649795,0.053874634,0.06428716,0.0034627093],"about_ca_topic_score_codex":0.000004663931,"about_ca_topic_score_gemma":0.000014379639,"teacher_disagreement_score":0.6879709,"about_ca_system_score_codex":0.000059944614,"about_ca_system_score_gemma":0.000014266655,"threshold_uncertainty_score":0.6422861},"labels":[],"label_agreement":null},{"id":"W4412646989","doi":"10.55016/ojs/cdm.v3i1.61923","title":"Construction of a 3-dimensional MDS-code","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Code (set theory); Computer science; Programming language; Set (abstract data type)","score_opus":0.017860019110940803,"score_gpt":0.2702157163423182,"score_spread":0.2523556972313774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412646989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052886702,0.00006226785,0.943838,0.00072034437,0.00037535626,0.00026656128,0.00024228079,0.00016788593,0.0014405778],"genre_scores_gemma":[0.8486999,0.0000024924027,0.15094747,0.000055001547,0.00007391216,0.000016637277,0.00002596084,0.000007114503,0.00017147312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856734,0.00005226379,0.00050737546,0.00024896415,0.00034211398,0.00028193276],"domain_scores_gemma":[0.9984429,0.00017716824,0.0002002424,0.0005961241,0.0004340104,0.0001495605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002930804,0.00014968762,0.00032160387,0.00012043819,0.00024548237,0.000038853603,0.0005518956,0.000069260845,0.00001318038],"category_scores_gemma":[0.00030797848,0.00013457543,0.000119550714,0.00056342356,0.00010946644,0.00014974401,0.0002091311,0.00009634147,0.00012047259],"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.000007487792,0.00019457037,0.00031763338,0.0000681663,0.000077584744,0.000014452384,0.0016481436,0.004054272,0.002009237,0.9812906,0.009832936,0.00048494313],"study_design_scores_gemma":[0.0038046031,0.0007515346,0.0041011944,0.001074135,0.0001279435,0.0033883078,0.0003590245,0.7772474,0.01822791,0.13754591,0.05137708,0.0019948964],"about_ca_topic_score_codex":0.000009532005,"about_ca_topic_score_gemma":0.0000012869649,"teacher_disagreement_score":0.84374464,"about_ca_system_score_codex":0.000059475853,"about_ca_system_score_gemma":0.0001479432,"threshold_uncertainty_score":0.5487827},"labels":[],"label_agreement":null},{"id":"W4412647229","doi":"10.55016/ojs/cdm.v3i1.61931","title":"S-spaces from free extensions","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.03553366560848419,"score_gpt":0.3356668870261026,"score_spread":0.3001332214176184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27220064,0.00030030918,0.71207815,0.004264384,0.0003356153,0.00075112394,0.002130232,0.00051526877,0.0074242833],"genre_scores_gemma":[0.7534388,0.000055152937,0.24158524,0.00049672415,0.0002894473,0.00014309063,0.00014048698,0.000051551448,0.0037995072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983227,0.0000937645,0.0005035515,0.00033393447,0.00026471922,0.000481288],"domain_scores_gemma":[0.996233,0.0017410107,0.000162115,0.0013229233,0.00027361227,0.0002673575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002655374,0.00027802473,0.0005254782,0.00011326219,0.0007024895,0.000024265924,0.0005312451,0.00018458035,0.00038208597],"category_scores_gemma":[0.0069878246,0.00023811338,0.00017298388,0.0002863644,0.00030860052,0.00014262024,0.00030149202,0.00027172625,0.00017640814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021549326,0.00020539833,0.00006147107,0.000015607631,0.0000921092,0.000054506774,0.0024574113,0.000019195728,0.0011065411,0.9648007,0.031101251,0.000064229236],"study_design_scores_gemma":[0.00065804285,0.000052802363,0.00014079122,0.000072581315,0.000102093836,0.00006757472,0.0007498525,0.00036132056,0.0020623293,0.9884543,0.006945169,0.00033317707],"about_ca_topic_score_codex":0.000011376962,"about_ca_topic_score_gemma":0.000026130096,"teacher_disagreement_score":0.48123816,"about_ca_system_score_codex":0.0000896699,"about_ca_system_score_gemma":0.00007404491,"threshold_uncertainty_score":0.97099817},"labels":[],"label_agreement":null},{"id":"W4412647240","doi":"10.55016/ojs/cdm.v3i1.61969","title":"The transitive and co-transitive blocking sets in P^2(F_q)","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Transitive relation; Mathematics; Combinatorics; Blocking (statistics); Transitive reduction; Transitive closure; Graph; Statistics; Line graph; Voltage graph","score_opus":0.012679004613922034,"score_gpt":0.27959254246855,"score_spread":0.26691353785462796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1302344,0.00019325005,0.8637031,0.003717229,0.00006452772,0.00044316443,0.000087852,0.000103276805,0.0014532323],"genre_scores_gemma":[0.9941904,0.00007159415,0.005445284,0.00019226104,0.000017021603,0.000047039957,0.0000036791853,0.000007249738,0.000025458285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883574,0.00011501541,0.0002709817,0.00024529686,0.00018318373,0.00034976262],"domain_scores_gemma":[0.9986689,0.00067697087,0.000053928175,0.00037052136,0.00011387377,0.000115802526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006061404,0.00015110582,0.00020319878,0.00011627831,0.00073951867,0.000111674206,0.00039394078,0.000052834544,0.000002962558],"category_scores_gemma":[0.00017754237,0.00011472545,0.00007948657,0.0005596591,0.00021313799,0.00018105061,0.00007714847,0.00016899857,0.00001565577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018271227,0.00007593029,0.00020754848,0.000014390213,0.000042400905,0.00004525596,0.02323129,0.000040769628,0.00068243314,0.9728527,0.00020549423,0.0025835235],"study_design_scores_gemma":[0.0041040056,0.0006874841,0.024649063,0.0008207682,0.00012785755,0.00085546146,0.006218737,0.13437757,0.013615012,0.80223614,0.0103822155,0.0019256948],"about_ca_topic_score_codex":0.0000054716293,"about_ca_topic_score_gemma":0.00002456546,"teacher_disagreement_score":0.86395603,"about_ca_system_score_codex":0.00004117411,"about_ca_system_score_gemma":0.000050704824,"threshold_uncertainty_score":0.5687854},"labels":[],"label_agreement":null},{"id":"W4412647247","doi":"10.55016/ojs/cdm.v3i1.61979","title":"Constructions of small complete arcs with prescribed symmetry","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Structural Analysis of Composite Materials","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Symmetry (geometry); Combinatorics; Geometry","score_opus":0.014914058187692716,"score_gpt":0.22686346774370159,"score_spread":0.21194940955600888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.802517,0.00011038544,0.19290623,0.00014153293,0.000120381235,0.00043282076,0.00092623255,0.00027237498,0.0025730135],"genre_scores_gemma":[0.9347814,0.000012773021,0.06496392,0.000014504118,0.000049244652,0.00003510227,0.00006082289,0.000027678974,0.000054595497],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998836,0.000024293733,0.0005025893,0.0001492842,0.0002037003,0.0002841442],"domain_scores_gemma":[0.9989013,0.00013195722,0.00009248503,0.00044747893,0.00028251405,0.00014427904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007811369,0.00021712792,0.0005132317,0.00017676897,0.00015454805,0.000030101603,0.00024753672,0.000060175058,0.000092593495],"category_scores_gemma":[0.000109587825,0.00017588653,0.00010717973,0.000432149,0.00017566927,0.00007358012,0.00005826096,0.00009533709,0.00004365161],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001294628,0.00023123271,0.0021723602,0.0012493486,0.0028435611,0.00006650946,0.004289415,0.07640297,0.65199584,0.25544235,0.0044106124,0.0007663344],"study_design_scores_gemma":[0.006884854,0.00093343767,0.023988005,0.0017075101,0.0027770197,0.002570176,0.0016160512,0.18024103,0.7198452,0.039369017,0.015611697,0.0044560186],"about_ca_topic_score_codex":0.000011828267,"about_ca_topic_score_gemma":0.000009944835,"teacher_disagreement_score":0.21607335,"about_ca_system_score_codex":0.000069667585,"about_ca_system_score_gemma":0.000026459767,"threshold_uncertainty_score":0.71724445},"labels":[],"label_agreement":null},{"id":"W4412647289","doi":"10.55016/ojs/cdm.v3i1.62767","title":"Affinely regular polygons in an affine plane","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hungarian Scientific Research Fund; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Mathematics; Combinatorics; Affine transformation; Affine plane (incidence geometry); Plane (geometry); Regular polygon; Geometry","score_opus":0.0456000522991196,"score_gpt":0.3440949486395253,"score_spread":0.29849489634040566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647289","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7754345,0.00009267511,0.20608333,0.0042754957,0.000115082395,0.0028235975,0.0011422993,0.0005862177,0.009446841],"genre_scores_gemma":[0.85728294,0.000021840266,0.13908039,0.0001399091,0.00017657531,0.00052798423,0.00014920968,0.00008785084,0.0025333392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742323,0.00007364611,0.0009742451,0.00044494364,0.00043097517,0.0006529489],"domain_scores_gemma":[0.997226,0.0005360277,0.00023435,0.0013369749,0.00027967393,0.0003869694],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006291997,0.00037238264,0.0006771216,0.00032002295,0.0004202613,0.00007041693,0.0005947393,0.00017426787,0.00031195817],"category_scores_gemma":[0.001384431,0.00034151625,0.00014680462,0.0008287357,0.0001267552,0.00018774523,0.00016477535,0.00027485384,0.000266548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002415278,0.0020214857,0.00020896037,0.00020612625,0.000063820764,0.000062215026,0.0047946996,0.00010244096,0.0056471014,0.94872236,0.037888397,0.00025823867],"study_design_scores_gemma":[0.0047042035,0.00060916285,0.0019982988,0.00083463604,0.00034697945,0.0007098331,0.0026285688,0.027567292,0.010409306,0.91463417,0.032742225,0.0028153425],"about_ca_topic_score_codex":0.000017153377,"about_ca_topic_score_gemma":0.00014783676,"teacher_disagreement_score":0.081848435,"about_ca_system_score_codex":0.00017179508,"about_ca_system_score_gemma":0.00010736432,"threshold_uncertainty_score":0.9999037},"labels":[],"label_agreement":null},{"id":"W4412647334","doi":"10.55016/ojs/cdm.v3i1.61983","title":"Configurations graphs of neighbourhood geometries","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Ministero dell’Istruzione, dell’Università e della Ricerca; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Neighbourhood (mathematics); Mathematics; Combinatorics; Mathematical analysis","score_opus":0.016637047107502866,"score_gpt":0.2746005900086304,"score_spread":0.25796354290112755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034455236,0.000116864125,0.9608358,0.0013841472,0.0001508767,0.00029654682,0.00013573558,0.00009883908,0.0025259492],"genre_scores_gemma":[0.92526,0.000018302444,0.074239105,0.000105797306,0.000036451624,0.000036447247,0.000042104337,0.000005793716,0.0002560192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878395,0.000029265706,0.00043912698,0.00020634026,0.00032698555,0.00021433827],"domain_scores_gemma":[0.9983206,0.00027752132,0.00014867527,0.00045636442,0.0006595598,0.00013727527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022531605,0.0001283766,0.00023503583,0.0003808914,0.0003402425,0.000056517154,0.0004256686,0.00005059206,0.000052333264],"category_scores_gemma":[0.0007556389,0.00012070704,0.00010917614,0.0016597235,0.00007649403,0.0003176359,0.00011779361,0.000073972406,0.00007346476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019675047,0.00011519727,0.00005174846,0.0000148478775,0.000031290238,0.0000028433774,0.00088125333,0.0017751955,0.003934614,0.9909646,0.0013643587,0.00086206786],"study_design_scores_gemma":[0.0028637368,0.00096422544,0.0276328,0.00021985704,0.00015051352,0.0004863133,0.00046195375,0.1988039,0.18209276,0.56387055,0.020787155,0.0016662128],"about_ca_topic_score_codex":0.0000055808773,"about_ca_topic_score_gemma":0.0000026068094,"teacher_disagreement_score":0.89080477,"about_ca_system_score_codex":0.000038295355,"about_ca_system_score_gemma":0.00016800164,"threshold_uncertainty_score":0.492229},"labels":[],"label_agreement":null},{"id":"W4412647336","doi":"10.55016/ojs/cdm.v3i1.61964","title":"A survey on semiovals","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.05444497815643056,"score_gpt":0.34578845631010996,"score_spread":0.2913434781536794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.873803,0.00015238853,0.1032322,0.0008254435,0.0005926349,0.0015582395,0.0023756295,0.0005296077,0.016930858],"genre_scores_gemma":[0.98773617,0.000017653925,0.009907688,0.0003489792,0.00013070482,0.000063113555,0.000040258146,0.00005050811,0.0017049189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997989,0.00018836038,0.0005708189,0.00032131188,0.00043551272,0.00049502676],"domain_scores_gemma":[0.9966722,0.0015772338,0.00016153233,0.00097478775,0.00035533932,0.0002589069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010558269,0.0003021289,0.0005377054,0.0001762112,0.0008272099,0.000034108605,0.0004331105,0.00014654639,0.00014781162],"category_scores_gemma":[0.0074581364,0.00023435891,0.00020672062,0.0004704813,0.00016256158,0.00006484414,0.00019414056,0.0002464938,0.00019425475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052859465,0.00019361716,0.0003833738,0.00004441161,0.00010616819,0.000021868787,0.001658639,0.000016350643,0.00010261035,0.9592215,0.03804176,0.00015688177],"study_design_scores_gemma":[0.0009229916,0.0003372568,0.010737949,0.00021867813,0.000089908186,0.00008705304,0.00013524453,0.00042945376,0.0021918255,0.9798409,0.0042884415,0.00072032685],"about_ca_topic_score_codex":0.000011310997,"about_ca_topic_score_gemma":0.000015271784,"teacher_disagreement_score":0.113933176,"about_ca_system_score_codex":0.00010810766,"about_ca_system_score_gemma":0.00005814981,"threshold_uncertainty_score":0.95568794},"labels":[],"label_agreement":null},{"id":"W4412647363","doi":"10.55016/ojs/cdm.v3i1.61999","title":"Arcs in Desarguesian nets","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Ministero dell’Istruzione, dell’Università e della Ricerca; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Combinatorics","score_opus":0.030685607786433755,"score_gpt":0.32472518810292195,"score_spread":0.2940395803164882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647363","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01495464,0.000046881654,0.9797689,0.0011611603,0.00014356148,0.00038232308,0.00001959055,0.00015196628,0.0033709777],"genre_scores_gemma":[0.33764678,0.000010602635,0.6619358,0.00016592868,0.000024522195,0.00006576452,0.0000054191087,0.000007646723,0.00013753392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986747,0.0000825756,0.00039502804,0.00025013747,0.00023936942,0.00035821146],"domain_scores_gemma":[0.99872077,0.00011616294,0.000087448505,0.00078882155,0.00014301427,0.00014377566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000564112,0.00013446441,0.00021142507,0.00019090723,0.00018059947,0.000059230148,0.0007667926,0.00006988741,0.000011301326],"category_scores_gemma":[0.0010133217,0.00012832596,0.000056078374,0.00082933664,0.000062559244,0.0003619611,0.00019883241,0.00013959162,0.00021743584],"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.0000025674774,0.00010758802,0.0002541186,0.000015438074,0.0000067200167,0.000019244157,0.0025260667,0.00023526343,0.00068234315,0.9936658,0.00090192264,0.0015829378],"study_design_scores_gemma":[0.0016369164,0.00030279643,0.027185766,0.00029872413,0.000023041925,0.00046876396,0.00028706942,0.7259711,0.023821797,0.19156414,0.027114483,0.0013253633],"about_ca_topic_score_codex":0.000008194419,"about_ca_topic_score_gemma":0.000006391308,"teacher_disagreement_score":0.8021017,"about_ca_system_score_codex":0.00016672649,"about_ca_system_score_gemma":0.000085652966,"threshold_uncertainty_score":0.5232981},"labels":[],"label_agreement":null},{"id":"W4412647388","doi":"10.55016/ojs/cdm.v2i2.61984","title":"The cop density of a graph","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Mitacs; McGill University","keywords":"Combinatorics; Mathematics; Graph","score_opus":0.019359780623625485,"score_gpt":0.33642489472371545,"score_spread":0.31706511410009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3171117,0.000066328874,0.67520225,0.001214908,0.00009090394,0.0009530248,0.00019929672,0.00012347869,0.0050381143],"genre_scores_gemma":[0.97975355,0.000009663197,0.019611461,0.00005091146,0.000043444208,0.000060456543,0.000008348685,0.00001926398,0.0004429177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853265,0.000047033758,0.000625312,0.00015885486,0.00025626487,0.0003799015],"domain_scores_gemma":[0.9959929,0.0023699973,0.0002397992,0.0007960891,0.00044592615,0.0001553031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021087748,0.00015679662,0.00027834665,0.00009274679,0.00058184355,0.000035726254,0.00039462865,0.00007905872,0.00002108525],"category_scores_gemma":[0.0024002783,0.00010849871,0.00018282623,0.00062879367,0.00024139357,0.000044122105,0.000107069645,0.00014540809,0.000051143543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015418718,0.0001121068,0.000059083708,0.000031373016,0.00004781126,8.963679e-7,0.00049887144,0.0000014199577,0.0023460283,0.9946484,0.0019584117,0.00028017053],"study_design_scores_gemma":[0.00022237116,0.000034677356,0.00037321646,0.000049374743,0.00009030291,0.000010653691,0.0007708661,0.00006049899,0.018495157,0.9762362,0.0035192133,0.00013743779],"about_ca_topic_score_codex":0.0000037922096,"about_ca_topic_score_gemma":0.000059577018,"teacher_disagreement_score":0.6626418,"about_ca_system_score_codex":0.000043563807,"about_ca_system_score_gemma":0.00003601454,"threshold_uncertainty_score":0.4475129},"labels":[],"label_agreement":null},{"id":"W4412647406","doi":"10.55016/ojs/cdm.v2i2.61953","title":"Pseudopowers and primality proving","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Österreichischen Akademie der Wissenschaften","keywords":"Primality test; Mathematics; Combinatorics; Prime (order theory)","score_opus":0.03265548630649473,"score_gpt":0.38848742701440175,"score_spread":0.355831940707907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647406","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2435584,0.000049947543,0.73736167,0.0012458273,0.0000619612,0.0011076055,0.00011332013,0.00021226546,0.01628901],"genre_scores_gemma":[0.92876786,0.00000416186,0.06874062,0.00009973182,0.00010048499,0.0000358295,0.000008712984,0.000044894383,0.0021977294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783576,0.00006950835,0.000602839,0.0003257475,0.0004701211,0.00069603464],"domain_scores_gemma":[0.9969487,0.0014760651,0.00014089796,0.0006419404,0.0003633141,0.00042903936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003748576,0.00022965595,0.00040657754,0.0001748519,0.00030865305,0.0001099395,0.00029380945,0.000114209215,0.00012369604],"category_scores_gemma":[0.006250653,0.00019939897,0.00009997173,0.0004251554,0.00020947329,0.00013276911,0.00029662665,0.00025965966,0.000117746014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030269503,0.00014406696,0.0004594541,0.00020010187,0.000077891564,0.00001790935,0.0013844223,7.7970947e-7,0.0012217744,0.99415696,0.0015532038,0.00075314747],"study_design_scores_gemma":[0.00087013346,0.00012344151,0.0008270192,0.00021190019,0.00017340222,0.00009800838,0.002680755,0.0014221031,0.004768523,0.98485726,0.0034111927,0.0005562485],"about_ca_topic_score_codex":0.000009669342,"about_ca_topic_score_gemma":0.000029773251,"teacher_disagreement_score":0.68520945,"about_ca_system_score_codex":0.00024626244,"about_ca_system_score_gemma":0.00008794768,"threshold_uncertainty_score":0.81312543},"labels":[],"label_agreement":null},{"id":"W4412647423","doi":"10.55016/ojs/cdm.v2i2.61935","title":"Martin's axiom and almost disjoint families","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Disjoint sets; Mathematics; Axiom of choice; Combinatorics; Zermelo–Fraenkel set theory; Axiom; Urelement; Discrete mathematics; Genealogy; Set (abstract data type); Set theory; Computer science","score_opus":0.017104014079290825,"score_gpt":0.3459929088778381,"score_spread":0.3288888947985473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2262077,0.00015789334,0.76219773,0.0013748085,0.00015459902,0.0006250365,0.00020022507,0.00022704729,0.008854972],"genre_scores_gemma":[0.93011546,0.000026658603,0.06755777,0.0002614003,0.00013150371,0.000045190027,0.000026303569,0.00004410779,0.0017916154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832624,0.00005110305,0.0005769146,0.0002846086,0.00019352695,0.00056758657],"domain_scores_gemma":[0.9976862,0.0011998226,0.00015156648,0.0005154262,0.00017937184,0.0002676189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011742209,0.00025800898,0.00042974306,0.00015396584,0.0003846397,0.000038343893,0.00019176124,0.00015419019,0.00010486049],"category_scores_gemma":[0.0032143686,0.00021975637,0.00009400643,0.0002658435,0.0002954013,0.00012200615,0.0001982869,0.00021956522,0.00011292828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003498997,0.00010822316,0.00013149825,0.000074759075,0.00004972631,0.000019530013,0.0019097667,0.0000027525443,0.00082466,0.9947517,0.0010552141,0.0010371893],"study_design_scores_gemma":[0.0005627247,0.00009597574,0.00042049392,0.00009802878,0.00010369877,0.0000783168,0.003470663,0.00030362303,0.0034838277,0.98516697,0.005847801,0.00036790653],"about_ca_topic_score_codex":0.0000031798875,"about_ca_topic_score_gemma":0.00004226423,"teacher_disagreement_score":0.7039077,"about_ca_system_score_codex":0.00008715292,"about_ca_system_score_gemma":0.000028560891,"threshold_uncertainty_score":0.8961405},"labels":[],"label_agreement":null},{"id":"W4412647470","doi":"10.55016/ojs/cdm.v2i2.62766","title":"Bounds on the f-vectors of tight spans","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Combinatorics","score_opus":0.008045191233884797,"score_gpt":0.27843182950585554,"score_spread":0.27038663827197074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04006639,0.000048034963,0.9508627,0.0004731269,0.000043510754,0.00026216157,0.00009165527,0.00028429466,0.007868141],"genre_scores_gemma":[0.9882982,0.0000098987275,0.011395815,0.00006244548,0.000038215578,0.000025236082,0.000009278444,0.000021813927,0.00013914335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99910146,0.000010825457,0.0003474776,0.00009413042,0.00019169238,0.00025440071],"domain_scores_gemma":[0.9989659,0.0003866766,0.000052478274,0.00040786338,0.00010282752,0.00008422289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031989338,0.0001359286,0.00023438211,0.00010062188,0.00008495167,0.000016038011,0.00022127444,0.00005284029,0.000066413835],"category_scores_gemma":[0.0004298388,0.00008982416,0.00011230513,0.00052813074,0.00006877278,0.000038659964,0.000034425666,0.00013548162,0.00006419039],"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.00001611292,0.00020326057,0.00013508306,0.00011868845,0.0003090078,0.0000069084226,0.0011972925,0.0066620754,0.045303147,0.9338606,0.009691512,0.0024962833],"study_design_scores_gemma":[0.00039140382,0.00029914052,0.0012831222,0.00037246716,0.00028372416,0.000009138084,0.0007420543,0.04033447,0.7624463,0.13031271,0.06260078,0.00092470634],"about_ca_topic_score_codex":0.0000022992351,"about_ca_topic_score_gemma":0.000008317602,"teacher_disagreement_score":0.94823176,"about_ca_system_score_codex":0.00011452964,"about_ca_system_score_gemma":0.0000068299873,"threshold_uncertainty_score":0.36629233},"labels":[],"label_agreement":null},{"id":"W4412647483","doi":"10.55016/ojs/cdm.v2i2.61973","title":"Priestley duality for some algebras with a negation operator","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Negation; Mathematics; Duality (order theory); Operator (biology); Algebra over a field; Combinatorics; Pure mathematics; Linguistics; Chemistry; Philosophy","score_opus":0.014864322971557814,"score_gpt":0.3054678893635603,"score_spread":0.29060356639200247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021804284,0.000055456465,0.9744075,0.0020944152,0.00010328178,0.0009657339,0.00008580898,0.00021220007,0.0002713249],"genre_scores_gemma":[0.5778777,0.0000018719596,0.42093122,0.0006545518,0.00011667418,0.00014399589,0.000029321413,0.000014934743,0.00022972324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986279,0.00002082561,0.00035706937,0.00031384936,0.00023280612,0.00044751933],"domain_scores_gemma":[0.9983979,0.00033998457,0.00012028521,0.0005766746,0.00035745164,0.00020773074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006565829,0.00017626393,0.00024093357,0.00008599706,0.00033883928,0.00016719296,0.00045701265,0.00005470275,0.000006003478],"category_scores_gemma":[0.00061409123,0.00013314428,0.000081430124,0.00044025196,0.000060600225,0.00056715443,0.00012602053,0.00008850474,0.000045418048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012195794,0.00006492608,0.000030283056,0.000026113345,0.000021434442,0.0000038295193,0.0005243407,0.00007644595,0.0005857053,0.9974383,0.00022693639,0.0009895011],"study_design_scores_gemma":[0.0021918688,0.00075541914,0.0015716447,0.00016212813,0.00008843242,0.00006633105,0.0004753327,0.016282776,0.042749256,0.9212606,0.013434501,0.00096173835],"about_ca_topic_score_codex":0.0000016262953,"about_ca_topic_score_gemma":0.000012763766,"teacher_disagreement_score":0.5560734,"about_ca_system_score_codex":0.000120283876,"about_ca_system_score_gemma":0.000101544545,"threshold_uncertainty_score":0.5429466},"labels":[],"label_agreement":null},{"id":"W4412647485","doi":"10.55016/ojs/cdm.v2i2.61971","title":"On the oriented chromatic number of dense graphs","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Departament d'Universitats, Recerca i Societat de la Informació; Ministerio de Economía y Competitividad; European Commission","keywords":"Mathematics; Combinatorics; Chromatic scale; Discrete mathematics","score_opus":0.01102268038947433,"score_gpt":0.28220492781912215,"score_spread":0.2711822474296478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3001796,0.000046824363,0.69450563,0.0023994583,0.00014306046,0.00038093815,0.000024606792,0.00012324977,0.0021966023],"genre_scores_gemma":[0.96796745,0.0000023467708,0.03146262,0.00039124343,0.0000038305766,0.000019748924,0.0000025382942,0.000008704965,0.00014153437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985839,0.000045506702,0.00049296784,0.00019743654,0.0003597416,0.00032045113],"domain_scores_gemma":[0.9975769,0.0008855456,0.00017234671,0.0008812919,0.00034749688,0.00013645519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011992947,0.00014321877,0.00022198708,0.00011691021,0.00023933948,0.000049637365,0.0005360929,0.000052549156,0.00003806815],"category_scores_gemma":[0.0012053776,0.00009068738,0.000121264886,0.0009320749,0.000101675345,0.00007139951,0.00014998869,0.00011653622,0.00024091412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032070202,0.00009960662,0.000049217335,0.000015420754,0.000024621664,0.0000027413219,0.00071417866,0.000028074428,0.0008789362,0.9964512,0.0015960108,0.00013676051],"study_design_scores_gemma":[0.0004784601,0.00011987826,0.00032965676,0.0003148119,0.00004023222,0.0000340802,0.00019670223,0.011454603,0.013232771,0.9730234,0.00052592636,0.0002494686],"about_ca_topic_score_codex":0.000029479896,"about_ca_topic_score_gemma":0.000017800268,"teacher_disagreement_score":0.66778785,"about_ca_system_score_codex":0.00004118251,"about_ca_system_score_gemma":0.000058111313,"threshold_uncertainty_score":0.3698124},"labels":[],"label_agreement":null},{"id":"W4412647490","doi":"10.55016/ojs/cdm.v2i2.61978","title":"Class number approximation in cubic function fields","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical and Theoretical Analysis","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Class (philosophy); Combinatorics; Function (biology); Computer science; Biology; Evolutionary biology","score_opus":0.01691004093064994,"score_gpt":0.323083853522819,"score_spread":0.306173812592169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102134824,0.000012548377,0.85620487,0.0013508704,0.00009639943,0.00065794075,0.000042603322,0.00016506719,0.03933487],"genre_scores_gemma":[0.9636669,0.0000028446866,0.034673754,0.0002029056,0.00012713492,0.00008876671,0.0000314491,0.00003397522,0.0011722287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734753,0.00007611838,0.0010849395,0.00034799994,0.00048931385,0.0006540711],"domain_scores_gemma":[0.99723727,0.0014000454,0.00018732296,0.00060236716,0.00027814784,0.000294874],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020566268,0.0002960202,0.000592996,0.00023901272,0.00016271746,0.00007848554,0.00027631543,0.00024752974,0.0009882549],"category_scores_gemma":[0.0035555444,0.0002409659,0.00023218908,0.0010433651,0.00010420481,0.00014996546,0.00012823498,0.0003265087,0.000752823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033505796,0.00037386187,0.00011692648,0.00017270871,0.00005237107,0.0000071582317,0.0005506337,0.000013525664,0.00020311639,0.99699366,0.00077851024,0.0007040334],"study_design_scores_gemma":[0.0005083589,0.00005544017,0.00017604366,0.00016159542,0.00016164703,0.000013066243,0.00046414763,0.008679663,0.0014520041,0.98704696,0.0009553585,0.0003256964],"about_ca_topic_score_codex":0.000009521702,"about_ca_topic_score_gemma":0.0001015474,"teacher_disagreement_score":0.8615321,"about_ca_system_score_codex":0.0002015941,"about_ca_system_score_gemma":0.00003159762,"threshold_uncertainty_score":0.99992496},"labels":[],"label_agreement":null},{"id":"W4412647517","doi":"10.55016/ojs/cdm.v2i2.61963","title":"Aspects of singular cofinality","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cofinality; Mathematics; Combinatorics; Uncountable set","score_opus":0.015302729185797751,"score_gpt":0.30302730938609956,"score_spread":0.28772458020030184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0145557495,0.00009394441,0.976547,0.00057990436,0.00009749484,0.00022269877,0.000022883813,0.000110216715,0.0077701323],"genre_scores_gemma":[0.84200865,0.000001415081,0.15777987,0.00010307942,0.000029186953,0.0000046078626,0.0000036423673,0.000004829122,0.00006469625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998844,0.00002062821,0.00037912,0.00019653451,0.00023824716,0.00032144826],"domain_scores_gemma":[0.9985926,0.00023286736,0.00013686421,0.000619859,0.00027131903,0.00014649959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065994106,0.000115901894,0.00023502685,0.00008958119,0.00011902621,0.000036203477,0.00052725035,0.000050152037,0.000012907204],"category_scores_gemma":[0.0006953742,0.00009977908,0.00010690971,0.00054190925,0.0000637396,0.00015431418,0.00019287124,0.00008364045,0.000055736607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018850649,0.000066845765,0.000026785738,0.00001847138,0.000012052081,0.000008522147,0.00033800397,0.00003375424,0.002311795,0.99579483,0.000055800112,0.0013312633],"study_design_scores_gemma":[0.00035188446,0.00013297667,0.0017020098,0.00007363971,0.000025462463,0.000026671105,0.00011619918,0.0045511,0.043426555,0.94653434,0.0027914776,0.0002676745],"about_ca_topic_score_codex":0.0000026378855,"about_ca_topic_score_gemma":0.000004733909,"teacher_disagreement_score":0.8274529,"about_ca_system_score_codex":0.00006977579,"about_ca_system_score_gemma":0.00005240163,"threshold_uncertainty_score":0.4068873},"labels":[],"label_agreement":null},{"id":"W4412647858","doi":"10.55016/ojs/cdm.v2i1.61890","title":"Coloring edges and vertices of graphs without short or long cycles","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics","score_opus":0.024361929138435805,"score_gpt":0.3102164975382111,"score_spread":0.2858545683997753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4674224,0.00025672666,0.53129625,0.00027642082,0.000093833136,0.00023382522,0.00001459432,0.00010140582,0.00030454647],"genre_scores_gemma":[0.93660384,0.000023338016,0.06323554,0.00004992028,0.0000054724196,0.0000116721385,0.0000021429069,0.000007606965,0.000060439004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987679,0.00002062149,0.00042712182,0.0002355045,0.00023500933,0.00031380705],"domain_scores_gemma":[0.9987455,0.00030583076,0.0000894564,0.00041980195,0.00025540142,0.0001839915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008173804,0.00013874867,0.00027039845,0.00018835337,0.000188744,0.00009251818,0.00033715912,0.000059140937,0.0000034000757],"category_scores_gemma":[0.0004222173,0.00010387034,0.00005369174,0.0005146954,0.00011512159,0.00019850607,0.00022706532,0.000080140126,0.000006460305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003044991,0.00017102722,0.008798075,0.00017679804,0.00009071036,0.000016003034,0.0022560898,0.00009296793,0.008629997,0.97320414,0.00017779063,0.0063559595],"study_design_scores_gemma":[0.00293507,0.0013420586,0.048695512,0.0022890517,0.00047861296,0.00026302328,0.0022722979,0.069559164,0.30533314,0.5636193,0.0011750732,0.002037663],"about_ca_topic_score_codex":0.000009289957,"about_ca_topic_score_gemma":0.000040074152,"teacher_disagreement_score":0.46918148,"about_ca_system_score_codex":0.000019652569,"about_ca_system_score_gemma":0.000038223563,"threshold_uncertainty_score":0.42357096},"labels":[],"label_agreement":null},{"id":"W4412647866","doi":"10.55016/ojs/cdm.v2i1.61930","title":"Bounds on the achromatic number of partial triple systems","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Achromatic lens; Mathematics; Combinatorics; Physics","score_opus":0.010416507884809528,"score_gpt":0.2646640253499947,"score_spread":0.2542475174651852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647866","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68899816,0.0001514999,0.28441313,0.00016100093,0.0009870569,0.0011721109,0.0003330072,0.00028037533,0.023503644],"genre_scores_gemma":[0.9993123,0.0000022112797,0.00018233813,0.000017558888,0.00010583203,0.000078499026,0.000010808817,0.000025257214,0.00026518494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987007,0.000052388834,0.00057002,0.00010139666,0.00024145917,0.00033406413],"domain_scores_gemma":[0.9987452,0.00046567805,0.000085875654,0.00050153385,0.00009477269,0.000106918094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011573774,0.00016811304,0.00031221146,0.00006417259,0.0001477843,0.0000556238,0.00024324458,0.00008275908,0.00006672078],"category_scores_gemma":[0.0003009573,0.00011586441,0.00012012249,0.00036016543,0.00006535065,0.00004872016,0.000024668076,0.00012675811,0.00032104732],"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.00001141914,0.00006336982,0.000055130393,0.00025713697,0.00012662959,0.0000030647516,0.0012061516,0.0016563451,0.0026504074,0.99100995,0.0029115605,0.00004885933],"study_design_scores_gemma":[0.0063944813,0.0009508799,0.0025254146,0.006743885,0.0013899849,0.0004996532,0.030274913,0.43565926,0.19460803,0.21119756,0.10533637,0.0044195545],"about_ca_topic_score_codex":0.000004501789,"about_ca_topic_score_gemma":0.0000024287986,"teacher_disagreement_score":0.77981234,"about_ca_system_score_codex":0.000077045785,"about_ca_system_score_gemma":0.000013142346,"threshold_uncertainty_score":0.47248134},"labels":[],"label_agreement":null},{"id":"W4412647867","doi":"10.55016/ojs/cdm.v2i1.61952","title":"The flow lattice of oriented matroids","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Freie Universität Berlin","keywords":"Matroid; Mathematics; Combinatorics; Lattice (music); Physics","score_opus":0.00521944936892398,"score_gpt":0.2785005600038057,"score_spread":0.2732811106348817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006501884,0.00018090062,0.9900669,0.00020800551,0.000054269574,0.00022773814,0.000083233215,0.00031609018,0.0023609998],"genre_scores_gemma":[0.7821941,0.00004724502,0.21734537,0.000029227329,0.000055902416,0.000038226768,0.000018745573,0.000033639575,0.00023758617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989803,0.000010362847,0.00043629442,0.000088041576,0.0001862679,0.00029872305],"domain_scores_gemma":[0.9988532,0.00039014424,0.000056670502,0.00039529742,0.00020398971,0.000100700076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042135725,0.00012312351,0.00021984018,0.0000672234,0.00012571599,0.00001682788,0.00020858378,0.00004929689,0.000014450479],"category_scores_gemma":[0.0005824754,0.000086787695,0.00009793076,0.0005676152,0.000071864386,0.00005461524,0.000053454012,0.00011541067,0.000039222145],"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.00005773437,0.00025680487,0.00017764278,0.00032324236,0.00068468496,0.000014435254,0.0016568752,0.020846982,0.053769555,0.8808515,0.009077671,0.03228286],"study_design_scores_gemma":[0.0007810508,0.00022079355,0.0006702183,0.000277627,0.00045445448,0.000022564245,0.0013761095,0.45705163,0.2721555,0.11340005,0.15256642,0.0010235874],"about_ca_topic_score_codex":0.0000015998247,"about_ca_topic_score_gemma":0.000009913393,"teacher_disagreement_score":0.77569216,"about_ca_system_score_codex":0.00009917486,"about_ca_system_score_gemma":0.0000071308295,"threshold_uncertainty_score":0.35390997},"labels":[],"label_agreement":null},{"id":"W4412647871","doi":"10.55016/ojs/cdm.v2i1.61917","title":"A proof of an extension of the icosahedral conjecture of Steiner for generalized deltahedra","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Icosahedral symmetry; Extension (predicate logic); Steiner system; Steiner tree problem; Combinatorial proof; Discrete mathematics; Computer science; Geometry","score_opus":0.031289550972978426,"score_gpt":0.360196301268681,"score_spread":0.3289067502957026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4298375,0.00003874585,0.56607413,0.0003724571,0.000048283735,0.0023043249,0.0009865282,0.000024437379,0.00031360448],"genre_scores_gemma":[0.8022178,0.0000012368564,0.1973256,0.000026241,0.0000447284,0.00012045522,0.000029583358,0.000034897374,0.00019946384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99770933,0.000047380767,0.0013057824,0.00022303766,0.00039572353,0.0003187209],"domain_scores_gemma":[0.99592185,0.0008458691,0.00090067956,0.0011793253,0.0010289367,0.00012335059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001339533,0.00022715697,0.0007135152,0.000123474,0.00013322633,0.000012434664,0.000494895,0.00014715077,0.000030965177],"category_scores_gemma":[0.0021388736,0.0001501597,0.00032318465,0.00047661847,0.00017718963,0.000059432932,0.00013693952,0.000104869665,8.3182334e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005909352,0.0009475032,0.000015314914,0.0012948874,0.000113392336,3.2187472e-7,0.0021924216,0.000107951564,0.07499921,0.91805315,0.0017472182,0.00046952514],"study_design_scores_gemma":[0.0016193195,0.0003260647,0.00017073468,0.00050540094,0.0005307857,0.000015330386,0.00055934634,0.010566937,0.40065542,0.58394194,0.00080878544,0.00029997213],"about_ca_topic_score_codex":0.000011131137,"about_ca_topic_score_gemma":0.000050926014,"teacher_disagreement_score":0.3723803,"about_ca_system_score_codex":0.000043530235,"about_ca_system_score_gemma":0.000102869235,"threshold_uncertainty_score":0.6123335},"labels":[],"label_agreement":null},{"id":"W4412647882","doi":"10.55016/ojs/cdm.v2i1.61876","title":"An explicit treatment of biquadratic function fields","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Function (biology); Combinatorics; Pure mathematics; Evolutionary biology; Biology","score_opus":0.026664503825741186,"score_gpt":0.3391348229069486,"score_spread":0.31247031908120737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4068032,0.00003931653,0.5901252,0.00013825086,0.00010600269,0.0004608115,0.0000716483,0.00009545295,0.0021601152],"genre_scores_gemma":[0.98597413,0.0000058527457,0.01310682,0.00005402028,0.00014507775,0.000051403324,0.00003466707,0.000027071335,0.00060096977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983931,0.00005810773,0.0006804871,0.0002284969,0.00025482452,0.0003849899],"domain_scores_gemma":[0.9977012,0.00084371545,0.0002141513,0.00075885426,0.00024753535,0.00023448803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080651545,0.00023338894,0.00045603674,0.00020457937,0.00016866351,0.000027650136,0.00019290889,0.00015567751,0.0002749477],"category_scores_gemma":[0.00063615106,0.00019111004,0.00016321726,0.000469101,0.00005135356,0.00013376739,0.000029556644,0.000078755314,0.000068188885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009905398,0.0011656136,0.00012468242,0.00011749433,0.00014308728,0.0000061440373,0.0035611736,0.000017560285,0.003202687,0.9889456,0.00031184644,0.0023050327],"study_design_scores_gemma":[0.001069528,0.0018337973,0.0004501847,0.0001082916,0.00036961824,0.000022657841,0.0035333277,0.0007068769,0.050284978,0.93988925,0.0013327516,0.00039871203],"about_ca_topic_score_codex":0.00000946172,"about_ca_topic_score_gemma":0.00002971229,"teacher_disagreement_score":0.57917094,"about_ca_system_score_codex":0.0001395615,"about_ca_system_score_gemma":0.000041306965,"threshold_uncertainty_score":0.7793241},"labels":[],"label_agreement":null},{"id":"W4412647884","doi":"10.55016/ojs/cdm.v2i1.61950","title":"A canonical partition theorem for trees","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Combinatorics; Discrete mathematics","score_opus":0.031732370162845344,"score_gpt":0.36440235914605473,"score_spread":0.3326699889832094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07711161,0.000024055684,0.91441554,0.0016439055,0.000077452256,0.0015369771,0.000698973,0.00022655528,0.0042649033],"genre_scores_gemma":[0.9200813,0.0000023420193,0.07818771,0.00015342885,0.00016966624,0.00053936825,0.000075725344,0.000037116482,0.0007533486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984271,0.000034707162,0.0005847433,0.0002538552,0.00019066173,0.000508955],"domain_scores_gemma":[0.9968165,0.0019034471,0.00015142668,0.00056734914,0.00031774092,0.00024354014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016666483,0.00019994607,0.00031797093,0.00011952535,0.00040991209,0.000057472975,0.00026636987,0.00012181771,0.00008787137],"category_scores_gemma":[0.0024267072,0.0001719924,0.00022010852,0.00037142824,0.00011373026,0.0000779688,0.000057456786,0.00011847057,0.00006628393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031128664,0.00020902147,0.000011406448,0.000042010546,0.00003915333,8.68495e-7,0.0006056158,0.000003828118,0.0022985407,0.9930845,0.003296894,0.00037706524],"study_design_scores_gemma":[0.0004960287,0.000080631406,0.000087241606,0.000062629406,0.00012921297,0.000010175255,0.00045738294,0.00041171137,0.008322737,0.9771829,0.012529426,0.00022990236],"about_ca_topic_score_codex":0.000001920284,"about_ca_topic_score_gemma":0.000084100684,"teacher_disagreement_score":0.84296966,"about_ca_system_score_codex":0.00010317802,"about_ca_system_score_gemma":0.00005309895,"threshold_uncertainty_score":0.7013647},"labels":[],"label_agreement":null},{"id":"W4412647898","doi":"10.55016/ojs/cdm.v2i1.61875","title":"Classes of codes from quadratic surfaces of PG(3,q)","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Quadratic equation; Geometry","score_opus":0.013079741330489067,"score_gpt":0.2896136453142532,"score_spread":0.27653390398376415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27376083,0.00012100021,0.7244659,0.00022210495,0.00007732726,0.00015486874,0.00017099734,0.000055482986,0.0009714537],"genre_scores_gemma":[0.9069672,0.000007828322,0.09293527,0.000030592026,0.000016864406,0.000005029649,0.000008165466,0.0000054798265,0.0000235384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987242,0.00005378317,0.0005490063,0.00018273576,0.00025199965,0.00023823563],"domain_scores_gemma":[0.99757266,0.0011524544,0.00024175552,0.0006419348,0.00028881838,0.00010235542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085467816,0.00013017176,0.00035103937,0.0001536384,0.000092365815,0.000040954103,0.00068052876,0.00006157457,0.000027739008],"category_scores_gemma":[0.0005366555,0.00011295485,0.00013659583,0.00066451484,0.00012938541,0.000160136,0.00017751026,0.00007470874,0.000015803122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011522167,0.00014687904,0.00044784916,0.000049772916,0.00006578947,0.0000017299055,0.0018166959,0.00007191756,0.016611302,0.9798384,0.0001765045,0.0007616798],"study_design_scores_gemma":[0.00060810376,0.0003144052,0.005445216,0.00043163353,0.00012027068,0.0000046404307,0.0012621885,0.011405412,0.23743883,0.7415714,0.0009808361,0.00041702227],"about_ca_topic_score_codex":0.000024710991,"about_ca_topic_score_gemma":0.000040673858,"teacher_disagreement_score":0.6332064,"about_ca_system_score_codex":0.00002095932,"about_ca_system_score_gemma":0.000048249112,"threshold_uncertainty_score":0.4606165},"labels":[],"label_agreement":null},{"id":"W4412647922","doi":"10.55016/ojs/cdm.v2i1.61885","title":"On the rigidity of regular bicycle (n,k)-gons","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Rigidity (electromagnetism); Combinatorics; Materials science","score_opus":0.020391223131922997,"score_gpt":0.33276876695995283,"score_spread":0.31237754382802985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412647922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045896195,0.000027919195,0.9466209,0.0029644019,0.00007267593,0.0004961982,0.00007850398,0.00008618364,0.0037570177],"genre_scores_gemma":[0.96331793,0.000002322021,0.03616042,0.00015209882,0.000027706687,0.000028331542,0.0000030434092,0.000010657056,0.00029749292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835885,0.000089583635,0.0003833238,0.00023851349,0.00047452495,0.00045522445],"domain_scores_gemma":[0.996178,0.0017979183,0.00012905899,0.0013872283,0.00034105105,0.00016678426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022403477,0.00013916894,0.0002140771,0.00017467784,0.00030269538,0.00006334261,0.0012743347,0.000055296492,0.000029801438],"category_scores_gemma":[0.0024648225,0.00009247505,0.00012112316,0.0010360191,0.000197116,0.00014015376,0.00035766716,0.00019895073,0.00014158562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075604403,0.00008153488,0.000010456744,0.000009560576,0.00001681971,0.0000033766646,0.000340167,0.00011048464,0.0023477592,0.9958159,0.0007462197,0.0005102159],"study_design_scores_gemma":[0.00020527294,0.00012797276,0.00042950636,0.00006723381,0.000009293515,0.000007654627,0.00015357083,0.0057818177,0.05081615,0.94064724,0.0015973389,0.00015692465],"about_ca_topic_score_codex":0.000002934783,"about_ca_topic_score_gemma":0.000006331767,"teacher_disagreement_score":0.91742176,"about_ca_system_score_codex":0.00008604635,"about_ca_system_score_gemma":0.000049644517,"threshold_uncertainty_score":0.37710232},"labels":[],"label_agreement":null},{"id":"W4412648037","doi":"10.55016/ojs/cdm.v1i1.61914","title":"Uniquely circular colourable and uniquely fractional colourable graphs of large girth","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Council","keywords":"Combinatorics; Mathematics; Girth (graph theory)","score_opus":0.010675779929692698,"score_gpt":0.2983649979812065,"score_spread":0.2876892180515138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120576635,0.00031057282,0.8738977,0.0014490612,0.0000612103,0.0007824497,0.00040450637,0.00015986078,0.0023580478],"genre_scores_gemma":[0.9342679,0.000027999013,0.06480956,0.00010217443,0.0000051657084,0.000104646366,0.000034422654,0.000019866617,0.0006283064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790233,0.00015206718,0.0005137404,0.00037558732,0.00046972866,0.0005865539],"domain_scores_gemma":[0.997633,0.0005364963,0.00021452969,0.00069583766,0.0007181423,0.00020202884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010696186,0.00021350353,0.0003922684,0.0003119371,0.00041835615,0.00013436821,0.0006476915,0.00011492379,0.00003804561],"category_scores_gemma":[0.0004992564,0.00020229211,0.00011338405,0.0011486798,0.00018927388,0.00046547144,0.00032815867,0.00024361779,0.000026315789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009941991,0.00017595361,0.00037540807,0.000058451176,0.00003162387,0.000008546904,0.00011238018,0.00032603068,0.0042851344,0.99375093,0.0008126686,0.00005293632],"study_design_scores_gemma":[0.00060928013,0.00013426071,0.0011842638,0.0000697348,0.00002095213,0.00003593069,0.00009579547,0.019110909,0.007812185,0.968107,0.002572167,0.00024753134],"about_ca_topic_score_codex":0.00003117622,"about_ca_topic_score_gemma":0.00002389459,"teacher_disagreement_score":0.81369126,"about_ca_system_score_codex":0.00011562736,"about_ca_system_score_gemma":0.00016924561,"threshold_uncertainty_score":0.8249233},"labels":[],"label_agreement":null},{"id":"W4412648039","doi":"10.55016/ojs/cdm.v1i1.61900","title":"Szemer'edi's regularity lemma revisited","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lemma (botany); Combinatorics; Mathematics; Genealogy; Biology; History; Botany","score_opus":0.016080342111403027,"score_gpt":0.3121497507281633,"score_spread":0.2960694086167603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25866398,0.0005860499,0.6673056,0.0037096376,0.00076701,0.0031214005,0.0023404295,0.0012815365,0.062224373],"genre_scores_gemma":[0.92415994,0.000012579627,0.071656965,0.00024711812,0.00060155697,0.0001063698,0.00013271204,0.000079864534,0.0030029006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973879,0.00012458724,0.0008715465,0.00040762813,0.00048772656,0.0007206393],"domain_scores_gemma":[0.997257,0.000611016,0.00026755978,0.0011915605,0.0004651953,0.00020764837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010274025,0.0003779211,0.00062940223,0.00020845218,0.0008283322,0.00012706438,0.00052535173,0.00021855984,0.00026751446],"category_scores_gemma":[0.0021531165,0.00031175834,0.00030284887,0.0006231231,0.0001764638,0.00014108114,0.00036018653,0.00029495166,0.00009078677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011753153,0.00011982983,0.00008612887,0.00012133929,0.00005664975,0.00000918965,0.0002914446,0.000008975366,0.0005596751,0.965124,0.033463288,0.00014774327],"study_design_scores_gemma":[0.00054604467,0.000049797312,0.00039798568,0.00014934198,0.00018392206,0.0000361603,0.00011982313,0.00053607696,0.0018644776,0.9756358,0.020040656,0.00043986167],"about_ca_topic_score_codex":0.000018876686,"about_ca_topic_score_gemma":0.000017936849,"teacher_disagreement_score":0.66549593,"about_ca_system_score_codex":0.00015389378,"about_ca_system_score_gemma":0.00004647916,"threshold_uncertainty_score":0.9999334},"labels":[],"label_agreement":null},{"id":"W4412648042","doi":"10.55016/ojs/cdm.v1i1.61901","title":"Classification of linear codes exploiting an invariant","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Mathematics; Invariant (physics); Combinatorics; Discrete mathematics","score_opus":0.024009442177748672,"score_gpt":0.28978886986806357,"score_spread":0.2657794276903149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083763115,0.00001837286,0.91363966,0.00059101457,0.00004930374,0.00019485442,0.000067275,0.00014756732,0.0015288322],"genre_scores_gemma":[0.881436,0.0000015310266,0.11837548,0.00003678415,0.000058693106,0.000030438365,0.000026278127,0.0000067647534,0.000028039654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989296,0.0000741936,0.00039217828,0.00020963016,0.00018460312,0.00020975011],"domain_scores_gemma":[0.99867314,0.00018532597,0.00016440112,0.00063622603,0.00025867872,0.0000822517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060780253,0.000111479756,0.00019211805,0.0001423756,0.00021418362,0.0000868862,0.00055029575,0.000049904407,0.000009653867],"category_scores_gemma":[0.00023817619,0.00010242678,0.000080388854,0.000564783,0.000057103458,0.0003021934,0.000117279495,0.00007135615,0.000023504655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024143483,0.0001171882,0.00008351104,0.00001661219,0.00000759427,8.260124e-7,0.0004616302,0.00013813934,0.014635364,0.98397136,0.00009978743,0.00046555608],"study_design_scores_gemma":[0.00046473852,0.00022012554,0.0035468522,0.00016795952,0.000048670365,0.000014592309,0.00059390813,0.22112952,0.031991977,0.7402251,0.0011873916,0.0004091779],"about_ca_topic_score_codex":0.000014904519,"about_ca_topic_score_gemma":0.000013465089,"teacher_disagreement_score":0.79767287,"about_ca_system_score_codex":0.000029023082,"about_ca_system_score_gemma":0.000039676524,"threshold_uncertainty_score":0.41768426},"labels":[],"label_agreement":null},{"id":"W4412648058","doi":"10.55016/ojs/cdm.v1i1.61912","title":"On primitive symmetric association schemes with m_1=3","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Association scheme; Combinatorics; Association (psychology); Psychology","score_opus":0.019730529632924612,"score_gpt":0.3260243892405387,"score_spread":0.3062938596076141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648058","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5556052,0.00007819503,0.3325271,0.0035041317,0.00015224742,0.0034219008,0.0013878897,0.0007591216,0.102564216],"genre_scores_gemma":[0.9626817,0.0000029845799,0.02914924,0.000118496624,0.00017683647,0.00030528533,0.00009823518,0.000089209985,0.007377985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99706686,0.00016924586,0.00057040295,0.0003913466,0.0010358298,0.00076629093],"domain_scores_gemma":[0.99372673,0.004187936,0.0003257282,0.00070028764,0.0008754269,0.00018390572],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013969801,0.00033699593,0.0005236061,0.0005012286,0.00035454784,0.00018348741,0.0003667928,0.00018798801,0.00016122156],"category_scores_gemma":[0.0092590675,0.00026671507,0.0001424899,0.0014787801,0.00007871196,0.00015299693,0.0001249951,0.0003895396,0.0006511657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005311496,0.0004358786,0.00020709999,0.00007843426,0.00010372961,0.00000989257,0.00017686492,0.000029514018,0.00040582387,0.99024576,0.008163522,0.0000903924],"study_design_scores_gemma":[0.0017997643,0.0006002525,0.0008472353,0.00036436375,0.0002178535,0.000015837606,0.000314291,0.001657066,0.0084341215,0.9814942,0.0035960476,0.00065897487],"about_ca_topic_score_codex":0.000011527807,"about_ca_topic_score_gemma":0.000024680607,"teacher_disagreement_score":0.40707654,"about_ca_system_score_codex":0.0010916236,"about_ca_system_score_gemma":0.00012109215,"threshold_uncertainty_score":0.9999785},"labels":[],"label_agreement":null},{"id":"W4412648062","doi":"10.55016/ojs/cdm.v1i1.61911","title":"Best Simultaneous Diophantine Approximations under a Constraint on the Denominator","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Austrian Science Fund","keywords":"Mathematics; Diophantine equation; Diophantine set; Constraint (computer-aided design); Combinatorics; Approximations of π; Diophantine approximation; Discrete mathematics; Applied mathematics; Geometry","score_opus":0.021211247150970086,"score_gpt":0.3072325860784801,"score_spread":0.28602133892751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07168884,0.00004869628,0.8824508,0.012111231,0.00012730852,0.0023515162,0.0012282563,0.00025574665,0.02973757],"genre_scores_gemma":[0.96071637,0.000004000342,0.035213843,0.00041178238,0.00017166063,0.00033366258,0.00005563356,0.00007244368,0.0030206086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973814,0.00009613838,0.0009648202,0.00037580417,0.0005398223,0.00064202084],"domain_scores_gemma":[0.99258995,0.00541098,0.000313444,0.0010022349,0.00041564525,0.0002677585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008146047,0.00042226585,0.0005915236,0.00014483945,0.00059810275,0.00024822375,0.0005158248,0.00016593914,0.00038495753],"category_scores_gemma":[0.007734638,0.00028000644,0.00026489393,0.000480585,0.0002667435,0.00007323337,0.00015632495,0.00032734292,0.00066631305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007334214,0.0006887816,0.0000021516748,0.00009239954,0.000058394962,0.00001087655,0.00017460523,0.00030047668,0.0006349329,0.99553925,0.002365996,0.0001248313],"study_design_scores_gemma":[0.0004340394,0.00010800017,0.0000077928225,0.00027301486,0.00017402666,0.000042670592,0.0006898421,0.07462671,0.00083894754,0.9203965,0.00198381,0.00042466685],"about_ca_topic_score_codex":0.000012068261,"about_ca_topic_score_gemma":0.000026184487,"teacher_disagreement_score":0.88902754,"about_ca_system_score_codex":0.00019652356,"about_ca_system_score_gemma":0.00010251059,"threshold_uncertainty_score":0.9999652},"labels":[],"label_agreement":null},{"id":"W4412648066","doi":"10.55016/ojs/cdm.v1i1.62769","title":"Sum and product of different sets","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Product (mathematics); Geometry","score_opus":0.01382463946740584,"score_gpt":0.2961174915697767,"score_spread":0.2822928521023708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648066","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9694067,0.00022178577,0.024656324,0.0005721401,0.00014148961,0.00076837785,0.00044814148,0.000094053365,0.0036909557],"genre_scores_gemma":[0.98728406,0.000007839696,0.012136647,0.000020604703,0.00007825448,0.00003457012,0.00001817564,0.000023649298,0.0003961745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870044,0.00004933038,0.0005133784,0.00021918232,0.00023331345,0.00028438336],"domain_scores_gemma":[0.9986081,0.00039684385,0.00017599986,0.00052727025,0.00019983102,0.00009192862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030282923,0.00020910837,0.00043851676,0.00011250432,0.00021510833,0.000030633077,0.00018393478,0.00006686469,0.00003956091],"category_scores_gemma":[0.0008251458,0.00015088735,0.000101907055,0.0001723473,0.0001551567,0.00005279582,0.0001942304,0.00010814791,0.0000033506478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008588835,0.00012249392,0.000478502,0.00020929113,0.000039991395,0.0000013590728,0.0005116406,0.0000028038914,0.0016317891,0.9947953,0.0019989873,0.00019921204],"study_design_scores_gemma":[0.00035280598,0.00005228206,0.002530993,0.00010241194,0.000112958616,0.000016411599,0.00011293705,0.00024294695,0.010209482,0.9855686,0.00049317675,0.0002050244],"about_ca_topic_score_codex":0.000008365657,"about_ca_topic_score_gemma":0.000016879363,"teacher_disagreement_score":0.017877353,"about_ca_system_score_codex":0.000035751113,"about_ca_system_score_gemma":0.000016103233,"threshold_uncertainty_score":0.6153008},"labels":[],"label_agreement":null},{"id":"W4412648067","doi":"10.55016/ojs/cdm.v1i1.61915","title":"Induced Subgraphs of Bounded Degree and Bounded Treewidth","year":2006,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":true,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad","keywords":"Treewidth; Bounded function; Mathematics; Combinatorics; Degree (music); Discrete mathematics; Graph; Pathwidth; Line graph","score_opus":0.025956985522601995,"score_gpt":0.3125563119720091,"score_spread":0.2865993264494071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21976419,0.00015677787,0.7760255,0.00077936845,0.000055354933,0.0005430497,0.00009241129,0.00012564732,0.0024577398],"genre_scores_gemma":[0.8992079,0.0000062690547,0.100432426,0.000034357356,0.000025221078,0.00005353551,0.000011392045,0.000014948934,0.00021394476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981488,0.00008964802,0.00050066866,0.0003547863,0.00041481917,0.0004912837],"domain_scores_gemma":[0.9979648,0.00039170336,0.00016750763,0.0009003783,0.00039373452,0.00018189244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062297395,0.00020446724,0.00037449555,0.0003264668,0.00027822034,0.00019150648,0.00075055234,0.000089620466,0.000009221279],"category_scores_gemma":[0.00052007515,0.00018215773,0.000104445375,0.0010965618,0.00021543737,0.00033616245,0.00038959304,0.00016436027,0.000020263627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008150477,0.000095036936,0.00016279292,0.00003339461,0.000022441998,0.000004242775,0.00024009353,0.000006388868,0.008230787,0.9898598,0.0001283651,0.0012084729],"study_design_scores_gemma":[0.0007042888,0.0001555376,0.0021054572,0.000060913495,0.00002083968,0.000020539037,0.00007476322,0.0055463873,0.017901983,0.97265124,0.0004973142,0.0002607363],"about_ca_topic_score_codex":0.000035248326,"about_ca_topic_score_gemma":0.000072410454,"teacher_disagreement_score":0.6794437,"about_ca_system_score_codex":0.00007688252,"about_ca_system_score_gemma":0.00010239859,"threshold_uncertainty_score":0.74281764},"labels":[],"label_agreement":null},{"id":"W4412648091","doi":"10.55016/ojs/cdm.v13i1.62505","title":"On the number of partitions into odd parts or congruent to ± 2 ( mod 10 )","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mod; Mathematics; Combinatorics","score_opus":0.044636064606772434,"score_gpt":0.39246376853548004,"score_spread":0.3478277039287076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2053778,0.000016662534,0.737447,0.011172131,0.0004066872,0.00379084,0.0010877077,0.00041510444,0.04028605],"genre_scores_gemma":[0.8962887,0.000004620259,0.08505605,0.00058570754,0.00023765762,0.0009014208,0.000019609206,0.00009522219,0.016811028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973376,0.00010819652,0.0010003292,0.00034969774,0.00062242424,0.000581771],"domain_scores_gemma":[0.9937771,0.0032491812,0.000292577,0.0013330607,0.00101641,0.00033167005],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000735839,0.00035733884,0.0006532103,0.00012325334,0.0005038225,0.00010904852,0.00060266425,0.00011613863,0.0046259104],"category_scores_gemma":[0.016352963,0.00022731052,0.00019878251,0.0006659656,0.0004418358,0.00014577655,0.0003404322,0.00018383004,0.003342744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048318547,0.00034527198,0.0000040907403,0.00014703823,0.00008827002,0.0000030944154,0.0025338272,0.000024844463,0.00029554506,0.9469126,0.04956283,0.000034259592],"study_design_scores_gemma":[0.00032758998,0.00024848836,0.000010119577,0.0005357125,0.00014791828,0.00001429098,0.0011824236,0.0005993186,0.0097859735,0.9814129,0.005420255,0.00031504338],"about_ca_topic_score_codex":0.000009273148,"about_ca_topic_score_gemma":0.00012022359,"teacher_disagreement_score":0.6909109,"about_ca_system_score_codex":0.00020639788,"about_ca_system_score_gemma":0.00010921708,"threshold_uncertainty_score":0.99743325},"labels":[],"label_agreement":null},{"id":"W4412648234","doi":"10.55016/ojs/cdm.v13i1.62310","title":"On the enumeration of a class of toroidal graphs","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Enumeration; Combinatorics; Mathematics; Toroid; Class (philosophy); Computer science; Physics; Artificial intelligence","score_opus":0.01820904632752397,"score_gpt":0.3194199532373009,"score_spread":0.3012109069097769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06477658,0.000021759155,0.9308354,0.0015770405,0.00007179617,0.00043460677,0.00010818877,0.00003394991,0.0021406675],"genre_scores_gemma":[0.9830607,0.0000024479295,0.016700732,0.00007691341,0.000020979038,0.000037451602,0.0000029743092,0.0000062404774,0.000091530834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988217,0.00010308042,0.00033451087,0.00016348172,0.0003593479,0.00021787567],"domain_scores_gemma":[0.9975802,0.0007203415,0.00015401814,0.0008521276,0.0006256525,0.000067678884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072406215,0.000098335986,0.00018519079,0.00013041885,0.00016978182,0.00003600258,0.000789293,0.000039883234,0.000033705157],"category_scores_gemma":[0.0014618563,0.00006550849,0.00008822882,0.0007322814,0.00027268563,0.00013200878,0.00019953998,0.00009366371,0.000061493614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009479521,0.00005738369,0.000008177404,0.000011873652,0.000017568833,2.4734527e-7,0.00079211855,0.000028991713,0.008333783,0.9899523,0.00038996953,0.00039807725],"study_design_scores_gemma":[0.00022761933,0.00045766385,0.00010836091,0.00008150341,0.000010029724,0.000002823204,0.00012644188,0.021894718,0.09533008,0.88109064,0.00056095555,0.00010914412],"about_ca_topic_score_codex":0.0000026139028,"about_ca_topic_score_gemma":0.0000057841903,"teacher_disagreement_score":0.9182842,"about_ca_system_score_codex":0.0000349753,"about_ca_system_score_gemma":0.000059688882,"threshold_uncertainty_score":0.26713586},"labels":[],"label_agreement":null},{"id":"W4412648238","doi":"10.55016/ojs/cdm.v13i1.62469","title":"On the combinatorics of modified lattice paths and generalized q --series","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Council of Scientific and Industrial Research, India","keywords":"Combinatorics; Mathematics; Series (stratigraphy); Lattice (music); Discrete mathematics; Physics; Biology","score_opus":0.03575819493167208,"score_gpt":0.33404429448157,"score_spread":0.29828609954989793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5541497,0.00013988261,0.41382974,0.005257519,0.00036258073,0.0023702122,0.0006357534,0.00032019918,0.022934416],"genre_scores_gemma":[0.958181,0.00002683558,0.03760581,0.00016004554,0.00009406916,0.00013667319,0.0000070607994,0.000059610673,0.0037288493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815387,0.00010562242,0.000682508,0.0002486008,0.00042944003,0.0003799765],"domain_scores_gemma":[0.9955656,0.0025255291,0.00029294245,0.0008420354,0.00062372815,0.00015014588],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0007403527,0.00027896877,0.0005570117,0.000105416475,0.00038361413,0.00008450003,0.00036771604,0.00010640869,0.00010922404],"category_scores_gemma":[0.009619303,0.0001884497,0.000109097724,0.0003762684,0.0005884566,0.00015358222,0.00025497656,0.00017080842,0.000064893495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023438484,0.00014431079,0.000002770562,0.00016311524,0.000057207777,0.0000014672652,0.001424579,0.0000030002077,0.0006543649,0.99494845,0.0025613494,0.000015944874],"study_design_scores_gemma":[0.0004333425,0.00023292721,0.0000128663405,0.00021435737,0.00012403613,0.000012045527,0.00067969365,0.001464326,0.009862077,0.9863693,0.0003748673,0.00022016534],"about_ca_topic_score_codex":0.000003832878,"about_ca_topic_score_gemma":0.000009224209,"teacher_disagreement_score":0.40403134,"about_ca_system_score_codex":0.000074370044,"about_ca_system_score_gemma":0.00004105885,"threshold_uncertainty_score":0.9987231},"labels":[],"label_agreement":null},{"id":"W4412648254","doi":"10.55016/ojs/cdm.v13i1.62548","title":"Uniformly resolvable (C4, K1,3) -designs of index 2","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Ministero dell’Istruzione, dell’Università e della Ricerca; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Combinatorics; Index (typography); Statistics; Discrete mathematics; Computer science","score_opus":0.01208784937286285,"score_gpt":0.25704937298803887,"score_spread":0.24496152361517604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1172954,0.00017792096,0.837342,0.00013578584,0.0004437008,0.00071105047,0.0005195586,0.00042070888,0.04295388],"genre_scores_gemma":[0.9971541,0.000005066963,0.0021205607,0.00002160971,0.00011121286,0.000042930988,0.000014734119,0.000029305626,0.0005004652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891174,0.000030621246,0.00043652428,0.00012461639,0.00017051928,0.00032595996],"domain_scores_gemma":[0.99895567,0.00010255844,0.000061951185,0.0005100148,0.00023727854,0.00013250747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043119615,0.00016495961,0.00030433878,0.00014246406,0.00012747696,0.000032680466,0.00025776215,0.000102880585,0.00013912292],"category_scores_gemma":[0.00019438694,0.00014976904,0.00009274427,0.00047237868,0.000112239315,0.00009943649,0.00004607355,0.000099454104,0.00025960678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003530988,0.0001102705,0.00016490601,0.00046692393,0.00025517447,0.000004228492,0.0032858846,0.0025198902,0.03136866,0.9480677,0.013262181,0.0004588158],"study_design_scores_gemma":[0.0030732343,0.0010288954,0.0010611347,0.0016465937,0.00036713612,0.000081607664,0.0044013816,0.21838301,0.24120183,0.4153073,0.1113586,0.0020892601],"about_ca_topic_score_codex":0.0000056568388,"about_ca_topic_score_gemma":0.000014945202,"teacher_disagreement_score":0.87985873,"about_ca_system_score_codex":0.0000586082,"about_ca_system_score_gemma":0.000026032772,"threshold_uncertainty_score":0.6107404},"labels":[],"label_agreement":null},{"id":"W4412648266","doi":"10.55016/ojs/cdm.v13i1.62452","title":"Bounds for the boxicity of Mycielski graphs","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.016998247141056855,"score_gpt":0.298509867634204,"score_spread":0.28151162049314715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009475137,0.0001422357,0.98516715,0.0035765136,0.00028780045,0.0005392751,0.00012108017,0.00009609142,0.0005947358],"genre_scores_gemma":[0.90460265,0.0000059050863,0.094723426,0.0003472338,0.000019801757,0.00008340899,0.000004092695,0.000007944461,0.00020554506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890876,0.000024078081,0.00035759335,0.0002045937,0.00021681956,0.00028817978],"domain_scores_gemma":[0.99770635,0.00049276353,0.00013821495,0.00083101535,0.0007340154,0.00009761678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007549407,0.00011797216,0.00019927791,0.00009085496,0.0004700937,0.00010728145,0.0007754624,0.00005199198,0.000008831469],"category_scores_gemma":[0.00074491027,0.000076351,0.00014391082,0.00061333406,0.00022425121,0.00010642301,0.00020208277,0.00006269127,0.000034892277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031254986,0.000051249237,0.000013054575,0.000017277385,0.000030171084,1.1754621e-7,0.00065029407,0.000020692467,0.001858481,0.99207187,0.004814699,0.00046897147],"study_design_scores_gemma":[0.00043629273,0.0002783669,0.0001203416,0.0000699568,0.000053465053,0.000006418749,0.00009263545,0.074390225,0.01899585,0.8983533,0.0070246872,0.00017848733],"about_ca_topic_score_codex":0.000009547379,"about_ca_topic_score_gemma":0.000008459249,"teacher_disagreement_score":0.8951275,"about_ca_system_score_codex":0.000018956975,"about_ca_system_score_gemma":0.00006485043,"threshold_uncertainty_score":0.36156282},"labels":[],"label_agreement":null},{"id":"W4412648270","doi":"10.55016/ojs/cdm.v13i1.62475","title":"String C-groups of order 1024","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Council of the Philippines; Commission on Higher Education","keywords":"Mathematics; Combinatorics; Order (exchange); String (physics); Mathematical physics","score_opus":0.01049363309361958,"score_gpt":0.2827691279041704,"score_spread":0.27227549481055086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412648270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052402034,0.000051064166,0.94390917,0.00073749165,0.00019946291,0.00022121398,0.00007092164,0.00017089154,0.0022377782],"genre_scores_gemma":[0.8821428,0.0000026375883,0.11736873,0.00012918709,0.00010821145,0.000018046796,0.0000050792078,0.000010416647,0.00021490116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998822,0.000032218606,0.0003706377,0.00023023882,0.00023318535,0.000311757],"domain_scores_gemma":[0.99831736,0.00017493017,0.00012554994,0.00081397267,0.00044514306,0.00012306366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044460702,0.00013709738,0.00024636879,0.00011935365,0.00015986012,0.00009548827,0.0008108084,0.000056560777,0.000064522756],"category_scores_gemma":[0.00053843285,0.00011617335,0.00007254593,0.00074069086,0.00010773671,0.00022719368,0.00040921554,0.0000744257,0.00025749093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001797226,0.000056747223,0.000021401353,0.000022373937,0.000022205088,0.0000014425523,0.0009804694,0.000011173349,0.0031245418,0.99328965,0.0008503735,0.0016178375],"study_design_scores_gemma":[0.0012651703,0.00060034485,0.0009485454,0.00055147614,0.00009008201,0.000059120684,0.0007889848,0.21818984,0.10688233,0.65615326,0.013524002,0.000946821],"about_ca_topic_score_codex":0.0000047617705,"about_ca_topic_score_gemma":0.0000036151084,"teacher_disagreement_score":0.82974076,"about_ca_system_score_codex":0.00004681258,"about_ca_system_score_gemma":0.00006338174,"threshold_uncertainty_score":0.47374117},"labels":[],"label_agreement":null},{"id":"W4413106059","doi":"10.55016/ojs/cdm.v4i1.62002","title":"Classifying real Lehmer triples: a revived computation","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical and Theoretical Analysis","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computation; Mathematics; Combinatorics; Algorithm","score_opus":0.03699826079995998,"score_gpt":0.3669715250301218,"score_spread":0.3299732642301618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028601559,0.000046539622,0.92410237,0.006440381,0.00007060761,0.0010493048,0.00015555287,0.00046644983,0.039067224],"genre_scores_gemma":[0.87907684,0.00002721665,0.11885427,0.00037630997,0.00017314026,0.00007426777,0.00005778912,0.000038652754,0.0013215204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970817,0.00014354354,0.0011210308,0.00043317393,0.0005793175,0.00064123893],"domain_scores_gemma":[0.9970054,0.0011699995,0.0002848383,0.00062341284,0.00047407922,0.0004422534],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096421764,0.00038962273,0.0009083719,0.00021806249,0.00036971716,0.00015889521,0.00037279102,0.00017491185,0.0003387128],"category_scores_gemma":[0.004209502,0.00030270775,0.00040042633,0.0008360846,0.0001306189,0.00014684004,0.00009751655,0.00026816185,0.00041906713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019863188,0.00037676765,0.000006031384,0.00013259774,0.00008458725,0.0000080095915,0.000870214,0.00001898905,0.0008159612,0.9932219,0.0028838473,0.001561244],"study_design_scores_gemma":[0.00059984653,0.00015439141,0.00006846381,0.00032721797,0.00038083384,0.000015236751,0.00046577665,0.020162746,0.0006927812,0.9761284,0.00058069127,0.0004236407],"about_ca_topic_score_codex":0.0000045938873,"about_ca_topic_score_gemma":0.000005044615,"teacher_disagreement_score":0.85047525,"about_ca_system_score_codex":0.00018383925,"about_ca_system_score_gemma":0.000056100987,"threshold_uncertainty_score":0.9999425},"labels":[],"label_agreement":null},{"id":"W4413106070","doi":"10.55016/ojs/cdm.v4i1.61986","title":"Geometric realizations of special toroidal complexes","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Molecular spectroscopy and chirality","field":"Chemistry","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Toroid; Mathematics; Combinatorics; Geometry; Physics; Quantum mechanics; Plasma","score_opus":0.011062772101680404,"score_gpt":0.29940436149831845,"score_spread":0.28834158939663806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2428794,0.0002714618,0.54630786,0.0026253888,0.0001703529,0.0004888629,0.0031490885,0.00025680318,0.20385076],"genre_scores_gemma":[0.9923886,0.000014233275,0.006120241,0.000087462984,0.0004042901,0.000012604878,0.00019431306,0.000012609447,0.00076566037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987417,0.000015721813,0.00048156126,0.00019066739,0.00027985338,0.00029049424],"domain_scores_gemma":[0.9988817,0.00007144304,0.00015926629,0.00051034015,0.00022218512,0.00015509584],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001418886,0.0001603788,0.00032597932,0.000118664335,0.00016176898,0.00004165101,0.00027812892,0.00009645625,0.0012945866],"category_scores_gemma":[0.0007242492,0.00015522049,0.00014846509,0.00056944654,0.00005936542,0.000057438454,0.000052214145,0.000118596705,0.00004257045],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031740004,0.000639999,0.00019671021,0.0001396981,0.000080903534,0.0000069887774,0.00078434293,0.00017660805,0.1950551,0.7942734,0.0074252984,0.0011892144],"study_design_scores_gemma":[0.0017688975,0.00030034545,0.0031499332,0.0003058389,0.00033695018,0.00003372336,0.00045878635,0.0017520383,0.8353547,0.11832102,0.03726427,0.00095354446],"about_ca_topic_score_codex":0.000009990044,"about_ca_topic_score_gemma":0.0000103381735,"teacher_disagreement_score":0.74950916,"about_ca_system_score_codex":0.00011288874,"about_ca_system_score_gemma":0.00005318424,"threshold_uncertainty_score":0.99961835},"labels":[],"label_agreement":null},{"id":"W4413106078","doi":"10.55016/ojs/cdm.v4i1.61929","title":"A local characterization of combinatorial multihedrality in tilings","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Russian Foundation for Basic Research","keywords":"Characterization (materials science); Combinatorics; Mathematics; Physics","score_opus":0.009875489948862925,"score_gpt":0.2703849971073572,"score_spread":0.26050950715849425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106078","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9351567,0.000015461299,0.06329083,0.00057144597,0.00015984199,0.00033328202,0.0002723025,0.000034409633,0.00016575756],"genre_scores_gemma":[0.99842674,0.0000021803546,0.0013939053,0.00006860117,0.000036176534,0.000010222603,0.00003298915,0.0000052277783,0.000023941793],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99901104,0.000044161254,0.0004165094,0.00014334182,0.00017689678,0.00020806593],"domain_scores_gemma":[0.99942005,0.000037278693,0.00011701954,0.00020904036,0.00014824946,0.0000683826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003141714,0.00010771049,0.0002654778,0.000053796233,0.00006429015,0.00003885086,0.0001641454,0.00006840783,0.00009008038],"category_scores_gemma":[0.0002162957,0.00008658012,0.00004621247,0.00019215437,0.00007001573,0.00011659636,0.00004146138,0.00006358448,0.000023802293],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046900823,0.00009245473,0.000032933738,0.000034557368,0.0000019546305,0.0000011224512,0.0010057378,0.00005313352,0.93507975,0.06318457,0.000013946388,0.00045294786],"study_design_scores_gemma":[0.0011235558,0.00030824644,0.008588369,0.00021018306,0.000023855077,0.000005323511,0.00021466511,0.004969416,0.91113466,0.07232542,0.00079653,0.00029977915],"about_ca_topic_score_codex":0.00003098194,"about_ca_topic_score_gemma":0.000005065882,"teacher_disagreement_score":0.063270085,"about_ca_system_score_codex":0.00007213913,"about_ca_system_score_gemma":0.000034636032,"threshold_uncertainty_score":0.3530635},"labels":[],"label_agreement":null},{"id":"W4413106080","doi":"10.55016/ojs/cdm.v4i1.62036","title":"Computing holes in semi-groups and its applications to transportation problems","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.014055370327497355,"score_gpt":0.2799719674900482,"score_spread":0.26591659716255084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038529735,0.00025725254,0.9570636,0.002002002,0.000030882886,0.0010350128,0.00004640923,0.00015172937,0.00088334],"genre_scores_gemma":[0.97408193,0.000013257917,0.025486471,0.0001787974,0.00004356938,0.00009242113,0.000022856324,0.000006457914,0.00007423087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987932,0.000026593767,0.0003748216,0.00032732426,0.0001538093,0.00032426367],"domain_scores_gemma":[0.9991046,0.00012856022,0.00008189998,0.00030899036,0.00018257377,0.00019338267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033366465,0.00015583403,0.00023664313,0.00015520678,0.00019995458,0.00014948453,0.00039039558,0.00006523471,0.0000021301391],"category_scores_gemma":[0.00016349507,0.0001438616,0.000042881376,0.0007529942,0.00001956384,0.00019937057,0.000048440685,0.00010855094,0.00005939829],"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.0000014373843,0.00013530834,0.0001485137,0.00004632712,0.0000065144995,0.0000022238414,0.0068247933,0.0010277622,0.0015339796,0.98455447,0.00012648235,0.0055922153],"study_design_scores_gemma":[0.0025424468,0.0006904778,0.046780415,0.0011633473,0.000101188445,0.000051767707,0.0010822639,0.48838407,0.005695349,0.43944222,0.012144149,0.0019222996],"about_ca_topic_score_codex":0.0000026599528,"about_ca_topic_score_gemma":0.00003697598,"teacher_disagreement_score":0.9355522,"about_ca_system_score_codex":0.000074291245,"about_ca_system_score_gemma":0.00003967194,"threshold_uncertainty_score":0.5866506},"labels":[],"label_agreement":null},{"id":"W4413106090","doi":"10.55016/ojs/cdm.v4i1.61874","title":"The search for N-e.c. graphs","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Combinatorics; Mathematics","score_opus":0.02301138307289361,"score_gpt":0.3528199337561546,"score_spread":0.329808550683261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010706183,0.00012672633,0.97875476,0.017469607,0.000095185795,0.0010289174,0.00007382116,0.00015679472,0.0012235644],"genre_scores_gemma":[0.7826311,0.00004285631,0.21455972,0.0005940283,0.00008960235,0.0003490813,0.000014284089,0.000021107058,0.0016982292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983443,0.00006767364,0.00029572865,0.00027456586,0.00035887875,0.0006588455],"domain_scores_gemma":[0.9970627,0.0010861555,0.000051527048,0.0010565209,0.00052963995,0.00021345307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012712392,0.00014087187,0.00017387675,0.00012244585,0.001004234,0.000371243,0.0015389564,0.000046770037,0.0000027584674],"category_scores_gemma":[0.0009136327,0.00009454386,0.00014477476,0.0008284884,0.000102929356,0.00022027202,0.00019239153,0.00015301007,0.00007677072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000791139,0.00003484732,0.0000025951076,0.0000051639167,0.000011451663,9.967085e-7,0.00026256108,0.00007210246,0.00065114885,0.98917174,0.0013790956,0.008400371],"study_design_scores_gemma":[0.0002861198,0.00020642449,0.000098050616,0.000020373316,0.0000062704726,0.000007681499,0.00009317331,0.02331518,0.004886234,0.9616657,0.009260784,0.00015403387],"about_ca_topic_score_codex":5.1604115e-7,"about_ca_topic_score_gemma":0.0000018053095,"teacher_disagreement_score":0.7815605,"about_ca_system_score_codex":0.00007462225,"about_ca_system_score_gemma":0.000080829974,"threshold_uncertainty_score":0.77238566},"labels":[],"label_agreement":null},{"id":"W4413106099","doi":"10.55016/ojs/cdm.v4i1.61995","title":"{-1,2}-hypomorphy and hereditary hypomorphy coincide for posets","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Star product","score_opus":0.008793655662201274,"score_gpt":0.2777571475324041,"score_spread":0.26896349187020285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4773568,0.0024668004,0.50247335,0.008013033,0.0002957155,0.0033985751,0.003700173,0.000109309985,0.0021862143],"genre_scores_gemma":[0.94345415,0.00007647934,0.053254575,0.00084852666,0.00041817193,0.00014297923,0.00091262255,0.00003633483,0.0008561493],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988871,0.000021203456,0.00027839857,0.000307013,0.00013480792,0.00037143938],"domain_scores_gemma":[0.99905115,0.000038717837,0.000079897545,0.00039008274,0.0002333226,0.00020680623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024594206,0.00020549865,0.00024258529,0.00006154317,0.0001737994,0.000052848663,0.00017736758,0.00011742076,0.000013502385],"category_scores_gemma":[0.00040612905,0.000195957,0.000104358165,0.0001107051,0.000057719448,0.000006268074,0.00008360972,0.000059790917,0.000022829248],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016932098,0.00046798252,0.00014855358,0.00015067635,0.0003316849,0.000020534011,0.00045075783,0.00009702201,0.90262026,0.020466845,0.06835335,0.0067230146],"study_design_scores_gemma":[0.012854758,0.008931102,0.010246871,0.00040761477,0.0010348598,0.00076278904,0.0015404425,0.008292315,0.44155058,0.11700619,0.39334205,0.004030417],"about_ca_topic_score_codex":0.0000021483831,"about_ca_topic_score_gemma":0.0000049047576,"teacher_disagreement_score":0.46609735,"about_ca_system_score_codex":0.000031391766,"about_ca_system_score_gemma":0.000049023252,"threshold_uncertainty_score":0.7990895},"labels":[],"label_agreement":null},{"id":"W4413106101","doi":"10.55016/ojs/cdm.v4i1.61878","title":"Results on permutations with distinct difference property","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Carleton University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Property (philosophy); Combinatorics","score_opus":0.010103001978321065,"score_gpt":0.23740924101247035,"score_spread":0.2273062390341493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.431932,0.00006323629,0.50068104,0.0020077839,0.00019908063,0.001593848,0.0017460884,0.0011627969,0.06061413],"genre_scores_gemma":[0.99803984,0.0000018184907,0.0007403256,0.00004824801,0.000045874152,0.000069744354,0.00006425368,0.000016744163,0.0009731493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906796,0.00002676289,0.00029276483,0.00016470424,0.00017400409,0.0002737851],"domain_scores_gemma":[0.99918765,0.00010697827,0.00005003333,0.00040678852,0.0001043287,0.00014423115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015029423,0.0001902175,0.00022113713,0.00007985073,0.00018440236,0.00007245112,0.0001676541,0.000051864492,0.0000110598785],"category_scores_gemma":[0.00028813365,0.00011265861,0.000052330026,0.0003017788,0.000035921574,0.000053486245,0.000009550211,0.00013286626,0.0001395352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002553259,0.00060010847,0.00007831628,0.0002459295,0.00021620828,0.0000531982,0.0074873446,0.02359174,0.00869923,0.9455317,0.006473245,0.0067676217],"study_design_scores_gemma":[0.016469155,0.0097848745,0.08455526,0.008966801,0.0012744311,0.0006384943,0.0069609457,0.36939853,0.04780491,0.39189023,0.053195074,0.009061299],"about_ca_topic_score_codex":0.0000014296164,"about_ca_topic_score_gemma":0.0000084752855,"teacher_disagreement_score":0.56610787,"about_ca_system_score_codex":0.00007146873,"about_ca_system_score_gemma":0.000016005117,"threshold_uncertainty_score":0.45940846},"labels":[],"label_agreement":null},{"id":"W4413106111","doi":"10.55016/ojs/cdm.v4i1.62031","title":"Weakly partitive families on infinite sets","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.024752719970845535,"score_gpt":0.3583746169209983,"score_spread":0.33362189695015276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413106111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29428273,0.0001811252,0.53109246,0.014871615,0.0005881603,0.0028719436,0.001987131,0.0013385614,0.15278628],"genre_scores_gemma":[0.9717932,0.000022019225,0.024886806,0.0014726095,0.00010631401,0.000078708385,0.000049039616,0.000030384392,0.0015609501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830234,0.00010390015,0.0005121392,0.00030346477,0.00024681838,0.0005313279],"domain_scores_gemma":[0.9975565,0.0011869018,0.00016416238,0.00065629807,0.00022605622,0.00021006005],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039667616,0.0003054295,0.00048670903,0.00017312236,0.00036769125,0.000040606425,0.00027946627,0.0001700346,0.00015215253],"category_scores_gemma":[0.0036704554,0.00025962558,0.0001545869,0.0003251573,0.00014938501,0.00012812659,0.00006093873,0.00029799223,0.00063448324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044604552,0.00023279269,0.0000070072238,0.000018885032,0.000041585023,0.000013046277,0.0015112354,0.00005302938,0.0002970186,0.9927929,0.003911183,0.0010766842],"study_design_scores_gemma":[0.00045850006,0.00035339207,0.0001878798,0.0001477438,0.00007624336,0.000015831729,0.0009034453,0.00033391215,0.003116968,0.98820144,0.0058684307,0.00033620384],"about_ca_topic_score_codex":7.084183e-7,"about_ca_topic_score_gemma":0.0000061811697,"teacher_disagreement_score":0.67751044,"about_ca_system_score_codex":0.00011870634,"about_ca_system_score_gemma":0.00004841552,"threshold_uncertainty_score":0.9999856},"labels":[],"label_agreement":null},{"id":"W4413184403","doi":"10.55016/ojs/cdm.v8i1.62120","title":"An improved bound on the number of point-surface incidences in three dimensions","year":2013,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Defense Science and Engineering Graduate; U.S. Department of Defense","keywords":"Mathematics; Combinatorics; Point (geometry); Surface (topology); Geometry","score_opus":0.014971908942121701,"score_gpt":0.29572869700788385,"score_spread":0.28075678806576215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413184403","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52451426,0.000014870101,0.47159073,0.0030240014,0.00006850547,0.00042735142,0.000018121551,0.000027549222,0.00031459494],"genre_scores_gemma":[0.95511234,0.0000022116276,0.04449203,0.00024362301,0.000022991897,0.000058365094,0.000007937592,0.0000049447335,0.000055570843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891037,0.00007710849,0.0003564033,0.00020805393,0.00024136103,0.00020672269],"domain_scores_gemma":[0.99832505,0.00056835084,0.00011812918,0.0005669214,0.00032997577,0.00009156609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053720083,0.00011776364,0.00016857614,0.000065693595,0.00018387528,0.00016680098,0.00053793925,0.000044507997,0.00007346979],"category_scores_gemma":[0.000501317,0.000080716425,0.000050546994,0.0006497627,0.00005195323,0.00041124882,0.0001343852,0.00010516201,0.00017530467],"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.0000030006386,0.0002095324,0.00034694988,0.000010898627,0.000016185664,7.7803406e-7,0.0010637587,0.0070625967,0.011607291,0.97854745,0.00048422272,0.00064731936],"study_design_scores_gemma":[0.00020177524,0.00010243903,0.0044833235,0.00006379207,0.000007714317,0.000006397529,0.00018711778,0.6368134,0.004763692,0.35314947,0.00006219072,0.00015868383],"about_ca_topic_score_codex":0.00007061191,"about_ca_topic_score_gemma":0.000060715724,"teacher_disagreement_score":0.6297508,"about_ca_system_score_codex":0.000053800846,"about_ca_system_score_gemma":0.000086093816,"threshold_uncertainty_score":0.32915205},"labels":[],"label_agreement":null},{"id":"W4413184431","doi":"10.55016/ojs/cdm.v8i1.62128","title":"Quasi--Hermitian varieties in PG(r,q^2), q even","year":2013,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Geometry","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hermitian matrix; Combinatorics; Pure mathematics","score_opus":0.01733721951035055,"score_gpt":0.3240131942493804,"score_spread":0.30667597473902986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413184431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37172282,0.00020065255,0.6089296,0.0049562776,0.00026198593,0.0024865866,0.00028476774,0.0004183203,0.010738996],"genre_scores_gemma":[0.9597667,0.000010300503,0.036817603,0.00024496703,0.0001141455,0.0004709765,0.000030889172,0.000058252463,0.0024861845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997803,0.00007341149,0.00075590017,0.0003331291,0.0003500449,0.0006845166],"domain_scores_gemma":[0.99774754,0.000786543,0.00017052681,0.00073697045,0.00029042637,0.00026798548],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004238941,0.0003199299,0.00057424465,0.00029357412,0.00018029462,0.00012215372,0.00039584347,0.00016998597,0.00080630166],"category_scores_gemma":[0.0032070163,0.000282583,0.00014777954,0.0007886653,0.00009571558,0.00033222174,0.00018620532,0.00029648576,0.0012027159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006073238,0.0006076705,0.00033221333,0.00017002902,0.000050600138,0.000009843184,0.0022276598,0.000028650536,0.00049158133,0.98905367,0.0059222532,0.001099738],"study_design_scores_gemma":[0.0005719795,0.00011456841,0.0008971491,0.00016001289,0.0000401611,0.000015597756,0.0017551688,0.0012455061,0.0006307656,0.9927443,0.0014005295,0.00042422698],"about_ca_topic_score_codex":0.00002008155,"about_ca_topic_score_gemma":0.000063751504,"teacher_disagreement_score":0.58804387,"about_ca_system_score_codex":0.00020056883,"about_ca_system_score_gemma":0.00007033632,"threshold_uncertainty_score":0.9999626},"labels":[],"label_agreement":null},{"id":"W4413184434","doi":"10.55016/ojs/cdm.v8i1.61907","title":"Computations in cubic function fields of characteristic three","year":2013,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Computation; Function (biology); Combinatorics; Applied mathematics; Algorithm; Evolutionary biology; Biology","score_opus":0.019510685286102305,"score_gpt":0.292993977061359,"score_spread":0.2734832917752567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413184434","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5055511,0.000021901182,0.4915769,0.0005478638,0.000106957305,0.0006561951,0.00007669259,0.00005729739,0.0014050665],"genre_scores_gemma":[0.9903105,0.0000020957275,0.009064723,0.00007320307,0.000051742103,0.0001687763,0.0000351684,0.000019745132,0.00027405916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856293,0.000058622947,0.00068489177,0.00018465181,0.00020733703,0.00030159124],"domain_scores_gemma":[0.9980264,0.00091428653,0.00020890009,0.0004347375,0.00030038052,0.000115296214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043201415,0.00017732335,0.00041742192,0.00023215929,0.00010071361,0.000036883048,0.00021038877,0.00012369636,0.0007319737],"category_scores_gemma":[0.001664378,0.00016113956,0.000107539825,0.0005797221,0.000071556686,0.00016312201,0.000091018934,0.00018382186,0.00034833222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018804396,0.00044929355,0.0007116422,0.0003286063,0.00008642525,0.0000021643682,0.0014672099,0.00008601031,0.0011260188,0.9927852,0.0017760913,0.0011625286],"study_design_scores_gemma":[0.0004552496,0.000100422105,0.008253552,0.00019173628,0.00007675114,0.0000070190367,0.0004914854,0.0045916536,0.0005741408,0.9849456,0.00010558004,0.00020683507],"about_ca_topic_score_codex":0.000029369969,"about_ca_topic_score_gemma":0.000037067915,"teacher_disagreement_score":0.48475936,"about_ca_system_score_codex":0.000068997564,"about_ca_system_score_gemma":0.00004135561,"threshold_uncertainty_score":0.80145985},"labels":[],"label_agreement":null},{"id":"W4413184960","doi":"10.55016/ojs/cdm.v6i1.62078","title":"Dual linear spaces generated by a non-Desarguesian configuration","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Dual (grammatical number); Combinatorics; Art","score_opus":0.012466961325010253,"score_gpt":0.26383733401366455,"score_spread":0.2513703726886543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413184960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012853012,0.000078112425,0.98153555,0.00013833554,0.00004504418,0.00036986676,0.0002613203,0.0006857458,0.0040330007],"genre_scores_gemma":[0.89335674,0.000030450958,0.105798684,0.000057275087,0.00006871792,0.00013906958,0.00019364564,0.000045058518,0.0003103641],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989692,0.000017399878,0.0003745884,0.00017609712,0.00015338375,0.00030935157],"domain_scores_gemma":[0.99922067,0.00003741573,0.000060466107,0.00032268724,0.00018665033,0.00017213575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011527276,0.00021393532,0.0003092422,0.00009992438,0.00010713221,0.000039754963,0.00014944286,0.00010064188,0.00014723434],"category_scores_gemma":[0.00015544647,0.00019417574,0.0000824597,0.00044794608,0.000048384845,0.00015462021,0.00003324191,0.00013546273,0.00023109751],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044930523,0.0006694854,0.00009579171,0.00035807912,0.0009014185,0.000043190168,0.0068937605,0.005158063,0.8504618,0.0623153,0.06831646,0.004741752],"study_design_scores_gemma":[0.0004054635,0.00015536249,0.0000535085,0.000110629895,0.00018155306,0.00001035776,0.0003356847,0.30728552,0.67128706,0.009880648,0.009523892,0.0007703281],"about_ca_topic_score_codex":0.000011636684,"about_ca_topic_score_gemma":0.000006033879,"teacher_disagreement_score":0.8805037,"about_ca_system_score_codex":0.00010596374,"about_ca_system_score_gemma":0.0000127512185,"threshold_uncertainty_score":0.79182565},"labels":[],"label_agreement":null},{"id":"W4413184961","doi":"10.55016/ojs/cdm.v6i1.62018","title":"Coefficients of chromatic polynomials and tension polynomials","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Color Science and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Mathematics; Chromatic scale; Combinatorics; Orthogonal polynomials; Difference polynomials","score_opus":0.01823574874700167,"score_gpt":0.2860671981192674,"score_spread":0.2678314493722657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413184961","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79677486,0.000028335402,0.19583604,0.00027764766,0.00004863665,0.00066918484,0.00046790508,0.00002904659,0.0058683157],"genre_scores_gemma":[0.99387825,0.0000011402543,0.0058151516,0.000026363656,0.00003489474,0.00006264277,0.000015089784,0.000007793385,0.00015869549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991332,0.000017265134,0.00035803168,0.000165984,0.00011592292,0.00020959569],"domain_scores_gemma":[0.99917537,0.000088254594,0.00015087551,0.00031828045,0.0001348875,0.00013231074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002233595,0.00011327676,0.00025497135,0.000077226025,0.00016760192,0.000025829131,0.00017454066,0.000027625643,0.00021990418],"category_scores_gemma":[0.00006690796,0.00009511944,0.00006264107,0.00026463726,0.000113648115,0.000074627394,0.00011373915,0.000045217104,0.00007165016],"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.000023901026,0.0012595009,0.006471517,0.00010002899,0.00015567205,9.4951525e-7,0.009151355,0.00004152896,0.14263672,0.8283993,0.0032032975,0.0085562505],"study_design_scores_gemma":[0.005185092,0.0011268815,0.06161693,0.0011971775,0.001209095,0.00002340176,0.014961768,0.033308037,0.56554973,0.304932,0.008169504,0.002720391],"about_ca_topic_score_codex":0.00006150731,"about_ca_topic_score_gemma":0.0000020625996,"teacher_disagreement_score":0.5234673,"about_ca_system_score_codex":0.000016730342,"about_ca_system_score_gemma":0.00004731413,"threshold_uncertainty_score":0.3878858},"labels":[],"label_agreement":null},{"id":"W4413184967","doi":"10.55016/ojs/cdm.v6i1.62094","title":"Partially critical tournaments and partially critical supports","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.09823530041768298,"score_gpt":0.4256145755361205,"score_spread":0.3273792751184375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413184967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07709827,0.00008706344,0.89100665,0.012480418,0.00033744448,0.0007229789,0.0007006224,0.00015358817,0.017412947],"genre_scores_gemma":[0.98058945,0.00000421187,0.018036883,0.0004304274,0.00009363408,0.00013070718,0.0000072794387,0.000016718532,0.0006907162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970505,0.00019280484,0.00097433495,0.0004889569,0.0007272419,0.0005661299],"domain_scores_gemma":[0.99517214,0.0024070423,0.00011169878,0.00087168685,0.0007494407,0.00068798516],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002396105,0.00021736744,0.00041686257,0.00014355924,0.0005192516,0.00035549,0.0005853149,0.00011496757,0.0019446053],"category_scores_gemma":[0.02256269,0.00016971974,0.00012703126,0.00044380344,0.0005310103,0.0003270935,0.00031206536,0.00018579798,0.001219732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020374988,0.0002696596,0.00038672957,0.000010006158,0.000016731039,0.00001839104,0.0017174073,0.0000031529478,0.000560348,0.9919776,0.0040027453,0.0010168529],"study_design_scores_gemma":[0.00025367326,0.00014947401,0.0022856211,0.000051705556,0.00010749974,0.000067390254,0.0011189107,0.0014034897,0.0025606945,0.9813394,0.0103592295,0.00030290647],"about_ca_topic_score_codex":0.000004310001,"about_ca_topic_score_gemma":0.000018119654,"teacher_disagreement_score":0.90349114,"about_ca_system_score_codex":0.000037243524,"about_ca_system_score_gemma":0.00009739487,"threshold_uncertainty_score":0.9995579},"labels":[],"label_agreement":null},{"id":"W4413184999","doi":"10.55016/ojs/cdm.v6i1.61918","title":"On a generalization of the Blaschke-Lebesgue theorem for disk-polygons","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Generalization; Blaschke product; Combinatorics; Lebesgue integration; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.05375632978043507,"score_gpt":0.32758599799074123,"score_spread":0.2738296682103062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413184999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08349077,0.0000569561,0.9048589,0.00066462863,0.00024775026,0.0016429735,0.0017217873,0.00009539705,0.0072208378],"genre_scores_gemma":[0.9710719,0.000007650723,0.026758054,0.00016513435,0.00007858567,0.0002843099,0.000025809548,0.000041189156,0.0015673728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846834,0.00006135513,0.0006264587,0.00020183105,0.00029231224,0.00034970412],"domain_scores_gemma":[0.99733406,0.0010044088,0.00033925654,0.00069645,0.0005333571,0.00009248652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065603247,0.00021537102,0.00038346168,0.00016678679,0.00026619842,0.000031828222,0.00044709566,0.00010207833,0.00011188829],"category_scores_gemma":[0.007421554,0.00013817645,0.0002569722,0.00068167516,0.00010738797,0.00008165204,0.00012418766,0.00009764408,0.000017388435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027714199,0.00022166582,0.000015733984,0.00023927263,0.000061485975,1.7094214e-7,0.002601458,0.000015673306,0.000196042,0.99407434,0.0024554771,0.00009097017],"study_design_scores_gemma":[0.00048667425,0.00018411204,0.000051764855,0.00021947591,0.00016644235,0.0000035437422,0.0006947845,0.0014663037,0.023401586,0.97235805,0.00075634033,0.00021092796],"about_ca_topic_score_codex":0.000012315663,"about_ca_topic_score_gemma":0.00002014615,"teacher_disagreement_score":0.8875811,"about_ca_system_score_codex":0.000069230344,"about_ca_system_score_gemma":0.000080744896,"threshold_uncertainty_score":0.8884829},"labels":[],"label_agreement":null},{"id":"W4413185004","doi":"10.55016/ojs/cdm.v6i1.62057","title":"Cones of partial metrics","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Differential Geometry Research","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.03872418803701318,"score_gpt":0.33649020499380505,"score_spread":0.2977660169567919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413185004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0886223,0.000027408754,0.89708984,0.000046248773,0.00007481603,0.00036504524,0.0007010308,0.000027820495,0.013045486],"genre_scores_gemma":[0.98688453,9.759843e-7,0.01253802,0.0000052316454,0.00006838452,0.00004903102,0.000035397214,0.000013523413,0.0004049099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989585,0.00002746064,0.00034236687,0.00014624932,0.0002209737,0.00030439885],"domain_scores_gemma":[0.99889195,0.00013876284,0.00011545119,0.0003540896,0.00033846573,0.00016127304],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017372849,0.00012263733,0.00027852712,0.00016948242,0.00008614517,0.00001691714,0.00023567295,0.000031003685,0.001452453],"category_scores_gemma":[0.0002353591,0.0001064136,0.00011180317,0.00065628975,0.00008370144,0.00007866555,0.0001454627,0.00010003805,0.00015887625],"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.000022831626,0.00044813112,0.0059937644,0.000038771468,0.00015025148,9.909483e-7,0.00088518125,0.000019523497,0.0027288066,0.98679525,0.00030495808,0.002611537],"study_design_scores_gemma":[0.002390406,0.00050229335,0.00449554,0.000170998,0.0003718977,0.0000025481688,0.003325619,0.0057594203,0.5409833,0.4354818,0.005538636,0.0009775654],"about_ca_topic_score_codex":0.000029722421,"about_ca_topic_score_gemma":6.2197904e-7,"teacher_disagreement_score":0.8982622,"about_ca_system_score_codex":0.000020567444,"about_ca_system_score_gemma":0.00004208221,"threshold_uncertainty_score":0.99946034},"labels":[],"label_agreement":null},{"id":"W4413185026","doi":"10.55016/ojs/cdm.v6i1.61977","title":"Option-closed games","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Mathematical economics","score_opus":0.10561705731949414,"score_gpt":0.39778226734596206,"score_spread":0.2921652100264679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413185026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02773614,0.000026984346,0.94117314,0.0015866983,0.00016925442,0.00049867394,0.00031955278,0.00015129882,0.028338287],"genre_scores_gemma":[0.9729066,0.0000031462937,0.020622553,0.00022469749,0.00008778063,0.00016394249,0.000013010637,0.0000131029765,0.005965185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803245,0.00009666056,0.00070393435,0.00034708506,0.0005368973,0.00028297337],"domain_scores_gemma":[0.9972708,0.00060024456,0.00022332238,0.0010063122,0.00064364244,0.00025565134],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0015414477,0.00015237897,0.00027322612,0.00021085443,0.00042241384,0.00014534361,0.000741183,0.00007820422,0.0019077694],"category_scores_gemma":[0.0043034917,0.00011472725,0.0001581515,0.00097033195,0.0001483939,0.00023147263,0.0001470015,0.00011324307,0.007376286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008141964,0.00011202875,0.00006618324,0.0000020065606,0.000014962746,9.211465e-7,0.0013741172,0.000025105364,0.0006605482,0.99159425,0.004203364,0.001938358],"study_design_scores_gemma":[0.00020116431,0.000040588067,0.0013833884,0.000014659776,0.000029455727,0.000012291046,0.0015627271,0.0013398761,0.004297236,0.9596339,0.031290174,0.00019452427],"about_ca_topic_score_codex":0.0000040918753,"about_ca_topic_score_gemma":0.0000044846315,"teacher_disagreement_score":0.94517046,"about_ca_system_score_codex":0.000051866704,"about_ca_system_score_gemma":0.00005484781,"threshold_uncertainty_score":0.9990046},"labels":[],"label_agreement":null},{"id":"W4413185127","doi":"10.55016/ojs/cdm.v6i1.62011","title":"Adjusting a conjecture of Erdős","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Conjecture; Mathematics; Combinatorics","score_opus":0.07596645509067344,"score_gpt":0.3709482334577344,"score_spread":0.29498177836706096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413185127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15622433,0.000095237614,0.7725172,0.00049394,0.00012599533,0.0015787954,0.00061215024,0.00028229473,0.06807006],"genre_scores_gemma":[0.9115396,0.0000031601712,0.086683035,0.000034223034,0.00006124573,0.000060894567,0.0000095471505,0.00004635294,0.0015619353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799275,0.000103577746,0.000712996,0.0002513549,0.00042361926,0.0005156792],"domain_scores_gemma":[0.99727255,0.0008666002,0.0002605124,0.0008160456,0.0005317913,0.00025247323],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011164828,0.0002313901,0.0005659922,0.00018561544,0.00014747547,0.000022612187,0.0005073931,0.00012945096,0.00095594925],"category_scores_gemma":[0.00579992,0.00019244701,0.0001955772,0.0005512822,0.00018596216,0.00008738796,0.00025836704,0.00024376673,0.00018521663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025219864,0.00023098351,0.00015259464,0.0002706351,0.00014122667,0.00001119845,0.0049421126,0.0000024133265,0.00096488954,0.99103045,0.0020042108,0.0002240538],"study_design_scores_gemma":[0.00063560775,0.00015627716,0.00011514057,0.00032277798,0.0002537408,0.000042917018,0.002205063,0.0014148987,0.014913352,0.97917074,0.00043918195,0.00033031747],"about_ca_topic_score_codex":0.000019003168,"about_ca_topic_score_gemma":0.000015129836,"teacher_disagreement_score":0.7553153,"about_ca_system_score_codex":0.00010439057,"about_ca_system_score_gemma":0.00011686033,"threshold_uncertainty_score":0.9999573},"labels":[],"label_agreement":null},{"id":"W4413186058","doi":"10.55016/ojs/cdm.v6i2.62097","title":"Cards, permutations, and sums","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Winnipeg","keywords":"Combinatorics; Mathematics","score_opus":0.011680211440807824,"score_gpt":0.23045438583522634,"score_spread":0.2187741743944185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186058","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5155162,0.001304814,0.4383809,0.00011662613,0.0004812339,0.000942368,0.00077481044,0.0008280728,0.041654944],"genre_scores_gemma":[0.9975963,0.000016711338,0.0020755557,0.000015769878,0.000030424006,0.000073748226,0.0000150688,0.00001916172,0.00015725332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994047,0.000018414547,0.00020994378,0.00009554263,0.00007695951,0.00019440775],"domain_scores_gemma":[0.99952006,0.0000457501,0.000019130712,0.00022254352,0.00006461078,0.00012790007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017128159,0.00011813918,0.00016809948,0.00007650793,0.00010939682,0.000031526204,0.000090418085,0.00005332624,0.00006279426],"category_scores_gemma":[0.000090034635,0.00010865175,0.00004524098,0.00015676221,0.00003942864,0.00007631615,0.000023909024,0.00006945286,0.00011989648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044120575,0.000039362312,0.00032704463,0.00019152646,0.00012366273,0.0000072015373,0.009391186,0.00017736595,0.002117591,0.98465157,0.00245874,0.0005103643],"study_design_scores_gemma":[0.0027960967,0.00036736394,0.014893876,0.0009522134,0.00084146945,0.00040049845,0.019330831,0.072813354,0.034705356,0.8062781,0.043346893,0.003273938],"about_ca_topic_score_codex":0.000004874278,"about_ca_topic_score_gemma":0.000006066383,"teacher_disagreement_score":0.48208007,"about_ca_system_score_codex":0.000027361022,"about_ca_system_score_gemma":0.000007444594,"threshold_uncertainty_score":0.443069},"labels":[],"label_agreement":null},{"id":"W4413186062","doi":"10.55016/ojs/cdm.v6i2.62104","title":"Strong d-collapsibility","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.025946684510748677,"score_gpt":0.29574599632323806,"score_spread":0.2697993118124894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054775223,0.000008365644,0.91003597,0.00019059719,0.000074308584,0.00058334466,0.0008226709,0.000071196584,0.03343834],"genre_scores_gemma":[0.99063325,3.0694338e-7,0.008665573,0.000026663905,0.000083499224,0.00020872103,0.00004980126,0.000014655925,0.0003175425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909794,0.000016099142,0.0002891258,0.00020635255,0.00011124228,0.00027921548],"domain_scores_gemma":[0.9990121,0.000040856125,0.00008137325,0.0005212311,0.00016997708,0.00017447288],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002010726,0.00013518019,0.00018384497,0.00004174698,0.00021444436,0.000036964484,0.00022721042,0.000029673929,0.0011865206],"category_scores_gemma":[0.000033769084,0.000121792735,0.00010466932,0.00023454479,0.00002985783,0.0000653656,0.00009273846,0.00009277095,0.0005085804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017670144,0.00016060701,0.0002671683,0.0000043477003,0.000025850733,1.585147e-7,0.00034490952,0.0000015043714,0.00033882356,0.9979585,0.00057123904,0.00032511758],"study_design_scores_gemma":[0.00028807766,0.000045206718,0.00058576645,0.000024312461,0.000067482295,6.986401e-7,0.0007775399,0.0040714275,0.0055595376,0.9833474,0.0049645384,0.00026798726],"about_ca_topic_score_codex":0.000041567997,"about_ca_topic_score_gemma":0.0000037262153,"teacher_disagreement_score":0.935858,"about_ca_system_score_codex":0.000030468545,"about_ca_system_score_gemma":0.00004980182,"threshold_uncertainty_score":0.99972653},"labels":[],"label_agreement":null},{"id":"W4413186082","doi":"10.55016/ojs/cdm.v5i2.61945","title":"Polytopes derived from sporadic simple groups","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"BIM and Construction Integration","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simple (philosophy); Combinatorics; Mathematics; Polytope","score_opus":0.006054601706075786,"score_gpt":0.23153755397967007,"score_spread":0.2254829522735943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186082","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6538861,0.00006429182,0.3414019,0.00030435232,0.00059801573,0.00023359155,0.00066078524,0.00042571482,0.002425272],"genre_scores_gemma":[0.9891693,0.0000064229994,0.0102307545,0.000051499486,0.00023519761,0.00005590449,0.00016640392,0.000024665665,0.000059835296],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992311,0.000008389581,0.00028097292,0.00013244712,0.00012344288,0.00022366992],"domain_scores_gemma":[0.9992984,0.00007337365,0.00003509695,0.00033857566,0.000105079824,0.00014945581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000076494245,0.00015636122,0.00019220015,0.000078194316,0.00013206161,0.00009127814,0.00015940217,0.00011628114,0.00057889865],"category_scores_gemma":[0.00015365527,0.00014455472,0.00007362117,0.0001923693,0.000051079773,0.00012763604,0.000026029395,0.00023052457,0.000339398],"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.000010105181,0.0000744811,0.0006465903,0.000051250863,0.00017931948,0.0000063256366,0.0016837692,0.0006013101,0.50968874,0.4636499,0.007960227,0.015447978],"study_design_scores_gemma":[0.0022441905,0.00011391362,0.015322697,0.0001825838,0.0004009745,0.00009984616,0.0026829536,0.20030676,0.28322485,0.38579583,0.10746275,0.0021626502],"about_ca_topic_score_codex":0.00002351155,"about_ca_topic_score_gemma":0.00015479342,"teacher_disagreement_score":0.33528325,"about_ca_system_score_codex":0.000045780864,"about_ca_system_score_gemma":0.000021255179,"threshold_uncertainty_score":0.63385344},"labels":[],"label_agreement":null},{"id":"W4413186099","doi":"10.55016/ojs/cdm.v5i2.62020","title":"Freiman's theorem for solvable groups","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"John D. and Catherine T. MacArthur Foundation; National Science Foundation","keywords":"Mathematics; Combinatorics; Solvable group; Discrete mathematics; Abelian group","score_opus":0.01734946785670586,"score_gpt":0.32039881222157457,"score_spread":0.3030493443648687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24080642,0.0000495539,0.7344366,0.0017776138,0.0015395683,0.00277802,0.0016620009,0.0004980368,0.016452223],"genre_scores_gemma":[0.8143865,0.0000032313064,0.18315284,0.00022945387,0.000488675,0.000378528,0.00004521588,0.000076899276,0.0012386963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813336,0.000038598435,0.0005697663,0.00034749194,0.00027655647,0.0006342442],"domain_scores_gemma":[0.99657476,0.0014851083,0.00019077379,0.0010452449,0.00044084826,0.0002632627],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010903837,0.0003205163,0.0004979595,0.00014675844,0.00085133035,0.000119294265,0.00060040393,0.00022811748,0.0002779662],"category_scores_gemma":[0.004802129,0.0002493257,0.00030879505,0.00025580882,0.00019154276,0.00013165033,0.00023978742,0.00036433194,0.000046375728],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002032175,0.00009401806,0.000019669153,0.000105573774,0.00007058447,0.0000013447512,0.001043442,0.0000027418098,0.002652935,0.9875927,0.008139471,0.00025722862],"study_design_scores_gemma":[0.0006346955,0.000079393176,0.000028148217,0.000044227945,0.00014092798,0.000021134738,0.0002910394,0.0012725923,0.0046831267,0.9754389,0.017008964,0.00035685723],"about_ca_topic_score_codex":0.0000021900637,"about_ca_topic_score_gemma":0.000027364638,"teacher_disagreement_score":0.57358,"about_ca_system_score_codex":0.000047861035,"about_ca_system_score_gemma":0.00005391694,"threshold_uncertainty_score":0.9999959},"labels":[],"label_agreement":null},{"id":"W4413186102","doi":"10.55016/ojs/cdm.v5i2.62068","title":"Least-squares approximation by a tree distance","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Statistical and numerical algorithms","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Tree (set theory)","score_opus":0.01513562904331142,"score_gpt":0.31808903524545673,"score_spread":0.30295340620214534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009408254,0.000034107667,0.9804558,0.0024619144,0.00020934717,0.0007146009,0.0018888094,0.00026746508,0.0045596613],"genre_scores_gemma":[0.543655,0.0000052635064,0.45148206,0.00022532625,0.00028041168,0.00044415006,0.0002231799,0.000078693134,0.0036059457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804866,0.00004426361,0.00060612126,0.00034632042,0.000439029,0.00051559665],"domain_scores_gemma":[0.99755967,0.0010138078,0.00016962568,0.00058699254,0.00029830632,0.00037159142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003588133,0.0002909123,0.0004598778,0.000069367874,0.00027889968,0.00012655286,0.00035681514,0.00014386128,0.00045265094],"category_scores_gemma":[0.0050595286,0.0002334339,0.00013524223,0.00042777826,0.00016153941,0.00013500833,0.00010208249,0.00036790202,0.0004086934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017077,0.0004156469,0.000017891996,0.00011369292,0.000039638584,0.000003624323,0.00041706784,9.2484174e-7,0.0067665293,0.9464486,0.038863022,0.006896279],"study_design_scores_gemma":[0.00076949084,0.00014350897,0.00011220677,0.00008636593,0.00013034126,0.000021839867,0.00024731713,0.019770993,0.005712844,0.93756396,0.034830116,0.0006110262],"about_ca_topic_score_codex":0.000008893865,"about_ca_topic_score_gemma":0.000033731565,"teacher_disagreement_score":0.53424674,"about_ca_system_score_codex":0.00006867346,"about_ca_system_score_gemma":0.000037742677,"threshold_uncertainty_score":0.9519158},"labels":[],"label_agreement":null},{"id":"W4413186111","doi":"10.55016/ojs/cdm.v5i2.62764","title":"Generalized CPR-graphs and applications","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.012707080345668788,"score_gpt":0.31933515415495034,"score_spread":0.30662807380928153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186111","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0144081125,0.00006989601,0.9810404,0.0018501887,0.00007065054,0.0007757899,0.00009803573,0.00024339503,0.0014435049],"genre_scores_gemma":[0.45826522,0.000029474593,0.5396684,0.0002832446,0.00007845761,0.00090007746,0.000021236805,0.000025410389,0.0007284883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876505,0.0000372335,0.0002625408,0.00032989105,0.00023279079,0.00037248066],"domain_scores_gemma":[0.9980731,0.00025547613,0.00006704588,0.0010151212,0.00028225966,0.000306967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004725461,0.00014667005,0.00019640556,0.000192015,0.00038212855,0.00021908071,0.0007839105,0.00007137931,0.000024292112],"category_scores_gemma":[0.0004065181,0.00012893118,0.00006475675,0.0007564534,0.00016177556,0.0002471961,0.00040868123,0.0002516743,0.00012105305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013218806,0.000036509948,0.00002795739,0.000010504067,0.000011236116,0.0000010523123,0.00015226581,0.00000816116,0.011194914,0.9854153,0.00020129127,0.0029395195],"study_design_scores_gemma":[0.00033583064,0.00003036238,0.00015892701,0.000009926628,0.000011241952,0.000030366838,0.000032224496,0.009313054,0.0034346895,0.9644384,0.021984264,0.00022071622],"about_ca_topic_score_codex":0.0000023091536,"about_ca_topic_score_gemma":0.000012064325,"teacher_disagreement_score":0.4438571,"about_ca_system_score_codex":0.00002030921,"about_ca_system_score_gemma":0.000050245242,"threshold_uncertainty_score":0.5257661},"labels":[],"label_agreement":null},{"id":"W4413186118","doi":"10.55016/ojs/cdm.v5i2.62030","title":"On the Parity of p(n,3) and p_Ψ(n,3)","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Parity (physics); Combinatorics; Physics","score_opus":0.02669140672475212,"score_gpt":0.34633851742805116,"score_spread":0.31964711070329904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186118","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7554661,0.000037466354,0.20423695,0.0070701055,0.00021308952,0.0019731051,0.0006128207,0.00023593499,0.030154413],"genre_scores_gemma":[0.95598495,0.0000065054146,0.042480372,0.00011380763,0.000047368136,0.00011873812,0.000004131563,0.000035186295,0.0012089651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985123,0.00004769812,0.0005575497,0.00021050582,0.0003520363,0.00031986975],"domain_scores_gemma":[0.99445814,0.0040328666,0.00021783664,0.0008484368,0.00028404425,0.00015869665],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0008101527,0.00022074275,0.00043067575,0.00008889184,0.00024149643,0.00006447066,0.0003422424,0.00010549361,0.00023340088],"category_scores_gemma":[0.0149628315,0.00014255807,0.000106878004,0.00023642251,0.00036002503,0.00009442298,0.00020726422,0.00037665493,0.000066789],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060607535,0.00014236254,0.00000897225,0.00012124937,0.000030825166,0.0000010347987,0.00051039003,0.0000017652998,0.00270058,0.9943517,0.0020697275,0.000055318153],"study_design_scores_gemma":[0.00021790779,0.00006151552,0.000047259404,0.00011730148,0.0000723363,0.000012373378,0.00035589465,0.0007498125,0.0070034456,0.9904664,0.00072738907,0.00016836522],"about_ca_topic_score_codex":0.0000037244201,"about_ca_topic_score_gemma":0.000031387644,"teacher_disagreement_score":0.20051882,"about_ca_system_score_codex":0.000027353739,"about_ca_system_score_gemma":0.00003851892,"threshold_uncertainty_score":0.99333453},"labels":[],"label_agreement":null},{"id":"W4413186147","doi":"10.55016/ojs/cdm.v6i2.62106","title":"Computation of atomic fibers of Z-linear maps","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computation; Mathematics; Combinatorics; Algorithm","score_opus":0.04980807729592444,"score_gpt":0.3482556195861984,"score_spread":0.2984475422902739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2129464,0.000036381243,0.7816804,0.00008255211,0.000108708125,0.0006058967,0.0004163421,0.000079140016,0.0040441486],"genre_scores_gemma":[0.6231417,0.000003519521,0.37663734,0.0000123009995,0.000022766328,0.000020749623,0.000017420814,0.0000247692,0.00011944213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983914,0.00004622399,0.00085465907,0.00018291143,0.00027440806,0.00025041646],"domain_scores_gemma":[0.9979997,0.00039203893,0.0004890001,0.00052233785,0.0004925006,0.00010441084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003773918,0.00018182788,0.0005088643,0.00015422545,0.000073400784,0.000004935326,0.00028377812,0.00010123844,0.00007797585],"category_scores_gemma":[0.0015893321,0.00017051132,0.00014989235,0.00033980003,0.00015161811,0.00009153288,0.0001309251,0.000120402365,0.00003725583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018206749,0.00021145369,0.00006208307,0.00031893566,0.00007701029,0.0000015301922,0.0031577537,0.000025326128,0.0012402191,0.99427897,0.00041960526,0.0001889339],"study_design_scores_gemma":[0.00048116423,0.000098673736,0.00008364768,0.00023210976,0.00011153542,0.0000064095666,0.00052406965,0.0014914708,0.039883807,0.9568103,0.00009928391,0.00017752289],"about_ca_topic_score_codex":0.000006538381,"about_ca_topic_score_gemma":0.0000048751044,"teacher_disagreement_score":0.4101953,"about_ca_system_score_codex":0.000082596394,"about_ca_system_score_gemma":0.000059550333,"threshold_uncertainty_score":0.69532496},"labels":[],"label_agreement":null},{"id":"W4413186177","doi":"10.55016/ojs/cdm.v5i2.62061","title":"Bounds and constructions for n-e.c. tournaments","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland; Mitacs","keywords":"Combinatorics; Mathematics","score_opus":0.013908649085259137,"score_gpt":0.33539140497317166,"score_spread":0.32148275588791253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186177","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016542407,0.000012282621,0.9797177,0.0014562296,0.00058470434,0.0005444699,0.00013222719,0.00011133486,0.00089867564],"genre_scores_gemma":[0.13570014,0.000002464652,0.86382145,0.000090548114,0.00006242568,0.00015571217,0.0000068046425,0.0000071323234,0.00015331325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914247,0.000019082767,0.0002667889,0.00020697457,0.00012700832,0.00023765379],"domain_scores_gemma":[0.99877346,0.00016719506,0.0000971702,0.00052923145,0.00027195303,0.00016099916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005137231,0.000107062966,0.0001491823,0.0000967024,0.00038135832,0.00026230974,0.00038799486,0.00006999442,0.000009117151],"category_scores_gemma":[0.0013619403,0.00009914117,0.00004788697,0.00023200904,0.00009866905,0.00031572854,0.0001440524,0.000132497,0.000023496394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012876158,0.000023730461,0.00002525916,0.000013745522,0.000010733883,1.6950935e-7,0.00031363135,0.0000028527718,0.005160377,0.98999685,0.0004294263,0.004021938],"study_design_scores_gemma":[0.0012952616,0.00023363503,0.0012354335,0.00006896413,0.00008011982,0.00023780085,0.0003054329,0.26581258,0.020579133,0.6305799,0.07891443,0.0006572957],"about_ca_topic_score_codex":0.0000016333826,"about_ca_topic_score_gemma":0.0000047907774,"teacher_disagreement_score":0.35941693,"about_ca_system_score_codex":0.000037050762,"about_ca_system_score_gemma":0.000055781755,"threshold_uncertainty_score":0.40428597},"labels":[],"label_agreement":null},{"id":"W4413186186","doi":"10.55016/ojs/cdm.v5i2.62064","title":"Homotopy types of independence complexes of forests","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Homotopy; Independence (probability theory); Combinatorics; Pure mathematics; Statistics","score_opus":0.012441116789803074,"score_gpt":0.29295498788831076,"score_spread":0.28051387109850767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12079062,0.000036598703,0.87722665,0.000615814,0.00007503858,0.00015243737,0.00036012835,0.00003702867,0.00070569105],"genre_scores_gemma":[0.92476964,0.0000032523262,0.07507536,0.000020437836,0.000015110652,0.000009076606,0.0000121447865,0.0000025677648,0.00009243233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893796,0.000020133999,0.00038203754,0.00017489176,0.00029753626,0.00018743212],"domain_scores_gemma":[0.9983222,0.00029147294,0.00018259358,0.0007088974,0.00039080356,0.00010406788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036306836,0.00009582795,0.00031826162,0.00021027414,0.00006701285,0.00003462116,0.0009933432,0.000072700685,0.00009044369],"category_scores_gemma":[0.0014691055,0.000070605005,0.00010524199,0.0011669373,0.00013023238,0.0001513417,0.00038250085,0.00012848087,0.000038979535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017705999,0.0001336473,0.0010829634,0.000025914536,0.000036642654,0.0000013982833,0.00017154623,0.000050676947,0.007698621,0.988945,0.00026241524,0.0015894052],"study_design_scores_gemma":[0.00097328826,0.0005797989,0.049925093,0.00013676894,0.00022484749,0.000040824187,0.00018871948,0.06252301,0.1391879,0.73955655,0.0059072846,0.0007558889],"about_ca_topic_score_codex":0.000035955793,"about_ca_topic_score_gemma":0.000084635845,"teacher_disagreement_score":0.803979,"about_ca_system_score_codex":0.00000851123,"about_ca_system_score_gemma":0.00004170892,"threshold_uncertainty_score":0.28791887},"labels":[],"label_agreement":null},{"id":"W4413186187","doi":"10.55016/ojs/cdm.v6i2.62092","title":"A bijection between noncrossing and nonnesting partitions of types A, B and C","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Centro de Matemática, Universidade de Coimbra; Universidade de Coimbra; Universität Wien","keywords":"Bijection; Combinatorics; Mathematics; Type (biology); Biology; Paleontology","score_opus":0.05411428008197684,"score_gpt":0.3264523449599007,"score_spread":0.2723380648779239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9196068,0.000071249284,0.07879678,0.00008731136,0.00007256362,0.0003012751,0.00008208351,0.00005610315,0.00092581275],"genre_scores_gemma":[0.9733752,0.000004678822,0.026474055,0.000007999609,0.000064612395,0.000021294114,0.000003751195,0.000015247683,0.000033170472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991636,0.000026603157,0.00035345415,0.00015527348,0.00011470695,0.00018632632],"domain_scores_gemma":[0.99904823,0.0003199755,0.00015202224,0.00020457686,0.00016383598,0.000111357265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023939903,0.00012943632,0.00029696993,0.00007683801,0.00024059793,0.00003882908,0.00007282217,0.00007902983,0.000019765856],"category_scores_gemma":[0.00089926145,0.00011248151,0.000041454135,0.00017589035,0.00011993548,0.00009299384,0.00009879419,0.000084985426,0.0000022699433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074165227,0.000039244987,0.0017931989,0.00015147145,0.00006347812,8.139733e-7,0.005086629,0.0000014568753,0.0003698942,0.9919151,0.000045531342,0.0005257859],"study_design_scores_gemma":[0.00029463109,0.00008644893,0.0024998575,0.0001612751,0.00017065275,0.000011966519,0.0004832432,0.0003519418,0.002289004,0.99347013,0.000032420605,0.00014840394],"about_ca_topic_score_codex":0.000029364455,"about_ca_topic_score_gemma":0.000008104233,"teacher_disagreement_score":0.05376837,"about_ca_system_score_codex":0.000023250763,"about_ca_system_score_gemma":0.000026027628,"threshold_uncertainty_score":0.4586863},"labels":[],"label_agreement":null},{"id":"W4413186190","doi":"10.55016/ojs/cdm.v5i2.61990","title":"Signed b-matchings and b-edge covers of strong product graphs","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Product (mathematics); Discrete mathematics; Computer science; Geometry; Telecommunications","score_opus":0.01596193014654573,"score_gpt":0.290743395297669,"score_spread":0.2747814651511233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186190","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9438597,0.00007384065,0.050896764,0.000869323,0.00025038715,0.0010255255,0.00040724812,0.00015347007,0.0024637375],"genre_scores_gemma":[0.96335685,0.0000089246205,0.036039896,0.000039717048,0.00009365853,0.00005330773,0.000020828902,0.00004381673,0.00034299318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998199,0.000039263217,0.00064986874,0.0003517499,0.00033003,0.0004301301],"domain_scores_gemma":[0.9978544,0.0005293617,0.00030667626,0.000742674,0.00033267523,0.00023417703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007282149,0.00028938876,0.0005792469,0.00018128598,0.00023274808,0.00008415753,0.00031438423,0.0001112019,0.00007472086],"category_scores_gemma":[0.0030192875,0.0002516882,0.00015182258,0.0003013567,0.00024388757,0.00019854694,0.00016900044,0.0003080114,0.000025301875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013179694,0.0001901565,0.00023596434,0.00027609788,0.000086848195,0.0000021757683,0.001894476,0.000002802239,0.0362078,0.9588687,0.0018838149,0.00033801197],"study_design_scores_gemma":[0.0011033356,0.00014057937,0.0005783944,0.00025143367,0.00028320565,0.00003864317,0.00092797144,0.0006623733,0.04355229,0.95014715,0.001730522,0.0005840761],"about_ca_topic_score_codex":0.000016590293,"about_ca_topic_score_gemma":0.000040656338,"teacher_disagreement_score":0.019497152,"about_ca_system_score_codex":0.00003356091,"about_ca_system_score_gemma":0.000074299,"threshold_uncertainty_score":0.99999356},"labels":[],"label_agreement":null},{"id":"W4413186192","doi":"10.55016/ojs/cdm.v6i2.62095","title":"A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tournament; Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.014953510623808203,"score_gpt":0.2223248306890903,"score_spread":0.2073713200652821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186192","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8101489,0.00018531023,0.1848849,0.000050538227,0.00007083582,0.00089476764,0.0006017661,0.00011471583,0.003048244],"genre_scores_gemma":[0.9988385,0.0000022787901,0.0010071126,0.0000045258907,0.0000068574213,0.00007458978,0.0000074683985,0.00002213972,0.00003654191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989486,0.00007489202,0.00041872094,0.00011213153,0.00020407684,0.00024160116],"domain_scores_gemma":[0.99915254,0.000063798434,0.00014614691,0.00041323458,0.00013720353,0.00008706715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025329585,0.0001730678,0.0003544174,0.000058281035,0.00011949624,0.000009109027,0.00027471076,0.000045002784,0.000051946958],"category_scores_gemma":[0.00004828561,0.00011121056,0.00011526304,0.00033330094,0.00058686687,0.000037536796,0.0000808733,0.00010123163,0.0000032780222],"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.00017166558,0.0004752973,0.00146296,0.0010806568,0.00063298503,0.0000035428168,0.011197612,0.0044375286,0.022210171,0.95754176,0.00058969256,0.00019614628],"study_design_scores_gemma":[0.00262315,0.00041091253,0.0031897319,0.002357684,0.00058205397,0.00009295029,0.0038030017,0.039986804,0.73350835,0.21245226,0.00018038567,0.0008127262],"about_ca_topic_score_codex":0.00001836179,"about_ca_topic_score_gemma":0.00006710612,"teacher_disagreement_score":0.7450895,"about_ca_system_score_codex":0.00008159521,"about_ca_system_score_gemma":0.000015891534,"threshold_uncertainty_score":0.4535035},"labels":[],"label_agreement":null},{"id":"W4413186200","doi":"10.55016/ojs/cdm.v5i2.62045","title":"Some Ramsey theorems for finite n-colorable and n-chromatic graphs","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Université de Neuchâtel","keywords":"Mathematics; Combinatorics; Chromatic scale; Ramsey theory; Discrete mathematics","score_opus":0.01642191983257651,"score_gpt":0.329794284250865,"score_spread":0.3133723644182885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29329777,0.00022639595,0.6965909,0.0027192577,0.00071718334,0.0031319563,0.0011270074,0.00043730077,0.0017522587],"genre_scores_gemma":[0.8251389,0.00002112661,0.17205887,0.0003643973,0.0002227647,0.00065020745,0.00006103691,0.00007570866,0.0014069726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983266,0.000060848768,0.00055014464,0.0003352291,0.00015901805,0.0005681498],"domain_scores_gemma":[0.9950702,0.0035581538,0.00020681726,0.00067524466,0.00023799356,0.0002515622],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010505149,0.00030633318,0.00056360674,0.00016135133,0.0005682294,0.000073601026,0.0003060285,0.00025839757,0.00009373522],"category_scores_gemma":[0.0073286425,0.0002573219,0.0001562903,0.00021286591,0.00039058932,0.00022396423,0.00013064162,0.00035125233,0.000061940045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029939778,0.0001235578,0.0000134348065,0.0001892688,0.000061269144,0.000002452119,0.000796947,0.000008303299,0.0030789631,0.9947143,0.00079014164,0.00019141498],"study_design_scores_gemma":[0.00089756254,0.00012897045,0.000020268,0.000059465186,0.00016145568,0.000030302253,0.00039045312,0.0028176429,0.0026297003,0.9906189,0.0019161763,0.00032913274],"about_ca_topic_score_codex":0.0000013255283,"about_ca_topic_score_gemma":0.000019228115,"teacher_disagreement_score":0.53184116,"about_ca_system_score_codex":0.000033163,"about_ca_system_score_gemma":0.000056768127,"threshold_uncertainty_score":0.9999879},"labels":[],"label_agreement":null},{"id":"W4413186243","doi":"10.55016/ojs/cdm.v6i2.62059","title":"A variant of the bipartite relation theorem and its application to clique graphs","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Clique; Bipartite graph; Clique graph; Robertson–Seymour theorem; Discrete mathematics; Cograph; Relation (database); Chordal graph; Graph; 1-planar graph; Line graph; Computer science; Voltage graph","score_opus":0.02114390511315031,"score_gpt":0.29782461520389014,"score_spread":0.27668071009073986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03276019,0.000048459733,0.96392745,0.0010489009,0.00003955101,0.0010828967,0.00005447776,0.000056528792,0.0009815188],"genre_scores_gemma":[0.96324533,0.000006883196,0.036402274,0.00008428408,0.000007939406,0.00017206474,0.0000018120303,0.000008722862,0.00007071003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885505,0.00011220932,0.00032154453,0.0002451803,0.00022803183,0.00023796046],"domain_scores_gemma":[0.998423,0.0001849665,0.0001322587,0.0007889837,0.0003292358,0.00014157727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007881207,0.00011151331,0.00016240733,0.00014164422,0.00019464639,0.00003267722,0.0006909408,0.00005383387,0.000005926892],"category_scores_gemma":[0.00076637825,0.000078312834,0.00006065133,0.0010299871,0.00007190458,0.00020909931,0.00043257995,0.00011213343,0.000036212743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007448842,0.00003929496,0.00007363848,0.000016124206,0.00001141367,4.052872e-7,0.0021106873,0.000045621822,0.0052768616,0.99186945,0.00001614614,0.00053289515],"study_design_scores_gemma":[0.00017217941,0.000081778504,0.003338005,0.00007012484,0.000016475893,0.000011987286,0.00006549905,0.025046622,0.024073632,0.9467475,0.0002396431,0.00013657533],"about_ca_topic_score_codex":0.000003838861,"about_ca_topic_score_gemma":0.000006377179,"teacher_disagreement_score":0.9304851,"about_ca_system_score_codex":0.00003570018,"about_ca_system_score_gemma":0.000040984938,"threshold_uncertainty_score":0.31935045},"labels":[],"label_agreement":null},{"id":"W4413186321","doi":"10.55016/ojs/cdm.v7i2.62161","title":"Distinguishing homomorphisms of infinite graphs","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.01777632943254971,"score_gpt":0.27833875989420526,"score_spread":0.26056243046165556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07552438,0.000435928,0.9186965,0.00082953623,0.00045452855,0.0003377071,0.00011365256,0.00025326945,0.0033544982],"genre_scores_gemma":[0.8585204,0.0000044626854,0.14125085,0.00011172431,0.000010072222,0.000022719803,0.000009626661,0.000009160889,0.000060965216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985573,0.00004420478,0.00047760154,0.00017693116,0.00029503796,0.00044890062],"domain_scores_gemma":[0.99821115,0.00025305836,0.00019680915,0.00071228837,0.00035287833,0.00027383296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008090817,0.00015336317,0.00028131896,0.00019125818,0.00019473571,0.00008456132,0.00055574294,0.000062646934,0.000011765759],"category_scores_gemma":[0.0012177258,0.00013144125,0.00011865261,0.00081514654,0.00007789849,0.00030560835,0.00030355755,0.00011586874,0.00008380625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.5354367e-7,0.000106469925,0.0004589129,0.000028085207,0.000019034203,7.2652887e-7,0.0011877638,0.000050265346,0.0013367584,0.99594736,0.0005666909,0.00029707252],"study_design_scores_gemma":[0.0007669344,0.00014925591,0.001720899,0.00040567305,0.000094259536,0.000046409285,0.00023660921,0.018048827,0.013507997,0.96079886,0.003557001,0.0006672665],"about_ca_topic_score_codex":0.000009999111,"about_ca_topic_score_gemma":8.758995e-7,"teacher_disagreement_score":0.78299606,"about_ca_system_score_codex":0.000027282147,"about_ca_system_score_gemma":0.000035521614,"threshold_uncertainty_score":0.53600186},"labels":[],"label_agreement":null},{"id":"W4413186330","doi":"10.55016/ojs/cdm.v7i2.62152","title":"Algorithms for classifying regular polytopes with a fixed automorphism group","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fédération Wallonie-Bruxelles","keywords":"Mathematics; Combinatorics; Polytope; Automorphism group; Group (periodic table); Automorphism; Outer automorphism group; Discrete mathematics","score_opus":0.01561005595092591,"score_gpt":0.2570172356043343,"score_spread":0.2414071796534084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0381325,0.0005706693,0.957651,0.00016488193,0.0003465037,0.0010716702,0.00049031765,0.0005376092,0.0010348122],"genre_scores_gemma":[0.96660036,0.000004385885,0.032133568,0.000038316473,0.00024372226,0.00054589735,0.00007354984,0.00006125325,0.00029892687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987542,0.000028007791,0.00032498743,0.00013901069,0.00016186235,0.00059192185],"domain_scores_gemma":[0.99905276,0.00016560822,0.000056586425,0.00037793783,0.00009492239,0.0002521665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042707348,0.00023164717,0.00033617814,0.00010783301,0.00022068204,0.000068370646,0.00018011448,0.00010407364,0.000022584873],"category_scores_gemma":[0.000109708766,0.000188083,0.000111692665,0.0002734938,0.00005046745,0.00020517065,0.000028868755,0.000109936555,0.000057377867],"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.000044995035,0.00022665248,0.00037883094,0.0008597751,0.0005921472,0.0000050776694,0.0039686398,0.0014077905,0.018829081,0.96437824,0.007679092,0.0016296841],"study_design_scores_gemma":[0.011276169,0.0014225878,0.0039603715,0.003754855,0.00226323,0.000713152,0.01144479,0.40517166,0.06667065,0.08943914,0.3972838,0.00659959],"about_ca_topic_score_codex":0.000001643695,"about_ca_topic_score_gemma":0.0000032017092,"teacher_disagreement_score":0.92846787,"about_ca_system_score_codex":0.00010520402,"about_ca_system_score_gemma":0.000011792745,"threshold_uncertainty_score":0.76698023},"labels":[],"label_agreement":null},{"id":"W4413186338","doi":"10.55016/ojs/cdm.v7i2.62119","title":"A discrete Faà di Bruno's formula","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Functional Equations Stability Results","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia; Universidade do Minho","keywords":"Mathematics; Combinatorics; Mathematical economics","score_opus":0.038036867905148396,"score_gpt":0.3495598248174457,"score_spread":0.3115229569122973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10251845,0.0001950134,0.8719203,0.003850342,0.00064042263,0.0023627009,0.0017545825,0.00063683424,0.016121348],"genre_scores_gemma":[0.9492223,0.000005931783,0.04719782,0.00015635582,0.0004524345,0.00043662655,0.00017980936,0.000084195985,0.0022645257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966633,0.000120793105,0.0010188442,0.00038391878,0.00074265274,0.0010705275],"domain_scores_gemma":[0.9955263,0.0017248038,0.0002807444,0.0012377471,0.00060220825,0.0006281704],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013389996,0.00044072545,0.0006174962,0.00022902925,0.00053890987,0.00013471062,0.0004484398,0.00020225211,0.0003563529],"category_scores_gemma":[0.01078951,0.0003798142,0.0003316533,0.0007737657,0.00014265922,0.0005860336,0.00030758997,0.00031673242,0.0010595435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004225649,0.0006054799,0.0004963245,0.0001979786,0.00014097482,0.0000015523467,0.0025986403,0.000050965937,0.0008931427,0.9871644,0.0074921176,0.00031619336],"study_design_scores_gemma":[0.0030334995,0.00035364012,0.003620811,0.0004993611,0.0008256833,0.00013949643,0.0024942087,0.010723735,0.005076475,0.9169762,0.05417704,0.0020798286],"about_ca_topic_score_codex":0.000017036538,"about_ca_topic_score_gemma":0.0000324639,"teacher_disagreement_score":0.8467038,"about_ca_system_score_codex":0.0005101998,"about_ca_system_score_gemma":0.00013233827,"threshold_uncertainty_score":0.99986535},"labels":[],"label_agreement":null},{"id":"W4413186341","doi":"10.55016/ojs/cdm.v7i2.62052","title":"Some rigid moieties of homogeneous graphs","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Homogeneous; Combinatorics; Mathematics","score_opus":0.00712342329979698,"score_gpt":0.23514631941352018,"score_spread":0.2280228961137232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7089367,0.0044908035,0.2820421,0.00021085126,0.0005506813,0.0005152294,0.000704943,0.0003779862,0.0021707464],"genre_scores_gemma":[0.99076426,0.00009380686,0.008873623,0.000013625345,0.00009346032,0.000019052148,0.0000423359,0.000015404068,0.00008442861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928814,0.000008954918,0.00028021756,0.000059193968,0.00012847026,0.0002350058],"domain_scores_gemma":[0.9994944,0.00004255681,0.00004342857,0.00021213084,0.00010252843,0.000104992076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009281492,0.000117058706,0.00022823995,0.00010235034,0.000062588006,0.000018143219,0.0001029826,0.000051822044,0.00006602533],"category_scores_gemma":[0.000089235386,0.00009624097,0.00010780958,0.00026713512,0.000029769744,0.00013390498,0.000026809996,0.000049594313,0.000036946087],"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.000007817072,0.0001224112,0.001253111,0.00040477442,0.0005887421,0.000001318531,0.003474307,0.2075622,0.01904232,0.7612584,0.004906265,0.0013783053],"study_design_scores_gemma":[0.0015645489,0.00019426977,0.008268926,0.0003910341,0.0015787727,0.00007337819,0.0019551273,0.5296734,0.24801981,0.19712283,0.008826366,0.002331527],"about_ca_topic_score_codex":0.0000028450715,"about_ca_topic_score_gemma":0.0000014439315,"teacher_disagreement_score":0.5641356,"about_ca_system_score_codex":0.00004141328,"about_ca_system_score_gemma":0.0000051244665,"threshold_uncertainty_score":0.39245927},"labels":[],"label_agreement":null},{"id":"W4413186344","doi":"10.55016/ojs/cdm.v7i2.61908","title":"Vertex decompositions of two-dimensional complexes and graphs","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.016072123820208443,"score_gpt":0.3008052375639724,"score_spread":0.284733113743764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1237219,0.0004467601,0.8726979,0.0016508689,0.00009105003,0.00018110183,0.00053387426,0.00007116089,0.0006053806],"genre_scores_gemma":[0.8950024,0.0000043203177,0.10475907,0.00012433412,0.000013780054,0.000012588979,0.000037647318,0.0000027750245,0.00004305325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903727,0.00003898037,0.00029077442,0.00015462657,0.00020072391,0.0002776296],"domain_scores_gemma":[0.9987623,0.0003785099,0.00008647628,0.00038668065,0.00015238224,0.00023362905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029424246,0.00010812113,0.00025982322,0.00022305228,0.00018619426,0.000048810798,0.0003412538,0.000033488068,0.000055286426],"category_scores_gemma":[0.0002891845,0.00008244502,0.000086898326,0.0009522901,0.000100077865,0.00026849698,0.0003731821,0.00006192072,0.00005237209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.823553e-7,0.00016039668,0.00056043,0.000008231706,0.000045248373,5.515945e-7,0.0001489966,0.00006025124,0.0011090023,0.99652094,0.00082936574,0.0005556185],"study_design_scores_gemma":[0.0017311726,0.00035356745,0.037894372,0.0001474108,0.00045850556,0.00015048632,0.00020078587,0.06864334,0.009640327,0.8758988,0.0038835723,0.0009976543],"about_ca_topic_score_codex":0.000017121429,"about_ca_topic_score_gemma":0.0000032030725,"teacher_disagreement_score":0.7712805,"about_ca_system_score_codex":0.000019231089,"about_ca_system_score_gemma":0.000014103793,"threshold_uncertainty_score":0.336201},"labels":[],"label_agreement":null},{"id":"W4413186378","doi":"10.55016/ojs/cdm.v7i2.62135","title":"Frobenius partition theoretic interpretations of some basic series identities","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Series (stratigraphy); Combinatorics","score_opus":0.021880266221267385,"score_gpt":0.33718385775176707,"score_spread":0.3153035915304997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16718467,0.0006887079,0.81470966,0.001012907,0.00070121797,0.0017732015,0.0012988735,0.0005186627,0.012112091],"genre_scores_gemma":[0.93902075,0.00004600572,0.05710606,0.00005210349,0.00020247421,0.0003196035,0.000046678066,0.00007115152,0.0031351969],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741393,0.00011318908,0.001085958,0.00022255017,0.00049744395,0.00066694897],"domain_scores_gemma":[0.99691737,0.0011616797,0.00041401066,0.0007613553,0.0004641431,0.0002814555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007569988,0.0003380456,0.0006999309,0.0002548178,0.0002514768,0.00009269668,0.00037052974,0.00012720983,0.0005035171],"category_scores_gemma":[0.0056767655,0.0003043,0.00026205168,0.0003804449,0.00040406783,0.0013357233,0.00024530926,0.0001902817,0.00027775404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012595905,0.00029270942,0.000044998706,0.0005938728,0.00009011314,0.000001068847,0.0045445007,0.000016348604,0.0013988756,0.9911979,0.0017821152,0.000024905212],"study_design_scores_gemma":[0.0002850137,0.0000761914,0.000057329507,0.0004039494,0.00030541525,0.00003131895,0.0029571208,0.000257144,0.018776758,0.9763001,0.0002213749,0.00032826146],"about_ca_topic_score_codex":0.0000027454664,"about_ca_topic_score_gemma":0.0000068690083,"teacher_disagreement_score":0.77183604,"about_ca_system_score_codex":0.00017516984,"about_ca_system_score_gemma":0.000052975603,"threshold_uncertainty_score":0.99994093},"labels":[],"label_agreement":null},{"id":"W4413186386","doi":"10.55016/ojs/cdm.v7i2.62130","title":"A continuous variant of the inverse Littlewood-Offord problem for quadratic forms","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Inverse; Quadratic equation; Geometry","score_opus":0.009092201562467931,"score_gpt":0.26784169735271873,"score_spread":0.2587494957902508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011659882,0.00009607942,0.9850417,0.0002953516,0.00006401426,0.0012225814,0.0002837767,0.00022293616,0.0011137142],"genre_scores_gemma":[0.8448965,0.000007968523,0.15426196,0.000053458873,0.000052233765,0.00047146447,0.000019338557,0.00003552389,0.00020158218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988722,0.000015673697,0.0004746749,0.00009594966,0.00014920974,0.00039226192],"domain_scores_gemma":[0.9989859,0.00018146391,0.00011257239,0.00043518172,0.0001592616,0.00012560844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002807965,0.00017079119,0.00037358367,0.00006178921,0.00009990308,0.000018511606,0.00025546463,0.00007389604,0.000016016445],"category_scores_gemma":[0.00052888616,0.00011137431,0.0002063104,0.00040552818,0.00005902623,0.00015978278,0.0000779046,0.00010246574,0.000014958816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003321316,0.0007258837,0.0006703517,0.0018354872,0.0008604886,0.0000012653747,0.0058171735,0.008390297,0.03572648,0.9258358,0.016318882,0.0037847108],"study_design_scores_gemma":[0.0020096495,0.00041673987,0.00046360758,0.0010169895,0.0015210293,0.000051235893,0.0016608525,0.26703978,0.16620304,0.47695994,0.080925986,0.0017311466],"about_ca_topic_score_codex":0.0000024147046,"about_ca_topic_score_gemma":0.000011313887,"teacher_disagreement_score":0.8332366,"about_ca_system_score_codex":0.00011713415,"about_ca_system_score_gemma":0.000016123648,"threshold_uncertainty_score":0.45417127},"labels":[],"label_agreement":null},{"id":"W4413186388","doi":"10.55016/ojs/cdm.v7i2.62146","title":"Tournaments with kernels by monochromatic paths","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Mathematics; Combinatorics; Biology","score_opus":0.018384650141789576,"score_gpt":0.25268886806937596,"score_spread":0.23430421792758638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48157492,0.0012284277,0.49601173,0.00064575,0.00033136056,0.0008387179,0.0015845008,0.0001381798,0.0176464],"genre_scores_gemma":[0.99404174,0.0000065830554,0.0032857351,0.000121324454,0.00011406277,0.00010296893,0.00003816447,0.0000330741,0.0022563252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985244,0.000027806009,0.00063779147,0.00020424351,0.00006428608,0.00054147316],"domain_scores_gemma":[0.9987592,0.0001102195,0.00034642746,0.00045068612,0.00005430971,0.0002791746],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009707692,0.0002004008,0.00046741613,0.0001049672,0.00018957446,0.000103017155,0.00023937847,0.00007979324,0.00026866893],"category_scores_gemma":[0.0003782239,0.00018077328,0.000084583975,0.00024916563,0.000044899894,0.00025364314,0.000058594003,0.00011781086,0.0022919278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009783527,0.00034016257,0.010625504,0.00010948622,0.00015541655,0.0000014497296,0.0031933931,0.00003294945,0.00026988494,0.9796542,0.00552823,0.000079555095],"study_design_scores_gemma":[0.008891592,0.0015747107,0.01618269,0.0022630459,0.00046635867,0.00036514213,0.0072347675,0.014702933,0.009674391,0.71180165,0.22093605,0.0059066857],"about_ca_topic_score_codex":0.000015014912,"about_ca_topic_score_gemma":0.0000011354156,"teacher_disagreement_score":0.51246685,"about_ca_system_score_codex":0.00016766404,"about_ca_system_score_gemma":0.00001110533,"threshold_uncertainty_score":0.9984849},"labels":[],"label_agreement":null},{"id":"W4413186403","doi":"10.55016/ojs/cdm.v7i2.62089","title":"Domination Value in Graphs","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics; Value (mathematics); Statistics","score_opus":0.018171568515713735,"score_gpt":0.33151473795935527,"score_spread":0.31334316944364154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024073409,0.00014594324,0.9715411,0.0011603737,0.0001385685,0.0004996681,0.000028602019,0.000108019885,0.0023042806],"genre_scores_gemma":[0.8994138,0.0000068698937,0.100177094,0.000079420184,0.000031215684,0.00011562802,0.0000066406133,0.000010073052,0.00015921576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984692,0.0001139168,0.0003130718,0.00019625062,0.00031417725,0.00059339346],"domain_scores_gemma":[0.99855375,0.00035798023,0.00006632935,0.000636371,0.00015735385,0.00022822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012623019,0.00013117983,0.00019169536,0.00037125876,0.00013699387,0.00008738548,0.0006635634,0.000058470738,0.000014193653],"category_scores_gemma":[0.001095857,0.000118897166,0.00006949975,0.0012965534,0.000054684442,0.000728897,0.00029385136,0.00015988591,0.00023718755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023225875,0.00010354314,0.00029452407,0.00001135491,0.000005718287,0.0000014204321,0.0011143406,0.00014013116,0.0007293367,0.9964364,0.000116349176,0.0010445488],"study_design_scores_gemma":[0.000589351,0.000054268596,0.0030919632,0.00007578382,0.000008349939,0.000018123354,0.00018999267,0.03215652,0.005411545,0.95627713,0.0018093876,0.00031759788],"about_ca_topic_score_codex":0.0000038446888,"about_ca_topic_score_gemma":0.0000028042034,"teacher_disagreement_score":0.8753404,"about_ca_system_score_codex":0.00016049795,"about_ca_system_score_gemma":0.00003650729,"threshold_uncertainty_score":0.48484856},"labels":[],"label_agreement":null},{"id":"W4413186436","doi":"10.55016/ojs/cdm.v7i1.62080","title":"Decoding generalised hyperoctahedral groups and asymptotic analysis of correctible error patterns","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; GCHQ; Government of the United Kingdom; University of Regina","keywords":"Mathematics; Decoding methods; Combinatorics; Statistics","score_opus":0.01720815216040471,"score_gpt":0.2905550909592932,"score_spread":0.2733469387988885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32253197,0.00008825854,0.67647165,0.00026239466,0.0001455455,0.00016198048,0.00012735545,0.00005369653,0.00015717071],"genre_scores_gemma":[0.9506529,0.0000070296196,0.049068317,0.00007549176,0.0000593284,0.000022683622,0.000020795042,0.000008009391,0.00008544205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987276,0.00007810677,0.00038875823,0.00020868,0.00020266732,0.00039416604],"domain_scores_gemma":[0.9986769,0.00028216254,0.00015766243,0.00050913746,0.00013143042,0.00024268722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000611996,0.00016186628,0.00042445757,0.00032492683,0.00017830907,0.00009272658,0.00038873142,0.00005722481,0.000047101326],"category_scores_gemma":[0.000272522,0.0001402388,0.00014994005,0.0010180469,0.000041127783,0.00037262653,0.00026120766,0.00008058138,0.000015946158],"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.000008896684,0.0003470227,0.013157851,0.000133113,0.000907953,0.0000037373334,0.0067213974,0.0011708474,0.0035371098,0.97123176,0.00023179076,0.002548526],"study_design_scores_gemma":[0.00094200246,0.00016136395,0.017070144,0.00014720397,0.001839182,0.000051151834,0.0008863168,0.9548039,0.011246902,0.0115370955,0.00047354624,0.0008411782],"about_ca_topic_score_codex":0.000010237024,"about_ca_topic_score_gemma":0.0000076289116,"teacher_disagreement_score":0.9596947,"about_ca_system_score_codex":0.00004999589,"about_ca_system_score_gemma":0.000019583144,"threshold_uncertainty_score":0.57187724},"labels":[],"label_agreement":null},{"id":"W4413186446","doi":"10.55016/ojs/cdm.v7i1.62117","title":"Complementaries to Kummer's degree seven reciprocity law and a Dickson Diophantine system","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Reciprocity law; Diophantine equation; Degree (music); Reciprocity (cultural anthropology); Combinatorics; Pure mathematics; Sociology; Social science","score_opus":0.043957219125466664,"score_gpt":0.32722758107271865,"score_spread":0.28327036194725197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58092165,0.00034973273,0.39741936,0.001982494,0.00054526515,0.0026129757,0.0015181921,0.0005350969,0.014115236],"genre_scores_gemma":[0.95893705,0.0000024745382,0.039603524,0.00043273997,0.00030585524,0.00019087308,0.000043300606,0.000045831406,0.00043836117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977105,0.00013597758,0.00067541545,0.00030163306,0.0003773634,0.00079907273],"domain_scores_gemma":[0.9974702,0.0008190406,0.00019568992,0.00064568274,0.00025973952,0.0006096758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015615572,0.00035275536,0.00066029676,0.00012948565,0.00059804536,0.00011170064,0.00030045054,0.000118952405,0.00012069646],"category_scores_gemma":[0.0016357275,0.0003051531,0.00011707649,0.0004524965,0.00013594206,0.00025695795,0.00043637783,0.00019042622,0.00024945373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034012483,0.00017237401,0.00030927113,0.00041904984,0.0001350261,0.0000025544641,0.0049532624,8.1247896e-7,0.00024850818,0.99073803,0.002774309,0.00021277333],"study_design_scores_gemma":[0.005501853,0.00091599737,0.003314292,0.003398024,0.0024288902,0.0005779964,0.043900684,0.0008878329,0.03671463,0.7779628,0.120297775,0.0040991995],"about_ca_topic_score_codex":0.000045223445,"about_ca_topic_score_gemma":0.00005340357,"teacher_disagreement_score":0.3780154,"about_ca_system_score_codex":0.00021776374,"about_ca_system_score_gemma":0.000027291198,"threshold_uncertainty_score":0.99994004},"labels":[],"label_agreement":null},{"id":"W4413186452","doi":"10.55016/ojs/cdm.v7i1.62107","title":"Monochromatic even cycles","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monochromatic color; Mathematics; Combinatorics; Biology; Botany","score_opus":0.01470262452217187,"score_gpt":0.29740589687461466,"score_spread":0.2827032723524428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018447243,0.0001863673,0.97507465,0.0023451415,0.00010616135,0.0004270561,0.000067656074,0.00034229527,0.003003424],"genre_scores_gemma":[0.8567605,0.000003844138,0.14248903,0.00014919008,0.000087844994,0.00016693122,0.00002133657,0.000011715594,0.0003096268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988221,0.000030731364,0.0003080716,0.00017887731,0.00021219972,0.0004480538],"domain_scores_gemma":[0.9984605,0.00014879477,0.00008516443,0.00091666204,0.00009533538,0.00029357764],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032879473,0.00014544655,0.00019583014,0.00008962485,0.00025416512,0.0001477987,0.0007169449,0.000051699728,0.000038172606],"category_scores_gemma":[0.00022281507,0.00012913671,0.00009049922,0.0004810109,0.000031352927,0.0004141667,0.00030672573,0.00007888609,0.0015493468],"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":[2.8696184e-7,0.00017171701,0.00007114496,0.000024191768,0.000022332406,6.966666e-7,0.0014674537,0.000020178988,0.004831769,0.9886076,0.0031899652,0.0015926907],"study_design_scores_gemma":[0.0016489548,0.00016866499,0.0179244,0.00039490568,0.00030774804,0.0003077192,0.000966245,0.41965464,0.070789315,0.35108012,0.1341187,0.002638576],"about_ca_topic_score_codex":0.000003718033,"about_ca_topic_score_gemma":0.0000011765056,"teacher_disagreement_score":0.8383132,"about_ca_system_score_codex":0.00008476254,"about_ca_system_score_gemma":0.000038802194,"threshold_uncertainty_score":0.99922806},"labels":[],"label_agreement":null},{"id":"W4413186453","doi":"10.55016/ojs/cdm.v7i1.62051","title":"2-generated Cayley digraphs on nilpotent groups have hamiltonian paths","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nilpotent; Mathematics; Combinatorics; Cayley graph; Cayley's theorem; Hamiltonian (control theory); Nilpotent group; Discrete mathematics; Graph; Voltage graph","score_opus":0.010370156541710187,"score_gpt":0.2377313745768587,"score_spread":0.2273612180351485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8389357,0.0009703164,0.13931355,0.0002480061,0.0015810637,0.0013816532,0.0012415453,0.0010524561,0.015275733],"genre_scores_gemma":[0.99836653,0.000014345925,0.0006608433,0.00008147855,0.00022609127,0.00018855846,0.00009347623,0.00005668056,0.0003120096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99836344,0.00006686501,0.00045307423,0.0001788408,0.00024499118,0.00069277856],"domain_scores_gemma":[0.99873424,0.00010834337,0.000057498655,0.0005899695,0.000108340595,0.00040161973],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045851123,0.00031712925,0.00036774512,0.00018437133,0.00023580459,0.00009722959,0.00023173507,0.00014653766,0.00006769827],"category_scores_gemma":[0.00015122605,0.00027748782,0.00017627874,0.00036119067,0.000045081615,0.00014412944,0.000040878727,0.00021232897,0.00056993763],"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.000033191558,0.0004923324,0.0011644971,0.00031375015,0.00046586333,0.00001620767,0.008068281,0.0068920567,0.022350855,0.94728035,0.0119535485,0.00096905866],"study_design_scores_gemma":[0.009912331,0.0020602974,0.019872531,0.004180643,0.0019971672,0.0005419739,0.019187808,0.21225561,0.24525702,0.13778667,0.33459634,0.012351604],"about_ca_topic_score_codex":0.0000048018555,"about_ca_topic_score_gemma":0.000008967546,"teacher_disagreement_score":0.80949366,"about_ca_system_score_codex":0.0001448003,"about_ca_system_score_gemma":0.000011306449,"threshold_uncertainty_score":0.99996775},"labels":[],"label_agreement":null},{"id":"W4413186458","doi":"10.55016/ojs/cdm.v7i1.62112","title":"Packing of points into the unit 6-dimensional cube","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Unit cube; Combinatorics; Mathematics; Cube (algebra); Unit (ring theory)","score_opus":0.015321443876219634,"score_gpt":0.2733699689505132,"score_spread":0.25804852507429354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15092291,0.0012401576,0.829314,0.0028499765,0.0010310347,0.0011244992,0.00040085867,0.0005684176,0.012548127],"genre_scores_gemma":[0.98219156,0.000011404308,0.017419826,0.00008498004,0.00006805261,0.00002351873,0.00003835549,0.000024227942,0.00013808582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992123,0.000026106514,0.0002871454,0.000059402384,0.00016473641,0.000250313],"domain_scores_gemma":[0.9992394,0.00017500341,0.000048713424,0.0002812867,0.0001455286,0.00011008507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003840145,0.00011711535,0.00016294644,0.000066615874,0.00012606685,0.000025136784,0.0001454559,0.000053769152,0.00014248095],"category_scores_gemma":[0.0002639196,0.00008521484,0.00005973215,0.0003020065,0.000045313544,0.00010052449,0.000056881712,0.00010657576,0.0001372124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011594879,0.00026186477,0.0013474103,0.0004893382,0.00037213092,0.0000011107084,0.029293252,0.24329928,0.010253645,0.6996862,0.013280648,0.0017035087],"study_design_scores_gemma":[0.0020263754,0.0001341126,0.0024226718,0.0011765724,0.0004652556,0.00005759368,0.0029338156,0.7712105,0.067262806,0.048493892,0.10215315,0.001663241],"about_ca_topic_score_codex":0.000003486616,"about_ca_topic_score_gemma":0.000003228022,"teacher_disagreement_score":0.8312686,"about_ca_system_score_codex":0.000040839222,"about_ca_system_score_gemma":0.000014436856,"threshold_uncertainty_score":0.34749603},"labels":[],"label_agreement":null},{"id":"W4413186459","doi":"10.55016/ojs/cdm.v7i1.62138","title":"Characterizing graph classes by intersections of neighborhoods","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Graph","score_opus":0.01357958070157754,"score_gpt":0.2749103765177576,"score_spread":0.2613307958161801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05316261,0.00032874485,0.94248176,0.0016281619,0.00045441327,0.00025540584,0.00016949564,0.00019467142,0.0013247406],"genre_scores_gemma":[0.969307,0.000013808587,0.03028913,0.0002038462,0.000015036933,0.00003962277,0.00001929412,0.000010474472,0.0001017523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872863,0.000045248566,0.0004324431,0.00017986383,0.00020867676,0.00040515838],"domain_scores_gemma":[0.99863255,0.00014811358,0.0001709693,0.0005694686,0.00023705458,0.00024184315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004237881,0.0001519989,0.00025382897,0.00018612105,0.00018563858,0.00007597126,0.00042617213,0.00006663724,0.00001801673],"category_scores_gemma":[0.00030960396,0.00013234837,0.00012133611,0.0007136043,0.000062697756,0.0004284897,0.00021000383,0.00011322595,0.00006150763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002026781,0.0003164454,0.0004288225,0.000042875596,0.00005964315,3.210714e-7,0.0021765293,0.000010496032,0.07834932,0.91271675,0.005399316,0.00049743475],"study_design_scores_gemma":[0.0029909809,0.0009769073,0.0040572374,0.0013877217,0.00045931124,0.00018086747,0.0028926362,0.033311512,0.4441789,0.4662849,0.04039325,0.0028857733],"about_ca_topic_score_codex":0.000011407053,"about_ca_topic_score_gemma":0.000001290471,"teacher_disagreement_score":0.91614443,"about_ca_system_score_codex":0.000036004887,"about_ca_system_score_gemma":0.000029531171,"threshold_uncertainty_score":0.53970104},"labels":[],"label_agreement":null},{"id":"W4413186460","doi":"10.55016/ojs/cdm.v7i1.62108","title":"Notes on the illumination parameters of convex bodies","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Satellite Image Processing and Photogrammetry","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Regular polygon; Mathematics; Combinatorics; Geometry","score_opus":0.021872712804564244,"score_gpt":0.2762518885393609,"score_spread":0.2543791757347966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45406714,0.0015594476,0.53515315,0.0012735263,0.00046380528,0.00069885736,0.0003888645,0.00035708837,0.0060380884],"genre_scores_gemma":[0.9928199,0.00002330561,0.006946262,0.000068135916,0.00003613041,0.00004646744,0.000013833398,0.000016491736,0.000029451714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993197,0.000020468853,0.00022337669,0.000058597023,0.00013956967,0.00023831586],"domain_scores_gemma":[0.9988221,0.0007217414,0.000045975154,0.00023525232,0.00010395976,0.00007099737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032702164,0.00012034409,0.00016838832,0.00007027954,0.00008733578,0.000034630317,0.00011998094,0.000047700334,0.00002526086],"category_scores_gemma":[0.001054072,0.000080749574,0.00006359658,0.0001823044,0.00007482332,0.000071574985,0.000018703782,0.00009742046,0.00007502481],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011250272,0.0019246975,0.0071229665,0.0046481565,0.001980508,0.0000054283714,0.10811118,0.015211309,0.15911877,0.54747623,0.023166481,0.13112177],"study_design_scores_gemma":[0.00047742046,0.00013185859,0.0015612204,0.0006106612,0.00025717757,0.000012286135,0.0031189658,0.06676105,0.9055391,0.011524563,0.009274261,0.00073141867],"about_ca_topic_score_codex":0.000003966979,"about_ca_topic_score_gemma":9.325399e-7,"teacher_disagreement_score":0.7464203,"about_ca_system_score_codex":0.0000399498,"about_ca_system_score_gemma":0.000006552029,"threshold_uncertainty_score":0.3292872},"labels":[],"label_agreement":null},{"id":"W4413186462","doi":"10.55016/ojs/cdm.v7i1.62115","title":"On characterizing game-perfect graphs by forbidden induced subgraphs","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.02203298500575682,"score_gpt":0.32223342822638623,"score_spread":0.3002004432206294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.318593,0.00015586351,0.6765918,0.0013092619,0.00030136347,0.0009131345,0.00021228663,0.00034612766,0.0015771831],"genre_scores_gemma":[0.9901246,0.000012258797,0.008910265,0.00041966248,0.000056761754,0.0002127338,0.00003470199,0.000033849665,0.00019518711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731064,0.00016090553,0.00043927477,0.00041105764,0.00056052924,0.0011176134],"domain_scores_gemma":[0.997168,0.00064575055,0.00015521771,0.001240111,0.00022590553,0.0005650261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011070938,0.00031734788,0.0003852301,0.00039601306,0.00036193678,0.00023806843,0.0011917489,0.00012250926,0.000037726484],"category_scores_gemma":[0.0010894556,0.0002768008,0.00019607793,0.0012997596,0.000082471,0.0008321598,0.00038435357,0.00037188164,0.00047156223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011700117,0.00021454386,0.00013590828,0.000023393983,0.00004547581,0.0000023747389,0.0010900444,0.0000029927412,0.04073742,0.95476216,0.0014255233,0.0015484497],"study_design_scores_gemma":[0.0020497749,0.0010366295,0.0021257366,0.00042937562,0.00008284453,0.00008069921,0.00038005624,0.006931513,0.18346302,0.7900946,0.011300106,0.0020256038],"about_ca_topic_score_codex":0.0000033322815,"about_ca_topic_score_gemma":0.0000010722647,"teacher_disagreement_score":0.6715316,"about_ca_system_score_codex":0.00014593927,"about_ca_system_score_gemma":0.000046277768,"threshold_uncertainty_score":0.9999684},"labels":[],"label_agreement":null},{"id":"W4413186463","doi":"10.55016/ojs/cdm.v7i1.62116","title":"Beaded partitions with k colors","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Color Science and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01150612146195542,"score_gpt":0.2958458362604123,"score_spread":0.2843397147984569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3291006,0.000019036217,0.63714457,0.0036077264,0.0000675167,0.00085669593,0.0007501765,0.000103300015,0.028350372],"genre_scores_gemma":[0.9919033,2.5011556e-7,0.0067254035,0.00007005126,0.00015538129,0.000466122,0.000066234454,0.000008951638,0.0006043149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991935,0.000011387478,0.00017024955,0.00011702712,0.00013110696,0.00037672502],"domain_scores_gemma":[0.9992025,0.000076928205,0.00005950518,0.0002972948,0.0001172021,0.0002465774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014183164,0.00010713259,0.0001341692,0.000044357585,0.0003534706,0.000057306082,0.0001511848,0.00001920187,0.00044689784],"category_scores_gemma":[0.000022611177,0.00008315984,0.000052279316,0.0004297281,0.00007291917,0.00018285147,0.00004813543,0.00007437927,0.00060208316],"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.000002470154,0.0003032396,0.005969261,0.0000042410993,0.00003447246,1.0540427e-7,0.0009763169,0.00012433487,0.00083178066,0.98731416,0.0041179853,0.0003216551],"study_design_scores_gemma":[0.0041184756,0.00071668683,0.044144183,0.0004133916,0.0013138197,0.000032658205,0.025683297,0.008258972,0.06530939,0.30833775,0.538032,0.00363936],"about_ca_topic_score_codex":0.000010813453,"about_ca_topic_score_gemma":0.0000042343754,"teacher_disagreement_score":0.6789764,"about_ca_system_score_codex":0.00003422002,"about_ca_system_score_gemma":0.00004784356,"threshold_uncertainty_score":0.77387613},"labels":[],"label_agreement":null},{"id":"W4413186465","doi":"10.55016/ojs/cdm.v4i2.62086","title":"The distribution of polynomials over finite fields, with applications to the Gowers norms","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"John D. and Catherine T. MacArthur Foundation; National Science Foundation","keywords":"Mathematics; Distribution (mathematics); Combinatorics; Finite field; Orthogonal polynomials; Pure mathematics; Mathematical analysis","score_opus":0.021690663179078997,"score_gpt":0.3436793809764977,"score_spread":0.3219887177974187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012642849,0.0000633415,0.96380913,0.017908392,0.000035774265,0.0024458407,0.0008683321,0.00007409508,0.002152228],"genre_scores_gemma":[0.9917354,0.000019731058,0.005107753,0.00031449518,0.0001428227,0.00041642977,0.00006666492,0.00002640807,0.0021702675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790394,0.000105371655,0.0006417723,0.0002511626,0.0005702656,0.00052748655],"domain_scores_gemma":[0.99517244,0.0025078831,0.00023539699,0.001319032,0.00054438296,0.0002208518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014343379,0.00023107367,0.00037486147,0.000064089916,0.00070361997,0.00013479902,0.0008186302,0.00009209713,0.000050522638],"category_scores_gemma":[0.0028955583,0.00012000817,0.000151128,0.000856886,0.00019171817,0.00007786536,0.00014326622,0.00025587785,0.00012850488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008253586,0.0001719329,0.00003232452,0.000035583438,0.00011698556,0.00000116563,0.00083292584,0.00035372085,0.00013519551,0.9761584,0.02062812,0.0014511256],"study_design_scores_gemma":[0.0012236512,0.0006833124,0.0008476262,0.00032322295,0.00048079612,0.000025915371,0.0026250547,0.0060138437,0.0032474257,0.88997835,0.0938427,0.00070808234],"about_ca_topic_score_codex":0.000013618547,"about_ca_topic_score_gemma":0.00007577091,"teacher_disagreement_score":0.9790926,"about_ca_system_score_codex":0.00016845965,"about_ca_system_score_gemma":0.00013024079,"threshold_uncertainty_score":0.5411747},"labels":[],"label_agreement":null},{"id":"W4413186473","doi":"10.55016/ojs/cdm.v4i2.62022","title":"Fractional illumination of convex bodies","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; University of Alberta","keywords":"Mathematics; Regular polygon; Combinatorics; Geometry","score_opus":0.032162685822232404,"score_gpt":0.3524299917607267,"score_spread":0.3202673059384943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06326981,0.0002239376,0.9113265,0.0049160477,0.0001785434,0.0007130276,0.00076455483,0.0001948492,0.018412707],"genre_scores_gemma":[0.9723005,0.00001793127,0.025745315,0.00015563474,0.000101948004,0.000029262586,0.0000396198,0.000012602072,0.0015971377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984685,0.00003078931,0.000646104,0.00016668958,0.00040498647,0.00028288417],"domain_scores_gemma":[0.9977148,0.0007353944,0.00029006484,0.0003245031,0.0008325526,0.000102667174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005677962,0.00017424833,0.0004274836,0.00028767134,0.00015268757,0.000039753875,0.00019552062,0.00009330772,0.00019263886],"category_scores_gemma":[0.0056667994,0.00015212077,0.00013113994,0.0004569033,0.00006726718,0.00018611216,0.00004278663,0.00011372953,0.000050124367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012017509,0.00022154067,0.000013033189,0.0001521303,0.00003961626,0.0000011997175,0.0014332063,0.000013437367,0.0005349965,0.9926706,0.0041510626,0.0007571755],"study_design_scores_gemma":[0.0004498012,0.00021449428,0.00035375246,0.00016142595,0.00009658179,0.000014711919,0.0014123701,0.0011186248,0.0075989817,0.98378676,0.0045318375,0.00026068406],"about_ca_topic_score_codex":0.0000041812436,"about_ca_topic_score_gemma":0.000003113636,"teacher_disagreement_score":0.90903074,"about_ca_system_score_codex":0.00008809794,"about_ca_system_score_gemma":0.00007109018,"threshold_uncertainty_score":0.67840976},"labels":[],"label_agreement":null},{"id":"W4413186477","doi":"10.55016/ojs/cdm.v4i2.62763","title":"On the Hall-Janko graph with 100 vertices and the near-octagon of order (2,4)","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Vlaamse regering; Fonds Wetenschappelijk Onderzoek","keywords":"Combinatorics; Mathematics; Graph; Order (exchange); Business","score_opus":0.005192508490468586,"score_gpt":0.21655889918899499,"score_spread":0.2113663906985264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186477","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8755667,0.0008524787,0.10434246,0.0056795916,0.00013042621,0.0015487373,0.00015091228,0.00020620872,0.011522495],"genre_scores_gemma":[0.99930286,0.000016878417,0.00042157946,0.00011933599,0.000016502501,0.000044089793,0.0000036242059,0.000011851352,0.00006329618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992672,0.00006136098,0.00021865194,0.00009555208,0.00016195593,0.00019527182],"domain_scores_gemma":[0.99891305,0.00047964675,0.00005313379,0.0003991363,0.00009966414,0.00005539535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044427524,0.00014908412,0.00024083552,0.000039204504,0.0002183003,0.0000781678,0.00019557218,0.000044904653,0.000021005255],"category_scores_gemma":[0.00022474398,0.00007079742,0.000056717665,0.00035140885,0.00019401644,0.000051329036,0.000015980384,0.00012300545,0.000015212285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050902556,0.000027171798,0.000008050395,0.000042033676,0.000088689514,8.5691795e-7,0.0018666155,0.0028257894,0.0003688775,0.9940557,0.00053071504,0.00013462179],"study_design_scores_gemma":[0.005582042,0.0010358187,0.0014474294,0.0014323291,0.00077461783,0.000079273836,0.005657962,0.13014844,0.008073555,0.83871865,0.0059544165,0.0010954296],"about_ca_topic_score_codex":0.000004235318,"about_ca_topic_score_gemma":0.000007436191,"teacher_disagreement_score":0.15533699,"about_ca_system_score_codex":0.000013348194,"about_ca_system_score_gemma":0.000011230901,"threshold_uncertainty_score":0.2887035},"labels":[],"label_agreement":null},{"id":"W4413186484","doi":"10.55016/ojs/cdm.v7i1.61906","title":"Deformations of associahedra and visibility graphs","year":2012,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Satellite Image Processing and Photogrammetry","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Williams College; National Science Foundation","keywords":"Combinatorics; Visibility; Mathematics; Graph; Geography","score_opus":0.00934794924895526,"score_gpt":0.2737147896242457,"score_spread":0.26436684037529046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186484","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5242734,0.0021973175,0.46791136,0.000089342866,0.00016738781,0.00034852314,0.000547068,0.00028364526,0.0041819396],"genre_scores_gemma":[0.98575497,0.000035013614,0.014099829,0.000015771257,0.000021901933,0.000022812503,0.00002187552,0.000012614562,0.000015204586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99928105,0.000014310999,0.00028378423,0.000059318798,0.000106245556,0.0002552815],"domain_scores_gemma":[0.9993613,0.00013450564,0.0000427612,0.00019536224,0.00011734774,0.00014875893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035683627,0.00010541191,0.00018755737,0.000090001195,0.00008611022,0.000033249256,0.000074599535,0.00006053183,0.000017129767],"category_scores_gemma":[0.0003515143,0.00009561074,0.00005203295,0.00032451996,0.00004958214,0.00018452277,0.000029981946,0.000087248074,0.00002005628],"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.00005814853,0.002725117,0.15989152,0.011909817,0.0020445867,0.000003570119,0.09821731,0.003749371,0.10167666,0.49052972,0.012331257,0.116862945],"study_design_scores_gemma":[0.004245795,0.00037384336,0.10863722,0.0017284143,0.0017442792,0.00018157334,0.0113043925,0.2187981,0.35200024,0.26287204,0.03370297,0.0044111214],"about_ca_topic_score_codex":0.0000044025696,"about_ca_topic_score_gemma":0.0000016872139,"teacher_disagreement_score":0.46148157,"about_ca_system_score_codex":0.000043076267,"about_ca_system_score_gemma":0.000009081702,"threshold_uncertainty_score":0.38988927},"labels":[],"label_agreement":null},{"id":"W4413186491","doi":"10.55016/ojs/cdm.v4i2.61994","title":"The sum-product phenomenon in arbitrary rings","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"John D. and Catherine T. MacArthur Foundation; National Science Foundation","keywords":"Mathematics; Phenomenon; Combinatorics; Product (mathematics); Geometry; Physics","score_opus":0.02230196316525949,"score_gpt":0.3000663226122716,"score_spread":0.2777643594470121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186491","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8728029,0.0015942575,0.05747731,0.026192114,0.00054901687,0.0034054334,0.00023587022,0.0006740648,0.03706905],"genre_scores_gemma":[0.9823802,0.00008285623,0.014924805,0.00039418685,0.00032229096,0.00010365335,0.000018117235,0.000045930545,0.0017279255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976328,0.00007234309,0.0007902628,0.00038603792,0.00037687639,0.00074165215],"domain_scores_gemma":[0.99779844,0.0006320731,0.00019998834,0.0010034629,0.00017562999,0.00019041666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011565918,0.00031723123,0.00047365227,0.00015486845,0.00047156768,0.00020844967,0.0005950262,0.00008454667,0.000033189568],"category_scores_gemma":[0.0024767416,0.00023142362,0.00015180367,0.00054625515,0.000106564905,0.00018992442,0.00010877722,0.0003480578,0.00016233405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018354636,0.00026642843,0.00006474809,0.000052930878,0.00003218418,0.000010179562,0.0016366502,0.000014126021,0.00088566495,0.990554,0.0046455823,0.0018191868],"study_design_scores_gemma":[0.00057253207,0.00009421645,0.0012960911,0.00019458594,0.000051412946,0.0000176843,0.00053533266,0.00066858996,0.0024867288,0.98539615,0.008291677,0.00039502134],"about_ca_topic_score_codex":0.000007628257,"about_ca_topic_score_gemma":0.000036694975,"teacher_disagreement_score":0.10957735,"about_ca_system_score_codex":0.00021960585,"about_ca_system_score_gemma":0.000082089544,"threshold_uncertainty_score":0.94371814},"labels":[],"label_agreement":null},{"id":"W4413186523","doi":"10.55016/ojs/cdm.v4i2.62044","title":"Another short proof of the Joni-Rota-Godsil integral formula for counting bipartite matchings","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"advanced mathematical theories","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Université de Montréal","keywords":"Bipartite graph; Mathematics; Combinatorics; Discrete mathematics; Mathematical economics","score_opus":0.029815331775303815,"score_gpt":0.35779366167627763,"score_spread":0.3279783299009738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05351085,0.000065644286,0.9366434,0.0030745647,0.000116760064,0.0036044277,0.00067156105,0.00019066573,0.0021221086],"genre_scores_gemma":[0.770559,0.0000019403155,0.22738251,0.00038697146,0.00013357987,0.00039005166,0.000018502751,0.000059946116,0.0010674937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709076,0.000066726956,0.001257247,0.0003411813,0.00054828066,0.0006958209],"domain_scores_gemma":[0.99607587,0.0017266663,0.00045280787,0.0009387717,0.00067188067,0.00013397916],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012995048,0.00042149497,0.0008762883,0.00008561177,0.00038295577,0.00009074745,0.00071705825,0.00016433364,0.000051368756],"category_scores_gemma":[0.00843929,0.0002535953,0.0004500473,0.00052706274,0.00017740137,0.0002486572,0.00018454302,0.00026410827,0.000010315717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042037696,0.00033008825,0.000017641732,0.00038699366,0.000081168066,6.1498395e-7,0.0016849674,0.000041952306,0.008602632,0.98614156,0.0013748574,0.001295486],"study_design_scores_gemma":[0.00041506116,0.00014941373,0.000031022922,0.0006734065,0.00020633562,0.000014163488,0.00042847331,0.0030870182,0.07760217,0.9144089,0.002636471,0.00034756504],"about_ca_topic_score_codex":0.0000013835996,"about_ca_topic_score_gemma":0.000011191919,"teacher_disagreement_score":0.71704817,"about_ca_system_score_codex":0.00018242645,"about_ca_system_score_gemma":0.0000779618,"threshold_uncertainty_score":0.99999166},"labels":[],"label_agreement":null},{"id":"W4413186785","doi":"10.55016/ojs/cdm.v5i1.61881","title":"Injective and non-injective realizations with symmetry","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Biochemical and Structural Characterization","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Technische Universität Berlin; Deutsche Forschungsgemeinschaft","keywords":"Injective function; Mathematics; Symmetry (geometry); Monomorphism; Combinatorics; Pure mathematics; Geometry","score_opus":0.0027994163739783057,"score_gpt":0.243813245510995,"score_spread":0.2410138291370167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186785","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88647413,0.000014326225,0.11149986,0.00039372133,0.000055115303,0.00033455447,0.000370821,0.000018656176,0.0008388305],"genre_scores_gemma":[0.9923113,0.000008303241,0.006829694,0.00012531523,0.00012746989,0.000047002526,0.00037679027,0.000015175141,0.00015892903],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993513,0.000010441727,0.00014697567,0.00023421123,0.00008463836,0.000172435],"domain_scores_gemma":[0.9992666,0.000019682095,0.00006208348,0.00024113059,0.0002754695,0.00013502793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007027112,0.00013799286,0.00013433813,0.00004053346,0.0001541285,0.00004389639,0.00009183592,0.00014062076,0.000010011057],"category_scores_gemma":[0.00036126832,0.00010505207,0.000030403698,0.00018071133,0.000103595194,0.0000074854192,0.00008489771,0.00012672148,0.0000053651293],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003421335,0.000032488075,0.00075896276,0.000020279997,0.000048170306,6.444829e-7,0.00021492383,0.0000037908258,0.9846794,0.013658748,0.0002458874,0.0003024686],"study_design_scores_gemma":[0.0011787544,0.0006631059,0.02646238,0.000076458724,0.00013990651,0.00012503198,0.00049304945,0.0010241705,0.95691097,0.007803854,0.0043741735,0.00074812],"about_ca_topic_score_codex":0.0000070759675,"about_ca_topic_score_gemma":0.000033961605,"teacher_disagreement_score":0.1058372,"about_ca_system_score_codex":0.000012173541,"about_ca_system_score_gemma":0.000041457217,"threshold_uncertainty_score":0.42838994},"labels":[],"label_agreement":null},{"id":"W4413186789","doi":"10.55016/ojs/cdm.v5i1.61894","title":"A characterization of the base-matroids of a graphic matroid","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Matroid; Combinatorics; Graphic matroid; Mathematics; Characterization (materials science); Base (topology); Oriented matroid; Matroid partitioning; Discrete mathematics; Physics","score_opus":0.006365721138295434,"score_gpt":0.2445884879603464,"score_spread":0.23822276682205099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32858554,0.0000073921387,0.66967493,0.0009389725,0.00016444897,0.0002894546,0.00012165281,0.000038447924,0.00017913054],"genre_scores_gemma":[0.96943885,0.0000023469293,0.030366914,0.0000664068,0.000025411695,0.000028595972,0.0000068176973,0.0000066280677,0.000058038866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990202,0.000033037384,0.00038188286,0.00015541178,0.00022245933,0.00018699569],"domain_scores_gemma":[0.9984349,0.00011209297,0.00026796895,0.0008451735,0.00027198633,0.000067856265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023975741,0.00011188221,0.00022489669,0.00009088482,0.000112311616,0.000027860353,0.0007954804,0.000057018206,0.000016982855],"category_scores_gemma":[0.00052211486,0.00007532271,0.00016267401,0.0007074948,0.00010445208,0.00017949128,0.0002463566,0.00013853748,0.000010387655],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011238768,0.000046645877,0.00009621796,0.000025203866,0.00000890965,1.9656704e-7,0.00029383838,0.000009439028,0.43889496,0.5604443,0.000011865726,0.00016731798],"study_design_scores_gemma":[0.0008532704,0.00023982138,0.017833829,0.000343054,0.00012117101,0.000055645032,0.0001701951,0.0371863,0.58742225,0.35380885,0.0013822265,0.00058339076],"about_ca_topic_score_codex":0.0000013560548,"about_ca_topic_score_gemma":0.0000055553787,"teacher_disagreement_score":0.6408533,"about_ca_system_score_codex":0.000012068541,"about_ca_system_score_gemma":0.000058714264,"threshold_uncertainty_score":0.30715707},"labels":[],"label_agreement":null},{"id":"W4413186794","doi":"10.55016/ojs/cdm.v5i1.62761","title":"On the universal rigidity of generic bar frameworks","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rigidity (electromagnetism); Mathematics; Bar (unit); Combinatorics; Geometry; Structural engineering; Physics; Engineering","score_opus":0.006001362911046983,"score_gpt":0.22400737233743345,"score_spread":0.21800600942638648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186794","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53192556,0.000015088413,0.46459982,0.0006879973,0.0002081408,0.00019337038,0.00015846224,0.00008203019,0.0021295382],"genre_scores_gemma":[0.9928263,0.0000068926083,0.0069954256,0.00004059422,0.00005070605,0.000007868049,0.000018321885,0.000009840801,0.00004404371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995042,0.000010395375,0.00017419162,0.00007008836,0.00011628923,0.00012481844],"domain_scores_gemma":[0.9993301,0.00016832858,0.0000377514,0.00029844066,0.00011189639,0.000053478747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010131469,0.000093715484,0.00014442335,0.00004522117,0.00009178624,0.000024826117,0.0001626083,0.000106140185,0.00035981683],"category_scores_gemma":[0.00033609263,0.000060057897,0.0000767158,0.0002533614,0.000040219464,0.000035417863,0.000024292027,0.00026435545,0.000038257494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000327289,0.000021745785,0.0000262211,0.000023676173,0.00009546853,6.6964145e-7,0.00035890064,0.17586635,0.009392495,0.8100187,0.003808812,0.0003836977],"study_design_scores_gemma":[0.00017537645,0.00003044673,0.0005696212,0.00004088974,0.00011557058,0.000002435756,0.0001624292,0.9443311,0.012839881,0.040034354,0.0014764115,0.0002214903],"about_ca_topic_score_codex":0.0000027844392,"about_ca_topic_score_gemma":0.000007327339,"teacher_disagreement_score":0.76998436,"about_ca_system_score_codex":0.000027156273,"about_ca_system_score_gemma":0.00000866813,"threshold_uncertainty_score":0.39397418},"labels":[],"label_agreement":null},{"id":"W4413186795","doi":"10.55016/ojs/cdm.v5i1.62066","title":"Deletion constructions of symmetric 4-configurations. Part I.","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.005168732471958994,"score_gpt":0.2271772617436259,"score_spread":0.22200852927166692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186795","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63142294,0.00015709229,0.31934735,0.0003194954,0.0023932753,0.0011326051,0.0015249936,0.0006491446,0.043053124],"genre_scores_gemma":[0.9965552,0.0000073395363,0.003085661,0.000008786467,0.00009690734,0.000093023744,0.000047328595,0.000018412673,0.00008732304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990599,0.00002163353,0.00046061326,0.000108497894,0.00013972638,0.0002096368],"domain_scores_gemma":[0.9990423,0.00014046177,0.0000693189,0.0003847742,0.00023982253,0.00012336762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027672137,0.0001364676,0.00024006021,0.00025042339,0.00013543537,0.000035340683,0.0001489858,0.00010676614,0.00018879941],"category_scores_gemma":[0.0004228288,0.00013211778,0.00010153748,0.000695819,0.000089154404,0.00009780444,0.00001641489,0.00018539929,0.0001276366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013794778,0.000030927127,0.000036278994,0.00007064659,0.000048769696,4.7442506e-7,0.00020980295,0.0005644407,0.04220497,0.9551628,0.00113418,0.00053530553],"study_design_scores_gemma":[0.0027218643,0.00028764142,0.002104822,0.0006865753,0.00077624933,0.00044231233,0.0038760048,0.109407336,0.28328922,0.4392334,0.15484013,0.0023344385],"about_ca_topic_score_codex":0.000002518379,"about_ca_topic_score_gemma":0.000013074807,"teacher_disagreement_score":0.51592946,"about_ca_system_score_codex":0.000026412508,"about_ca_system_score_gemma":0.000023451214,"threshold_uncertainty_score":0.53876066},"labels":[],"label_agreement":null},{"id":"W4413186797","doi":"10.55016/ojs/cdm.v5i1.62034","title":"On a theorem of G. D. Chakerian","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"advanced mathematical theories","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01683206992624857,"score_gpt":0.3488449981570065,"score_spread":0.3320129282307579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23076566,0.0000125207725,0.7228565,0.0016369831,0.00043023124,0.0016755175,0.00078294333,0.00040525434,0.041434355],"genre_scores_gemma":[0.80549264,0.0000017613511,0.19333807,0.000095985844,0.000108342196,0.00013939425,0.000010698395,0.0000675263,0.00074561336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979106,0.00005253,0.0007955131,0.00030322684,0.0004530335,0.00048510637],"domain_scores_gemma":[0.9949429,0.0027877672,0.00031275616,0.0012621841,0.0004180103,0.00027635245],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008964789,0.0003288979,0.00069583673,0.00016777516,0.00017401755,0.000040625477,0.0005077649,0.00016933802,0.0005408843],"category_scores_gemma":[0.017662738,0.00025849667,0.00021723131,0.0004438491,0.0003105906,0.00010439236,0.00017016991,0.0004005786,0.0002481632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028279417,0.00032172722,0.0000020331029,0.00014510723,0.000044819197,0.000002701539,0.0008787729,0.000005755641,0.012558742,0.98501307,0.0007585547,0.00024046823],"study_design_scores_gemma":[0.000433334,0.00014477663,0.00000785676,0.00017495773,0.00006772316,0.00001617371,0.00027407327,0.00034470667,0.032818213,0.9644293,0.0010090435,0.0002798382],"about_ca_topic_score_codex":8.4229123e-7,"about_ca_topic_score_gemma":0.000008632574,"teacher_disagreement_score":0.57472694,"about_ca_system_score_codex":0.00005076187,"about_ca_system_score_gemma":0.00006114398,"threshold_uncertainty_score":0.9999867},"labels":[],"label_agreement":null},{"id":"W4413186803","doi":"10.55016/ojs/cdm.v5i1.61893","title":"Unavoidable arrays","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.004529183765111108,"score_gpt":0.2323996767364395,"score_spread":0.2278704929713284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413186803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123804785,0.000035260266,0.86244786,0.0004884009,0.000427033,0.0002945958,0.00017347178,0.0004296172,0.011898974],"genre_scores_gemma":[0.95940065,0.000006394508,0.040029377,0.000034575023,0.00011783227,0.000032310352,0.000050657116,0.000018741175,0.0003094664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940217,0.000004204753,0.00020081644,0.00009081289,0.000103881524,0.00019811129],"domain_scores_gemma":[0.9994566,0.00003785509,0.000021275584,0.0002576833,0.00011339401,0.00011318742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008851134,0.00011002996,0.00015684798,0.000067048044,0.00011256076,0.00007028408,0.00012657113,0.00006317561,0.00035952244],"category_scores_gemma":[0.00018538669,0.0000914939,0.0000656077,0.0002932416,0.000018906729,0.00007975741,0.000021958958,0.00013939122,0.00020311902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004482604,0.00006224343,0.0001979216,0.00014023947,0.00024745657,0.0000047286253,0.0011985563,0.33969507,0.21081662,0.42709383,0.01755997,0.002978866],"study_design_scores_gemma":[0.00030633234,0.000019800116,0.00040090058,0.000029611012,0.000113197035,0.000012391986,0.00013432145,0.9283188,0.028843889,0.021651428,0.019727755,0.00044159527],"about_ca_topic_score_codex":0.0000025256072,"about_ca_topic_score_gemma":0.000025499436,"teacher_disagreement_score":0.83559585,"about_ca_system_score_codex":0.00003259179,"about_ca_system_score_gemma":0.000008705864,"threshold_uncertainty_score":0.39365184},"labels":[],"label_agreement":null},{"id":"W4413187066","doi":"10.55016/ojs/cdm.v3i2.61934","title":"Colourful transversal theorems","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Consejo Nacional de Ciencia y Tecnología","keywords":"Transversal (combinatorics); Mathematics; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.02085932868845986,"score_gpt":0.3110499104651051,"score_spread":0.29019058177664525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413187066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015750818,0.00006526293,0.976136,0.0024838112,0.0001095397,0.0005289917,0.00009842996,0.0002981409,0.0045289923],"genre_scores_gemma":[0.8869235,0.000020142863,0.1116948,0.00019567664,0.000050674116,0.000094713294,0.000009115695,0.000019615754,0.0009917739],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823207,0.000092213544,0.00032838105,0.00033611295,0.0004407087,0.00057051994],"domain_scores_gemma":[0.9979704,0.00039580633,0.0000660112,0.000936018,0.0003194448,0.00031229688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005090299,0.00018560709,0.00027300318,0.00018007339,0.00050984323,0.000083734696,0.0012314037,0.00007213012,0.000053731954],"category_scores_gemma":[0.00063677394,0.00015995771,0.0001377755,0.0009199492,0.00022907775,0.0003499892,0.0002545179,0.00020668707,0.00053028273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007764615,0.00008283349,0.00002434022,0.000009281917,0.000022875069,0.000034113862,0.0017808594,0.00014334309,0.0014718802,0.9950134,0.0010212949,0.0003880221],"study_design_scores_gemma":[0.0014901782,0.00038763296,0.00040611345,0.00007847475,0.000027213739,0.0003677415,0.00033608678,0.050890144,0.016037581,0.91066635,0.018500088,0.00081240205],"about_ca_topic_score_codex":0.000002182258,"about_ca_topic_score_gemma":0.0000025103213,"teacher_disagreement_score":0.87117267,"about_ca_system_score_codex":0.00011372748,"about_ca_system_score_gemma":0.00012830054,"threshold_uncertainty_score":0.6815888},"labels":[],"label_agreement":null},{"id":"W4413187079","doi":"10.55016/ojs/cdm.v3i2.61976","title":"A new example of non-amorphous association schemes","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Metallic Glasses and Amorphous Alloys","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Association (psychology); Association scheme; Mathematics; Combinatorics; Psychology","score_opus":0.013615699875301417,"score_gpt":0.24275314031093154,"score_spread":0.2291374404356301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413187079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28881428,0.0001638972,0.7064446,0.00015715988,0.0001904144,0.0003760869,0.00017718422,0.00021750573,0.003458897],"genre_scores_gemma":[0.9423116,0.00008032071,0.055236924,0.000027640399,0.00012986845,0.000031803145,0.000035954785,0.000040816874,0.0021051113],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99887645,0.000010060359,0.000411529,0.0001251563,0.00026797273,0.0003088138],"domain_scores_gemma":[0.9991184,0.00012711645,0.000097879616,0.00032961453,0.00015480503,0.00017219238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001840892,0.00016000395,0.00035591525,0.00008589532,0.000089111534,0.000020114525,0.00017250987,0.00009295831,0.00020844521],"category_scores_gemma":[0.00031950395,0.00015276734,0.00012464962,0.00032106048,0.00001547449,0.000078721154,0.000043381344,0.0001079765,0.0001838404],"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.00003189906,0.0006153419,0.004384114,0.0010965341,0.0019435696,0.00007001883,0.009376812,0.02723572,0.3538375,0.13662621,0.46024594,0.0045363484],"study_design_scores_gemma":[0.005641188,0.0004989562,0.011935194,0.0007254606,0.0007510208,0.00018538121,0.0006410407,0.22842202,0.251192,0.013415154,0.48382762,0.0027649624],"about_ca_topic_score_codex":0.00008646385,"about_ca_topic_score_gemma":0.000013539894,"teacher_disagreement_score":0.6534973,"about_ca_system_score_codex":0.00016934752,"about_ca_system_score_gemma":0.00006547789,"threshold_uncertainty_score":0.6229672},"labels":[],"label_agreement":null},{"id":"W4413187087","doi":"10.55016/ojs/cdm.v3i2.61942","title":"A generalization of the q-Pfaff-Saalschütz formula","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Generalization; Combinatorics; Pure mathematics; Mathematical analysis","score_opus":0.03814669208105149,"score_gpt":0.3229554187327102,"score_spread":0.28480872665165874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413187087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28989762,0.000107050095,0.6917642,0.0022487324,0.00041595963,0.002064601,0.0006248806,0.00019343873,0.01268354],"genre_scores_gemma":[0.9350119,0.00002711331,0.05889966,0.00022160224,0.00019771441,0.00020300543,0.000021210706,0.000059905495,0.0053578494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979431,0.000098742064,0.0009227445,0.0002144707,0.00044965415,0.0003713134],"domain_scores_gemma":[0.99735373,0.00068026,0.0003471677,0.0010035998,0.00045353742,0.00016169099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054253277,0.000245648,0.0005397465,0.00011451687,0.0004883908,0.000027205906,0.0004432385,0.00013106155,0.00035080747],"category_scores_gemma":[0.0042652953,0.00016025659,0.00031796127,0.0006952108,0.000161655,0.0001057005,0.000199214,0.00014505707,0.00009608076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008865767,0.00027588304,0.00012470092,0.00019968527,0.00007273577,0.0000012409002,0.0015175442,0.00006477469,0.0029988207,0.96838135,0.026285363,0.00006903763],"study_design_scores_gemma":[0.0014649301,0.00019046631,0.0005860276,0.00060077297,0.00047062483,0.0002054247,0.0004143908,0.009103871,0.044446092,0.9138084,0.027881192,0.00082778535],"about_ca_topic_score_codex":0.000010131955,"about_ca_topic_score_gemma":0.000011852496,"teacher_disagreement_score":0.6451143,"about_ca_system_score_codex":0.00009664722,"about_ca_system_score_gemma":0.00012407971,"threshold_uncertainty_score":0.6535074},"labels":[],"label_agreement":null},{"id":"W4413187090","doi":"10.55016/ojs/cdm.v3i2.61928","title":"Astral (n_4) configurations of pseudolines","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics","score_opus":0.012248130815646246,"score_gpt":0.2807685538845746,"score_spread":0.26852042306892837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413187090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04052421,0.00007245739,0.9557478,0.00025810683,0.00003354585,0.0002333146,0.00028719695,0.00041805318,0.0024253477],"genre_scores_gemma":[0.93397653,0.00003976077,0.06562157,0.000018136834,0.000040649673,0.000058488076,0.000037323898,0.000019810934,0.00018771816],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991231,0.000010066177,0.00041537377,0.00009981993,0.000145609,0.00020601785],"domain_scores_gemma":[0.9992399,0.00009203051,0.000053285476,0.00029663133,0.00021174614,0.00010641261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059354126,0.00013659193,0.00030959112,0.00010767426,0.00009187845,0.000007972588,0.00015392656,0.00005397806,0.000070196955],"category_scores_gemma":[0.0002827135,0.00012427782,0.00011127633,0.00042124133,0.00008832418,0.000092807684,0.000026269072,0.000091832684,0.000053302098],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025401068,0.0007106986,0.00071237993,0.0005499247,0.00084770925,0.000039400722,0.003782717,0.1328304,0.42297944,0.38739246,0.04758462,0.0025448413],"study_design_scores_gemma":[0.0012528673,0.000353977,0.0032996244,0.00038690088,0.00047032232,0.00019227363,0.0006355299,0.32846463,0.56132084,0.071651064,0.030142512,0.0018294315],"about_ca_topic_score_codex":0.0000026726775,"about_ca_topic_score_gemma":0.0000024455967,"teacher_disagreement_score":0.89345235,"about_ca_system_score_codex":0.000054429514,"about_ca_system_score_gemma":0.000017218632,"threshold_uncertainty_score":0.5067903},"labels":[],"label_agreement":null},{"id":"W4413187093","doi":"10.55016/ojs/cdm.v3i2.61940","title":"Partitions with parts occurring at most thrice","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Mathematics; Combinatorics","score_opus":0.0347983452105031,"score_gpt":0.32258155573633707,"score_spread":0.28778321052583394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413187093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28711954,0.00011868241,0.69046783,0.0011463006,0.00041243693,0.0026204642,0.0007624276,0.0011143822,0.016237944],"genre_scores_gemma":[0.8370794,0.000022868275,0.15947434,0.0002559185,0.00024971113,0.0007243922,0.000054497195,0.0001613747,0.0019774733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970157,0.00007203465,0.000867037,0.00048204078,0.00070741586,0.0008557533],"domain_scores_gemma":[0.99594563,0.0012281524,0.00038455767,0.0012990544,0.00066296966,0.00047963762],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003648611,0.00049626967,0.0007620782,0.0001695211,0.0011664475,0.00006386606,0.00047949975,0.00015149139,0.0001864225],"category_scores_gemma":[0.003023024,0.00041297261,0.00015587185,0.00093349774,0.00025104656,0.00028891148,0.00035416314,0.00029467064,0.0005320577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044401382,0.00066399324,0.00027733058,0.00023430395,0.00016555583,0.000098014025,0.0031646094,0.0003918342,0.00048669628,0.97811025,0.016326383,0.000036648853],"study_design_scores_gemma":[0.002306414,0.0003999476,0.000105941945,0.0006812438,0.0003948975,0.0007929673,0.0007439648,0.0017174531,0.0075524603,0.96543175,0.018501656,0.0013712978],"about_ca_topic_score_codex":0.000003962736,"about_ca_topic_score_gemma":0.000032583626,"teacher_disagreement_score":0.5499599,"about_ca_system_score_codex":0.00051331235,"about_ca_system_score_gemma":0.00015395271,"threshold_uncertainty_score":0.9998322},"labels":[],"label_agreement":null},{"id":"W4413187103","doi":"10.55016/ojs/cdm.v3i2.62003","title":"Partially critical indecomposable graphs","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Indecomposable module; Discrete mathematics","score_opus":0.028750634360140834,"score_gpt":0.34725951642660197,"score_spread":0.3185088820664611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413187103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007889304,0.00008773786,0.98479253,0.003670867,0.00014400695,0.0003890235,0.00007416357,0.0003028642,0.002649516],"genre_scores_gemma":[0.7965567,0.000015739837,0.20261692,0.0002622497,0.00004286569,0.00011520899,0.0000075007456,0.000017823431,0.00036497277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785405,0.00010703918,0.0004197899,0.000392683,0.0005045856,0.00072187406],"domain_scores_gemma":[0.9972211,0.00071199605,0.00005490565,0.00106318,0.00050048856,0.00044834192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000538977,0.00019607494,0.00030292483,0.00022779539,0.0006640312,0.00014128511,0.0011915343,0.00007994295,0.0000572959],"category_scores_gemma":[0.0022779787,0.00017714672,0.0001392314,0.0010664195,0.00029164468,0.0005104638,0.0005117576,0.00024497663,0.00062306],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048031106,0.00012168535,0.000103885504,0.000014231065,0.000015998927,0.000042020012,0.000491529,0.000120008626,0.00070389925,0.99667346,0.0014986116,0.00020987527],"study_design_scores_gemma":[0.00044978672,0.00017804108,0.00044400487,0.000054913413,0.000012815514,0.00019910566,0.000058629223,0.027717993,0.005699949,0.9595566,0.005208965,0.0004192291],"about_ca_topic_score_codex":0.0000022995334,"about_ca_topic_score_gemma":0.000003446144,"teacher_disagreement_score":0.78866744,"about_ca_system_score_codex":0.00008439885,"about_ca_system_score_gemma":0.00015447012,"threshold_uncertainty_score":0.80083835},"labels":[],"label_agreement":null},{"id":"W4413187115","doi":"10.55016/ojs/cdm.v3i2.61954","title":"Fold and Mycielskian on homomorphism complexes","year":2008,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Homomorphism; Mathematics; Combinatorics","score_opus":0.0393067653339557,"score_gpt":0.33852350369305195,"score_spread":0.29921673835909623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413187115","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50863314,0.00026635246,0.45867133,0.005210717,0.00028089,0.0014903824,0.00092462107,0.00055035355,0.023972215],"genre_scores_gemma":[0.9641697,0.00003728284,0.032588884,0.0005119815,0.000099294746,0.00007696976,0.000024022653,0.000038404145,0.0024535018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986501,0.00007179025,0.00039384942,0.00027979858,0.00019765014,0.00040682667],"domain_scores_gemma":[0.99791,0.0010745111,0.00012034582,0.0005367861,0.00013242214,0.00022593752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029728815,0.00025166685,0.0004536324,0.00012829254,0.00064406643,0.000020144633,0.00020819891,0.00013281805,0.00013501495],"category_scores_gemma":[0.0016598908,0.00021574706,0.00009578335,0.00019194299,0.0003640975,0.000087810266,0.000115195224,0.00022966112,0.00019025721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022192544,0.0001556489,0.000032282267,0.000034913788,0.00004377818,0.000033176697,0.0014042888,0.000007657225,0.00064026954,0.99212664,0.005394462,0.00010466795],"study_design_scores_gemma":[0.00077131577,0.00020561651,0.00019595331,0.0001015996,0.00006682668,0.0002606168,0.0003533127,0.00030543664,0.003259698,0.98899275,0.0051272954,0.00035957215],"about_ca_topic_score_codex":0.0000019449703,"about_ca_topic_score_gemma":0.0000052401288,"teacher_disagreement_score":0.45553654,"about_ca_system_score_codex":0.000068402594,"about_ca_system_score_gemma":0.000035443183,"threshold_uncertainty_score":0.87979096},"labels":[],"label_agreement":null},{"id":"W4415667357","doi":"10.55016/ojs/cdm.v20i2.62407","title":"Circuit partitions and signed interlacement in 4-regular graphs","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Partition (number theory); Connection (principal bundle); Electronic circuit; Space (punctuation); Topology (electrical circuits)","score_opus":0.028018082350575117,"score_gpt":0.35524941416446815,"score_spread":0.327231331813893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2497099,0.0026769189,0.68745816,0.014701466,0.0007600707,0.0108608585,0.0026381826,0.0003490426,0.030845374],"genre_scores_gemma":[0.9873126,0.00017619586,0.005453466,0.00029959678,0.00005400975,0.0010953641,0.00008959552,0.0000876437,0.0054314984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99416155,0.00061284914,0.0020849146,0.0009333187,0.00070257235,0.0015047926],"domain_scores_gemma":[0.9939009,0.0027922217,0.00030406125,0.0017371399,0.0007305688,0.00053512777],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032872497,0.0007420051,0.0013418582,0.0016184832,0.00052607636,0.0005100577,0.00083361537,0.00043577843,0.0014348084],"category_scores_gemma":[0.0069707655,0.00077455223,0.00032727708,0.002836878,0.0006676059,0.00028061296,0.0010681426,0.0008185445,0.0003144082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007865989,0.0011574574,0.00024800815,0.0014568216,0.00036914885,0.000029215145,0.004832863,0.000036222842,0.0016873117,0.98598135,0.0032134047,0.00090956513],"study_design_scores_gemma":[0.0026307858,0.00032304926,0.00021158044,0.0033259613,0.00047908264,0.00001371371,0.0053031533,0.0066165733,0.0018395854,0.97537774,0.0031378444,0.00074094004],"about_ca_topic_score_codex":0.00002390646,"about_ca_topic_score_gemma":0.00016815947,"teacher_disagreement_score":0.7376027,"about_ca_system_score_codex":0.0008831769,"about_ca_system_score_gemma":0.00042023647,"threshold_uncertainty_score":0.99947804},"labels":[],"label_agreement":null},{"id":"W4415667388","doi":"10.55016/ojs/cdm.v20i2.69074","title":"The asymmetric index of a graph","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Edge-transitive graph; Complement graph; Circulant graph; Line graph; Bipartite graph; Graph power; Graph; Regular graph; Voltage graph","score_opus":0.011353924765340829,"score_gpt":0.3217568904941336,"score_spread":0.3104029657287928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015041447,0.0030722397,0.9213086,0.010974086,0.000693405,0.0048010023,0.0022525054,0.0001744634,0.041682277],"genre_scores_gemma":[0.9881098,0.00035768497,0.0052068634,0.00015848136,0.000067401204,0.0006452354,0.000022350501,0.00004867078,0.005383459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99566907,0.00028958428,0.0020855844,0.00050051877,0.0005666208,0.00088861],"domain_scores_gemma":[0.9889006,0.0062306738,0.00079887005,0.0024072945,0.0013860682,0.00027647332],"candidate_categories":["metaresearch","metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0025341513,0.0005289204,0.000978482,0.00084462075,0.0017566151,0.00026367366,0.001525081,0.0003382438,0.000066868735],"category_scores_gemma":[0.008929289,0.0004115095,0.0007012641,0.006564931,0.0008010404,0.0001126171,0.000577006,0.0005549095,0.00014321454],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000422157,0.00062836177,0.00007267344,0.00046683813,0.0005574473,8.46143e-7,0.00070638035,0.00004266918,0.00025952325,0.986087,0.008338918,0.002797077],"study_design_scores_gemma":[0.0008052903,0.00009129081,0.00026871703,0.00076572306,0.0008491505,0.0000048858424,0.002054823,0.0027273535,0.0033410843,0.97048455,0.018231515,0.0003756059],"about_ca_topic_score_codex":0.000012864355,"about_ca_topic_score_gemma":0.000030323965,"teacher_disagreement_score":0.9730684,"about_ca_system_score_codex":0.00018485251,"about_ca_system_score_gemma":0.00040786646,"threshold_uncertainty_score":0.9998337},"labels":[],"label_agreement":null},{"id":"W4415667416","doi":"10.55016/ojs/cdm.v20i2.73059","title":"Diophantine equation with balancing-like sequences associated with the Shorey–Tijdeman-type problem","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Indian Institute of Science Education and Research Mohali; Indian Institute of Science Education and Research Bhopal","keywords":"Diophantine equation; Sequence (biology); Diophantine set; Legendre's equation; Thue equation; Integer (computer science)","score_opus":0.00935581411238532,"score_gpt":0.2839737622558756,"score_spread":0.2746179481434903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009687965,0.00021169418,0.9676966,0.01105234,0.00009564342,0.0032430543,0.0008394215,0.00012276096,0.0070504984],"genre_scores_gemma":[0.9794298,0.000017886709,0.012965819,0.00028245358,0.00014697603,0.0008058498,0.0003013139,0.000058817768,0.0059911055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997059,0.00012491831,0.0008494945,0.00060777453,0.00050670886,0.0008520865],"domain_scores_gemma":[0.9956128,0.0012935417,0.00058682536,0.0010071645,0.0012753031,0.0002243514],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00074177486,0.00061388756,0.0008309963,0.00010553363,0.0014630003,0.0004184097,0.0006529076,0.00013685694,0.00015033432],"category_scores_gemma":[0.0003342381,0.00036488893,0.00016198747,0.0022873038,0.00056448655,0.00023857411,0.00023499386,0.00048026483,0.000103961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084022526,0.0004578148,0.0001035027,0.00014271414,0.0006988797,0.0000015628759,0.0010524818,0.0029881229,0.000330551,0.9923536,0.0011769413,0.00060976425],"study_design_scores_gemma":[0.0033593304,0.0014512207,0.00024582035,0.005720191,0.0029268945,0.000008178323,0.011145637,0.04595763,0.003814153,0.8910564,0.032409184,0.0019053228],"about_ca_topic_score_codex":0.000012588481,"about_ca_topic_score_gemma":0.000038490478,"teacher_disagreement_score":0.9697418,"about_ca_system_score_codex":0.00024195801,"about_ca_system_score_gemma":0.00048680254,"threshold_uncertainty_score":0.9998803},"labels":[],"label_agreement":null},{"id":"W4415667420","doi":"10.55016/ojs/cdm.v20i2.73928","title":"On emulational equivalence of impartial games and the game Hackenforb","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Serbian Academy of Sciences and Arts; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja","keywords":"Equivalence (formal languages); Isomorphism (crystallography); Equivalence class (music); Combinatorial game theory; Set (abstract data type); Core (optical fiber); Class (philosophy)","score_opus":0.019741303325044694,"score_gpt":0.3407739352407661,"score_spread":0.3210326319157214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02850515,0.0007526203,0.9504484,0.0154244695,0.0006376877,0.0014465435,0.0003263349,0.000055647524,0.0024031312],"genre_scores_gemma":[0.99295664,0.00007947087,0.0051999134,0.0005189438,0.00008371353,0.0001018262,0.000005435432,0.000012299268,0.0010417799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660575,0.00023950094,0.0013835432,0.0005509417,0.00061788183,0.0006023606],"domain_scores_gemma":[0.99346954,0.0037213962,0.0004576427,0.0012958045,0.0008709058,0.00018469535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015432425,0.0003798019,0.00072753365,0.000274673,0.00048571703,0.00043205413,0.0013498918,0.0001616693,0.00010642315],"category_scores_gemma":[0.0064705894,0.0002764057,0.0002725019,0.0011066751,0.0015655732,0.00030232305,0.0010146302,0.00033019792,0.00011892453],"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.000118430915,0.00013894633,0.000035053075,0.00010600651,0.00011040773,0.0000015220968,0.0042523993,0.00558816,0.00015897382,0.9829722,0.00092378975,0.005594118],"study_design_scores_gemma":[0.00054158905,0.00013511056,0.00021303137,0.0007066624,0.00012740883,0.000004663042,0.00033325932,0.50077456,0.005677852,0.49078208,0.0004795803,0.00022417468],"about_ca_topic_score_codex":0.00003215243,"about_ca_topic_score_gemma":0.000014377849,"teacher_disagreement_score":0.9644515,"about_ca_system_score_codex":0.00014677843,"about_ca_system_score_gemma":0.0004031793,"threshold_uncertainty_score":0.9999688},"labels":[],"label_agreement":null},{"id":"W4415667423","doi":"10.55016/ojs/cdm.v20i2.73655","title":"On next-to-minimum size blocking sets of external lines to a nondegenerate quadric in $\\operatorname{PG}(3,q)$","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Science and Engineering Research Board; National Institute of Science Education and Research; Council of Scientific and Industrial Research, India","keywords":"Quadric; Blocking (statistics); Set (abstract data type); Interval (graph theory); Plane (geometry); Blocking set; Type (biology)","score_opus":0.020591323464272598,"score_gpt":0.33635225570240923,"score_spread":0.3157609322381366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667423","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82438236,0.00052294176,0.1628531,0.0034909223,0.0009164609,0.0040618316,0.0017530617,0.000113425995,0.0019058965],"genre_scores_gemma":[0.96496683,0.00004332148,0.028557777,0.0023070355,0.00020657227,0.0005115814,0.000017853916,0.00013412497,0.0032549053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9925348,0.0005677252,0.0032707925,0.0011636943,0.0009141565,0.0015488188],"domain_scores_gemma":[0.99150527,0.0036615352,0.0005424805,0.0020419136,0.001342612,0.0009061874],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027463296,0.0011413976,0.002428961,0.0012259654,0.00053599005,0.00042789563,0.0014150013,0.00058760354,0.0005610018],"category_scores_gemma":[0.016134297,0.0010913152,0.00048438896,0.0035294981,0.0002057117,0.00021777261,0.00092120754,0.00088132115,0.0008187737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082887424,0.0033922067,0.00029906377,0.0019791715,0.00049335003,0.00016422,0.017946724,0.007491302,0.10655718,0.85161567,0.007766338,0.0014658873],"study_design_scores_gemma":[0.015694266,0.0048749144,0.0012050231,0.057711095,0.0029300721,0.00011523871,0.015870847,0.08804108,0.3038555,0.49612483,0.0059394967,0.0076376023],"about_ca_topic_score_codex":0.000035103145,"about_ca_topic_score_gemma":0.00012322514,"teacher_disagreement_score":0.35549083,"about_ca_system_score_codex":0.0008337714,"about_ca_system_score_gemma":0.0008592227,"threshold_uncertainty_score":0.99995923},"labels":[],"label_agreement":null},{"id":"W4415667429","doi":"10.55016/ojs/cdm.v20i2.75363","title":"A bijection between the sets of $(a,b,b^2)$-generalized Motzkin paths avoiding $\\mathrm{uvv}$-patterns and $\\mathrm{uvu}$-patterns","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bijection; Path (computing); Quadrant (abdomen); Set (abstract data type); Lattice (music)","score_opus":0.022242724697021002,"score_gpt":0.34044089280391293,"score_spread":0.31819816810689194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39904025,0.0007121566,0.5856698,0.0030953228,0.0014425493,0.004783526,0.004246386,0.00029478592,0.0007151973],"genre_scores_gemma":[0.9770444,0.00060642173,0.019796876,0.00018975293,0.00043124091,0.00063178677,0.00014250775,0.00026044843,0.0008965541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98944443,0.0011133468,0.004608628,0.0014324426,0.0015043544,0.0018967941],"domain_scores_gemma":[0.9845607,0.0073345588,0.0024046707,0.003404391,0.0016608057,0.00063485425],"candidate_categories":["metaresearch","metaepi_narrow","sts"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0040662154,0.0017354072,0.0033943818,0.0010277159,0.0019833103,0.00063173485,0.0018629945,0.00093783025,0.00013441902],"category_scores_gemma":[0.011291815,0.0014633348,0.00089981954,0.0023537888,0.000618242,0.0005420899,0.002030993,0.0016909813,0.000080375044],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012487009,0.0013224529,0.0030923223,0.009276046,0.0021318577,0.000022084216,0.015965112,0.00023112568,0.0025841277,0.9612941,0.0013019438,0.0026539546],"study_design_scores_gemma":[0.005524466,0.00064501556,0.0019514812,0.010822112,0.0049285004,0.00006343291,0.010032584,0.017855601,0.019442257,0.9246715,0.0018212715,0.002241821],"about_ca_topic_score_codex":0.00013208327,"about_ca_topic_score_gemma":0.00008488083,"teacher_disagreement_score":0.5780042,"about_ca_system_score_codex":0.0009939234,"about_ca_system_score_gemma":0.00051448785,"threshold_uncertainty_score":0.9995392},"labels":[],"label_agreement":null},{"id":"W4415667431","doi":"10.55016/ojs/cdm.v20i2.76082","title":"On a construction of self-orthogonal codes from orbit matrices of 2-designs","year":2025,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Orbit (dynamics); Construct (python library); Point (geometry); Matrix (chemical analysis); Block code; Linear code","score_opus":0.006254058590538595,"score_gpt":0.2414348782628296,"score_spread":0.235180819672291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667431","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67859656,0.0003017596,0.31371212,0.000050172566,0.0002560688,0.00039657278,0.00156311,0.00017937666,0.0049442397],"genre_scores_gemma":[0.9922132,0.000015742904,0.007636409,0.0000074080044,0.000018042101,0.00003470953,0.000031722928,0.000010770567,0.00003201832],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907607,0.000041315605,0.00048321811,0.00011008628,0.0001407556,0.00014853053],"domain_scores_gemma":[0.9989908,0.00042702458,0.000099080054,0.00028893378,0.00014532483,0.00004885688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020540647,0.0001384276,0.00036724718,0.00019491464,0.000056321653,0.000016006228,0.00015409592,0.000087698114,0.000048456015],"category_scores_gemma":[0.00015840544,0.00012750516,0.000109822526,0.00042794712,0.000059323564,0.000046589954,0.000024339197,0.00008434236,0.000016865244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018860148,0.00007675859,0.00015789861,0.00037259172,0.00027965975,9.781509e-7,0.0005048703,0.0020942313,0.00965866,0.98619825,0.00047618226,0.00016104788],"study_design_scores_gemma":[0.0015962315,0.00022881042,0.0011957325,0.0025194762,0.0007010892,0.000012331305,0.002297907,0.04277004,0.19550744,0.7514515,0.0011081189,0.00061133545],"about_ca_topic_score_codex":0.0000063262264,"about_ca_topic_score_gemma":0.000004386415,"teacher_disagreement_score":0.3136166,"about_ca_system_score_codex":0.000046817266,"about_ca_system_score_gemma":0.00003123425,"threshold_uncertainty_score":0.5199509},"labels":[],"label_agreement":null},{"id":"W4415667433","doi":"10.55016/ojs/cdm.v20i2.74008","title":"Dyck paths with first sojourn highest","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Catalan number; Catalan; Path (computing); Quadrant (abdomen); Lattice (music)","score_opus":0.011257386304767768,"score_gpt":0.311550056254027,"score_spread":0.30029266994925924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053150454,0.00089824037,0.9435347,0.01778135,0.0023077752,0.0061910157,0.0016695061,0.00076967455,0.021532735],"genre_scores_gemma":[0.6158625,0.00046689235,0.35475537,0.0008285769,0.0009481677,0.0017953563,0.00013366542,0.0006292217,0.024580278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9913254,0.00024688875,0.0032012546,0.001427048,0.0014757059,0.0023237101],"domain_scores_gemma":[0.98556757,0.0055368743,0.0013919125,0.0039698957,0.002518625,0.0010151506],"candidate_categories":["metaresearch","metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0015265025,0.0018023439,0.0028236634,0.000910745,0.0019732967,0.00087265315,0.0020595111,0.0008147108,0.00046956787],"category_scores_gemma":[0.012400325,0.0015837814,0.00065657025,0.0035125487,0.0006369256,0.0005781412,0.0012297918,0.0013339532,0.0011730869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015245905,0.0021270742,0.000064289954,0.0041070012,0.0010228915,0.000083767074,0.003174047,0.0005437467,0.00015501225,0.96042615,0.027808221,0.00033535121],"study_design_scores_gemma":[0.0050347224,0.0008632749,0.00005316613,0.011615177,0.0028703092,0.000099306126,0.0028860797,0.0077228346,0.0025648545,0.9016745,0.06235607,0.0022596908],"about_ca_topic_score_codex":0.000014297375,"about_ca_topic_score_gemma":0.00016334734,"teacher_disagreement_score":0.6105474,"about_ca_system_score_codex":0.0019232031,"about_ca_system_score_gemma":0.0013823602,"threshold_uncertainty_score":0.99960464},"labels":[],"label_agreement":null},{"id":"W4415667464","doi":"10.55016/ojs/cdm.v20i2.76852","title":"Colourings of aperiodic tilings","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"MacEwan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Aperiodic graph; Substitution tiling; Enhanced Data Rates for GSM Evolution; Face (sociological concept); Quasicrystal","score_opus":0.0077740494361308995,"score_gpt":0.28917356031752317,"score_spread":0.28139951088139226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8953493,0.003418889,0.077884145,0.0055576074,0.001571213,0.0022541813,0.0031793744,0.0001320124,0.010653238],"genre_scores_gemma":[0.99029505,0.000081057486,0.0054042893,0.00028736345,0.00007451316,0.00006545072,0.000014519002,0.00002284858,0.0037549003],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99709284,0.00010175626,0.0012617701,0.0004593294,0.00040580888,0.0006785028],"domain_scores_gemma":[0.9975399,0.00030075703,0.0003873132,0.0008166392,0.0007356946,0.00021971088],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007732779,0.00039575066,0.000909803,0.00022333502,0.00055677997,0.0003019557,0.0007710432,0.00024124722,0.0011302094],"category_scores_gemma":[0.0015266883,0.00033470133,0.0002642285,0.0008125424,0.0005528851,0.00015669179,0.0006020703,0.00021161941,0.0001852163],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020036203,0.00029333052,0.000090632115,0.0024574257,0.00018569696,0.0000060052566,0.006082826,0.0002892985,0.6411966,0.3434161,0.0047437856,0.0010379686],"study_design_scores_gemma":[0.001663682,0.0006294961,0.0005501884,0.0036412536,0.00078074966,0.00001807815,0.002821746,0.004979959,0.8196926,0.09537609,0.06885144,0.0009946829],"about_ca_topic_score_codex":0.00008370909,"about_ca_topic_score_gemma":0.000015788017,"teacher_disagreement_score":0.24803999,"about_ca_system_score_codex":0.00021895401,"about_ca_system_score_gemma":0.00041796963,"threshold_uncertainty_score":0.9999105},"labels":[],"label_agreement":null},{"id":"W4415667466","doi":"10.55016/ojs/cdm.v20i2.76682","title":"A generalization of the Beraha–Kahane–Weiss theorem with graph polynomial applications","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chromatic polynomial; Tutte polynomial; Factor theorem; Graph property; Graph; Voltage graph; Polynomial; Generalization; Cubic graph","score_opus":0.007507840799624974,"score_gpt":0.2952647826141136,"score_spread":0.28775694181448863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009580701,0.0005454444,0.96926457,0.0032877468,0.0008244073,0.008157125,0.0015556841,0.00019877715,0.006585542],"genre_scores_gemma":[0.8684988,0.00014025977,0.120623164,0.00040283782,0.0004702258,0.0026587306,0.00010218251,0.00027600717,0.0068277796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942021,0.00035969223,0.0025010945,0.0008292658,0.001064477,0.0010433741],"domain_scores_gemma":[0.9905068,0.0017903552,0.0016592798,0.0035483323,0.0021676337,0.00032756294],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010692098,0.0009817868,0.001634246,0.00053534855,0.0011880335,0.00024050637,0.001970795,0.0005004293,0.000098155535],"category_scores_gemma":[0.0029369742,0.00071744627,0.00061992987,0.004431779,0.0009120079,0.00025858093,0.0009308184,0.000645266,0.000054519693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008769291,0.0011565303,0.00005594774,0.0016674157,0.0006067237,0.0000014243735,0.0021148794,0.0010282472,0.0019165995,0.9881303,0.0027872103,0.0004470471],"study_design_scores_gemma":[0.002600993,0.0002458035,0.000047553494,0.003077634,0.0024248597,0.000026044316,0.0016879413,0.005156601,0.026252054,0.9494231,0.008108319,0.00094913325],"about_ca_topic_score_codex":0.000016036443,"about_ca_topic_score_gemma":0.000048100675,"teacher_disagreement_score":0.85891813,"about_ca_system_score_codex":0.0006628608,"about_ca_system_score_gemma":0.00094711996,"threshold_uncertainty_score":0.9995277},"labels":[],"label_agreement":null},{"id":"W4415667470","doi":"10.55016/ojs/cdm.v20i2.76744","title":"Asymptotic estimate on the distance energy of lattices","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Moment (physics); Moment problem; Second moment of area; Energy (signal processing); Lattice (music); Hexagonal crystal system","score_opus":0.020254120157955725,"score_gpt":0.33498349880587436,"score_spread":0.3147293786479186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034332355,0.00027367298,0.9028274,0.016060662,0.00038970794,0.0018538259,0.0009770072,0.00013515599,0.07404935],"genre_scores_gemma":[0.9278977,0.00010280365,0.0481017,0.0015169323,0.00013626962,0.00072327274,0.000079417405,0.00010414906,0.021337746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99494064,0.0003440097,0.002428575,0.0005977494,0.0009228356,0.000766203],"domain_scores_gemma":[0.98967856,0.0058321063,0.0010100938,0.0019784027,0.001246724,0.00025411305],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016972518,0.0007374242,0.0013140994,0.00039494183,0.0006945764,0.00034137728,0.0011386003,0.00033478477,0.0011181803],"category_scores_gemma":[0.013256392,0.00049319444,0.0005234994,0.0017122437,0.0005098057,0.00019606546,0.00032916752,0.00046880712,0.0003221039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052359752,0.0010154701,0.000004993038,0.0013598925,0.0003182956,0.0000013731374,0.0011389742,0.00006074549,0.0002762591,0.9829219,0.012078991,0.0007707359],"study_design_scores_gemma":[0.0005975065,0.00021930771,0.000019727468,0.0043230182,0.00062028616,0.000003267709,0.0010247068,0.13646539,0.013709762,0.8340429,0.008515985,0.00045813687],"about_ca_topic_score_codex":0.000012675217,"about_ca_topic_score_gemma":0.000034212262,"teacher_disagreement_score":0.92446446,"about_ca_system_score_codex":0.00032277062,"about_ca_system_score_gemma":0.0003088255,"threshold_uncertainty_score":0.99979496},"labels":[],"label_agreement":null},{"id":"W4415667471","doi":"10.55016/ojs/cdm.v20i2.75933","title":"Construction of (a, b, c) tilings of the Euclidean plane, hyperbolic plane, and the sphere","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Square tiling; Substitution tiling; Euclidean geometry; Hyperbolic geometry; Plane (geometry); Hexagonal tiling; Hyperbolic triangle; Symmetry (geometry)","score_opus":0.005575557297873989,"score_gpt":0.24219341670897027,"score_spread":0.23661785941109628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667471","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9771895,0.0033157733,0.004998469,0.0045526624,0.00096526823,0.0018664444,0.0027563486,0.00002592616,0.00432965],"genre_scores_gemma":[0.9971278,0.00020663292,0.0018293462,0.00013465658,0.000056302084,0.000024229223,0.000007934465,0.000012938415,0.0006001949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99768543,0.00026611806,0.001066518,0.000280749,0.0003511646,0.00035000755],"domain_scores_gemma":[0.99751663,0.0006816451,0.0005887625,0.0007693976,0.00036362337,0.00007995335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009043966,0.00028736686,0.0007634851,0.00006237923,0.00055321533,0.00013623356,0.00063962326,0.00016553319,0.0002302006],"category_scores_gemma":[0.0014469471,0.00015122366,0.00018706854,0.0004835443,0.0021934614,0.000086791464,0.0004955428,0.00021654386,0.000007888632],"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.00042997402,0.000061560335,0.00028584703,0.0010731615,0.00017094462,6.110374e-7,0.004137267,0.00013512957,0.057736523,0.93397516,0.0007343823,0.0012594606],"study_design_scores_gemma":[0.007142348,0.00036074594,0.0033863487,0.0048609558,0.002112563,0.00016965649,0.014115224,0.0054135234,0.52451044,0.4154239,0.021598432,0.0009058766],"about_ca_topic_score_codex":0.00027187783,"about_ca_topic_score_gemma":0.000083413666,"teacher_disagreement_score":0.51855123,"about_ca_system_score_codex":0.000050125247,"about_ca_system_score_gemma":0.00021606976,"threshold_uncertainty_score":0.80819005},"labels":[],"label_agreement":null},{"id":"W4415667475","doi":"10.55016/ojs/cdm.v20i2.77499","title":"About the second neighborhood conjecture for tournaments missing two stars or disjoint paths","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conjecture; Disjoint sets; Vertex (graph theory); Graph; Simple (philosophy); Property (philosophy)","score_opus":0.024747095572057655,"score_gpt":0.36404841140807986,"score_spread":0.3393013158360222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026064378,0.0018843444,0.9691604,0.015585595,0.0010545554,0.005200811,0.0028570325,0.00013255983,0.0015182762],"genre_scores_gemma":[0.7899928,0.0001818266,0.16570556,0.0055411896,0.00060992385,0.0020925456,0.00013888002,0.00018822966,0.035549007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942041,0.00045512948,0.0016074771,0.0010971292,0.00080373057,0.0018324192],"domain_scores_gemma":[0.9911385,0.00365225,0.00056912465,0.0026177529,0.0012997624,0.00072257343],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022642475,0.0007797949,0.0010486075,0.00043979575,0.002724634,0.0019355598,0.0030632338,0.00024159762,0.0003637595],"category_scores_gemma":[0.006059659,0.0005181168,0.0005861632,0.0023448558,0.0005659256,0.0005943609,0.00156328,0.0008932965,0.00007205101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002760235,0.00041904318,0.00003920121,0.00074942247,0.00060129614,0.000027724524,0.006045092,0.00046957278,0.0013153816,0.9513031,0.0063680406,0.032386083],"study_design_scores_gemma":[0.0040010107,0.00066979416,0.0000552792,0.0019618445,0.00028167502,0.000047800997,0.002118425,0.26133287,0.0036631695,0.67397505,0.050979346,0.0009137489],"about_ca_topic_score_codex":0.000003341838,"about_ca_topic_score_gemma":0.000057182016,"teacher_disagreement_score":0.8034548,"about_ca_system_score_codex":0.0007287415,"about_ca_system_score_gemma":0.001693399,"threshold_uncertainty_score":0.9997271},"labels":[],"label_agreement":null},{"id":"W4415667477","doi":"10.55016/ojs/cdm.v20i2.77187","title":"Applications via series accelerations of new identities involving Catalan-type numbers","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Catalan number; Series (stratigraphy); Identity (music); Convergence (economics); Hypergeometric function; Geometric series; Acceleration; Algebra over a field","score_opus":0.02112979548390114,"score_gpt":0.35226019972283507,"score_spread":0.3311304042389339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667477","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022819154,0.0025289953,0.969517,0.0025489246,0.0007692028,0.0045150113,0.0015347484,0.00035983056,0.015944352],"genre_scores_gemma":[0.2356129,0.0018387565,0.36078814,0.0003592837,0.0008512085,0.0018219097,0.0007014579,0.00040796807,0.39761838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939253,0.00014060318,0.0031491877,0.00080233417,0.00088081363,0.0011017779],"domain_scores_gemma":[0.9917837,0.0018513169,0.0010931322,0.0023377233,0.0023750542,0.0005591226],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007900809,0.000920316,0.0018560347,0.0008360386,0.0011011431,0.0005964652,0.0013787635,0.00047445775,0.000751357],"category_scores_gemma":[0.0066514034,0.0009920141,0.00054585526,0.0029502157,0.0007839681,0.0012588551,0.0010679743,0.00059996755,0.00047980557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034147517,0.0006250716,0.000034160636,0.003752467,0.0006592051,0.0000038179523,0.005700285,0.00018887747,0.0031153893,0.9637059,0.021907825,0.0002728592],"study_design_scores_gemma":[0.0007943424,0.00012822678,0.000021033818,0.0020817285,0.0015195742,0.000030883377,0.00703606,0.0015033795,0.017641598,0.9579228,0.010493461,0.00082691206],"about_ca_topic_score_codex":0.00008859519,"about_ca_topic_score_gemma":0.00028627066,"teacher_disagreement_score":0.6087289,"about_ca_system_score_codex":0.00072399824,"about_ca_system_score_gemma":0.0012656684,"threshold_uncertainty_score":0.99925303},"labels":[],"label_agreement":null},{"id":"W4415667478","doi":"10.55016/ojs/cdm.v20i2.77218","title":"Linear arboricity of the tensor products of complete multipartite graphs","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Arboricity; Multipartite; Conjecture; Tensor product; Degeneracy (biology); Partition (number theory); 1-planar graph; Graph","score_opus":0.0431357673187249,"score_gpt":0.35780819350209925,"score_spread":0.3146724261833743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7314856,0.0018442245,0.19803582,0.016856665,0.0020145045,0.018269151,0.021592129,0.00025309203,0.009648797],"genre_scores_gemma":[0.9713857,0.00006278861,0.024686439,0.00009804504,0.00008666036,0.00019582114,0.000031884847,0.00008101093,0.0033716576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99323255,0.00079995417,0.0028906045,0.00071900786,0.001240653,0.001117227],"domain_scores_gemma":[0.9868274,0.0037110243,0.0012852774,0.003649624,0.004274903,0.00025177406],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003253758,0.00068108976,0.0018566342,0.00065755553,0.0005807245,0.00007379607,0.0020864534,0.000367559,0.00014889958],"category_scores_gemma":[0.033689342,0.00051270373,0.00076358113,0.0049134046,0.0015350969,0.0001458145,0.0015807584,0.00086858385,0.00009301499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019527777,0.0018746788,0.0007441001,0.006367204,0.00082596485,0.0000026610833,0.002984771,0.00024540184,0.035864033,0.94793564,0.0027995806,0.00016067462],"study_design_scores_gemma":[0.004037021,0.0006025825,0.0031694325,0.007946243,0.0024432242,0.000014595983,0.0023455655,0.048425,0.22067057,0.7028863,0.0062683276,0.0011911677],"about_ca_topic_score_codex":0.00003492563,"about_ca_topic_score_gemma":0.000024807336,"teacher_disagreement_score":0.24504937,"about_ca_system_score_codex":0.00029293098,"about_ca_system_score_gemma":0.0007828144,"threshold_uncertainty_score":0.99973243},"labels":[],"label_agreement":null},{"id":"W4415667486","doi":"10.55016/ojs/cdm.v20i2.77376","title":"Cayley graphs of order $8pq$ are hamiltonian","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"European Commission","keywords":"Cayley graph; Cayley's theorem; Vertex-transitive graph; Cayley transform; Hamiltonian (control theory); Graph; Order (exchange); Hamiltonian path; Finite group","score_opus":0.02444645571086837,"score_gpt":0.36110734030695874,"score_spread":0.33666088459609034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18817237,0.0039855377,0.6835301,0.01649988,0.002084306,0.0128732035,0.017392315,0.00067645847,0.07478585],"genre_scores_gemma":[0.93342227,0.00025709945,0.04436606,0.00038265108,0.000136673,0.00055967836,0.00012823167,0.0002202869,0.020527028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99218637,0.00064763275,0.0029835072,0.0010268177,0.0013269029,0.001828795],"domain_scores_gemma":[0.9865738,0.0039408896,0.0010870148,0.0035172426,0.004224056,0.0006569648],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0033765815,0.0010263942,0.0023713068,0.0016373674,0.00083997665,0.00032753646,0.0019793068,0.0007494078,0.0011351567],"category_scores_gemma":[0.022956172,0.0010090375,0.00079606456,0.0057669855,0.0010322124,0.00026439954,0.0014476485,0.0011288003,0.00071173493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015337594,0.0016061618,0.00038392513,0.00417789,0.0010732571,0.000027359669,0.003316929,0.000086607935,0.0022756457,0.9741822,0.012169107,0.0005475433],"study_design_scores_gemma":[0.0031555817,0.00041864347,0.0007187149,0.006655108,0.0015119176,0.00002295854,0.0069913208,0.008583768,0.010796837,0.95077336,0.009049005,0.0013227804],"about_ca_topic_score_codex":0.000043965763,"about_ca_topic_score_gemma":0.0001502674,"teacher_disagreement_score":0.7452499,"about_ca_system_score_codex":0.00067495415,"about_ca_system_score_gemma":0.0010866012,"threshold_uncertainty_score":0.9997779},"labels":[],"label_agreement":null},{"id":"W4415667488","doi":"10.55016/ojs/cdm.v20i2.77546","title":"Identities involving trigonometric, zeta and partition functions","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Partition (number theory); Trigonometry; Riemann zeta function; Trigonometric functions; Partition function (quantum field theory); Lambda; Proofs of trigonometric identities; Arithmetic zeta function","score_opus":0.021110006893931024,"score_gpt":0.34115697669504236,"score_spread":0.32004696980111136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020391451,0.00804113,0.9328432,0.00403367,0.0015053346,0.0037397938,0.0025319215,0.00056113966,0.026352378],"genre_scores_gemma":[0.7051698,0.0030886182,0.070121564,0.0005867476,0.00065537053,0.0018498736,0.00026933977,0.00030820572,0.21795046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99411017,0.00023726448,0.0025514285,0.0009996137,0.0007625057,0.0013390401],"domain_scores_gemma":[0.99193275,0.00387738,0.0006880953,0.0016024931,0.0012925634,0.0006067108],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015762355,0.0009576158,0.0017454936,0.0018314805,0.0016884586,0.0013406146,0.00068120344,0.00048799542,0.00077368895],"category_scores_gemma":[0.018579211,0.0009939747,0.00048316963,0.0030996972,0.0007666397,0.0011110224,0.0011830515,0.000719408,0.0007314216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003135358,0.00065406575,0.00006378977,0.0032196997,0.0005919382,0.000010606371,0.0020010085,0.000060350914,0.00059670676,0.9717678,0.020568704,0.00043397967],"study_design_scores_gemma":[0.0013913868,0.00019902445,0.00011709285,0.0027724453,0.0020011095,0.00003392479,0.008601984,0.007208212,0.0012982133,0.9696397,0.005760623,0.00097629096],"about_ca_topic_score_codex":0.000016282213,"about_ca_topic_score_gemma":0.000054282387,"teacher_disagreement_score":0.8627216,"about_ca_system_score_codex":0.0009081819,"about_ca_system_score_gemma":0.0003592973,"threshold_uncertainty_score":0.9996961},"labels":[],"label_agreement":null},{"id":"W4415667492","doi":"10.55016/ojs/cdm.v20i2.78009","title":"An Ehrhart theoretic approach to generalized Golomb rulers","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Golomb coding; Pairwise comparison; Polytope; Sequence (biology); Type (biology)","score_opus":0.01691262685178807,"score_gpt":0.33990114855736725,"score_spread":0.3229885217055792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667492","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020497737,0.00037624294,0.92430145,0.0031584413,0.002193085,0.008590819,0.001888584,0.0008345949,0.038159076],"genre_scores_gemma":[0.43202055,0.00009232502,0.5549202,0.0014923732,0.0006414531,0.0023092334,0.00026544463,0.00044154451,0.007816865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98943305,0.0007731938,0.0036742063,0.001990081,0.0014887089,0.0026407887],"domain_scores_gemma":[0.9873235,0.0020442451,0.0009399263,0.005679717,0.0021451106,0.0018674792],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0029397006,0.0019171768,0.0031862229,0.0012631421,0.0014162296,0.001040468,0.0032929846,0.0009858361,0.0003255617],"category_scores_gemma":[0.012372048,0.0018957625,0.000862508,0.004038911,0.000577728,0.00059804425,0.0013262825,0.001155164,0.0012340696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015161672,0.003472843,0.0000078168205,0.0019799117,0.0005904216,0.000009944299,0.006699952,0.0017779632,0.002108292,0.9718378,0.010972152,0.000391293],"study_design_scores_gemma":[0.0031860597,0.0005757403,0.0000135225255,0.0017745418,0.0018013321,0.000029767354,0.0035967426,0.054180346,0.004719188,0.91871613,0.009351829,0.002054819],"about_ca_topic_score_codex":0.000012470675,"about_ca_topic_score_gemma":0.0000066156654,"teacher_disagreement_score":0.4115228,"about_ca_system_score_codex":0.0018381901,"about_ca_system_score_gemma":0.00088470307,"threshold_uncertainty_score":0.99999654},"labels":[],"label_agreement":null},{"id":"W4415667497","doi":"10.55016/ojs/cdm.v20i2.77509","title":"Covering the crosspolytope with crosspolytopes","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conjecture; Regular polygon; Convex body; Convex geometry; Type (biology)","score_opus":0.016130121680914926,"score_gpt":0.3397692729211006,"score_spread":0.32363915124018566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03689957,0.004189542,0.89247465,0.021424772,0.0008506263,0.0036239396,0.0030534046,0.0003240511,0.037159465],"genre_scores_gemma":[0.9156223,0.00029718148,0.013128368,0.0018243141,0.00038744675,0.0005957853,0.000046877223,0.00012509918,0.06797261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949097,0.0001569522,0.0017408873,0.00075407734,0.00089043676,0.0015479521],"domain_scores_gemma":[0.9919651,0.0033975143,0.000602246,0.0020932406,0.0016162797,0.00032560356],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002011173,0.00090159505,0.001332821,0.00057802175,0.0024599992,0.001914192,0.0015335918,0.00033161527,0.0004115365],"category_scores_gemma":[0.0075319433,0.0005773983,0.00039303215,0.0042185485,0.0007910644,0.00041657715,0.00090887677,0.0007661266,0.0003168015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001653051,0.00045324024,0.00010097361,0.002063053,0.0007931204,0.000018640369,0.0055199717,0.00036673844,0.00011654896,0.9766712,0.012329835,0.001401357],"study_design_scores_gemma":[0.0055939434,0.0010508344,0.0006102595,0.009401941,0.0036577135,0.00015266727,0.028654987,0.011317643,0.016038438,0.5670652,0.35329983,0.0031565558],"about_ca_topic_score_codex":0.00008694158,"about_ca_topic_score_gemma":0.00012785441,"teacher_disagreement_score":0.87934625,"about_ca_system_score_codex":0.00049769157,"about_ca_system_score_gemma":0.0009948981,"threshold_uncertainty_score":0.99966776},"labels":[],"label_agreement":null},{"id":"W4415667499","doi":"10.55016/ojs/cdm.v20i2.77435","title":"Combinatorics of certain classes of plane partitions","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Plane (geometry); Lattice (music); Recurrence relation; Enumerative combinatorics; Partition (number theory)","score_opus":0.02063832478237387,"score_gpt":0.35213868945420823,"score_spread":0.33150036467183436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027616037,0.0016175671,0.91645265,0.0027719422,0.0009428344,0.0038075314,0.0077636396,0.00021165101,0.038816158],"genre_scores_gemma":[0.9407917,0.00031082582,0.041253574,0.00005402075,0.000063206564,0.0002882013,0.00010582494,0.00009752868,0.017035093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937633,0.00022789737,0.003613754,0.0005530045,0.0008988711,0.0009431516],"domain_scores_gemma":[0.98849386,0.0054537505,0.0014451698,0.0019411527,0.0023194414,0.00034660083],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011232257,0.00072192465,0.0023868673,0.00080402324,0.00037400378,0.000103011786,0.001025226,0.00046206752,0.00046051768],"category_scores_gemma":[0.016363993,0.00072686345,0.00063485536,0.002245984,0.0009230426,0.00029607606,0.0007370301,0.000500981,0.000107875814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004118504,0.0021701236,0.00005866611,0.0077768425,0.0006169109,0.000005459529,0.0017279302,0.00020562908,0.0023338601,0.9782472,0.006749204,0.00006695959],"study_design_scores_gemma":[0.0012689205,0.00027986456,0.000048701342,0.004779219,0.0015506517,0.000007827057,0.004099863,0.0022116057,0.039286118,0.9440086,0.0019214724,0.0005371478],"about_ca_topic_score_codex":0.00002076133,"about_ca_topic_score_gemma":0.00003353971,"teacher_disagreement_score":0.9131757,"about_ca_system_score_codex":0.0004374984,"about_ca_system_score_gemma":0.0006338934,"threshold_uncertainty_score":0.9995182},"labels":[],"label_agreement":null},{"id":"W4415667510","doi":"10.55016/ojs/cdm.v20i2.77692","title":"Congruence properties modulo powers of 2 for partition pairs into distinct parts","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Centre Scientifique et Technique du Bâtiment; Chongqing Municipal Education Commission; National Natural Science Foundation of China; Chongqing Normal University","keywords":"Congruence relation; Modulo; Congruence (geometry); Partition (number theory); Integer (computer science)","score_opus":0.025206321514830907,"score_gpt":0.336200561591672,"score_spread":0.31099424007684107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025774866,0.0015522413,0.9541796,0.0035283884,0.0008127478,0.0074120346,0.0025299122,0.00028566326,0.0039245607],"genre_scores_gemma":[0.9174587,0.00009668845,0.072905675,0.00009047474,0.00011865006,0.0019912894,0.00009776044,0.00011689454,0.00712383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938535,0.0001896187,0.0030740863,0.0008670925,0.0007787184,0.0012369517],"domain_scores_gemma":[0.9912782,0.0028132088,0.0011025022,0.0017534088,0.0026339754,0.00041870654],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015117204,0.00091033336,0.002037326,0.00049486314,0.0008430233,0.0003047142,0.00096815993,0.0004230802,0.00018290576],"category_scores_gemma":[0.025440237,0.0008425842,0.0007384254,0.0010821614,0.0011611022,0.00056539633,0.0006231252,0.0003748036,0.00010426489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016937278,0.0011670585,0.00003388487,0.012366199,0.00061455986,0.000003153106,0.005766612,0.00037035588,0.0055059437,0.9677486,0.0057129203,0.000541338],"study_design_scores_gemma":[0.0013389954,0.00033628277,0.000024665382,0.0065051387,0.0013542972,0.0000054560605,0.0063670645,0.02316473,0.050241385,0.9066413,0.0032078947,0.0008127589],"about_ca_topic_score_codex":0.0000353699,"about_ca_topic_score_gemma":0.00011668631,"teacher_disagreement_score":0.8916839,"about_ca_system_score_codex":0.0007467543,"about_ca_system_score_gemma":0.00057330116,"threshold_uncertainty_score":0.9994025},"labels":[],"label_agreement":null},{"id":"W4415667515","doi":"10.55016/ojs/cdm.v20i2.79510","title":"Fibonacci numbers and n-color compositions","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Bijection; Rectangle; Composition (language); Tile; Type (biology); Generating function","score_opus":0.010623081193120451,"score_gpt":0.347479074236419,"score_spread":0.33685599304329855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0345469,0.001400709,0.898317,0.014096759,0.0025064875,0.006873125,0.002954555,0.00068733416,0.03861717],"genre_scores_gemma":[0.70241225,0.0003576103,0.2786929,0.0010422117,0.0004268927,0.0011931628,0.00013922148,0.00027681355,0.015458904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99410224,0.00025248266,0.0024082307,0.0010489342,0.0007398867,0.0014482448],"domain_scores_gemma":[0.99096394,0.004106158,0.00071958324,0.0020974816,0.0013351209,0.0007777456],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011157077,0.0011402142,0.001986173,0.00067851733,0.0015394444,0.00062471704,0.000987113,0.0006457716,0.00023752109],"category_scores_gemma":[0.008100482,0.0011905838,0.00045836507,0.002050116,0.0005878859,0.00041566652,0.0013327431,0.000872657,0.000474383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052826912,0.0010363986,0.000019622012,0.0017548413,0.0005749055,0.000017689634,0.0025498783,0.00007835525,0.0010006456,0.9801688,0.012304337,0.0004416689],"study_design_scores_gemma":[0.0025806536,0.0002633618,0.000046647056,0.0031976425,0.0017614536,0.000058784044,0.0026350962,0.011597286,0.0022068932,0.95820874,0.01624669,0.0011967744],"about_ca_topic_score_codex":0.00001702456,"about_ca_topic_score_gemma":0.000037802187,"teacher_disagreement_score":0.6678654,"about_ca_system_score_codex":0.0010518458,"about_ca_system_score_gemma":0.00053610216,"threshold_uncertainty_score":0.9997604},"labels":[],"label_agreement":null},{"id":"W4415667530","doi":"10.55016/ojs/cdm.v20i2.78838","title":"Congruence properties of 8- and 9-colored generalized Frobenius partitions modulo 5","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Centre Scientifique et Technique du Bâtiment; Chongqing Municipal Education Commission; National Natural Science Foundation of China","keywords":"Modulo; Congruence relation; Congruence (geometry); Characterization (materials science); Frobenius group; Generating function","score_opus":0.026906898225007178,"score_gpt":0.33024857039805644,"score_spread":0.30334167217304925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667530","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4931689,0.006219449,0.47798356,0.005392567,0.00067191233,0.0066294954,0.0033180625,0.00038835872,0.0062277005],"genre_scores_gemma":[0.9217191,0.000469473,0.066817716,0.0001431256,0.00007256882,0.00072695984,0.000022738697,0.000083717445,0.009944627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946847,0.00023597943,0.0026338582,0.0007635882,0.00065306097,0.0010288055],"domain_scores_gemma":[0.9942942,0.0011799745,0.0007824558,0.0015531868,0.0017499299,0.00044025198],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091158284,0.00080672564,0.0020355333,0.0005526951,0.00071662635,0.0003268285,0.0007339262,0.00040346253,0.00022707334],"category_scores_gemma":[0.01140099,0.0007423415,0.00039212813,0.0011867251,0.0013725953,0.00047875155,0.00094048143,0.00044372378,0.000091384674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087398585,0.00097628933,0.000024766554,0.0056924867,0.000668906,0.000008328822,0.0033192893,0.0004141772,0.019883938,0.9658394,0.0029247643,0.00016026892],"study_design_scores_gemma":[0.001891338,0.00016382478,0.000044918314,0.0057714107,0.0015994767,0.000018790266,0.003416031,0.024168175,0.070061356,0.8914692,0.00060210197,0.0007933992],"about_ca_topic_score_codex":0.000044702414,"about_ca_topic_score_gemma":0.00008067755,"teacher_disagreement_score":0.42855018,"about_ca_system_score_codex":0.00036426552,"about_ca_system_score_gemma":0.00045098268,"threshold_uncertainty_score":0.9995028},"labels":[],"label_agreement":null},{"id":"W4415667533","doi":"10.55016/ojs/cdm.v20i2.79191","title":"More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Degenerate energy levels; Time complexity; Set (abstract data type); Polynomial; Incentive; Approximation algorithm","score_opus":0.007930120359548974,"score_gpt":0.29739604898819866,"score_spread":0.28946592862864967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415667533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43206558,0.00051861885,0.5597556,0.0005096221,0.000020265172,0.0036896593,0.0030161545,0.000027948667,0.0003965254],"genre_scores_gemma":[0.96311796,0.000053513468,0.03612781,0.000009222478,0.000017053846,0.00039799343,0.00014672388,0.000019306312,0.00011041289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973715,0.000077764365,0.0014338177,0.0004684225,0.00021818448,0.00043033165],"domain_scores_gemma":[0.99686074,0.00043064993,0.00077517814,0.0006798164,0.0011520565,0.00010152908],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005751291,0.0003712354,0.0011284478,0.00050488394,0.00014319298,0.000060837043,0.0003568733,0.00010343498,0.0000034221673],"category_scores_gemma":[0.00018566694,0.00032343782,0.00018888188,0.0015802083,0.00049978256,0.00016270363,0.0002490488,0.0001961319,4.5410005e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012673622,0.0027388623,0.070367254,0.004004476,0.0029303946,0.0000011520656,0.0113195665,0.0032513593,0.0077232397,0.8869844,0.00063941145,0.008772506],"study_design_scores_gemma":[0.014319835,0.0017246051,0.026776547,0.029171368,0.0035009342,0.000002492353,0.005043753,0.3186163,0.052324913,0.5449165,0.0018062176,0.0017965334],"about_ca_topic_score_codex":0.0001334965,"about_ca_topic_score_gemma":0.00007997051,"teacher_disagreement_score":0.5310524,"about_ca_system_score_codex":0.000076796765,"about_ca_system_score_gemma":0.0002253358,"threshold_uncertainty_score":0.99992174},"labels":[],"label_agreement":null},{"id":"W7077040308","doi":"10.55016/ojs/cdm.v9i1.62082","title":"Kneser-Poulsen conjecture for a small number of intersections","year":2014,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":true,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Science Foundation","keywords":"Conjecture; Intersection (aeronautics); Euclidean space; Finite set; Euclidean geometry; Space (punctuation)","score_opus":0.01322533616434461,"score_gpt":0.2781463071464873,"score_spread":0.2649209709821427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077040308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064114593,0.000005973149,0.97726023,0.0053294008,0.00013497584,0.00037113385,0.00008601954,0.000094050025,0.010306767],"genre_scores_gemma":[0.8812472,5.827918e-7,0.11681025,0.00012548162,0.000068556226,0.00011509685,0.000018786901,0.000003826355,0.0016102041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990846,0.000030057781,0.00031145863,0.00022153143,0.00009284977,0.00025949362],"domain_scores_gemma":[0.9983899,0.00039552612,0.00013183345,0.00055947714,0.00041980634,0.000103470426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037391423,0.00013034456,0.00025210698,0.000042745785,0.00015011487,0.000052465515,0.0005187305,0.00008711091,0.000038084254],"category_scores_gemma":[0.0019054334,0.00011179462,0.00013112288,0.0002673911,0.000048082544,0.00006531268,0.00019758371,0.00008684847,0.000039159484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046909577,0.00008976351,0.00012211823,0.00017030159,0.000048929658,5.2972695e-7,0.001234417,0.00038667684,0.0024247763,0.99190587,0.0026366562,0.00097527343],"study_design_scores_gemma":[0.0012573566,0.0002263153,0.00024697903,0.00026064747,0.000090762995,0.00010339464,0.00045466417,0.18462169,0.02729964,0.66370726,0.12115306,0.00057825854],"about_ca_topic_score_codex":0.000006462504,"about_ca_topic_score_gemma":0.000011528781,"teacher_disagreement_score":0.8748357,"about_ca_system_score_codex":0.000029257437,"about_ca_system_score_gemma":0.000037131325,"threshold_uncertainty_score":0.45588526},"labels":[],"label_agreement":null},{"id":"W7077041364","doi":"10.55016/ojs/cdm.v9i2.62096","title":"An inductive construction of ( 2 , 1 ) -tight graphs","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council","keywords":"Simple (philosophy); Characterization (materials science); Extension (predicate logic); Cograph; Block graph; Split graph; Graph; Simple graph; Induced subgraph","score_opus":0.020236424578296636,"score_gpt":0.28178024534876384,"score_spread":0.26154382077046723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077041364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044348344,0.000021821312,0.94416803,0.0022020354,0.00017650162,0.00022888837,0.00005434783,0.000118342934,0.00868171],"genre_scores_gemma":[0.83870244,0.0000010063303,0.16108972,0.0000351725,0.000028978311,0.000021219174,0.000013323305,0.0000019687704,0.000106178246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905246,0.000046990834,0.0002847458,0.00021176203,0.00019982425,0.00020420372],"domain_scores_gemma":[0.9982274,0.000057196376,0.00014448386,0.00060007616,0.00075376534,0.0002170902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038634526,0.00011154459,0.00020556597,0.000082251994,0.00008745537,0.000050055853,0.0005065134,0.00007578676,0.000012601022],"category_scores_gemma":[0.00073500397,0.000097537624,0.000051928266,0.000489111,0.00010454599,0.00027680787,0.00013383942,0.00009047353,0.000022955059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029800085,0.000082000704,0.0002065042,0.000018580078,0.000019752548,0.0000020906293,0.0018330062,0.00021909983,0.0029418438,0.9934339,0.00059078133,0.00064948725],"study_design_scores_gemma":[0.0004978928,0.00021270511,0.00026222883,0.00006221396,0.000027750943,0.00005992567,0.0016031492,0.025792718,0.043381553,0.92237866,0.005432663,0.0002885357],"about_ca_topic_score_codex":0.000007575836,"about_ca_topic_score_gemma":0.0000016653895,"teacher_disagreement_score":0.7943541,"about_ca_system_score_codex":0.00004298785,"about_ca_system_score_gemma":0.00009941952,"threshold_uncertainty_score":0.3977469},"labels":[],"label_agreement":null},{"id":"W7077044566","doi":"10.55016/ojs/cdm.v9i2.62197","title":"A short construction of highly chromatic digraphs without short cycles","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Vertex (graph theory); Chromatic scale; Graph; Directed graph; Critical graph; Graph theory; Set (abstract data type)","score_opus":0.02168195850709097,"score_gpt":0.2807279845701072,"score_spread":0.25904602606301624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077044566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1294384,0.00006342107,0.8580977,0.001976024,0.00015431042,0.0004231573,0.000059827144,0.0002056853,0.009581486],"genre_scores_gemma":[0.905195,0.0000030160866,0.094519265,0.000028538008,0.00003566025,0.000046521607,0.00001707314,0.000003823627,0.00015109705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851215,0.000043160493,0.0005099403,0.00027766786,0.00034125365,0.0003158195],"domain_scores_gemma":[0.9982308,0.00010196854,0.000104180275,0.0007438938,0.0005702381,0.00024887867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005129858,0.00018583341,0.00037870652,0.00010894514,0.000116861134,0.0000818324,0.0006161212,0.00009552652,0.000006634853],"category_scores_gemma":[0.00092356175,0.0001612618,0.000105131745,0.0005326603,0.00015002255,0.00021606805,0.00026341242,0.00010865065,0.000027071694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001594939,0.00035130946,0.0073565687,0.00037495184,0.00021549327,0.00001829999,0.004250331,0.0010907366,0.01226579,0.9660482,0.0030581437,0.004954246],"study_design_scores_gemma":[0.0014728591,0.0005159727,0.005620417,0.0010232308,0.0003192708,0.0006259851,0.0033034473,0.20041463,0.14186469,0.6331573,0.009962762,0.0017194338],"about_ca_topic_score_codex":0.000005368523,"about_ca_topic_score_gemma":0.000003118316,"teacher_disagreement_score":0.7757566,"about_ca_system_score_codex":0.00006538141,"about_ca_system_score_gemma":0.000104755134,"threshold_uncertainty_score":0.6576066},"labels":[],"label_agreement":null},{"id":"W7077061421","doi":"10.55016/ojs/cdm.v9i2.62188","title":"A note on bounds for the cop number using tree decompositions","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Upper and lower bounds; Tree (set theory); K-ary tree; Spanning tree; Search tree","score_opus":0.04074603487903802,"score_gpt":0.337051299723855,"score_spread":0.296305264844817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077061421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011548238,0.000019916153,0.9727659,0.017193956,0.00019819381,0.00048682693,0.00010256537,0.000099621735,0.007978169],"genre_scores_gemma":[0.73596394,0.0000013698389,0.26137236,0.0007470956,0.0001884921,0.00021182923,0.000027125845,0.0000074332715,0.0014803988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989733,0.000029031093,0.00025013633,0.00022255316,0.00019561042,0.00032938182],"domain_scores_gemma":[0.9979872,0.00061406527,0.000092839255,0.0006748428,0.00046157744,0.00016945606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051078806,0.0001440435,0.00017610211,0.00003020067,0.0005267965,0.00022248847,0.0006406596,0.00006601828,0.00001245096],"category_scores_gemma":[0.0012785508,0.00010227941,0.000106558946,0.00031777,0.00005874837,0.00011237309,0.0001978116,0.00010487111,0.000105147905],"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.00001694193,0.00017888258,0.000024340074,0.00003681562,0.00006387119,0.000004980462,0.0023016776,0.008304866,0.0015590672,0.9664505,0.020120157,0.0009378865],"study_design_scores_gemma":[0.00077693834,0.00009703872,0.000031888605,0.000098109595,0.000072700954,0.00007567397,0.00026676373,0.7092633,0.003932535,0.19951186,0.085563794,0.00030937363],"about_ca_topic_score_codex":0.0000062620934,"about_ca_topic_score_gemma":0.00000655939,"teacher_disagreement_score":0.7669387,"about_ca_system_score_codex":0.00013117104,"about_ca_system_score_gemma":0.00013205483,"threshold_uncertainty_score":0.41708332},"labels":[],"label_agreement":null},{"id":"W7077063757","doi":"10.55016/ojs/cdm.v9i1.62145","title":"A short note on integer complexity","year":2014,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Integer (computer science); Constructive; Conjunction (astronomy); Upper and lower bounds; Radical of an integer; Integer programming","score_opus":0.02669197685879445,"score_gpt":0.29589102914232146,"score_spread":0.26919905228352703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077063757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016849925,0.0000037734014,0.93982786,0.011540297,0.00011814054,0.00020762277,0.000029723877,0.00019668181,0.04639091],"genre_scores_gemma":[0.95162296,5.18866e-7,0.04671229,0.0006035184,0.00007657178,0.00003799177,0.000014834304,0.0000031571315,0.00092813285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988129,0.00004809592,0.0002726741,0.00030417417,0.00021609805,0.0003460373],"domain_scores_gemma":[0.99840146,0.00025908218,0.000053349064,0.0008668552,0.000244138,0.00017513528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000519925,0.00016386255,0.00023827555,0.00005582689,0.00023031508,0.00012215739,0.00074786675,0.000074293646,0.000035223675],"category_scores_gemma":[0.0016742346,0.00013632292,0.00009021611,0.00028823206,0.000069822854,0.00008896921,0.0003168586,0.00016881121,0.00039305456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020817856,0.000069185495,0.000017958262,0.000022449787,0.000009681685,0.0000020735918,0.0003415862,0.0002965718,0.00055814616,0.99401647,0.00282865,0.0018351591],"study_design_scores_gemma":[0.00033176647,0.00016766913,0.0007557259,0.00016679877,0.000021051184,0.000030784493,0.000055969245,0.37518892,0.009665522,0.49455062,0.11854383,0.0005213595],"about_ca_topic_score_codex":0.0000022745671,"about_ca_topic_score_gemma":0.0000026500923,"teacher_disagreement_score":0.949938,"about_ca_system_score_codex":0.00006280294,"about_ca_system_score_gemma":0.000024036493,"threshold_uncertainty_score":0.55590874},"labels":[],"label_agreement":null},{"id":"W7077066995","doi":"10.55016/ojs/cdm.v9i1.62166","title":"Interlacement in 4-regular graphs: a new approach using nonsymmetric matrices","year":2014,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Partition (number theory); Mathematical proof; Euler's formula; Linear algebra; Matrix (chemical analysis); Graph","score_opus":0.01977070169506495,"score_gpt":0.2746791818739244,"score_spread":0.2549084801788595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077066995","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053354106,0.00008266595,0.98498565,0.0017471374,0.000079798,0.00035704853,0.000007793779,0.00009477139,0.007309742],"genre_scores_gemma":[0.675395,0.0000043989694,0.32335985,0.0001408842,0.000054350916,0.00003729943,0.000011029874,0.0000051208326,0.0009920544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984078,0.00008609572,0.00043400674,0.0003892425,0.00024546916,0.00043741678],"domain_scores_gemma":[0.99858767,0.00019553807,0.000140274,0.0007344309,0.00014489808,0.00019720483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010387158,0.00019319511,0.00030790814,0.0003547176,0.00013728246,0.00018027386,0.0008492609,0.000088207984,0.000020939478],"category_scores_gemma":[0.0012377249,0.00017333914,0.000096088814,0.0017611536,0.000032466916,0.0001824415,0.0004226856,0.00014561955,0.000060129438],"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.0000060905218,0.00033332518,0.00032061565,0.0002190902,0.000053440068,0.0000064665696,0.0027388234,0.00895448,0.0019536326,0.9765862,0.0028683047,0.005959496],"study_design_scores_gemma":[0.00064910296,0.000048960454,0.00008946242,0.00016583999,0.00003011885,0.000034435034,0.00037378678,0.8685261,0.0018347393,0.11771191,0.01014208,0.0003934793],"about_ca_topic_score_codex":0.00003969666,"about_ca_topic_score_gemma":0.000004363126,"teacher_disagreement_score":0.8595716,"about_ca_system_score_codex":0.00011485707,"about_ca_system_score_gemma":0.00007104052,"threshold_uncertainty_score":0.7068565},"labels":[],"label_agreement":null},{"id":"W7077068982","doi":"10.55016/ojs/cdm.v9i1.62207","title":"On the minimum order of k -cop win graphs","year":2014,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Graph; Line graph; Conjecture; Graph isomorphism; Block graph; Cograph; Extremal graph theory; Cubic graph; 1-planar graph","score_opus":0.010731822499448682,"score_gpt":0.24769340644433716,"score_spread":0.23696158394488848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077068982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016882658,0.0000127668345,0.93289435,0.020689499,0.000095608004,0.00027357714,0.000026621918,0.00007311558,0.02905178],"genre_scores_gemma":[0.9863473,0.0000010617993,0.012221125,0.00044581786,0.00002131103,0.00003521799,0.000004438107,0.0000024370281,0.0009212989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904996,0.000059235434,0.000267973,0.00018673697,0.00019801008,0.00023808742],"domain_scores_gemma":[0.99790716,0.00073484005,0.00011779692,0.00083920505,0.00032726242,0.000073740994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006180352,0.00012008276,0.00018821417,0.00004399883,0.00017222494,0.000051024497,0.0007814241,0.0000545851,0.000056557627],"category_scores_gemma":[0.0033455591,0.000076932585,0.00007636859,0.0004919997,0.000076102384,0.000049627914,0.0002048083,0.00010426847,0.000088910834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013330227,0.00004361234,0.000009354712,0.000020309575,0.000012567704,3.896905e-7,0.00037508717,0.00021364557,0.0011444872,0.99377286,0.0042234445,0.00018291593],"study_design_scores_gemma":[0.00028767134,0.00012727811,0.00013130842,0.00012762747,0.0000191785,0.000007568507,0.00013702974,0.07967627,0.016461719,0.8870443,0.01576051,0.0002195369],"about_ca_topic_score_codex":0.0000020682758,"about_ca_topic_score_gemma":0.0000010735415,"teacher_disagreement_score":0.96946466,"about_ca_system_score_codex":0.00001424107,"about_ca_system_score_gemma":0.000030121944,"threshold_uncertainty_score":0.40051883},"labels":[],"label_agreement":null},{"id":"W7077069286","doi":"10.55016/ojs/cdm.v9i2.62210","title":"Colouring isonemal fabrics with more than two colours by thin striping","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","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":true,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Data striping; Redundancy (engineering); Yarn; Thin film","score_opus":0.016516769514012302,"score_gpt":0.2757659268468366,"score_spread":0.2592491573328243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077069286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043955557,0.00009445302,0.9360033,0.012988902,0.00011447058,0.00047932664,0.00010618196,0.0002989443,0.0059588663],"genre_scores_gemma":[0.93127465,0.0000015960331,0.066324115,0.00028222543,0.00006649317,0.00007718963,0.000039075283,0.0000086973505,0.0019259502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982094,0.000049628936,0.00034471974,0.00039661775,0.0004279796,0.00057165656],"domain_scores_gemma":[0.99798465,0.00016363912,0.00018421374,0.000703669,0.0005560798,0.00040772598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066713104,0.00024869354,0.00033285533,0.00006599578,0.0002991782,0.00026883,0.000890566,0.00009323033,0.000009209338],"category_scores_gemma":[0.0009612855,0.00020529838,0.00006325054,0.0006209691,0.00009124125,0.0002692686,0.00043917363,0.00023055437,0.00005192185],"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.00010308891,0.0010033088,0.004210238,0.00038788992,0.00043776826,0.00025104408,0.027707355,0.04716452,0.005782923,0.7870481,0.12443324,0.0014705281],"study_design_scores_gemma":[0.0062888553,0.0010221067,0.00047760035,0.0009025504,0.00022293525,0.0005296799,0.01033413,0.7834489,0.03715896,0.08148779,0.075482294,0.0026442306],"about_ca_topic_score_codex":0.00002140842,"about_ca_topic_score_gemma":0.000009850915,"teacher_disagreement_score":0.8873191,"about_ca_system_score_codex":0.00016647777,"about_ca_system_score_gemma":0.00019771206,"threshold_uncertainty_score":0.83718246},"labels":[],"label_agreement":null},{"id":"W7077075033","doi":"10.55016/ojs/cdm.v9i2.62306","title":"The copnumber for lexicographic products and sums of graphs","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Theoretical and Computational Physics","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lexicographical order; Product (mathematics); Graph; Order (exchange)","score_opus":0.012957782654969715,"score_gpt":0.285722008374653,"score_spread":0.2727642257196833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077075033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30761528,0.00021406151,0.6816259,0.004088089,0.0001751001,0.0014263175,0.0011716738,0.00003959031,0.0036440091],"genre_scores_gemma":[0.9965908,8.2454414e-7,0.003060855,0.000015872078,0.0000753532,0.000090548376,0.000039132792,0.0000080922,0.00011854514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940956,0.00001756646,0.00019696423,0.0001056277,0.00011398384,0.00015630196],"domain_scores_gemma":[0.9988775,0.0003034581,0.000072308656,0.00016803149,0.0004793687,0.00009929595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023043124,0.000086837324,0.00014315064,0.000020362206,0.00014738124,0.000040632258,0.00010469198,0.000014637861,0.0000029414873],"category_scores_gemma":[0.000127482,0.00005725033,0.00006132303,0.00019699559,0.00016904774,0.000038147075,0.00005106496,0.000043854776,0.0000059461845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011966519,0.000040473467,0.00023092517,0.000013814743,0.000041862513,2.1590921e-8,0.00019356908,0.00002812181,0.00010361283,0.9975369,0.0010587545,0.00073997147],"study_design_scores_gemma":[0.0003411316,0.00005359654,0.00011641294,0.000018919547,0.000043500073,3.5054646e-7,0.00035781448,0.0012253358,0.0018094274,0.993373,0.0025776331,0.00008291637],"about_ca_topic_score_codex":0.0000044620797,"about_ca_topic_score_gemma":5.56631e-7,"teacher_disagreement_score":0.6889755,"about_ca_system_score_codex":0.0000060961684,"about_ca_system_score_gemma":0.000047660993,"threshold_uncertainty_score":0.23346007},"labels":[],"label_agreement":null},{"id":"W7077076524","doi":"10.55016/ojs/cdm.v9i2.62105","title":"On cycle packings and feedback vertex sets","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vertex (graph theory); Euler characteristic; Graph; Euler's formula; Upper and lower bounds; Feedback vertex set","score_opus":0.01745105219775858,"score_gpt":0.2720491629489269,"score_spread":0.25459811075116834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077076524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0842647,0.00010214738,0.8299256,0.030031722,0.0002870454,0.00052825134,0.00008576856,0.0003721848,0.054402597],"genre_scores_gemma":[0.9832804,0.000001960295,0.015406309,0.00043516315,0.000020407011,0.000021939564,0.00000861496,0.0000031108532,0.0008220918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906373,0.000024761828,0.00018656791,0.00025160634,0.00019291007,0.00028042204],"domain_scores_gemma":[0.99878085,0.00016338061,0.00006190553,0.00048744903,0.0002315519,0.00027489517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035003852,0.00013336752,0.00017660951,0.000042198055,0.00014023321,0.00014748581,0.00037211704,0.00006510857,0.000012640226],"category_scores_gemma":[0.0016383204,0.00011344313,0.000035628527,0.00023132007,0.000044920045,0.00012970896,0.00029395992,0.00010208741,0.00021314711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006518466,0.0000977016,0.000057944282,0.00004371042,0.000024820756,0.000015716027,0.0024540697,0.00047512288,0.00037934905,0.97298557,0.021479916,0.0019795708],"study_design_scores_gemma":[0.0008537661,0.00017180809,0.00035185335,0.00015217192,0.00001853102,0.00006557432,0.0003200131,0.109845266,0.0026539261,0.86465573,0.020518145,0.00039318344],"about_ca_topic_score_codex":0.0000033593892,"about_ca_topic_score_gemma":0.0000011568759,"teacher_disagreement_score":0.8990157,"about_ca_system_score_codex":0.000052227388,"about_ca_system_score_gemma":0.000046137207,"threshold_uncertainty_score":0.46260765},"labels":[],"label_agreement":null},{"id":"W7077079981","doi":"10.55016/ojs/cdm.v9i2.62169","title":"Chromatic polynomials of some sunflower mixed hypergraphs","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hypergraph; Chromatic scale; Chromatic polynomial; Vertex (graph theory); Monochromatic color; Function (biology); Set (abstract data type)","score_opus":0.020036650765849665,"score_gpt":0.26964203131677716,"score_spread":0.2496053805509275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7077079981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102742605,0.00034072457,0.86907464,0.012001831,0.0005531843,0.0007049811,0.000142371,0.00030110416,0.01413855],"genre_scores_gemma":[0.95595676,0.000002806569,0.042792458,0.00012305082,0.00005998299,0.00004155443,0.000012841467,0.0000042550214,0.0010062982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985955,0.000051079518,0.0004899621,0.00023966994,0.00028190203,0.00034190508],"domain_scores_gemma":[0.9980811,0.00017906171,0.0001833633,0.00082724466,0.00046202002,0.00026720844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067756785,0.00016656486,0.0003749279,0.00009996722,0.000091535134,0.000066964,0.0007970133,0.00008869376,0.000020450674],"category_scores_gemma":[0.0021466676,0.000142664,0.000116423274,0.00046369398,0.00007689903,0.00022621045,0.00034816487,0.00008718717,0.000115325616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008188382,0.00030984034,0.00011879228,0.00020353425,0.00010898958,0.000014498926,0.0026451796,0.00083359756,0.020000463,0.9579023,0.017305316,0.0005493101],"study_design_scores_gemma":[0.0021396328,0.00037160577,0.0005665903,0.0004328598,0.00012235068,0.00010900298,0.001024627,0.06473503,0.15246493,0.74448407,0.03249814,0.001051201],"about_ca_topic_score_codex":0.0000071563145,"about_ca_topic_score_gemma":0.0000016373266,"teacher_disagreement_score":0.85321414,"about_ca_system_score_codex":0.000056182445,"about_ca_system_score_gemma":0.00013669819,"threshold_uncertainty_score":0.58176684},"labels":[],"label_agreement":null},{"id":"W7104366022","doi":"10.55016/ojs/cdm.v20i1.77044","title":"The existence of hypersolids in $\\mathbb{E}^d$ whose Heesch number is $d-1$","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja","keywords":"Existential quantification; Finite set; Natural number; Real number; Disjoint sets","score_opus":0.01670967034529522,"score_gpt":0.3527342548474622,"score_spread":0.336024584502167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104366022","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54159606,0.0068013193,0.23102035,0.036784794,0.0029521252,0.010878965,0.0061375713,0.00033122624,0.1634976],"genre_scores_gemma":[0.974913,0.00053300784,0.009106637,0.00080785726,0.000105618994,0.00033513384,0.000016699043,0.00008254113,0.014099504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99428767,0.0004522663,0.0026127805,0.0006748855,0.00072701677,0.0012453807],"domain_scores_gemma":[0.99222064,0.0034630757,0.00058441213,0.0023107356,0.0011097158,0.00031144632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031847388,0.0007190735,0.0015103288,0.00027709617,0.00088401174,0.00029353733,0.0015369034,0.0004997093,0.00047381944],"category_scores_gemma":[0.0069174487,0.0005573182,0.0005137446,0.0021211747,0.00093506806,0.00020210842,0.0007564579,0.0008256332,0.0006356643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009911279,0.00069427566,0.00038003002,0.00088574144,0.00029758096,0.000017795113,0.008710295,0.000016250191,0.0005059726,0.9797205,0.007821847,0.0008506254],"study_design_scores_gemma":[0.0038687235,0.00024291729,0.0003785043,0.0063021895,0.0010796819,0.000053600736,0.02524205,0.014342786,0.013462086,0.8990027,0.03453897,0.0014858437],"about_ca_topic_score_codex":0.000037715243,"about_ca_topic_score_gemma":0.00007008696,"teacher_disagreement_score":0.43331695,"about_ca_system_score_codex":0.0005314061,"about_ca_system_score_gemma":0.00070080464,"threshold_uncertainty_score":0.99968785},"labels":[],"label_agreement":null},{"id":"W7104369327","doi":"10.55016/ojs/cdm.v20i1.75594","title":"Congruences modulo powers of 3 for 6-colored generalized Frobenius partitions","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Centre Scientifique et Technique du Bâtiment; Chongqing Municipal Education Commission; National Natural Science Foundation of China; Chongqing Normal University","keywords":"Congruence relation; Modulo; Conjecture; Generating function; Function (biology); Primitive root modulo n","score_opus":0.022595067870825717,"score_gpt":0.37132788343767686,"score_spread":0.34873281556685115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104369327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023731025,0.0011980736,0.9435566,0.004607779,0.0012142956,0.0075194603,0.010767273,0.000266974,0.0071385163],"genre_scores_gemma":[0.57098055,0.00028587613,0.3971485,0.00030396308,0.00022564389,0.003251424,0.00023980885,0.00018541023,0.027378844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99340796,0.00019755721,0.0034134567,0.0008667822,0.00073619926,0.0013780238],"domain_scores_gemma":[0.98888546,0.004801512,0.0012060398,0.0018107989,0.0028215703,0.00047461753],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013489124,0.00091815885,0.0024941724,0.00072472316,0.00085003854,0.00031116707,0.0011795876,0.00052523694,0.00055565743],"category_scores_gemma":[0.018995602,0.0009042377,0.001063142,0.0015278124,0.0009760688,0.00043916536,0.0005529029,0.0003770266,0.00011367027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013137097,0.001208874,0.0000101137875,0.0039715646,0.0009803018,0.0000031189534,0.002140371,0.0010885743,0.0034690886,0.96725637,0.019643104,0.00009712637],"study_design_scores_gemma":[0.002824474,0.00030528646,0.000014404712,0.0026487256,0.0022042897,0.0000058727446,0.0039366293,0.021818342,0.022295414,0.9386998,0.0044403966,0.0008063959],"about_ca_topic_score_codex":0.000029021949,"about_ca_topic_score_gemma":0.000095923504,"teacher_disagreement_score":0.54724956,"about_ca_system_score_codex":0.00059092394,"about_ca_system_score_gemma":0.00071744673,"threshold_uncertainty_score":0.99934083},"labels":[],"label_agreement":null},{"id":"W7104378041","doi":"10.55016/ojs/cdm.v20i1.75051","title":"On the Directed Hamilton-Waterloo Problem with Two Cycle Sizes","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Digraph; Directed graph; Directed acyclic graph; Optimization problem; Feedback arc set","score_opus":0.005041616138665181,"score_gpt":0.2342231469093046,"score_spread":0.2291815307706394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104378041","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49608937,0.0015076076,0.383788,0.008370257,0.0015842903,0.009716817,0.0026468616,0.002096282,0.09420053],"genre_scores_gemma":[0.992551,0.000027126987,0.0015810716,0.00020946618,0.000085224165,0.0007178045,0.00003722432,0.000076444405,0.0047146003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702036,0.00027036745,0.00091701763,0.00048336052,0.00039955782,0.000909322],"domain_scores_gemma":[0.9964153,0.0014282939,0.00016784524,0.0013764766,0.0003846341,0.00022743583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093455106,0.0006638718,0.0007896658,0.0002714457,0.00091325736,0.00043662105,0.00071841344,0.00018817662,0.00019359919],"category_scores_gemma":[0.0004677255,0.00042690197,0.0002540222,0.0015641141,0.00023700585,0.00013264763,0.00011971963,0.00054781634,0.00044388016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008074462,0.00021811371,0.00002168398,0.0005197954,0.00078051956,0.000010206756,0.0044784616,0.01579269,0.0013434396,0.9735074,0.0030220565,0.0002249056],"study_design_scores_gemma":[0.005527576,0.0008603578,0.00028048607,0.0138438,0.0019682657,0.000054808617,0.005441071,0.22544122,0.028447203,0.6955944,0.019901725,0.0026391293],"about_ca_topic_score_codex":0.00003211548,"about_ca_topic_score_gemma":0.00007288669,"teacher_disagreement_score":0.4964617,"about_ca_system_score_codex":0.00027873888,"about_ca_system_score_gemma":0.000104950144,"threshold_uncertainty_score":0.99981827},"labels":[],"label_agreement":null},{"id":"W7104379436","doi":"10.55016/ojs/cdm.v19i4.72290","title":"Moments of $q$-Jacobi polynomials and $q$-zeta values","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Austrian Science Fund","keywords":"Dirichlet distribution; Orthogonal polynomials; Discrete orthogonal polynomials; Moment (physics); Classical orthogonal polynomials; Difference polynomials; Macdonald polynomials","score_opus":0.01660669962003441,"score_gpt":0.3635677643094129,"score_spread":0.3469610646893785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104379436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09172634,0.0058806003,0.8458554,0.005816104,0.0012871469,0.0069471784,0.0050601796,0.0003705862,0.037056446],"genre_scores_gemma":[0.793849,0.0010995477,0.13624711,0.00029990415,0.00023894136,0.0005255036,0.000059889284,0.00021823733,0.06746189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99389815,0.00023974139,0.0030836624,0.0008250474,0.00081215263,0.0011412239],"domain_scores_gemma":[0.99190825,0.003542891,0.001020622,0.0018372943,0.0011849358,0.0005060136],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016255428,0.0009142611,0.0024497388,0.0008145645,0.000580862,0.0003188417,0.00090807345,0.00046456003,0.0003687253],"category_scores_gemma":[0.013715116,0.00088997756,0.0004694565,0.001272401,0.0009917335,0.00044868278,0.001450283,0.00046211857,0.00015973026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057739977,0.0010098079,0.000068404894,0.0060069175,0.0009516783,0.00000695532,0.0036108978,0.000038671467,0.0047432873,0.9761188,0.0069757532,0.00041111183],"study_design_scores_gemma":[0.0016458873,0.00020900488,0.000111190675,0.0046234066,0.001810418,0.000014344202,0.0038788405,0.0032620674,0.018094689,0.96415836,0.001431465,0.000760324],"about_ca_topic_score_codex":0.000017256303,"about_ca_topic_score_gemma":0.000014474802,"teacher_disagreement_score":0.7096083,"about_ca_system_score_codex":0.0004563245,"about_ca_system_score_gemma":0.00037273005,"threshold_uncertainty_score":0.9993551},"labels":[],"label_agreement":null},{"id":"W7104381216","doi":"10.55016/ojs/cdm.v19i4.73644","title":"On the permanent of an even-dimensional non-negative polystochastic tensor of order n","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Rectangle; Hypercube; Order (exchange); Transversal (combinatorics); Tensor (intrinsic definition); Conjecture","score_opus":0.014606741465860275,"score_gpt":0.32863195459669126,"score_spread":0.314025213130831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104381216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4834433,0.00010693616,0.47741586,0.017317751,0.00033380912,0.0062380913,0.008550428,0.00009472949,0.0064991117],"genre_scores_gemma":[0.9747819,0.000005823769,0.022506421,0.00047891864,0.000048543974,0.0003729365,0.00008007887,0.0000467791,0.0016786095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962555,0.00022905452,0.0018010734,0.0004947041,0.0007028935,0.00051674957],"domain_scores_gemma":[0.990482,0.0044550407,0.0008785638,0.001718649,0.0022206341,0.0002451328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007988292,0.00051818206,0.00107355,0.00039597187,0.00058583956,0.000064602595,0.0007924142,0.00023543315,0.00055128604],"category_scores_gemma":[0.0040476313,0.0003842636,0.0003893638,0.0014871503,0.000540595,0.00009508235,0.00028412146,0.000429918,0.00016376501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010815231,0.0023175464,0.0000028877007,0.00040359388,0.00043830756,0.0000015579704,0.0023154353,0.0016798372,0.010931099,0.9779055,0.003799806,0.000096237025],"study_design_scores_gemma":[0.0025110615,0.00084881496,0.0005950431,0.0036301229,0.0016731845,0.00002063461,0.004261832,0.121624544,0.046237834,0.8175762,0.0002667235,0.00075396005],"about_ca_topic_score_codex":0.000021630085,"about_ca_topic_score_gemma":0.0000137151255,"teacher_disagreement_score":0.4913386,"about_ca_system_score_codex":0.00021742168,"about_ca_system_score_gemma":0.0004314852,"threshold_uncertainty_score":0.99986094},"labels":[],"label_agreement":null},{"id":"W7104381928","doi":"10.55016/ojs/cdm.v19i4.70236","title":"Two families of strongly walk regular graphs from three-weight codes over $\\mathbb{Z_4}$","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Dual polyhedron; Generalization; Coset; Strongly regular graph; Code (set theory)","score_opus":0.006117288750354618,"score_gpt":0.2483047190128505,"score_spread":0.2421874302624959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104381928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52788794,0.007942353,0.43920428,0.00032538222,0.0017838482,0.0021054915,0.010630528,0.00036172516,0.009758485],"genre_scores_gemma":[0.9936692,0.0002243869,0.0048650904,0.000032568936,0.0001422133,0.00020096387,0.00022360476,0.00008851588,0.00055342435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954526,0.00021219233,0.002057712,0.00066712644,0.00060801074,0.001002399],"domain_scores_gemma":[0.99579674,0.00093676907,0.00041325594,0.0019631158,0.0005579383,0.00033221053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089657144,0.00087773777,0.0017558462,0.000688338,0.00046766188,0.00021656422,0.0009990609,0.0004346272,0.00033046078],"category_scores_gemma":[0.00058274204,0.0008612408,0.00078242586,0.0016763294,0.00044342224,0.0002896959,0.00035220376,0.000515289,0.00012085965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006904102,0.0002711978,0.0009928783,0.0010415688,0.0017863709,0.000010039478,0.0019584612,0.0037930969,0.014023146,0.97404855,0.0015650094,0.0004406164],"study_design_scores_gemma":[0.004238454,0.00021818587,0.0029260379,0.0064839786,0.0026299714,0.0000075950347,0.0052463333,0.08936621,0.042257708,0.83873075,0.0061449464,0.001749853],"about_ca_topic_score_codex":0.00018049136,"about_ca_topic_score_gemma":0.0002800642,"teacher_disagreement_score":0.4657813,"about_ca_system_score_codex":0.0002687579,"about_ca_system_score_gemma":0.00016315967,"threshold_uncertainty_score":0.9993838},"labels":[],"label_agreement":null},{"id":"W7104391593","doi":"10.55016/ojs/cdm.v20i1.75149","title":"The flag $f$- and $h$- vectors of generalized Square posets","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Square (algebra); Flag (linear algebra); Quadrant (abdomen); Class (philosophy); Series (stratigraphy); Plane (geometry)","score_opus":0.011228172543707327,"score_gpt":0.33485808458918764,"score_spread":0.3236299120454803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104391593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17196266,0.011949283,0.7696866,0.014973666,0.005283222,0.012013988,0.0031592217,0.0005048434,0.0104665095],"genre_scores_gemma":[0.92480475,0.0013791617,0.06549822,0.00019678051,0.0002866533,0.000614107,0.000043937187,0.00021637623,0.006960019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939782,0.0003809339,0.0028615051,0.00070992555,0.0008632415,0.0012061984],"domain_scores_gemma":[0.98766154,0.0065229787,0.0011962018,0.0024555791,0.0017352189,0.00042845207],"candidate_categories":["metaresearch","metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0019407453,0.00092099805,0.0018389289,0.00039504093,0.0014679487,0.0003916817,0.0012399169,0.00048380136,0.00005582594],"category_scores_gemma":[0.017708063,0.0007166204,0.00049018767,0.001741732,0.0008399573,0.00021241848,0.0012084013,0.00061665924,0.000057882586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008664579,0.00045028367,0.000029455243,0.0019425828,0.00058910286,0.000004623848,0.0024708665,0.000044731103,0.0014495815,0.9880599,0.0037626468,0.0011095853],"study_design_scores_gemma":[0.0023039852,0.00027302725,0.00005752393,0.0025412862,0.001235743,0.000016043983,0.0025320316,0.0070361174,0.009344519,0.96354014,0.010399312,0.000720288],"about_ca_topic_score_codex":0.0000125732,"about_ca_topic_score_gemma":0.000030995703,"teacher_disagreement_score":0.75284207,"about_ca_system_score_codex":0.0004934758,"about_ca_system_score_gemma":0.00052137,"threshold_uncertainty_score":0.99983203},"labels":[],"label_agreement":null},{"id":"W7104391789","doi":"10.55016/ojs/cdm.v20i1.76681","title":"The Involutive Double Coset Property for String C-groups of Affine Type","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Coxeter group; Coset; Affine transformation; Type (biology); Property (philosophy); String (physics)","score_opus":0.02939503945327656,"score_gpt":0.3572650749736466,"score_spread":0.3278700355203701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104391789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009429587,0.00215195,0.95294636,0.0053805085,0.003913982,0.016030557,0.0026291697,0.0002891402,0.0072287326],"genre_scores_gemma":[0.80339223,0.00067270326,0.14821844,0.00019029682,0.0007895649,0.0030337134,0.00019153408,0.00041304147,0.043098457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99397427,0.00017336776,0.0029411868,0.0007341865,0.0007712531,0.0014057538],"domain_scores_gemma":[0.9847019,0.006965311,0.0013819907,0.0024306343,0.004201888,0.00031832466],"candidate_categories":["metaresearch","metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00245972,0.00089993473,0.0018515888,0.0003340468,0.0015716002,0.0003223731,0.0017168276,0.0004731785,0.000041145162],"category_scores_gemma":[0.01834749,0.00059318723,0.00058729114,0.002253609,0.0005946468,0.00026663262,0.0010942176,0.0006048278,0.000065649096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072980794,0.00088793656,0.0000064228147,0.0026438546,0.000811906,0.00000142847,0.0019233633,0.00018267616,0.0016597309,0.97922724,0.011141433,0.0007842208],"study_design_scores_gemma":[0.0047355364,0.0006862928,0.0000055079095,0.0029102047,0.0014173359,0.0000056410468,0.0034013449,0.013509241,0.024276905,0.9130687,0.03522104,0.00076222507],"about_ca_topic_score_codex":0.000012243789,"about_ca_topic_score_gemma":0.000057623092,"teacher_disagreement_score":0.8047279,"about_ca_system_score_codex":0.0010361052,"about_ca_system_score_gemma":0.0010457324,"threshold_uncertainty_score":0.9997282},"labels":[],"label_agreement":null},{"id":"W7104391962","doi":"10.55016/ojs/cdm.v20i1.74305","title":"(G, s)-Transitive Graphs Of Valency 15","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Valency; Undirected graph; Transitive relation; Graph; Finite set; Set (abstract data type); Type (biology); Simple (philosophy)","score_opus":0.02224822933539634,"score_gpt":0.3647735727779849,"score_spread":0.34252534344258856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104391962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04577105,0.0033022126,0.8640173,0.0051113134,0.0009131718,0.006807266,0.010684399,0.00027973994,0.06311357],"genre_scores_gemma":[0.9627471,0.00030970422,0.026402524,0.00029990042,0.00009981067,0.00040339192,0.00010435603,0.00014126301,0.009491938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928644,0.0006943748,0.0027840696,0.00089463283,0.0012032832,0.0015592709],"domain_scores_gemma":[0.9881753,0.0051574577,0.0006559694,0.0025139526,0.0029567133,0.0005406157],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0034771203,0.0008873535,0.002026889,0.0014952725,0.00064428215,0.00019916774,0.0015830987,0.00061404484,0.0017774001],"category_scores_gemma":[0.0128509775,0.0008856608,0.0009712246,0.004080479,0.0010228412,0.00027412706,0.00081292656,0.0009729504,0.0005494964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017738921,0.0015017787,0.000059716924,0.004024059,0.0010413282,0.00001787266,0.0059190057,0.0000295022,0.0055085816,0.97516507,0.0058032917,0.0007523837],"study_design_scores_gemma":[0.002188401,0.0004965732,0.0001866609,0.004651235,0.0014671632,0.000013740338,0.004568401,0.0051427404,0.019923072,0.95856464,0.0019556952,0.00084169704],"about_ca_topic_score_codex":0.000018782079,"about_ca_topic_score_gemma":0.000022434464,"teacher_disagreement_score":0.91697603,"about_ca_system_score_codex":0.00051782536,"about_ca_system_score_gemma":0.00093572703,"threshold_uncertainty_score":0.9993594},"labels":[],"label_agreement":null},{"id":"W7104393302","doi":"10.55016/ojs/cdm.v19i4.76214","title":"Beta distributions whose moment sequences are related to integer sequences listed in the OEIS","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Integer (computer science); Moment (physics); BETA (programming language); Integer sequence; Distribution (mathematics); Catalan number; Sequence (biology)","score_opus":0.021675570554427863,"score_gpt":0.34973408756364616,"score_spread":0.3280585170092183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104393302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09751818,0.0019583646,0.7622699,0.09662332,0.003822478,0.017783105,0.008509345,0.0007164593,0.0107988035],"genre_scores_gemma":[0.9666714,0.00019650528,0.024472771,0.00094114157,0.00017194962,0.0027495178,0.00023805194,0.00014592029,0.0044127093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98944974,0.0009937807,0.004337625,0.001438498,0.0016332264,0.0021471297],"domain_scores_gemma":[0.98747885,0.0050894087,0.0013813985,0.0035584245,0.0018305392,0.0006613784],"candidate_categories":["metaresearch","metaepi_narrow","sts"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0040001175,0.0015050228,0.00244992,0.0011016442,0.0015336107,0.0010142713,0.0033619974,0.0006806768,0.0002429774],"category_scores_gemma":[0.014756899,0.0012001414,0.0007172276,0.007824609,0.00072636874,0.0005684906,0.0013216423,0.0017302783,0.00068741164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051684616,0.0018169162,0.00012578595,0.0010339028,0.00043796765,0.00008871255,0.012026856,0.00068538316,0.0003427435,0.97489494,0.008005704,0.0004894292],"study_design_scores_gemma":[0.0019931046,0.00041873887,0.0003324954,0.008028587,0.001213822,0.00006449638,0.017312193,0.005239008,0.0019123193,0.9472401,0.014664487,0.0015806434],"about_ca_topic_score_codex":0.00006905228,"about_ca_topic_score_gemma":0.00026724685,"teacher_disagreement_score":0.86915326,"about_ca_system_score_codex":0.0028820625,"about_ca_system_score_gemma":0.00093245367,"threshold_uncertainty_score":0.99976987},"labels":[],"label_agreement":null},{"id":"W7104393363","doi":"10.55016/ojs/cdm.v19i4.71818","title":"A different approach to Gauss Fibonacci polynomials","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fibonacci number; Fibonacci polynomials; Gauss; Order (exchange); Lucas number; Orthogonal polynomials; Recurrence relation; Matrix (chemical analysis)","score_opus":0.009833354105207125,"score_gpt":0.31760359261275234,"score_spread":0.3077702385075452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104393363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004190831,0.00016059159,0.9207394,0.00662615,0.00024385823,0.0038356707,0.003734921,0.00010725947,0.060361333],"genre_scores_gemma":[0.9149847,0.000016075126,0.06318602,0.0006685336,0.00051166886,0.0028191472,0.00029589044,0.00008520045,0.017432747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99607384,0.00009117215,0.0014435288,0.0008776385,0.00035773538,0.0011561026],"domain_scores_gemma":[0.995998,0.0007707161,0.00029189757,0.001683867,0.00047305226,0.00078245625],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038865145,0.00077140215,0.0013379018,0.00026792308,0.0009569752,0.0004313237,0.00093035697,0.00018479432,0.0003370892],"category_scores_gemma":[0.00053690514,0.00067600264,0.000525101,0.001383767,0.00017740858,0.00013084275,0.0009031173,0.00041258454,0.00087302487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029545961,0.0014243609,0.000015227209,0.0002543354,0.00031173622,2.675211e-7,0.0008557635,0.0005741894,0.0010373387,0.9855683,0.007644565,0.0022843978],"study_design_scores_gemma":[0.0013310545,0.00013466689,0.00010304274,0.0009938367,0.00078803254,0.0000017990918,0.0039402666,0.008477969,0.0064394833,0.88989985,0.08669128,0.0011987037],"about_ca_topic_score_codex":0.000010694817,"about_ca_topic_score_gemma":0.0000014726153,"teacher_disagreement_score":0.9107939,"about_ca_system_score_codex":0.00037187024,"about_ca_system_score_gemma":0.00021498125,"threshold_uncertainty_score":0.99990493},"labels":[],"label_agreement":null},{"id":"W7104395180","doi":"10.55016/ojs/cdm.v19i4.74294","title":"Hankel determinants of certain sequences of Bernoulli polynomials","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vandermonde matrix; Bernoulli's principle; Bernoulli polynomials; Bernoulli number; Hankel matrix; Connection (principal bundle); Stirling number; Identity (music)","score_opus":0.02532810240919851,"score_gpt":0.3586381167658341,"score_spread":0.3333100143566356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104395180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46093288,0.003303302,0.49131045,0.003307503,0.0018672813,0.006530934,0.013170434,0.00018027499,0.019396933],"genre_scores_gemma":[0.93775725,0.00022325203,0.04979374,0.0001224958,0.0001658956,0.0002749444,0.000036571593,0.00009236327,0.011533484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99198186,0.00038482776,0.0050149937,0.0007141545,0.0008017725,0.0011023808],"domain_scores_gemma":[0.988485,0.00526538,0.0020036488,0.0021878392,0.0016169291,0.0004412298],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026321537,0.00088649895,0.0033451975,0.0008834825,0.0004478858,0.00013463451,0.0012359245,0.0006689712,0.0015213364],"category_scores_gemma":[0.011844951,0.0007965462,0.0009809406,0.0017543525,0.000818983,0.00022246125,0.00066361134,0.00041101416,0.00018549859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020964337,0.002968886,0.0006095128,0.013719759,0.0010954185,0.0000104465535,0.0045248354,0.00012766666,0.032708373,0.9292429,0.011063071,0.0037194993],"study_design_scores_gemma":[0.0029886873,0.0010107674,0.00020936529,0.014682201,0.004268028,0.000035578894,0.004676525,0.012131588,0.42851046,0.52305704,0.0067888633,0.0016409329],"about_ca_topic_score_codex":0.00013143358,"about_ca_topic_score_gemma":0.000075674136,"teacher_disagreement_score":0.47682437,"about_ca_system_score_codex":0.00032739498,"about_ca_system_score_gemma":0.0010766342,"threshold_uncertainty_score":0.99944854},"labels":[],"label_agreement":null},{"id":"W7104401270","doi":"10.55016/ojs/cdm.v20i1.74719","title":"Fair partitions of the plane into incongruent pentagons","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Plane (geometry); Regular polygon; Euclidean geometry; Convex body; Convex curve","score_opus":0.012810862617321419,"score_gpt":0.33384873312555197,"score_spread":0.32103787050823057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104401270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052664552,0.00088636257,0.8186856,0.056153752,0.0017186229,0.011842588,0.0103988955,0.00031585296,0.047333803],"genre_scores_gemma":[0.95198494,0.000095797586,0.036113486,0.00041991778,0.00013207532,0.0011714671,0.00010200352,0.00008145957,0.009898828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99483645,0.00021681775,0.002669951,0.00063968997,0.0007786483,0.00085845764],"domain_scores_gemma":[0.9923512,0.0018468898,0.0010612922,0.0031976968,0.0011766902,0.00036625756],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011635215,0.0007009928,0.0012991669,0.0003825277,0.0014384586,0.0002379776,0.0018052645,0.0003675769,0.0006229278],"category_scores_gemma":[0.0043581636,0.00054617244,0.0007791546,0.0022836826,0.0006679019,0.00013638682,0.0013655261,0.00061145617,0.00029179297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011844336,0.0017113982,0.0000736632,0.0018342915,0.0004788856,0.0000011216525,0.0033532828,0.00012986035,0.0030503266,0.90010387,0.08906399,0.0001874626],"study_design_scores_gemma":[0.0013735736,0.00011924973,0.00024738238,0.0040757586,0.002253784,0.000015479342,0.0043048994,0.007481296,0.024349162,0.88744736,0.067483895,0.0008481671],"about_ca_topic_score_codex":0.00007182494,"about_ca_topic_score_gemma":0.00028302745,"teacher_disagreement_score":0.8993204,"about_ca_system_score_codex":0.0005285054,"about_ca_system_score_gemma":0.00084850466,"threshold_uncertainty_score":0.99986154},"labels":[],"label_agreement":null},{"id":"W7104401656","doi":"10.55016/ojs/cdm.v20i1.75917","title":"On Freiman-Lev conjecture","year":2025,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Anhui Province; National Natural Science Foundation of China","keywords":"Conjecture; Set (abstract data type); Upper and lower bounds; Beal's conjecture; Finite set","score_opus":0.010861542113256363,"score_gpt":0.3285934601710092,"score_spread":0.31773191805775286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104401656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069720745,0.0024935359,0.70787144,0.017486904,0.0065414235,0.007445515,0.007921755,0.0008045234,0.17971413],"genre_scores_gemma":[0.9674884,0.00011372652,0.013270982,0.00275419,0.00039848706,0.0002588829,0.00007832622,0.0001362851,0.0155007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994496,0.0003416778,0.0018690104,0.0010456304,0.0008105236,0.0014371522],"domain_scores_gemma":[0.9913372,0.0039395816,0.00053378573,0.0028757039,0.0007742232,0.00053953636],"candidate_categories":["metaresearch","metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013030634,0.0011616852,0.0016884839,0.0008633328,0.00216471,0.0004446611,0.001469651,0.0008603241,0.0013873253],"category_scores_gemma":[0.009661991,0.0009842167,0.00084663107,0.0016693689,0.00054319,0.00014923247,0.0010088278,0.0012797317,0.00052239624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010318198,0.00051305257,0.0000118110665,0.0008329799,0.0007657544,0.000023812152,0.0022232665,0.00017997387,0.00016885149,0.94378126,0.050465807,0.0009302587],"study_design_scores_gemma":[0.0018363579,0.0003612142,0.00007502396,0.0023109855,0.0010897785,0.000020660547,0.0008133425,0.0027605095,0.0022503743,0.96223396,0.025280783,0.00096701965],"about_ca_topic_score_codex":0.000006812575,"about_ca_topic_score_gemma":0.000013259731,"teacher_disagreement_score":0.89776766,"about_ca_system_score_codex":0.00062304764,"about_ca_system_score_gemma":0.00039195112,"threshold_uncertainty_score":0.99952555},"labels":[],"label_agreement":null},{"id":"W7128185158","doi":"10.55016/ojs/cdm.v8i2.62050","title":"Colouring stability two unit disk graphs","year":2014,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Chromatic scale; Unit disk; Graph; Clique number; Clique; Unit disk graph; Stability (learning theory)","score_opus":0.03198840706107389,"score_gpt":0.3446661638066141,"score_spread":0.3126777567455402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128185158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06839088,0.00020365472,0.92080027,0.0029190076,0.00053434033,0.0020481753,0.00069695205,0.00033351697,0.0040731835],"genre_scores_gemma":[0.94613934,0.000033287746,0.05265656,0.0001826742,0.00015285307,0.00023565486,0.000028190114,0.00006671916,0.0005047127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99261194,0.0011226208,0.001529721,0.0013569039,0.0012980038,0.0020807872],"domain_scores_gemma":[0.99002886,0.0025978028,0.00047081706,0.0038640168,0.0016971261,0.0013413532],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0052676992,0.0007641614,0.0011066775,0.0005647577,0.0016568608,0.0009842514,0.003223709,0.0002255388,0.0002928588],"category_scores_gemma":[0.008120045,0.00074195204,0.0004996503,0.003363156,0.0009048874,0.00087918685,0.0023831762,0.0009578913,0.000932024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003647211,0.00042654065,0.000542154,0.00020713355,0.00010657111,0.0000080213285,0.0021857717,0.0007633417,0.0012875528,0.9891284,0.00012412408,0.0051838844],"study_design_scores_gemma":[0.0015486716,0.00047334676,0.0006153655,0.00037621282,0.0001179621,0.000024151155,0.00041676106,0.24396922,0.0063043814,0.7411105,0.0040667634,0.0009766504],"about_ca_topic_score_codex":0.000021291935,"about_ca_topic_score_gemma":0.00006625255,"teacher_disagreement_score":0.8777485,"about_ca_system_score_codex":0.0004208923,"about_ca_system_score_gemma":0.00034832355,"threshold_uncertainty_score":0.99984586},"labels":[],"label_agreement":null},{"id":"W7128185748","doi":"10.55016/ojs/cdm.v8i2.62187","title":"The exact maximal energy of integral circulant graphs with prime power order","year":2014,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Circulant matrix; Circulant graph; Vertex (graph theory); Eigenvalues and eigenvectors; Adjacency list; Prime power; Graph energy; Prime (order theory)","score_opus":0.00858835654803806,"score_gpt":0.2641424108237592,"score_spread":0.25555405427572114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128185748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04942515,0.00035307833,0.93549126,0.0028173514,0.00021674285,0.001777165,0.0011109144,0.0001489754,0.008659382],"genre_scores_gemma":[0.9830509,0.00006938493,0.015008444,0.00012170202,0.00007172132,0.00042302877,0.000062200794,0.00011211568,0.0010805483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99545354,0.0004144148,0.001654207,0.0006200049,0.0007745468,0.0010832846],"domain_scores_gemma":[0.99167794,0.002760913,0.0010129736,0.0024730498,0.0016096908,0.00046545974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019655193,0.0007526128,0.0011286602,0.00026170662,0.0012983346,0.0002708441,0.0012467876,0.00030166464,0.00022323366],"category_scores_gemma":[0.0026014897,0.0004827709,0.0004867628,0.0016633444,0.0010518776,0.00016099305,0.00032214087,0.00049575354,0.00010112272],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000996453,0.00065448333,0.000034066907,0.0001345482,0.0004949936,0.0000019030621,0.0015148503,0.00002818649,0.0013495944,0.99400663,0.0008781873,0.0008029225],"study_design_scores_gemma":[0.0012599771,0.00068371726,0.00012944225,0.0007283724,0.0009060064,0.000072923445,0.002159969,0.004461724,0.007052868,0.96445024,0.01728217,0.00081260625],"about_ca_topic_score_codex":0.000024750178,"about_ca_topic_score_gemma":0.000063815445,"teacher_disagreement_score":0.9336257,"about_ca_system_score_codex":0.00012908484,"about_ca_system_score_gemma":0.0002805169,"threshold_uncertainty_score":0.9997624},"labels":[],"label_agreement":null},{"id":"W7128204003","doi":"10.55016/ojs/cdm.v8i2.62114","title":"Translation planes of order 23^2","year":2014,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Modulo; Complement (music); Translation (biology); Quotient; Order (exchange); Group (periodic table)","score_opus":0.04147051683289361,"score_gpt":0.3536022883380102,"score_spread":0.3121317715051166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128204003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03445394,0.00044095257,0.9349162,0.0028329594,0.0003976655,0.003203888,0.0032836127,0.00019299443,0.020277789],"genre_scores_gemma":[0.9002053,0.00006983176,0.09612606,0.00009319853,0.0003775919,0.0001864431,0.0003086972,0.0001861638,0.00244668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99394387,0.0006931971,0.0022325278,0.00065158826,0.0012755002,0.0012033294],"domain_scores_gemma":[0.98926675,0.005659664,0.000722327,0.0019144046,0.0018712018,0.0005656354],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.004042507,0.0006985327,0.0015411031,0.00062013103,0.0004486001,0.00019115409,0.0010353602,0.0005177866,0.0010937068],"category_scores_gemma":[0.013575232,0.0006673953,0.00041926332,0.0017378062,0.00050446054,0.00026596268,0.000299257,0.000610773,0.0013498566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017495592,0.001028977,0.000050123912,0.0028228622,0.0003937917,0.0000042190127,0.007799243,0.00032211546,0.005667005,0.9750926,0.002256878,0.0043872297],"study_design_scores_gemma":[0.0041609984,0.00140608,0.00011156336,0.002410049,0.0012371537,0.00005581455,0.002425793,0.1498134,0.014953385,0.79854256,0.023228388,0.0016547925],"about_ca_topic_score_codex":0.000012506835,"about_ca_topic_score_gemma":0.000034168515,"teacher_disagreement_score":0.8657514,"about_ca_system_score_codex":0.00021487482,"about_ca_system_score_gemma":0.00028302867,"threshold_uncertainty_score":0.99981946},"labels":[],"label_agreement":null},{"id":"W7128239256","doi":"10.55016/ojs/cdm.v8i2.62202","title":"Cycles, wheels, and gears in finite planes","year":2014,"lang":"","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Finite element method; Projective plane; Element (criminal law); Finite geometry; Finite set; Projective test","score_opus":0.02631088053400683,"score_gpt":0.3341054009846059,"score_spread":0.3077945204505991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128239256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49079823,0.0025707928,0.45378292,0.011567581,0.0012374767,0.008828629,0.00618537,0.0005868217,0.024442168],"genre_scores_gemma":[0.9750818,0.00028891038,0.019941349,0.0002591715,0.0003345386,0.0002845239,0.00012440914,0.00019394043,0.0034913672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935973,0.0008759634,0.0018692983,0.00095040665,0.0009467915,0.0017602135],"domain_scores_gemma":[0.98980004,0.006694421,0.00041629747,0.0017457994,0.00048597515,0.00085747696],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0052229813,0.00083471136,0.0015494176,0.00091089716,0.0005332784,0.0005780398,0.00093451847,0.00056713534,0.00044939003],"category_scores_gemma":[0.022245873,0.0008293791,0.00022687468,0.0012516137,0.0005791465,0.0003285271,0.0009885853,0.0010727127,0.0011568908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014384292,0.00086917053,0.00076011254,0.0020070197,0.00019044985,0.000050121867,0.008611298,0.00017494391,0.00065511616,0.98031294,0.0033519417,0.0028730342],"study_design_scores_gemma":[0.003673919,0.0006520882,0.001093445,0.0025826057,0.00032738398,0.000096213116,0.0028391615,0.13168114,0.00048690004,0.8410122,0.013967059,0.001587874],"about_ca_topic_score_codex":0.000034941928,"about_ca_topic_score_gemma":0.00015877029,"teacher_disagreement_score":0.48428357,"about_ca_system_score_codex":0.00039899672,"about_ca_system_score_gemma":0.00020203736,"threshold_uncertainty_score":0.9996208},"labels":[],"label_agreement":null}]}