{"meta":{"query_hash":"cffd719b121f","filters":{"venue":"Discrete Mathematics"},"cohort_total":687,"direct_labels_cover":0,"predictions_cover":687,"exported":687,"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/cffd719b121f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Discrete+Mathematics"},"results":[{"id":"W1001014873","doi":"10.1016/j.disc.2015.04.021","title":"New bounds for chromatic polynomials and chromatic roots","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chromatic scale; Upper and lower bounds; Graph; Chromatic polynomial; Order (exchange); Discrete mathematics; Mathematical analysis","score_opus":0.06934156671547613,"score_gpt":0.3475302862876567,"score_spread":0.27818871957218055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1001014873","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.18513009,0.00069038686,0.79689634,0.0009005273,0.0013540292,0.004217444,0.00006819461,0.0009375209,0.00980549],"genre_scores_gemma":[0.13725388,0.000015324926,0.857847,0.00009059613,0.0005924921,0.0002628087,0.000020108184,0.00028661083,0.0036312165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966235,0.000074786716,0.0013023114,0.00051442115,0.00073017715,0.00075476593],"domain_scores_gemma":[0.9953379,0.0018741451,0.00073636713,0.0011312693,0.00022518013,0.0006951455],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00115443,0.00063781807,0.0012501833,0.00018495561,0.00020459385,0.00026409765,0.0005683408,0.00025065834,0.000049601913],"category_scores_gemma":[0.004891995,0.0005575055,0.00021867958,0.00031928136,0.00014749728,0.0004124021,0.0002711529,0.00020755007,0.00007194815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004669663,0.00030255853,0.000028125212,0.0033468015,0.0002366246,0.000010148894,0.008333624,0.000011557908,0.0009934814,0.95892656,0.026408808,0.0013550018],"study_design_scores_gemma":[0.0025459272,0.00032342726,0.000009746832,0.0004731097,0.00031892784,0.000090091875,0.0016442603,0.0064174514,0.0015070211,0.98446345,0.0015339735,0.0006726084],"about_ca_topic_score_codex":0.000009733224,"about_ca_topic_score_gemma":0.000012069472,"teacher_disagreement_score":0.06095065,"about_ca_system_score_codex":0.00021819415,"about_ca_system_score_gemma":0.000298422,"threshold_uncertainty_score":0.9996877},"labels":[],"label_agreement":null},{"id":"W1486394389","doi":"10.1016/j.disc.2014.03.002","title":"Semidefinite programming for permutation codes","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Semidefinite programming; Permutation (music); Combinatorics; Permutation group; Conjugacy class; Upper and lower bounds; Order (exchange); Symmetric group; Discrete mathematics","score_opus":0.01757138752844671,"score_gpt":0.2605234870199942,"score_spread":0.2429520994915475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486394389","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.0070621627,0.000014728988,0.9891169,0.00022313179,0.00008934017,0.00021732629,0.0000026913435,0.00022061817,0.0030530777],"genre_scores_gemma":[0.4504428,0.0000019289012,0.5492182,0.000116418814,0.000043929787,0.00007022787,0.000007736091,0.000011310211,0.00008746639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926615,0.000032543852,0.00018507434,0.00018463377,0.00013490995,0.00019667724],"domain_scores_gemma":[0.99905443,0.00038931074,0.000096190815,0.0003549362,0.00005649831,0.000048616894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005852277,0.00010522068,0.00013639957,0.00006641752,0.00014839509,0.00019122893,0.0003873782,0.000035450452,0.0000032018286],"category_scores_gemma":[0.00017197288,0.0000897728,0.00010528032,0.0001884664,0.000036206435,0.00018014465,0.00006671005,0.00004678605,0.000015490326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018207261,0.000024655323,0.000029145347,0.0000974149,0.00000971081,1.8997366e-7,0.0018241015,0.000022739001,0.00017809834,0.96377844,0.000060233204,0.03397343],"study_design_scores_gemma":[0.00024072645,0.00013453349,0.000041340503,0.00006946514,0.000020441019,0.0000066222988,0.00018249225,0.22749197,0.0010587745,0.7600735,0.0104685845,0.0002115599],"about_ca_topic_score_codex":5.1929e-7,"about_ca_topic_score_gemma":0.0000010882932,"teacher_disagreement_score":0.44338062,"about_ca_system_score_codex":0.0000068069103,"about_ca_system_score_gemma":0.000008673683,"threshold_uncertainty_score":0.36608285},"labels":[],"label_agreement":null},{"id":"W1488690765","doi":"10.1016/j.disc.2015.11.015","title":"Locating patterns in the de Bruijn torus","year":2015,"lang":"nl","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"De Bruijn sequence; Torus; Mathematics; Combinatorics; Sequence (biology); Binary number; Decoding methods; Square tiling; Matrix (chemical analysis); Discrete mathematics; Hexagonal tiling; Grid; De Bruijn graph; Algorithm; Arithmetic; Geometry","score_opus":0.07189366474569335,"score_gpt":0.3402101218077608,"score_spread":0.2683164570620674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1488690765","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.31302613,0.0022747112,0.58018404,0.0054812254,0.0034611581,0.006467196,0.00018529703,0.0006871327,0.08823312],"genre_scores_gemma":[0.9143115,0.0000696504,0.08234039,0.00039013245,0.00073808513,0.0002459104,0.000021795915,0.00029866985,0.001583824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99360394,0.00063766213,0.0019992297,0.0006259542,0.0016427623,0.0014904722],"domain_scores_gemma":[0.9932591,0.0026129195,0.0010903209,0.0023142528,0.00030284375,0.00042059578],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0044902274,0.00092015683,0.0012481998,0.00022557465,0.00022251917,0.00044695873,0.002074587,0.00046733717,0.00012908039],"category_scores_gemma":[0.0062472615,0.0007073384,0.0003189819,0.00088539073,0.00028683935,0.000380597,0.0005211518,0.0011843857,0.000658258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038190734,0.0018108432,0.00075352954,0.004463506,0.00013504327,0.0002732971,0.15836376,0.00050973915,0.00005384933,0.82941526,0.0034114015,0.00077160035],"study_design_scores_gemma":[0.0017864681,0.00025015284,0.00004512959,0.0013296464,0.00030919668,0.0002088119,0.08079449,0.045129683,0.00024454657,0.86800957,0.0009820989,0.00091021927],"about_ca_topic_score_codex":0.000071962466,"about_ca_topic_score_gemma":0.00015766008,"teacher_disagreement_score":0.6012854,"about_ca_system_score_codex":0.00074700674,"about_ca_system_score_gemma":0.00039573142,"threshold_uncertainty_score":0.99953777},"labels":[],"label_agreement":null},{"id":"W1512105312","doi":"10.1016/j.disc.2015.12.030","title":"Bounds on the maximum number of minimum dominating sets","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation of Sri Lanka","keywords":"Mathematics; Combinatorics; Lexicographical order; Domination analysis; Dominating set; Graph; Discrete mathematics; Upper and lower bounds; Vertex (graph theory)","score_opus":0.028074880962659372,"score_gpt":0.3196065664226326,"score_spread":0.2915316854599732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512105312","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.28012332,0.000016644666,0.672994,0.0035043715,0.00014275534,0.00037987233,0.000017332788,0.000102789774,0.042718884],"genre_scores_gemma":[0.9342506,0.0000063602342,0.06459745,0.00008761269,0.000019964167,0.000027849459,3.958904e-7,0.000020410227,0.0009893375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985165,0.00010327815,0.0003100261,0.00023083437,0.0005164733,0.00032286096],"domain_scores_gemma":[0.9969485,0.0016725782,0.00018429432,0.0010392469,0.00009340781,0.000061971616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008388602,0.0001440268,0.00019239307,0.00005685752,0.00012327779,0.00006489069,0.0012267691,0.000042565913,0.00009695426],"category_scores_gemma":[0.0005500462,0.0000686519,0.00009924731,0.00030291322,0.00023228445,0.00021229124,0.00036457446,0.00010543352,0.00022928986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061693186,0.00004892703,0.00010165717,0.000043727658,0.00001880603,0.0000045165757,0.0013016865,0.0000014574007,0.0031427918,0.9857979,0.00023534737,0.009297058],"study_design_scores_gemma":[0.00026999443,0.000058057783,0.000062818195,0.00021373988,0.000004384318,0.000016190905,0.00027471533,0.004320797,0.016735153,0.977594,0.00030122726,0.00014888594],"about_ca_topic_score_codex":7.6083563e-7,"about_ca_topic_score_gemma":5.7256165e-7,"teacher_disagreement_score":0.6541273,"about_ca_system_score_codex":0.000027332935,"about_ca_system_score_gemma":0.000028157987,"threshold_uncertainty_score":0.29471338},"labels":[],"label_agreement":null},{"id":"W1572651318","doi":"10.1016/j.disc.2006.05.018","title":"A characterization of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si4.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-comparability graphs","year":2006,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Bipartite graph; Mathematics; Comparability; Combinatorics; Graph; Transitive relation; Characterization (materials science); Path (computing); Discrete mathematics; Computer science","score_opus":0.021004266821016766,"score_gpt":0.257866261394366,"score_spread":0.23686199457334925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1572651318","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6942892,0.0005647061,0.016577657,0.00048147395,0.0015169451,0.000094887495,0.0004503712,0.00027109805,0.28575364],"genre_scores_gemma":[0.9838052,0.0005299336,0.011370569,0.00054832175,0.000876745,0.0007126142,0.0011319935,0.00060268585,0.00042194212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9888258,0.000670083,0.002558029,0.001992061,0.0033553257,0.0025987185],"domain_scores_gemma":[0.99020135,0.0019475686,0.0027465685,0.0038177166,0.0003325029,0.0009542853],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0031558382,0.00097494456,0.0005323027,0.0007203884,0.0013870681,0.0015503853,0.003469922,0.0016602783,0.1804625],"category_scores_gemma":[0.001679231,0.0017496434,0.0019094468,0.0021834557,0.0024116626,0.00216326,0.0026005849,0.00159101,0.0016182634],"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.00084577996,0.0006568991,0.00003898821,0.0027622357,0.00093708845,0.0005610519,0.0042155394,0.0013337905,0.012673035,0.9323502,0.04229216,0.0013331966],"study_design_scores_gemma":[0.0013952303,0.0011373367,0.00023488537,0.0013054096,0.0006588034,0.0005524864,0.0011062584,0.16038184,0.8275115,0.0033917367,0.0009033801,0.0014211474],"about_ca_topic_score_codex":0.00057029526,"about_ca_topic_score_gemma":0.0005014182,"teacher_disagreement_score":0.9289585,"about_ca_system_score_codex":0.000024117277,"about_ca_system_score_gemma":0.0012421084,"threshold_uncertainty_score":0.999913},"labels":[],"label_agreement":null},{"id":"W157468222","doi":"10.1016/j.disc.2003.12.003","title":"Light edges in degree-constrained graphs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Degree (music); Mathematics; Combinatorics; Graph; Bounded function; Constant (computer programming); Discrete mathematics; 1-planar graph; Line graph; Computer science; Physics","score_opus":0.026238300099238197,"score_gpt":0.2545521773285069,"score_spread":0.22831387722926869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157468222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073324054,0.00008696323,0.9157499,0.0015014503,0.00016719554,0.00015139343,0.000001416334,0.00009235798,0.00892527],"genre_scores_gemma":[0.78638214,0.000005165883,0.21335436,0.000111638605,0.000028097465,0.000012048112,0.000004617203,0.000005628552,0.00009630674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991602,0.000016143174,0.00024418707,0.00019282175,0.00021510759,0.00017158483],"domain_scores_gemma":[0.99952203,0.000053193533,0.00006522225,0.00026185453,0.000043149743,0.000054547352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020615688,0.00010801439,0.00013477843,0.0001775094,0.000057644458,0.000095171294,0.00033134146,0.00004075073,0.0000084087],"category_scores_gemma":[0.000052885895,0.00009509287,0.000054066193,0.0005598725,0.000017829692,0.0002596004,0.00007568567,0.00007496221,0.000050435665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.886868e-7,0.00009168523,0.000038936938,0.000032562308,0.000007815931,0.00001475763,0.0020920313,0.0031853945,0.0013552548,0.9852122,0.00006212291,0.007906252],"study_design_scores_gemma":[0.0008724525,0.000073804906,0.0012694926,0.00011334211,0.000007217881,0.000054493812,0.00017910603,0.03706899,0.01671206,0.94268155,0.0006386325,0.00032887986],"about_ca_topic_score_codex":0.000003395869,"about_ca_topic_score_gemma":0.000021405864,"teacher_disagreement_score":0.7130581,"about_ca_system_score_codex":0.000030281843,"about_ca_system_score_gemma":0.00006521335,"threshold_uncertainty_score":0.38777748},"labels":[],"label_agreement":null},{"id":"W1574893070","doi":"10.1016/j.disc.2012.03.018","title":"The intersection spectrum of Skolem sequences and its applications to <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si94.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>λ</mml:mi></mml:math>-fold cyclic triple systems","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Intersection (aeronautics); Mathematics; Spectrum (functional analysis); Scroll; Discrete mathematics; Algorithm; Combinatorics; Physics","score_opus":0.014777833416157732,"score_gpt":0.23422135265150526,"score_spread":0.21944351923534752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574893070","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9891037,0.00077450724,0.0064651296,0.00005132851,0.000707691,0.0002289366,0.00007890942,0.00014556236,0.0024442484],"genre_scores_gemma":[0.99850786,0.000091937174,0.00039731097,0.000020732601,0.00030127523,0.00047686085,0.000029508255,0.00007748715,0.00009705484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983499,0.000052163614,0.0006051743,0.00022168524,0.00033775455,0.00043329378],"domain_scores_gemma":[0.9986853,0.00030089283,0.00027360691,0.0005442759,0.000028284232,0.00016766561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069885526,0.0002480799,0.00022745464,0.00007299193,0.00029579346,0.00016108947,0.00032892858,0.00019374647,0.0000069245766],"category_scores_gemma":[0.00009437363,0.00022528331,0.00018622397,0.00026321984,0.000102585385,0.00026810644,0.00011972588,0.00021332224,0.00019113229],"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.000020802432,0.00003894569,0.000012374126,0.0008496173,0.00016391846,0.0000024092296,0.0024392458,0.0010109525,0.0036783165,0.99156034,0.000103443024,0.000119658274],"study_design_scores_gemma":[0.00025674648,0.00013374233,0.000041403546,0.000473673,0.00018002027,0.00014879934,0.0051576598,0.9749067,0.013669793,0.002457462,0.002240873,0.00033316572],"about_ca_topic_score_codex":0.000042197567,"about_ca_topic_score_gemma":0.00004273068,"teacher_disagreement_score":0.98910284,"about_ca_system_score_codex":0.000018368224,"about_ca_system_score_gemma":0.00002555341,"threshold_uncertainty_score":0.91867864},"labels":[],"label_agreement":null},{"id":"W1584410877","doi":"10.1016/j.disc.2015.06.025","title":"Homomorphisms of binary Cayley graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Cayley graph; Combinatorics; Foster graph; Bipartite graph; Discrete mathematics; Vertex-transitive graph; Edge-transitive graph; Petersen graph; Voltage graph; Graph; Line graph","score_opus":0.020814942163330904,"score_gpt":0.21761016459963592,"score_spread":0.196795222436305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1584410877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9557551,0.000557539,0.0034117252,0.000010109681,0.0003892235,0.00017528882,0.000029365487,0.00024376706,0.039427876],"genre_scores_gemma":[0.99795693,0.000010098882,0.0018050557,0.0000045142647,0.000019466408,0.000012909486,0.000008271659,0.000031834003,0.0001509417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992923,0.000019682038,0.0002815443,0.000075715485,0.00017520245,0.00015553381],"domain_scores_gemma":[0.99945664,0.000035950143,0.000050696966,0.00032044502,0.000039443763,0.000096828306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025430406,0.00012818456,0.00024025181,0.000083796236,0.000017506058,0.000011265947,0.00016735848,0.000059855305,0.000024322677],"category_scores_gemma":[0.000024676163,0.00011003762,0.00008358165,0.00019423537,0.00005887361,0.000067802874,0.000022852568,0.000071881535,0.00006058904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001904207,0.00016736344,0.00061032013,0.0020400689,0.00028618381,0.000043936307,0.015827555,0.008351461,0.020995984,0.94356465,0.0077091367,0.00038429725],"study_design_scores_gemma":[0.0019573092,0.00041266368,0.00044504885,0.00085513724,0.0002340231,0.00015660052,0.016801491,0.11067164,0.0467645,0.8158948,0.0043991916,0.001407644],"about_ca_topic_score_codex":0.000003076585,"about_ca_topic_score_gemma":9.642953e-7,"teacher_disagreement_score":0.1276699,"about_ca_system_score_codex":0.000011743982,"about_ca_system_score_gemma":0.000008268882,"threshold_uncertainty_score":0.44872037},"labels":[],"label_agreement":null},{"id":"W1643754303","doi":"10.1016/j.disc.2016.08.026","title":"On acyclic edge-coloring of complete bipartite graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Nuclear Receptors and Signaling","field":"Neuroscience","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Indian Statistical Institute","keywords":"Combinatorics; Mathematics; Edge coloring; Bipartite graph; Vertex (graph theory); Directed acyclic graph; Complete coloring; Discrete mathematics; Graph; Graph power; Line graph","score_opus":0.053752018305178645,"score_gpt":0.27566751090423286,"score_spread":0.22191549259905421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1643754303","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9889125,0.0000072385196,0.0021599452,0.00015777681,0.00016919988,0.00015344551,0.000025581016,0.000065277694,0.008349028],"genre_scores_gemma":[0.99852234,0.000018426947,0.0009174852,0.000097343,0.000023662533,0.0000063625466,3.524835e-7,0.000029195486,0.00038485992],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99895114,0.00004076524,0.00029459837,0.00020999637,0.0002714753,0.00023200565],"domain_scores_gemma":[0.9989209,0.000519513,0.00016111504,0.00031171134,0.00001831707,0.00006843488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014544773,0.00012773775,0.0002197001,0.000086488995,0.000083555125,0.000023953302,0.00025082607,0.000036636513,0.00030324835],"category_scores_gemma":[0.00042528508,0.00007763195,0.000107497115,0.00016739457,0.00013185282,0.0000870163,0.0000708711,0.000063785046,0.00029474185],"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.000010920061,0.00005032398,0.00005885292,0.00004778228,0.000004306241,0.0000023048146,0.00040734885,0.0000054166294,0.797054,0.20128605,0.00017531925,0.0008974074],"study_design_scores_gemma":[0.00053712423,0.00019608991,0.00010339072,0.0004871956,0.00001828714,0.0000065310574,0.00009103405,0.0010511634,0.8859265,0.10860376,0.0027126789,0.00026623774],"about_ca_topic_score_codex":0.0000014570559,"about_ca_topic_score_gemma":5.093115e-7,"teacher_disagreement_score":0.092682295,"about_ca_system_score_codex":0.0000145725,"about_ca_system_score_gemma":0.0000069074954,"threshold_uncertainty_score":0.37884086},"labels":[],"label_agreement":null},{"id":"W1673750067","doi":"10.1016/j.disc.2015.08.024","title":"Colorings and spectral radius of digraphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Spectral radius; Mathematics; Combinatorics; RADIUS; Order (exchange); Discrete mathematics; Eigenvalues and eigenvectors; Computer science; Physics; Quantum mechanics","score_opus":0.06394697952593209,"score_gpt":0.31423237553647776,"score_spread":0.25028539601054567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1673750067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9691943,0.00007779681,0.0036878847,0.000150479,0.000029735647,0.00028269461,0.000020406069,0.00007537866,0.026481321],"genre_scores_gemma":[0.94950044,0.000011460647,0.049988355,0.000013642956,0.000019588282,0.00002673227,0.0000031177187,0.000022080965,0.0004145878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991863,0.000023144044,0.00031415053,0.00013361304,0.00017960448,0.00016318471],"domain_scores_gemma":[0.99906766,0.00025309494,0.00016716355,0.0003295909,0.00005746239,0.00012502982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003845573,0.00012972276,0.00026902516,0.00006686342,0.000046077075,0.000019709003,0.00015269485,0.000052250693,0.000018717343],"category_scores_gemma":[0.00023442344,0.000107446656,0.00006926574,0.000182121,0.00017471307,0.000070279624,0.000054483793,0.000081898084,0.000008681006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071281956,0.00008964012,0.0002586436,0.00014297692,0.000028406477,0.0000010996887,0.0027267602,7.01714e-7,0.00053573283,0.99564487,0.0005018159,0.00006224854],"study_design_scores_gemma":[0.00031918377,0.00006019779,0.000103715516,0.000045032553,0.00006465959,0.000018691875,0.0017315304,0.00023758042,0.004206747,0.9926,0.00048676127,0.00012586186],"about_ca_topic_score_codex":0.000003397538,"about_ca_topic_score_gemma":0.0000030819115,"teacher_disagreement_score":0.04630047,"about_ca_system_score_codex":0.000009464095,"about_ca_system_score_gemma":0.000018041193,"threshold_uncertainty_score":0.43815476},"labels":[],"label_agreement":null},{"id":"W1745342855","doi":"10.1016/j.disc.2015.08.002","title":"A surprisingly simple de Bruijn sequence construction","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"De Bruijn sequence; Append; String (physics); Mathematics; Complement (music); Sequence (biology); Combinatorics; Amortized analysis; Discrete mathematics; Binary number; Simple (philosophy); Arithmetic; Computer science; Data structure; Programming language","score_opus":0.05442664942256222,"score_gpt":0.3003084988839092,"score_spread":0.24588184946134697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1745342855","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.013842327,0.000046286554,0.9816316,0.00020106524,0.00021423808,0.0000893103,0.000010915482,0.00017481878,0.0037894382],"genre_scores_gemma":[0.11828086,0.0000056319236,0.88127154,0.0001081351,0.000070767586,0.000007277211,0.000013685792,0.0000114880795,0.00023062147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990451,0.00003579464,0.00020463238,0.0002033597,0.00028083244,0.00023028142],"domain_scores_gemma":[0.9990183,0.00006219615,0.000110291076,0.0005616291,0.00008353012,0.00016406483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035690056,0.00011134063,0.00014170539,0.000060589136,0.00008130448,0.0001959566,0.0005548088,0.000039834216,0.000008648419],"category_scores_gemma":[0.000107707965,0.0000918395,0.000036691355,0.00025015604,0.000058201447,0.00048716232,0.00028620855,0.00009030911,0.000058866688],"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.0000086631235,0.00015037264,0.001025912,0.00012931177,0.000034546396,0.00009396678,0.008544076,0.00040672673,0.0018532957,0.92126775,0.021024415,0.045460977],"study_design_scores_gemma":[0.0003587488,0.00006000584,0.000046303176,0.00006901578,0.000010483779,0.00024512302,0.0005148297,0.69780105,0.002401789,0.28337607,0.014827703,0.0002888847],"about_ca_topic_score_codex":0.00005051894,"about_ca_topic_score_gemma":0.000008866411,"teacher_disagreement_score":0.6973943,"about_ca_system_score_codex":0.00007339138,"about_ca_system_score_gemma":0.00011635686,"threshold_uncertainty_score":0.37451062},"labels":[],"label_agreement":null},{"id":"W1765056582","doi":"10.1016/j.disc.2012.08.017","title":"Cayley graphs of order <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mn>30</mml:mn><mml:mi>p</mml:mi></mml:math> are Hamiltonian","year":2012,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Cayley graph; Combinatorics; Graph; Order (exchange); Discrete mathematics","score_opus":0.030197457730830032,"score_gpt":0.2787445718120991,"score_spread":0.24854711408126906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1765056582","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97446704,0.0012132202,0.0026285688,0.00034767247,0.0012244949,0.00035972815,0.0014331882,0.0002905189,0.01803558],"genre_scores_gemma":[0.9700968,0.00064288167,0.02468595,0.00039410833,0.00095459056,0.00053797715,0.00062902237,0.0009433451,0.0011153125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98977566,0.0004949722,0.0026816577,0.0012652763,0.0030125373,0.0027698842],"domain_scores_gemma":[0.98916763,0.0029430152,0.0026016296,0.0037780702,0.00044035312,0.0010692836],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.00372683,0.0013143029,0.001156428,0.00054344645,0.0010144244,0.00067651883,0.0022542307,0.0017215038,0.002668542],"category_scores_gemma":[0.0038858808,0.0015790196,0.0015665444,0.0013315226,0.0015985252,0.001060682,0.0020687962,0.0018848483,0.00449437],"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.0003904027,0.0013505885,0.00007012788,0.007426427,0.0014837143,0.00027888888,0.011901017,0.00013133007,0.0011639217,0.97018,0.0052827266,0.00034085457],"study_design_scores_gemma":[0.004068049,0.0017563312,0.00017987551,0.0067154807,0.0034543797,0.0009719689,0.017813362,0.84537077,0.05238778,0.058758207,0.005056509,0.0034672874],"about_ca_topic_score_codex":0.00020258523,"about_ca_topic_score_gemma":0.00021159097,"teacher_disagreement_score":0.9114218,"about_ca_system_score_codex":0.000065479326,"about_ca_system_score_gemma":0.0006923046,"threshold_uncertainty_score":0.99996084},"labels":[],"label_agreement":null},{"id":"W1780397282","doi":"10.1016/j.disc.2015.08.021","title":"On the geometric Ramsey numbers of trees","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; General position; Ramsey's theorem; Graph; Regular polygon; Discrete mathematics; Geometry","score_opus":0.0659309890628435,"score_gpt":0.308355392422251,"score_spread":0.24242440335940751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1780397282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88290685,0.00008969539,0.006656042,0.00029510874,0.00031205796,0.00045256934,0.00003273094,0.00009318794,0.10916178],"genre_scores_gemma":[0.98852694,0.0000067123647,0.010341,0.0001090405,0.000054618184,0.000015186759,0.00000247887,0.000040870716,0.00090315286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984577,0.00009242281,0.00045574733,0.00016077432,0.00058825227,0.00024511834],"domain_scores_gemma":[0.99666893,0.0019935674,0.0003046931,0.00081833586,0.00011257108,0.00010189315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010096624,0.00021212545,0.00037036292,0.00015348736,0.00011889142,0.000029308525,0.000522006,0.000094397416,0.00014591344],"category_scores_gemma":[0.0030614743,0.000114407245,0.00017937283,0.0004999646,0.00021438398,0.000051747138,0.00014794058,0.00018915457,0.000024759942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016143673,0.000081771395,0.00009183136,0.00008552902,0.000072659146,0.000002088831,0.004516824,0.000014228625,0.000016603835,0.9847742,0.010133405,0.00019476641],"study_design_scores_gemma":[0.0003046455,0.000101685866,0.000055853725,0.00007434528,0.000064417065,0.000008683256,0.0026846763,0.00041845828,0.0010816265,0.99464256,0.00040560437,0.00015743366],"about_ca_topic_score_codex":0.000005106344,"about_ca_topic_score_gemma":0.0000050146195,"teacher_disagreement_score":0.10825863,"about_ca_system_score_codex":0.000028133874,"about_ca_system_score_gemma":0.000027211343,"threshold_uncertainty_score":0.4665392},"labels":[],"label_agreement":null},{"id":"W1782134016","doi":"10.1016/j.disc.2015.04.012","title":"Two-dimensional balanced sampling plans avoiding adjacent units","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"China Scholarship Council; National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; Victoria University; University of Victoria","keywords":"Adjacency list; Sampling (signal processing); Mathematics; Column (typography); Point (geometry); Wright; Scheme (mathematics); Sampling scheme; Adjacency matrix; Mathematical optimization; Discrete mathematics; Combinatorics; Computer science; Statistics; Geometry; Connection (principal bundle); Mathematical analysis","score_opus":0.04944068887286893,"score_gpt":0.25395106434571846,"score_spread":0.20451037547284953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1782134016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9462628,0.00033089155,0.03079977,0.000025473688,0.00088990305,0.00025431803,0.000068239715,0.00058893114,0.020779707],"genre_scores_gemma":[0.9952561,0.0000027012784,0.0043831086,0.000021331307,0.000106815045,0.000015946016,0.000034743025,0.00004700404,0.00013219754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901336,0.000039328093,0.00029474567,0.00012530018,0.00024727033,0.00027999503],"domain_scores_gemma":[0.9993325,0.00013027739,0.000046912613,0.00026454654,0.00006121519,0.00016457756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046105083,0.00018724306,0.00024026119,0.00006486364,0.00008066278,0.000043857737,0.00015753203,0.000058617774,0.00002338455],"category_scores_gemma":[0.0000966967,0.00016484872,0.000048101698,0.0002126818,0.00002550156,0.000091681715,0.000036918078,0.0001835333,0.00013094206],"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.00004464741,0.00010804533,0.00086497696,0.001295694,0.00039936806,0.000050545696,0.02558087,0.60796964,0.025279177,0.3319696,0.0058457074,0.0005917524],"study_design_scores_gemma":[0.0031328858,0.000119539225,0.00012696667,0.0015417401,0.00015771136,0.0002221999,0.019809281,0.8436055,0.01725264,0.10665907,0.005600203,0.0017722412],"about_ca_topic_score_codex":0.000002672643,"about_ca_topic_score_gemma":0.000004256217,"teacher_disagreement_score":0.2356359,"about_ca_system_score_codex":0.000045643694,"about_ca_system_score_gemma":0.000018291339,"threshold_uncertainty_score":0.6722336},"labels":[],"label_agreement":null},{"id":"W1881477017","doi":"10.1016/j.disc.2015.09.020","title":"Entropy of symmetric graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics; Perfect graph theorem; Perfect graph; Factor-critical graph; Circulant graph; Line graph; Disjoint sets; Windmill graph; Voltage graph; Graph power; Graph","score_opus":0.051681198523323764,"score_gpt":0.3078868075246955,"score_spread":0.25620560900137174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1881477017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92939264,0.00035153533,0.0050855177,0.00007889257,0.0004975523,0.0004424766,0.000041040952,0.00016597401,0.0639444],"genre_scores_gemma":[0.92305636,0.000016763199,0.07635623,0.000035268167,0.000050479353,0.000010172021,0.0000043820196,0.000043771946,0.00042658125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983978,0.00006309072,0.00056338124,0.00017726496,0.00052701245,0.00027140975],"domain_scores_gemma":[0.998224,0.00046511294,0.0003258619,0.0006513228,0.00017275593,0.00016092275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065038796,0.00021226457,0.00046201918,0.00024832913,0.00007256541,0.000020133495,0.0003925499,0.00010458359,0.000066353845],"category_scores_gemma":[0.001343466,0.00015377767,0.00019962597,0.0005133295,0.00016708826,0.00008323245,0.00017259602,0.00013877652,0.000012534255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011589609,0.000087911445,0.0002852585,0.00023459065,0.00006992743,0.000003831349,0.0030970133,0.000002147217,0.00009441396,0.99418354,0.001693449,0.0002363076],"study_design_scores_gemma":[0.000456847,0.00008767105,0.00004594624,0.000056869492,0.00009179568,0.000017830798,0.0011037707,0.00052650453,0.001675493,0.99531424,0.00043761192,0.0001854241],"about_ca_topic_score_codex":0.0000038364524,"about_ca_topic_score_gemma":9.585838e-7,"teacher_disagreement_score":0.07127071,"about_ca_system_score_codex":0.00002439895,"about_ca_system_score_gemma":0.000031598323,"threshold_uncertainty_score":0.6270871},"labels":[],"label_agreement":null},{"id":"W1963635783","doi":"10.1016/s0012-365x(02)00298-4","title":"Solution of an outstanding conjecture: the non-existence of universal cycles with k=n−2","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Memorial University of Newfoundland; University of Saskatchewan; York University; University of Guelph; Simon Fraser University; University of Manitoba; University of Toronto; Carleton University","funders":"University of British Columbia; York University; Simon Fraser University; University of Saskatchewan","keywords":"Mathematics; Conjecture; Combinatorics; Sequence (biology); Word (group theory); Discrete mathematics; Set (abstract data type)","score_opus":0.0354910501675276,"score_gpt":0.2709126714978926,"score_spread":0.235421621330365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963635783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9478272,0.0000740964,0.039161935,0.000089347675,0.00007403541,0.0003663723,0.000039787392,0.000042995616,0.0123241935],"genre_scores_gemma":[0.96207404,0.000014550558,0.03771703,0.00001063271,0.000026270453,0.0000031042027,0.0000020313955,0.000025753765,0.00012661451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988978,0.00005540552,0.00036433633,0.0001458822,0.0003453398,0.00019122145],"domain_scores_gemma":[0.99852425,0.00035474455,0.00041058223,0.0005851822,0.00008007332,0.000045155903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030936344,0.00017505435,0.00034231142,0.00006563716,0.00016840319,0.000015412164,0.00037601066,0.000075470205,0.00008598467],"category_scores_gemma":[0.00010381051,0.00009598041,0.00009843081,0.00018703661,0.0004518255,0.00011601852,0.00008097416,0.00013152127,8.87787e-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.00003121673,0.0001255131,0.0002166121,0.0005455231,0.00012771737,0.0000053506583,0.026869463,0.000057565274,0.00082340307,0.970704,0.000102796555,0.00039080705],"study_design_scores_gemma":[0.0010258948,0.0005056953,0.00030585055,0.0005067271,0.00038078206,0.00007448545,0.013728708,0.042193897,0.01197304,0.9288546,0.000050854273,0.00039945543],"about_ca_topic_score_codex":0.0000070173705,"about_ca_topic_score_gemma":0.000011211511,"teacher_disagreement_score":0.042136334,"about_ca_system_score_codex":0.000019418121,"about_ca_system_score_gemma":0.00001014648,"threshold_uncertainty_score":0.39139673},"labels":[],"label_agreement":null},{"id":"W1964148783","doi":"10.1016/j.disc.2007.08.052","title":"Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Steiner tree problem; Connectivity; Neighbourhood (mathematics); Discrete mathematics; Graph; Induced subgraph","score_opus":0.015517588845970518,"score_gpt":0.28714373773133084,"score_spread":0.2716261488853603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964148783","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.3519831,0.00087613956,0.6425156,0.00034714997,0.00014827469,0.00044943552,0.000011574484,0.00014610148,0.0035226382],"genre_scores_gemma":[0.9045823,0.000045398425,0.09471469,0.00010555245,0.000025533593,0.0000229833,0.000005243484,0.00003649393,0.00046175023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975678,0.00007346691,0.0005344668,0.0005190157,0.0005717491,0.00073355174],"domain_scores_gemma":[0.99814236,0.000503478,0.0001227596,0.0009445693,0.000074342504,0.00021248094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012058666,0.00027756148,0.00034447474,0.0003132302,0.00010913665,0.00011974328,0.0008434017,0.00009437544,0.00001530422],"category_scores_gemma":[0.00015713701,0.000233703,0.00007359487,0.0008388035,0.00025646237,0.0004903999,0.00043258327,0.00032312007,0.000032508313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039781877,0.00023328245,0.0031124912,0.00049261167,0.000038847113,0.00059753255,0.004990007,0.00020462448,0.0009839763,0.9748733,0.00016474663,0.014268808],"study_design_scores_gemma":[0.00094934617,0.00014862101,0.0053871977,0.00028368592,0.000013208885,0.00013248173,0.00082076516,0.07210139,0.0008989705,0.9181422,0.00047937568,0.00064273615],"about_ca_topic_score_codex":0.000010899632,"about_ca_topic_score_gemma":0.00010179991,"teacher_disagreement_score":0.55259925,"about_ca_system_score_codex":0.00004827407,"about_ca_system_score_gemma":0.000027299193,"threshold_uncertainty_score":0.9530132},"labels":[],"label_agreement":null},{"id":"W1964296470","doi":"10.1016/s0012-365x(00)00055-8","title":"Longest paths in strong spanning oriented subgraphs of strong semicomplete multipartite digraphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multipartite; Digraph; Combinatorics; Mathematics; Bipartite graph; Path (computing); Discrete mathematics; Graph; Computer science; Quantum","score_opus":0.02621749155710442,"score_gpt":0.29682061700021123,"score_spread":0.27060312544310683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964296470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68871933,0.00026435417,0.30590326,0.00006494969,0.00006839048,0.0005295646,0.00003645205,0.00015946887,0.004254231],"genre_scores_gemma":[0.9177896,0.00005792254,0.081850894,0.000013691725,0.000016647351,0.000036590412,0.000012555304,0.00003383018,0.00018827236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720365,0.00014287623,0.00075449224,0.00051561417,0.0006435699,0.0007398287],"domain_scores_gemma":[0.99802715,0.0003365742,0.00022224429,0.0011477984,0.0000998372,0.00016642464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006698004,0.00030035074,0.0004892266,0.00041433758,0.000106692576,0.00008198072,0.0011659752,0.00008488905,0.000096010044],"category_scores_gemma":[0.000108006694,0.0002745688,0.0001741577,0.0013809525,0.00024710895,0.0006187041,0.00025079396,0.00035378113,0.0000361465],"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.00008252914,0.00060916785,0.027578807,0.00046955113,0.000112070615,0.00010993421,0.012893672,0.006765078,0.0056453333,0.9231817,0.00005569223,0.02249645],"study_design_scores_gemma":[0.0037659598,0.00059924304,0.012267055,0.0015915302,0.00005015952,0.000060491286,0.0034235127,0.81260014,0.0119412765,0.15078238,0.0011548984,0.0017633382],"about_ca_topic_score_codex":0.00003107942,"about_ca_topic_score_gemma":0.000043520107,"teacher_disagreement_score":0.80583507,"about_ca_system_score_codex":0.00004278461,"about_ca_system_score_gemma":0.00003892667,"threshold_uncertainty_score":0.9999707},"labels":[],"label_agreement":null},{"id":"W1964476238","doi":"10.1016/s0012-365x(03)00302-9","title":"On i−-ER-critical graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of South Africa","keywords":"Combinatorics; Mathematics; Corollary; Discrete mathematics; Indifference graph; Enhanced Data Rates for GSM Evolution; Graph; Domination analysis; Computer science; Vertex (graph theory)","score_opus":0.02765724729133736,"score_gpt":0.3274778824452344,"score_spread":0.29982063515389706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964476238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006952791,0.000054387143,0.9244092,0.00036484655,0.00016535925,0.00017288355,0.0000032823543,0.00018253767,0.06769471],"genre_scores_gemma":[0.7143973,0.00000779914,0.28468338,0.00024503353,0.000010713241,0.000030092859,9.446615e-7,0.000025841015,0.0005988866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983994,0.00011689818,0.00023103155,0.00032069968,0.0004928028,0.00043917203],"domain_scores_gemma":[0.99787843,0.00089321245,0.00004070759,0.0009527341,0.00006990956,0.00016498099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005224113,0.00016269168,0.00018378862,0.00014222915,0.00015055033,0.00013785361,0.0007671831,0.00005315064,0.000077566736],"category_scores_gemma":[0.0013161227,0.00013139758,0.00010278113,0.0004872073,0.00016517227,0.0002473933,0.00010950435,0.00021669954,0.00036130357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015890578,0.00008042189,0.000010178652,0.000031029896,0.000006831756,0.00001731671,0.00032822567,0.000016356145,0.00015112557,0.9986725,0.0002123335,0.00047209198],"study_design_scores_gemma":[0.00014015159,0.00009472564,0.000009451786,0.0000349606,0.0000030878805,0.00002297274,0.00008164004,0.005252746,0.0027037894,0.9907929,0.0006945031,0.00016909852],"about_ca_topic_score_codex":2.5623814e-7,"about_ca_topic_score_gemma":3.225584e-7,"teacher_disagreement_score":0.70744455,"about_ca_system_score_codex":0.000021708422,"about_ca_system_score_gemma":0.000029980627,"threshold_uncertainty_score":0.53582376},"labels":[],"label_agreement":null},{"id":"W1964602237","doi":"10.1016/j.disc.2010.06.037","title":"SC-Hamiltonian graphs and digraphs: New necessary conditions and their impacts","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hamiltonian path; Combinatorics; Hamiltonian (control theory); Separable space; Conjecture; Discrete mathematics; Pancyclic graph; Hamiltonian path problem; Digraph; Graph; Line graph; Pathwidth; Mathematical analysis","score_opus":0.019654365323875926,"score_gpt":0.2929845635242216,"score_spread":0.27333019820034565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964602237","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99120325,0.00012788702,0.0015449165,0.00071368867,0.0000679062,0.0004725518,0.00013728773,0.00020757668,0.0055249254],"genre_scores_gemma":[0.9804788,0.00008390905,0.018796947,0.00012270959,0.000040830146,0.000046416488,0.000026203023,0.000050580304,0.00035355505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988611,0.000030999203,0.00036887563,0.00028786634,0.0001354787,0.0003156933],"domain_scores_gemma":[0.9981602,0.000652491,0.00018474479,0.0006189488,0.00004636693,0.00033728793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032430992,0.00030017752,0.00034878653,0.00015540885,0.00036292413,0.00014877578,0.00021781224,0.00014415769,0.00010849203],"category_scores_gemma":[0.00023318423,0.00022640545,0.00010869515,0.00028147528,0.00038861882,0.00021044872,0.00010208971,0.00034029174,0.000012499998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030469178,0.000085793334,0.0005031488,0.000137589,0.00005763965,0.0000013160233,0.0032754133,8.518321e-8,0.011355042,0.9826133,0.001623344,0.00034426944],"study_design_scores_gemma":[0.0003424582,0.00003258202,0.0019010664,0.00008178957,0.000081752056,0.00008105601,0.0014731743,0.00018868122,0.0017868087,0.9930094,0.00073929003,0.00028194286],"about_ca_topic_score_codex":0.00001206852,"about_ca_topic_score_gemma":0.00010459562,"teacher_disagreement_score":0.01725203,"about_ca_system_score_codex":0.000004033236,"about_ca_system_score_gemma":0.000033699358,"threshold_uncertainty_score":0.9232546},"labels":[],"label_agreement":null},{"id":"W1965205248","doi":"10.1016/j.disc.2007.03.009","title":"p-adic valuations and k-regular sequences","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.016861409466790607,"score_gpt":0.26977123419743393,"score_spread":0.25290982473064333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965205248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111105554,0.00023287644,0.8823076,0.0004439069,0.00011068585,0.00010688136,0.0000020343173,0.00015513973,0.0055353413],"genre_scores_gemma":[0.73506635,0.000016511813,0.26430196,0.0002270054,0.000055844495,0.000005314624,0.0000024737465,0.000009607716,0.00031493435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991714,0.000018582283,0.00020372593,0.00017730956,0.00022582045,0.00020319952],"domain_scores_gemma":[0.9992459,0.0001857564,0.00007527816,0.00038562837,0.000030354293,0.000077127566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008724682,0.00009825181,0.000118229254,0.000067678295,0.0001202656,0.00013067461,0.0003727363,0.000037288948,0.000016886695],"category_scores_gemma":[0.000063930165,0.00007766321,0.00003443916,0.00019587029,0.00008356986,0.0002592469,0.00013170902,0.000056570552,0.000034088116],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.9194956e-7,0.00002261455,0.00008937609,0.000033306136,0.000011870667,0.000009974209,0.0028911796,0.0000074744116,0.0011480405,0.98600686,0.00019012277,0.00958881],"study_design_scores_gemma":[0.00021878183,0.000053541487,0.0017523695,0.00008444456,0.000021194923,0.0000961022,0.0011065159,0.15088713,0.004358862,0.8399246,0.0011928058,0.00030368846],"about_ca_topic_score_codex":0.0000035446685,"about_ca_topic_score_gemma":0.0000030384444,"teacher_disagreement_score":0.6239608,"about_ca_system_score_codex":0.000012537802,"about_ca_system_score_gemma":0.000017966175,"threshold_uncertainty_score":0.31670138},"labels":[],"label_agreement":null},{"id":"W1965839285","doi":"10.1016/j.disc.2006.04.042","title":"Constructions and bounds for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si50.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-splitting systems","year":2006,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Manitoba; University of Waterloo","funders":"","keywords":"Block (permutation group theory); Mathematics; Combinatorics; Type (biology); Discrete mathematics; Algorithm","score_opus":0.01351620445440694,"score_gpt":0.22577824832043367,"score_spread":0.21226204386602673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965839285","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9706673,0.0035113962,0.005628906,0.00024792986,0.003886509,0.00042389493,0.0016536159,0.0008707404,0.013109705],"genre_scores_gemma":[0.9864299,0.00066648936,0.005669141,0.00026088022,0.002726779,0.001774871,0.000972424,0.0012507687,0.00024870844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9870471,0.00050366565,0.003997428,0.0024133993,0.002615729,0.0034227122],"domain_scores_gemma":[0.9903716,0.0024347233,0.0029488124,0.0025574372,0.00039964393,0.0012878202],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.003437061,0.0019276554,0.0012621225,0.00079169497,0.0029204993,0.0031248156,0.0021713942,0.003023039,0.0006723371],"category_scores_gemma":[0.0013213019,0.0029063332,0.0024164747,0.0014518141,0.0019261827,0.0016628607,0.0013476607,0.0021882714,0.001124973],"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.00048305708,0.00040384498,0.000050467024,0.0074183666,0.0025695828,0.00036624825,0.004632144,0.0061963173,0.0027238973,0.96528447,0.008673722,0.0011979124],"study_design_scores_gemma":[0.005432441,0.0023275649,0.000044105822,0.008618105,0.0053053508,0.0048611094,0.025400443,0.675158,0.13398518,0.12663141,0.006843339,0.0053929486],"about_ca_topic_score_codex":0.001515461,"about_ca_topic_score_gemma":0.0005416584,"teacher_disagreement_score":0.838653,"about_ca_system_score_codex":0.0000927396,"about_ca_system_score_gemma":0.00076905644,"threshold_uncertainty_score":0.99965274},"labels":[],"label_agreement":null},{"id":"W1965909478","doi":"10.1016/j.disc.2004.08.044","title":"q and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si5.gif\" overflow=\"scroll\"><mml:mi>q</mml:mi><mml:mo>,</mml:mo><mml:mi>t</mml:mi></mml:math>-analogs of non-commutative symmetric functions","year":2005,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Scroll; Mathematics; Algorithm; Philosophy; Theology","score_opus":0.02118273781054072,"score_gpt":0.26596799874176386,"score_spread":0.24478526093122313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965909478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93374205,0.0012699263,0.026625905,0.0004946028,0.0017157395,0.0003709687,0.00060263945,0.0003700476,0.03480815],"genre_scores_gemma":[0.944799,0.0006744117,0.05108746,0.00032923385,0.00096820865,0.0006156505,0.0002619977,0.0007818889,0.00048217125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9907133,0.00032739327,0.003107155,0.0014101057,0.0025179249,0.001924135],"domain_scores_gemma":[0.9882016,0.0042448905,0.003550372,0.0027381903,0.000433551,0.0008313771],"candidate_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0020096134,0.0013164359,0.0011727513,0.00072696473,0.0013425492,0.0007826623,0.001772172,0.0016597704,0.001281206],"category_scores_gemma":[0.004265304,0.0017993288,0.0015333227,0.0017387404,0.0013800352,0.0012170936,0.0018480015,0.0017464594,0.001891445],"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.00027679856,0.0010732637,0.000006233866,0.004651594,0.001879964,0.00020302716,0.01042529,0.00085923646,0.0008817837,0.97183967,0.006745075,0.0011580754],"study_design_scores_gemma":[0.004202273,0.0023744747,0.000020163936,0.003937906,0.005292958,0.0012153975,0.01460311,0.590555,0.10771107,0.2656056,0.0017462956,0.002735746],"about_ca_topic_score_codex":0.00018755115,"about_ca_topic_score_gemma":0.00014355352,"teacher_disagreement_score":0.7062341,"about_ca_system_score_codex":0.00008852435,"about_ca_system_score_gemma":0.0007071078,"threshold_uncertainty_score":0.9999587},"labels":[],"label_agreement":null},{"id":"W1966250211","doi":"10.1016/j.disc.2005.10.002","title":"Extensions of the Critical Theorem","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Matroid; Discrete mathematics; Combinatorics; Identity (music)","score_opus":0.015465550735839117,"score_gpt":0.26586045480771964,"score_spread":0.25039490407188053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966250211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04546786,0.00009619761,0.91909367,0.006568247,0.0002323713,0.00014637192,0.000005330665,0.00012852573,0.028261453],"genre_scores_gemma":[0.9048495,0.0000033125643,0.09477496,0.00025454795,0.00003131149,0.0000036250108,1.2352531e-7,0.0000053913977,0.00007718025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999284,0.000050928476,0.00019405237,0.00012138837,0.00020196683,0.0001476349],"domain_scores_gemma":[0.99874866,0.00034422384,0.00005585949,0.00075808173,0.0000518688,0.000041330026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029727636,0.00008034325,0.000114773866,0.000033323744,0.000115892086,0.000038740767,0.0008304585,0.000030008765,0.000037241032],"category_scores_gemma":[0.0002353397,0.00004755732,0.00014240685,0.00026125016,0.0001844493,0.00012604624,0.0002748975,0.00008706405,0.000022941846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.568153e-7,0.00004938853,0.0000189746,0.000016494152,0.0000052073224,3.6983428e-7,0.0012918473,0.000010978497,0.000495324,0.9957907,0.0002183779,0.0021016507],"study_design_scores_gemma":[0.000086205175,0.000025973333,0.00025336607,0.000086999986,0.000018184148,0.000019357314,0.00017582407,0.028700149,0.0063227643,0.9622388,0.001954415,0.00011794515],"about_ca_topic_score_codex":3.9394922e-7,"about_ca_topic_score_gemma":0.0000010093545,"teacher_disagreement_score":0.8593817,"about_ca_system_score_codex":0.000004910997,"about_ca_system_score_gemma":0.000015229969,"threshold_uncertainty_score":0.19393313},"labels":[],"label_agreement":null},{"id":"W1966947400","doi":"10.1016/s0012-365x(01)00284-9","title":"Complete latin squares of order pn exist for odd primes p and n&gt;2","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Arizona State University","keywords":"Mathematics; Latin square; Combinatorics; Order (exchange); Integer (computer science); Prime (order theory); Group (periodic table); Discrete mathematics; Cyclic group; Abelian group; Physics","score_opus":0.026909461635927022,"score_gpt":0.2220562871268048,"score_spread":0.19514682549087778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966947400","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86320716,0.0023930008,0.06932121,0.00009324742,0.0003085109,0.0012298576,0.000376104,0.00039600144,0.06267493],"genre_scores_gemma":[0.98877245,0.000020988518,0.010588041,0.0000072299176,0.000029189217,0.000031490956,0.000009109861,0.000034250163,0.00050725223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939036,0.000011841007,0.00027315543,0.00008602021,0.00009032507,0.00014830167],"domain_scores_gemma":[0.9995295,0.00014736081,0.000055908262,0.00019631672,0.000032251886,0.00003867828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000112638525,0.00012687677,0.00024899023,0.000058038564,0.00004635809,0.000021802543,0.00008994537,0.00004748997,0.000056257133],"category_scores_gemma":[0.000039055118,0.00010864765,0.000054095082,0.00010946802,0.00005712962,0.000045806548,0.000016151473,0.000042431093,0.000009812311],"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.000015201944,0.00012801825,0.00038778165,0.009182175,0.0003340047,0.0000031852453,0.021606935,0.0014608339,0.032352764,0.9269113,0.0054587065,0.0021590926],"study_design_scores_gemma":[0.0020428381,0.00029359534,0.00037949035,0.0009776009,0.00021545398,0.000031708394,0.0043803654,0.73304814,0.013021315,0.21928129,0.02517866,0.0011495475],"about_ca_topic_score_codex":0.0000011101072,"about_ca_topic_score_gemma":0.0000019444212,"teacher_disagreement_score":0.7315873,"about_ca_system_score_codex":0.000005069555,"about_ca_system_score_gemma":0.0000012828064,"threshold_uncertainty_score":0.44305226},"labels":[],"label_agreement":null},{"id":"W1967400666","doi":"10.1016/s0012-365x(03)00159-6","title":"Lattice paths and the antiautomorphism of the poset of descending plane partitions","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Partially ordered set; Combinatorics; Lattice (music); Discrete mathematics; Plane (geometry); Geometry","score_opus":0.030069452569262627,"score_gpt":0.28664111295384037,"score_spread":0.25657166038457774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967400666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9336129,0.00044578436,0.043575432,0.00062263675,0.00072901335,0.0023507597,0.00018234462,0.00013098384,0.018350132],"genre_scores_gemma":[0.9468338,0.000038226415,0.052843507,0.000023685878,0.00001956141,0.000028762757,0.0000018838616,0.000045255012,0.00016535645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980443,0.00022187112,0.00084080745,0.00016723938,0.0004640743,0.00026171055],"domain_scores_gemma":[0.9955383,0.0025695064,0.0008120316,0.0008971738,0.00012796598,0.000055020646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001043605,0.00023502547,0.00060968474,0.00004924093,0.00018331228,0.000024469626,0.00039252965,0.000091490656,0.00003763267],"category_scores_gemma":[0.0033118608,0.00013096898,0.00017162651,0.00030810066,0.00064909976,0.00008909116,0.00014785661,0.00021532805,0.0000034427924],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009992149,0.00013626897,0.000099812554,0.00067026843,0.00006955407,0.0000010975449,0.003494683,0.0000072914945,0.00059244916,0.99475086,0.00014726559,0.000020442778],"study_design_scores_gemma":[0.0011502907,0.000031633757,0.000035572797,0.0004018086,0.0002747207,0.000048845002,0.0016309931,0.00075840857,0.012816171,0.9825512,0.00014351192,0.00015683065],"about_ca_topic_score_codex":0.0000032580647,"about_ca_topic_score_gemma":0.000003456346,"teacher_disagreement_score":0.018184775,"about_ca_system_score_codex":0.000021273567,"about_ca_system_score_gemma":0.00004437528,"threshold_uncertainty_score":0.53407604},"labels":[],"label_agreement":null},{"id":"W1967832448","doi":"10.1016/j.disc.2007.04.003","title":"Planarity of iterated line graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Line graph; Combinatorics; Iterated function; Planarity testing; Graph; Block graph; Discrete mathematics; Line (geometry); 1-planar graph; Geometry","score_opus":0.043474325233040824,"score_gpt":0.3347128059348521,"score_spread":0.29123848070181124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967832448","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88838905,0.000035064975,0.090271264,0.00010094808,0.0000528645,0.00037683162,0.00006748016,0.0001459887,0.020560483],"genre_scores_gemma":[0.94100344,0.000005405788,0.058524054,0.000034124212,0.000023821372,0.000011081689,0.000023888766,0.000027167189,0.00034702657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987648,0.00002466666,0.00059834786,0.00015232904,0.00022053237,0.00023931505],"domain_scores_gemma":[0.9983857,0.00063126505,0.00027499834,0.0005144567,0.00010784361,0.00008569772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094416353,0.00016097908,0.00030659136,0.00012606473,0.00008507551,0.000015149865,0.00024320815,0.000094040406,0.000110054236],"category_scores_gemma":[0.0002506585,0.00013312815,0.0001339354,0.00041978434,0.00012464909,0.000058408055,0.000045193636,0.00013805322,0.000020565752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013007984,0.0002466566,0.000117543284,0.00023888347,0.000042868553,0.000003206086,0.0013189653,0.0000014697418,0.0026057137,0.9948771,0.00035330091,0.00018126804],"study_design_scores_gemma":[0.00022901747,0.00004028885,0.00010998188,0.0000783194,0.00006303388,0.000011873392,0.0006020984,0.00041963227,0.021615297,0.9764003,0.00027875503,0.00015137134],"about_ca_topic_score_codex":0.0000033530314,"about_ca_topic_score_gemma":0.000012779291,"teacher_disagreement_score":0.052614354,"about_ca_system_score_codex":0.000009399316,"about_ca_system_score_gemma":0.000011921961,"threshold_uncertainty_score":0.54288083},"labels":[],"label_agreement":null},{"id":"W1968078289","doi":"10.1016/j.disc.2011.02.009","title":"Extra two-fold Steiner pentagon systems","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Beijing Institute For Brain Disorders","keywords":"Pentagon; Combinatorics; Mathematics; Fold (higher-order function); Multigraph; Steiner system; Path (computing); Discrete mathematics; Geometry; Computer science; Graph","score_opus":0.02788486845778938,"score_gpt":0.2116887652868379,"score_spread":0.18380389682904852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968078289","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5968227,0.0012391497,0.03947475,0.000005542654,0.0019784474,0.0007079378,0.00004397917,0.0011025621,0.35862496],"genre_scores_gemma":[0.99745953,0.000013432107,0.0012158805,0.0000064267724,0.00010158597,0.00005439261,0.000007779845,0.000068026355,0.0010729631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897087,0.000031786403,0.00038372804,0.00013901516,0.00018340943,0.00029120457],"domain_scores_gemma":[0.9993244,0.000035313366,0.000059508453,0.00045657737,0.000023766384,0.00010045692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025982116,0.00022014181,0.00028228038,0.000074097596,0.00005105691,0.000050706924,0.00024409284,0.00007256019,0.00017377219],"category_scores_gemma":[0.000009122142,0.00018345381,0.00010347916,0.00012616049,0.000035090106,0.00013039255,0.000026637521,0.00011913644,0.00035868326],"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.000014258352,0.00014061542,0.00042557987,0.0027768956,0.00036084882,0.00006716583,0.018228747,0.0020018718,0.016055087,0.9566704,0.0028011953,0.00045732787],"study_design_scores_gemma":[0.0055665104,0.0005810509,0.0012141409,0.0038315025,0.0010388197,0.0009285947,0.05457358,0.6764049,0.07283675,0.14560002,0.030802479,0.0066216625],"about_ca_topic_score_codex":0.000016337719,"about_ca_topic_score_gemma":0.0000034817656,"teacher_disagreement_score":0.8110704,"about_ca_system_score_codex":0.000021782444,"about_ca_system_score_gemma":0.0000041265616,"threshold_uncertainty_score":0.7481029},"labels":[],"label_agreement":null},{"id":"W1968105630","doi":"10.1016/j.disc.2007.06.025","title":"The diameter of protean graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Giant component; Discrete mathematics; Graph; Degree distribution; Random graph; Complex network","score_opus":0.010262389157823898,"score_gpt":0.2737825081792333,"score_spread":0.26352011902140937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968105630","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.102481954,0.000051809013,0.837812,0.00007735731,0.000033256914,0.00043734626,0.000008592819,0.000059150934,0.059038535],"genre_scores_gemma":[0.96786547,0.0000015343289,0.031725682,0.00000616522,0.000052067375,0.000015809737,0.000005051582,0.000013994878,0.0003142531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999235,0.000015218007,0.0003210459,0.0000860211,0.00015771556,0.00018500954],"domain_scores_gemma":[0.9991408,0.00021162946,0.00018314522,0.000385878,0.00004584566,0.000032727545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051796425,0.00009464506,0.00015884767,0.000036939382,0.00009313081,0.000026547948,0.00022539076,0.000015110046,0.000074461015],"category_scores_gemma":[0.000009703117,0.000058290196,0.00016314593,0.00018185134,0.000090759786,0.000028693486,0.000045142002,0.00007818248,0.000006558903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060747593,0.00010093329,0.008966527,0.000030137386,0.00017689537,4.5431705e-7,0.0008830526,0.0000039717097,0.0014260705,0.9640608,0.001221701,0.023123417],"study_design_scores_gemma":[0.00015489012,0.000046818397,0.0013089175,0.000067833345,0.00010156506,5.362345e-7,0.0014524409,0.0020786861,0.038522866,0.9517146,0.0043196105,0.00023123418],"about_ca_topic_score_codex":0.000018147044,"about_ca_topic_score_gemma":0.0000082788765,"teacher_disagreement_score":0.8653835,"about_ca_system_score_codex":0.0000049726846,"about_ca_system_score_gemma":0.0000066196912,"threshold_uncertainty_score":0.23770052},"labels":[],"label_agreement":null},{"id":"W1968120658","doi":"10.1016/j.disc.2003.06.003","title":"Explicit enumeration of 321, hexagon-avoiding permutations","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Enumeration; Mathematics; Generating function; Combinatorics; Recurrence relation; Simple (philosophy); Class (philosophy); Product (mathematics); Homogeneous space; Enumerative combinatorics; Term (time); Discrete mathematics; Computer science","score_opus":0.050434782911579,"score_gpt":0.3357405044320268,"score_spread":0.2853057215204478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968120658","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.28039166,0.000107341635,0.688128,0.000079743004,0.00048644078,0.000959846,0.000029559445,0.00026004013,0.029557388],"genre_scores_gemma":[0.7953555,0.000013589517,0.20379992,0.000015669992,0.000049579663,0.000077792174,0.000008433285,0.00009093915,0.0005886142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974821,0.00016083226,0.0010814583,0.0002980854,0.00058118807,0.0003963192],"domain_scores_gemma":[0.99652344,0.0015859945,0.0006743901,0.0008322027,0.00026200217,0.000121964265],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084065576,0.00034837952,0.0006480799,0.00016240825,0.00023767435,0.000052619667,0.00030270038,0.0001455298,0.00017496115],"category_scores_gemma":[0.0049303756,0.00032295272,0.00020844981,0.00044201754,0.00007942465,0.00028690134,0.00006353702,0.00026471892,0.00004930177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003197482,0.00025976007,0.00002969284,0.0005574748,0.0000530234,0.0000024756812,0.005699333,0.000047618138,0.005023558,0.9880319,0.00022520543,0.000066720226],"study_design_scores_gemma":[0.000501396,0.000068235924,0.000004291991,0.00021210643,0.00011761151,0.000026246651,0.004359076,0.0018383018,0.040266596,0.95193535,0.00033286412,0.00033793665],"about_ca_topic_score_codex":0.0000020314446,"about_ca_topic_score_gemma":0.000002958065,"teacher_disagreement_score":0.5149638,"about_ca_system_score_codex":0.00009098037,"about_ca_system_score_gemma":0.00008030673,"threshold_uncertainty_score":0.9999223},"labels":[],"label_agreement":null},{"id":"W1968125253","doi":"10.1016/j.disc.2005.09.046","title":"Mobility of vertex-transitive graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Mathematics; Combinatorics; Vertex-transitive graph; Symmetric graph; Cayley graph; Automorphism; Vertex (graph theory); Graph automorphism; Discrete mathematics; Lexicographical order; Transitive relation; Transitive reduction; Graph; Line graph; Voltage graph","score_opus":0.03776495248668868,"score_gpt":0.3203422358461354,"score_spread":0.28257728335944676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968125253","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9157227,0.000045099467,0.009511521,0.00006853732,0.00006147667,0.0006330604,0.00009125823,0.00013589393,0.073730424],"genre_scores_gemma":[0.97628754,0.0000043959226,0.02285395,0.000008724725,0.000023450317,0.000037169648,0.000015486374,0.00005785895,0.00071140856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785835,0.00013342832,0.00071327906,0.000271747,0.0006173009,0.0004058783],"domain_scores_gemma":[0.9973027,0.0013937112,0.00022192784,0.00080159283,0.00020678458,0.00007328544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010650452,0.00024535687,0.0005293685,0.00015567875,0.00006733105,0.00002468657,0.00037724597,0.00012474762,0.00019445145],"category_scores_gemma":[0.00053947204,0.00020709525,0.00022857673,0.0004092366,0.0003570814,0.00008865509,0.0000950547,0.00022006594,0.00002788889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034249988,0.0006278749,0.00045175632,0.0009704561,0.000058995385,0.000009051714,0.0014156658,0.000004910645,0.0052472097,0.9907188,0.0003603156,0.00010074995],"study_design_scores_gemma":[0.0004246411,0.00008679531,0.00047586506,0.0001250717,0.00006194371,0.000009646847,0.0008168626,0.0025422468,0.014595338,0.9806126,0.00003259046,0.0002164031],"about_ca_topic_score_codex":0.00004979891,"about_ca_topic_score_gemma":0.000023592593,"teacher_disagreement_score":0.07301901,"about_ca_system_score_codex":0.000042226013,"about_ca_system_score_gemma":0.000041218955,"threshold_uncertainty_score":0.8445099},"labels":[],"label_agreement":null},{"id":"W1968128554","doi":"10.1016/j.disc.2003.11.031","title":"The Hamilton–Waterloo problem: the case of Hamilton cycles and triangle-factors","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Ministerstvo školstva, vedy, výskumu a športu Slovenskej republiky; Natural Sciences and Engineering Research Council of Canada; Slovenská Akadémia Vied","keywords":"Mathematics; Combinatorics; Hamiltonian path; Hamiltonian (control theory); Factorization; Discrete mathematics; Mathematical optimization; Algorithm; Graph","score_opus":0.010628488815673309,"score_gpt":0.20978061464927777,"score_spread":0.19915212583360448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968128554","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.995499,0.00065261306,0.0011991094,0.000041445583,0.0001238932,0.00038329116,0.000020992964,0.00009211414,0.0019875162],"genre_scores_gemma":[0.99920136,0.0000943534,0.00044568098,0.0000046816076,0.000024679115,0.000027091977,0.0000027363435,0.000033281583,0.00016610994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916315,0.000042583943,0.00037194014,0.0000985561,0.000108717315,0.00021505242],"domain_scores_gemma":[0.9992067,0.0002493467,0.00008470217,0.00038911053,0.000021495038,0.00004859699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043775252,0.00017863073,0.00023374594,0.000034076213,0.00021667707,0.00007219942,0.00019275336,0.00006271695,0.0000035729277],"category_scores_gemma":[0.000023475926,0.00008766119,0.00009391232,0.00012268593,0.00017368833,0.00007057583,0.000022047974,0.00012218113,0.000005184907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003008493,0.00011440566,0.00027054583,0.0025717628,0.0006328834,0.00019257555,0.2400417,0.0068673803,0.007021435,0.7395355,0.00024189423,0.0024797977],"study_design_scores_gemma":[0.0034017293,0.00034786237,0.00042802942,0.0013475188,0.0005715784,0.002435463,0.14508365,0.017445713,0.07554061,0.7468609,0.005043646,0.0014932684],"about_ca_topic_score_codex":0.000048206024,"about_ca_topic_score_gemma":0.00011649593,"teacher_disagreement_score":0.09495805,"about_ca_system_score_codex":0.000016155882,"about_ca_system_score_gemma":0.0000059466984,"threshold_uncertainty_score":0.35747194},"labels":[],"label_agreement":null},{"id":"W1968181001","doi":"10.1016/j.disc.2004.02.003","title":"Ramsey numbers in complete balanced multipartite graphs. Part II: Size numbers","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Multipartite; Ramsey's theorem; Combinatorics; Discrete mathematics; Graph","score_opus":0.029877456998500543,"score_gpt":0.28952597875345,"score_spread":0.25964852175494946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968181001","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97552335,0.00007029701,0.001569906,0.0003491971,0.00056182133,0.0008526512,0.00010176158,0.00029435364,0.020676648],"genre_scores_gemma":[0.929038,0.000046506233,0.06972337,0.0003306905,0.00009281468,0.000077973746,0.000020316858,0.00011096053,0.0005593976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969473,0.00009819676,0.0010466313,0.0005082846,0.0005934784,0.0008060969],"domain_scores_gemma":[0.9974996,0.0007869994,0.00039473968,0.0010232405,0.00007815969,0.00021728706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006789674,0.00052836275,0.0008396849,0.00014225728,0.00042518773,0.00007504256,0.0006131964,0.00023903267,0.00029571788],"category_scores_gemma":[0.0009674204,0.0004429543,0.00034817064,0.00052778656,0.00036185858,0.00021233509,0.00030915037,0.0004716401,0.000044231456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004734461,0.00030720377,0.0011644833,0.00042033673,0.00013144015,0.000046242665,0.015793033,0.00018825862,0.00037368908,0.9803995,0.0010080226,0.00012046974],"study_design_scores_gemma":[0.0022953856,0.00007293507,0.0004806489,0.00042903173,0.00007682206,0.000037339756,0.001597531,0.0003984514,0.0005640105,0.99185586,0.0015590347,0.00063295517],"about_ca_topic_score_codex":0.000056983692,"about_ca_topic_score_gemma":0.00018084048,"teacher_disagreement_score":0.06815346,"about_ca_system_score_codex":0.000120991564,"about_ca_system_score_gemma":0.000046297475,"threshold_uncertainty_score":0.99980223},"labels":[],"label_agreement":null},{"id":"W1969337449","doi":"10.1016/j.disc.2007.11.006","title":"Bipartite graphs are not universal fixers","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.02775671963024989,"score_gpt":0.2992228160809777,"score_spread":0.27146609645072783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969337449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06271492,0.000038818933,0.9277001,0.00037588237,0.00014089954,0.00020460742,0.0000073796123,0.00025724035,0.008560143],"genre_scores_gemma":[0.8211449,0.000015851847,0.17742205,0.00019604334,0.00003269642,0.000005978486,0.0000028743657,0.000029224346,0.001150409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982845,0.000038854905,0.0002841778,0.0003188322,0.0005206893,0.0005529523],"domain_scores_gemma":[0.9983562,0.00033489673,0.00015193822,0.0008593206,0.00009731814,0.00020030237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086205,0.00017428794,0.00020643041,0.000261252,0.00016118832,0.00010854822,0.0011118496,0.00006452893,0.000025502757],"category_scores_gemma":[0.00014100756,0.00015231756,0.00011946157,0.00081998075,0.00017150711,0.00044400283,0.000337227,0.00020526431,0.0001561428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012034258,0.00006300665,0.00032104627,0.000052312913,0.00002381529,0.00008504176,0.0015797402,0.000050420964,0.00128529,0.99434775,0.0002242755,0.001955267],"study_design_scores_gemma":[0.001155033,0.0001956405,0.0025405432,0.00020523579,0.000027261602,0.00006636671,0.0036145395,0.043385617,0.03387372,0.90801895,0.0059196376,0.0009974727],"about_ca_topic_score_codex":0.000002561272,"about_ca_topic_score_gemma":0.0000105329755,"teacher_disagreement_score":0.75842994,"about_ca_system_score_codex":0.00004458973,"about_ca_system_score_gemma":0.000025584037,"threshold_uncertainty_score":0.621133},"labels":[],"label_agreement":null},{"id":"W1969412240","doi":"10.1016/j.disc.2008.01.039","title":"On Tutte polynomial uniqueness of twisted wheels","year":2008,"lang":"it","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Nankai University","keywords":"Tutte polynomial; Mathematics; Combinatorics; Polyhedral graph; Discrete mathematics; Hypercube; Chromatic polynomial; Uniqueness; Graph; Matroid; Line graph; Pathwidth; Voltage graph","score_opus":0.04184147399083735,"score_gpt":0.30485081405496806,"score_spread":0.2630093400641307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969412240","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.44479898,0.00026372063,0.5301559,0.0006419168,0.0005989732,0.0011582259,0.00013823129,0.0002079863,0.022036053],"genre_scores_gemma":[0.9524687,0.00011911874,0.04251683,0.00013952915,0.00009113497,0.000026184496,0.00000993936,0.00007864551,0.004549894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99613774,0.0003201613,0.0009559841,0.00063347514,0.001161652,0.0007910107],"domain_scores_gemma":[0.9958672,0.0010682497,0.00054137,0.001946491,0.00030156728,0.0002751139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083376426,0.0004632043,0.00079688337,0.00037572338,0.00029407456,0.000085314896,0.0019742246,0.00020289286,0.00013822831],"category_scores_gemma":[0.00052129856,0.00041511125,0.00031508453,0.0010765387,0.0008969981,0.00038843587,0.00064309314,0.0005020097,0.00024317516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019146678,0.00088091067,0.00018160771,0.0008605804,0.0002021643,0.00027279876,0.016060391,0.001049177,0.0060943635,0.97065103,0.0016790468,0.0018764688],"study_design_scores_gemma":[0.005047594,0.0030334203,0.0013896306,0.0032009485,0.00016858589,0.000595004,0.0013142083,0.21565346,0.15042631,0.6131361,0.0030412197,0.0029935017],"about_ca_topic_score_codex":0.000015175812,"about_ca_topic_score_gemma":0.0000021661585,"teacher_disagreement_score":0.50766975,"about_ca_system_score_codex":0.00010128742,"about_ca_system_score_gemma":0.00027753215,"threshold_uncertainty_score":0.99983007},"labels":[],"label_agreement":null},{"id":"W1971489185","doi":"10.1016/j.disc.2014.12.001","title":"Point determining digraphs, <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>{</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:math>-matrix partitions, and dualities in full homomorphisms","year":2014,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scroll; Mathematics; Algorithm; Theology; Philosophy","score_opus":0.022036936684090846,"score_gpt":0.2675929174034697,"score_spread":0.24555598071937884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971489185","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9458135,0.0024796305,0.022990545,0.0009847672,0.0021471828,0.00033134292,0.0014580995,0.0007029357,0.023092024],"genre_scores_gemma":[0.9662611,0.0018351034,0.02487532,0.0011328344,0.0015377589,0.0018003079,0.0010298123,0.001023859,0.00050390547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98262274,0.0011787891,0.0039710198,0.0033819175,0.0044318587,0.0044136513],"domain_scores_gemma":[0.9858802,0.0045209327,0.0033557813,0.003871746,0.00048100017,0.0018903173],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005537449,0.0020097818,0.0012151749,0.0012853971,0.0028916874,0.0035589463,0.0043885717,0.0023509315,0.004059523],"category_scores_gemma":[0.003566483,0.002983248,0.0023579749,0.0024046549,0.003695899,0.0033195228,0.004639621,0.0030648732,0.0018176319],"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.000945801,0.0007221041,0.00003410382,0.0029285706,0.0012605197,0.0012290037,0.008157094,0.0017212091,0.0023502274,0.9660663,0.011673374,0.002911721],"study_design_scores_gemma":[0.0037336627,0.003119241,0.00009382781,0.004406977,0.0015920585,0.0032033732,0.007520347,0.7444278,0.19305083,0.031029517,0.0040854593,0.0037368785],"about_ca_topic_score_codex":0.00065886375,"about_ca_topic_score_gemma":0.0008590647,"teacher_disagreement_score":0.9350368,"about_ca_system_score_codex":0.00007593405,"about_ca_system_score_gemma":0.0012612743,"threshold_uncertainty_score":0.9992645},"labels":[],"label_agreement":null},{"id":"W1971956496","doi":"10.1016/s0012-365x(99)00342-8","title":"Modified group divisible designs with block size four","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Block size; Block (permutation group theory); Combinatorics; Group (periodic table); Discrete mathematics; Arithmetic; Computer science","score_opus":0.017692051282143628,"score_gpt":0.20049401682381235,"score_spread":0.18280196554166872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971956496","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88019013,0.000103966864,0.02142905,0.000017154744,0.00008193036,0.00036431683,0.000016651673,0.00059652276,0.097200304],"genre_scores_gemma":[0.9932748,0.000016078639,0.004818842,0.000016618818,0.00004926869,0.00004579034,0.0000036966542,0.00006615097,0.001708764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907446,0.00002643865,0.00025194185,0.00014433991,0.00019977662,0.00030302102],"domain_scores_gemma":[0.9993426,0.0001284052,0.000030198024,0.0003907744,0.000013928943,0.000094097406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017376554,0.00022061933,0.00026248713,0.00003557735,0.00007918531,0.0000649311,0.00019937463,0.00007201128,0.00030736008],"category_scores_gemma":[0.000010509107,0.00016899998,0.000074764685,0.00019102983,0.000039899212,0.000104190665,0.000010245092,0.00011948316,0.00018285791],"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.00030010822,0.0008206776,0.00089212187,0.0072084027,0.0021814734,0.00042057366,0.03142046,0.44661176,0.024761502,0.4666309,0.0067822845,0.011969716],"study_design_scores_gemma":[0.00560608,0.00097393506,0.0015999716,0.0022148269,0.0006911569,0.0007622445,0.0041385936,0.73544735,0.011358272,0.22170874,0.01090712,0.004591727],"about_ca_topic_score_codex":0.0000029989708,"about_ca_topic_score_gemma":0.0000049038863,"teacher_disagreement_score":0.28883556,"about_ca_system_score_codex":0.000016448535,"about_ca_system_score_gemma":0.000004536322,"threshold_uncertainty_score":0.6891619},"labels":[],"label_agreement":null},{"id":"W1972322699","doi":"10.1016/j.disc.2012.07.018","title":"Separation properties of 3-Steiner and 3-monophonic convexity in graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Convexity; Combinatorics; Disjoint sets; Regular polygon; Convex set; Subderivative; Space (punctuation); Discrete mathematics; Convex optimization; Geometry; Computer science","score_opus":0.039361960832035935,"score_gpt":0.3071247290695605,"score_spread":0.2677627682375246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972322699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9208484,0.000642592,0.07717947,0.00007938289,0.000043597876,0.00023361472,0.000001591305,0.000029816034,0.0009414824],"genre_scores_gemma":[0.977451,0.000026291578,0.02239546,0.000012349281,0.000006131692,0.000018167984,6.557188e-7,0.000006691346,0.00008323369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991566,0.00005964125,0.00023584988,0.00012035457,0.0001970576,0.00023051973],"domain_scores_gemma":[0.99941623,0.000063212865,0.00008303239,0.000337323,0.00004065379,0.000059530586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052327744,0.00008979004,0.0001674828,0.0001204198,0.00003271403,0.00002717491,0.0002557773,0.000035337784,0.0000036782762],"category_scores_gemma":[0.000080619844,0.00006730652,0.00002823833,0.00029684743,0.00013330876,0.0005469736,0.00016830499,0.00008638655,0.0000097982365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012229488,0.0001498744,0.0064145005,0.0003920175,0.000016093434,0.000001144711,0.012577343,0.00003883942,0.027963918,0.9512938,0.000016053591,0.0011241663],"study_design_scores_gemma":[0.0012321661,0.00022782561,0.009476466,0.00043642003,0.000018313458,0.000038851147,0.0017973005,0.14318492,0.18012455,0.66258687,0.00019716365,0.0006791809],"about_ca_topic_score_codex":0.000004463558,"about_ca_topic_score_gemma":0.0000038017577,"teacher_disagreement_score":0.288707,"about_ca_system_score_codex":0.000012633187,"about_ca_system_score_gemma":0.000015670763,"threshold_uncertainty_score":0.27446803},"labels":[],"label_agreement":null},{"id":"W1972419950","doi":"10.1016/s0012-365x(03)00262-0","title":"Existence of (v,{5,w∗},1)-PBDs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; University Research Committee, Emory University; Mount Saint Vincent University","keywords":"Mathematics; Combinatorics; Block (permutation group theory); Embedding; Line (geometry); Discrete mathematics; Geometry; Computer science","score_opus":0.011148453049231023,"score_gpt":0.20617023034433635,"score_spread":0.19502177729510534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972419950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5998987,0.00047553898,0.036575608,0.00000491819,0.0003271247,0.00018925265,0.000012624213,0.00021528287,0.36230096],"genre_scores_gemma":[0.9932999,0.000010687492,0.0063467883,0.0000039953993,0.000009363409,0.00000888338,0.0000011708576,0.000021141903,0.0002980505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999434,0.000019236948,0.00023859876,0.00006218328,0.00011055618,0.00013542875],"domain_scores_gemma":[0.9995967,0.000047484024,0.000037539765,0.00026200176,0.00001862496,0.000037657723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019125958,0.00009808803,0.00017637292,0.00003779228,0.00001960137,0.000009093332,0.00010849427,0.000042095126,0.00007779851],"category_scores_gemma":[0.000041821575,0.00008475033,0.000066271714,0.00012907438,0.000039463655,0.000045193683,0.0000063905527,0.000054619883,0.000040526244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.537497e-7,0.000020539992,0.0001207939,0.000673379,0.000036275218,0.000002330557,0.00166892,0.00035954962,0.0043471134,0.99248236,0.00016850195,0.000119484845],"study_design_scores_gemma":[0.0008527341,0.00012546177,0.0002418864,0.0007254555,0.00012054699,0.0001168869,0.008653226,0.027774239,0.23176244,0.713036,0.015489192,0.0011019066],"about_ca_topic_score_codex":4.256472e-7,"about_ca_topic_score_gemma":4.6953693e-7,"teacher_disagreement_score":0.39340124,"about_ca_system_score_codex":0.0000072461717,"about_ca_system_score_gemma":0.0000041308067,"threshold_uncertainty_score":0.34560183},"labels":[],"label_agreement":null},{"id":"W1972595683","doi":"10.1016/s0012-365x(02)00482-x","title":"A note on {4}-GDDs of type 210","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Block size; Class (philosophy); Block (permutation group theory); Type (biology); Combinatorics; Discrete mathematics; Group (periodic table); Arithmetic; Computer science; Chemistry","score_opus":0.01162020813950074,"score_gpt":0.22679861714162675,"score_spread":0.215178409002126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972595683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6774232,0.0001972146,0.012414912,0.000008648922,0.0006023846,0.00022475881,0.0000143912575,0.00021155932,0.30890298],"genre_scores_gemma":[0.9977981,0.000008201429,0.0018547468,0.00000817672,0.000013916388,0.0000045061483,0.0000018082161,0.000026341804,0.00028422655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947953,0.000019500081,0.00020016578,0.00006282194,0.000112391834,0.00012561723],"domain_scores_gemma":[0.99958575,0.0000637695,0.000033184726,0.00026238814,0.000019477695,0.000035449113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016135535,0.00010366704,0.00017417951,0.00004602189,0.000018209399,0.000008358301,0.000085749445,0.000052401334,0.00007913726],"category_scores_gemma":[0.000059888254,0.00008652976,0.00005695553,0.00014566044,0.000022275952,0.000025456153,0.000004961346,0.00007075008,0.00011101627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006848084,0.00005776195,0.00004753985,0.000819738,0.000066979956,0.0000061533965,0.0032542306,0.003284965,0.0076207393,0.9838792,0.0006692918,0.00028656638],"study_design_scores_gemma":[0.0022296484,0.0008587927,0.00024093057,0.002024043,0.00028253117,0.00013879026,0.0050774207,0.11007154,0.30352852,0.51966363,0.053671706,0.0022124487],"about_ca_topic_score_codex":3.995114e-7,"about_ca_topic_score_gemma":5.395926e-7,"teacher_disagreement_score":0.46421555,"about_ca_system_score_codex":0.000009377684,"about_ca_system_score_gemma":0.0000049475134,"threshold_uncertainty_score":0.35285813},"labels":[],"label_agreement":null},{"id":"W1973160280","doi":"10.1016/j.disc.2005.02.020","title":"Flows that are sums of hamiltonian cycles in Cayley graphs on abelian groups","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Cayley graph; Abelian group; Combinatorics; Hamiltonian (control theory); Hamiltonian path; Graph; Discrete mathematics","score_opus":0.04186396644668725,"score_gpt":0.2956952100526406,"score_spread":0.2538312436059533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973160280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99002594,0.00014946893,0.0010033771,0.0007389343,0.00011549863,0.000395878,0.000045530356,0.00009180376,0.007433555],"genre_scores_gemma":[0.9756709,0.00005369893,0.023538578,0.00011521662,0.000056125144,0.00002798077,0.000008715872,0.00005854836,0.00047023658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790597,0.00007146619,0.0007385793,0.0003294391,0.00045642362,0.00049811567],"domain_scores_gemma":[0.99798894,0.0006628161,0.0004498795,0.0007302447,0.000049115417,0.00011902937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051325816,0.00033454568,0.0007499798,0.00060069445,0.00006746669,0.000025012578,0.00043037292,0.00020659043,0.00021986365],"category_scores_gemma":[0.00049642124,0.0002726831,0.00020902943,0.0006526946,0.00014562588,0.00010666083,0.00010232029,0.00028569938,0.00009457431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040758372,0.0012030086,0.015379903,0.0012463223,0.00016480431,0.00006058076,0.010763735,0.000110082176,0.00044144958,0.9642129,0.0020990463,0.0042774435],"study_design_scores_gemma":[0.0019905502,0.00025056087,0.013623271,0.00089680526,0.00012836246,0.0000504523,0.008641039,0.0034127848,0.0061685387,0.9630836,0.0008793142,0.00087470503],"about_ca_topic_score_codex":0.000033273278,"about_ca_topic_score_gemma":0.00053363503,"teacher_disagreement_score":0.022535201,"about_ca_system_score_codex":0.000060251856,"about_ca_system_score_gemma":0.000024917115,"threshold_uncertainty_score":0.9999725},"labels":[],"label_agreement":null},{"id":"W1973195334","doi":"10.1016/j.disc.2013.07.016","title":"The maximum Perron roots of digraphs with some given parameters","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Digraph; Combinatorics; Root (linguistics); Arc (geometry); Discrete mathematics; Geometry","score_opus":0.020782416247532434,"score_gpt":0.2620764638242689,"score_spread":0.24129404757673648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973195334","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98653495,0.00008193307,0.005692681,0.0009316047,0.000037685637,0.001071653,0.000021835065,0.0001017717,0.005525903],"genre_scores_gemma":[0.9637121,0.000025357866,0.0352504,0.0000353733,0.000017187524,0.00030791786,0.0000058112487,0.00004863261,0.0005972215],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872106,0.000054217257,0.00043629858,0.00018297035,0.00030034856,0.00030508245],"domain_scores_gemma":[0.997717,0.0009331886,0.00032734295,0.0008393344,0.00009798238,0.00008511382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003167204,0.00021347817,0.00029927824,0.00005651064,0.00024299414,0.000076378055,0.00044752384,0.00006455616,0.000056673092],"category_scores_gemma":[0.00013663495,0.00011882627,0.0001464705,0.0002216618,0.00036096168,0.00016412695,0.00006509242,0.00014589529,0.00006197388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088760125,0.00013347653,0.00012723243,0.00018465158,0.00010686116,5.987442e-7,0.0013366448,0.000008222402,0.0008506612,0.9957004,0.0010034913,0.00053888647],"study_design_scores_gemma":[0.0002129031,0.000080756254,0.00032431897,0.000093655,0.000087287306,0.0000079327165,0.0030356077,0.0005304231,0.0019288947,0.9932411,0.000278666,0.00017847016],"about_ca_topic_score_codex":0.000013365404,"about_ca_topic_score_gemma":0.000011272724,"teacher_disagreement_score":0.029557718,"about_ca_system_score_codex":0.0000116137935,"about_ca_system_score_gemma":0.000017300097,"threshold_uncertainty_score":0.48455945},"labels":[],"label_agreement":null},{"id":"W1974039284","doi":"10.1016/j.disc.2015.02.023","title":"Elementary proof that <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msubsup><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msubsup></mml:math> is a DCI-group","year":2015,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Abelian group; Mathematics; Rank (graph theory); Combinatorics; Automorphism; Order (exchange); Discrete mathematics","score_opus":0.03736477245235436,"score_gpt":0.27586553055987456,"score_spread":0.2385007581075202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974039284","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4050057,0.0014479185,0.003154004,0.0012033567,0.0030310315,0.00017975,0.0014944187,0.00047548703,0.58400834],"genre_scores_gemma":[0.9662945,0.0013852186,0.01575053,0.0021813584,0.0033754045,0.0031423839,0.0037866991,0.0025225778,0.0015613262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.97894835,0.0010911804,0.0043397816,0.0033709274,0.0068488573,0.005400907],"domain_scores_gemma":[0.981928,0.0041456074,0.0044449456,0.0062508457,0.00048437237,0.0027462477],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.006477341,0.0021372659,0.00095867313,0.0012184513,0.00246491,0.0035829083,0.0055664703,0.004385044,0.67365956],"category_scores_gemma":[0.0041410704,0.003910281,0.003599136,0.0024132433,0.0033302295,0.0031299968,0.005725438,0.003930153,0.0066847173],"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.002647671,0.00091298716,0.000024887211,0.0051324675,0.003430779,0.0024655715,0.00832543,0.0005102646,0.0012966738,0.5857504,0.3884672,0.001035686],"study_design_scores_gemma":[0.0054564285,0.0028963364,0.000050095357,0.0038023167,0.003864194,0.0029354177,0.010428118,0.1318909,0.8278152,0.0018452059,0.005411448,0.0036043697],"about_ca_topic_score_codex":0.0016857046,"about_ca_topic_score_gemma":0.0019285979,"teacher_disagreement_score":0.8265185,"about_ca_system_score_codex":0.00007445655,"about_ca_system_score_gemma":0.0032903622,"threshold_uncertainty_score":0.9998139},"labels":[],"label_agreement":null},{"id":"W1974712349","doi":"10.1016/j.disc.2012.11.001","title":"Corrigendum to “A criterion for the half-plane property” [Discrete Math. 309 (2008) 1385–1390]","year":2012,"lang":"en","type":"erratum","venue":"Discrete Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Property (philosophy); Plane (geometry); Discrete mathematics; Combinatorics; Pure mathematics; Applied mathematics; Geometry","score_opus":0.03259908505706661,"score_gpt":0.27105931372479103,"score_spread":0.23846022866772443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974712349","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.0000074186505,0.0021486632,0.9216048,0.0040464336,0.04555373,0.0032517922,0.00050242944,0.00047706018,0.022407634],"genre_scores_gemma":[0.00031247066,0.00032346076,0.17722048,0.0014696261,0.0058015003,0.0010735724,0.00060858176,0.00030321217,0.8128871],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9956302,0.00014884703,0.0010092331,0.00094199454,0.00095200434,0.0013177032],"domain_scores_gemma":[0.995556,0.0003518618,0.0006275633,0.0027707478,0.00026666172,0.0004271642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015555714,0.0009575301,0.0010476097,0.00022878173,0.0007015846,0.0009233845,0.0040025786,0.0005724105,0.00018576058],"category_scores_gemma":[0.00032806187,0.00052376813,0.00049002114,0.00049155514,0.00015207393,0.00049847754,0.0010472033,0.0009109412,0.00077129813],"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.000022043863,0.00010210548,5.539415e-7,0.0013667886,0.00014857012,0.00001861274,0.004052054,0.000007402651,0.000049317252,0.1267539,0.85994846,0.007530231],"study_design_scores_gemma":[0.00025971755,0.00021195416,0.000004455703,0.00062778214,0.00019767144,0.00011931664,0.00029243375,0.06974487,0.00013764114,0.012238958,0.9152005,0.00096474943],"about_ca_topic_score_codex":0.00003770246,"about_ca_topic_score_gemma":0.000017723567,"teacher_disagreement_score":0.7904795,"about_ca_system_score_codex":0.00011044139,"about_ca_system_score_gemma":0.00023685841,"threshold_uncertainty_score":0.9997214},"labels":[],"label_agreement":null},{"id":"W1974807847","doi":"10.1016/j.disc.2005.03.023","title":"Extended Petersen graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Combinatorics; Mathematics; Petersen graph; Discrete mathematics; Chordal graph; Indifference graph; Graph; Line graph; Voltage graph","score_opus":0.007963816504260353,"score_gpt":0.20945181349046588,"score_spread":0.20148799698620554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974807847","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.735411,0.0006357194,0.02150596,0.0001233943,0.00054817187,0.00041298967,0.000028907763,0.0014185633,0.23991528],"genre_scores_gemma":[0.9942084,0.000017011702,0.0051642866,0.000030880965,0.00007301272,0.000019737141,0.0000053587632,0.000038985927,0.0004423405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99931693,0.000013192479,0.0002309506,0.00009332719,0.00013002713,0.00021558924],"domain_scores_gemma":[0.9995602,0.00003388948,0.000026899716,0.00029741952,0.000012141478,0.000069451635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013569917,0.00014573544,0.0001699064,0.000065520304,0.000043252727,0.00003486541,0.00015042254,0.000052738975,0.00013229364],"category_scores_gemma":[0.000009828765,0.00012653966,0.00010053873,0.000114922266,0.000030511672,0.0001028697,0.000015148988,0.00008880515,0.000337889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010449881,0.00016614703,0.000109493056,0.0012954766,0.0003791227,0.000028892155,0.014725616,0.005374659,0.020637937,0.9347,0.010619753,0.01195241],"study_design_scores_gemma":[0.0019481492,0.00014640178,0.0011697614,0.00065213145,0.0002692277,0.000311305,0.008308233,0.40883002,0.038475443,0.44652286,0.09070787,0.002658625],"about_ca_topic_score_codex":3.3755063e-7,"about_ca_topic_score_gemma":0.0000024959768,"teacher_disagreement_score":0.48817718,"about_ca_system_score_codex":0.000015128544,"about_ca_system_score_gemma":0.0000024770036,"threshold_uncertainty_score":0.51601374},"labels":[],"label_agreement":null},{"id":"W1975011389","doi":"10.1016/s0012-365x(00)00345-9","title":"Bounded vertex coloring of trees","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Bounded function; Combinatorics; Mathematics; Fractional coloring; Vertex (graph theory); Complete coloring; Chromatic scale; Brooks' theorem; Discrete mathematics; List coloring; Graph; Graph power; 1-planar graph; Chordal graph","score_opus":0.033826241284818,"score_gpt":0.3093333693216396,"score_spread":0.2755071280368216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975011389","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.20052123,0.000062569954,0.7766838,0.00016420484,0.00008839847,0.00018339221,0.0000022655213,0.00011848757,0.022175672],"genre_scores_gemma":[0.87085664,0.000027684997,0.12832624,0.000019397987,0.000011911157,0.0000128695765,9.4112e-7,0.000012883227,0.00073143543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889827,0.000034328397,0.00026025483,0.00018385763,0.0003524171,0.00027084458],"domain_scores_gemma":[0.9988466,0.00024312978,0.00010286338,0.0006642466,0.00007041978,0.00007276142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031818042,0.00010663814,0.00020222417,0.000107440115,0.00007464271,0.000060060993,0.0008709725,0.000034441044,0.00002632983],"category_scores_gemma":[0.00014050321,0.000089774054,0.00007439525,0.0004728382,0.00011044847,0.0002979514,0.00026026124,0.000092053924,0.000038998132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058679498,0.000064767024,0.00029540516,0.00004935468,0.000019710207,0.000014681585,0.0016642851,0.000048388694,0.0024531498,0.992641,0.00004692223,0.0026964962],"study_design_scores_gemma":[0.0003746188,0.00012433209,0.00055469404,0.000088520675,0.000007731776,0.00003476512,0.0005355,0.0672869,0.009029534,0.920838,0.0009145626,0.0002108442],"about_ca_topic_score_codex":0.0000024407238,"about_ca_topic_score_gemma":0.0000079287975,"teacher_disagreement_score":0.6703354,"about_ca_system_score_codex":0.000022533415,"about_ca_system_score_gemma":0.000027816035,"threshold_uncertainty_score":0.36608797},"labels":[],"label_agreement":null},{"id":"W1975017470","doi":"10.1016/j.disc.2009.07.015","title":"Graph-like spaces: An introduction","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Graph; Discrete mathematics; Combinatorics","score_opus":0.02130881350651235,"score_gpt":0.30365715907637125,"score_spread":0.2823483455698589,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975017470","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.020810978,0.000048829985,0.9729226,0.0032124573,0.00019283082,0.00021647627,0.000001847914,0.00034358443,0.0022503936],"genre_scores_gemma":[0.423011,0.000023312305,0.57531965,0.00032962393,0.00030126114,0.000015901838,0.000012010683,0.000024465398,0.00096280937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985584,0.0000695052,0.00022760275,0.00038089007,0.00040949468,0.00035411556],"domain_scores_gemma":[0.9984445,0.000051059935,0.000092179325,0.001181021,0.00008600301,0.00014524769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048534307,0.00015783096,0.00017865891,0.00017807983,0.00014529037,0.00024173503,0.0009442114,0.00005000933,0.000024008998],"category_scores_gemma":[0.00007810434,0.00013172241,0.00007200388,0.0006322769,0.00007693349,0.00093669404,0.00009664972,0.00016971932,0.000061062354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004004221,0.000098544406,0.000008160951,0.000016053315,0.0000069411676,0.000006135931,0.001564694,0.00012131826,0.0018239655,0.9887534,0.00048781274,0.0071089813],"study_design_scores_gemma":[0.0001681463,0.00026566716,0.0000983714,0.000012174677,0.0000055018745,0.000034180066,0.00034675765,0.027992468,0.0020612776,0.966124,0.0026574873,0.00023396254],"about_ca_topic_score_codex":8.129404e-7,"about_ca_topic_score_gemma":0.0000015440736,"teacher_disagreement_score":0.4022,"about_ca_system_score_codex":0.000024022913,"about_ca_system_score_gemma":0.000019427951,"threshold_uncertainty_score":0.53714836},"labels":[],"label_agreement":null},{"id":"W1975645051","doi":"10.1016/s0012-365x(02)00518-6","title":"Factor d-domatic colorings of graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Fractional coloring; Discrete mathematics; Edge coloring; Vertex (graph theory); Disjoint sets; Graph; Graph power; Line graph","score_opus":0.029955070364367387,"score_gpt":0.2972155256529396,"score_spread":0.26726045528857223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975645051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20126113,0.00009475795,0.7689447,0.00006210261,0.00008047451,0.00036756732,0.000007328212,0.00013067729,0.029051285],"genre_scores_gemma":[0.779806,0.000009724956,0.21982682,0.00001697332,0.0000019845168,0.000018734,4.9309944e-7,0.00001460872,0.0003046461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861443,0.00007855602,0.00035646211,0.00021418554,0.00042716792,0.000309227],"domain_scores_gemma":[0.99850976,0.00034601198,0.00017027075,0.0007878499,0.000086333996,0.00009976979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036816273,0.00014425811,0.00026692706,0.00015457852,0.00006854019,0.000049915045,0.0007916924,0.00004313914,0.00005127139],"category_scores_gemma":[0.0003762318,0.000117703705,0.00011073315,0.0006017123,0.00013039474,0.00028624813,0.00013195052,0.000114325085,0.000045361412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011293282,0.000051659543,0.00015660458,0.00013951048,0.000017728738,0.0000033337283,0.0010433714,0.000010615645,0.0021447886,0.9961787,0.000014045174,0.00023850612],"study_design_scores_gemma":[0.00024763215,0.00008539627,0.0001382911,0.000060896,0.0000058069345,0.00001465956,0.0002614645,0.0031725778,0.03210167,0.96337974,0.00035205373,0.00017982857],"about_ca_topic_score_codex":8.5335927e-7,"about_ca_topic_score_gemma":5.8450837e-7,"teacher_disagreement_score":0.57854486,"about_ca_system_score_codex":0.000017915225,"about_ca_system_score_gemma":0.000038102087,"threshold_uncertainty_score":0.47998178},"labels":[],"label_agreement":null},{"id":"W1975666971","doi":"10.1016/s0012-365x(03)00273-5","title":"HGDDs with block size four","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Block size; Block (permutation group theory); Combinatorics; Discrete mathematics; Computer science; Key (lock)","score_opus":0.008262183121001977,"score_gpt":0.18470170720327095,"score_spread":0.17643952408226898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975666971","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7356186,0.00018556428,0.017075978,0.00001775148,0.00025080185,0.00030414652,0.000010071962,0.0005175325,0.24601956],"genre_scores_gemma":[0.9927081,0.0000054676057,0.006235847,0.000012748625,0.00002247387,0.000021724692,8.22406e-7,0.0000470139,0.0009458069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993488,0.000021807347,0.00018036496,0.00009340817,0.00014182026,0.000213771],"domain_scores_gemma":[0.99948984,0.00009635979,0.000029165722,0.00029950126,0.000017776669,0.0000673705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016340133,0.0001572783,0.00018857433,0.000026686961,0.000046394867,0.000035184577,0.00010420832,0.00005108093,0.00008883516],"category_scores_gemma":[0.000042368432,0.00011747862,0.000052180192,0.00014357889,0.000028840455,0.00005396352,0.000006077497,0.00009193616,0.00009867695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013667842,0.000114038005,0.00091766403,0.0021082577,0.0005001183,0.000097650445,0.0075669773,0.010460746,0.0058914176,0.96941847,0.0026674361,0.00024354571],"study_design_scores_gemma":[0.008240993,0.0010417381,0.0014852381,0.003277664,0.0010732488,0.0035472836,0.02772949,0.10912615,0.120146625,0.58210456,0.13432416,0.007902862],"about_ca_topic_score_codex":4.5712503e-7,"about_ca_topic_score_gemma":0.000002263828,"teacher_disagreement_score":0.38731393,"about_ca_system_score_codex":0.000012287767,"about_ca_system_score_gemma":0.0000061710584,"threshold_uncertainty_score":0.47906393},"labels":[],"label_agreement":null},{"id":"W1976619117","doi":"10.1016/j.disc.2005.12.053","title":"The firefighter problem for graphs of maximum degree three","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Degree (music); Mathematics; Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.03299384743016334,"score_gpt":0.28530295995360117,"score_spread":0.2523091125234378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976619117","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.0054456666,0.00019324294,0.9860652,0.00064451236,0.000062149695,0.00070306275,0.000015385283,0.00007746134,0.0067933057],"genre_scores_gemma":[0.23010328,0.000016050783,0.76844066,0.000028964218,0.000044906188,0.00026907487,0.0000069230286,0.000041720006,0.0010484075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998574,0.000029254243,0.0003962966,0.00022767633,0.00037797596,0.00039477105],"domain_scores_gemma":[0.99804664,0.00066761236,0.00019012234,0.00089554494,0.00015692366,0.00004314199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006228808,0.00014849566,0.00019621893,0.00007172758,0.00024022123,0.00011211527,0.0013180223,0.000046694833,0.0000038226653],"category_scores_gemma":[0.00006222131,0.00008903495,0.00016005439,0.00034476205,0.00020458114,0.00019838975,0.00024371773,0.000095729694,0.000010397784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007251819,0.000040171635,0.00009221046,0.00010532965,0.000016279713,9.4473364e-7,0.00017117245,0.000027346447,0.0003928446,0.99206185,0.00046527927,0.006619341],"study_design_scores_gemma":[0.00022431806,0.00007059311,0.00015900197,0.000034310455,0.0000068289783,0.0000045459524,0.00003308402,0.017915094,0.0027634616,0.97746426,0.0012073483,0.000117177624],"about_ca_topic_score_codex":0.000005516436,"about_ca_topic_score_gemma":0.000047124922,"teacher_disagreement_score":0.22465762,"about_ca_system_score_codex":0.0000142427525,"about_ca_system_score_gemma":0.000028303755,"threshold_uncertainty_score":0.36307397},"labels":[],"label_agreement":null},{"id":"W1977101828","doi":"10.1016/j.disc.2010.06.010","title":"Spreads, arcs, and multiple wavelength codes","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Division of Mathematical Sciences","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.006451104124225585,"score_gpt":0.19599923977507003,"score_spread":0.18954813565084444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977101828","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9848618,0.000079848585,0.0029452094,0.000014491083,0.00030783258,0.00015269071,0.000029133862,0.0002626665,0.011346359],"genre_scores_gemma":[0.99493855,0.000018934805,0.0047731297,0.000007250458,0.00006244985,0.000008688793,0.000007003993,0.00003327914,0.00015073536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944586,0.000009478785,0.00018049749,0.00009785647,0.00009086678,0.00017547331],"domain_scores_gemma":[0.9995064,0.00011836598,0.000024411418,0.00025959144,0.000013387696,0.00007780595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016933883,0.00013714192,0.0001761075,0.000038907332,0.000053126325,0.00004442001,0.000106264684,0.00007505496,0.000039197916],"category_scores_gemma":[0.000055596265,0.0001147464,0.00003956867,0.000054129778,0.000059690283,0.000066694716,0.000023659037,0.00017139503,0.0000419868],"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.000014517356,0.00014246808,0.005503116,0.0032017655,0.00032124761,0.000027911276,0.01727318,0.00036002317,0.20992382,0.75023246,0.0024367743,0.010562713],"study_design_scores_gemma":[0.001393728,0.00007754362,0.002365809,0.00034070364,0.00013474368,0.00022067394,0.004606589,0.7530035,0.060073897,0.15761581,0.01866771,0.0014992862],"about_ca_topic_score_codex":0.0000031177872,"about_ca_topic_score_gemma":0.000022900354,"teacher_disagreement_score":0.75264347,"about_ca_system_score_codex":0.0000033047138,"about_ca_system_score_gemma":0.0000024509604,"threshold_uncertainty_score":0.4679222},"labels":[],"label_agreement":null},{"id":"W1977305469","doi":"10.1016/j.disc.2011.10.011","title":"Häggkvist–Hell graphs: A class of Kneser-colorable graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Triangle-free graph; Homomorphism; Graph; Graph homomorphism; Discrete mathematics; Odd graph; Symmetric graph; 1-planar graph; Chordal graph; Graph power; Line graph; Voltage graph","score_opus":0.04894744649945722,"score_gpt":0.28071702798371423,"score_spread":0.23176958148425703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977305469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78731227,0.00019804316,0.005154252,0.000027953476,0.00047102637,0.0008100288,0.00009876442,0.00026860525,0.20565906],"genre_scores_gemma":[0.9037666,0.000053343225,0.09462574,0.000065315595,0.00003159771,0.00004657502,0.0000067477768,0.00010213846,0.0013019469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974993,0.00010604756,0.0009743731,0.0003689219,0.00051938195,0.0005319815],"domain_scores_gemma":[0.9973573,0.00045502075,0.0005996247,0.0012298813,0.0001932533,0.00016492512],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074050284,0.00042861432,0.0007956974,0.0002849792,0.00022962505,0.0000282605,0.00077751564,0.00024023427,0.0005974408],"category_scores_gemma":[0.00041190354,0.00032576502,0.00046816465,0.0005158269,0.00046027527,0.00017414136,0.00027444726,0.00029455387,0.000024155663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042271742,0.00027888626,0.0004732516,0.0008400802,0.00018696775,0.000009648285,0.011131379,6.8528294e-7,0.0005062658,0.98561996,0.00078152464,0.00012908425],"study_design_scores_gemma":[0.00046125372,0.00016717307,0.0002572182,0.00017781858,0.000206139,0.000025793282,0.0019370485,0.00022742027,0.005348472,0.99027836,0.0005158023,0.00039751612],"about_ca_topic_score_codex":0.000020085492,"about_ca_topic_score_gemma":0.000012764308,"teacher_disagreement_score":0.20435712,"about_ca_system_score_codex":0.000021703558,"about_ca_system_score_gemma":0.000036040856,"threshold_uncertainty_score":0.9999194},"labels":[],"label_agreement":null},{"id":"W1977332922","doi":"10.1016/s0012-365x(01)00431-9","title":"Balanced k-colorings","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Context (archaeology); Upper and lower bounds; Dimension (graph theory); Discrete mathematics; Set (abstract data type); Graph; Computer science","score_opus":0.07268317869649793,"score_gpt":0.30393492210329887,"score_spread":0.23125174340680094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977332922","genre_codex":"other","genre_gemma":"methods","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.08584183,0.00005592614,0.17193975,0.001757486,0.00018044356,0.0009645249,0.000017263688,0.00085121446,0.7383916],"genre_scores_gemma":[0.40904835,0.000038212904,0.56200373,0.00046793235,0.00016880302,0.00022406371,0.000013963107,0.00012410205,0.027910866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829483,0.00003554896,0.0006284417,0.00024860527,0.00045731248,0.0003352496],"domain_scores_gemma":[0.9986168,0.0003913364,0.00022946364,0.0005334802,0.00009657404,0.00013231619],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00032142585,0.00025774728,0.00039941687,0.00008874729,0.00012573335,0.00009727132,0.0002766895,0.00011325322,0.005014462],"category_scores_gemma":[0.0009965992,0.00019677513,0.00016318161,0.00024879683,0.000075796284,0.00021988801,0.00005927495,0.00018446537,0.0011012653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018300137,0.00022483937,0.000010783156,0.00028121387,0.000023940787,0.0000023453367,0.0017607335,3.719273e-7,0.0002733366,0.98665565,0.010112116,0.00065281085],"study_design_scores_gemma":[0.0003816855,0.00005452502,0.000010643984,0.00012430892,0.00004394803,0.000022464046,0.00059302076,0.06256655,0.00223118,0.9293758,0.0042776526,0.00031821444],"about_ca_topic_score_codex":0.0000011694874,"about_ca_topic_score_gemma":0.0000018822886,"teacher_disagreement_score":0.7104807,"about_ca_system_score_codex":0.000048569626,"about_ca_system_score_gemma":0.0000053396957,"threshold_uncertainty_score":0.99967647},"labels":[],"label_agreement":null},{"id":"W1977467103","doi":"10.1016/j.disc.2015.04.007","title":"Linearized Wenger graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Bipartite graph; Combinatorics; Discrete mathematics; Class (philosophy); Indifference graph; Graph; Computer science","score_opus":0.0922781901024348,"score_gpt":0.34059069890046945,"score_spread":0.24831250879803463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977467103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7225436,0.00022128214,0.106809,0.0015132689,0.00041903538,0.0015571564,0.00008525294,0.0012359035,0.1656155],"genre_scores_gemma":[0.77934307,0.000010786252,0.21610709,0.0001456078,0.00010971127,0.00016236943,0.000026045374,0.0000883972,0.0040069153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987442,0.000055798722,0.00040621508,0.00020828037,0.00031243433,0.0002730716],"domain_scores_gemma":[0.99846315,0.00033620867,0.00016660121,0.00069588365,0.00012418236,0.00021399136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007043306,0.00020402278,0.0003083327,0.00008907514,0.00010356572,0.000057498026,0.00031436383,0.00009626969,0.00012199946],"category_scores_gemma":[0.000467007,0.00016383409,0.00015185287,0.0003188217,0.00011145286,0.000102697835,0.00008195865,0.00016467323,0.00032239515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007320761,0.00015755302,0.000026626461,0.00007384864,0.000035646466,0.000002446412,0.0020145837,0.0000024094684,0.00026260305,0.99090654,0.0063956454,0.000114775445],"study_design_scores_gemma":[0.00047825344,0.000029723737,0.0000056294293,0.000038127502,0.00007096825,0.000014068422,0.0011761126,0.001272773,0.0009317635,0.99103445,0.0047313576,0.0002167779],"about_ca_topic_score_codex":0.0000018224729,"about_ca_topic_score_gemma":0.0000027725605,"teacher_disagreement_score":0.16160859,"about_ca_system_score_codex":0.000018752844,"about_ca_system_score_gemma":0.000035160854,"threshold_uncertainty_score":0.66809607},"labels":[],"label_agreement":null},{"id":"W1977889556","doi":"10.1016/s0012-365x(02)00803-8","title":"Finding a maximum induced matching in weakly chordal graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Bipartite graph; Matching (statistics); Split graph; 3-dimensional matching; Interval graph; Vertex (graph theory); Indifference graph; Discrete mathematics; Factor-critical graph; Cardinality (data modeling); Pathwidth; Graph; 1-planar graph; Line graph; Graph power; Computer science","score_opus":0.03729535450122503,"score_gpt":0.314509867878203,"score_spread":0.277214513376978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977889556","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.4711958,0.000049024053,0.5146851,0.00013202737,0.00014123463,0.00033874816,0.0000019906167,0.00013766142,0.013318446],"genre_scores_gemma":[0.8017177,0.00000739805,0.19803077,0.000050851435,0.000008141985,0.000037020534,0.0000010704441,0.000026562651,0.00012048106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979033,0.00016663918,0.00042078877,0.00040716497,0.00048178312,0.00062035135],"domain_scores_gemma":[0.9985908,0.00030535756,0.00012577626,0.0008053011,0.000041654323,0.00013106928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011500817,0.00022375351,0.0002906476,0.00040630522,0.00014245296,0.00020183228,0.000992628,0.00008448972,0.000027302658],"category_scores_gemma":[0.00030422656,0.00020214815,0.00010117021,0.0011536344,0.00005538844,0.00055629003,0.00024086889,0.00040551543,0.00007327382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024877086,0.0000658165,0.00027451466,0.00006148247,0.000010789206,0.000038287395,0.0040242164,0.0000713308,0.005174673,0.9889847,0.000010233135,0.0012814901],"study_design_scores_gemma":[0.00031538747,0.000041369956,0.00018688502,0.00010080358,0.0000026933262,0.000034778048,0.0007581557,0.004950831,0.0048175924,0.9884361,0.00008511935,0.0002703003],"about_ca_topic_score_codex":0.0000065111713,"about_ca_topic_score_gemma":0.000012361425,"teacher_disagreement_score":0.3305219,"about_ca_system_score_codex":0.00006364538,"about_ca_system_score_gemma":0.000059799386,"threshold_uncertainty_score":0.8243362},"labels":[],"label_agreement":null},{"id":"W1978202062","doi":"10.1016/s0012-365x(03)00039-6","title":"Resolvable group divisible designs with block size four and group size six","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Block size; Combinatorics; Block (permutation group theory); Group (periodic table); Discrete mathematics; Arithmetic; Computer science","score_opus":0.014082470600140767,"score_gpt":0.1977526242482627,"score_spread":0.18367015364812195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978202062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91720104,0.000489881,0.025771733,0.000030818606,0.00023911799,0.00070942915,0.000021974158,0.00047553252,0.055060472],"genre_scores_gemma":[0.97763306,0.000030290272,0.021551622,0.000021236649,0.000032655364,0.00005061064,0.0000013843088,0.000085269385,0.00059387047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878454,0.000057133857,0.00031328644,0.00022296527,0.00022530221,0.00039675424],"domain_scores_gemma":[0.9987407,0.00046526457,0.000080995764,0.0005506788,0.000022464112,0.00013995125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044463493,0.00029308593,0.00035973426,0.00003663896,0.00021124618,0.00018087398,0.00019679568,0.000101635895,0.00006718544],"category_scores_gemma":[0.00017239628,0.00023222627,0.00006498496,0.00016584153,0.00008844273,0.00018227578,0.00003437976,0.00016188256,0.000025715533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072682415,0.00028959147,0.0061141737,0.004794577,0.00078924885,0.00016671342,0.00682769,0.002178257,0.02767869,0.94891,0.0018570771,0.00032132526],"study_design_scores_gemma":[0.016860617,0.0031938392,0.017377509,0.006134434,0.0019450804,0.002347449,0.026823064,0.089437395,0.038716692,0.75431997,0.0321323,0.010711662],"about_ca_topic_score_codex":0.0000057115376,"about_ca_topic_score_gemma":0.000022551416,"teacher_disagreement_score":0.19459002,"about_ca_system_score_codex":0.000020308324,"about_ca_system_score_gemma":0.0000057312836,"threshold_uncertainty_score":0.94699126},"labels":[],"label_agreement":null},{"id":"W1978631091","doi":"10.1016/j.disc.2007.12.075","title":"The obstructions for toroidal graphs with no <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si14.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>’s","year":2008,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Toroid; Combinatorics; Mathematics; Planar graph; Subdivision; Discrete mathematics; Physics; Graph","score_opus":0.021273118216842864,"score_gpt":0.25545277334377403,"score_spread":0.23417965512693117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978631091","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5383571,0.0025780017,0.026604874,0.0015531448,0.0053514647,0.0002629815,0.0016915593,0.00075924775,0.42284164],"genre_scores_gemma":[0.96034575,0.0021194383,0.027221145,0.001247432,0.0023554312,0.0028330116,0.0013163701,0.0013716064,0.0011898432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9842185,0.0007247315,0.0030106653,0.0029353797,0.0047170343,0.0043937066],"domain_scores_gemma":[0.9852448,0.004281813,0.0031731185,0.004858037,0.000571606,0.0018706431],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0033839492,0.0015889372,0.0006726749,0.0008592631,0.0048041767,0.0028878457,0.0055131093,0.002488139,0.11293441],"category_scores_gemma":[0.003201773,0.0025461668,0.0029695765,0.0025971108,0.004569324,0.0028715099,0.0037001083,0.0027885395,0.002406884],"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.0016372877,0.0004950129,0.000015053388,0.0017596179,0.0021370912,0.0011666326,0.004469086,0.0020050488,0.0015671663,0.79493946,0.18789183,0.001916723],"study_design_scores_gemma":[0.0032607242,0.0032501575,0.000071494826,0.0019249857,0.00177652,0.0037284077,0.004239749,0.19089077,0.7757628,0.0040840725,0.007986125,0.003024171],"about_ca_topic_score_codex":0.0007478027,"about_ca_topic_score_gemma":0.001424719,"teacher_disagreement_score":0.79085535,"about_ca_system_score_codex":0.000042679352,"about_ca_system_score_gemma":0.0024070863,"threshold_uncertainty_score":0.99986756},"labels":[],"label_agreement":null},{"id":"W1978705134","doi":"10.1016/j.disc.2003.11.034","title":"Mixed partitions of sets of triples into small planes","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics; Pairwise comparison; Set (abstract data type); Line (geometry); Discrete mathematics; Computer science; Geometry; Statistics","score_opus":0.02249479605233382,"score_gpt":0.21483600644783965,"score_spread":0.19234121039550583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978705134","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98304534,0.00018379501,0.012004229,0.000012459164,0.00011296916,0.00012491658,0.000049039885,0.000076960285,0.004390291],"genre_scores_gemma":[0.9932831,0.00001355104,0.0066281194,0.0000015677224,0.000010497009,0.000012437631,0.000015849766,0.000016525764,0.000018375837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994187,0.000011855312,0.00032881254,0.000054027776,0.00008571196,0.00010088763],"domain_scores_gemma":[0.99961764,0.000055670338,0.00006733785,0.00020474986,0.000021734631,0.000032896838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000114098555,0.000093705676,0.00022634902,0.000056959787,0.00002052057,0.000005617555,0.00010798283,0.00004749845,0.000017326147],"category_scores_gemma":[0.000025811474,0.000081266226,0.000076569784,0.00010735437,0.000052869884,0.00003176294,0.000011863043,0.000043151842,0.000011243745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000142820145,0.00022461299,0.0002490506,0.0073167356,0.0003255003,0.000008011035,0.025076868,0.046384107,0.060277943,0.8594439,0.00018815316,0.0004908266],"study_design_scores_gemma":[0.00096651254,0.00011439766,0.0003670295,0.0011097713,0.00013141528,0.00002371564,0.007257847,0.006146582,0.35420692,0.6289462,0.0003312073,0.00039841476],"about_ca_topic_score_codex":0.000009254665,"about_ca_topic_score_gemma":0.000030879775,"teacher_disagreement_score":0.29392898,"about_ca_system_score_codex":0.000008206357,"about_ca_system_score_gemma":0.0000068676827,"threshold_uncertainty_score":0.33139408},"labels":[],"label_agreement":null},{"id":"W1978793076","doi":"10.1016/j.disc.2008.02.024","title":"A trace representation of binary Jacobi sequences","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; TRACE (psycholinguistics); Hadamard transform; Combinatorics; Binary number; Prime (order theory); Representation (politics); Discrete mathematics; Function (biology); Arithmetic; Mathematical analysis","score_opus":0.03788848420678235,"score_gpt":0.278392634844204,"score_spread":0.24050415063742167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978793076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64499223,0.00011777785,0.3467007,0.00023480877,0.000095316405,0.00012899104,0.0000029936755,0.00012586454,0.007601315],"genre_scores_gemma":[0.9063624,0.00004973121,0.09340404,0.000023847375,0.00001457577,0.00000798635,0.0000011742155,0.000005158819,0.00013106354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992165,0.000045503984,0.00023356332,0.00016269217,0.000219922,0.00012182409],"domain_scores_gemma":[0.99917793,0.00014778647,0.00013895778,0.00045306026,0.00004420372,0.00003806021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017370978,0.000085063766,0.0001577665,0.00008880371,0.0000941071,0.000020732732,0.00048303875,0.000030855037,0.000017875547],"category_scores_gemma":[0.0000485907,0.00007131648,0.00010320793,0.00050210685,0.000121357385,0.00027232157,0.000089769324,0.000054779197,0.000013436464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009957051,0.00019904737,0.0009983418,0.00015210237,0.000047426893,0.000044340966,0.022914719,0.00019056628,0.016702415,0.9553535,0.0007258342,0.0026617313],"study_design_scores_gemma":[0.0008048996,0.0005929144,0.0052265213,0.0003795054,0.000057416695,0.00035382502,0.002757545,0.11188616,0.082116276,0.79422116,0.00081480254,0.0007889744],"about_ca_topic_score_codex":0.0000054317243,"about_ca_topic_score_gemma":6.1381866e-7,"teacher_disagreement_score":0.2613702,"about_ca_system_score_codex":0.0000053182716,"about_ca_system_score_gemma":0.000022944027,"threshold_uncertainty_score":0.29082015},"labels":[],"label_agreement":null},{"id":"W1979144155","doi":"10.1016/s0012-365x(99)00246-0","title":"A lower bound on the probability of a finite union of events","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Pairwise comparison; Upper and lower bounds; Event (particle physics); Combinatorics; Computation; Discrete mathematics; Statistics; Algorithm; Mathematical analysis","score_opus":0.03659762619660558,"score_gpt":0.26332282672292634,"score_spread":0.22672520052632075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979144155","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52162385,0.000014970832,0.46996304,0.0005779885,0.00004255195,0.00020692014,0.000008095555,0.000031598316,0.0075309756],"genre_scores_gemma":[0.9809881,0.0000072631838,0.01868385,0.000054442473,0.000006264671,0.0000074858513,7.3723476e-7,0.0000048680627,0.00024699676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991066,0.00007149561,0.00029392817,0.00014354175,0.0002622333,0.00012220824],"domain_scores_gemma":[0.9988804,0.0002232395,0.00011793938,0.0006894422,0.000059839982,0.000029176765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051025447,0.000091887436,0.00015861307,0.00002201385,0.00004106114,0.000019962388,0.00056165946,0.000037111065,0.000066045766],"category_scores_gemma":[0.00008424078,0.000056245703,0.00007261077,0.00018992001,0.00007356816,0.000074951065,0.000058303376,0.000084023966,0.000024021552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023142566,0.000792964,0.00012448717,0.00035434344,0.000048526446,0.0000016957456,0.0071375626,0.002434039,0.0005148464,0.9691963,0.00019986417,0.019172225],"study_design_scores_gemma":[0.00015302902,0.00023772224,0.00026003877,0.00034153587,0.000012214532,0.0000021348878,0.000044110584,0.3039764,0.0025977294,0.69212997,0.00010745807,0.00013770611],"about_ca_topic_score_codex":0.00000792939,"about_ca_topic_score_gemma":0.0000013292156,"teacher_disagreement_score":0.45936424,"about_ca_system_score_codex":0.000009350983,"about_ca_system_score_gemma":0.00003522445,"threshold_uncertainty_score":0.22936332},"labels":[],"label_agreement":null},{"id":"W1979477295","doi":"10.1016/j.disc.2004.07.022","title":"The graphs with maximum induced matching and maximum matching the same size","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Wilfrid Laurier University","funders":"","keywords":"Mathematics; Matching (statistics); Combinatorics; Factor-critical graph; Characterization (materials science); 3-dimensional matching; Graph; Cograph; Discrete mathematics; Simple (philosophy); Line graph; Bipartite graph; Pathwidth; Voltage graph; Statistics","score_opus":0.019029947364102493,"score_gpt":0.27922666289546505,"score_spread":0.26019671553136253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979477295","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.610083,0.00034737465,0.37445572,0.009675459,0.000106383995,0.00078942894,0.0000051957863,0.0002678291,0.0042696465],"genre_scores_gemma":[0.85035855,0.00007538988,0.1484765,0.00043445668,0.00005907327,0.000066846806,7.171297e-7,0.000050321814,0.0004781325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977395,0.00015971858,0.00036667567,0.00039698146,0.0007028546,0.0006342935],"domain_scores_gemma":[0.9964634,0.0018524841,0.00019837197,0.0012721333,0.00007758697,0.00013598082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00137076,0.00028934138,0.00025072545,0.00006423406,0.0010606175,0.00081179355,0.001707307,0.00006293865,0.0000088369015],"category_scores_gemma":[0.00013528559,0.00014136473,0.00008152947,0.00046702992,0.00030892243,0.0004897634,0.00067825546,0.00053257385,0.000033340933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001980044,0.000037694343,0.000040663446,0.000055798366,0.000064985805,0.00001196464,0.011653661,0.00012893674,0.0011494781,0.96187276,0.000043044165,0.024921218],"study_design_scores_gemma":[0.00028509376,0.00006608992,0.0001960802,0.000077039236,0.00001331911,0.00011006927,0.0025559699,0.00416567,0.00056745217,0.9911341,0.0005816921,0.00024743399],"about_ca_topic_score_codex":0.000014756419,"about_ca_topic_score_gemma":0.00007121082,"teacher_disagreement_score":0.24027558,"about_ca_system_score_codex":0.000034648445,"about_ca_system_score_gemma":0.00004312828,"threshold_uncertainty_score":0.81575197},"labels":[],"label_agreement":null},{"id":"W1979595999","doi":"10.1016/j.disc.2004.11.015","title":"Enumeration of solid 2-trees according to edge number and edge degree distribution","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Enumeration; Mathematics; Degree (music); Combinatorics; Enhanced Data Rates for GSM Evolution; Distribution (mathematics); Discrete mathematics; Computer science; Artificial intelligence; Mathematical analysis","score_opus":0.04441625055827287,"score_gpt":0.3404536988173486,"score_spread":0.29603744825907574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979595999","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5589772,0.00004487154,0.4360702,0.0003419348,0.00024474532,0.0008734401,0.00014760577,0.00018739463,0.0031126097],"genre_scores_gemma":[0.82129997,0.000014946979,0.17800009,0.000027508715,0.00021906108,0.000056019475,0.000025361294,0.00006867996,0.00028834312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977947,0.00005240336,0.0009472456,0.00032455486,0.00047503007,0.00040607422],"domain_scores_gemma":[0.99775773,0.00069115736,0.00047637493,0.0006596052,0.00023133615,0.00018379095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051329675,0.0003593806,0.0006814351,0.000077298224,0.00015119322,0.000059554608,0.0002979005,0.00015374868,0.000050323193],"category_scores_gemma":[0.0017478496,0.00032834747,0.00012234302,0.00031051607,0.00009193701,0.00035853518,0.00025221967,0.0001845068,0.00008598817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032379397,0.00047277162,0.00043766075,0.0010463893,0.00010345399,0.0000032444436,0.005930632,0.00006780105,0.007284929,0.9754014,0.0020870825,0.007132279],"study_design_scores_gemma":[0.00097552675,0.0001461811,0.000162919,0.00065681076,0.0002373717,0.00005247531,0.002550403,0.008533456,0.04782344,0.9365858,0.001524018,0.00075163465],"about_ca_topic_score_codex":0.000002641988,"about_ca_topic_score_gemma":0.000013559131,"teacher_disagreement_score":0.26232278,"about_ca_system_score_codex":0.00012641937,"about_ca_system_score_gemma":0.000036261354,"threshold_uncertainty_score":0.99991685},"labels":[],"label_agreement":null},{"id":"W1979685415","doi":"10.1016/j.disc.2012.04.009","title":"An improved bound on parity vertex colourings of outerplane graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; St. Francis Xavier University","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bipartite graph; Parity (physics); Chromatic scale; Upper and lower bounds; Graph; Discrete mathematics; Physics","score_opus":0.01660307506976808,"score_gpt":0.261172423748193,"score_spread":0.24456934867842492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979685415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97479117,0.00010171446,0.022443682,0.00013355154,0.0004083242,0.00022023114,0.000011310362,0.0001842977,0.0017056975],"genre_scores_gemma":[0.9474471,0.0000063154107,0.052324463,0.00014390518,0.0000054336415,0.00000792152,0.000005584439,0.000012026657,0.000047240817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988179,0.000041591127,0.0003282629,0.00020458561,0.00027113367,0.00033648685],"domain_scores_gemma":[0.99866825,0.00010290039,0.0001881717,0.0008013363,0.00006051868,0.00017881005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053825177,0.00015809858,0.00024781912,0.000096652475,0.000093851886,0.000076863565,0.0005418186,0.00007303488,0.000009347546],"category_scores_gemma":[0.00004850527,0.00012494685,0.00008040326,0.00020215542,0.00007334452,0.00032087695,0.000101162615,0.00011550245,0.000029642177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011994921,0.0007012257,0.0013547994,0.00017248644,0.000040123945,0.0000017833374,0.004740905,0.00001753616,0.010187263,0.9814006,0.00048898923,0.00088229496],"study_design_scores_gemma":[0.0012821081,0.0014319681,0.0028018055,0.00029632944,0.00008050858,0.000037730886,0.00044083016,0.1745511,0.0431955,0.7746369,0.00036831756,0.00087688304],"about_ca_topic_score_codex":0.00002136619,"about_ca_topic_score_gemma":0.0000025771265,"teacher_disagreement_score":0.20676368,"about_ca_system_score_codex":0.000010361084,"about_ca_system_score_gemma":0.000017786419,"threshold_uncertainty_score":0.50951844},"labels":[],"label_agreement":null},{"id":"W1979733770","doi":"10.1016/s0012-365x(03)00311-x","title":"Variable neighborhood search for extremal graphs. 5. Three ways to automate finding conjectures","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Variable neighborhood search; Heuristic; Variable (mathematics); Algebraic number; Series (stratigraphy); Combinatorics; Discrete mathematics; Algorithm; Mathematical optimization; Metaheuristic","score_opus":0.051255614563814056,"score_gpt":0.3153195008242945,"score_spread":0.26406388626048044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979733770","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.0040042237,0.00007434224,0.9793574,0.00014452939,0.00016453848,0.0010362898,0.000027586517,0.00027603726,0.014915029],"genre_scores_gemma":[0.19487783,0.0000022174747,0.8045505,0.00011810784,0.000025504567,0.00017146349,0.000004642323,0.000050936742,0.00019873759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973871,0.000057129404,0.00041240716,0.0005828034,0.0006051555,0.0009554027],"domain_scores_gemma":[0.99746764,0.00083698053,0.000096261945,0.0011163192,0.00019347793,0.00028930957],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013887349,0.00029917623,0.00038231423,0.0003167489,0.00039216212,0.00035796003,0.0013410288,0.00010056238,0.000074501455],"category_scores_gemma":[0.0005283329,0.0002516698,0.00015399756,0.0010418673,0.00008441645,0.00037705325,0.00033052443,0.00021689874,0.00006993729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000084293415,0.00005536313,0.000075423544,0.00014969001,0.00003751045,0.0000086006185,0.001058651,0.00075875054,0.0021085248,0.9947709,0.00017383038,0.00079435704],"study_design_scores_gemma":[0.00042320992,0.00016105192,0.000030138643,0.00007377406,0.0000114365275,0.000040910116,0.00014714446,0.0827535,0.01205709,0.9034129,0.00055096543,0.00033790068],"about_ca_topic_score_codex":0.0000027838805,"about_ca_topic_score_gemma":0.0000029971804,"teacher_disagreement_score":0.19087361,"about_ca_system_score_codex":0.000056273173,"about_ca_system_score_gemma":0.000117611286,"threshold_uncertainty_score":0.99999356},"labels":[],"label_agreement":null},{"id":"W1979947096","doi":"10.1016/s0012-365x(00)00369-1","title":"The upper domination Ramsey number u(3,3,3)","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Ramsey's theorem; Domination analysis; Upper and lower bounds; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Vertex (graph theory); Computer science","score_opus":0.024625825096035517,"score_gpt":0.2973754815534076,"score_spread":0.2727496564573721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979947096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074297893,0.00018327138,0.8836615,0.0030234244,0.00022421921,0.00037472742,0.0000025283325,0.00022122196,0.10487931],"genre_scores_gemma":[0.7601639,0.00021625687,0.21897054,0.00024088577,0.0001132271,0.00011344209,0.0000023417049,0.00005014426,0.020129267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866766,0.00007777153,0.0002376198,0.00021056288,0.00045701064,0.00034935185],"domain_scores_gemma":[0.99832684,0.0005333259,0.00009196532,0.00088271854,0.00008839846,0.00007677142],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005427399,0.0001251378,0.00011792746,0.00003836663,0.00036850915,0.00030326546,0.0011307398,0.000042940235,0.00013586851],"category_scores_gemma":[0.0002563431,0.0000784939,0.000083078645,0.0003672373,0.00013618686,0.000380004,0.00027115608,0.0001629415,0.0011910162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010953388,0.00003220123,0.000052527434,0.000013053093,0.000010907686,0.000003466794,0.0011859513,0.000005615299,0.00007800128,0.98457885,0.0014730431,0.01256528],"study_design_scores_gemma":[0.00027703837,0.000027050388,0.00008748693,0.000027440254,0.0000056412973,0.000040005656,0.00044225183,0.2445704,0.001022145,0.7378409,0.015432844,0.00022680557],"about_ca_topic_score_codex":8.277401e-7,"about_ca_topic_score_gemma":0.0000012396686,"teacher_disagreement_score":0.7527341,"about_ca_system_score_codex":0.000044096658,"about_ca_system_score_gemma":0.0000067334213,"threshold_uncertainty_score":0.9995867},"labels":[],"label_agreement":null},{"id":"W1980356269","doi":"10.1016/s0012-365x(02)00492-2","title":"On the non-existence of quasi-3 designs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; Okanagan College","funders":"","keywords":"Mathematics; Dual (grammatical number); Discrete mathematics; Combinatorics; Arithmetic; Linguistics","score_opus":0.023208766331806904,"score_gpt":0.22167077100832394,"score_spread":0.19846200467651703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980356269","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6614491,0.000107496104,0.11793541,0.000023180952,0.00026612158,0.00039115304,0.00001178531,0.000117112875,0.21969865],"genre_scores_gemma":[0.998391,0.000005112286,0.0013545176,0.000013318138,0.0000075269686,0.000017373995,5.88401e-7,0.00002004578,0.0001905703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994342,0.000035256384,0.00020447401,0.000062901076,0.000130386,0.00013280049],"domain_scores_gemma":[0.999321,0.00024629373,0.000043135355,0.00034586695,0.00001562943,0.000028071536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003402096,0.00010659056,0.0001554308,0.000027761214,0.00004107453,0.000013266327,0.00016027594,0.000037583755,0.000074084055],"category_scores_gemma":[0.00008216852,0.0000673649,0.00007079776,0.00012486412,0.000046340254,0.000025998666,0.0000058300757,0.00007874443,0.00006638048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012113397,0.000028102744,0.000016222759,0.00021423194,0.000028701083,0.0000011844764,0.0018735899,0.00063208013,0.0021514557,0.9947025,0.0003200192,0.00003067551],"study_design_scores_gemma":[0.00043165765,0.00025109103,0.000079401914,0.00077426207,0.00007940922,0.000030400899,0.008402061,0.056799028,0.11833359,0.8130053,0.0011959864,0.0006177557],"about_ca_topic_score_codex":5.698433e-7,"about_ca_topic_score_gemma":5.567336e-7,"teacher_disagreement_score":0.33694187,"about_ca_system_score_codex":0.000008042039,"about_ca_system_score_gemma":0.000004708639,"threshold_uncertainty_score":0.2747061},"labels":[],"label_agreement":null},{"id":"W1980634280","doi":"10.1016/j.disc.2011.11.032","title":"A degree condition for cycles of maximum length in bipartite digraphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Digraph; Mathematics; Combinatorics; Degree (music); Hamiltonian (control theory); Discrete mathematics; Graph; Physics","score_opus":0.08954373980614025,"score_gpt":0.3256156053587312,"score_spread":0.23607186555259094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980634280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16647412,0.00006306039,0.8281071,0.000039192822,0.000046055713,0.0004852356,0.000024196564,0.00005983183,0.004701186],"genre_scores_gemma":[0.76831585,0.000011962711,0.23153163,0.000010485597,0.00000586318,0.00007913388,0.0000039150086,0.000012986571,0.000028154696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989034,0.00004006995,0.0003469911,0.00021233692,0.00021155301,0.00028565477],"domain_scores_gemma":[0.99895304,0.0002321719,0.0001492733,0.00052946096,0.000077970406,0.000058061654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045817049,0.000118210104,0.00022123018,0.00022934846,0.00004165915,0.00002274196,0.000640361,0.000047074795,0.000017819528],"category_scores_gemma":[0.00013618292,0.00010096531,0.00009620326,0.00039560653,0.00013096063,0.00034372037,0.00013374582,0.00008094719,0.000009871976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021999747,0.00016668216,0.0008095918,0.00024191706,0.000021048945,0.000004827492,0.00654157,0.000008438367,0.001996258,0.985658,0.000024620686,0.0045050606],"study_design_scores_gemma":[0.00040787316,0.00013135717,0.0012146677,0.00009475635,0.0000062604586,0.000004204797,0.00042244935,0.0186645,0.030627128,0.94824743,0.00003380957,0.00014553324],"about_ca_topic_score_codex":0.0000054097254,"about_ca_topic_score_gemma":0.00001898835,"teacher_disagreement_score":0.60184175,"about_ca_system_score_codex":0.000013380703,"about_ca_system_score_gemma":0.000021395817,"threshold_uncertainty_score":0.4117246},"labels":[],"label_agreement":null},{"id":"W1980687521","doi":"10.1016/s0012-365x(01)00292-8","title":"On interleaved sequences over finite fields","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Finite field; Mathematics; Sequence (biology); Combinatorics; Polynomial; Discrete mathematics; Field (mathematics); Mathematical analysis; Pure mathematics","score_opus":0.025723502834655305,"score_gpt":0.24486290502364497,"score_spread":0.21913940218898967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980687521","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.06917385,0.000058085745,0.85503936,0.0009602092,0.00033640853,0.00013609708,0.0000041829967,0.00030530844,0.07398648],"genre_scores_gemma":[0.981992,0.000016433525,0.016500752,0.00073717703,0.000032698474,0.000009233006,7.0732983e-7,0.000008081519,0.00070288335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991781,0.000035421665,0.00018273582,0.00020611756,0.00020351629,0.00019410165],"domain_scores_gemma":[0.99891925,0.0003733703,0.00007267028,0.00055854913,0.000017816146,0.000058329926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016054843,0.00013068128,0.00013711186,0.000088824345,0.00009263136,0.00015464713,0.0006790108,0.00005290372,0.00039813828],"category_scores_gemma":[0.00008819226,0.00010236379,0.00011151162,0.0002490893,0.000051138908,0.0001820762,0.0001174964,0.00013048002,0.00022913204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018114754,0.00006642027,0.000023186092,0.000027460326,0.000017024362,0.000011603092,0.0039948407,0.000057338904,0.000035483845,0.9896254,0.0018965603,0.004242892],"study_design_scores_gemma":[0.00020057376,0.00022064218,0.000037019996,0.00013036771,0.0000094102315,0.000008263566,0.00011262113,0.24095927,0.00064498896,0.75588405,0.0015194746,0.0002733009],"about_ca_topic_score_codex":0.0000014019807,"about_ca_topic_score_gemma":0.0000017941509,"teacher_disagreement_score":0.9128182,"about_ca_system_score_codex":0.0000084906105,"about_ca_system_score_gemma":0.0000032383077,"threshold_uncertainty_score":0.4359335},"labels":[],"label_agreement":null},{"id":"W1980758215","doi":"10.1016/s0012-365x(99)00256-3","title":"Applications of integer relation algorithms","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Integer (computer science); Combinatorics; Relation (database); Zero (linguistics); Discrete mathematics; Algorithm; Computer science; Programming language","score_opus":0.02701054782946852,"score_gpt":0.32568484199527126,"score_spread":0.2986742941658027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980758215","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.018974362,0.00011400095,0.815281,0.00012708713,0.000045915294,0.001032998,0.00004906541,0.00030645134,0.16406913],"genre_scores_gemma":[0.1741255,0.00010573714,0.7807075,0.00003590562,0.00015515178,0.00039434986,0.000034362743,0.00014984683,0.044291645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982318,0.000032615044,0.0008233764,0.00022411346,0.00043155768,0.00025650073],"domain_scores_gemma":[0.99816793,0.00063953974,0.00028074413,0.0007050127,0.00012270057,0.00008407823],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032084435,0.00022080528,0.00044883907,0.00010196,0.000088358574,0.000029843202,0.00031078115,0.0001108782,0.0022683996],"category_scores_gemma":[0.00029798545,0.00018992278,0.00016256975,0.0003154092,0.00019132224,0.00023721087,0.000054355645,0.00016791926,0.00031148223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006695084,0.0003328215,0.000017473278,0.0008864295,0.00006423177,0.0000017132177,0.0025379588,0.000029789317,0.0002262753,0.9885319,0.0007317579,0.0066329553],"study_design_scores_gemma":[0.00021068197,0.000028847046,0.000013217959,0.00016329622,0.00009022374,0.0000137106035,0.0007468412,0.0038916937,0.0014511717,0.99103326,0.0021471381,0.00020991592],"about_ca_topic_score_codex":0.0000035094824,"about_ca_topic_score_gemma":0.0000026947073,"teacher_disagreement_score":0.15515114,"about_ca_system_score_codex":0.00004129097,"about_ca_system_score_gemma":0.000021541624,"threshold_uncertainty_score":0.99864364},"labels":[],"label_agreement":null},{"id":"W1980966478","doi":"10.1016/j.disc.2007.07.115","title":"Colouring even cycle systems","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.0071205228748530405,"score_gpt":0.2108613125004122,"score_spread":0.20374078962555917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980966478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8176757,0.0005719615,0.08535834,0.0000057779225,0.0008734461,0.00031361807,0.000010856143,0.0006457685,0.09454454],"genre_scores_gemma":[0.9985946,0.0000057808184,0.00082748797,0.000004799079,0.00011432865,0.000013360312,0.0000035618732,0.000044800032,0.00039132853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990898,0.0000131368815,0.00033393374,0.000094330484,0.00016665294,0.00030217168],"domain_scores_gemma":[0.9994819,0.00009247589,0.000043278014,0.00027539072,0.00001869068,0.000088253866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000579867,0.00014494717,0.00020714167,0.00007118327,0.00006139193,0.000048865044,0.00016146612,0.00007713696,0.000020509346],"category_scores_gemma":[0.000018584162,0.00013090474,0.0000673414,0.00014151406,0.000023337987,0.00007515656,0.000019916462,0.000104441264,0.00015682445],"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.000023216864,0.00015241293,0.0011171892,0.0061801677,0.0005374814,0.00017000719,0.01859354,0.06577,0.0249777,0.87780267,0.0029800518,0.0016955592],"study_design_scores_gemma":[0.0022114364,0.00020575884,0.002339216,0.0025113407,0.0002939703,0.000572647,0.036062673,0.7982462,0.034397844,0.08752327,0.032269657,0.0033660047],"about_ca_topic_score_codex":0.0000042376273,"about_ca_topic_score_gemma":0.0000041195385,"teacher_disagreement_score":0.7902794,"about_ca_system_score_codex":0.000034715795,"about_ca_system_score_gemma":0.0000031378165,"threshold_uncertainty_score":0.533814},"labels":[],"label_agreement":null},{"id":"W1981011157","doi":"10.1016/j.disc.2014.02.006","title":"Binary matroids with no 4-spike minors","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Matroid; Combinatorics; Minor (academic); Mathematics; Binary number; Simple (philosophy); Rank (graph theory); Circumference; Bounding overwatch; Discrete mathematics; Computer science; Arithmetic","score_opus":0.012548588064515712,"score_gpt":0.26391457852280636,"score_spread":0.25136599045829067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981011157","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.04140617,0.000026531998,0.92679834,0.0002950311,0.00008782354,0.00023510867,0.0000026767898,0.0002524182,0.030895898],"genre_scores_gemma":[0.33405796,0.0000067982305,0.6621429,0.00016189784,0.00007635172,0.000044901386,0.000004321569,0.000046624664,0.003458282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983902,0.00007515148,0.0002445409,0.00034545045,0.0005037113,0.00044094046],"domain_scores_gemma":[0.99821913,0.00023868568,0.0001106591,0.001163024,0.0001158514,0.00015267031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005007903,0.00020165632,0.00024978368,0.0001329199,0.0001379344,0.00014652427,0.0011977835,0.00004884998,0.000036930058],"category_scores_gemma":[0.00012336155,0.00014230428,0.000071786235,0.0004279291,0.00016020371,0.00037586983,0.00034444124,0.00017572929,0.00057544373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001643536,0.00009638983,0.00021239882,0.00020309666,0.000029095494,0.000021692918,0.0010745972,0.00014009996,0.0014724161,0.99256676,0.00057799125,0.0035890243],"study_design_scores_gemma":[0.0012200633,0.0013867037,0.0005165862,0.00029947027,0.00002903397,0.00013321926,0.00035271744,0.43481243,0.0048214626,0.5436299,0.011712639,0.001085779],"about_ca_topic_score_codex":0.0000017485656,"about_ca_topic_score_gemma":0.0000015225243,"teacher_disagreement_score":0.44893688,"about_ca_system_score_codex":0.000022896085,"about_ca_system_score_gemma":0.000027973054,"threshold_uncertainty_score":0.7396357},"labels":[],"label_agreement":null},{"id":"W1981737915","doi":"10.1016/j.disc.2007.03.017","title":"Perfect matchings after vertex deletions","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Factor-critical graph; Distance-hereditary graph; Perfect graph theorem; Discrete mathematics; Induced subgraph; Graph; Line graph; Pathwidth; Graph power","score_opus":0.013243460046563798,"score_gpt":0.29337321976176767,"score_spread":0.2801297597152039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981737915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084737346,0.00007428535,0.90645766,0.00025252436,0.00009950253,0.00017989683,0.0000033098277,0.00018889247,0.008006551],"genre_scores_gemma":[0.7073613,0.0000065840227,0.29168648,0.00015828645,0.00002052293,0.000021958618,0.0000017671294,0.000021535712,0.0007215921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984829,0.0000340761,0.0002809187,0.0002814299,0.0004325988,0.00048808072],"domain_scores_gemma":[0.99855983,0.00034932257,0.00006641077,0.00079495815,0.000075856515,0.00015363935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092643977,0.00015903171,0.00016988667,0.00016161415,0.00014499879,0.00013494688,0.00082226004,0.000055600638,0.00007092491],"category_scores_gemma":[0.00013598896,0.00013237017,0.00011051883,0.00045516092,0.00009723385,0.00038697183,0.00032913458,0.00021198193,0.00036509216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013925384,0.00009972568,0.00029418975,0.000090901034,0.000026294345,0.000082531034,0.004317328,0.000020684814,0.0015758787,0.98708993,0.00023254567,0.0061560464],"study_design_scores_gemma":[0.00038615245,0.000118321914,0.0017581027,0.00011748137,0.000015346133,0.00011183103,0.00050298736,0.03541731,0.004436239,0.9539654,0.002632959,0.00053786],"about_ca_topic_score_codex":0.0000023786615,"about_ca_topic_score_gemma":0.0000066725192,"teacher_disagreement_score":0.6226239,"about_ca_system_score_codex":0.00004306377,"about_ca_system_score_gemma":0.000023608069,"threshold_uncertainty_score":0.53978986},"labels":[],"label_agreement":null},{"id":"W1981877143","doi":"10.1016/j.disc.2004.07.019","title":"On the equivalence problem for succession rules","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Bijection; Enumeration; Equivalence (formal languages); Sequence (biology); Catalan number; Equivalence class (music); Combinatorics; Class (philosophy); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.05257438641715501,"score_gpt":0.3441903810210842,"score_spread":0.2916159946039292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981877143","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.19591989,0.00014428479,0.73578167,0.008293742,0.0006629487,0.006394179,0.00015332995,0.0009984728,0.051651474],"genre_scores_gemma":[0.29467165,0.000020837528,0.70046043,0.0003429463,0.0004586186,0.00079231843,0.000012156768,0.00019939106,0.0030416176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99759597,0.000064683,0.0007789159,0.00036211725,0.000637509,0.0005608324],"domain_scores_gemma":[0.99303645,0.0050957426,0.0005052211,0.0010771293,0.00017266645,0.00011277867],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009848782,0.00041176958,0.0004912047,0.000077126875,0.00038654008,0.000118991826,0.0008457965,0.0001393952,0.00015566449],"category_scores_gemma":[0.0026589504,0.00025066175,0.00023854472,0.00018582391,0.00013587711,0.00021854692,0.00017889508,0.0002690421,0.00019914855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019429104,0.00027434705,0.0000014152039,0.00053057075,0.000033214932,8.017963e-7,0.0014244196,0.000036426765,0.00030866478,0.99053717,0.005871109,0.0009624544],"study_design_scores_gemma":[0.0005032004,0.00013339904,8.91146e-7,0.00050971366,0.00007202326,0.0000075754874,0.00044138046,0.008783892,0.004453083,0.9816948,0.003057597,0.00034241902],"about_ca_topic_score_codex":5.482484e-7,"about_ca_topic_score_gemma":0.0000024819924,"teacher_disagreement_score":0.09875177,"about_ca_system_score_codex":0.0001166953,"about_ca_system_score_gemma":0.000042475054,"threshold_uncertainty_score":0.9999946},"labels":[],"label_agreement":null},{"id":"W1981884232","doi":"10.1016/j.disc.2005.12.048","title":"Can transitive orientation make sandwich problems easier?","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Transitive relation; Combinatorics; Mathematics; Partially ordered set; Comparability graph; Transitive reduction; Orientation (vector space); Comparability; Graph; Discrete mathematics; Line graph; Pathwidth; Voltage graph","score_opus":0.01616633255282864,"score_gpt":0.27545241161224837,"score_spread":0.25928607905941975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981884232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029055761,0.000047913698,0.9587537,0.0006309551,0.000076260054,0.00044108613,0.000018919176,0.00018417658,0.010791234],"genre_scores_gemma":[0.8834875,0.000005234705,0.11533573,0.000052088457,0.00004774152,0.000063818785,0.000023645265,0.000024676141,0.0009595156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844414,0.00006838401,0.0003050092,0.00032657583,0.00047400326,0.00038190963],"domain_scores_gemma":[0.99904,0.00013044194,0.00010474901,0.0005252381,0.000119622164,0.00007992421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033595384,0.00016755352,0.0001877241,0.00012149172,0.00015111372,0.0001529204,0.00055644964,0.000051059884,0.000011384152],"category_scores_gemma":[0.000036403817,0.00014353135,0.00007799834,0.0005664355,0.00009919,0.00024099766,0.000089218556,0.00014142855,0.000036631107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004397539,0.00009200131,0.00017902526,0.00010808404,0.000015955793,0.000015845902,0.004277856,0.00046037495,0.0028019415,0.98905027,0.00006383943,0.0029303874],"study_design_scores_gemma":[0.00047418676,0.00007913646,0.00050304126,0.000067905865,0.000011399517,0.00002638609,0.00060133036,0.05149183,0.006261388,0.9399016,0.00029082058,0.0002910109],"about_ca_topic_score_codex":0.000022766893,"about_ca_topic_score_gemma":0.000061716855,"teacher_disagreement_score":0.8544318,"about_ca_system_score_codex":0.00005054444,"about_ca_system_score_gemma":0.00004331654,"threshold_uncertainty_score":0.58530384},"labels":[],"label_agreement":null},{"id":"W1981970597","doi":"10.1016/j.disc.2006.03.054","title":"Sums of powers of the degrees of a graph","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Combinatorics; Sums of powers; Graph; Discrete mathematics","score_opus":0.02136883443742171,"score_gpt":0.2740425652291751,"score_spread":0.25267373079175337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981970597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98038745,0.000056249904,0.005762168,0.00006352748,0.000029691282,0.00034508336,0.00008495102,0.000020544665,0.013250363],"genre_scores_gemma":[0.97606313,0.0000038930943,0.02361689,0.0000029977923,0.000008212999,0.000013814296,0.0000029098405,0.000018255754,0.00026988628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988661,0.000039921284,0.00061754894,0.00009404934,0.00025813215,0.00012427046],"domain_scores_gemma":[0.9982068,0.00040460099,0.0006074558,0.00065998785,0.00010219117,0.000018953298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031681106,0.00012049824,0.0003317036,0.00006645325,0.000042394877,0.0000037672787,0.0003725466,0.00005772653,0.0000401758],"category_scores_gemma":[0.00014191188,0.00007771752,0.00026459194,0.00036402582,0.00033861704,0.00003122501,0.000067000205,0.00006806033,0.0000014857268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004105859,0.0001734321,0.00062213367,0.0004992514,0.000035766967,8.79998e-8,0.0008283194,0.000026591037,0.011727105,0.98573625,0.00032799,0.000018943403],"study_design_scores_gemma":[0.00016755208,0.000022224043,0.00080264197,0.00017049511,0.000105132705,0.0000023475488,0.00086235,0.00019032959,0.0680093,0.9295462,0.000040791056,0.00008068358],"about_ca_topic_score_codex":0.000024284445,"about_ca_topic_score_gemma":0.000021136046,"teacher_disagreement_score":0.056282192,"about_ca_system_score_codex":0.000004582121,"about_ca_system_score_gemma":0.000018170911,"threshold_uncertainty_score":0.31692287},"labels":[],"label_agreement":null},{"id":"W1982282944","doi":"10.1016/j.disc.2011.11.029","title":"Chop vectors and the lattice of integer partitions","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Lattice (music); Discrete mathematics; Sequence (biology); Order (exchange); Element (criminal law); Computer science; Law","score_opus":0.033542135627341,"score_gpt":0.2555180730623817,"score_spread":0.22197593743504074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982282944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010026801,0.00009448721,0.9171972,0.0002925749,0.00003402834,0.00014187788,0.0000024954372,0.00017576253,0.07203475],"genre_scores_gemma":[0.7099964,0.000007992267,0.28978768,0.00006193441,0.0000044175185,0.00001609052,2.5031252e-7,0.0000060104767,0.00011924696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994852,0.000018868139,0.00018303722,0.000101911915,0.000114316834,0.000096649266],"domain_scores_gemma":[0.9993078,0.00012025579,0.000105974286,0.00037980985,0.000058257647,0.000027870901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025195823,0.000072809446,0.00012533797,0.000032667478,0.000042913573,0.000093756695,0.00045768864,0.000020353822,0.000007170726],"category_scores_gemma":[0.00016439628,0.000043433058,0.000036140005,0.00014312203,0.0002779184,0.00038061236,0.00023522279,0.000056977282,0.0000075329094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002355702,0.000048321846,0.000044608878,0.00007864912,0.000013780262,0.0000011726394,0.0091737965,1.174845e-7,0.000053521737,0.98861915,0.00019907534,0.0017654774],"study_design_scores_gemma":[0.0001772489,0.000031052485,0.00015388506,0.00011176377,0.000021545027,0.000015058169,0.00022474244,0.01315447,0.010376333,0.97549456,0.00013085596,0.00010847715],"about_ca_topic_score_codex":0.000006820601,"about_ca_topic_score_gemma":0.0000010492871,"teacher_disagreement_score":0.6999696,"about_ca_system_score_codex":0.000003896392,"about_ca_system_score_gemma":0.000012282322,"threshold_uncertainty_score":0.17711487},"labels":[],"label_agreement":null},{"id":"W1982754491","doi":"10.1016/j.disc.2011.06.002","title":"Vertex partitions of metric spaces with finite distance sets","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Isometry (Riemannian geometry); Metric space; Subspace topology; Injective metric space; Combinatorics; Metric (unit); Intrinsic metric; Countable set; Convex metric space; Discrete mathematics; Vertex (graph theory); Space (punctuation); Finite set; Isometry group; Pure mathematics; Mathematical analysis; Graph; Computer science","score_opus":0.054622212270232375,"score_gpt":0.30333353630806004,"score_spread":0.24871132403782767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982754491","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.21782432,0.000225656,0.6917697,0.00008295522,0.0001272577,0.0005203942,0.00014017189,0.00020413553,0.08910539],"genre_scores_gemma":[0.8438537,0.000021773409,0.15533756,0.000020647783,0.000008378987,0.000027944237,0.00000760574,0.000032864657,0.0006895165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989389,0.000051506773,0.00037114212,0.0001807707,0.00020057842,0.00025708368],"domain_scores_gemma":[0.998207,0.0008083193,0.00030303875,0.0005252389,0.00008348583,0.00007293373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002344564,0.00019405775,0.0003930128,0.0001099343,0.00009667124,0.000008030042,0.00022452725,0.00008355985,0.00038213155],"category_scores_gemma":[0.000504877,0.00014001723,0.00008366142,0.0003400274,0.0003404506,0.00013467179,0.00004904621,0.00013926112,0.000037097547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004682787,0.00026765457,0.00034296035,0.00034599408,0.000104420644,0.000014620735,0.0061969804,0.000012790203,0.000030174426,0.9923104,0.0001991116,0.00012806576],"study_design_scores_gemma":[0.00033472374,0.00014567087,0.0001572557,0.00015723822,0.00014512599,0.000014986452,0.0022934617,0.0005057753,0.002246201,0.9936148,0.00017233411,0.00021241934],"about_ca_topic_score_codex":0.000002958742,"about_ca_topic_score_gemma":0.000023177414,"teacher_disagreement_score":0.6260294,"about_ca_system_score_codex":0.000014813266,"about_ca_system_score_gemma":0.000025011714,"threshold_uncertainty_score":0.5709737},"labels":[],"label_agreement":null},{"id":"W1982895103","doi":"10.1016/s0012-365x(03)00031-1","title":"Bhaskar Rao designs with block size four","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Block size; Incidence matrix; Combinatorics; Block (permutation group theory); Block design; Row; Discrete mathematics; Product (mathematics); Computer science; Key (lock)","score_opus":0.016759671315099114,"score_gpt":0.1989495018509451,"score_spread":0.18218983053584598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982895103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7149882,0.00031416182,0.09715576,0.000025924055,0.0003414147,0.000652069,0.000016800743,0.00081740785,0.18568829],"genre_scores_gemma":[0.9864044,0.0000066808793,0.012457388,0.000015987038,0.000026726766,0.00003223475,0.0000010579681,0.00006250787,0.0009930027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991654,0.00003972399,0.00022693924,0.00012240435,0.00017004649,0.00027547425],"domain_scores_gemma":[0.99933016,0.00015762371,0.000040352592,0.00036168698,0.0000232031,0.00008699124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002465938,0.0002016082,0.0002438768,0.00003555707,0.000065448556,0.000047005215,0.00013325058,0.000067597735,0.00009609228],"category_scores_gemma":[0.000060776056,0.00015347471,0.00006818078,0.00017500452,0.000036893834,0.000069350725,0.0000072557373,0.000114121016,0.000115386814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039424776,0.00025317777,0.0010186046,0.003669525,0.0010523468,0.00022785996,0.016589377,0.029148925,0.024548817,0.91812664,0.0049601607,0.0003651595],"study_design_scores_gemma":[0.009595023,0.0013383812,0.00074525777,0.0035898408,0.0014213726,0.0034353375,0.031129615,0.11429218,0.20344283,0.5413772,0.08099775,0.008635247],"about_ca_topic_score_codex":5.912242e-7,"about_ca_topic_score_gemma":0.0000023368027,"teacher_disagreement_score":0.37674946,"about_ca_system_score_codex":0.00001772391,"about_ca_system_score_gemma":0.000010169032,"threshold_uncertainty_score":0.6258517},"labels":[],"label_agreement":null},{"id":"W1982921028","doi":"10.1016/j.disc.2008.01.028","title":"On the fractional chromatic number of monotone self-dual Boolean functions","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Mathematics; Monotone polygon; Chromatic scale; Dual (grammatical number); Discrete mathematics; Combinatorics; Boolean function","score_opus":0.01700502452972911,"score_gpt":0.2437170119604473,"score_spread":0.2267119874307182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982921028","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49454296,0.000014874333,0.49293545,0.0006147312,0.0002717719,0.00020263002,0.000014575956,0.00020613134,0.011196891],"genre_scores_gemma":[0.9350844,0.000006151532,0.064027816,0.00023915342,0.0000815629,0.000028387143,0.0000051614816,0.000015893092,0.0005114714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989045,0.00004531135,0.00030047397,0.0001758183,0.00039879236,0.00017507639],"domain_scores_gemma":[0.9985103,0.0005291491,0.00018026441,0.00068523287,0.0000462437,0.00004883219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002509654,0.0001399123,0.00018356739,0.00004012767,0.00023717855,0.00003762987,0.00044435117,0.000043859724,0.00023302574],"category_scores_gemma":[0.000075339674,0.000089919085,0.00011037149,0.00022545102,0.00009080048,0.0001904016,0.000119139906,0.00013420235,0.00044557636],"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.0000027742713,0.00034154844,0.000071079354,0.000056536042,0.00008547213,0.000010845447,0.0040802127,0.00016346919,0.00019260448,0.9882171,0.006615899,0.00016241721],"study_design_scores_gemma":[0.00039113633,0.00010869844,0.0012016068,0.00013791607,0.000042954594,0.0004474559,0.00071006705,0.55933404,0.0015543847,0.43464658,0.0010657441,0.00035941217],"about_ca_topic_score_codex":0.000004137795,"about_ca_topic_score_gemma":3.1842944e-7,"teacher_disagreement_score":0.55917054,"about_ca_system_score_codex":0.00002446431,"about_ca_system_score_gemma":0.00004194945,"threshold_uncertainty_score":0.57271314},"labels":[],"label_agreement":null},{"id":"W1984228559","doi":"10.1016/j.disc.2003.06.004","title":"Roman domination in graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":556,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Vertex (graph theory); Graph; Dominating set; Minimum weight; Discrete mathematics","score_opus":0.01958927517900732,"score_gpt":0.2969287906505696,"score_spread":0.27733951547156227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984228559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08450676,0.00007921039,0.8754576,0.00013817314,0.000082761246,0.0002841838,0.0000010981756,0.00009702132,0.03935318],"genre_scores_gemma":[0.79914755,0.000010215293,0.20043147,0.000029806808,0.00000352833,0.00002833529,0.0000010910501,0.000011517687,0.0003364713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891037,0.00009557361,0.00022602861,0.00021388206,0.0002844882,0.0002696412],"domain_scores_gemma":[0.9991419,0.00016535478,0.00006266267,0.00053299277,0.000037656715,0.000059466718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006804299,0.00010334623,0.0001370289,0.00022351791,0.000055539527,0.00007749109,0.00052921317,0.000038468454,0.000020653906],"category_scores_gemma":[0.00026269208,0.000090361136,0.00004871246,0.00070742035,0.00005190007,0.000353948,0.00008124901,0.0001222276,0.000055718865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.508028e-7,0.000043221837,0.00019943182,0.000022725366,0.0000028112063,0.000008803591,0.00098328,0.00003055865,0.0003457812,0.9974597,0.00002327794,0.0008796443],"study_design_scores_gemma":[0.0002557061,0.000025913372,0.0002911551,0.00002615088,0.0000012683985,0.000011297733,0.0001903023,0.014526376,0.002772683,0.9813966,0.00037479214,0.0001277255],"about_ca_topic_score_codex":0.0000012941575,"about_ca_topic_score_gemma":0.0000070567103,"teacher_disagreement_score":0.7146408,"about_ca_system_score_codex":0.00003489066,"about_ca_system_score_gemma":0.000025017927,"threshold_uncertainty_score":0.36848202},"labels":[],"label_agreement":null},{"id":"W1984327345","doi":"10.1016/j.disc.2004.08.036","title":"Efficient enumeration of sensed planar maps","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Enumeration; Mathematics; Combinatorics; Homeomorphism (graph theory); Embedding; Planar; Quotient; Discrete mathematics; Computer science","score_opus":0.02610764014380604,"score_gpt":0.28508251985170635,"score_spread":0.2589748797079003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984327345","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89019,0.00010626921,0.08978187,0.00088031526,0.00013771509,0.00042514253,0.000055422002,0.00013257997,0.018290667],"genre_scores_gemma":[0.8844871,0.0000039040797,0.114263825,0.000049708673,0.0000981518,0.000008838406,0.000012782307,0.000026285663,0.0010494316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867135,0.000040087587,0.0005569671,0.0001681208,0.0003130732,0.00025039693],"domain_scores_gemma":[0.99872273,0.00045795777,0.00028974476,0.00038985017,0.00007237629,0.0000673102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037745293,0.0001669767,0.00036697902,0.00017201906,0.00006128051,0.000013325726,0.00016325951,0.00010147998,0.00024416056],"category_scores_gemma":[0.00050423975,0.0001367365,0.000112275295,0.00027832782,0.000085948814,0.000025752795,0.000036721347,0.000108595596,0.000112923415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013184568,0.00048214258,0.00009971595,0.00044727683,0.000091846414,0.000007296211,0.005460043,0.0003946432,0.0016962196,0.9847817,0.004693913,0.0018320648],"study_design_scores_gemma":[0.0028397865,0.00036239764,0.000364461,0.0003035753,0.000413497,0.00020998881,0.005668703,0.083634146,0.026608216,0.8718056,0.0066579394,0.0011316546],"about_ca_topic_score_codex":0.0000038441667,"about_ca_topic_score_gemma":0.0000051114985,"teacher_disagreement_score":0.11297602,"about_ca_system_score_codex":0.00003031201,"about_ca_system_score_gemma":0.000025550551,"threshold_uncertainty_score":0.55759525},"labels":[],"label_agreement":null},{"id":"W1984405480","doi":"10.1016/j.disc.2012.07.029","title":"Locating a robber on a graph","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Environment and Climate Change Canada","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.023369833768689657,"score_gpt":0.25447043938538544,"score_spread":0.2311006056166958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984405480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.146564,0.00056136405,0.8082233,0.0012344863,0.0008009101,0.00035636398,0.0000028708364,0.00076011923,0.04149655],"genre_scores_gemma":[0.8260798,0.0000029737982,0.1732564,0.0003940694,0.000013992575,0.000013601607,0.0000012443898,0.0000126924815,0.00022527922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894685,0.000026945261,0.00022614464,0.0001691895,0.00027333625,0.0003575113],"domain_scores_gemma":[0.9990286,0.000102438156,0.00009831532,0.0005956338,0.000038634324,0.00013636042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043377563,0.00013506346,0.0001416572,0.000092952374,0.0001168004,0.00008603805,0.00037477782,0.00004357546,0.0000131375655],"category_scores_gemma":[0.00007455305,0.00010166155,0.00007499381,0.00032576473,0.000032945783,0.00022674135,0.0001269611,0.00010769982,0.00030199895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.7735554e-7,0.00011797749,0.00014865014,0.000043289696,0.0000106285215,0.0000010742448,0.0028232893,0.000074949254,0.00036869885,0.9943434,0.0006619678,0.001405478],"study_design_scores_gemma":[0.0006836453,0.00018892794,0.00033211353,0.00037169896,0.000041552084,0.00006755015,0.0005706929,0.10262237,0.008423372,0.8841818,0.0016419867,0.0008743133],"about_ca_topic_score_codex":0.000003694123,"about_ca_topic_score_gemma":3.6120784e-7,"teacher_disagreement_score":0.6795158,"about_ca_system_score_codex":0.00000996182,"about_ca_system_score_gemma":0.000010777805,"threshold_uncertainty_score":0.41456375},"labels":[],"label_agreement":null},{"id":"W1984640610","doi":"10.1016/s0012-365x(01)00450-2","title":"On Hedetniemi's conjecture and the colour template scheme","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Univerza v Mariboru; Sun Yat-sen University","keywords":"Mathematics; Conjecture; Scheme (mathematics); Combinatorics; Discrete mathematics; Arithmetic; Mathematical analysis","score_opus":0.01831893673306925,"score_gpt":0.22702301616141307,"score_spread":0.20870407942834382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984640610","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.20119047,0.0020871037,0.6785564,0.04660887,0.0003313675,0.0009552061,0.00008878957,0.00055188057,0.069629915],"genre_scores_gemma":[0.96298337,0.00011714567,0.03324656,0.0013043691,0.000033885346,0.000016824639,0.0000036128124,0.0000075208686,0.0022867364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999102,0.00004523346,0.00019506818,0.00022620117,0.00024083776,0.0001906575],"domain_scores_gemma":[0.9986745,0.00059881,0.00009602589,0.0005432422,0.000020257681,0.00006716454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002872878,0.00012880709,0.00023850153,0.000070692615,0.00016826858,0.00019827152,0.00063279463,0.00005421198,0.0002019629],"category_scores_gemma":[0.00031616975,0.000062541316,0.00007893994,0.0005362632,0.00016537198,0.00010314551,0.0002525847,0.00013780806,0.00016774867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000246085,0.000038613263,0.000020392417,0.000012927288,0.000038213355,0.000009170526,0.0006456579,0.000009563802,0.0000057549028,0.9933964,0.003960432,0.0018604173],"study_design_scores_gemma":[0.0015970144,0.00018016981,0.0001571372,0.000039855033,0.000065523454,0.00007420241,0.0002474703,0.38968816,0.00013121153,0.59671676,0.010716197,0.00038629607],"about_ca_topic_score_codex":0.0000067884816,"about_ca_topic_score_gemma":0.0000017638424,"teacher_disagreement_score":0.7617929,"about_ca_system_score_codex":0.0000071284226,"about_ca_system_score_gemma":0.0000025359911,"threshold_uncertainty_score":0.2550361},"labels":[],"label_agreement":null},{"id":"W1985536357","doi":"10.1016/s0012-365x(00)00026-1","title":"Cyclic inequivalence of cascaded GMW-sequences","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Autocorrelation; Finite field; Discrete mathematics; Combinatorics; Integer (computer science); Statistics","score_opus":0.015459221939473657,"score_gpt":0.24904263574729807,"score_spread":0.2335834138078244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985536357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7771426,0.00020710658,0.16918255,0.00043194875,0.00011630325,0.00020136722,0.000008725715,0.00024798754,0.05246142],"genre_scores_gemma":[0.9457601,0.000074714466,0.053778037,0.00008317275,0.000021968093,0.000008628366,9.940429e-7,0.000007785134,0.00026461258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989444,0.000046202553,0.0003168713,0.0002113951,0.00026592237,0.00021518079],"domain_scores_gemma":[0.9990158,0.00014491005,0.00011211381,0.00063149544,0.00003157397,0.00006411128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031197685,0.00013121785,0.00021225466,0.0000787174,0.00007350235,0.00005796545,0.0009952006,0.000046031742,0.00025252867],"category_scores_gemma":[0.000028455423,0.00010631749,0.00012077211,0.00047339112,0.00013801739,0.00027176598,0.00008912191,0.000085482505,0.00006882785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056543745,0.00009196465,0.00015880704,0.00014358487,0.000028685776,0.000009497589,0.004135919,0.00006330475,0.002979834,0.96623254,0.00013383443,0.026016364],"study_design_scores_gemma":[0.00041095092,0.00025781378,0.00066789985,0.0003597461,0.000040733285,0.00007523174,0.00038824585,0.022837365,0.028402422,0.94382477,0.002167214,0.00056760607],"about_ca_topic_score_codex":0.0000074266677,"about_ca_topic_score_gemma":0.0000015146529,"teacher_disagreement_score":0.1686175,"about_ca_system_score_codex":0.000006606365,"about_ca_system_score_gemma":0.000019559851,"threshold_uncertainty_score":0.43355015},"labels":[],"label_agreement":null},{"id":"W1985568077","doi":"10.1016/j.disc.2007.07.039","title":"Trees with depression three","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Depression (economics)","score_opus":0.023816710911365575,"score_gpt":0.2927496452322637,"score_spread":0.26893293432089815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985568077","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6911368,0.00009182087,0.24755907,0.000035272315,0.00012532223,0.00034335174,0.000007942147,0.00022290299,0.060477562],"genre_scores_gemma":[0.86330897,0.0000032859712,0.13602066,0.00004752805,0.000107727035,0.00000832889,0.0000033736517,0.000059743365,0.0004403758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851024,0.000017782875,0.00039372573,0.00024076161,0.00044072352,0.00039678297],"domain_scores_gemma":[0.9983215,0.0006043722,0.00020143596,0.00068630633,0.000065155415,0.00012124581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006704687,0.00025814795,0.00032289783,0.000101441656,0.00027021987,0.000040005478,0.00032599436,0.000117374766,0.00012890712],"category_scores_gemma":[0.00019092984,0.00015394011,0.00010535981,0.00018518696,0.00015368787,0.00010269395,0.000133008,0.00019351584,0.000011385235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007590128,0.000104551335,0.005655594,0.0002135624,0.00009703382,0.000042456948,0.003360814,0.0000042568786,0.00032312746,0.9866418,0.00049359695,0.002987297],"study_design_scores_gemma":[0.00049520243,0.00008161625,0.0031038618,0.0001814338,0.000097296375,0.000074246236,0.00087080384,0.00034051156,0.0033953204,0.99060047,0.0004264107,0.0003328437],"about_ca_topic_score_codex":0.0000035595551,"about_ca_topic_score_gemma":0.00014803768,"teacher_disagreement_score":0.17217222,"about_ca_system_score_codex":0.000021946817,"about_ca_system_score_gemma":0.00001250724,"threshold_uncertainty_score":0.62774956},"labels":[],"label_agreement":null},{"id":"W1985708755","doi":"10.1016/s0012-365x(00)00324-1","title":"Pushing the cycles out of multipartite tournaments","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Tournament; Discrete mathematics","score_opus":0.01945680643809539,"score_gpt":0.24135492945844647,"score_spread":0.22189812302035108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985708755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"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.00023579778,0.014053095,0.00004461451,0.0003426444,0.00017866913,0.0000084476815,0.00011762505,0.019597521],"genre_scores_gemma":[0.9989807,0.00003979045,0.0006943579,0.000010196194,0.000044251705,0.00001212263,0.0000017318944,0.000022917508,0.00019395928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933505,0.000022038841,0.00027863655,0.000058760965,0.00014569036,0.00015983856],"domain_scores_gemma":[0.99952817,0.00008283488,0.000061382,0.00027783323,0.000015612304,0.000034175548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024351804,0.00010550588,0.00016008821,0.000030340976,0.000053203898,0.00003079801,0.00019950545,0.00003569581,0.000038696242],"category_scores_gemma":[0.000029400499,0.00006892529,0.00007932531,0.000080344355,0.00003960238,0.0000762168,0.000023273336,0.00008389333,0.000045466895],"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.00008842123,0.00071663497,0.028680284,0.0059439745,0.0025577247,0.0001260688,0.26628464,0.093856744,0.1919751,0.37880543,0.008846562,0.022118406],"study_design_scores_gemma":[0.0026311052,0.00016999041,0.00602405,0.0028943378,0.00049599004,0.00018021312,0.044993415,0.62327963,0.07061873,0.20094162,0.04562183,0.002149057],"about_ca_topic_score_codex":0.000002258925,"about_ca_topic_score_gemma":0.000008503031,"teacher_disagreement_score":0.52942294,"about_ca_system_score_codex":0.000009613797,"about_ca_system_score_gemma":0.0000019746506,"threshold_uncertainty_score":0.2810692},"labels":[],"label_agreement":null},{"id":"W1985793060","doi":"10.1016/j.disc.2006.08.010","title":"Retractions onto series-parallel posets","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Partially ordered set; Mathematics; Combinatorics; Homomorphism; Star product; Series (stratigraphy); Discrete mathematics; Algebraic number","score_opus":0.02578994077376497,"score_gpt":0.3219776912850309,"score_spread":0.29618775051126595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985793060","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.0060574305,0.000054334138,0.95151705,0.00053607946,0.00016203805,0.00021943102,0.00000426813,0.00024998345,0.04119938],"genre_scores_gemma":[0.21887624,0.000022502481,0.77550024,0.00011906664,0.00007197157,0.000016145272,0.000005479802,0.000030560062,0.005357792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983604,0.000033870532,0.00033572203,0.00028855162,0.00048125783,0.00050021074],"domain_scores_gemma":[0.9983869,0.00025587616,0.00011145642,0.00095881626,0.000105955,0.0001809533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093964895,0.00016049817,0.00018249502,0.00015214183,0.00021165184,0.00013442984,0.000928972,0.00007383007,0.000045118275],"category_scores_gemma":[0.00020074636,0.00013967563,0.00009533146,0.00054624066,0.00010129594,0.00078768196,0.00025659616,0.0002565174,0.000227632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000105345425,0.00007442027,0.000056709483,0.000035335266,0.000019525656,0.000037925834,0.0013978792,0.000036716956,0.0014806626,0.994218,0.00038373133,0.002248541],"study_design_scores_gemma":[0.0003897397,0.0001778712,0.0012034179,0.000062407955,0.000011310585,0.00024140625,0.00094729033,0.010297993,0.0051755067,0.9707162,0.010277481,0.0004993982],"about_ca_topic_score_codex":0.0000038675616,"about_ca_topic_score_gemma":0.000031921783,"teacher_disagreement_score":0.21281882,"about_ca_system_score_codex":0.000060446087,"about_ca_system_score_gemma":0.000036149737,"threshold_uncertainty_score":0.56958073},"labels":[],"label_agreement":null},{"id":"W1986412636","doi":"10.1016/j.disc.2008.02.029","title":"Posets of annular non-crossing partitions of types B and D","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; American Institute of Mathematics","keywords":"Partially ordered set; Bijection; Mathematics; Combinatorics; Lattice (music); Isomorphism (crystallography); Type (biology); Order type; Order (exchange); Discrete mathematics; Crystal structure; Crystallography; Physics","score_opus":0.039926061150106204,"score_gpt":0.3149453847569901,"score_spread":0.27501932360688386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986412636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9549625,0.00013082493,0.039970476,0.000035250883,0.000101165,0.00036579024,0.000044825112,0.000058603862,0.004330598],"genre_scores_gemma":[0.8274905,0.00003104907,0.17224528,0.000005025011,0.000025171952,0.000011420862,0.0000033514032,0.000041974825,0.00014623019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843913,0.000027665947,0.0007725573,0.00017483276,0.00035271829,0.00023312213],"domain_scores_gemma":[0.99804217,0.00057288934,0.00055168633,0.00055026344,0.00019996955,0.0000830517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002477407,0.00021371084,0.0006417145,0.00009642852,0.00015752735,0.000015993097,0.0001970849,0.0000991058,0.00002740892],"category_scores_gemma":[0.0008299396,0.00018798713,0.000110955574,0.00023066005,0.0005160289,0.00015009523,0.00012593319,0.00011698963,0.0000056414433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027988235,0.0009809543,0.0012115226,0.0047132983,0.00022897292,0.000032772597,0.028173052,0.00004741625,0.01684069,0.9469551,0.0005416205,0.00024664163],"study_design_scores_gemma":[0.0005408298,0.000119419004,0.00019465486,0.00046354852,0.00011735449,0.00009836888,0.00076573907,0.0017039208,0.031696916,0.9640075,0.00005107333,0.00024066967],"about_ca_topic_score_codex":0.0000037858229,"about_ca_topic_score_gemma":0.0000012634641,"teacher_disagreement_score":0.1322748,"about_ca_system_score_codex":0.000017790042,"about_ca_system_score_gemma":0.000058943457,"threshold_uncertainty_score":0.7665892},"labels":[],"label_agreement":null},{"id":"W1986692294","doi":"10.1016/s0012-365x(02)00570-8","title":"Construction of new extremal self-dual codes","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Dual (grammatical number); Combinatorics; Discrete mathematics","score_opus":0.017297621776683324,"score_gpt":0.2378547598035444,"score_spread":0.22055713802686108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986692294","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.092012525,0.00005906415,0.88908845,0.000071707706,0.00018713712,0.000098521785,0.0000022823845,0.00017629494,0.018304],"genre_scores_gemma":[0.3508055,0.000010492868,0.6490362,0.000023337629,0.000019689911,0.000002175106,6.730711e-7,0.00000687127,0.00009503335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923056,0.000047706926,0.0002344667,0.00015221415,0.00018529457,0.00014977794],"domain_scores_gemma":[0.99926573,0.00009873345,0.00013018114,0.00040060346,0.000037266076,0.0000674802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027345205,0.000105077146,0.00016854056,0.000074461605,0.0000588493,0.00005133196,0.00025847487,0.00004142327,0.000043656346],"category_scores_gemma":[0.000056620545,0.00009137171,0.00009251045,0.0002975493,0.000060920458,0.00016789362,0.0000522281,0.000061849154,0.000013463378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012323101,0.00003971451,0.00015923326,0.000041601164,0.000022531618,0.0000015007129,0.0021599762,0.000004931507,0.0003493451,0.99560785,0.00014619647,0.0014658923],"study_design_scores_gemma":[0.00033799853,0.00009371061,0.00007726082,0.00006453851,0.0000353294,0.000104126215,0.0006768099,0.005057725,0.015619941,0.9753807,0.002325447,0.00022639736],"about_ca_topic_score_codex":0.0000016386601,"about_ca_topic_score_gemma":9.0245794e-7,"teacher_disagreement_score":0.25879297,"about_ca_system_score_codex":0.000007150095,"about_ca_system_score_gemma":0.000049441234,"threshold_uncertainty_score":0.37260303},"labels":[],"label_agreement":null},{"id":"W1987220346","doi":"10.1016/j.disc.2007.05.009","title":"Cyclic hamiltonian cycle systems of the complete graph minus a 1-factor","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Centre International de Recherche sur le Cancer","keywords":"Mathematics; Hamiltonian path; Combinatorics; Graph; Discrete mathematics","score_opus":0.012819830166623363,"score_gpt":0.21155990504484762,"score_spread":0.19874007487822426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987220346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9719816,0.0004481836,0.012633603,0.000008403239,0.0008048734,0.00043429204,0.000095327225,0.000179255,0.013414491],"genre_scores_gemma":[0.99935734,0.000005177282,0.0003688552,0.000008043899,0.00005272587,0.000011911567,0.0000031069471,0.00004572335,0.00014708779],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870896,0.000036880137,0.0005422492,0.000117158015,0.00027717574,0.000317563],"domain_scores_gemma":[0.99901557,0.00014258998,0.00013062559,0.00059965503,0.000032314267,0.00007923497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036572642,0.00020210142,0.00033523125,0.00008739113,0.00007073757,0.000032083826,0.00037751655,0.0000910603,0.000016833232],"category_scores_gemma":[0.000026540225,0.00013956666,0.00019601219,0.00031536387,0.00010191411,0.000056172365,0.000039287817,0.0001411864,0.000029232091],"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.000049830483,0.0003816077,0.008651711,0.013006152,0.0014159159,0.000058306563,0.042735144,0.020162785,0.2746918,0.6356101,0.0018163288,0.0014203156],"study_design_scores_gemma":[0.00846651,0.0006902269,0.14112887,0.012215484,0.0014464604,0.001314623,0.060224272,0.34218282,0.19540888,0.1883636,0.039701533,0.008856724],"about_ca_topic_score_codex":0.000019624415,"about_ca_topic_score_gemma":0.000029317418,"teacher_disagreement_score":0.44724652,"about_ca_system_score_codex":0.000025110414,"about_ca_system_score_gemma":0.0000055410524,"threshold_uncertainty_score":0.5691363},"labels":[],"label_agreement":null},{"id":"W1987260656","doi":"10.1016/s0012-365x(03)00285-1","title":"Existence of incomplete resolvable minimum coverings of pairs by triples","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Order (exchange); Discrete mathematics","score_opus":0.011479590207855652,"score_gpt":0.2011635292465455,"score_spread":0.18968393903868985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987260656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93047255,0.0007611948,0.014229045,0.0000040414952,0.00014781978,0.00023414525,0.000100276375,0.00009527967,0.053955633],"genre_scores_gemma":[0.99418396,0.000039766237,0.005426914,0.0000027198937,0.0000054556394,0.000011350579,0.000005309058,0.000028766119,0.0002957714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904555,0.00003392307,0.00047583604,0.00009425364,0.00017482106,0.00017560026],"domain_scores_gemma":[0.9993486,0.00012646393,0.00012508553,0.00032240516,0.000032034288,0.000045431814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031932045,0.00014079014,0.00035608723,0.000052130374,0.00002363077,0.000009112974,0.00017317866,0.000058775327,0.000050997507],"category_scores_gemma":[0.00007300745,0.00012793108,0.000097039636,0.00017501872,0.00008131444,0.00006374395,0.000015624937,0.000062828694,0.0000075388816],"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.00003158578,0.00021557302,0.0010724758,0.009811222,0.0004190016,0.000005426681,0.011714648,0.0020290292,0.25853732,0.7103853,0.0055848486,0.00019355494],"study_design_scores_gemma":[0.0019112551,0.00036313172,0.00010929873,0.0018747255,0.00021318806,0.000044424796,0.015238516,0.037484664,0.7896156,0.12873647,0.023149153,0.0012596077],"about_ca_topic_score_codex":0.0000061499873,"about_ca_topic_score_gemma":0.000001634769,"teacher_disagreement_score":0.5816488,"about_ca_system_score_codex":0.000010963399,"about_ca_system_score_gemma":0.000007095453,"threshold_uncertainty_score":0.5216878},"labels":[],"label_agreement":null},{"id":"W1988719430","doi":"10.1016/s0012-365x(01)00133-9","title":"On the recognition of de Bruijn graphs and their induced subgraphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"De Bruijn sequence; Combinatorics; De Bruijn graph; Mathematics; Cograph; Discrete mathematics; Induced subgraph; Graph; Pathwidth; Line graph","score_opus":0.0384573941709699,"score_gpt":0.23659130619966753,"score_spread":0.19813391202869762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988719430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9957103,0.00011833283,0.00047030582,0.00012397634,0.00001581877,0.00009749231,0.000009753086,0.000008134388,0.0034458947],"genre_scores_gemma":[0.9991312,0.00007928622,0.0005229123,0.0001955258,0.00001613648,0.0000049776545,0.0000104763285,0.000006795758,0.000032657717],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999553,0.00004204483,0.00012910375,0.000114872906,0.0000445459,0.00011639205],"domain_scores_gemma":[0.9996397,0.0000793934,0.00007330565,0.00015585941,0.00002421638,0.000027541255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017851221,0.00009008844,0.0000942823,0.000016874523,0.000054122174,0.000012098222,0.00009608013,0.00007710045,0.000022853566],"category_scores_gemma":[0.00015038635,0.00004758096,0.000061889456,0.000059239414,0.00006609128,0.0000010479499,0.00004723807,0.000061888575,0.0000028641823],"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.000021895563,0.00016174265,0.0005539178,0.00007837641,0.00008132457,0.0000010099445,0.00090102624,0.0000021301605,0.9702586,0.013784547,0.0006833665,0.01347207],"study_design_scores_gemma":[0.00049553404,0.0011742729,0.0012357241,0.00015642948,0.000036217636,0.000030994728,0.0013557379,0.003578015,0.7885759,0.20261559,0.00035381276,0.00039176326],"about_ca_topic_score_codex":0.0000016462236,"about_ca_topic_score_gemma":0.0000013256572,"teacher_disagreement_score":0.18883105,"about_ca_system_score_codex":0.0000016180576,"about_ca_system_score_gemma":0.0000024844912,"threshold_uncertainty_score":0.19402952},"labels":[],"label_agreement":null},{"id":"W1989439931","doi":"10.1016/j.disc.2006.03.055","title":"On some probabilistic approximations for AES-like s-boxes","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Queen's University; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Affine transformation; Block cipher; S-box; Algebraic number; Discrete mathematics; Simple (philosophy); Block size; Key schedule; Transformation (genetics); Cryptanalysis; Combinatorics; Cryptography; Differential cryptanalysis; Algorithm; Pure mathematics; Computer science; Key (lock)","score_opus":0.01881262860321052,"score_gpt":0.2796773462501362,"score_spread":0.26086471764692565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989439931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027646087,0.00001763972,0.9685295,0.00065242714,0.00013715445,0.0007388646,0.00006412837,0.00015470413,0.0020594704],"genre_scores_gemma":[0.5908604,0.0000023171438,0.40816277,0.00019228137,0.000060029113,0.00034511447,0.00007660031,0.000018922767,0.0002815026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989832,0.000016703989,0.00031746685,0.00023562675,0.00020682378,0.00024017159],"domain_scores_gemma":[0.9990233,0.00027751434,0.00011311912,0.00048055104,0.00006564425,0.000039850358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022027819,0.00013449318,0.00015097875,0.00010929386,0.00023045333,0.00019679773,0.00037826883,0.000034289806,0.000018702041],"category_scores_gemma":[0.00005509709,0.00011221127,0.00011243165,0.00024683494,0.00004592814,0.00023590874,0.00006207097,0.000054770142,0.000016443506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.557008e-7,0.00015813984,0.000005579391,0.000095038835,0.000007121538,4.1915615e-7,0.000492005,0.00015086583,0.00004601493,0.9966815,0.0019968888,0.00036547316],"study_design_scores_gemma":[0.00023850349,0.00007167774,0.00004801463,0.000017306209,0.000010243604,0.0000025229344,0.00007668963,0.16783561,0.00009554223,0.83049476,0.0009778575,0.00013126378],"about_ca_topic_score_codex":0.000009216784,"about_ca_topic_score_gemma":0.000017531755,"teacher_disagreement_score":0.56321436,"about_ca_system_score_codex":0.000023325458,"about_ca_system_score_gemma":0.000026570058,"threshold_uncertainty_score":0.4575843},"labels":[],"label_agreement":null},{"id":"W1989905036","doi":"10.1016/j.disc.2005.09.030","title":"List homomorphisms of graphs with bounded degrees","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Homomorphism; Mathematics; Bounded function; Combinatorics; Discrete mathematics; Contrast (vision); Upper and lower bounds; Degree (music); Graph homomorphism; Computational complexity theory; Graph; Computer science; Algorithm; Line graph; Artificial intelligence","score_opus":0.01541211956355663,"score_gpt":0.25741590942436116,"score_spread":0.24200378986080454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989905036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12487552,0.00012872872,0.8564857,0.00013146353,0.000037722974,0.0002792697,0.000011864082,0.00014608823,0.017903639],"genre_scores_gemma":[0.68536735,0.0000043659775,0.31409577,0.000010786469,0.000010791198,0.000016213862,0.000003694738,0.000017747818,0.00047326865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985649,0.00004082023,0.00030806067,0.00024884762,0.0005219803,0.00031536372],"domain_scores_gemma":[0.99859595,0.00017761337,0.00018118709,0.00084822526,0.00013285465,0.00006415014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002860231,0.00016424351,0.0002604861,0.00016000301,0.000104226754,0.00010140082,0.0009161069,0.000041302585,0.0000166096],"category_scores_gemma":[0.000033615594,0.000118597614,0.000081167746,0.0006696814,0.0003501937,0.0002939794,0.00017822668,0.00011577872,0.0000137743655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068279965,0.00009114171,0.00030281776,0.00007836854,0.000016329439,0.000015512162,0.00026407457,0.00008270165,0.0010768418,0.9977411,0.000073484414,0.0002507684],"study_design_scores_gemma":[0.00035666113,0.00015292855,0.00040726806,0.00008372578,0.000010937685,0.000038307404,0.0001172147,0.0109516755,0.008189225,0.979313,0.0001637524,0.0002152691],"about_ca_topic_score_codex":0.000021848318,"about_ca_topic_score_gemma":0.000023663064,"teacher_disagreement_score":0.56049186,"about_ca_system_score_codex":0.00001698353,"about_ca_system_score_gemma":0.000040551156,"threshold_uncertainty_score":0.48362705},"labels":[],"label_agreement":null},{"id":"W1990200258","doi":"10.1016/j.disc.2008.12.016","title":"On the Hamilton connectivity of generalized Petersen graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.07031854197623454,"score_gpt":0.3387111453334389,"score_spread":0.26839260335720433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990200258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9632187,0.000020094716,0.0043410393,0.00063416647,0.000053925778,0.0006792016,0.00003289266,0.000100607846,0.030919371],"genre_scores_gemma":[0.98929566,0.000013211232,0.009781939,0.00020803134,0.000029055649,0.000025792222,0.000005395327,0.000042065854,0.00059885764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784833,0.00029453984,0.00051823776,0.0002518337,0.00068779587,0.00039927568],"domain_scores_gemma":[0.99503165,0.0033476308,0.0002860145,0.0011306884,0.000118628894,0.00008537609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015821472,0.0002700352,0.00049897475,0.00014452302,0.00014481603,0.000049475282,0.00057379744,0.000102890874,0.0002702926],"category_scores_gemma":[0.0018390949,0.00016700987,0.00026458874,0.00035715103,0.00021366386,0.000074973905,0.00006106568,0.0003032449,0.00005866081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005528375,0.0002783749,0.000012220038,0.00012340664,0.00005533205,0.0000059226923,0.002888311,0.000005328178,0.004376855,0.9906499,0.0013716671,0.00017743358],"study_design_scores_gemma":[0.0004552439,0.00028961463,0.00013082697,0.00013314048,0.00004415102,0.000009367836,0.0005724114,0.002347375,0.008905051,0.98684675,0.00006838827,0.00019770782],"about_ca_topic_score_codex":0.0000040153736,"about_ca_topic_score_gemma":0.0000045492125,"teacher_disagreement_score":0.030320514,"about_ca_system_score_codex":0.000037581056,"about_ca_system_score_gemma":0.00002611,"threshold_uncertainty_score":0.6810465},"labels":[],"label_agreement":null},{"id":"W1990363179","doi":"10.1016/s0012-365x(03)00294-2","title":"On the extension of a partial metric to a tree metric","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Extension (predicate logic); Metric (unit); Tree (set theory); Discrete mathematics; Polynomial; Simple (philosophy); Focus (optics); Set (abstract data type); Metric space; Computer science","score_opus":0.030633271315895584,"score_gpt":0.2725350720012243,"score_spread":0.2419018006853287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990363179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020241205,0.00007833478,0.9739573,0.000285452,0.00014418032,0.00025547307,0.0000058179644,0.000041134947,0.004991107],"genre_scores_gemma":[0.785416,0.000008028117,0.21410763,0.00025157022,0.000018779074,0.000021090469,0.0000013827046,0.000012153269,0.00016335088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873936,0.00007847103,0.00027714562,0.00023726783,0.00047098452,0.00019675732],"domain_scores_gemma":[0.9981395,0.00056543964,0.00012911731,0.0010165729,0.0000664603,0.00008288803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005721918,0.00012654458,0.00020278171,0.00022762209,0.000094396324,0.000070084505,0.00068180007,0.000035120043,0.00003349819],"category_scores_gemma":[0.0010447433,0.00006987217,0.00007908181,0.0015255157,0.000022115213,0.0001157765,0.00021849596,0.00008485951,0.000079261124],"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.000004035054,0.00016870815,0.000007921985,0.000026426123,0.000016348167,0.000005392486,0.0010030845,0.00018439854,0.0005119967,0.98519355,0.003162917,0.009715225],"study_design_scores_gemma":[0.0010450332,0.0011162837,0.0008121682,0.00044767282,0.00008654243,0.000046989564,0.00077119627,0.6797803,0.06644808,0.23642072,0.012152058,0.00087296334],"about_ca_topic_score_codex":0.000005715267,"about_ca_topic_score_gemma":6.1317536e-7,"teacher_disagreement_score":0.7651748,"about_ca_system_score_codex":0.000015820922,"about_ca_system_score_gemma":0.000024073039,"threshold_uncertainty_score":0.28493044},"labels":[],"label_agreement":null},{"id":"W1990421674","doi":"10.1016/j.disc.2013.03.024","title":"Non-uniqueness of minimal superpermutations","year":2013,"lang":"fr","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Guelph","keywords":"Uniqueness; Mathematics; Substring; Combinatorics; String (physics); Discrete mathematics; Computer science; Data structure; Mathematical analysis","score_opus":0.022879062862262132,"score_gpt":0.25911542624361955,"score_spread":0.23623636338135742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990421674","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.42485365,0.0005250628,0.5494704,0.0031229157,0.0006942532,0.000515372,0.000035232402,0.00007780318,0.020705296],"genre_scores_gemma":[0.85973424,0.000060056038,0.13710757,0.00013503642,0.00008075132,0.000059901522,0.0000066224443,0.000027642063,0.0027881535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845016,0.00007577019,0.00054370204,0.00027022255,0.00028573888,0.00037441737],"domain_scores_gemma":[0.99822277,0.00041501937,0.0002039299,0.00074689416,0.00026822463,0.0001431524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034056316,0.00023409176,0.00034980068,0.00013902762,0.00013276553,0.00021024702,0.00079896906,0.00012649588,0.00074333436],"category_scores_gemma":[0.00010491203,0.00022327091,0.00024281176,0.0006092167,0.00038497918,0.0007111732,0.0002496692,0.00015574462,0.000311787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020824189,0.00027434266,0.0003063101,0.00077435013,0.00005346695,0.0000057350394,0.01772088,0.000048819875,0.0020360067,0.9717301,0.0013620945,0.005685801],"study_design_scores_gemma":[0.00046194217,0.00034709525,0.0030210325,0.0009686505,0.00014857856,0.00006910065,0.0033282111,0.176237,0.010041326,0.8028428,0.0018568377,0.0006774251],"about_ca_topic_score_codex":0.00009711031,"about_ca_topic_score_gemma":0.000006137169,"teacher_disagreement_score":0.4348806,"about_ca_system_score_codex":0.00001620122,"about_ca_system_score_gemma":0.00008444841,"threshold_uncertainty_score":0.91047233},"labels":[],"label_agreement":null},{"id":"W1991586960","doi":"10.1016/j.disc.2010.04.014","title":"A conjecture on critical graphs and connections to the persistence of associated primes","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Monomial ideal; Combinatorics; Conjecture; Discrete mathematics; Simple graph; Chromatic scale; Monomial; Graph; Polynomial; Polynomial ring","score_opus":0.04009475174220571,"score_gpt":0.3327001114994608,"score_spread":0.2926053597572551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991586960","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97912633,0.000026013824,0.0071059423,0.0075822696,0.000081657636,0.0006017504,0.00010347224,0.00007695793,0.005295594],"genre_scores_gemma":[0.9835454,0.00000286663,0.016036648,0.00014941877,0.000013556264,0.000060178056,0.0000029933337,0.000018529612,0.00017038322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992077,0.00004149955,0.00025399355,0.00015035296,0.00019283518,0.00015361614],"domain_scores_gemma":[0.99666965,0.0025735286,0.00009922331,0.00044830996,0.00013142545,0.00007784545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002990606,0.00013157679,0.00022210501,0.000057807316,0.00022839017,0.00003916325,0.00021208641,0.000068938636,0.000081554615],"category_scores_gemma":[0.0033912645,0.00008429103,0.00007979539,0.00023284066,0.00023514111,0.000034027944,0.00007453781,0.0002607272,0.000012524026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027922422,0.00012859194,0.000069888556,0.000050854716,0.00003820491,2.8208146e-7,0.0047283857,6.9342616e-7,0.001841459,0.9919103,0.0011272664,0.00010132785],"study_design_scores_gemma":[0.00017345724,0.00015577179,0.00092524866,0.000087063214,0.00012902661,0.000013848553,0.002896353,0.00065732625,0.0030223636,0.9911821,0.0005944612,0.00016301217],"about_ca_topic_score_codex":0.0000047690683,"about_ca_topic_score_gemma":0.0000876835,"teacher_disagreement_score":0.008930706,"about_ca_system_score_codex":0.000008026889,"about_ca_system_score_gemma":0.000021742499,"threshold_uncertainty_score":0.40599054},"labels":[],"label_agreement":null},{"id":"W1992055650","doi":"10.1016/j.disc.2013.07.011","title":"Corrigendum to “Velocity polytopes of periodic graphs and a no-go theorem for digital physics” [Discrete Mathematics 313 (2013) 1289–1301]","year":2013,"lang":"en","type":"erratum","venue":"Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Polytope; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.02133920632146357,"score_gpt":0.26101839544759203,"score_spread":0.23967918912612846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992055650","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.00010808536,0.0004556761,0.9188394,0.00033589161,0.002986564,0.002457825,0.0009145276,0.0008445483,0.07305751],"genre_scores_gemma":[0.001596157,0.00016616199,0.8498577,0.00026192033,0.00031675055,0.00060699205,0.00037458193,0.00033216347,0.14648756],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995332,0.000037113135,0.0014171903,0.0011684241,0.0010643012,0.0009809629],"domain_scores_gemma":[0.99485296,0.0002716107,0.001380113,0.0021804667,0.00090795284,0.0004068898],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005019386,0.001169487,0.0017900409,0.0003775867,0.00025256345,0.0029210914,0.003125785,0.0005294843,0.00002054994],"category_scores_gemma":[0.00078411103,0.0009777225,0.00054650614,0.00064326543,0.00063468184,0.0019733482,0.0018789285,0.0006126135,0.00022301471],"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.000009931739,0.00028733257,0.0000030705714,0.005455931,0.00019396994,0.0000054234256,0.0044879992,8.9255764e-7,0.000098551885,0.13349423,0.846908,0.009054678],"study_design_scores_gemma":[0.00046021826,0.00070657145,0.000006163346,0.003969709,0.00021976397,0.00006340106,0.00045916467,0.088235356,0.0014840781,0.8260158,0.07616512,0.0022147044],"about_ca_topic_score_codex":0.000011942918,"about_ca_topic_score_gemma":0.000003308608,"teacher_disagreement_score":0.7707429,"about_ca_system_score_codex":0.0000874746,"about_ca_system_score_gemma":0.0003215867,"threshold_uncertainty_score":0.99926734},"labels":[],"label_agreement":null},{"id":"W1992400796","doi":"10.1016/s0012-365x(01)00054-1","title":"On the divisibility of graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Agence Nationale pour la Gestion des Déchets Radioactifs","keywords":"Mathematics; Combinatorics; Divisibility rule; Perfect graph; Perfect graph theorem; Conjecture; Trivially perfect graph; Induced subgraph; Split graph; Discrete mathematics; Graph; Clique number; Vertex (graph theory); Partition (number theory); Cograph; Chromatic scale; Line graph; Pathwidth","score_opus":0.04652455214468322,"score_gpt":0.2935728521492843,"score_spread":0.2470483000046011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992400796","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.24582748,0.00011607469,0.70680183,0.0017279723,0.00009659991,0.0005534178,0.000011336916,0.00014446353,0.0447208],"genre_scores_gemma":[0.98147255,0.0000096657695,0.018115107,0.00007871015,0.0000044351364,0.000013698766,2.3763174e-7,0.000007975073,0.00029763777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988506,0.00008898918,0.00023130524,0.00019180703,0.00042819305,0.0002090962],"domain_scores_gemma":[0.99754655,0.000968164,0.00010002992,0.0012801359,0.000057419948,0.000047718604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060050044,0.00010121947,0.00014657821,0.00006489442,0.000095118216,0.000042329317,0.0011770675,0.000026152164,0.00012803137],"category_scores_gemma":[0.00043487965,0.00005796968,0.00010104845,0.00045965222,0.00018732873,0.00012467641,0.00023158493,0.00014022163,0.00009090501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.375262e-7,0.000078143756,0.000036701986,0.000026901758,0.000008830348,0.000001173215,0.0011491898,0.000017434784,0.00014638671,0.9970771,0.00025710586,0.0012000594],"study_design_scores_gemma":[0.00007162388,0.000064408676,0.00009205741,0.000026571626,0.00000212807,0.0000018451423,0.00007768338,0.054689348,0.002234624,0.9426198,0.000047977966,0.00007194087],"about_ca_topic_score_codex":7.0337575e-7,"about_ca_topic_score_gemma":5.061713e-7,"teacher_disagreement_score":0.73564506,"about_ca_system_score_codex":0.000009781768,"about_ca_system_score_gemma":0.0000043703603,"threshold_uncertainty_score":0.2363935},"labels":[],"label_agreement":null},{"id":"W1992795105","doi":"10.1016/j.disc.2004.10.016","title":"The set of values of b for which there exist block designs with b blocks","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of Alberta","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.020589966131387954,"score_gpt":0.24154454317375756,"score_spread":0.22095457704236962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992795105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9462119,0.000893869,0.031137453,0.00009197681,0.00009513372,0.0008579616,0.00011279636,0.00012992513,0.020468984],"genre_scores_gemma":[0.99422693,0.000018107012,0.005331559,0.0000019654815,0.000046894478,0.000039466748,0.0000032736314,0.000033379205,0.00029845105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992833,0.000019897792,0.00031950892,0.00007145818,0.00014332586,0.00016246698],"domain_scores_gemma":[0.99916667,0.00028326112,0.00010497574,0.0003349159,0.000081408274,0.000028796327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003484966,0.0001299028,0.0002331615,0.000025634707,0.00006424825,0.000015633523,0.00020873282,0.00004877617,0.00000721744],"category_scores_gemma":[0.000031059335,0.00007617339,0.00007095677,0.00012204804,0.000070142545,0.0000360359,0.000012074015,0.000056041335,0.0000022246013],"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.00029745305,0.000307252,0.0008140542,0.010207141,0.002489777,0.000002849922,0.062651865,0.11812621,0.03915462,0.755812,0.0061972206,0.0039395806],"study_design_scores_gemma":[0.0030375707,0.001079676,0.00019585133,0.0024893167,0.0008145124,0.00008238499,0.0355443,0.34831107,0.40579408,0.18999769,0.011177712,0.0014758259],"about_ca_topic_score_codex":0.000001204179,"about_ca_topic_score_gemma":0.000021256199,"teacher_disagreement_score":0.5658143,"about_ca_system_score_codex":0.000008066217,"about_ca_system_score_gemma":0.00000967444,"threshold_uncertainty_score":0.3106261},"labels":[],"label_agreement":null},{"id":"W1993089254","doi":"10.1016/s0012-365x(03)00138-9","title":"The Petersen graph is not 3-edge-colorable—a new proof","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences; Simon Fraser University","funders":"","keywords":"Petersen graph; Mathematics; Combinatorics; Graph; Combinatorial proof; Discrete mathematics; Edge coloring; Enhanced Data Rates for GSM Evolution; Line graph; Voltage graph; Computer science; Graph power","score_opus":0.03119521382550538,"score_gpt":0.2955282700129855,"score_spread":0.2643330561874801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993089254","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.0035578469,0.00028647482,0.9642904,0.0025060475,0.0002749496,0.000730728,0.0000053827457,0.00017993638,0.028168278],"genre_scores_gemma":[0.3207967,0.00021180014,0.6335429,0.0015972189,0.00013998906,0.00021115593,0.000003915998,0.00014885867,0.04334747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978117,0.00014154997,0.00037013183,0.00039214228,0.00064287736,0.0006416059],"domain_scores_gemma":[0.9974521,0.0005797654,0.00015938582,0.0014831716,0.000106951054,0.00021862432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009654935,0.00023039259,0.00023140053,0.00009979122,0.000461451,0.00040882308,0.0016451249,0.00006560493,0.000034819623],"category_scores_gemma":[0.00047073653,0.00014963634,0.00015710553,0.0007435273,0.00019461999,0.00038659843,0.0002706701,0.0002706831,0.00019795945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057501984,0.000036263413,0.000019363006,0.00003679595,0.00003490934,0.00000885095,0.0025685013,0.000021388107,0.00041480042,0.9907552,0.0029207584,0.003177434],"study_design_scores_gemma":[0.00034991163,0.00009372869,0.000022220589,0.00003931213,0.00001105764,0.000034804183,0.0004002775,0.007140072,0.02182146,0.94504654,0.024742573,0.00029805765],"about_ca_topic_score_codex":0.0000025207046,"about_ca_topic_score_gemma":0.0000052240325,"teacher_disagreement_score":0.33074746,"about_ca_system_score_codex":0.000035877063,"about_ca_system_score_gemma":0.00013689905,"threshold_uncertainty_score":0.6101993},"labels":[],"label_agreement":null},{"id":"W1993218841","doi":"10.1016/s0012-365x(00)00419-2","title":"Directed packing and covering designs with block size four","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Combinatorics; Block size; Block (permutation group theory); Packing problems; Discrete mathematics; Computer science; Key (lock)","score_opus":0.01629517972808663,"score_gpt":0.200881071769452,"score_spread":0.18458589204136536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993218841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9678482,0.00015666256,0.017581202,0.000011396885,0.00006688572,0.00018645638,0.0000046592017,0.0005375402,0.013607001],"genre_scores_gemma":[0.99491453,0.000038081576,0.0047211815,0.000008484764,0.000036021123,0.000016025613,0.0000011389361,0.00004803231,0.00021649903],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993488,0.000017814553,0.00017550883,0.000112444046,0.00012325731,0.00022216824],"domain_scores_gemma":[0.9995128,0.00016293344,0.00003588074,0.00019868732,0.000017874732,0.00007180893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013302821,0.00016807394,0.00020980094,0.00003542701,0.000070727656,0.000065531596,0.00007954132,0.000049386395,0.000022427304],"category_scores_gemma":[0.000034774148,0.00013353581,0.000030917243,0.00016008083,0.00003220762,0.000088568406,0.000017330829,0.000089606045,0.000010791392],"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.0006016096,0.00075798633,0.088937424,0.022462185,0.0060669812,0.0029390515,0.13485987,0.117803335,0.33468646,0.2699874,0.0038430402,0.017054647],"study_design_scores_gemma":[0.0063037025,0.00072778837,0.01414614,0.0059522917,0.0009280381,0.0049187434,0.015873896,0.823311,0.031092713,0.07986085,0.011166371,0.005718472],"about_ca_topic_score_codex":0.0000023105633,"about_ca_topic_score_gemma":0.000007572345,"teacher_disagreement_score":0.70550764,"about_ca_system_score_codex":0.000014155072,"about_ca_system_score_gemma":0.0000035828211,"threshold_uncertainty_score":0.5445432},"labels":[],"label_agreement":null},{"id":"W1993237896","doi":"10.1016/j.disc.2008.05.038","title":"The circular chromatic number of hypergraphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chromatic scale; Mathematics; Generalization; Combinatorics; Mathematical proof; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.023709070813125177,"score_gpt":0.29308402407486295,"score_spread":0.26937495326173777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993237896","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.3427465,0.00032358765,0.64125496,0.0003211753,0.00011901429,0.00035959782,0.000003484465,0.0001409408,0.01473076],"genre_scores_gemma":[0.8963302,0.00011968131,0.10299942,0.000026808193,0.000015372014,0.000027042584,8.3496474e-7,0.00001874399,0.00046189956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985381,0.00007501089,0.00034918505,0.00018287853,0.0005445914,0.00031023112],"domain_scores_gemma":[0.9980343,0.0004938092,0.00015038479,0.0011452577,0.000102403326,0.000073854884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045409086,0.00012884094,0.00020878726,0.000049027265,0.0003163025,0.000041733823,0.0013265301,0.00003696626,0.000014805261],"category_scores_gemma":[0.00021022986,0.00008147699,0.00013635031,0.00054270076,0.00039301848,0.00020617529,0.00026199906,0.0001227178,0.000105445855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020431664,0.000061118335,0.0005181678,0.00010856265,0.000046117475,0.000020621157,0.0024138978,0.00002916744,0.0013280482,0.9945631,0.00015552358,0.0007536205],"study_design_scores_gemma":[0.0003006328,0.000046953908,0.00061497436,0.00007141095,0.0000108861395,0.00035597925,0.0003559584,0.048033636,0.005539087,0.9435218,0.00089448213,0.00025422254],"about_ca_topic_score_codex":0.000001854237,"about_ca_topic_score_gemma":4.83466e-7,"teacher_disagreement_score":0.55358374,"about_ca_system_score_codex":0.000014560665,"about_ca_system_score_gemma":0.000044534678,"threshold_uncertainty_score":0.33225352},"labels":[],"label_agreement":null},{"id":"W1993350312","doi":"10.1016/j.disc.2012.12.003","title":"Efficient domination in circulant graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circulant matrix; Mathematics; Circulant graph; Combinatorics; Wreath product; Dominating set; Discrete mathematics; Graph; Line graph; Product (mathematics); Voltage graph; Vertex (graph theory)","score_opus":0.016434020257279764,"score_gpt":0.27905689023469377,"score_spread":0.262622869977414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993350312","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.35631633,0.00004117231,0.63842654,0.00032528283,0.00006398188,0.00047412518,0.000001080211,0.000087165245,0.004264307],"genre_scores_gemma":[0.9256169,0.0000036964113,0.074137196,0.000035991103,0.0000060660127,0.000085647975,0.0000014683679,0.0000104446135,0.00010256751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874914,0.00005839151,0.00026809945,0.00024035037,0.00036623533,0.0003178112],"domain_scores_gemma":[0.99903136,0.00017519441,0.0000743958,0.00056941423,0.00007331163,0.00007631179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043923798,0.00011469527,0.00015349619,0.00025099728,0.000055862933,0.00012522594,0.00066929014,0.000039049122,0.000036558613],"category_scores_gemma":[0.00012378207,0.00009290093,0.000056476256,0.00063420535,0.00006323509,0.0001745909,0.0001998923,0.00012733613,0.00027063838],"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":[8.792327e-7,0.00010311557,0.00016699219,0.00005400663,0.000005422785,0.000008499522,0.0022616251,0.0012554235,0.0022822565,0.9895213,0.00004298583,0.004297463],"study_design_scores_gemma":[0.00019485658,0.000017815133,0.0012396174,0.000036230445,0.0000010756029,0.000007737173,0.00019989129,0.504719,0.0007286901,0.49272102,0.000015229435,0.00011884743],"about_ca_topic_score_codex":0.000009397751,"about_ca_topic_score_gemma":0.0000023867392,"teacher_disagreement_score":0.5693006,"about_ca_system_score_codex":0.00004192233,"about_ca_system_score_gemma":0.000017506032,"threshold_uncertainty_score":0.378839},"labels":[],"label_agreement":null},{"id":"W1993587964","doi":"10.1016/j.disc.2009.12.007","title":"Domination of generalized Cartesian products","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Mathematics; Cartesian product; Combinatorics; Discrete mathematics; Cartesian coordinate system; Algebra over a field; Pure mathematics; Geometry","score_opus":0.017179675835678223,"score_gpt":0.29458408373626477,"score_spread":0.27740440790058657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993587964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3057008,0.000026977566,0.68740994,0.0007649815,0.00024081055,0.00039001225,0.00000485111,0.000108178516,0.0053534233],"genre_scores_gemma":[0.582994,0.0000023534606,0.4166248,0.000011191897,0.000028595132,0.000013962063,0.0000022482727,0.000009418358,0.00031339884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899226,0.00003733839,0.00024209022,0.00020385571,0.00032946919,0.00019498849],"domain_scores_gemma":[0.99868196,0.00009924981,0.00013224434,0.0008409119,0.00018891096,0.000056710054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005078968,0.00009670664,0.00016567319,0.000110899484,0.000054928,0.000045952234,0.00072098087,0.000042519307,0.000017037368],"category_scores_gemma":[0.00037025506,0.00007858432,0.00004703771,0.0004126874,0.0001081204,0.0002719008,0.00015760906,0.00014583363,0.000020856087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019185118,0.000040278497,0.00003262263,0.00007442318,0.0000067768437,0.0000016488259,0.0010334199,0.0000071735417,0.12724125,0.8689965,0.00005095003,0.0025130336],"study_design_scores_gemma":[0.0004838276,0.0000681072,0.0002573874,0.000029464645,0.000009316976,0.0000236838,0.00010701515,0.052032225,0.30876443,0.6371896,0.0007927511,0.00024217648],"about_ca_topic_score_codex":0.000001684992,"about_ca_topic_score_gemma":0.0000039003253,"teacher_disagreement_score":0.2772932,"about_ca_system_score_codex":0.000007013017,"about_ca_system_score_gemma":0.00003919524,"threshold_uncertainty_score":0.32045758},"labels":[],"label_agreement":null},{"id":"W1993648632","doi":"10.1016/j.disc.2007.04.017","title":"The existence of (p,q)-extended Rosa sequences","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Sequence (biology); Integer (computer science); Integer sequence; Discrete mathematics; Generating function; Computer science; Genetics","score_opus":0.011905023200997749,"score_gpt":0.23612706196625494,"score_spread":0.22422203876525718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993648632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82384884,0.0015058131,0.058942486,0.000037279548,0.00071315386,0.00036927746,0.000023064822,0.0003260983,0.11423396],"genre_scores_gemma":[0.9977894,0.00003281073,0.0018911083,0.000003985873,0.000029682515,0.0000058071955,0.0000013939548,0.00001512933,0.00023071599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992188,0.000014011424,0.00032905902,0.00006428922,0.00017006422,0.0002037303],"domain_scores_gemma":[0.99933094,0.00024495335,0.00006539179,0.00029144302,0.000027613229,0.00003964262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007485245,0.000100933954,0.0001437736,0.000027176146,0.00007994914,0.000023180653,0.00024265634,0.00004246451,0.000009272748],"category_scores_gemma":[0.00004583283,0.000063935746,0.000070112765,0.00014550099,0.00012510929,0.000051505594,0.000016815671,0.00007557318,0.000017085695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009162037,0.000023528646,0.00010276368,0.00057198136,0.00009090757,0.000009781678,0.005020242,0.00032319498,0.011946802,0.9781643,0.00021810467,0.0035192126],"study_design_scores_gemma":[0.00055519445,0.00016417433,0.0016149457,0.0007425179,0.00011330998,0.0001325323,0.032395564,0.0368088,0.19234595,0.72480685,0.009369593,0.0009505848],"about_ca_topic_score_codex":0.0000017660552,"about_ca_topic_score_gemma":0.0000115822895,"teacher_disagreement_score":0.25335747,"about_ca_system_score_codex":0.000010626796,"about_ca_system_score_gemma":0.000004742965,"threshold_uncertainty_score":0.26072243},"labels":[],"label_agreement":null},{"id":"W1994013009","doi":"10.1016/j.disc.2010.05.022","title":"On a construction of graphs with high chromatic capacity and large girth","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Integer (computer science); Graph; Discrete mathematics; Girth (graph theory); Edge coloring; Enhanced Data Rates for GSM Evolution; Graph power; Computer science; Line graph","score_opus":0.006859558722335785,"score_gpt":0.1984460313042129,"score_spread":0.1915864725818771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994013009","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9372579,0.0000072769126,0.061814576,0.00010177369,0.00010083718,0.00011954364,0.0000073101687,0.00006994333,0.00052087166],"genre_scores_gemma":[0.72895575,0.0000019463407,0.27099127,0.000029801186,0.0000013430762,0.000004173855,0.0000010233899,0.0000055543096,0.000009162481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992187,0.000017113769,0.00020467174,0.00018166854,0.00022799252,0.00014984058],"domain_scores_gemma":[0.9991724,0.00009332208,0.00016009391,0.00044401528,0.00006383603,0.000066340115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023005607,0.000115685754,0.00018999333,0.0000944205,0.00008336746,0.000047581238,0.00017884542,0.0000495359,0.000009054126],"category_scores_gemma":[0.000047026373,0.00007852381,0.000029318042,0.00021375506,0.00016737074,0.00011428898,0.000053822903,0.00013747688,0.000004711021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001898282,0.000057810263,0.0002172465,0.000111320485,0.000014221939,0.0000010752826,0.0007713322,0.000004260898,0.0023546543,0.99624646,0.0000175818,0.00020211295],"study_design_scores_gemma":[0.000555463,0.00020601023,0.0004649214,0.00014788366,0.000019570563,0.000062954234,0.00009064184,0.023402667,0.00620507,0.9686771,0.0000106572625,0.00015707052],"about_ca_topic_score_codex":0.000011662634,"about_ca_topic_score_gemma":0.000015375274,"teacher_disagreement_score":0.20917669,"about_ca_system_score_codex":0.0000023484567,"about_ca_system_score_gemma":0.000015286658,"threshold_uncertainty_score":0.3202108},"labels":[],"label_agreement":null},{"id":"W1994156427","doi":"10.1016/j.disc.2009.04.002","title":"Research problems on Gray codes and universal cycles","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Gray code; Gray (unit); Mathematics; De Bruijn sequence; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.039846901217051485,"score_gpt":0.30825031101059897,"score_spread":0.2684034097935475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994156427","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4689785,0.00023745456,0.4397287,0.005128279,0.00017447953,0.00066067645,0.00001006655,0.0005968165,0.084485024],"genre_scores_gemma":[0.9763072,0.000040548104,0.023411235,0.000079723155,0.000024601699,0.000003270259,0.0000010284499,0.000005535577,0.00012684356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902654,0.00008797003,0.000120646524,0.00022130366,0.00029807963,0.00024547093],"domain_scores_gemma":[0.9991718,0.0002521018,0.000036908645,0.00041469585,0.000046251193,0.00007827449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075834984,0.000100397054,0.00012155659,0.00017036205,0.00021226463,0.00019219372,0.00048663197,0.000040120085,0.0000053798317],"category_scores_gemma":[0.000037148806,0.000078959485,0.000041061758,0.00038373706,0.00011424723,0.00016256509,0.000107100925,0.0001639197,0.000020592566],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035167645,0.000058983183,0.000027642005,0.000028038761,0.0000062041036,0.0000037509926,0.0024561274,0.000014951142,0.00029904564,0.99168164,0.0002940829,0.0051260153],"study_design_scores_gemma":[0.00017200237,0.00036663187,0.00055099593,0.00015014439,0.000004668693,0.000009210498,0.0005353812,0.010243532,0.00067774125,0.9862179,0.0009181858,0.00015361654],"about_ca_topic_score_codex":0.00000237879,"about_ca_topic_score_gemma":0.0000017674959,"teacher_disagreement_score":0.5073287,"about_ca_system_score_codex":0.000011234484,"about_ca_system_score_gemma":0.000012729171,"threshold_uncertainty_score":0.32198745},"labels":[],"label_agreement":null},{"id":"W1994268719","doi":"10.1016/s0012-365x(02)00520-4","title":"On self-dual codes over some prime fields","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Dual (grammatical number); Prime (order theory); Combinatorics; Discrete mathematics; Separable space; Minimum distance; Block code; Linear code; Finite field; Algorithm; Decoding methods","score_opus":0.011533567343500301,"score_gpt":0.24152224109198725,"score_spread":0.22998867374848694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994268719","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.24159442,0.000088132976,0.70172244,0.00031407573,0.0004983705,0.00028752792,0.0000061936084,0.0007003232,0.054788508],"genre_scores_gemma":[0.92858595,0.000010759709,0.07041902,0.0006398763,0.0000384416,0.000012818761,0.0000012680589,0.000015080834,0.0002767937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990055,0.000067903355,0.00019275911,0.00023297759,0.0002549737,0.00024587105],"domain_scores_gemma":[0.99890167,0.00027909764,0.000077700555,0.00064467354,0.000020915408,0.00007591844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035363674,0.00015560907,0.00017028415,0.00008043839,0.00011940401,0.00012808427,0.00040814918,0.00006957536,0.00005862758],"category_scores_gemma":[0.00008210646,0.00012703228,0.000115522955,0.0002144143,0.000033546512,0.00021601024,0.00008241579,0.00013586087,0.000078237856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015594552,0.0001037923,0.000015631327,0.000024710698,0.000023758237,0.000006374236,0.0013843913,0.000010998426,0.00008111771,0.9975518,0.0005716913,0.0002241538],"study_design_scores_gemma":[0.00024295681,0.00014312459,0.000043693268,0.000047111254,0.000015658554,0.0000138813,0.00005948094,0.0070063877,0.004882426,0.9852001,0.002091508,0.00025365918],"about_ca_topic_score_codex":9.619932e-7,"about_ca_topic_score_gemma":7.608052e-7,"teacher_disagreement_score":0.6869915,"about_ca_system_score_codex":0.000014316601,"about_ca_system_score_gemma":0.00002540201,"threshold_uncertainty_score":0.5180226},"labels":[],"label_agreement":null},{"id":"W1994563618","doi":"10.1016/j.disc.2014.12.023","title":"Threefold triple systems with nonsingular <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:math>","year":2015,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Invertible matrix; Mathematics; Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.017982152610338732,"score_gpt":0.22790358011279457,"score_spread":0.20992142750245585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994563618","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52338517,0.002654178,0.005319571,0.00026673527,0.0040501477,0.00010991562,0.00054353895,0.00044114928,0.4632296],"genre_scores_gemma":[0.9892343,0.00048376727,0.003721602,0.0003837915,0.00212558,0.0010354706,0.0010433019,0.0012010287,0.00077112054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98991,0.0004704452,0.0024367073,0.0016272028,0.0029209936,0.0026346701],"domain_scores_gemma":[0.9917127,0.0012498664,0.0020850962,0.003307346,0.00023176926,0.0014132466],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0029774571,0.001237774,0.00064450176,0.00055386976,0.0012252086,0.0018728641,0.0022187964,0.0022559636,0.09267651],"category_scores_gemma":[0.0012928299,0.0020489583,0.0017452476,0.0013498577,0.0012301692,0.0014198562,0.0012574083,0.001693148,0.0026418357],"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.0009372429,0.00033823622,0.00001715246,0.0049141976,0.0026012466,0.0015118036,0.0061511267,0.006997102,0.0015677266,0.82066685,0.15394995,0.00034735535],"study_design_scores_gemma":[0.0027736598,0.0016344597,0.000023210843,0.0043606213,0.0023719782,0.0022557576,0.0076507316,0.3577224,0.6141301,0.0004905913,0.0042327554,0.0023537627],"about_ca_topic_score_codex":0.00093392935,"about_ca_topic_score_gemma":0.0007914248,"teacher_disagreement_score":0.82017624,"about_ca_system_score_codex":0.000030797066,"about_ca_system_score_gemma":0.0010723383,"threshold_uncertainty_score":0.99916327},"labels":[],"label_agreement":null},{"id":"W1994872708","doi":"10.1016/j.disc.2008.08.007","title":"Some topological properties of star graphs: The surface area and volume","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mathematics; Star (game theory); Combinatorics; Graph; Star network; Discrete mathematics; Topological graph theory; A* search algorithm; Surface (topology); Topology (electrical circuits); Line graph; Voltage graph; Network topology; Computer science; Geometry; Mathematical analysis","score_opus":0.04434381256212042,"score_gpt":0.2259252630297574,"score_spread":0.181581450467637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994872708","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96226984,0.0006938395,0.035663933,0.00051488716,0.00016977853,0.00016743779,0.0000016972903,0.0000505861,0.0004679905],"genre_scores_gemma":[0.9949809,0.00007649072,0.004207615,0.00006423369,0.00002885651,0.0000052074447,2.3077806e-7,0.0000046891814,0.00063178275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924546,0.000051351235,0.00025143544,0.00013504065,0.00017640025,0.0001403122],"domain_scores_gemma":[0.9994201,0.000054422588,0.00010325777,0.00033576298,0.000054163673,0.000032297576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024269502,0.000093012866,0.00018644526,0.00001856795,0.00015189617,0.000044845627,0.00034583552,0.000041547355,0.0000063672455],"category_scores_gemma":[0.000032350374,0.00004779463,0.00005715143,0.000101417405,0.0001977622,0.00015964339,0.00013324824,0.000077039884,0.0000058858714],"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.00000922633,0.00012068515,0.0014211673,0.00024073657,0.00008220951,0.000016175365,0.03012715,0.000488734,0.0018914388,0.9630229,0.0024459157,0.00013368537],"study_design_scores_gemma":[0.00031554984,0.00028073092,0.000714951,0.00023524516,0.000017809552,0.00033720655,0.0037789294,0.91922826,0.0029082587,0.07075357,0.0010614393,0.0003680695],"about_ca_topic_score_codex":0.000015187654,"about_ca_topic_score_gemma":0.0000023106784,"teacher_disagreement_score":0.9187395,"about_ca_system_score_codex":0.000006231907,"about_ca_system_score_gemma":0.000012353566,"threshold_uncertainty_score":0.19490084},"labels":[],"label_agreement":null},{"id":"W1994928089","doi":"10.1016/s0012-365x(03)00094-3","title":"A permutation group determined by an ordered set","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Permutation group; Combinatorics; Involution (esoterism); Symmetric group; Distributive lattice; Permutation (music); Primitive permutation group; Cyclic permutation; Finite group; Alternating group; Partial permutation; Discrete mathematics; Derangement; Group (periodic table); Lattice (music); Distributive property; Pure mathematics","score_opus":0.019251208069037167,"score_gpt":0.27033289119287995,"score_spread":0.25108168312384277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994928089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074471794,0.000050197723,0.92255753,0.000060475068,0.00007301671,0.00015193949,0.0000056804993,0.00015833824,0.0024709993],"genre_scores_gemma":[0.76344,0.000004361132,0.23607722,0.00016785237,0.0000118638545,0.00002118253,0.000023333037,0.000014312031,0.00023983743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902976,0.000060414903,0.00021754141,0.00026128913,0.00019600117,0.00023497263],"domain_scores_gemma":[0.9992161,0.000067298715,0.00010396308,0.00048380243,0.000033226715,0.00009564624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016754218,0.00014575513,0.00015563206,0.00003761845,0.00010860176,0.00012413264,0.0003932136,0.000048089056,0.000028825561],"category_scores_gemma":[0.000093061964,0.00012009678,0.00005479952,0.00020188901,0.000031195505,0.00053080585,0.000043033328,0.00006993764,0.000044155484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026226626,0.00019461835,0.00008323759,0.0000782775,0.000020411968,0.000020000129,0.006900673,0.000089732006,0.006081608,0.9796608,0.0004643304,0.006403666],"study_design_scores_gemma":[0.0008445875,0.00034666903,0.00009400727,0.00003760697,0.000025537007,0.00010145755,0.0011436873,0.24265501,0.0053414563,0.7451977,0.0035220652,0.0006901895],"about_ca_topic_score_codex":0.0000011996265,"about_ca_topic_score_gemma":0.000003090373,"teacher_disagreement_score":0.68896824,"about_ca_system_score_codex":0.00001861503,"about_ca_system_score_gemma":0.000015736536,"threshold_uncertainty_score":0.48974046},"labels":[],"label_agreement":null},{"id":"W1994937623","doi":"10.1016/j.disc.2006.11.035","title":"Perfect dexagon triple systems","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.009309574290791578,"score_gpt":0.21490568765407242,"score_spread":0.20559611336328085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994937623","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70807356,0.0012422311,0.1566191,0.000006090315,0.0018160148,0.00050954113,0.000016992757,0.0008577486,0.13085872],"genre_scores_gemma":[0.9983611,0.000010417597,0.0006219337,0.0000053754534,0.00013579732,0.000015666094,0.0000069884827,0.000050024548,0.0007927085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990219,0.00001969033,0.00035721425,0.00010737066,0.0001773289,0.00031649464],"domain_scores_gemma":[0.999414,0.00010576448,0.0000433713,0.00032076825,0.000021180076,0.00009490503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007450077,0.00017127545,0.0002441644,0.00009004209,0.00006191108,0.000055640718,0.00016112675,0.000089640256,0.000032610424],"category_scores_gemma":[0.00002770394,0.00014601511,0.000093775634,0.00018175822,0.000026062808,0.00007498674,0.000014704788,0.00011705286,0.00019040455],"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.000047186008,0.00021735375,0.0013905393,0.008370543,0.00064310606,0.00015490837,0.019921556,0.012570601,0.03786613,0.90497404,0.010090754,0.003753278],"study_design_scores_gemma":[0.0042303894,0.00052761997,0.0020300536,0.0027133857,0.0005742053,0.001016093,0.048324656,0.6970598,0.07371617,0.052942887,0.11167226,0.005192452],"about_ca_topic_score_codex":0.0000042177,"about_ca_topic_score_gemma":0.0000041491044,"teacher_disagreement_score":0.8520312,"about_ca_system_score_codex":0.000034419612,"about_ca_system_score_gemma":0.0000039843003,"threshold_uncertainty_score":0.59543234},"labels":[],"label_agreement":null},{"id":"W1995612970","doi":"10.1016/s0012-365x(02)00260-1","title":"On cop-win graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Calgary; Université de Montréal","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Discrete mathematics; Indifference graph; Graph","score_opus":0.034749443931359224,"score_gpt":0.290733015575863,"score_spread":0.2559835716445038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995612970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023991106,0.00016426461,0.87480444,0.0010096116,0.00019498126,0.00039775265,0.00000837994,0.00045219067,0.098977275],"genre_scores_gemma":[0.83619857,0.000048094636,0.15901867,0.0004494196,0.000030717558,0.000046272366,0.0000021259061,0.000041168674,0.004164961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856013,0.00005505666,0.00022496967,0.0002962309,0.00048882223,0.00037479567],"domain_scores_gemma":[0.99837977,0.00035857252,0.00007469771,0.0010144166,0.000046744808,0.00012578342],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027142162,0.00016026726,0.00018070955,0.00016259284,0.00013373278,0.00012658605,0.0010671917,0.00004713114,0.0002092441],"category_scores_gemma":[0.00017780624,0.00012858352,0.00009988059,0.000543224,0.000098036566,0.00025121862,0.00020640544,0.0001912377,0.0010398504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012911094,0.0000814933,0.000009225697,0.000025412553,0.000010113284,0.000016518981,0.00095208496,0.000041156083,0.000129834,0.99414504,0.0016802974,0.0029075518],"study_design_scores_gemma":[0.00021744911,0.00011220804,0.00001700919,0.00004279742,0.000002887704,0.000013706823,0.000060155253,0.09770012,0.0010645018,0.89976245,0.00081380137,0.00019291643],"about_ca_topic_score_codex":5.119445e-7,"about_ca_topic_score_gemma":4.881973e-7,"teacher_disagreement_score":0.81220746,"about_ca_system_score_codex":0.00002240715,"about_ca_system_score_gemma":0.0000055682463,"threshold_uncertainty_score":0.999738},"labels":[],"label_agreement":null},{"id":"W1995620335","doi":"10.1016/j.disc.2007.03.047","title":"The circular chromatic index of Goldberg snarks","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Index (typography); Edge coloring; Discrete mathematics; Graph; Computer science","score_opus":0.02154246218723333,"score_gpt":0.31200599455678596,"score_spread":0.29046353236955263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995620335","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.26193693,0.00048578778,0.69623584,0.00021572207,0.0010837974,0.0018652945,0.000017401582,0.0004229927,0.037736256],"genre_scores_gemma":[0.92625135,0.000034952758,0.07257237,0.000026793334,0.00016356767,0.00004327598,0.000003958053,0.0001502532,0.00075349543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610305,0.00007507984,0.001679353,0.00030642535,0.0010765794,0.0007594877],"domain_scores_gemma":[0.9925745,0.004238384,0.0010804855,0.0016437008,0.00028147316,0.00018143114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025870649,0.0004406486,0.0007726759,0.00013507486,0.0003111885,0.00007070072,0.0009846237,0.00021589932,0.000050402],"category_scores_gemma":[0.0031899004,0.00030566982,0.0003177393,0.00057879067,0.00038711514,0.00016503654,0.00026505342,0.00036941213,0.000041542855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021885246,0.0002948875,0.00010458467,0.0015058573,0.00017590876,0.00001766979,0.002795079,0.00001217026,0.0014800627,0.9922302,0.0004811125,0.00088063395],"study_design_scores_gemma":[0.0006030083,0.00008274665,0.00008946632,0.0003936869,0.0001281536,0.000045199125,0.0026121505,0.0024978635,0.0065485495,0.98586667,0.0007576498,0.00037488816],"about_ca_topic_score_codex":0.000004267221,"about_ca_topic_score_gemma":0.000013690599,"teacher_disagreement_score":0.6643144,"about_ca_system_score_codex":0.0001420948,"about_ca_system_score_gemma":0.000070503054,"threshold_uncertainty_score":0.99993956},"labels":[],"label_agreement":null},{"id":"W1996070164","doi":"10.1016/s0012-365x(01)00355-7","title":"Minimizing algebraic connectivity over connected graphs with fixed girth","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Discrete mathematics; Graph; Algebraic number; Connectivity; Girth (graph theory)","score_opus":0.03866746471566069,"score_gpt":0.27142935720184197,"score_spread":0.2327618924861813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996070164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9685567,0.000062155945,0.012967581,0.0002528355,0.000048988826,0.00074155355,0.000058880407,0.00044249068,0.01686884],"genre_scores_gemma":[0.96776974,0.000013425803,0.030878872,0.00011682199,0.00003553042,0.00014833901,0.000014412525,0.000086094646,0.0009367527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820477,0.00009879442,0.0004766643,0.00040034752,0.000366212,0.00045318977],"domain_scores_gemma":[0.9972024,0.0013185048,0.00032765718,0.0008908857,0.00009950345,0.00016105089],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002931042,0.0003748819,0.00051514356,0.00014400299,0.00031250346,0.00009198099,0.00033863608,0.0001297423,0.0010393928],"category_scores_gemma":[0.00038833407,0.00029078833,0.00018095528,0.0005975541,0.00023088782,0.00018828572,0.00007058528,0.0002608058,0.000106342115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001432057,0.0004070736,0.0003790331,0.00023253645,0.00014685381,0.00000892591,0.0025387711,0.0000031990523,0.0012087125,0.992491,0.0023908988,0.0001786533],"study_design_scores_gemma":[0.0011967022,0.00013008885,0.00035828506,0.00020888475,0.00023617926,0.000060594375,0.0013387421,0.0045325235,0.0031221714,0.98750055,0.0006781109,0.00063715427],"about_ca_topic_score_codex":0.0000040462437,"about_ca_topic_score_gemma":0.00002752926,"teacher_disagreement_score":0.01791129,"about_ca_system_score_codex":0.000026302194,"about_ca_system_score_gemma":0.000011979481,"threshold_uncertainty_score":0.9999544},"labels":[],"label_agreement":null},{"id":"W1996888602","doi":"10.1016/j.disc.2011.05.037","title":"Decomposition tree of a lexicographic product of binary structures","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Lexicographical order; Binary number; Mathematics; Arithmetic","score_opus":0.040228358571186555,"score_gpt":0.31151545552536747,"score_spread":0.2712870969541809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996888602","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61922467,0.00021537124,0.3750899,0.000036177615,0.00007158386,0.00036685035,0.000010235082,0.00007662968,0.004908581],"genre_scores_gemma":[0.7362888,0.0000096767935,0.26365617,0.000003639225,0.0000061408036,0.000007418237,0.0000016722441,0.000008932419,0.000017547582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988413,0.00006439597,0.0003613394,0.0002154997,0.0003244101,0.00019308193],"domain_scores_gemma":[0.998688,0.000082495135,0.00024516688,0.0008032786,0.00012853245,0.000052565563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030470671,0.00012220476,0.00024433513,0.00026533086,0.000040001512,0.0000113027445,0.00082837645,0.000033148917,0.00002207723],"category_scores_gemma":[0.000062709965,0.0000969924,0.00010970936,0.0006007761,0.00022998091,0.00025674456,0.0002225862,0.00009197275,0.0000025174365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026986243,0.00019558996,0.0005558327,0.00040431376,0.0000516111,0.000005576103,0.005448732,0.000020631407,0.05550247,0.93328464,0.00001797593,0.004485626],"study_design_scores_gemma":[0.00019025737,0.00025231836,0.0046860133,0.000083461935,0.000013857366,0.000015119463,0.00018213566,0.0047418657,0.19630215,0.7933913,0.0000053126346,0.000136224],"about_ca_topic_score_codex":0.000004921362,"about_ca_topic_score_gemma":0.0000021288377,"teacher_disagreement_score":0.14079967,"about_ca_system_score_codex":0.0000063126977,"about_ca_system_score_gemma":0.000025195519,"threshold_uncertainty_score":0.39552355},"labels":[],"label_agreement":null},{"id":"W1997658699","doi":"10.1016/j.disc.2006.10.011","title":"The structure of well-covered graphs with no cycles of length 4","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Discrete mathematics; Equivalence relation; Graph; Vector space; Independent set","score_opus":0.010903874820202587,"score_gpt":0.2742881681302803,"score_spread":0.2633842933100777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997658699","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.44425678,0.00013632423,0.54785836,0.000062629406,0.000078811725,0.00037566235,0.000020644136,0.00005104692,0.0071597383],"genre_scores_gemma":[0.89118415,0.00001995781,0.1086482,0.000008914203,0.0000091272805,0.0000010530003,0.0000010500737,0.000013610196,0.00011395837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855906,0.00004073274,0.00036179597,0.00017495653,0.00056085206,0.0003026271],"domain_scores_gemma":[0.9978983,0.00065664185,0.00028069597,0.0009025388,0.00020138167,0.000060478025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005451232,0.00013664177,0.00022255615,0.00009380911,0.00010706969,0.000035193952,0.001105859,0.000044466622,0.000009592217],"category_scores_gemma":[0.00011823818,0.000075393924,0.00007497794,0.0004982746,0.0003631714,0.00016935464,0.0001923857,0.00014593238,0.000004937236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004708956,0.000036478454,0.0003867684,0.00014617958,0.000057588102,0.0000036897495,0.0012913021,0.00006926129,0.012909319,0.9837107,0.00002781605,0.0013138277],"study_design_scores_gemma":[0.00048997765,0.00029482367,0.0011596918,0.00014360296,0.000017588922,0.000020868489,0.0009868186,0.0052368143,0.15797079,0.83320457,0.00023998263,0.00023446357],"about_ca_topic_score_codex":0.0000035097023,"about_ca_topic_score_gemma":0.000018947878,"teacher_disagreement_score":0.44692734,"about_ca_system_score_codex":0.000010336178,"about_ca_system_score_gemma":0.000032287546,"threshold_uncertainty_score":0.3074475},"labels":[],"label_agreement":null},{"id":"W1997887073","doi":"10.1016/j.disc.2006.06.025","title":"On a conjecture about the Randić index","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Polytechnique Montréal","funders":"","keywords":"Conjecture; Mathematics; Graph; Combinatorics; Index (typography); Order (exchange); Discrete mathematics; Computer science","score_opus":0.018549852329118384,"score_gpt":0.2867706539220379,"score_spread":0.2682208015929195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997887073","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7239698,0.0001809507,0.0772323,0.0022412178,0.00016757956,0.0017845092,0.00010356671,0.00048774667,0.19383234],"genre_scores_gemma":[0.99330515,0.0000033862618,0.0030996292,0.00020060263,0.00010946207,0.00013375835,0.0000130914095,0.000042861542,0.0030920538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988554,0.000059062495,0.00036173288,0.00018915256,0.0002784727,0.0002561747],"domain_scores_gemma":[0.99788564,0.0011096789,0.00018951975,0.0007380256,0.00003546276,0.000041691277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038778927,0.00021651125,0.0002479249,0.000052644085,0.00030738753,0.000079016914,0.00035877008,0.00009686993,0.00020148503],"category_scores_gemma":[0.0001613311,0.00012551839,0.00016793564,0.000228635,0.00015757387,0.000038536527,0.000044150936,0.00023720894,0.00013218519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009271897,0.00012992964,0.000027270851,0.000062520325,0.00002359058,0.0000018084048,0.0005614414,0.00002549641,0.00008887389,0.9900012,0.009004742,0.000063879575],"study_design_scores_gemma":[0.00040177378,0.000023695273,0.00013690026,0.000064357635,0.00005643158,0.000013957621,0.00027178667,0.0007218539,0.0005149591,0.993755,0.0038686616,0.00017064081],"about_ca_topic_score_codex":0.0000068210766,"about_ca_topic_score_gemma":0.000017353008,"teacher_disagreement_score":0.26933536,"about_ca_system_score_codex":0.000016232085,"about_ca_system_score_gemma":0.00001489565,"threshold_uncertainty_score":0.51184916},"labels":[],"label_agreement":null},{"id":"W1998044937","doi":"10.1016/s0012-365x(00)00181-3","title":"The ultimate categorical matching in a graph","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Categorical variable; Factor-critical graph; Matching (statistics); Graph; Edge-transitive graph; Discrete mathematics; Graph power; Line graph; Statistics","score_opus":0.02454482641561275,"score_gpt":0.3128628851969006,"score_spread":0.28831805878128786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998044937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041348044,0.00015386121,0.9501053,0.0011364691,0.00009067404,0.00025018712,7.8622173e-7,0.00013028694,0.006784399],"genre_scores_gemma":[0.9119507,0.00021028829,0.08697495,0.00008607619,0.000029848057,0.00007141516,0.0000013658004,0.000027326185,0.00064804236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984377,0.0000905804,0.00032082494,0.00024669865,0.000395631,0.000508559],"domain_scores_gemma":[0.99844337,0.00057266117,0.00007974659,0.0007780813,0.000040067243,0.000086087755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008903147,0.00014190147,0.00016635713,0.00011964486,0.00024912195,0.00025003916,0.0013364406,0.000040736777,0.0000062761947],"category_scores_gemma":[0.00013608614,0.00008968626,0.00007455536,0.00085277937,0.00011045394,0.00031396016,0.00034721583,0.00026082984,0.00008413543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055407536,0.000040912226,0.00016667192,0.000017053972,0.0000072277735,0.00006415063,0.002181434,0.0002183172,0.0001683155,0.9928528,0.000039309387,0.0042382427],"study_design_scores_gemma":[0.00016691368,0.00001899756,0.00022041668,0.00001922742,0.0000015362633,0.00006043461,0.00043441294,0.05560936,0.000114050796,0.9427343,0.00049066194,0.00012969573],"about_ca_topic_score_codex":0.000011652022,"about_ca_topic_score_gemma":0.000028878037,"teacher_disagreement_score":0.87060267,"about_ca_system_score_codex":0.000039587325,"about_ca_system_score_gemma":0.000023260967,"threshold_uncertainty_score":0.36572996},"labels":[],"label_agreement":null},{"id":"W1998140754","doi":"10.1016/s0012-365x(99)00206-x","title":"Variable neighborhood search for extremal graphs: 1 The AutoGraphiX system","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":209,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Polytechnique Montréal","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Variable neighborhood search; Combinatorics; Variable (mathematics); Combinatorial optimization; Discrete mathematics; Metaheuristic; Mathematical optimization","score_opus":0.024019720620125168,"score_gpt":0.28211261587146697,"score_spread":0.2580928952513418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998140754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031614304,0.00017569856,0.9618266,0.00037104866,0.00010948942,0.0010804283,0.000032039006,0.0003645863,0.032878637],"genre_scores_gemma":[0.55488867,0.000026752201,0.4406478,0.000119572665,0.000113206865,0.0005144434,0.000012521184,0.0000819279,0.0035950711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975475,0.00015232222,0.00041994252,0.00046941053,0.00065333256,0.0007574704],"domain_scores_gemma":[0.9972455,0.00080658274,0.00008498529,0.0015528465,0.0001539811,0.00015609687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014600336,0.00025262416,0.00030523166,0.0001652102,0.0005645817,0.0003816148,0.0022139745,0.00008488595,0.00011130527],"category_scores_gemma":[0.00005286067,0.00016417835,0.00022531235,0.0013006501,0.00020512842,0.00041145209,0.00021781406,0.00025043113,0.00009641088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012076766,0.000054186774,0.000028052207,0.00022239392,0.000047568246,0.0000060163525,0.0010756188,0.00028891274,0.00011616251,0.99317056,0.00016829166,0.004810176],"study_design_scores_gemma":[0.000512129,0.00014335498,0.000033886936,0.0001433954,0.000026233969,0.000107944565,0.00091296044,0.4229778,0.00058593496,0.57232445,0.0019014182,0.0003305121],"about_ca_topic_score_codex":0.0000055870437,"about_ca_topic_score_gemma":7.16173e-7,"teacher_disagreement_score":0.55172724,"about_ca_system_score_codex":0.00003796713,"about_ca_system_score_gemma":0.000070759255,"threshold_uncertainty_score":0.6694998},"labels":[],"label_agreement":null},{"id":"W1999074957","doi":"10.1016/j.disc.2011.01.013","title":"On Roussel–Rubio-type lemmas and their consequences","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"EGIDE; Agence Nationale de la Recherche; Engineering and Physical Sciences Research Council; Ministère de l'Europe et des Affaires Étrangères; Providence Health Care","keywords":"Mathematics; Type (biology); Combinatorics; Discrete mathematics","score_opus":0.09734350068430835,"score_gpt":0.31419659697815056,"score_spread":0.2168530962938422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999074957","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8390007,0.00023066462,0.04593978,0.00027109258,0.00041167426,0.0007548953,0.000034749733,0.00045842153,0.11289803],"genre_scores_gemma":[0.804425,0.00005102175,0.19401945,0.0001612273,0.00005832819,0.000021068225,0.000004237979,0.00007241656,0.0011872455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986889,0.000050191178,0.00041651665,0.0003073797,0.0002069551,0.00033010624],"domain_scores_gemma":[0.9982036,0.0007429542,0.00022492169,0.0006379408,0.00007580792,0.000114806106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030499802,0.0003134644,0.00040344903,0.00007766807,0.00013576324,0.00004046161,0.00029951986,0.000121844176,0.00028087755],"category_scores_gemma":[0.00081369345,0.00022089925,0.00007231174,0.00014719077,0.00036258996,0.00012286473,0.00012136725,0.00022782863,0.00008147549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014092861,0.00009814723,0.000039097606,0.00016849024,0.000047770194,0.000012945677,0.006499081,2.51953e-7,0.0004033043,0.9919393,0.00033809707,0.0004393915],"study_design_scores_gemma":[0.00020967281,0.00016712684,0.000019806645,0.00013874169,0.000031218482,0.000046602097,0.0015739832,0.00016324922,0.011958491,0.98508024,0.00032713998,0.0002837371],"about_ca_topic_score_codex":0.0000043635523,"about_ca_topic_score_gemma":0.000008261827,"teacher_disagreement_score":0.14807968,"about_ca_system_score_codex":0.000030141871,"about_ca_system_score_gemma":0.000029410428,"threshold_uncertainty_score":0.900801},"labels":[],"label_agreement":null},{"id":"W1999323173","doi":"10.1016/j.disc.2004.04.005","title":"Spanning spiders and light-splitting switches","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Spanning tree; Mathematics; Combinatorics; Minimum degree spanning tree; Subdivision; Connected dominating set; Minimum spanning tree; Discrete mathematics; Bounded function; Graph","score_opus":0.007775992139421603,"score_gpt":0.19697964970249354,"score_spread":0.18920365756307195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999323173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9582048,0.00059938425,0.018560627,0.0000872775,0.00015217964,0.00014083313,0.0000022168806,0.0003553157,0.02189734],"genre_scores_gemma":[0.9948428,0.000013511899,0.0049759005,0.000015338897,0.000053450058,0.000009914393,0.0000014544989,0.000035642166,0.000051932573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993591,0.0000058425994,0.00022556652,0.00010635377,0.00009806649,0.00020507425],"domain_scores_gemma":[0.9996749,0.000035022465,0.000035136865,0.0001784468,0.0000098622395,0.00006663503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019637693,0.0001451729,0.00018426238,0.000050816074,0.00007459935,0.000058834652,0.00008351142,0.00005563679,0.0000062017716],"category_scores_gemma":[0.000029885725,0.0001271008,0.00004765662,0.000094250056,0.000026531117,0.00010106963,0.000022787055,0.00009805757,0.000030321366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000078642515,0.00006897494,0.0013354622,0.004619419,0.0003695084,0.000053886408,0.06510406,0.019879214,0.0825178,0.8228419,0.00028700038,0.0029149067],"study_design_scores_gemma":[0.0019827676,0.00012303419,0.0008612055,0.0028161828,0.00021040841,0.00028581952,0.03881797,0.023770781,0.09863103,0.8273877,0.0031990407,0.0019140588],"about_ca_topic_score_codex":0.0000026884575,"about_ca_topic_score_gemma":0.0000019009383,"teacher_disagreement_score":0.03663803,"about_ca_system_score_codex":0.000017660346,"about_ca_system_score_gemma":0.0000039085535,"threshold_uncertainty_score":0.518302},"labels":[],"label_agreement":null},{"id":"W1999565878","doi":"10.1016/j.disc.2008.04.023","title":"Achieving maximum chromatic index in multigraphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Multigraph; Upper and lower bounds; Edge coloring; Bipartite graph; Multiplicity (mathematics); Discrete mathematics; Graph","score_opus":0.02820827059957298,"score_gpt":0.28811301385298915,"score_spread":0.25990474325341617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999565878","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.39600492,0.00010830579,0.5996391,0.00015141885,0.000058035726,0.00030560777,0.0000016587054,0.00016563156,0.0035652916],"genre_scores_gemma":[0.8480744,0.000034470966,0.15159982,0.00005124379,0.00001426398,0.000037006586,0.0000013654424,0.00002157865,0.00016589893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811155,0.00009010346,0.00043206595,0.0003465322,0.0005115082,0.00050824194],"domain_scores_gemma":[0.998465,0.00030408404,0.00012100859,0.0009421138,0.000045177527,0.00012259735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047681908,0.00020361919,0.00030413468,0.0003700929,0.00015936336,0.00006646055,0.0012195739,0.0000697793,0.000020064439],"category_scores_gemma":[0.00023184413,0.00017676855,0.00010062854,0.0010089697,0.00017451134,0.0005334569,0.0003859409,0.00028799125,0.00009751691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004039513,0.0013077784,0.06383128,0.0013526386,0.00014073902,0.0013811587,0.058054686,0.002460833,0.008873716,0.8440486,0.0004376156,0.018070567],"study_design_scores_gemma":[0.0014336408,0.00012637278,0.03423311,0.00040645915,0.0000066503385,0.0003315636,0.0008109276,0.3896728,0.0016177549,0.570262,0.00022196204,0.000876741],"about_ca_topic_score_codex":0.000007988601,"about_ca_topic_score_gemma":0.00001005383,"teacher_disagreement_score":0.45206943,"about_ca_system_score_codex":0.000046697874,"about_ca_system_score_gemma":0.00004696561,"threshold_uncertainty_score":0.7208412},"labels":[],"label_agreement":null},{"id":"W2000440641","doi":"10.1016/j.disc.2003.10.024","title":"Absorbing sets in arc-coloured tournaments","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Université de Montréal","funders":"","keywords":"Tournament; Mathematics; Vertex (graph theory); Monochromatic color; Combinatorics; Arc (geometry); Path (computing); Section (typography); Discrete mathematics; Graph; Geometry; Computer science","score_opus":0.027925092144595185,"score_gpt":0.3189830667795664,"score_spread":0.2910579746349712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000440641","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.2749332,0.000103176746,0.7182346,0.00083422894,0.000115043316,0.0003748453,0.0000029786688,0.00014038158,0.0052615716],"genre_scores_gemma":[0.8219398,0.00002397538,0.17775615,0.0000932851,0.000012097808,0.000026705142,0.0000014850218,0.000018246461,0.00012826102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985004,0.000041574087,0.00032101513,0.0002723089,0.00042293957,0.00044175412],"domain_scores_gemma":[0.9990375,0.00010368661,0.00009799697,0.00061409874,0.00003856381,0.00010814119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005027143,0.00014773889,0.00020347153,0.00020073607,0.00008344129,0.00012901002,0.0009664493,0.00005093571,0.000013366533],"category_scores_gemma":[0.00014731855,0.00012939995,0.000063258776,0.00054111873,0.00005910769,0.00040531644,0.0003264951,0.00023089138,0.00011170562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008135573,0.00023496614,0.00031410198,0.00010549683,0.0000234631,0.00018630043,0.009709011,0.0021332537,0.0023145992,0.98168373,0.00004526462,0.0032416726],"study_design_scores_gemma":[0.0007671693,0.000054188647,0.00044015155,0.00016724829,0.0000023171299,0.000029215746,0.00033055103,0.011370585,0.0031507507,0.98339385,0.0000861449,0.00020783897],"about_ca_topic_score_codex":0.000006719335,"about_ca_topic_score_gemma":0.000013240072,"teacher_disagreement_score":0.5470066,"about_ca_system_score_codex":0.00012795285,"about_ca_system_score_gemma":0.000054112064,"threshold_uncertainty_score":0.5276777},"labels":[],"label_agreement":null},{"id":"W2000477684","doi":"10.1016/j.disc.2010.04.001","title":"Corrigendum to “<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>(</mml:mo><mml:mi>p</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-total labelling of graphs” [Discrete Math. 308 (2008) 496–513]","year":2010,"lang":"lv","type":"erratum","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"","keywords":"Scroll; Algorithm; Mathematics; Computer science; Discrete mathematics; Theology; Philosophy","score_opus":0.019285442878727937,"score_gpt":0.23935867092090632,"score_spread":0.22007322804217838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000477684","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88655716,0.0041510607,0.017294127,0.0012300323,0.021548875,0.0005301447,0.0028451595,0.0013320234,0.06451141],"genre_scores_gemma":[0.9456353,0.0022915923,0.037586372,0.0022992932,0.0026638855,0.0018613411,0.0030053903,0.0020818515,0.0025749644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97811234,0.0007148822,0.005344256,0.0045208945,0.0061985357,0.0051091197],"domain_scores_gemma":[0.9830385,0.002138697,0.005853051,0.0053878855,0.00090953376,0.0026723645],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.004766032,0.0028827237,0.0016332867,0.0015761418,0.0033018056,0.003420941,0.0063884933,0.0055607525,0.0068027056],"category_scores_gemma":[0.0027664418,0.0042986404,0.004269808,0.0032169905,0.0030078737,0.0022856386,0.0053332006,0.0053632497,0.0038427599],"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.0007819665,0.0007913517,0.000008386568,0.0038668497,0.0023087654,0.0010904993,0.005694577,0.0022316747,0.004805359,0.8530954,0.12402854,0.00129661],"study_design_scores_gemma":[0.003185493,0.0033441551,0.000024147053,0.006789172,0.0035543526,0.0029218602,0.003035709,0.70473576,0.24366726,0.014474979,0.009284163,0.00498296],"about_ca_topic_score_codex":0.0017522348,"about_ca_topic_score_gemma":0.00072394026,"teacher_disagreement_score":0.8386204,"about_ca_system_score_codex":0.000060694583,"about_ca_system_score_gemma":0.0026101358,"threshold_uncertainty_score":0.9997054},"labels":[],"label_agreement":null},{"id":"W2000525347","doi":"10.1016/j.disc.2006.07.013","title":"Research problems from the 5th Slovenian Conference (Bled, 2003)","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.0639297673745002,"score_gpt":0.30603513295104606,"score_spread":0.24210536557654588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000525347","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.011467615,0.00034671105,0.91177285,0.002491754,0.00077763107,0.0006846744,0.000018803437,0.00017596192,0.07226398],"genre_scores_gemma":[0.976462,0.00001532799,0.017617723,0.0001128313,0.0004899187,0.00007297152,0.000012751135,0.000020458334,0.00519603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805397,0.00021207146,0.0004050802,0.0003197375,0.0005926526,0.00041647517],"domain_scores_gemma":[0.99809855,0.0003409711,0.0001272602,0.00093442283,0.0004415187,0.00005729097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012089389,0.00014824381,0.00020281631,0.00005063817,0.0003345239,0.0007076703,0.0012765785,0.000081525264,0.000082325416],"category_scores_gemma":[0.00007666941,0.00009157105,0.000059880822,0.00068515673,0.000104301944,0.00022373641,0.00027022196,0.0003070134,0.0003319123],"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.0000016040125,0.00005717829,0.00015415164,0.000029427194,0.000019681387,0.0000064052388,0.0031876964,0.00031162964,0.00021343482,0.94803256,0.047157925,0.0008283262],"study_design_scores_gemma":[0.00036706362,0.00008388327,0.00035761142,0.0004301572,0.00001016052,0.000026062215,0.0015410256,0.70819557,0.00045631797,0.23128176,0.056896213,0.0003541663],"about_ca_topic_score_codex":0.0008502133,"about_ca_topic_score_gemma":0.00045896237,"teacher_disagreement_score":0.9649944,"about_ca_system_score_codex":0.000041869393,"about_ca_system_score_gemma":0.00007632867,"threshold_uncertainty_score":0.6824081},"labels":[],"label_agreement":null},{"id":"W2000536858","doi":"10.1016/s0012-365x(00)00270-3","title":"A derivation of an affine plane of order 4 from a triangle-free 3-colored K16","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Colored; Affine transformation; Combinatorics; Plane (geometry); Affine plane (incidence geometry); Order (exchange); Set (abstract data type); Discrete mathematics; Pure mathematics; Geometry; Computer science","score_opus":0.011191066028033032,"score_gpt":0.2082213218269116,"score_spread":0.1970302557988786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000536858","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98043424,0.000091450944,0.014804681,0.000014188557,0.000090338566,0.00020326609,0.000105378356,0.00009390915,0.004162564],"genre_scores_gemma":[0.9908622,0.000010906309,0.008897123,0.0000044644216,0.000042616346,0.000014654739,0.00007657463,0.000029119308,0.00006234473],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999164,0.00002798932,0.00043843358,0.000087699234,0.00015705166,0.00012483551],"domain_scores_gemma":[0.9992309,0.00010597991,0.00012145573,0.00045843594,0.00004259033,0.000040642266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017032414,0.00012623197,0.00034242164,0.000078197874,0.000016008624,0.000009403307,0.00022177513,0.0000778829,0.00017139968],"category_scores_gemma":[0.00009682224,0.000110393186,0.00006047346,0.00023822462,0.000033365115,0.00009266819,0.000020995049,0.000054286378,0.0000063064167],"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.00087781966,0.0016675561,0.0026107654,0.0057747043,0.0019213805,0.00008542375,0.06375568,0.024920296,0.6830375,0.20058441,0.002752544,0.012011912],"study_design_scores_gemma":[0.0083030695,0.0007796045,0.0034060648,0.0014220878,0.00048218181,0.00004861629,0.01094161,0.38483027,0.1876514,0.39919063,0.0015864245,0.0013580533],"about_ca_topic_score_codex":0.00002623773,"about_ca_topic_score_gemma":0.000037934973,"teacher_disagreement_score":0.49538612,"about_ca_system_score_codex":0.000009259153,"about_ca_system_score_gemma":0.000006549448,"threshold_uncertainty_score":0.45017034},"labels":[],"label_agreement":null},{"id":"W2000564617","doi":"10.1016/j.disc.2007.07.103","title":"Small proper double blocking sets in Galois planes of prime order","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Blocking (statistics); Prime (order theory); Discrete mathematics; Disjoint sets; Blocking set; Disjoint union (topology); Set (abstract data type); Line (geometry); Order (exchange); Projective space; Pure mathematics; Geometry; Projective test; Collineation; Computer science","score_opus":0.12055054838878872,"score_gpt":0.3578941166804534,"score_spread":0.2373435682916647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000564617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9569549,0.000055170505,0.008236879,0.00009654021,0.00006098842,0.00094706245,0.000017453616,0.00009846486,0.03353254],"genre_scores_gemma":[0.8901819,0.0000065909126,0.10697894,0.000020852898,0.000052412342,0.00003319946,0.000019871211,0.00011537446,0.0025908484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972595,0.00006970172,0.00095872325,0.0003013745,0.000744451,0.00066627056],"domain_scores_gemma":[0.9974862,0.0010721203,0.00029646393,0.00074501795,0.00028492496,0.000115298244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035022446,0.0002880885,0.00058101345,0.00034926264,0.000061988285,0.000046799974,0.00052348635,0.00018377048,0.00021386595],"category_scores_gemma":[0.0010496764,0.00023028255,0.00009964224,0.0006363953,0.00016244418,0.00010240008,0.00023711649,0.00036992496,0.0000696574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001086438,0.003072487,0.014901931,0.00967416,0.0004146985,0.0003804496,0.06489598,0.00008421809,0.028945992,0.871994,0.00088146416,0.00366815],"study_design_scores_gemma":[0.007278496,0.0005173402,0.0019464999,0.002625643,0.00019988618,0.00021091725,0.011804063,0.0085063195,0.16475625,0.799027,0.0012963151,0.001831258],"about_ca_topic_score_codex":0.000050387487,"about_ca_topic_score_gemma":0.00025648496,"teacher_disagreement_score":0.13581027,"about_ca_system_score_codex":0.000078097204,"about_ca_system_score_gemma":0.000077547105,"threshold_uncertainty_score":0.9390649},"labels":[],"label_agreement":null},{"id":"W2001078369","doi":"10.1016/j.disc.2014.07.005","title":"Pairs of orthogonal countable ordinals","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Countable set; Mathematics; Combinatorics; Constant (computer programming); Identity (music); Set (abstract data type); Discrete mathematics; Order (exchange); Pure mathematics; Computer science; Physics","score_opus":0.016721744230815138,"score_gpt":0.24130662422666968,"score_spread":0.22458487999585455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001078369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015434815,0.000039628667,0.91578513,0.0002614399,0.000111097645,0.00009629604,0.0000049783316,0.00007481758,0.06819181],"genre_scores_gemma":[0.69792426,0.000007798864,0.30169058,0.00012927919,0.000035335146,0.000005905612,0.000002826164,0.00000868453,0.00019534689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990246,0.000030296165,0.00028426875,0.00016843353,0.0002911819,0.00020118333],"domain_scores_gemma":[0.9990465,0.00013859164,0.00015201571,0.0005442896,0.00006045452,0.000058142872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048511318,0.000108600434,0.00023355584,0.000041830237,0.000055677734,0.00006320497,0.0005972505,0.000041094085,0.000041396845],"category_scores_gemma":[0.00007666454,0.00007931645,0.000075325304,0.00019076477,0.000049074624,0.00016249281,0.00015847966,0.000059706825,0.00005374177],"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.0000013205779,0.000071875416,0.00039609682,0.00013081873,0.000016499349,0.0000018006546,0.0009203352,0.00014008854,0.00013344608,0.9932966,0.0013355331,0.0035555747],"study_design_scores_gemma":[0.00045616788,0.00025703237,0.0011223289,0.00013334284,0.000026564043,0.000030512725,0.00023088281,0.5688197,0.0011343776,0.41484493,0.012522011,0.00042217027],"about_ca_topic_score_codex":0.0000054944376,"about_ca_topic_score_gemma":0.0000017987245,"teacher_disagreement_score":0.68248945,"about_ca_system_score_codex":0.000008162766,"about_ca_system_score_gemma":0.000022127017,"threshold_uncertainty_score":0.32344308},"labels":[],"label_agreement":null},{"id":"W2001348807","doi":"10.1016/j.disc.2013.07.006","title":"On the determinant of bipartite graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Edge-transitive graph; Discrete mathematics; Voltage graph; Factor-critical graph; Line graph; Graph; Vertex-transitive graph","score_opus":0.03599603487478095,"score_gpt":0.2908238086192669,"score_spread":0.25482777374448595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001348807","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9813399,0.000011534673,0.0027918024,0.0005690699,0.000032086053,0.0006768241,0.000015318305,0.00005818796,0.014505286],"genre_scores_gemma":[0.99134463,0.0000054599377,0.0077384617,0.00009507173,0.0000105726385,0.00023384357,0.000001943002,0.000026206551,0.00054380303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902445,0.000050303974,0.00038950366,0.00013025744,0.00021112726,0.00019435603],"domain_scores_gemma":[0.99754775,0.0013448591,0.00023253419,0.0007554429,0.000068425754,0.000051004692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034267158,0.00015049997,0.00022330771,0.000058931106,0.0001241866,0.000030959964,0.0003458424,0.000049684626,0.0005171057],"category_scores_gemma":[0.00034917664,0.00008390841,0.00015193959,0.00022314517,0.00017373762,0.000057286165,0.00005242011,0.00011259686,0.00023770872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014645384,0.00011761712,0.000020120506,0.00008575374,0.000022840024,2.6463437e-7,0.0008509175,9.35064e-7,0.0017775329,0.9943862,0.0025469079,0.00018946159],"study_design_scores_gemma":[0.00008101937,0.000038404727,0.00008560197,0.00009038027,0.000036097146,0.0000032720693,0.000580938,0.0007680202,0.009769496,0.9883056,0.00013426141,0.00010689209],"about_ca_topic_score_codex":0.0000040441005,"about_ca_topic_score_gemma":0.000001970174,"teacher_disagreement_score":0.013961483,"about_ca_system_score_codex":0.0000055117644,"about_ca_system_score_gemma":0.000008070241,"threshold_uncertainty_score":0.5661944},"labels":[],"label_agreement":null},{"id":"W2001705063","doi":"10.1016/j.disc.2003.11.033","title":"Pancyclic BIBD block-intersection graphs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Intersection (aeronautics); Combinatorics; Block (permutation group theory); Discrete mathematics","score_opus":0.007389320496746208,"score_gpt":0.2008945973059468,"score_spread":0.1935052768092006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001705063","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9564722,0.00022668863,0.02000709,0.000031987554,0.0008715059,0.0001867066,0.0000101375535,0.0006872559,0.021506406],"genre_scores_gemma":[0.99858344,0.000019563513,0.0011854408,0.000009202541,0.000050433602,0.000025423393,0.000003929684,0.000040482235,0.00008207697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993005,0.000011212995,0.00024505888,0.000109134766,0.00012644797,0.00020769298],"domain_scores_gemma":[0.9995837,0.000032728105,0.000035120698,0.0002708408,0.00001543528,0.00006213579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011796851,0.00015766588,0.00017422701,0.00012172253,0.000066345994,0.000039963845,0.00012347952,0.00007043243,0.000027794016],"category_scores_gemma":[0.000020403479,0.00014011945,0.00011542674,0.0002519179,0.00003878999,0.000100438214,0.000013447167,0.0001119821,0.00017058788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010515212,0.00015901592,0.00032404467,0.0018215153,0.00030815875,0.000025758345,0.015567798,0.021311058,0.02791984,0.93103683,0.0007105667,0.0008049102],"study_design_scores_gemma":[0.0010908694,0.000144054,0.0005185255,0.0008852315,0.00014218704,0.00024034284,0.0052252794,0.011743996,0.035960812,0.94063765,0.0023336085,0.0010774696],"about_ca_topic_score_codex":0.0000049453297,"about_ca_topic_score_gemma":0.000009315934,"teacher_disagreement_score":0.042111225,"about_ca_system_score_codex":0.00003284753,"about_ca_system_score_gemma":0.0000039943607,"threshold_uncertainty_score":0.5713905},"labels":[],"label_agreement":null},{"id":"W2002806015","doi":"10.1016/s0012-365x(99)00406-9","title":"Enumeration of planar two-face maps","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Antipodal point; Enumeration; Vertex (graph theory); Humanities; Geometry; Art; Graph","score_opus":0.025036320994012477,"score_gpt":0.3005751101780053,"score_spread":0.2755387891839928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002806015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49611807,0.00011060611,0.20236124,0.00056976953,0.00014197877,0.0013298189,0.00032848996,0.00031913322,0.2987209],"genre_scores_gemma":[0.72209847,0.00005463425,0.26835692,0.000094270974,0.00011527151,0.0000504845,0.00007944317,0.00011575307,0.009034794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980499,0.00005168205,0.00086161867,0.00023688836,0.00048030415,0.00031957624],"domain_scores_gemma":[0.99830663,0.0005533246,0.00028550503,0.0006665799,0.00007137561,0.00011658192],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00050727255,0.00026743262,0.000573237,0.00007408385,0.00008217531,0.00004823549,0.0003142387,0.000111262576,0.0020526336],"category_scores_gemma":[0.00028488736,0.00021828566,0.00018615779,0.00019661392,0.00010041838,0.00013750803,0.000031026695,0.0001616159,0.0002422034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016173304,0.0003578909,0.000023339004,0.0007685083,0.00007827706,0.0000066091216,0.0024734316,0.000030932875,0.00088081975,0.9911786,0.001491128,0.0026943001],"study_design_scores_gemma":[0.0005038875,0.00006818705,0.00001523393,0.00021181695,0.00009806324,0.000023640354,0.0003941301,0.027479045,0.0012310381,0.9687234,0.0009480772,0.00030345988],"about_ca_topic_score_codex":0.000008548052,"about_ca_topic_score_gemma":0.000007678159,"teacher_disagreement_score":0.2896861,"about_ca_system_score_codex":0.000025552856,"about_ca_system_score_gemma":0.000023683433,"threshold_uncertainty_score":0.99885964},"labels":[],"label_agreement":null},{"id":"W2002933371","doi":"10.1016/j.disc.2007.11.038","title":"Gray codes for column-convex polyominoes and a new class of distributive lattices","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Polyomino; Mathematics; Combinatorics; Distributive property; Hypercube; Regular polygon; Discrete mathematics; Distributive lattice; Closeness; Lattice (music); Pure mathematics","score_opus":0.06019449949469485,"score_gpt":0.32309253422045353,"score_spread":0.2628980347257587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002933371","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6137813,0.0004905116,0.37831524,0.0003799468,0.00050421664,0.0027493504,0.00064439257,0.00032014985,0.002814939],"genre_scores_gemma":[0.654985,0.00009011674,0.34305906,0.00002473181,0.00017135635,0.00010717949,0.00003111323,0.0001161838,0.0014152699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779564,0.000043232798,0.00092398236,0.0003471121,0.0004346745,0.00045536],"domain_scores_gemma":[0.99541765,0.0027209483,0.00076992984,0.00062264357,0.00025006727,0.00021874736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003516329,0.00039953965,0.0010675982,0.00009505944,0.00021103206,0.000037287573,0.00036381715,0.00017985507,0.00002704492],"category_scores_gemma":[0.0021522902,0.00034422046,0.00018422527,0.00021889868,0.00040574057,0.00021124851,0.00016586254,0.00016185272,0.000007220215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006447368,0.0003275342,0.0003265628,0.0023871087,0.00021104599,0.0000052623845,0.007088649,0.0000025095082,0.001076241,0.98439264,0.0038898361,0.00022813935],"study_design_scores_gemma":[0.001526256,0.0002679891,0.00006835363,0.00031376805,0.00026199484,0.000057233763,0.0017109775,0.0023630094,0.009579012,0.9824824,0.0009274922,0.00044155534],"about_ca_topic_score_codex":0.00001348084,"about_ca_topic_score_gemma":0.000011745086,"teacher_disagreement_score":0.041203722,"about_ca_system_score_codex":0.000055470653,"about_ca_system_score_gemma":0.000121507896,"threshold_uncertainty_score":0.999901},"labels":[],"label_agreement":null},{"id":"W2003367147","doi":"10.1016/j.disc.2007.03.034","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>p</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:math>-Total labelling of graphs","year":2007,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"Centre National de la Recherche Scientifique","keywords":"Conjecture; Combinatorics; Mathematics; Graph; Vertex (graph theory); Discrete mathematics; Algorithm","score_opus":0.019255804216648024,"score_gpt":0.2429960172408542,"score_spread":0.22374021302420619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003367147","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97655267,0.0030747585,0.009106807,0.00056501396,0.0031171287,0.00030721864,0.0008091589,0.0008103389,0.005656907],"genre_scores_gemma":[0.9677074,0.0013410342,0.026787227,0.001079056,0.00083307596,0.00045154226,0.00062504964,0.00094392244,0.00023172448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9820583,0.0005743497,0.0047293385,0.0034071982,0.004952708,0.004278116],"domain_scores_gemma":[0.98631954,0.0027144449,0.0044086296,0.0038809248,0.0007368414,0.0019396316],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.005533184,0.0021583026,0.0013914665,0.0011947406,0.0025087248,0.0024100165,0.00439582,0.0030726616,0.00085314404],"category_scores_gemma":[0.0018068436,0.0030464386,0.0030745869,0.0029407712,0.0024241076,0.0020241446,0.0034313458,0.002926781,0.002295562],"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.00060341705,0.0010940891,0.00003512239,0.002775506,0.0019777762,0.0008466803,0.007583351,0.0037054333,0.004990359,0.96510893,0.007892749,0.0033866146],"study_design_scores_gemma":[0.0035950667,0.0027364546,0.000032480108,0.0046009375,0.0024167309,0.0016130528,0.005116016,0.58222437,0.2529734,0.13962606,0.001429296,0.0036361318],"about_ca_topic_score_codex":0.0013150603,"about_ca_topic_score_gemma":0.00043640344,"teacher_disagreement_score":0.82548285,"about_ca_system_score_codex":0.00006967842,"about_ca_system_score_gemma":0.001326131,"threshold_uncertainty_score":0.9993735},"labels":[],"label_agreement":null},{"id":"W2003983076","doi":"10.1016/j.disc.2009.03.022","title":"A non-commutative generalization of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-Schur functions","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; York University","funders":"","keywords":"Mathematics; Generalization; Commutative property; Morse code; Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.022137433859481824,"score_gpt":0.2780651951637209,"score_spread":0.2559277613042391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003983076","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8974475,0.00009938825,0.09520698,0.00020003409,0.0006523969,0.00029815247,0.00014950155,0.00027240816,0.0056736018],"genre_scores_gemma":[0.9021037,0.00009670518,0.096021265,0.00021303813,0.0004250776,0.00024355332,0.00023473274,0.00026682473,0.00039507993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99569875,0.00010004126,0.0016037079,0.00061448215,0.0011931038,0.00078991137],"domain_scores_gemma":[0.99518454,0.0010055263,0.0016173677,0.0016454989,0.00027165224,0.0002754379],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007987301,0.00065917545,0.0007104165,0.00021002484,0.0005110627,0.00020998079,0.00081195653,0.0005523659,0.00006880477],"category_scores_gemma":[0.0015586176,0.0007129604,0.0006246754,0.0006413798,0.00031080187,0.0006055625,0.00039504227,0.0005921848,0.00040794653],"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.00009467814,0.00064999127,0.0000041207923,0.0011041751,0.0003071438,0.000043420958,0.0051374366,0.00087270094,0.0022059893,0.98846096,0.0008987876,0.00022058275],"study_design_scores_gemma":[0.0011179199,0.00057312753,0.0000132023715,0.0008366492,0.00059352844,0.00010902058,0.002099695,0.7221015,0.0100366445,0.2615568,0.00033773563,0.0006241441],"about_ca_topic_score_codex":0.000024730474,"about_ca_topic_score_gemma":0.000026128408,"teacher_disagreement_score":0.72690415,"about_ca_system_score_codex":0.000057652393,"about_ca_system_score_gemma":0.00023943177,"threshold_uncertainty_score":0.99953216},"labels":[],"label_agreement":null},{"id":"W2004306511","doi":"10.1016/j.disc.2004.04.024","title":"Relational structures having finitely many full-cardinality restrictions","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cardinality (data modeling); Mathematics; Isomorphism (crystallography); Class (philosophy); Construct (python library); Cardinal number (linguistics); Combinatorics; Discrete mathematics; Computer science","score_opus":0.07608432136565828,"score_gpt":0.3396243388228705,"score_spread":0.26354001745721223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004306511","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.3964137,0.000259795,0.5550345,0.0018403375,0.00034228954,0.0005479138,0.00013476297,0.0005393874,0.044887267],"genre_scores_gemma":[0.579667,0.000017440483,0.4160435,0.00012199556,0.00036358632,0.000032348715,0.00003299921,0.000053173237,0.0036679811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839985,0.000099290504,0.00056862494,0.00027644794,0.00031501325,0.00034079485],"domain_scores_gemma":[0.9979311,0.0010588057,0.00026168246,0.0005630187,0.00008461621,0.00010078009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044317436,0.00024990944,0.0003472395,0.000109321256,0.0003803815,0.000031559623,0.00023409257,0.00019178925,0.00064464787],"category_scores_gemma":[0.0009723786,0.0002182154,0.00018131477,0.0001808369,0.00019159973,0.00023829083,0.00010080903,0.0003785401,0.00013151011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017568364,0.00007297514,0.0001691014,0.000066981425,0.00006730517,0.000005778944,0.0011694186,0.0002476171,0.00014053256,0.9963661,0.0012627249,0.00041393237],"study_design_scores_gemma":[0.0002952258,0.000029252644,0.00061059085,0.000039855302,0.000107808686,0.00008898905,0.0005697562,0.0037443119,0.00024838388,0.9887085,0.00529058,0.0002667493],"about_ca_topic_score_codex":0.0000020152086,"about_ca_topic_score_gemma":0.000014927498,"teacher_disagreement_score":0.18325327,"about_ca_system_score_codex":0.000080190875,"about_ca_system_score_gemma":0.00003680488,"threshold_uncertainty_score":0.8898566},"labels":[],"label_agreement":null},{"id":"W2004911149","doi":"10.1016/j.disc.2006.03.036","title":"Building blocks for the variety of absolute retracts","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"","keywords":"Mathematics; Variety (cybernetics); Absolute (philosophy); Combinatorics; Discrete mathematics; Statistics","score_opus":0.023892377948431385,"score_gpt":0.30585175003877385,"score_spread":0.28195937209034244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004911149","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.0065263417,0.0001359901,0.9904396,0.00036390725,0.0000642305,0.00037929762,0.00001006743,0.00006934023,0.0020112102],"genre_scores_gemma":[0.40179035,0.0000064342066,0.5974627,0.000026196632,0.000052301548,0.00003680599,0.000001188319,0.000015753647,0.0006082639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988016,0.000022565637,0.00032406548,0.00019876889,0.00034492408,0.0003081058],"domain_scores_gemma":[0.99772066,0.0011417724,0.00017969204,0.00079424656,0.00012698228,0.00003666244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000827941,0.000117393014,0.00018354299,0.000056603312,0.0001664226,0.00008169428,0.0011037502,0.000048402042,0.000005322347],"category_scores_gemma":[0.00020947463,0.00007693495,0.00012747574,0.00034106328,0.00012836719,0.0001840829,0.00022946791,0.00012452573,0.000003284091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039066726,0.000037833233,0.000011272491,0.00007375646,0.000018333534,9.760223e-7,0.00029745913,0.0006280504,0.0025078622,0.99488246,0.0005635773,0.000974512],"study_design_scores_gemma":[0.00016992954,0.000038472353,0.00012701999,0.00003443954,0.000012103161,0.0000067865285,0.000047218553,0.23859733,0.007696685,0.7514897,0.0016759811,0.00010435057],"about_ca_topic_score_codex":0.0000093765075,"about_ca_topic_score_gemma":0.0000031281445,"teacher_disagreement_score":0.39526403,"about_ca_system_score_codex":0.0000171443,"about_ca_system_score_gemma":0.000029236666,"threshold_uncertainty_score":0.3137316},"labels":[],"label_agreement":null},{"id":"W2005291561","doi":"10.1016/j.disc.2008.05.050","title":"Secure domination critical graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Dominating set; Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.029806303907930015,"score_gpt":0.3212700661383915,"score_spread":0.29146376223046144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005291561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020839904,0.000080452606,0.96909285,0.00072738103,0.000108524466,0.00016334133,0.0000040314085,0.00019459268,0.008788941],"genre_scores_gemma":[0.7204649,0.000024445437,0.27902156,0.000078815065,0.000023751329,0.000023980356,0.0000024506148,0.000015273543,0.0003448471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862635,0.000062680985,0.00023228982,0.00026135953,0.00048902154,0.00032828632],"domain_scores_gemma":[0.998629,0.0004231624,0.000049608,0.0006418271,0.00013359268,0.00012286377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031011435,0.0001322266,0.000166474,0.00014113646,0.00024092216,0.00006689686,0.00076223386,0.00005735777,0.0000326986],"category_scores_gemma":[0.0004783516,0.00011151644,0.0000906266,0.00048971537,0.000249437,0.00050692324,0.00022071158,0.00017538114,0.00013689742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019072462,0.00005343241,0.000038673734,0.000042007123,0.000006075523,0.000040305153,0.0019575949,0.000007916792,0.0003538138,0.9966126,0.00028974825,0.0005959342],"study_design_scores_gemma":[0.00018712855,0.00005602332,0.00014700479,0.000028146465,0.000003898586,0.00014942703,0.00013334883,0.03777669,0.002299034,0.9586275,0.0004040564,0.00018771659],"about_ca_topic_score_codex":6.5644485e-7,"about_ca_topic_score_gemma":5.492887e-7,"teacher_disagreement_score":0.69962496,"about_ca_system_score_codex":0.000021392552,"about_ca_system_score_gemma":0.000032119784,"threshold_uncertainty_score":0.45475087},"labels":[],"label_agreement":null},{"id":"W2005448597","doi":"10.1016/j.disc.2005.02.023","title":"On a new class of productive regular Hadamard matrices","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Hadamard transform; Prime power; Corollary; Combinatorics; Hadamard matrix; Order (exchange); Class (philosophy); Integer (computer science); Prime (order theory); Hadamard's inequality; Hadamard's maximal determinant problem; Discrete mathematics; Matrix (chemical analysis); Computer science","score_opus":0.006219342849004023,"score_gpt":0.19458562041908972,"score_spread":0.1883662775700857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005448597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.907569,0.00063460815,0.015736649,0.00007430221,0.00033146093,0.00048159508,0.000027810212,0.0003300648,0.0748145],"genre_scores_gemma":[0.99558234,0.0000055263386,0.00277566,0.0000041624885,0.00011439197,0.0000105183135,0.000007109165,0.000036773396,0.0014635213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992259,0.00001754563,0.00029486025,0.00011560131,0.00018819504,0.00015788476],"domain_scores_gemma":[0.9994678,0.0000615425,0.00007781717,0.00033322893,0.000023692899,0.00003590856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014228754,0.00014693693,0.00024378384,0.00008071855,0.000024781451,0.000018718178,0.00014050864,0.000058149584,0.000028199993],"category_scores_gemma":[0.000023084991,0.00012246834,0.00008672425,0.0001885729,0.00003387222,0.000060576098,0.000012866922,0.000075943535,0.00003891128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017570614,0.00008376576,0.00005544692,0.0012476654,0.00011190991,0.0000062000563,0.0017577837,0.012791717,0.008939426,0.9596544,0.014943077,0.00039104483],"study_design_scores_gemma":[0.0006584537,0.00015489217,0.00027639276,0.00069645536,0.00012578767,0.000023300321,0.0013389849,0.01797355,0.08473537,0.8879869,0.0054149106,0.00061498943],"about_ca_topic_score_codex":0.000011344568,"about_ca_topic_score_gemma":0.000003533563,"teacher_disagreement_score":0.08801333,"about_ca_system_score_codex":0.000018005901,"about_ca_system_score_gemma":0.000008208512,"threshold_uncertainty_score":0.49941137},"labels":[],"label_agreement":null},{"id":"W2005620597","doi":"10.1016/j.disc.2006.09.042","title":"Reachability problems in edge-colored digraphs","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Reachability; Tournament; Vertex (graph theory); Colored; Monochromatic color; Discrete mathematics; Arc (geometry); Graph; Geometry; Physics","score_opus":0.02504517896934749,"score_gpt":0.3048842009482493,"score_spread":0.2798390219789018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005620597","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.13971218,0.00008392413,0.8449051,0.00019526287,0.00008857245,0.0006212532,0.0000026317084,0.00019186149,0.0141992],"genre_scores_gemma":[0.8539986,0.000009129306,0.14558464,0.000042214546,0.00001932238,0.00004059157,0.0000026482319,0.000019706664,0.0002831542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979281,0.00007215801,0.0005124563,0.0004121757,0.00045998348,0.00061513326],"domain_scores_gemma":[0.9980828,0.0005161921,0.00011655432,0.0010603055,0.00007968734,0.00014443006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026344361,0.00017981217,0.00026174798,0.00028882688,0.000079383164,0.000086675886,0.0011388579,0.000082645995,0.000011202662],"category_scores_gemma":[0.0003601623,0.00015096288,0.00009570644,0.0011463452,0.00018098722,0.00040445582,0.00036044949,0.00028391444,0.000045939112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013831228,0.00038918637,0.0063929856,0.00027557433,0.000017813638,0.000036317255,0.009625424,0.00012373283,0.0024564406,0.96662474,0.0000533484,0.013990593],"study_design_scores_gemma":[0.0004227529,0.000102479265,0.005745916,0.000087365996,0.0000029021771,0.000014043078,0.00042542507,0.014752449,0.0026387195,0.97502047,0.00048866996,0.00029880577],"about_ca_topic_score_codex":0.000012167793,"about_ca_topic_score_gemma":0.0000918885,"teacher_disagreement_score":0.7142864,"about_ca_system_score_codex":0.000073122734,"about_ca_system_score_gemma":0.000033967033,"threshold_uncertainty_score":0.61560875},"labels":[],"label_agreement":null},{"id":"W2005654899","doi":"10.1016/s0012-365x(03)00061-x","title":"Properties of the descent algebras of type D","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Descent (aeronautics); Type (biology); Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.056674891401938494,"score_gpt":0.2861594209379431,"score_spread":0.22948452953600462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005654899","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97779053,0.00027543717,0.009141778,0.00006258778,0.00064197794,0.0010058891,0.0000083004215,0.00007602663,0.010997498],"genre_scores_gemma":[0.93972623,0.000012412116,0.059694573,0.000010779038,0.000017069462,0.0000146434895,3.2616566e-7,0.000058062735,0.00046591202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980533,0.000107635155,0.00086061197,0.00016255373,0.00055649295,0.0002593671],"domain_scores_gemma":[0.99761987,0.0002910413,0.0006993264,0.0010382549,0.00029781772,0.000053716467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047560924,0.00024001341,0.00056162395,0.000052702126,0.000070413735,0.000011772045,0.00049712416,0.00009715218,0.00005258034],"category_scores_gemma":[0.003681384,0.00014649019,0.00019108584,0.00041697605,0.00024757808,0.000077841665,0.00013367596,0.0001568259,0.000009453517],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007792486,0.00031118985,0.00010840995,0.0015888507,0.000062929685,4.4293265e-7,0.0023911556,0.000010679495,0.013367403,0.9819716,0.0001492248,0.000030276644],"study_design_scores_gemma":[0.00027689373,0.000051285217,0.00000867447,0.00054210133,0.00009724524,0.000009320109,0.0009056514,0.00020745554,0.2645657,0.73302686,0.00015511109,0.00015366937],"about_ca_topic_score_codex":0.0000015296112,"about_ca_topic_score_gemma":0.0000016983054,"teacher_disagreement_score":0.2511983,"about_ca_system_score_codex":0.000041891224,"about_ca_system_score_gemma":0.00009935242,"threshold_uncertainty_score":0.5973697},"labels":[],"label_agreement":null},{"id":"W2006169827","doi":"10.1016/j.disc.2003.12.014","title":"The k-fractal of a simplicial complex","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; Dalhousie University","funders":"","keywords":"Mathematics; Fractal; Mandelbrot set; Simplicial complex; Julia set; Combinatorics; Polynomial; Function (biology); Discrete mathematics; Set (abstract data type); Complex quadratic polynomial; Mathematical analysis","score_opus":0.047204029777975075,"score_gpt":0.33046176431079033,"score_spread":0.2832577345328153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006169827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54299206,0.00009436982,0.3540437,0.0026305611,0.00027698002,0.0016859287,0.00015527684,0.0002899183,0.097831234],"genre_scores_gemma":[0.9211017,0.0000199522,0.07831641,0.00005808863,0.000082938575,0.00003393077,0.000008955485,0.00006191614,0.00031613023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792403,0.00003195701,0.00089913193,0.00019245487,0.00054580485,0.00040662542],"domain_scores_gemma":[0.9972585,0.0012814825,0.00047030504,0.00074690406,0.00012957734,0.00011321846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064366346,0.00025601313,0.00050827506,0.000049279075,0.000248979,0.00007747914,0.0005425709,0.00010423203,0.000100721765],"category_scores_gemma":[0.0012017625,0.00015836336,0.0002626606,0.00021248501,0.0002984439,0.000080081765,0.00016899504,0.0001932427,0.000050793886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009961039,0.00024040029,0.000007426654,0.00027290836,0.00006335086,0.000003607134,0.0010934379,0.00001268352,0.0011166604,0.99632186,0.00032591645,0.0005317978],"study_design_scores_gemma":[0.00045683916,0.00007274908,0.00006456535,0.000109403576,0.00006409807,0.000023045042,0.0007557489,0.0045027905,0.0006591154,0.99231195,0.00077372737,0.00020595727],"about_ca_topic_score_codex":0.000010984194,"about_ca_topic_score_gemma":0.000029969633,"teacher_disagreement_score":0.37810963,"about_ca_system_score_codex":0.000046265235,"about_ca_system_score_gemma":0.000054913933,"threshold_uncertainty_score":0.64578706},"labels":[],"label_agreement":null},{"id":"W2006258407","doi":"10.1016/j.disc.2005.12.027","title":"Un des “problèmes plaisans et délectables” de Claude Berge","year":2006,"lang":"fr","type":"article","venue":"Discrete Mathematics","topic":"History and Theory of Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Combinatorics; Humanities; Philosophy","score_opus":0.022005566195245557,"score_gpt":0.2752520917819775,"score_spread":0.25324652558673194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006258407","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.21540447,0.012947591,0.42623827,0.0026376399,0.0011723229,0.0016065742,0.0006035558,0.0008636255,0.33852595],"genre_scores_gemma":[0.15177226,0.00062024384,0.7087967,0.00043309905,0.00086300634,0.00017531418,0.00013136887,0.0006365107,0.1365715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99419934,0.00067351427,0.0018363888,0.0006864354,0.0008567586,0.0017475549],"domain_scores_gemma":[0.9947004,0.0022898717,0.000933353,0.0014215689,0.00024124476,0.0004136128],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0031602965,0.0011041147,0.0014095572,0.00026475106,0.0008523696,0.00033082772,0.00095477677,0.00074548647,0.0035023557],"category_scores_gemma":[0.0011516295,0.0011134932,0.0006907416,0.000579339,0.001298626,0.0005833944,0.00027849418,0.00091869343,0.0011537223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029328718,0.0021274192,0.00009244822,0.0067280135,0.00031380058,0.00014608171,0.018841151,0.00029336553,0.000891093,0.9465893,0.022809563,0.0011384331],"study_design_scores_gemma":[0.0010154865,0.00016436013,0.000045506935,0.0021975108,0.0008663195,0.00045265918,0.0022480846,0.0077072144,0.0049914285,0.93083775,0.04827926,0.0011944142],"about_ca_topic_score_codex":0.0001812733,"about_ca_topic_score_gemma":0.00042673943,"teacher_disagreement_score":0.2825584,"about_ca_system_score_codex":0.0006210247,"about_ca_system_score_gemma":0.0003297139,"threshold_uncertainty_score":0.999624},"labels":[],"label_agreement":null},{"id":"W2006528126","doi":"10.1016/j.disc.2007.11.062","title":"Factor-critical property in 3-dominating-critical graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Mathematics; Dominating set; Vertex (graph theory); Discrete mathematics; Conjecture; Neighbourhood (mathematics); Graph","score_opus":0.05002103674915585,"score_gpt":0.33888864272112684,"score_spread":0.288867605971971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006528126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08506288,0.00015926003,0.9000688,0.0015577606,0.00022727788,0.00054653065,0.000014414927,0.00032523624,0.012037834],"genre_scores_gemma":[0.8151318,0.000015531528,0.18438832,0.00007215625,0.000019297893,0.00004337578,0.0000010544837,0.000023424363,0.00030502686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975628,0.00015412597,0.00046581044,0.00046164033,0.00066956197,0.00068605377],"domain_scores_gemma":[0.9974764,0.0013109379,0.000042358017,0.00081425626,0.00014109789,0.00021494745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042725148,0.00022828476,0.00034134756,0.00024870224,0.00021238066,0.000099182704,0.0011233531,0.00009200382,0.000050907358],"category_scores_gemma":[0.002161737,0.0001560296,0.00011698484,0.00072874833,0.0006406998,0.0006504143,0.00043904906,0.00040804618,0.000114152506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006861524,0.00023337468,0.00068482157,0.00017230553,0.0000061354785,0.0002487788,0.0036400245,0.000006528784,0.0007829169,0.99256027,0.00007157131,0.0015864255],"study_design_scores_gemma":[0.00054966076,0.00018599669,0.0011826844,0.00024156233,0.000004674992,0.00031194463,0.00040602253,0.09014376,0.002898665,0.9032735,0.00024938548,0.00055212644],"about_ca_topic_score_codex":0.0000054219213,"about_ca_topic_score_gemma":0.0000036076196,"teacher_disagreement_score":0.7300689,"about_ca_system_score_codex":0.000049813225,"about_ca_system_score_gemma":0.00007156692,"threshold_uncertainty_score":0.6362702},"labels":[],"label_agreement":null},{"id":"W2006836809","doi":"10.1016/j.disc.2003.11.006","title":"The largest non-integer real zero of chromatic polynomials of graphs with fixed order","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Integer (computer science); Discrete mathematics; Graph; Vertex (graph theory); Chromatic polynomial; Windmill graph; Order (exchange); Voltage graph; Line graph","score_opus":0.01586986971397748,"score_gpt":0.28015439506926204,"score_spread":0.26428452535528457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006836809","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9509794,0.000036277346,0.03992648,0.0002529658,0.00003793527,0.0008477273,0.00006172164,0.000061815896,0.007795684],"genre_scores_gemma":[0.950095,0.000052493837,0.04949311,0.000013292145,0.000013041677,0.00008819188,0.000008460567,0.00005005054,0.00018637665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835724,0.000045617267,0.0007833011,0.00018074154,0.00034909952,0.0002840004],"domain_scores_gemma":[0.9973032,0.00082882575,0.00066436717,0.0009343778,0.00019857394,0.00007064996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056145404,0.0002431817,0.0005246498,0.00008157988,0.00018560147,0.0000266523,0.0004557212,0.00008959413,0.000027843977],"category_scores_gemma":[0.00025627355,0.00014224686,0.00016535561,0.00049485767,0.00044685364,0.00007460468,0.00006607008,0.00013919329,0.00001242384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024944682,0.00028991004,0.00010463544,0.00049604115,0.00014656334,0.000001049888,0.0021800753,0.000031089217,0.005554326,0.9909812,0.00015463341,0.000035526085],"study_design_scores_gemma":[0.0007423251,0.00013523559,0.00019444924,0.00040712216,0.00019211262,0.000013276743,0.0015007383,0.00012052326,0.028301682,0.96816313,0.000035256562,0.00019415181],"about_ca_topic_score_codex":0.00003933422,"about_ca_topic_score_gemma":0.00005075912,"teacher_disagreement_score":0.022818077,"about_ca_system_score_codex":0.000025097392,"about_ca_system_score_gemma":0.000082465995,"threshold_uncertainty_score":0.58006585},"labels":[],"label_agreement":null},{"id":"W2006938312","doi":"10.1016/j.disc.2005.03.024","title":"Brian Alspach and his work","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Lethbridge","funders":"","keywords":"Mathematics; Work (physics); Discrete mathematics; Mathematical economics; Calculus (dental); Engineering; Medicine","score_opus":0.02155731934103933,"score_gpt":0.2930603300607516,"score_spread":0.2715030107197123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006938312","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.03492759,0.00040875323,0.94783485,0.0028272031,0.000054694894,0.00023557614,0.000003204252,0.00020669328,0.013501444],"genre_scores_gemma":[0.39949334,0.000036458398,0.59788334,0.0001909401,0.00007291081,0.00001733405,0.0000014912995,0.000021128462,0.0022830488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895364,0.00003738037,0.00018679154,0.00024557443,0.00027337208,0.0003032417],"domain_scores_gemma":[0.99898636,0.00017114825,0.000060006023,0.0006167614,0.00003584099,0.00012989387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036237587,0.00012277206,0.00015706055,0.00008385769,0.00010684177,0.00015732678,0.0005901906,0.000040504372,0.000035335965],"category_scores_gemma":[0.00009410069,0.000102267164,0.000041635318,0.00034336213,0.000098577475,0.0003590546,0.00033134487,0.00012732475,0.00015790736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040900577,0.000056263092,0.0002771396,0.00005184914,0.00002099339,0.00000953547,0.0037481685,0.000050700906,0.0002528132,0.94029313,0.0011282453,0.054107074],"study_design_scores_gemma":[0.00089504156,0.00012936043,0.0011344859,0.00019635801,0.000020380947,0.00010475855,0.00048613417,0.10718475,0.0037331402,0.8444947,0.040734112,0.0008867867],"about_ca_topic_score_codex":8.12297e-7,"about_ca_topic_score_gemma":0.0000024299914,"teacher_disagreement_score":0.36456576,"about_ca_system_score_codex":0.000022093125,"about_ca_system_score_gemma":0.000014102193,"threshold_uncertainty_score":0.4170334},"labels":[],"label_agreement":null},{"id":"W2007327392","doi":"10.1016/s0012-365x(02)00349-7","title":"A partition-based approach towards constructing Galois (concept) lattices","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Lattice Miner; Binary relation; Formal concept analysis; Binary number; Mathematics; Lattice (music); Complete lattice; Galois theory; Concept class; Computer science; Theoretical computer science; Algorithm; Discrete mathematics; Universality (dynamical systems); Arithmetic","score_opus":0.04802399937323873,"score_gpt":0.25012380704321985,"score_spread":0.20209980766998112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007327392","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.003930466,0.00017097691,0.89141935,0.00062106975,0.00013701495,0.00020736687,0.000010045706,0.0002759787,0.10322773],"genre_scores_gemma":[0.49023387,0.0000044870317,0.50939,0.00021328869,0.00004911351,0.000018921934,0.000004492041,0.00001013354,0.00007568098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986654,0.000042323365,0.0003229262,0.00031340623,0.0003302594,0.000325697],"domain_scores_gemma":[0.9989769,0.00011707291,0.00017049015,0.0005830867,0.00005017627,0.000102289676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019678382,0.0001826521,0.00024482113,0.000057453755,0.00015215675,0.0003057038,0.0006390156,0.00006703125,0.00013947263],"category_scores_gemma":[0.00008130662,0.0001413289,0.0001077176,0.00028825743,0.00011740757,0.000279419,0.0001119145,0.00012606596,0.00009636985],"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.0000037747989,0.0009287549,0.0008001346,0.0008226787,0.00014686771,0.00006948253,0.030437863,0.003607719,0.0001798919,0.86781603,0.00514586,0.090040915],"study_design_scores_gemma":[0.00032838059,0.000049031947,0.00003512336,0.000048881837,0.000018186784,0.000025378995,0.0006365496,0.9829354,0.00042423105,0.014456061,0.0007485421,0.00029419988],"about_ca_topic_score_codex":0.00000775748,"about_ca_topic_score_gemma":8.233351e-7,"teacher_disagreement_score":0.97932774,"about_ca_system_score_codex":0.000023816014,"about_ca_system_score_gemma":0.000020465242,"threshold_uncertainty_score":0.57632256},"labels":[],"label_agreement":null},{"id":"W2007802322","doi":"10.1016/j.disc.2006.04.015","title":"A combinatorial proof of a result of Gessel and Greene","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorial proof; Mathematics; Combinatorics; Combinatorial analysis; Discrete mathematics","score_opus":0.020513559344965203,"score_gpt":0.28810079763760044,"score_spread":0.26758723829263525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007802322","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9073087,0.00027617274,0.07042513,0.00012114647,0.00051404623,0.0015783833,0.000115472176,0.00016409597,0.01949686],"genre_scores_gemma":[0.89280206,0.000007742966,0.10677481,0.0000030853369,0.00010275613,0.000034440636,0.000007162242,0.00007483913,0.00019309357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973521,0.00006116776,0.0013517359,0.00027262743,0.00064130366,0.00032101697],"domain_scores_gemma":[0.99668264,0.0010560076,0.0010992478,0.00076287106,0.00032315613,0.00007609579],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059537694,0.00032635298,0.000970825,0.00013641566,0.000059676553,0.000018932755,0.00033854472,0.00017351567,0.000020647472],"category_scores_gemma":[0.0011436632,0.00028276903,0.00014798604,0.00030645,0.00029986416,0.00013865755,0.00020495617,0.00017197954,0.0000020267896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003801371,0.0006389167,0.000078986544,0.0025825219,0.000054988246,0.000003912575,0.001033252,0.00000631427,0.0043655336,0.9908632,0.00022090363,0.0001134808],"study_design_scores_gemma":[0.0014241858,0.00018980318,0.00003210809,0.0004109467,0.00014025942,0.000015596926,0.00033998245,0.0008843047,0.063521065,0.9327137,0.00007283809,0.00025522034],"about_ca_topic_score_codex":0.000022198124,"about_ca_topic_score_gemma":0.000005577289,"teacher_disagreement_score":0.059155528,"about_ca_system_score_codex":0.000033911037,"about_ca_system_score_gemma":0.0000525304,"threshold_uncertainty_score":0.99996245},"labels":[],"label_agreement":null},{"id":"W2008148950","doi":"10.1016/j.disc.2003.11.016","title":"Bicolouring Steiner systems S(2,4,v)","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Steiner system; Combinatorics; Block (permutation group theory); Discrete mathematics","score_opus":0.008656548377924686,"score_gpt":0.19543831530461134,"score_spread":0.18678176692668666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008148950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8829991,0.0012022537,0.059547722,0.00002880826,0.0011704745,0.000445133,0.000017766462,0.0010716616,0.05351709],"genre_scores_gemma":[0.9983654,0.000013816948,0.0011104187,0.000006278267,0.000103341765,0.000041319294,0.0000042130587,0.00005318314,0.0003020504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991655,0.000012164224,0.00029359807,0.000107390595,0.0001660989,0.0002552658],"domain_scores_gemma":[0.9995224,0.000028760116,0.00003770033,0.00031406689,0.00001894596,0.000078138095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017817933,0.00017186826,0.0002267193,0.00007419269,0.00005918173,0.0000760483,0.0001697729,0.0000736494,0.00001640616],"category_scores_gemma":[0.000013208774,0.00014591386,0.00007648672,0.0001545123,0.00002718358,0.00010143598,0.000020588584,0.00010837195,0.00023242984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031735885,0.000061911276,0.000054317108,0.0020530245,0.00017486612,0.00004179503,0.004424543,0.257544,0.008643295,0.7264278,0.0003696027,0.00020167207],"study_design_scores_gemma":[0.00849639,0.0005177732,0.00058460556,0.00752908,0.0004983477,0.0012239685,0.03469734,0.39404804,0.08261731,0.40738672,0.055455614,0.0069448138],"about_ca_topic_score_codex":0.0000054069974,"about_ca_topic_score_gemma":0.0000019354713,"teacher_disagreement_score":0.31904107,"about_ca_system_score_codex":0.000047286532,"about_ca_system_score_gemma":0.0000066378957,"threshold_uncertainty_score":0.59501946},"labels":[],"label_agreement":null},{"id":"W2008497326","doi":"10.1016/j.disc.2003.11.023","title":"Grooming in unidirectional rings: K4−e designs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"Army Research Office; Centre National de la Recherche Scientifique","keywords":"Multiplexer; Traffic grooming; Mathematics; Multiplexing; Graph; Topology (electrical circuits); Wavelength; Wavelength-division multiplexing; Combinatorics; Discrete mathematics; Telecommunications; Computer science; Optics; Physics","score_opus":0.01838417251832559,"score_gpt":0.23874658703483437,"score_spread":0.2203624145165088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008497326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17787243,0.0002486136,0.8082532,0.0000929503,0.00013721247,0.00019267407,0.0000031708469,0.00130508,0.011894607],"genre_scores_gemma":[0.5834205,0.00004604717,0.41641372,0.000009152955,0.000025773994,0.000023549683,0.000002060096,0.00003353843,0.000025666113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999305,0.0000031662019,0.00021696732,0.0001082042,0.0001124119,0.0002542303],"domain_scores_gemma":[0.9996715,0.00007645137,0.00002751661,0.00018128834,0.000010626666,0.00003262389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000760912,0.00013337401,0.00016139499,0.00008788773,0.000030130492,0.0000182078,0.0001412022,0.00008323821,0.000012460219],"category_scores_gemma":[0.00011975263,0.0001282688,0.000034634904,0.0002621299,0.0000529026,0.00010791076,0.00004073783,0.00019555034,0.00004116231],"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.000002946412,0.00005246026,0.00021229411,0.00020036822,0.000023412062,0.000032624925,0.0007699707,0.7619612,0.002532077,0.23100194,0.000050462164,0.0031602439],"study_design_scores_gemma":[0.000839843,0.000053075368,0.0004930726,0.00054200256,0.000020506312,0.000042096213,0.0013496726,0.21137473,0.012193617,0.7717956,0.0005944807,0.0007013396],"about_ca_topic_score_codex":0.0000015005566,"about_ca_topic_score_gemma":0.000012301151,"teacher_disagreement_score":0.55058646,"about_ca_system_score_codex":0.00013892667,"about_ca_system_score_gemma":0.0000065026607,"threshold_uncertainty_score":0.52306503},"labels":[],"label_agreement":null},{"id":"W2009210880","doi":"10.1016/s0012-365x(01)00280-1","title":"On centroid branches of trees from certain families","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; York University","funders":"","keywords":"Mathematics; Centroid; Combinatorics; Tree (set theory); Discrete mathematics; Geometry","score_opus":0.039534289960439464,"score_gpt":0.2720989982179498,"score_spread":0.23256470825751036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009210880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96125776,0.00011132944,0.007236257,0.00028655192,0.000047444115,0.00035959404,0.00021616918,0.00013245286,0.030352447],"genre_scores_gemma":[0.980206,0.00003901309,0.018805873,0.000047493806,0.000037272417,0.00003692428,0.000015542122,0.00003663957,0.00077521213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988437,0.00004778054,0.00044692738,0.00019755644,0.00025531283,0.00020869912],"domain_scores_gemma":[0.9976826,0.0013195043,0.00023505122,0.0006614672,0.00003757198,0.00006385814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001421696,0.00020224822,0.00036787023,0.000080893,0.00009157786,0.000022026647,0.00029182492,0.00007825675,0.0006869264],"category_scores_gemma":[0.00033535078,0.00016236714,0.00017097725,0.00018228606,0.00013469892,0.000056584897,0.000040298415,0.00011427652,0.00012518994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006818399,0.00039017468,0.00006369041,0.00010417197,0.00006167615,9.841586e-7,0.004514455,0.000007982262,0.001944994,0.98991424,0.0023645516,0.0006262885],"study_design_scores_gemma":[0.00031642916,0.000045511275,0.00008541244,0.00013399024,0.00007300512,0.0000011580445,0.0017685527,0.0024438968,0.008467262,0.9859445,0.0005386899,0.00018159032],"about_ca_topic_score_codex":0.000007010908,"about_ca_topic_score_gemma":0.000017094648,"teacher_disagreement_score":0.029577235,"about_ca_system_score_codex":0.000012661787,"about_ca_system_score_gemma":0.000003899696,"threshold_uncertainty_score":0.75213623},"labels":[],"label_agreement":null},{"id":"W2009261722","doi":"10.1016/s0012-365x(01)00369-7","title":"Total domination in complements of graphs containing no K4,4","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.03916226416454757,"score_gpt":0.3101956242073229,"score_spread":0.27103336004277534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009261722","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.46465752,0.00011741654,0.5042656,0.00019824017,0.00016107867,0.00070244033,0.000015917114,0.000102560116,0.029779265],"genre_scores_gemma":[0.91301453,0.000007968742,0.08674163,0.000014597016,0.0000058905066,0.000016462323,0.000002369617,0.00000892405,0.00018762637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987416,0.00006275507,0.00037837558,0.00018594606,0.0003744615,0.00025681444],"domain_scores_gemma":[0.9990148,0.000227239,0.00019802806,0.00041682503,0.000094521216,0.000048620383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044427702,0.00010628358,0.00021101312,0.00021486175,0.000045583078,0.000038217768,0.00051840534,0.000030037556,0.00007950469],"category_scores_gemma":[0.00020712365,0.00009705016,0.000057747187,0.0004663901,0.000074905314,0.00031292654,0.00020710495,0.000107711814,0.000050760038],"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.000008761116,0.00019212239,0.001223076,0.0001394057,0.000019960036,0.00001270559,0.0063174325,0.000114941984,0.002234398,0.9832919,0.00006739736,0.006377869],"study_design_scores_gemma":[0.0013378981,0.00027200696,0.0015186175,0.00018939626,0.0000054284974,0.000013712594,0.00072876096,0.62338954,0.0025236898,0.3696554,0.00008451653,0.000281033],"about_ca_topic_score_codex":0.000003917153,"about_ca_topic_score_gemma":0.0000034429881,"teacher_disagreement_score":0.6232746,"about_ca_system_score_codex":0.000027717997,"about_ca_system_score_gemma":0.0000063974517,"threshold_uncertainty_score":0.39575905},"labels":[],"label_agreement":null},{"id":"W2009319947","doi":"10.1016/s0012-365x(01)00108-x","title":"On the existence of a point subset with a specified number of interior points","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Convex hull; Point (geometry); Boundary (topology); Plane (geometry); Set (abstract data type); Finite set; Interior point method; Regular polygon; Discrete mathematics; Geometry; Mathematical analysis; Algorithm","score_opus":0.027464334030066536,"score_gpt":0.26784157861687574,"score_spread":0.2403772445868092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009319947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4992602,0.0000056114804,0.49279994,0.00053722865,0.000035294408,0.00012895493,0.0000035308296,0.000014143539,0.007215111],"genre_scores_gemma":[0.91699255,0.000003910552,0.082700394,0.00008675392,0.000013349432,0.0000075289227,0.0000023368877,0.000005182344,0.00018802307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991734,0.000033737084,0.0002599105,0.00013273026,0.00030135334,0.000098846715],"domain_scores_gemma":[0.99905753,0.00025653178,0.00014757688,0.00040121717,0.000109371984,0.000027796268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025608207,0.00009065429,0.00015267884,0.000043466844,0.00003525848,0.000030117557,0.0003803417,0.000018962912,0.000062991596],"category_scores_gemma":[0.00007741703,0.000053179476,0.000050304865,0.00035166196,0.00006037909,0.000105351384,0.00007869526,0.00005429372,0.00002028475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038907547,0.000085293446,0.00011865897,0.00006322954,0.00002973734,0.0000063234684,0.0030731622,0.00015209995,0.0010978208,0.9938899,0.00024175964,0.0012030939],"study_design_scores_gemma":[0.0012152931,0.00094315637,0.0035230962,0.0011950693,0.00005672638,0.00044343073,0.001839164,0.2647711,0.08846625,0.63629204,0.00059179106,0.0006628483],"about_ca_topic_score_codex":0.0000024548426,"about_ca_topic_score_gemma":0.0000031338946,"teacher_disagreement_score":0.41773233,"about_ca_system_score_codex":0.000010305909,"about_ca_system_score_gemma":0.000025180327,"threshold_uncertainty_score":0.21685961},"labels":[],"label_agreement":null},{"id":"W2010841183","doi":"10.1016/j.disc.2006.11.050","title":"Directed complete bipartite graph decompositions: Indirect constructions","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Mathematics; Bipartite graph; Combinatorics; Complete bipartite graph; Discrete mathematics; Graph","score_opus":0.014052312043487284,"score_gpt":0.22950789611474717,"score_spread":0.2154555840712599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010841183","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7672166,0.0004915908,0.1608962,0.000024767016,0.0010052287,0.0004998595,0.00015645156,0.002389528,0.06731973],"genre_scores_gemma":[0.9865278,0.000018644872,0.013181395,0.000015857795,0.00006739029,0.000025360032,0.000042843894,0.000044969056,0.00007572417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989177,0.000027302174,0.00043278642,0.00013274595,0.00015996874,0.00032948042],"domain_scores_gemma":[0.99928516,0.00018207727,0.00006148349,0.00031112638,0.000040633073,0.00011954698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031628925,0.00019447679,0.00026746813,0.00022074593,0.0001697466,0.000052747408,0.0001491333,0.00008084368,0.00009749539],"category_scores_gemma":[0.000022943064,0.00018507364,0.00012783191,0.0004885815,0.00010955334,0.00010270399,0.00001844876,0.00014951239,0.00013272997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005053435,0.00041668315,0.0044869026,0.0022620922,0.0018324568,0.00013185281,0.016964374,0.005676671,0.13315345,0.82313365,0.0067068287,0.005184504],"study_design_scores_gemma":[0.0044536716,0.0003368358,0.016398435,0.0027131916,0.0011549959,0.002128681,0.01917639,0.15906575,0.1293035,0.6081096,0.05104897,0.0061099837],"about_ca_topic_score_codex":0.0000027189253,"about_ca_topic_score_gemma":0.00002427176,"teacher_disagreement_score":0.21931116,"about_ca_system_score_codex":0.00002737778,"about_ca_system_score_gemma":0.0000050369613,"threshold_uncertainty_score":0.7547084},"labels":[],"label_agreement":null},{"id":"W2011118188","doi":"10.1016/j.disc.2013.02.010","title":"Velocity polytopes of periodic graphs and a no-go theorem for digital physics","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Noncommutative and Quantum Gravity Theories","field":"Physics and Astronomy","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Mathematics; Polytope; Voltage graph; Line graph; Cubic graph; Combinatorics; Discrete mathematics; Graph property; Graph; Null graph; Lattice graph","score_opus":0.011388718656372334,"score_gpt":0.2503750808837458,"score_spread":0.2389863622273735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011118188","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8632818,0.000038693197,0.10030085,0.000073532465,0.000047943693,0.0006376581,0.00051974965,0.000031034248,0.03506875],"genre_scores_gemma":[0.9915566,0.000001488017,0.0075948834,0.000013391145,0.00004496946,0.000058025667,0.00006332283,0.000020426074,0.0006469011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993847,0.000013349736,0.00021655146,0.000120034376,0.00009547208,0.0001698884],"domain_scores_gemma":[0.9992813,0.00021722402,0.00014428407,0.0001906423,0.00011522055,0.0000513588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008064531,0.00015398175,0.00028126925,0.000020261336,0.00009944804,0.00011649849,0.000119788434,0.00002239883,0.0000839016],"category_scores_gemma":[0.00002196873,0.00011737252,0.00012596436,0.00006649562,0.00027795686,0.00024104779,0.00006599844,0.00006147993,0.00005230925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000787584,0.00010611709,0.0019262532,0.00015682627,0.000087717875,4.590484e-8,0.0030541725,6.6468857e-7,0.00040254855,0.98835176,0.00054660015,0.0053594396],"study_design_scores_gemma":[0.00031221495,0.00009195125,0.00022171903,0.00005473562,0.000034549055,3.4729663e-7,0.0028832583,0.0016213985,0.002517883,0.99170256,0.0003949635,0.0001644031],"about_ca_topic_score_codex":0.000011861849,"about_ca_topic_score_gemma":2.185883e-7,"teacher_disagreement_score":0.1282748,"about_ca_system_score_codex":0.0000032928372,"about_ca_system_score_gemma":0.000015816204,"threshold_uncertainty_score":0.47863126},"labels":[],"label_agreement":null},{"id":"W2011532710","doi":"10.1016/j.disc.2003.05.002","title":"Almost self-complementary circulant graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Circulant matrix; Dihedral group; Complement (music); Circulant graph; Automorphism group; Discrete mathematics; Cayley graph; Automorphism; Modulo; Greatest common divisor; Cyclic group; Prime (order theory); Graph; Group (periodic table); Voltage graph; Line graph; Abelian group","score_opus":0.06763896134045058,"score_gpt":0.3405880699501184,"score_spread":0.2729491086096678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011532710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7023378,0.00027104528,0.028291393,0.0005665353,0.0005240503,0.0028180084,0.00021808354,0.0013414648,0.2636316],"genre_scores_gemma":[0.7126872,0.00004618628,0.28488556,0.00031050568,0.00008326684,0.00016188611,0.0000646304,0.0002540547,0.0015067321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970333,0.00027004458,0.0007104604,0.00040600196,0.00081071455,0.00076949043],"domain_scores_gemma":[0.9972883,0.0010347198,0.00020906042,0.0011244408,0.00011566067,0.00022785041],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016528796,0.00037790215,0.0005171894,0.00020836329,0.0002471133,0.00010308743,0.0005498565,0.00011316181,0.0016405465],"category_scores_gemma":[0.0007604465,0.00032303587,0.0002406685,0.00047389098,0.0001270696,0.00020728043,0.00014221261,0.0003362325,0.00042711603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061591923,0.0003893222,0.00035647015,0.0005284968,0.00017022286,0.000041719974,0.0026612235,8.936147e-7,0.0005480886,0.9917526,0.003475185,0.000069594775],"study_design_scores_gemma":[0.0006997793,0.00008862162,0.000036652305,0.000092641974,0.000108122375,0.00012595479,0.0028898478,0.00065697945,0.0021092868,0.9860009,0.0067381826,0.0004530547],"about_ca_topic_score_codex":0.000005521381,"about_ca_topic_score_gemma":0.000006614513,"teacher_disagreement_score":0.26212487,"about_ca_system_score_codex":0.000100348385,"about_ca_system_score_gemma":0.00006929661,"threshold_uncertainty_score":0.99992216},"labels":[],"label_agreement":null},{"id":"W2011663983","doi":"10.1016/s0012-365x(00)00127-8","title":"On constructible graphs, infinite bridged graphs and weakly cop-win graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Combinatorics; Mathematics; Cartesian product; Vertex (graph theory); Induced subgraph; Retract; Graph; Discrete mathematics; Bipartite graph; Pure mathematics","score_opus":0.016283508460044168,"score_gpt":0.2735630802026106,"score_spread":0.25727957174256644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011663983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9349084,0.00033337434,0.032661982,0.00041624397,0.0001824581,0.000800696,0.00005967081,0.0005836633,0.030053517],"genre_scores_gemma":[0.91837627,0.00042960024,0.07948248,0.00042972862,0.000015291913,0.000063838044,0.0000140206175,0.00006895791,0.001119835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724203,0.00015634632,0.0005247299,0.0006648703,0.0007134921,0.0006985165],"domain_scores_gemma":[0.99751043,0.0006659732,0.00015615766,0.0012617563,0.000097376826,0.00030832662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00062068,0.00039478324,0.0004658392,0.00049395114,0.0003694305,0.0003415375,0.0010756521,0.00012098979,0.00019148174],"category_scores_gemma":[0.00013538118,0.00034328757,0.00017998379,0.0013563604,0.0006275946,0.0005560398,0.00022439883,0.00043238793,0.00017348696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026582537,0.00007886238,0.00027061856,0.00008536948,0.000050247276,0.000028918,0.00096409314,0.00004358147,0.00052486703,0.98667437,0.00039087184,0.010861632],"study_design_scores_gemma":[0.0006730433,0.00023170664,0.0004821847,0.00013732299,0.00001626258,0.0001068011,0.0001515578,0.0061714235,0.0017003599,0.9893331,0.00054885104,0.00044738673],"about_ca_topic_score_codex":0.000010619879,"about_ca_topic_score_gemma":0.000005872114,"teacher_disagreement_score":0.0468205,"about_ca_system_score_codex":0.00002259236,"about_ca_system_score_gemma":0.000047123016,"threshold_uncertainty_score":0.9999019},"labels":[],"label_agreement":null},{"id":"W2011692663","doi":"10.1016/j.disc.2006.06.033","title":"Resolvable balanced incomplete block designs with subdesigns of block size 4","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Beijing Institute For Brain Disorders","keywords":"Mathematics; Block size; Combinatorics; Block (permutation group theory); Discrete mathematics; Pairwise comparison; Statistics; Computer science","score_opus":0.016187533241745405,"score_gpt":0.2196362729728939,"score_spread":0.2034487397311485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011692663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8934127,0.00017882981,0.065373,0.000011290179,0.00014169466,0.00054215634,0.000030349558,0.00038401756,0.039925937],"genre_scores_gemma":[0.98222286,0.000006156212,0.01726585,0.000010222729,0.000042935255,0.000013713226,0.0000031708082,0.00006491988,0.00037019968],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99863845,0.000028608256,0.0005016217,0.00015510658,0.00027646797,0.00039972342],"domain_scores_gemma":[0.9988331,0.00040586782,0.00011770866,0.0004756474,0.000059329665,0.000108302105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006293261,0.00024385568,0.00041929298,0.00007949691,0.00006240335,0.000023945315,0.000252434,0.0000943376,0.000042232557],"category_scores_gemma":[0.00004826997,0.00019582165,0.00008755679,0.00030646363,0.0000864036,0.00005910468,0.000023979452,0.00014150486,0.000025606676],"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.00052699796,0.0006149346,0.0054457015,0.009711306,0.0016414537,0.00024682202,0.024710368,0.04739238,0.7107971,0.19422668,0.0042204503,0.0004658315],"study_design_scores_gemma":[0.007866323,0.0021057578,0.0053634406,0.0047980575,0.00093944924,0.0007577702,0.017693069,0.10740067,0.7645668,0.07689029,0.006506071,0.0051123286],"about_ca_topic_score_codex":0.000007853863,"about_ca_topic_score_gemma":0.000028122096,"teacher_disagreement_score":0.1173364,"about_ca_system_score_codex":0.000027330498,"about_ca_system_score_gemma":0.000012221233,"threshold_uncertainty_score":0.7985375},"labels":[],"label_agreement":null},{"id":"W2011992755","doi":"10.1016/j.disc.2008.07.003","title":"Super-simple balanced incomplete block designs with block size 4 and index 5","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Beijing Institute For Brain Disorders; National Natural Science Foundation of China","keywords":"Simple (philosophy); Mathematics; Intersection (aeronautics); Block (permutation group theory); Block size; Combinatorics; Discrete mathematics; Block design; Algorithm; Computer science","score_opus":0.015937151067999592,"score_gpt":0.20201873383249255,"score_spread":0.18608158276449296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011992755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.988739,0.00012275147,0.005450924,0.000013567672,0.000050073202,0.00027231034,0.000021915312,0.00028749357,0.0050419807],"genre_scores_gemma":[0.99700147,0.000027042473,0.002641288,0.000022364478,0.000044662425,0.000031925872,0.0000045575957,0.00005969824,0.00016698362],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902475,0.000027274817,0.00027824417,0.00016829673,0.00019661791,0.00030482895],"domain_scores_gemma":[0.9992712,0.0001989716,0.00004376906,0.00033978184,0.000028399008,0.00011785242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012328192,0.00024686323,0.00034635674,0.00004946317,0.00014055993,0.000034090106,0.00015059877,0.00007958914,0.000029304712],"category_scores_gemma":[0.00003054237,0.00019514267,0.000049619233,0.00017869446,0.00011156528,0.00009204233,0.00003231418,0.00014182198,0.000021819516],"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.00074240525,0.0013903824,0.20240048,0.020525528,0.00563965,0.0020636271,0.20991738,0.09100711,0.25036854,0.19616581,0.018323291,0.0014558014],"study_design_scores_gemma":[0.018146671,0.0022328196,0.06777664,0.0029931446,0.00095353374,0.012202918,0.02631498,0.66408515,0.04909423,0.12652695,0.01869382,0.010979139],"about_ca_topic_score_codex":0.000005526734,"about_ca_topic_score_gemma":0.000009931586,"teacher_disagreement_score":0.57307804,"about_ca_system_score_codex":0.000016499904,"about_ca_system_score_gemma":0.000010559024,"threshold_uncertainty_score":0.7957687},"labels":[],"label_agreement":null},{"id":"W2012220350","doi":"10.1016/j.disc.2005.12.038","title":"A note on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-cop, <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" overflow=\"scroll\"><mml:mi>l</mml:mi></mml:math>-robber games on graphs","year":2006,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Algorithm; Mathematics; Computer science; Combinatorics","score_opus":0.023071604099321547,"score_gpt":0.26147787488091195,"score_spread":0.2384062707815904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012220350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95774406,0.0013354539,0.011194727,0.0014029052,0.005014862,0.0005950745,0.000683383,0.0013144109,0.020715108],"genre_scores_gemma":[0.9662243,0.0013099221,0.022155927,0.0031614967,0.0026418653,0.0012971961,0.0006084883,0.0013698387,0.00123095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9792883,0.00068168517,0.0050701345,0.0043238252,0.005766848,0.004869214],"domain_scores_gemma":[0.9826055,0.0036715793,0.0046159457,0.006944554,0.0005670721,0.0015953225],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity"],"category_scores_codex":[0.003965999,0.0031008048,0.0018796118,0.0011254711,0.0030633712,0.0040216683,0.0059254146,0.003377648,0.00070092716],"category_scores_gemma":[0.002381185,0.003794758,0.0037030992,0.0025176788,0.0028365292,0.0029319716,0.0038057046,0.0036631718,0.016745897],"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.00092908967,0.0016392063,0.000021121476,0.002040753,0.0012456399,0.001670525,0.008977439,0.0070783203,0.0021617014,0.9623021,0.008225955,0.0037081635],"study_design_scores_gemma":[0.00162329,0.002566365,0.000059579088,0.0039293733,0.001340788,0.00097253756,0.0026055565,0.9064122,0.052238874,0.016766444,0.008291381,0.0031936178],"about_ca_topic_score_codex":0.0017844174,"about_ca_topic_score_gemma":0.0008754338,"teacher_disagreement_score":0.94553566,"about_ca_system_score_codex":0.00021083375,"about_ca_system_score_gemma":0.0019093758,"threshold_uncertainty_score":0.99987715},"labels":[],"label_agreement":null},{"id":"W2013162935","doi":"10.1016/s0012-365x(99)00282-4","title":"Nordhaus–Gaddum results for CO-irredundance in graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Luonnontieteiden ja Tekniikan Tutkimuksen Toimikunta; Natural Sciences and Engineering Research Council of Canada; University of South Africa","keywords":"Mathematics; Combinatorics; Graph; Complement (music); Bounded function; Vertex (graph theory); Discrete mathematics","score_opus":0.04400181210309842,"score_gpt":0.34426928153598696,"score_spread":0.3002674694328885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013162935","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8711309,0.000068000365,0.00834313,0.0009174041,0.00008878492,0.002377095,0.00079540134,0.00033820383,0.11594107],"genre_scores_gemma":[0.8777715,0.00006197424,0.11124887,0.00016394148,0.00008408398,0.00076662336,0.00015003816,0.000105839485,0.009647146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827504,0.000041665346,0.0007314788,0.00033393427,0.00021056739,0.00040732694],"domain_scores_gemma":[0.9980557,0.0008928331,0.0001809019,0.0007300211,0.000049210004,0.0000913508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007170058,0.000247051,0.0003809446,0.00011476048,0.00016668544,0.000054774133,0.00037595854,0.00011849948,0.00017291748],"category_scores_gemma":[0.00029947903,0.0002221837,0.00018094172,0.0003790645,0.0001317875,0.00011849099,0.00001989969,0.00016553878,0.000121262245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008090494,0.00032125597,0.0000302414,0.00026374037,0.000025798863,0.000002037976,0.0025107258,0.000013674369,0.00017060332,0.98880446,0.0059916424,0.0017848888],"study_design_scores_gemma":[0.0010588312,0.00005159005,0.000090992304,0.00013918981,0.00003688643,0.0000075550774,0.0004912369,0.001252856,0.0009405278,0.9837532,0.011889544,0.00028761418],"about_ca_topic_score_codex":0.0000042466904,"about_ca_topic_score_gemma":0.000030437637,"teacher_disagreement_score":0.106293924,"about_ca_system_score_codex":0.000025748821,"about_ca_system_score_gemma":0.00002370467,"threshold_uncertainty_score":0.9060389},"labels":[],"label_agreement":null},{"id":"W2013368271","doi":"10.1016/j.disc.2004.04.022","title":"Small cones of m-hemimetrics","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Set (abstract data type); Cone (formal languages); Discrete mathematics; Algorithm; Computer science","score_opus":0.03727717459418168,"score_gpt":0.2542964972022554,"score_spread":0.21701932260807372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013368271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024276612,0.00028519347,0.9640077,0.0007468625,0.000041851756,0.000063991116,0.000015855818,0.00007835987,0.010483624],"genre_scores_gemma":[0.5439107,0.00004325285,0.45508382,0.0001129271,0.000035598234,0.0000030716858,0.0000059758436,0.000004493883,0.0008002126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907947,0.000014969772,0.00032556473,0.00017618238,0.00023158545,0.000172217],"domain_scores_gemma":[0.9988993,0.0002495,0.00016015362,0.00055413524,0.000068958376,0.000067967325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025432996,0.00009801068,0.00024752656,0.00023425756,0.000035559122,0.000046458023,0.0008666263,0.00004703424,0.00008382791],"category_scores_gemma":[0.00032424045,0.0000689061,0.00010779202,0.0015056796,0.00005536738,0.00015191632,0.00028516128,0.00006121091,0.000100394376],"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.000001314263,0.00030028884,0.0004946721,0.00008118124,0.00008054274,0.000004884789,0.0007235914,0.00015733385,0.00033550494,0.92594576,0.0010317649,0.07084319],"study_design_scores_gemma":[0.0016369806,0.00054409215,0.0031875505,0.00013227267,0.0003576107,0.000074608586,0.00091094675,0.5691595,0.061067875,0.2699232,0.09126421,0.0017411433],"about_ca_topic_score_codex":0.0000073946317,"about_ca_topic_score_gemma":0.0000027960298,"teacher_disagreement_score":0.65602255,"about_ca_system_score_codex":0.000010139428,"about_ca_system_score_gemma":0.000011367136,"threshold_uncertainty_score":0.28099093},"labels":[],"label_agreement":null},{"id":"W2013391382","doi":"10.1016/j.disc.2008.12.022","title":"Variable neighborhood search for extremal graphs. 23. On the Randić index and the chromatic number","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Simple graph; Chromatic scale; Connectivity; Edge coloring; Discrete mathematics; Graph power; Line graph","score_opus":0.018016093211178613,"score_gpt":0.24976792240660425,"score_spread":0.23175182919542564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013391382","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.05406484,0.00037813335,0.89715815,0.013220364,0.00024257087,0.0022170078,0.000011414679,0.00026115566,0.032446347],"genre_scores_gemma":[0.96358675,0.000013190221,0.034784134,0.0011216486,0.000011894795,0.000058368314,0.0000023958085,0.000013716261,0.00040792255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859756,0.0000997521,0.00031525784,0.0002686199,0.000385258,0.00033355868],"domain_scores_gemma":[0.9978892,0.0010792575,0.00010941655,0.0007715034,0.000077651894,0.000072976945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013422432,0.00018837377,0.00026358428,0.000048601592,0.0004296976,0.00034476563,0.00065387425,0.000061761624,0.00001929969],"category_scores_gemma":[0.00013749355,0.000089154215,0.00010833763,0.0003709301,0.0001597262,0.00012327074,0.00010522218,0.00017141375,0.00002831357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001816364,0.00005569206,0.000023574796,0.00004095013,0.000025284193,0.0000010353954,0.0015387421,0.000048311373,0.000053873246,0.99703455,0.0007851034,0.00037471938],"study_design_scores_gemma":[0.0011942635,0.000060973325,0.000040845454,0.000081320155,0.000020012214,0.00002420902,0.00016719008,0.2609887,0.00015464815,0.7371075,0.000048385577,0.0001119181],"about_ca_topic_score_codex":0.000006925031,"about_ca_topic_score_gemma":4.8565374e-7,"teacher_disagreement_score":0.9095219,"about_ca_system_score_codex":0.000010425932,"about_ca_system_score_gemma":0.000031481155,"threshold_uncertainty_score":0.36356035},"labels":[],"label_agreement":null},{"id":"W2013441256","doi":"10.1016/j.disc.2011.02.017","title":"Helly theorems for 3-Steiner and 3-monophonic convexity in graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Steiner tree problem; Discrete mathematics; Graph","score_opus":0.04527375080292364,"score_gpt":0.2889499057836746,"score_spread":0.24367615498075093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013441256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1462731,0.0002008443,0.84572434,0.00010240365,0.00009381007,0.000724158,0.00001206917,0.00009931697,0.006769948],"genre_scores_gemma":[0.7666808,0.000034902885,0.23285475,0.000060644597,0.00000882712,0.00009322142,0.0000020599377,0.000021576263,0.00024322452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988212,0.000051904666,0.00027293927,0.00031190115,0.00017687512,0.00036520156],"domain_scores_gemma":[0.99888855,0.00027953263,0.00008577804,0.00059293164,0.00005716147,0.00009604411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007309904,0.0001538493,0.00022912982,0.0001610465,0.000073178606,0.00005784946,0.00065602583,0.00005855924,0.000014539332],"category_scores_gemma":[0.0001269042,0.00012243347,0.000066221,0.00032787607,0.00020422437,0.00029684088,0.00024992056,0.00012733974,0.00001730288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014553822,0.000055990422,0.00032077244,0.0000962225,0.0000106138,0.000005276682,0.004234966,0.0000023073303,0.00042209346,0.99330014,0.000016400334,0.0015206889],"study_design_scores_gemma":[0.0004285188,0.00011021487,0.00037003955,0.000038403432,0.0000038131682,0.000008791125,0.0002658238,0.0262829,0.0027598867,0.9694879,0.00007474359,0.00016893826],"about_ca_topic_score_codex":0.000006279546,"about_ca_topic_score_gemma":0.000012394861,"teacher_disagreement_score":0.6204077,"about_ca_system_score_codex":0.000015019615,"about_ca_system_score_gemma":0.00002474197,"threshold_uncertainty_score":0.49926922},"labels":[],"label_agreement":null},{"id":"W2013713597","doi":"10.1016/s0012-365x(99)00355-6","title":"On hamiltonian connectedness of K1,4-free graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Social connectedness; Pancyclic graph; Discrete mathematics; Graph; Hamiltonian (control theory); Connectivity; Pathwidth; Line graph","score_opus":0.017383883880047038,"score_gpt":0.28031229433020755,"score_spread":0.2629284104501605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013713597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60508084,0.00012471137,0.2948833,0.00067058037,0.00017946042,0.0007242621,0.00005980606,0.00042674807,0.09785027],"genre_scores_gemma":[0.89604694,0.00003394298,0.101940766,0.00013666262,0.000014984323,0.000030212665,0.000004420772,0.000036060697,0.001755987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983697,0.00007670442,0.00034992816,0.0003065491,0.00054312235,0.0003540214],"domain_scores_gemma":[0.99749047,0.0004351409,0.00010596139,0.0017689297,0.00008430488,0.00011520854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003596583,0.0001805164,0.0002860548,0.0001700619,0.0000971261,0.000060175233,0.0019180902,0.000060971208,0.00026542743],"category_scores_gemma":[0.00021849123,0.0001476976,0.00012196874,0.00067702145,0.00019749576,0.00023034132,0.0002002631,0.00016974624,0.00013334173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014937127,0.00011108665,0.000015290561,0.00007056517,0.000022256761,0.000010672437,0.00129337,0.00014163376,0.00039036668,0.9919594,0.0002343996,0.0057360195],"study_design_scores_gemma":[0.00047799954,0.00016867285,0.00011966285,0.00010042037,0.000005747856,0.000011169412,0.000087041546,0.013635199,0.0041046916,0.9808058,0.0002860135,0.00019758295],"about_ca_topic_score_codex":0.000003527856,"about_ca_topic_score_gemma":0.0000035195778,"teacher_disagreement_score":0.29096612,"about_ca_system_score_codex":0.000017574233,"about_ca_system_score_gemma":0.000030522697,"threshold_uncertainty_score":0.6022934},"labels":[],"label_agreement":null},{"id":"W2013957545","doi":"10.1016/j.disc.2011.02.008","title":"Extending precolourings of circular cliques","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Conjecture; Clique number; Chromatic scale; Clique; Graph; Discrete mathematics","score_opus":0.05201806543424768,"score_gpt":0.305140009474376,"score_spread":0.2531219440401283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013957545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07939055,0.00009063648,0.90106976,0.000022099102,0.000056581408,0.00019976114,0.0000020069535,0.0001288983,0.019039681],"genre_scores_gemma":[0.6392802,0.000017334109,0.3604652,0.000011827828,0.000007967874,0.000014723257,4.1477674e-7,0.0000132734995,0.00018906387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989164,0.000048218797,0.0002920648,0.00020806641,0.00027357528,0.00026170566],"domain_scores_gemma":[0.99887985,0.0001139397,0.00015567939,0.0006941752,0.00008217273,0.00007420242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005309733,0.000110386856,0.00019798563,0.00012653855,0.000055345903,0.000027629128,0.0009704844,0.000041356016,0.00004799256],"category_scores_gemma":[0.00014410302,0.000093808136,0.00009013675,0.00027187847,0.00010647792,0.00034965845,0.00033860837,0.00010451976,0.000027371138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027483666,0.000075886586,0.00034339004,0.00016836642,0.000022335898,0.000010156865,0.0060551544,0.0000030049996,0.002101679,0.9893933,0.0000128553975,0.0018111406],"study_design_scores_gemma":[0.00013126186,0.00011110861,0.0006858113,0.000096413525,0.00000798399,0.000017451677,0.00027675505,0.0075828307,0.06930004,0.9214872,0.00012341604,0.00017972809],"about_ca_topic_score_codex":0.000003016122,"about_ca_topic_score_gemma":4.6317282e-7,"teacher_disagreement_score":0.5598896,"about_ca_system_score_codex":0.000016910628,"about_ca_system_score_gemma":0.000021140135,"threshold_uncertainty_score":0.38253847},"labels":[],"label_agreement":null},{"id":"W2013977006","doi":"10.1016/s0012-365x(99)00374-x","title":"Cyclically resolvable cyclic Steiner triple systems of order 21 and 39","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Beijing Institute For Brain Disorders","keywords":"Mathematics; Steiner system; Combinatorics; Order (exchange); Discrete mathematics","score_opus":0.007023607796388143,"score_gpt":0.19988096601752797,"score_spread":0.19285735822113984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013977006","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93193555,0.001407745,0.002871494,0.0000150817295,0.00017938296,0.00039542277,0.0000372646,0.00021468248,0.0629434],"genre_scores_gemma":[0.994678,0.000105667954,0.0012626784,0.000007615765,0.000048756494,0.000032909367,0.000007802328,0.00005037719,0.00380618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989308,0.00003732875,0.0004764956,0.00013713368,0.00018271984,0.00023548109],"domain_scores_gemma":[0.9993736,0.00008033859,0.000055728433,0.0003756445,0.000030803956,0.000083851904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025943413,0.00018198835,0.000386642,0.00006332401,0.000045559045,0.000044666536,0.00014793174,0.00010093839,0.00017122114],"category_scores_gemma":[0.000024942678,0.00014986812,0.000060890194,0.00021824574,0.000060854603,0.00008880817,0.000016617261,0.00010184761,0.000056400466],"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.00028056678,0.0009494043,0.0033775559,0.03284501,0.0023442083,0.000109562956,0.036289338,0.095753364,0.11179962,0.6840642,0.017590392,0.014596772],"study_design_scores_gemma":[0.0060782623,0.0006311579,0.0017249961,0.004004295,0.0006721689,0.00043269,0.008618908,0.8129719,0.011995232,0.045300663,0.104044326,0.0035254112],"about_ca_topic_score_codex":0.000018190307,"about_ca_topic_score_gemma":0.0000036799004,"teacher_disagreement_score":0.7172185,"about_ca_system_score_codex":0.000010320272,"about_ca_system_score_gemma":0.0000054479724,"threshold_uncertainty_score":0.6111445},"labels":[],"label_agreement":null},{"id":"W2014599857","doi":"10.1016/j.disc.2009.11.001","title":"Super-simple, pan-orientable and pan-decomposable GDDs with block size 4","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Beijing Institute For Brain Disorders","keywords":"Mathematics; Combinatorics; Simple (philosophy); Block (permutation group theory); Block size; Graph; Type (biology); Discrete mathematics; Simple graph; Computer science; Biology; Key (lock)","score_opus":0.005352589684274519,"score_gpt":0.20006041606032907,"score_spread":0.19470782637605455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014599857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9670257,0.00033449323,0.0018754808,0.0000399013,0.00010968244,0.0002996233,0.000022867964,0.00034269862,0.029949538],"genre_scores_gemma":[0.99591637,0.000033509918,0.0031635317,0.000038067028,0.000060572955,0.000016082711,0.000008376934,0.000040657767,0.0007228266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989947,0.000019190318,0.0002806111,0.00017584609,0.0001773385,0.00035228438],"domain_scores_gemma":[0.9993535,0.00012316651,0.00003838539,0.00035874872,0.000024897598,0.00010127763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017276629,0.00024385612,0.00033121923,0.000040427072,0.00010265661,0.000095878895,0.00014248921,0.00007566278,0.000053486285],"category_scores_gemma":[0.000021414951,0.00018997389,0.00005037099,0.00017236345,0.00004534853,0.0001279568,0.000018908982,0.00012794865,0.00003241857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027312976,0.00130124,0.0117811635,0.0077759647,0.0016764681,0.0003198223,0.051867876,0.008267626,0.07835393,0.79522806,0.03368001,0.009474688],"study_design_scores_gemma":[0.011565906,0.0034484316,0.017576383,0.0031414218,0.0013647954,0.0022371304,0.038566016,0.15269445,0.076790564,0.60896546,0.074768364,0.008881049],"about_ca_topic_score_codex":0.000005301726,"about_ca_topic_score_gemma":0.000008971617,"teacher_disagreement_score":0.1862626,"about_ca_system_score_codex":0.000018134233,"about_ca_system_score_gemma":0.0000070016326,"threshold_uncertainty_score":0.77469105},"labels":[],"label_agreement":null},{"id":"W2015153338","doi":"10.1016/j.disc.2011.06.016","title":"The adaptable choosability number grows with the choosability number","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Multigraph; Integer (computer science); Colored; Infinity; Discrete mathematics; Graph; Computer science","score_opus":0.034086144093716846,"score_gpt":0.2841479216427549,"score_spread":0.250061777549038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015153338","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.15107596,0.00008232684,0.67863727,0.0029583352,0.00024737415,0.0018734082,0.000014028997,0.00047297045,0.16463831],"genre_scores_gemma":[0.9192292,0.00001521662,0.07845355,0.000117557276,0.00004889574,0.00021566042,0.0000014444175,0.00003976304,0.0018786809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997189,0.00032466475,0.00041382376,0.00053576933,0.00079339196,0.0007433607],"domain_scores_gemma":[0.9953183,0.0010677979,0.00020102311,0.0030159277,0.00022523325,0.0001717376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023192663,0.00030134464,0.00028652116,0.000016902504,0.0008240288,0.00029355247,0.0027912299,0.00007340042,0.00023502106],"category_scores_gemma":[0.0003519533,0.00013875628,0.00015033511,0.0006754789,0.000963947,0.00062714994,0.00073421665,0.0004876633,0.00042893345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043457578,0.00019154453,0.006604495,0.00006523732,0.000065167886,0.0000058380206,0.005088523,0.000009492854,0.000023862034,0.9855645,0.00086355105,0.001474341],"study_design_scores_gemma":[0.00040045578,0.00008374458,0.0057068244,0.00004003313,0.000027531554,0.00007899507,0.0027195807,0.0092324605,0.0015352295,0.97514397,0.004575182,0.0004560184],"about_ca_topic_score_codex":0.000056986726,"about_ca_topic_score_gemma":0.00008769515,"teacher_disagreement_score":0.76815325,"about_ca_system_score_codex":0.00009478016,"about_ca_system_score_gemma":0.000093230956,"threshold_uncertainty_score":0.63378465},"labels":[],"label_agreement":null},{"id":"W2015241707","doi":"10.1016/j.disc.2009.08.020","title":"Quarter-regular biembeddings of Latin squares","year":2009,"lang":"es","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Australian Mathematical Sciences Institute","keywords":"Latin square; Mathematics; Combinatorics; Quarter (Canadian coin); Least-squares function approximation; Symmetry (geometry); Discrete mathematics; Statistics; Geometry; Geography","score_opus":0.00905420544041423,"score_gpt":0.22745417199221818,"score_spread":0.21839996655180394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015241707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9395383,0.0012818202,0.016102603,0.00022741803,0.00037251317,0.0005435546,0.00011584657,0.00029110428,0.041526813],"genre_scores_gemma":[0.9962213,0.00003525872,0.0032249242,0.000017258635,0.00010741365,0.0000071683758,0.00001723383,0.000050128245,0.0003193077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981604,0.000058355716,0.00082623033,0.00021714502,0.00034782567,0.00039004552],"domain_scores_gemma":[0.99878156,0.00013321626,0.00026334875,0.0006465223,0.000062359526,0.00011297036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038416043,0.0003732903,0.0006738812,0.00024279792,0.00006769136,0.000094880925,0.00034151145,0.00020233856,0.00010466802],"category_scores_gemma":[0.00005896893,0.00034191937,0.0002953674,0.0004339256,0.00008382713,0.00013927824,0.000024885137,0.00018595002,0.00012823992],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001543068,0.00018027326,0.00023808234,0.0031784652,0.00019154791,0.000013129144,0.010425449,0.0014545907,0.027217513,0.9550708,0.0009006772,0.0011140322],"study_design_scores_gemma":[0.002812376,0.0019286616,0.0044142976,0.012262829,0.0011242973,0.000092542876,0.016792048,0.25452858,0.109544925,0.58157384,0.011461958,0.0034636527],"about_ca_topic_score_codex":0.0000033076176,"about_ca_topic_score_gemma":3.706247e-7,"teacher_disagreement_score":0.37349698,"about_ca_system_score_codex":0.000023640558,"about_ca_system_score_gemma":0.000011690448,"threshold_uncertainty_score":0.99990326},"labels":[],"label_agreement":null},{"id":"W2015485247","doi":"10.1016/j.disc.2014.10.018","title":"Digraph functors which admit both left and right adjoints","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Homotopy and Cohomology in Algebraic Topology","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Mathematics; Homomorphism; Functor; Adjoint functors; Digraph; Existential quantification; Derived functor; Connection (principal bundle); Functor category; Discrete mathematics; Combinatorics; Pure mathematics","score_opus":0.016183054048012756,"score_gpt":0.27194128721581134,"score_spread":0.2557582331677986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015485247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88831824,0.00013976298,0.039626323,0.0012204153,0.00048472558,0.00058335747,0.000026673013,0.0004158019,0.0691847],"genre_scores_gemma":[0.9747086,0.000024805802,0.022197813,0.0002637189,0.00015045113,0.000027287075,0.000012708367,0.0000717272,0.0025428445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979704,0.00017532188,0.00059662125,0.00042899954,0.00029092105,0.0005377348],"domain_scores_gemma":[0.99761707,0.001048022,0.00025441614,0.0007875993,0.00007750047,0.00021539936],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007471332,0.00037630874,0.00066229724,0.00013682243,0.0002530477,0.000058875517,0.0003486049,0.0003042147,0.0014841146],"category_scores_gemma":[0.0011546708,0.0002955792,0.00012477192,0.00016970835,0.000321605,0.000119617966,0.00017840158,0.0003327587,0.00013692917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015610358,0.00018954197,0.0030177739,0.00048222352,0.00016483407,0.000014024774,0.003418006,6.882568e-7,0.00018966325,0.9888994,0.00300696,0.0006012544],"study_design_scores_gemma":[0.00063752313,0.00020498782,0.0009767808,0.00011149265,0.00018484012,0.00020635084,0.00042650625,0.0011358163,0.0011242239,0.9893732,0.0051364256,0.00048182718],"about_ca_topic_score_codex":0.000007705206,"about_ca_topic_score_gemma":0.00015225881,"teacher_disagreement_score":0.0863904,"about_ca_system_score_codex":0.000020169693,"about_ca_system_score_gemma":0.000033801272,"threshold_uncertainty_score":0.99994963},"labels":[],"label_agreement":null},{"id":"W2015635736","doi":"10.1016/s0012-365x(01)00073-5","title":"Homomorphisms to powers of digraphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Bishop's University","funders":"","keywords":"Homomorphism; Digraph; Mathematics; Combinatorics; Chromatic scale; Discrete mathematics; Homomorphic encryption; Path (computing); Polynomial; Power (physics); Computer science; Encryption","score_opus":0.029800373251303396,"score_gpt":0.2820215675189948,"score_spread":0.2522211942676914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015635736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02886391,0.0001235292,0.94546497,0.0005898357,0.00009267884,0.0003241096,0.000010696322,0.00012908311,0.02440118],"genre_scores_gemma":[0.7465132,0.00001709622,0.25241286,0.00009922501,0.000010386956,0.000018788614,6.9819424e-7,0.000017592307,0.00091015495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986883,0.000033581568,0.00028588605,0.00023516436,0.00044444492,0.0003126373],"domain_scores_gemma":[0.99857026,0.00016857058,0.000091785434,0.0009317633,0.00008314267,0.00015449803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025640312,0.00012963392,0.00022120595,0.00021509094,0.000059255188,0.000050736926,0.001139421,0.00003519857,0.00010241819],"category_scores_gemma":[0.00015245494,0.0001093724,0.00010086613,0.0008349297,0.000102221085,0.00021777806,0.00029574442,0.00009738809,0.00020598438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021218714,0.000105717874,0.00004793717,0.000061615545,0.00002078935,0.000011614739,0.004278043,0.00007526897,0.0018913468,0.9888123,0.00073770265,0.003955494],"study_design_scores_gemma":[0.0005696478,0.00048036408,0.00017306712,0.00018814976,0.000015685031,0.000042969717,0.00079543795,0.0759214,0.023435578,0.89480215,0.0029232022,0.00065234414],"about_ca_topic_score_codex":0.0000012241909,"about_ca_topic_score_gemma":6.592128e-7,"teacher_disagreement_score":0.7176493,"about_ca_system_score_codex":0.000014374777,"about_ca_system_score_gemma":0.000006584014,"threshold_uncertainty_score":0.4460077},"labels":[],"label_agreement":null},{"id":"W2015733148","doi":"10.1016/j.disc.2011.09.007","title":"Spanning trees with specified differences in Cayley graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada; Ontario Ministry of Research, Innovation and Science; Fonds Québécois de la Recherche sur la Nature et les Technologies; Carleton University","keywords":"Mathematics; Combinatorics; Multiset; Cayley graph; Spanning tree; Discrete mathematics; Finite group; Graph; Group (periodic table)","score_opus":0.03176362460817492,"score_gpt":0.1924164574428819,"score_spread":0.160652832834707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015733148","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93970793,0.00010872039,0.0044411384,0.000002141506,0.00008803087,0.00014403711,0.000004207011,0.0001713454,0.055332452],"genre_scores_gemma":[0.9969436,0.000013099159,0.0028761,0.0000028013721,0.00001470701,0.00002610418,0.0000021295625,0.00003080046,0.00009065396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927163,0.000019356497,0.00023925002,0.00011816124,0.00012512637,0.00022648445],"domain_scores_gemma":[0.99962693,0.00003988899,0.00002820923,0.00024252798,0.000010314456,0.00005213375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012749858,0.00017251795,0.00025896667,0.00011769139,0.000030159403,0.000024789293,0.00017167605,0.000052657815,0.00006449311],"category_scores_gemma":[0.0000066252705,0.00012430202,0.000045246114,0.00020875456,0.00005370245,0.00009011067,0.000013540704,0.00011449256,0.000021519534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100339355,0.00028680163,0.10832486,0.0015485279,0.0003910443,0.0002087508,0.13447854,0.00055778946,0.003221518,0.7488403,0.0001875767,0.0018539779],"study_design_scores_gemma":[0.0029659208,0.00073115755,0.31956506,0.004608266,0.00028454364,0.00020148035,0.08678181,0.07639006,0.033251595,0.47076488,0.00034025413,0.0041149827],"about_ca_topic_score_codex":0.000014094938,"about_ca_topic_score_gemma":0.00009702141,"teacher_disagreement_score":0.2780754,"about_ca_system_score_codex":0.000009688661,"about_ca_system_score_gemma":0.0000031766408,"threshold_uncertainty_score":0.5068889},"labels":[],"label_agreement":null},{"id":"W2015741724","doi":"10.1016/s0012-365x(01)00293-x","title":"On p-adic q-L-functions and sums of powers","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"advanced mathematical theories","field":"Mathematics","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Simon Fraser University","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.04098667798335974,"score_gpt":0.3005052482776257,"score_spread":0.25951857029426595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015741724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5031304,0.00041154938,0.21172655,0.00064769614,0.00030962614,0.0012598276,0.00013465388,0.00052387017,0.28185582],"genre_scores_gemma":[0.8960561,0.000058755453,0.09650267,0.00006168132,0.00004280914,0.0000430325,0.0000037367663,0.00009927116,0.0071319025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846023,0.00003931247,0.0005732018,0.00024523542,0.00038341826,0.00029862823],"domain_scores_gemma":[0.9970407,0.0018589132,0.00027212102,0.00063417887,0.00006834736,0.00012577271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002853166,0.00026974524,0.0005268029,0.000120390505,0.00010726676,0.000026225916,0.0001845108,0.000099061224,0.0007332684],"category_scores_gemma":[0.002026278,0.0002132579,0.00012356327,0.00022182791,0.00033254246,0.00012027205,0.00008634224,0.00018369501,0.0001267338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007574488,0.00019253186,0.00001067609,0.0006109965,0.000054606877,0.0000035933579,0.002115723,0.000004494902,0.00029845192,0.994625,0.0017157306,0.00036067175],"study_design_scores_gemma":[0.0003608337,0.0001481027,0.0000044056897,0.000244705,0.00008619963,0.000022772736,0.0014833582,0.0022349085,0.0013696417,0.9935198,0.00028852336,0.00023677756],"about_ca_topic_score_codex":6.7615025e-7,"about_ca_topic_score_gemma":8.0685686e-7,"teacher_disagreement_score":0.39292574,"about_ca_system_score_codex":0.000028250455,"about_ca_system_score_gemma":0.000005551718,"threshold_uncertainty_score":0.86964047},"labels":[],"label_agreement":null},{"id":"W2015784652","doi":"10.1016/j.disc.2009.05.007","title":"The firefighter problem for cubic graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; McGill University","funders":"","keywords":"Combinatorics; Mathematics; Degree (music); Vertex (graph theory); Graph; Discrete mathematics; Time complexity","score_opus":0.02183635650630993,"score_gpt":0.30538479815737224,"score_spread":0.2835484416510623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015784652","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.0020058763,0.00022216351,0.98576695,0.0036006365,0.00007985926,0.0007952986,0.0000052884566,0.00018277633,0.007341169],"genre_scores_gemma":[0.22498375,0.00007622429,0.7705658,0.00048032956,0.000066946785,0.00024489514,0.0000056787017,0.000034633078,0.0035417192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867755,0.000036936224,0.00026746318,0.0002486935,0.00031601216,0.00045332452],"domain_scores_gemma":[0.9983681,0.0004934914,0.00009896515,0.0008590772,0.00009779296,0.000082614744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061862665,0.00014572176,0.0001508418,0.00006017521,0.0004187474,0.00027781626,0.0013482423,0.000040484654,0.0000033972585],"category_scores_gemma":[0.00010411312,0.00008537164,0.00013511012,0.00033866853,0.00008937671,0.00027562954,0.000116892545,0.000119708755,0.00003283622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046777577,0.00002867802,0.0000030968715,0.000022642922,0.00000970855,0.0000012299374,0.0006008496,0.000009558716,0.00029801574,0.98254913,0.0008498476,0.015622583],"study_design_scores_gemma":[0.00017557743,0.00012320548,0.00002582059,0.000024873974,0.000004217182,0.000006999899,0.000051749612,0.022913147,0.0013375736,0.96869665,0.006509933,0.00013025002],"about_ca_topic_score_codex":2.2380591e-7,"about_ca_topic_score_gemma":0.0000011343486,"teacher_disagreement_score":0.22297788,"about_ca_system_score_codex":0.000017220447,"about_ca_system_score_gemma":0.000024070581,"threshold_uncertainty_score":0.34813544},"labels":[],"label_agreement":null},{"id":"W2015958023","doi":"10.1016/s0012-365x(03)00260-7","title":"Balanced incomplete block designs with block size 9: part II","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Block (permutation group theory); Mathematics; Combinatorics; Block size; Discrete mathematics; Computer science","score_opus":0.01522455422241352,"score_gpt":0.2042299911895437,"score_spread":0.18900543696713018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015958023","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.911621,0.00020333641,0.007772265,0.000027853324,0.00033449597,0.00056407455,0.000032070202,0.0006628445,0.0787821],"genre_scores_gemma":[0.99170715,0.000009377882,0.007219471,0.000027133166,0.000046204754,0.000055773853,0.0000033690844,0.00007128914,0.0008602068],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988462,0.00005037701,0.00033941818,0.000174606,0.00021877598,0.00037063393],"domain_scores_gemma":[0.99915624,0.000154955,0.00006709501,0.00047193601,0.00003254471,0.00011724701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026119128,0.0002743788,0.00035280178,0.000041167972,0.00015126013,0.000044072724,0.00018365146,0.00008063035,0.00010296312],"category_scores_gemma":[0.00006135713,0.00021544885,0.000081997445,0.00023076317,0.000056917455,0.00007355772,0.000019956859,0.00014613861,0.00007420564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087081935,0.0006128238,0.002092266,0.004801103,0.0018055419,0.00018809893,0.024270263,0.058389254,0.043412033,0.85024405,0.013842327,0.00025517322],"study_design_scores_gemma":[0.014545116,0.002813158,0.0011529102,0.006401611,0.0017038222,0.0028212522,0.020843036,0.15474956,0.19725308,0.30925328,0.27627996,0.01218322],"about_ca_topic_score_codex":8.777721e-7,"about_ca_topic_score_gemma":0.000004351514,"teacher_disagreement_score":0.54099077,"about_ca_system_score_codex":0.000023882192,"about_ca_system_score_gemma":0.0000128173015,"threshold_uncertainty_score":0.8785749},"labels":[],"label_agreement":null},{"id":"W2016420891","doi":"10.1016/j.disc.2013.01.005","title":"The abelian complexity of the paperfolding word","year":2013,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Word (group theory); Abelian group; Linguistics; Computer science; Mathematics; Pure mathematics; Philosophy","score_opus":0.03825754995801239,"score_gpt":0.26032372811973836,"score_spread":0.22206617816172597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016420891","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6650212,0.002461054,0.28507635,0.013464389,0.004547506,0.0032770396,0.00011113744,0.000773634,0.025267713],"genre_scores_gemma":[0.9366935,0.00011749762,0.06206676,0.00019085727,0.000113788934,0.00007952245,0.0000046299383,0.000039091625,0.0006943388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980888,0.00013631005,0.0005837614,0.0003408211,0.00051526405,0.00033503663],"domain_scores_gemma":[0.9959455,0.00044699095,0.0006648789,0.0027883358,0.00009419285,0.00006008226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000788391,0.0002904999,0.00038660943,0.000034328405,0.00039320096,0.00043238848,0.004576375,0.00014042301,0.00002236196],"category_scores_gemma":[0.00014777535,0.00014277748,0.00029417354,0.00020260278,0.00049370097,0.00010619931,0.004487689,0.0004966611,0.000039845665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.8056255e-7,0.000037067555,0.000034707013,0.00032544107,0.00006892302,6.894387e-7,0.0026856577,0.0001542173,0.00023430142,0.989589,0.0010815554,0.005787757],"study_design_scores_gemma":[0.00006974909,0.0000076232413,0.0006265482,0.0005033515,0.000025973159,0.000005205719,0.00026474276,0.17824681,0.0013593753,0.81789804,0.00076647254,0.00022610866],"about_ca_topic_score_codex":0.00003513593,"about_ca_topic_score_gemma":0.000008416053,"teacher_disagreement_score":0.27167234,"about_ca_system_score_codex":0.00003665448,"about_ca_system_score_gemma":0.00007920352,"threshold_uncertainty_score":0.8504119},"labels":[],"label_agreement":null},{"id":"W2016554949","doi":"10.1016/j.disc.2010.07.023","title":"Two refinements of the bound of Sauer, Perles and Shelah, and of Vapnik and Chervonenkis","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.005441214389066695,"score_gpt":0.20432793689826478,"score_spread":0.1988867225091981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016554949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9969043,0.00046167214,0.00008131092,0.000010419006,0.00006564274,0.00011844428,0.000028369257,0.000009138635,0.002320706],"genre_scores_gemma":[0.9986195,0.00005577049,0.0012453985,0.0000016728924,0.000008187841,0.000003398414,7.309628e-7,0.000012758529,0.000052561434],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99949414,0.000013232725,0.0002547903,0.00006410961,0.00009789231,0.00007586636],"domain_scores_gemma":[0.99958754,0.000063019135,0.00009044345,0.00021154473,0.000020834219,0.000026635658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020834697,0.000091117494,0.00021814174,0.00003752037,0.00002548424,0.000009174538,0.00007875037,0.00004351462,0.000011242844],"category_scores_gemma":[0.00002828193,0.000061949824,0.000030250518,0.00007128085,0.00019075589,0.000036592563,0.0000491354,0.00007463221,1.6328309e-7],"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.000012485876,0.000073015304,0.015698658,0.0062977117,0.00022863728,6.781834e-7,0.016911676,0.000022679571,0.75179195,0.20712537,0.00005050369,0.0017866339],"study_design_scores_gemma":[0.006012286,0.00036624665,0.11083134,0.0036157942,0.0010178738,0.000218531,0.026348306,0.03548916,0.49995348,0.31318688,0.0014061857,0.0015539088],"about_ca_topic_score_codex":0.0000124158605,"about_ca_topic_score_gemma":0.0000235856,"teacher_disagreement_score":0.25183848,"about_ca_system_score_codex":0.0000012956915,"about_ca_system_score_gemma":0.0000031044701,"threshold_uncertainty_score":0.25262403},"labels":[],"label_agreement":null},{"id":"W2016857938","doi":"10.1016/j.disc.2011.05.032","title":"Cycles in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-traceable oriented graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"University of South Africa","keywords":"Combinatorics; Tournament; Digraph; Mathematics; Conjecture; Vertex (graph theory); Girth (graph theory); Order (exchange); Discrete mathematics; Graph","score_opus":0.025869409061803416,"score_gpt":0.2693643896109582,"score_spread":0.2434949805491548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016857938","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9449077,0.00019394277,0.04878656,0.00010177271,0.00038173786,0.00015354207,0.000049007936,0.00025521746,0.005170492],"genre_scores_gemma":[0.9194545,0.00014975516,0.07951639,0.000175674,0.000096470816,0.00022886929,0.00004974581,0.00013657146,0.0001920327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602383,0.00012944812,0.0008733064,0.0008188536,0.0010674815,0.0010870759],"domain_scores_gemma":[0.99675596,0.00051893777,0.0005017191,0.0017982017,0.00009771753,0.0003274722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011879513,0.00045072022,0.00036415685,0.0003134879,0.00041411843,0.0003067698,0.0017731772,0.00034734048,0.00005419781],"category_scores_gemma":[0.00046947898,0.0004766533,0.00039772986,0.0009849407,0.00047014712,0.0010660815,0.001103274,0.0006585837,0.00068869453],"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.00008768506,0.00028791823,0.000066228415,0.00031795417,0.00010673752,0.00021839527,0.0043355394,0.00020024604,0.0007286704,0.99296725,0.000120364486,0.00056301354],"study_design_scores_gemma":[0.0006709327,0.0002901483,0.00012454494,0.00039513133,0.000055134846,0.00012332067,0.0010597233,0.88719296,0.008229007,0.1009556,0.00039496346,0.00050854846],"about_ca_topic_score_codex":0.00009584973,"about_ca_topic_score_gemma":0.000101505066,"teacher_disagreement_score":0.89201164,"about_ca_system_score_codex":0.000025375804,"about_ca_system_score_gemma":0.00018718034,"threshold_uncertainty_score":0.9997685},"labels":[],"label_agreement":null},{"id":"W2016874427","doi":"10.1016/j.disc.2008.02.004","title":"Circle graphs and the cycle double cover conjecture","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Eulerian path; Graph; Cover (algebra); Discrete mathematics; Pure mathematics","score_opus":0.019056370746055845,"score_gpt":0.2714743867348818,"score_spread":0.25241801598882596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016874427","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.3008598,0.000784434,0.6729333,0.0022281727,0.00015137532,0.00089221104,0.000008126635,0.0003162959,0.02182628],"genre_scores_gemma":[0.9777948,0.00010438213,0.021131195,0.00020447027,0.000014528409,0.0000325219,0.0000011959379,0.0000163198,0.0007005379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885744,0.000061666804,0.00019451366,0.00024572673,0.00035215213,0.0002885057],"domain_scores_gemma":[0.9986597,0.00037059383,0.00007974885,0.0007586358,0.00004620372,0.00008514847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042243925,0.00013021273,0.00021164484,0.000061005176,0.00034797358,0.000104785475,0.00074831647,0.000045500114,0.000019446148],"category_scores_gemma":[0.000060935632,0.00008335964,0.00008176369,0.00035415762,0.00061824045,0.00028035426,0.00034636768,0.00019132816,0.00006502219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021198228,0.000022031456,0.000061790284,0.000029930126,0.000021833088,0.000016387856,0.0041468064,0.00008552214,0.00006320728,0.99485385,0.00022095631,0.00045646928],"study_design_scores_gemma":[0.0019625064,0.00003321944,0.00024153075,0.00001914696,0.000007607283,0.00020236088,0.0001336235,0.028905919,0.00093043287,0.96687704,0.00051144505,0.00017518757],"about_ca_topic_score_codex":0.000005685675,"about_ca_topic_score_gemma":0.0000013175086,"teacher_disagreement_score":0.676935,"about_ca_system_score_codex":0.000009751113,"about_ca_system_score_gemma":0.00002634208,"threshold_uncertainty_score":0.33993077},"labels":[],"label_agreement":null},{"id":"W2017923854","doi":"10.1016/j.disc.2014.10.002","title":"Cycle-maximal triangle-free graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Counterexample; Conjecture; Discrete mathematics; Homomorphism; Upper and lower bounds; Vertex (graph theory); Graph","score_opus":0.019972228845571226,"score_gpt":0.2811180102016201,"score_spread":0.2611457813560489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017923854","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.0085403295,0.00005072134,0.9592845,0.00088916667,0.00015165038,0.00024639632,0.000006266294,0.00032706556,0.030503899],"genre_scores_gemma":[0.4014038,0.000014518623,0.596947,0.0003478355,0.00009837474,0.00006442139,0.000005493438,0.00005756445,0.001060932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798965,0.00013611985,0.0003761901,0.00039073764,0.0005925369,0.00051478983],"domain_scores_gemma":[0.9969947,0.00052501995,0.0001457501,0.0020609398,0.00008689014,0.0001867501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010725749,0.00021193844,0.0003256258,0.0002025759,0.00017099813,0.0002019121,0.0025073495,0.00007023437,0.000035859845],"category_scores_gemma":[0.00091746676,0.00017360934,0.00017766401,0.0006121547,0.00015171284,0.00044006627,0.00076458143,0.00021519286,0.00021640939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048856564,0.00005106202,0.000025599476,0.000047270623,0.000015948315,0.0000061533556,0.00057707896,0.000037834354,0.00025330734,0.9922083,0.0005434962,0.0062290793],"study_design_scores_gemma":[0.0005472393,0.00009205441,0.000048598242,0.000025952,0.0000065405607,0.00001922512,0.00005212655,0.06926189,0.0009737606,0.9263952,0.0023522216,0.00022520164],"about_ca_topic_score_codex":0.0000020062482,"about_ca_topic_score_gemma":0.0000026912876,"teacher_disagreement_score":0.3928635,"about_ca_system_score_codex":0.000022201513,"about_ca_system_score_gemma":0.000024684166,"threshold_uncertainty_score":0.70795834},"labels":[],"label_agreement":null},{"id":"W2018251139","doi":"10.1016/s0012-365x(00)00083-2","title":"Forbidden minors to graphs with small feedback sets","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Constructive; Treewidth; Pathwidth; Minor (academic); Vertex (graph theory); Discrete mathematics; Chordal graph; 1-planar graph; Constructive proof; Robertson–Seymour theorem; Maximal independent set; Clique-sum; Indifference graph; Graph; Line graph; Computer science","score_opus":0.03692080333076946,"score_gpt":0.29245304638469843,"score_spread":0.25553224305392896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018251139","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.21385528,0.000031363576,0.7715837,0.00069884694,0.000053043637,0.00048677702,0.0000048178194,0.0002022662,0.0130839255],"genre_scores_gemma":[0.21171273,0.00001622834,0.7850556,0.0003289875,0.000024390269,0.00008232178,0.0000043397213,0.00005114884,0.0027242885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982298,0.000044380846,0.00025692466,0.0004156218,0.00047265374,0.0005806135],"domain_scores_gemma":[0.99823153,0.00017235897,0.00008618462,0.001112466,0.00011518264,0.00028226033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033908768,0.00022905754,0.00025120785,0.00022066072,0.00013922375,0.00018943974,0.0013909716,0.000050820046,0.000031144373],"category_scores_gemma":[0.000078218785,0.00016999527,0.00008004647,0.0010840268,0.00009177233,0.00028854562,0.00038503204,0.00015853351,0.0002749765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006131351,0.0002013051,0.0014800244,0.00016445461,0.00009455531,0.00022176463,0.0074612475,0.00033785094,0.00070468494,0.96273476,0.00080032845,0.025737735],"study_design_scores_gemma":[0.001078844,0.00076202396,0.0012404589,0.00029523365,0.00003012672,0.00036954103,0.0013274272,0.020044073,0.0036952563,0.96367246,0.006375215,0.00110932],"about_ca_topic_score_codex":0.0000063164516,"about_ca_topic_score_gemma":0.00004224617,"teacher_disagreement_score":0.024628414,"about_ca_system_score_codex":0.000030277753,"about_ca_system_score_gemma":0.000036262707,"threshold_uncertainty_score":0.6932206},"labels":[],"label_agreement":null},{"id":"W2018911022","doi":"10.1016/j.disc.2006.01.009","title":"Improving probability bounds by optimization over subsets","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Pairwise comparison; Maximization; Mathematics; Event (particle physics); Combinatorics; Upper and lower bounds; Simple (philosophy); Set (abstract data type); Joint probability distribution; Discrete mathematics; Mathematical optimization; Computer science; Statistics","score_opus":0.011917030931404926,"score_gpt":0.2303138860464101,"score_spread":0.21839685511500517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018911022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014155229,0.000060714363,0.9817867,0.00015343596,0.00007638794,0.00014361627,0.000007762127,0.00022074812,0.0033953898],"genre_scores_gemma":[0.5038813,0.0000017786165,0.4956917,0.000059731985,0.000031254738,0.000015587946,0.000020013567,0.000012879451,0.00028577755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882823,0.000031850283,0.00031347421,0.00030269354,0.00026723772,0.00025650935],"domain_scores_gemma":[0.9991543,0.0000520007,0.000136809,0.00052994,0.000070652924,0.000056259498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000306823,0.00015159717,0.00015578208,0.000032646243,0.000118961776,0.00034321158,0.00046917828,0.00007369715,0.000019879846],"category_scores_gemma":[0.00004809781,0.00013214911,0.000055053104,0.00019890815,0.000046970647,0.00039568622,0.00012698678,0.000100181314,0.000017594863],"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.00000597941,0.00064805837,0.0006513031,0.0005332118,0.000029149149,0.0000078821695,0.0015897762,0.055358525,0.0069569363,0.9168561,0.009337758,0.0080253305],"study_design_scores_gemma":[0.000108424974,0.000017787715,0.000029718592,0.000020224943,0.0000062876347,0.0000035330274,0.000007403071,0.9039088,0.001082965,0.09458545,0.00005581605,0.00017360008],"about_ca_topic_score_codex":0.000077899436,"about_ca_topic_score_gemma":0.000006066108,"teacher_disagreement_score":0.84855026,"about_ca_system_score_codex":0.000048282338,"about_ca_system_score_gemma":0.00004206212,"threshold_uncertainty_score":0.53888845},"labels":[],"label_agreement":null},{"id":"W2019436781","doi":"10.1016/j.disc.2014.03.024","title":"Elimination schemes and lattices","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University; Mount Allison University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Chordal graph; Induced subgraph; Vertex (graph theory); Distributive property; Discrete mathematics; Graph; Pure mathematics","score_opus":0.020247368989053133,"score_gpt":0.3001867631316433,"score_spread":0.27993939414259017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019436781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032734443,0.000060150884,0.9595518,0.0005942606,0.000030473797,0.00008985219,6.025668e-7,0.000097321994,0.0068410565],"genre_scores_gemma":[0.7102148,0.000013328885,0.2893969,0.000054058022,0.00001923096,0.000009111878,9.180809e-7,0.000008056981,0.00028362384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992795,0.000040334187,0.00012722779,0.00017270519,0.0002162177,0.00016404374],"domain_scores_gemma":[0.9991939,0.00026733548,0.000059645135,0.00037149296,0.000047540994,0.000060084843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000452308,0.00008019223,0.0001025751,0.00007032833,0.00008856197,0.00013234957,0.00037082133,0.000027145119,0.0000060660236],"category_scores_gemma":[0.000254209,0.000064595486,0.000021457181,0.00015817807,0.000073600204,0.00035914226,0.00020646967,0.00006862232,0.000032160842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.899497e-7,0.0000114715685,0.000052173098,0.000054265896,0.0000040401446,4.7935345e-7,0.00063287164,0.0000046659843,0.00041340367,0.98325205,0.000016548673,0.015557467],"study_design_scores_gemma":[0.0001467279,0.00005128143,0.0002819168,0.00003338286,0.000004188128,0.000007718538,0.00011427574,0.26763454,0.0031551744,0.72643495,0.0020041277,0.00013170815],"about_ca_topic_score_codex":3.7124315e-7,"about_ca_topic_score_gemma":6.056619e-7,"teacher_disagreement_score":0.67748034,"about_ca_system_score_codex":0.0000063359253,"about_ca_system_score_gemma":0.000005857232,"threshold_uncertainty_score":0.26341274},"labels":[],"label_agreement":null},{"id":"W2019462839","doi":"10.1016/j.disc.2008.05.025","title":"Generating asymptotically optimal broadcasting schedules to minimize average waiting time","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Schedule; Asymptotically optimal algorithm; Scheduling (production processes); Mathematical optimization; Computer science; Broadcasting (networking); Block (permutation group theory); Mathematics; Heuristic; Algorithm; Combinatorics; Computer network","score_opus":0.01167587249279253,"score_gpt":0.21394774198053612,"score_spread":0.2022718694877436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019462839","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.31937376,0.00005143059,0.6774905,0.000023061346,0.00006992235,0.00018148363,0.0000071737254,0.0004774008,0.002325296],"genre_scores_gemma":[0.32977685,0.00001724827,0.66963774,0.00004219933,0.00020674698,0.000022860162,0.000024030243,0.0001036784,0.00016867086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983976,0.000022313947,0.00054013066,0.00025387201,0.00028782076,0.00049825275],"domain_scores_gemma":[0.9991558,0.00021302188,0.000081416765,0.0003029099,0.00007481133,0.00017204594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015084636,0.00030062214,0.00035455375,0.00009039877,0.00024038185,0.0000649663,0.00020230426,0.00010175902,0.00009155199],"category_scores_gemma":[0.00028207182,0.00031355684,0.00007890798,0.000284646,0.00004264506,0.00020654376,0.000098503544,0.00020637683,0.0002225524],"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.0000025758143,0.000013835901,0.000032468997,0.00008290185,0.000027386082,0.000020084784,0.0010218417,0.9910415,0.0059251636,0.00077690644,0.00008514064,0.0009702421],"study_design_scores_gemma":[0.00019955427,0.000016845925,0.000017468778,0.0001801617,0.0000150142105,0.00004712101,0.000112262576,0.9964518,0.0024501558,0.000090616086,0.000046602956,0.00037242926],"about_ca_topic_score_codex":4.608469e-7,"about_ca_topic_score_gemma":2.4450952e-7,"teacher_disagreement_score":0.010403098,"about_ca_system_score_codex":0.00007418536,"about_ca_system_score_gemma":0.000016815879,"threshold_uncertainty_score":0.99993163},"labels":[],"label_agreement":null},{"id":"W2019579600","doi":"10.1016/j.disc.2012.02.004","title":"Lexicographic products with high reconstruction numbers","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Thompson Rivers University","keywords":"Mathematics; Combinatorics; Lexicographical order; Vertex (graph theory); Discrete mathematics; Transitive relation; Isomorphism (crystallography); Graph","score_opus":0.02913461457382612,"score_gpt":0.2732950647848496,"score_spread":0.24416045021102348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019579600","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9760219,0.00004543843,0.008886139,0.00032935126,0.00015754679,0.00059582427,0.000017873537,0.00028202287,0.0136639355],"genre_scores_gemma":[0.8523414,0.0000080103255,0.1468198,0.000026296264,0.00014015565,0.00011012136,0.000012232504,0.000048685262,0.0004933047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987964,0.00004761355,0.00032135146,0.00020652202,0.00024103267,0.0003871035],"domain_scores_gemma":[0.99872726,0.00018930864,0.00023266999,0.0006330528,0.0000894331,0.00012828836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045962364,0.00022332996,0.00026206725,0.00010240869,0.00019619748,0.000039707924,0.00017725091,0.000080061065,0.00012368044],"category_scores_gemma":[0.000139242,0.00016550433,0.0000721121,0.00051798887,0.00019908178,0.000294103,0.00003344335,0.0001674536,0.00008410835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088758825,0.00020399778,0.0010555852,0.00022381221,0.00006747145,4.5728606e-7,0.001384781,8.701927e-7,0.0005364051,0.99565107,0.0004403797,0.0004262759],"study_design_scores_gemma":[0.00033370618,0.00004607043,0.00042944943,0.00014342288,0.00020031404,0.00019311914,0.0017855718,0.00003480514,0.0076853675,0.9878637,0.0009044732,0.00037995473],"about_ca_topic_score_codex":0.0000043430555,"about_ca_topic_score_gemma":0.0000046737528,"teacher_disagreement_score":0.13793366,"about_ca_system_score_codex":0.000019173445,"about_ca_system_score_gemma":0.00001817824,"threshold_uncertainty_score":0.6749071},"labels":[],"label_agreement":null},{"id":"W2020320404","doi":"10.1016/j.disc.2010.05.028","title":"Maximum independent sets in 3- and 4-regular Hamiltonian graphs","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Indifference graph; Maximal independent set; Hamiltonian path; Chordal graph; Hamiltonian path problem; Discrete mathematics; Hamiltonian (control theory); Pathwidth; Independent set; 1-planar graph; Planar graph; Graph; Line graph","score_opus":0.01348230672936073,"score_gpt":0.281595797223699,"score_spread":0.26811349049433825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020320404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8801459,0.000068206726,0.11562175,0.0005879498,0.00020590995,0.00038588268,0.000005967727,0.00012216934,0.002856251],"genre_scores_gemma":[0.85588664,0.000015199553,0.1438429,0.00006548094,0.000012022269,0.00002764436,0.0000018023646,0.000020279414,0.0001280212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985203,0.000048101192,0.00026888665,0.00035707364,0.00040635842,0.0003992507],"domain_scores_gemma":[0.9987422,0.00013514166,0.000074955555,0.0008518997,0.00004356323,0.00015224253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006789217,0.00017077668,0.00021162441,0.0002587767,0.000089735986,0.00016482224,0.00083996454,0.0000942818,0.000017440636],"category_scores_gemma":[0.00011507504,0.00014605315,0.000049725953,0.00044416482,0.00017575017,0.00036686155,0.00048042522,0.0004377817,0.000028694096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043485666,0.0000912665,0.0024175688,0.000092177186,0.000013658237,0.000068363646,0.0036220653,0.000012175322,0.0072065354,0.97744346,0.000034215107,0.008994187],"study_design_scores_gemma":[0.00035171845,0.00003536193,0.0043632365,0.00003338062,0.0000020486793,0.000060714683,0.00021611249,0.019416196,0.001619888,0.97343236,0.00025154743,0.00021740964],"about_ca_topic_score_codex":0.000006240829,"about_ca_topic_score_gemma":0.000094274474,"teacher_disagreement_score":0.028221158,"about_ca_system_score_codex":0.000013095807,"about_ca_system_score_gemma":0.000029337047,"threshold_uncertainty_score":0.59558743},"labels":[],"label_agreement":null},{"id":"W2020519696","doi":"10.1016/s0012-365x(01)00162-5","title":"Complex Golay sequences: structure and applications","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Manitoba","funders":"","keywords":"Binary Golay code; Mathematics; Hadamard transform; Complementary sequences; Ternary Golay code; Combinatorics; Factorization; Hadamard matrix; Complex Hadamard matrix; Discrete mathematics; Autocorrelation; Algorithm; Mathematical analysis","score_opus":0.05757504967536323,"score_gpt":0.30013171817268813,"score_spread":0.2425566684973249,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020519696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002979168,0.00057208847,0.98134047,0.0022029346,0.000020580994,0.00046354614,0.000015672576,0.00020790595,0.012197659],"genre_scores_gemma":[0.77174723,0.00016753857,0.2274567,0.00012759872,0.000040775234,0.000056341003,0.000008083143,0.000012181759,0.00038357184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990317,0.000052459658,0.00021073995,0.00021544803,0.00027618223,0.00021344906],"domain_scores_gemma":[0.99843764,0.00019413698,0.00008349106,0.0011162721,0.000066881184,0.00010160196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001244049,0.00011180339,0.00014265656,0.000060009963,0.00020492157,0.00024990426,0.0012364322,0.00005009832,0.00012148951],"category_scores_gemma":[0.000023297134,0.000093392046,0.00002741069,0.00037191567,0.00013692619,0.00023018348,0.00046446655,0.00016775209,0.00006141086],"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":[3.3628407e-7,0.000062326806,0.00014218091,0.00012100453,0.000025590372,0.0000022463369,0.002852943,0.00025443497,0.0008932722,0.9565495,0.0024463444,0.036649812],"study_design_scores_gemma":[0.0001272784,0.000016273138,0.00021693364,0.000024133777,0.0000043739424,0.00003324472,0.00010716463,0.93067205,0.00013117095,0.054532845,0.013953085,0.00018145586],"about_ca_topic_score_codex":0.0000028990385,"about_ca_topic_score_gemma":0.000004729181,"teacher_disagreement_score":0.9304176,"about_ca_system_score_codex":0.000021850785,"about_ca_system_score_gemma":0.000009149203,"threshold_uncertainty_score":0.3808417},"labels":[],"label_agreement":null},{"id":"W2020661143","doi":"10.1016/s0012-365x(01)00297-7","title":"Galois theory for minors of finite functions","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Boolean function; Discrete mathematics; Complement (music); Generalization; Closure (psychology); Complete Boolean algebra; Bounded function; Combinatorics; Two-element Boolean algebra; Separable space; Algebra over a field; Pure mathematics","score_opus":0.02510157427757449,"score_gpt":0.23450891319260106,"score_spread":0.20940733891502658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020661143","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011265572,0.00006430797,0.9833069,0.00023806254,0.00022017038,0.00015390664,0.000013748343,0.00006345973,0.0046738763],"genre_scores_gemma":[0.8748355,0.0000056187,0.11816219,0.00009951007,0.00007096281,0.00003479205,0.0000061156966,0.000012267614,0.006773046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993892,0.000017030843,0.00022056392,0.00012890706,0.00011308604,0.0001312321],"domain_scores_gemma":[0.9990679,0.00045817866,0.00011261035,0.00027617574,0.000046024423,0.000039093266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015877378,0.00008104925,0.00013036636,0.000059948,0.000071771996,0.00003414785,0.00029132192,0.000027453423,0.000051488547],"category_scores_gemma":[0.00012014314,0.00006701274,0.0000957622,0.0001603702,0.000034483906,0.00013549271,0.0000658318,0.00003377676,0.000048008154],"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.0000041914927,0.00017478899,0.000023212891,0.00019294886,0.000048421218,9.209409e-7,0.006330102,0.0004467676,0.00045523825,0.9214793,0.0045994665,0.06624468],"study_design_scores_gemma":[0.0003104254,0.00009844486,0.000075719225,0.000041832256,0.000023855697,0.0000043351174,0.00017951874,0.71583587,0.0015476886,0.27930015,0.0024212005,0.00016094769],"about_ca_topic_score_codex":0.0000013742882,"about_ca_topic_score_gemma":8.9006755e-7,"teacher_disagreement_score":0.8651447,"about_ca_system_score_codex":0.000008395039,"about_ca_system_score_gemma":0.000007802889,"threshold_uncertainty_score":0.27327004},"labels":[],"label_agreement":null},{"id":"W2020692437","doi":"10.1016/s0012-365x(02)00622-2","title":"Optimal linear rate 12 codes over F5 and F7","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Separable space; Discrete mathematics; Linear code; Minimum distance; Block code; Algorithm; Decoding methods; Mathematical analysis","score_opus":0.01614580043218577,"score_gpt":0.2490812867798957,"score_spread":0.2329354863477099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020692437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23548318,0.00009388115,0.7548856,0.00011157391,0.00010642051,0.000114130075,0.00000415687,0.0001326061,0.009068422],"genre_scores_gemma":[0.5617948,0.000045191347,0.43741718,0.00024404826,0.000033728036,0.000010980925,0.0000016672707,0.000018594,0.0004338103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991809,0.000073837036,0.00017875932,0.00021845737,0.00013370816,0.0002143184],"domain_scores_gemma":[0.9992268,0.00017190735,0.00007047652,0.000423589,0.00002286697,0.000084326806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051614427,0.0001402544,0.00016851287,0.000060755043,0.00012352162,0.00014820545,0.00030255504,0.00004476091,0.00004167602],"category_scores_gemma":[0.00008471318,0.000115172996,0.00006728563,0.00017352836,0.00008172372,0.00020811902,0.000112926224,0.00009252207,0.000024197805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027669696,0.000039069557,0.00014336065,0.000049467417,0.000022167202,0.000007198679,0.0018820157,0.000051365503,0.00045372994,0.99672914,0.00016563476,0.00045410046],"study_design_scores_gemma":[0.0009683279,0.00024587754,0.0005260936,0.00016682428,0.00006430678,0.000091509995,0.00057877053,0.15844701,0.0104948925,0.81340855,0.014136225,0.0008716015],"about_ca_topic_score_codex":9.155902e-7,"about_ca_topic_score_gemma":0.0000010044197,"teacher_disagreement_score":0.32631162,"about_ca_system_score_codex":0.0000052749165,"about_ca_system_score_gemma":0.000014730883,"threshold_uncertainty_score":0.46966186},"labels":[],"label_agreement":null},{"id":"W2022293262","doi":"10.1016/j.disc.2007.12.052","title":"The effect of redundancy on probability bounds","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Upper and lower bounds; Redundancy (engineering); Combinatorics; Event (particle physics); Discrete mathematics; Linear programming; Value (mathematics); Mathematical optimization; Statistics; Computer science","score_opus":0.1438625415616749,"score_gpt":0.4155693470029621,"score_spread":0.2717068054412872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022293262","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9776559,0.00007767434,0.0063321358,0.00028586108,0.00039377535,0.0005845394,0.000016413387,0.000044223256,0.014609482],"genre_scores_gemma":[0.99052,0.000007898068,0.007711148,0.000024016255,0.000049241124,0.000029211556,0.0000010435463,0.000020831323,0.0016365967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9953451,0.00045563403,0.0012203904,0.0004113799,0.0022636084,0.00030389574],"domain_scores_gemma":[0.98606926,0.011142065,0.0005560165,0.001909349,0.00023117261,0.00009214735],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0062140604,0.00021857477,0.00053057185,0.000119579585,0.0005093856,0.00020521293,0.0013012689,0.000079308695,0.00016286195],"category_scores_gemma":[0.020063234,0.00010314711,0.0002781331,0.0005772065,0.00050964794,0.00013900468,0.00024547701,0.00017613661,0.00032960012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031975666,0.0017706685,0.08215522,0.0012086999,0.00052513514,0.00026389127,0.05469434,0.0020461387,0.014813845,0.3665374,0.11272304,0.36006406],"study_design_scores_gemma":[0.0026697866,0.0023075365,0.020318756,0.00053261186,0.00007674628,0.00017595587,0.0011798361,0.047804136,0.031015845,0.86140275,0.03156985,0.00094620296],"about_ca_topic_score_codex":0.0000032181836,"about_ca_topic_score_gemma":0.0000043920204,"teacher_disagreement_score":0.49486533,"about_ca_system_score_codex":0.000039312672,"about_ca_system_score_gemma":0.000044864508,"threshold_uncertainty_score":0.9881912},"labels":[],"label_agreement":null},{"id":"W2022480780","doi":"10.1016/j.disc.2012.12.018","title":"The bondage number of graphs on topological surfaces and Teschner’s conjecture","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Chordal graph; Pathwidth; Vertex (graph theory); 1-planar graph; Discrete mathematics; Indifference graph; Upper and lower bounds; Graph; Line graph","score_opus":0.01831219561700593,"score_gpt":0.3010492263508283,"score_spread":0.2827370307338224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022480780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94959855,0.00023969164,0.03475821,0.0020018634,0.00007727954,0.00052408024,0.000006458358,0.00009698763,0.012696889],"genre_scores_gemma":[0.96475184,0.00005372136,0.034560774,0.00005704368,0.0000064951328,0.000022011362,4.5856174e-7,0.0000089533905,0.0005386857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893737,0.00007998737,0.00021969854,0.00019900457,0.0003035981,0.00026036258],"domain_scores_gemma":[0.99818057,0.0010015256,0.000101265214,0.0005786035,0.00006463745,0.000073384086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036249662,0.00012859073,0.00018011623,0.000030967938,0.0001743956,0.0001443438,0.00067994284,0.000056471363,0.000045327644],"category_scores_gemma":[0.00021111548,0.00006694067,0.000055744305,0.00021664768,0.0004305878,0.00016268746,0.00027320092,0.00017917526,0.000050576833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023866714,0.000024565483,0.00044368996,0.0000264012,0.000012239251,0.0000018385022,0.00051421736,0.000007872857,0.00042529395,0.9968837,0.00018997725,0.0014678524],"study_design_scores_gemma":[0.00012561453,0.00008480798,0.00077219045,0.000024727067,0.0000029006171,0.000016001279,0.0003592803,0.006897299,0.001977952,0.9893352,0.00029716012,0.00010689006],"about_ca_topic_score_codex":0.0000054831867,"about_ca_topic_score_gemma":0.0000016463504,"teacher_disagreement_score":0.015153315,"about_ca_system_score_codex":0.0000060773555,"about_ca_system_score_gemma":0.000011142093,"threshold_uncertainty_score":0.27297613},"labels":[],"label_agreement":null},{"id":"W2022622575","doi":"10.1016/j.disc.2013.11.024","title":"Jeu-de-taquin promotion and a cyclic sieving phenomenon for semistandard hook tableaux","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Combinatorics; Hook; Bounded function; Mathematics; Young tableau; Set (abstract data type); Order (exchange); Word (group theory); Promotion (chess); Computer science; Geometry; Mathematical analysis","score_opus":0.032729299876964775,"score_gpt":0.3140085391917596,"score_spread":0.2812792393147948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022622575","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.25939608,0.00015687723,0.72698325,0.00080069137,0.00025788328,0.0041536726,0.00006011165,0.0005269223,0.007664535],"genre_scores_gemma":[0.40875855,0.0000463466,0.58657175,0.00006674504,0.0002955204,0.0011888423,0.000020622778,0.0002611193,0.0027904941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975251,0.000060831215,0.00082703895,0.00042798236,0.00043487857,0.0007241796],"domain_scores_gemma":[0.9971174,0.0011788694,0.0005164916,0.00069790543,0.00024812575,0.00024122985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079255877,0.000458177,0.000740571,0.000109504006,0.00026468342,0.00025423573,0.00033229447,0.00019663223,0.00012694417],"category_scores_gemma":[0.0020426847,0.0004077732,0.00015043576,0.00019921533,0.0001267251,0.00041727375,0.00017533267,0.00023081977,0.0000366327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002693558,0.0006099583,0.000060443912,0.0068841386,0.00018026288,0.000004516484,0.010395992,0.000020583026,0.019482013,0.9556719,0.0037575169,0.0029057513],"study_design_scores_gemma":[0.0009882734,0.00022424123,0.000009092819,0.00049106625,0.00014364359,0.000028644554,0.0016732618,0.008684046,0.0033571194,0.98341435,0.00049776456,0.0004884956],"about_ca_topic_score_codex":0.0000048014967,"about_ca_topic_score_gemma":0.0000027520916,"teacher_disagreement_score":0.14936249,"about_ca_system_score_codex":0.00022222378,"about_ca_system_score_gemma":0.0000674375,"threshold_uncertainty_score":0.9998374},"labels":[],"label_agreement":null},{"id":"W2022623224","doi":"10.1016/s0012-365x(00)00213-2","title":"Hedetniemi's conjecture — a survey","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Product (mathematics); Chromatic scale; Discrete mathematics; Geometry","score_opus":0.039637011896771324,"score_gpt":0.3202211428898492,"score_spread":0.2805841309930779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022623224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040826533,0.000108869135,0.9481309,0.0003760738,0.00010029784,0.00022832713,0.000009921272,0.0002323721,0.009986722],"genre_scores_gemma":[0.854973,0.000055170996,0.14205413,0.0002180322,0.000052276057,0.00003019606,0.0000139145395,0.000037792543,0.002565448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984477,0.00013654122,0.0002537774,0.00031675652,0.00041773645,0.00042747444],"domain_scores_gemma":[0.9981773,0.0004886827,0.000090148984,0.0010092722,0.00009372221,0.00014087453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008647606,0.0001730428,0.00022833222,0.00010534564,0.00012751583,0.00017429766,0.001227381,0.000066068664,0.00007256008],"category_scores_gemma":[0.00037225604,0.0001370833,0.00007750388,0.000724019,0.00009686201,0.0003071499,0.00034652185,0.00019781965,0.00022266094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016615537,0.00014314528,0.0036082664,0.00007500035,0.000051828647,0.00012802678,0.0024433895,0.00014959047,0.00059665524,0.98460096,0.0012023835,0.00698415],"study_design_scores_gemma":[0.0006872709,0.00016420662,0.00401851,0.000075386146,0.000008605301,0.00026713847,0.00021697748,0.074742265,0.0016426907,0.9114678,0.006029928,0.0006792486],"about_ca_topic_score_codex":0.000010051164,"about_ca_topic_score_gemma":0.000027368336,"teacher_disagreement_score":0.8141465,"about_ca_system_score_codex":0.000027108657,"about_ca_system_score_gemma":0.00003896484,"threshold_uncertainty_score":0.5590095},"labels":[],"label_agreement":null},{"id":"W2022970434","doi":"10.1016/s0012-365x(03)00246-2","title":"Graph covers using t-colourable vertex sets","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Edge cover; Vertex cover; Clique graph; Vertex (graph theory); Graph; Discrete mathematics; Simplex graph; Cover (algebra); Clique; Line graph; Graph power","score_opus":0.038138243317135084,"score_gpt":0.31519214250982835,"score_spread":0.2770538991926933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022970434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08007611,0.00010446598,0.9013857,0.00006978719,0.0002064874,0.00029127783,0.0000051188863,0.00015623575,0.017704803],"genre_scores_gemma":[0.5577309,0.000017787694,0.44161922,0.000120366414,0.0000047217754,0.000014418926,0.000001627083,0.000033042914,0.00045790552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834996,0.00011355025,0.00026150508,0.00031931206,0.00045280415,0.00050287327],"domain_scores_gemma":[0.9985704,0.00024416388,0.00010843993,0.00084761466,0.00008045224,0.00014892172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005960378,0.00018217714,0.00022785288,0.0001541721,0.0002221585,0.00016726014,0.00077451114,0.00006188162,0.00005026379],"category_scores_gemma":[0.00029292426,0.00016034495,0.00010857521,0.00073014456,0.00011132516,0.00049658463,0.00015001482,0.0001752169,0.00009265475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021921874,0.000051785493,0.00008756221,0.000044567147,0.00002545476,0.00002072568,0.00079061225,0.00087823626,0.0020806838,0.99556845,0.000163029,0.00028666755],"study_design_scores_gemma":[0.00031519617,0.000045129524,0.000013953466,0.00004893535,0.000009818402,0.000058070316,0.00030610122,0.09274652,0.006430071,0.89915705,0.00060131785,0.00026786234],"about_ca_topic_score_codex":0.000002821595,"about_ca_topic_score_gemma":0.0000012532288,"teacher_disagreement_score":0.4776548,"about_ca_system_score_codex":0.000058676975,"about_ca_system_score_gemma":0.00007889753,"threshold_uncertainty_score":0.6538677},"labels":[],"label_agreement":null},{"id":"W2024156610","doi":"10.1016/j.disc.2008.05.016","title":"On the complexity of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si15.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>H</mml:mi></mml:math>-colouring planar graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Planar graph; Scroll; Graph; Discrete mathematics; Planar; Algorithm; Computer science; Computer graphics (images); Theology","score_opus":0.040968302843498644,"score_gpt":0.2736410474955918,"score_spread":0.23267274465209317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024156610","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9661823,0.00009004099,0.02954512,0.0004455964,0.0002274831,0.00014673916,0.000075257485,0.00015827434,0.0031292022],"genre_scores_gemma":[0.9713001,0.000092576825,0.02791099,0.00029394726,0.00008670229,0.00011370935,0.000032011812,0.000085484025,0.000084424435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996537,0.0001458669,0.00072680746,0.0005882334,0.0012371226,0.0007649275],"domain_scores_gemma":[0.9961376,0.0011962806,0.00057787914,0.0017770274,0.00009228757,0.00021889522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010276829,0.00037569934,0.00034006315,0.00017250385,0.00076445437,0.00018244151,0.0019254155,0.0002280858,0.000028663266],"category_scores_gemma":[0.00052471104,0.00033462225,0.0004545688,0.0005982274,0.0011296897,0.00044029506,0.00078846456,0.00061375817,0.00032985292],"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.000080129576,0.00018110084,0.0000139832855,0.0002597307,0.00014104685,0.00012959004,0.0026008338,0.0004696116,0.00071691396,0.9950161,0.00026474925,0.00012619086],"study_design_scores_gemma":[0.00042345034,0.00034264932,0.00009070215,0.00030500707,0.00004392442,0.00018268901,0.00044610596,0.82088643,0.008237867,0.16854048,0.00016988105,0.00033082845],"about_ca_topic_score_codex":0.00004284533,"about_ca_topic_score_gemma":0.000029536735,"teacher_disagreement_score":0.8264756,"about_ca_system_score_codex":0.000018918947,"about_ca_system_score_gemma":0.00015868837,"threshold_uncertainty_score":0.9999106},"labels":[],"label_agreement":null},{"id":"W2024469085","doi":"10.1016/j.disc.2009.04.020","title":"Some bounds on the injective chromatic number of graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Injective function; Chromatic scale; Mathematics; Combinatorics; Discrete mathematics","score_opus":0.023747419379476255,"score_gpt":0.30682949604287385,"score_spread":0.2830820766633976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024469085","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9538206,0.000058987087,0.0005774189,0.00043709052,0.00018187801,0.0005270546,0.000025759418,0.000104021885,0.044267185],"genre_scores_gemma":[0.99073666,0.000020295414,0.008329096,0.0004102839,0.000091348615,0.000017536013,0.0000026612233,0.00003753254,0.0003545592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823266,0.00011259597,0.0005929638,0.00021684171,0.0005239787,0.00032092907],"domain_scores_gemma":[0.99727935,0.0012372363,0.000391464,0.0009456856,0.00008068608,0.00006555898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000615571,0.00030331174,0.00049666385,0.00008880463,0.00029010559,0.000044943452,0.0005325808,0.00012103474,0.0001911224],"category_scores_gemma":[0.0006742217,0.00017199152,0.00029238182,0.00028472222,0.00027156132,0.00011049688,0.000081098246,0.00027045514,0.000025844774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014335387,0.00015223019,0.000041315612,0.00014249532,0.000091989335,0.0000027024398,0.006712969,0.00000164244,0.00016860181,0.9912805,0.0012146899,0.00017655916],"study_design_scores_gemma":[0.0002315998,0.00014176051,0.0003629717,0.0002077309,0.00009043393,0.000022274844,0.0011608142,0.0002937098,0.0022384569,0.9949841,0.000049073,0.00021709247],"about_ca_topic_score_codex":0.0000017874917,"about_ca_topic_score_gemma":6.7804206e-7,"teacher_disagreement_score":0.043912627,"about_ca_system_score_codex":0.000030160021,"about_ca_system_score_gemma":0.000022137663,"threshold_uncertainty_score":0.70136106},"labels":[],"label_agreement":null},{"id":"W2024505149","doi":"10.1016/j.disc.2005.10.020","title":"On the orthogonal Latin squares polytope","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Polytope; Conjecture; Facet (psychology); Intersection (aeronautics); Rank (graph theory); Dimension (graph theory); Birkhoff polytope; Latin square; Class (philosophy); Euler's formula; Graph; Orthogonal array; Discrete mathematics; Statistics; Regular polygon; Computer science","score_opus":0.008075326840339818,"score_gpt":0.1871578789515727,"score_spread":0.1790825521112329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024505149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8362873,0.00010279561,0.005116156,0.00010633063,0.00017028657,0.00018518398,0.000023801595,0.0002490166,0.15775912],"genre_scores_gemma":[0.9986966,0.0000014884981,0.0002532718,0.000032927284,0.00008288546,0.000022970306,0.000007727062,0.000029806182,0.0008722756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999357,0.000023903474,0.00020639348,0.00007636169,0.00016308928,0.00017327203],"domain_scores_gemma":[0.9994522,0.00020481308,0.000031003183,0.00027791673,0.000010383806,0.000023733664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017487843,0.0001328586,0.00012709602,0.000045335444,0.00008078166,0.000047618534,0.00015628032,0.000043472213,0.0001825682],"category_scores_gemma":[0.000020176578,0.00008203559,0.000077588214,0.0001434797,0.00003598053,0.00003118876,0.000013079418,0.00010620636,0.0002066854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016611806,0.000015528198,0.00007367561,0.00006673549,0.000016063634,0.0000026382943,0.00031112498,0.00238793,0.00062576996,0.99341905,0.003014108,0.00006573244],"study_design_scores_gemma":[0.00034839436,0.00006535628,0.0014981094,0.0003003133,0.000046493056,0.000019699968,0.0014240482,0.078038044,0.0075262836,0.90387666,0.0062500816,0.0006065085],"about_ca_topic_score_codex":0.000002852559,"about_ca_topic_score_gemma":0.0000065843287,"teacher_disagreement_score":0.16240934,"about_ca_system_score_codex":0.000009734705,"about_ca_system_score_gemma":0.0000029601072,"threshold_uncertainty_score":0.33453143},"labels":[],"label_agreement":null},{"id":"W2024890934","doi":"10.1016/s0012-365x(01)00099-1","title":"On decomposing Kn−I into cycles of a fixed odd length","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Range (aeronautics); Discrete mathematics","score_opus":0.012571420230017167,"score_gpt":0.21364196119860224,"score_spread":0.20107054096858507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024890934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9565932,0.0003377566,0.008595542,0.000017729093,0.00018019925,0.00015917314,0.000008338868,0.00020599474,0.033902064],"genre_scores_gemma":[0.99673754,0.000019783947,0.0030631977,0.0000072905264,0.000025971918,0.000009098374,0.0000021562869,0.0000360642,0.00009891717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999266,0.000023412651,0.00030822048,0.00009286824,0.00014757688,0.00016189204],"domain_scores_gemma":[0.9994359,0.00014782598,0.000057015182,0.00029625103,0.000014612927,0.00004838245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012923394,0.00014861125,0.0002470075,0.00008096758,0.000045803594,0.000021200358,0.00015010894,0.000059685604,0.00012280646],"category_scores_gemma":[0.000033520126,0.00012910133,0.00009495782,0.00012017072,0.000038344246,0.000057429457,0.000016900149,0.000090183785,0.00009749739],"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.000024559084,0.00048226418,0.00020872043,0.0059544393,0.00056733884,0.000028803086,0.060192928,0.02981297,0.06757921,0.8216905,0.0043142345,0.009144019],"study_design_scores_gemma":[0.00094350067,0.00020818967,0.00011782774,0.0017132801,0.000117549236,0.00003458072,0.0035142885,0.7791804,0.061355546,0.15056404,0.0013251073,0.00092569675],"about_ca_topic_score_codex":0.0000018637384,"about_ca_topic_score_gemma":0.000001960517,"teacher_disagreement_score":0.7493674,"about_ca_system_score_codex":0.000017163407,"about_ca_system_score_gemma":0.000001165413,"threshold_uncertainty_score":0.52645993},"labels":[],"label_agreement":null},{"id":"W2026675463","doi":"10.1016/s0012-365x(02)00447-8","title":"Vertices contained in all or in no minimum total dominating set of a tree","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Dominating set; Vertex (graph theory); Graph; Tree (set theory); Discrete mathematics","score_opus":0.0440434861314269,"score_gpt":0.3371172881744353,"score_spread":0.2930738020430084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026675463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91006017,0.00006852392,0.078679,0.0001466084,0.000075922326,0.00054678624,0.0000066549337,0.000040990253,0.010375321],"genre_scores_gemma":[0.8838701,0.0000047082144,0.115732096,0.00002290193,0.0000058661262,0.000029564346,0.0000012086165,0.00001261169,0.0003209052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984189,0.00015836301,0.000505153,0.00024049275,0.0003136178,0.00036343205],"domain_scores_gemma":[0.9984503,0.0008193017,0.00014228445,0.00046527272,0.00006211001,0.000060773044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009777239,0.00013978023,0.00031794715,0.0002138523,0.00002146154,0.000042970263,0.00054875715,0.00005082258,0.000025777834],"category_scores_gemma":[0.0014204424,0.00010902898,0.000051626637,0.00059768744,0.000077976576,0.00031157106,0.00015817035,0.00014833646,0.000015387746],"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.00022287788,0.00053167046,0.0025470355,0.0010294766,0.00005836329,0.0002892261,0.04108439,0.0004672239,0.017706286,0.93116546,0.000053368152,0.0048446273],"study_design_scores_gemma":[0.006117045,0.000861586,0.0011605227,0.00093232567,0.000017051694,0.0000779828,0.007851073,0.60257673,0.025882458,0.35341656,0.00023067943,0.0008760137],"about_ca_topic_score_codex":0.000008332388,"about_ca_topic_score_gemma":0.0000820259,"teacher_disagreement_score":0.6021095,"about_ca_system_score_codex":0.000046524903,"about_ca_system_score_gemma":0.000060412236,"threshold_uncertainty_score":0.4446073},"labels":[],"label_agreement":null},{"id":"W2027130206","doi":"10.1016/s0012-365x(99)00255-1","title":"Intersection of modules related to Macdonald's polynomials","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Conjecture; Macdonald polynomials; Combinatorics; Intersection (aeronautics); Partition (number theory); Polynomial; Symmetric function; Algebraic number; Tuple; Intersection homology; Discrete mathematics; Pure mathematics; Jacobi polynomials; Orthogonal polynomials; Cohomology","score_opus":0.020937533846628307,"score_gpt":0.312238805753857,"score_spread":0.29130127190722865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027130206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.928615,0.000029851968,0.015325653,0.0002215767,0.0003650515,0.00094569044,0.000039780258,0.00031045367,0.05414695],"genre_scores_gemma":[0.8163514,0.000013198037,0.17702508,0.000043825592,0.00007068111,0.00006685918,0.000008194113,0.00013190623,0.0062888404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744415,0.00007213919,0.0012273885,0.00033299043,0.0005238637,0.00039947947],"domain_scores_gemma":[0.99779904,0.0005993068,0.00038748814,0.00090426457,0.00013619517,0.00017371739],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000512432,0.00035628516,0.0007644359,0.0001824813,0.00008744714,0.000035030378,0.0004703892,0.00016725902,0.0014813256],"category_scores_gemma":[0.0008149009,0.0003209487,0.00023181131,0.0004809312,0.00009776912,0.00017722828,0.000108265405,0.00020387542,0.00030852028],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000728803,0.00052663096,0.000018761484,0.0007439591,0.0001749525,0.000007902567,0.0077661304,0.0002507169,0.004429995,0.9758945,0.0022332193,0.007880356],"study_design_scores_gemma":[0.00056158344,0.00017503326,0.000020423266,0.0004012661,0.00010070323,0.00003220221,0.00075961516,0.0022351372,0.009413566,0.98502165,0.0008973021,0.00038151626],"about_ca_topic_score_codex":0.0000065636623,"about_ca_topic_score_gemma":0.000004368008,"teacher_disagreement_score":0.16169943,"about_ca_system_score_codex":0.00011640829,"about_ca_system_score_gemma":0.000028443728,"threshold_uncertainty_score":0.99992424},"labels":[],"label_agreement":null},{"id":"W2027483825","doi":"10.1016/j.disc.2007.11.048","title":"The coolest way to generate combinations","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; String (physics); Prefix; Order (exchange); Discrete mathematics; Ranking (information retrieval); Position (finance); Computer science; Artificial intelligence","score_opus":0.024482692655504124,"score_gpt":0.25503089231226334,"score_spread":0.2305481996567592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027483825","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.01943836,0.00006581896,0.974715,0.0017460118,0.00023942855,0.00017279555,0.000010349348,0.00010984782,0.0035023824],"genre_scores_gemma":[0.4611336,0.00012757137,0.53294235,0.0006387211,0.00013745205,0.00008130235,0.000021013999,0.000028931492,0.004889061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991568,0.0000241304,0.00019207377,0.00016680926,0.0002621286,0.0001980726],"domain_scores_gemma":[0.9988908,0.0001291352,0.000060331768,0.0007491843,0.00007470522,0.00009579915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016805842,0.00009790683,0.000099894176,0.000030514571,0.00070500426,0.00016956053,0.00091299764,0.000023991699,0.0000051343477],"category_scores_gemma":[0.000060657807,0.000059213264,0.000037960064,0.00023576536,0.000048192847,0.00019374059,0.000414909,0.000071679155,0.00022733168],"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.0000013158447,0.00013158872,0.000034843564,0.000012791609,0.000016003713,0.000020040578,0.0037622675,0.000219034,0.0003133226,0.9496685,0.036221616,0.009598661],"study_design_scores_gemma":[0.00049187726,0.00011920945,0.0016005798,0.000068693735,0.000010207562,0.000121157434,0.00032547524,0.87528545,0.0025491389,0.04686179,0.07208475,0.00048170204],"about_ca_topic_score_codex":0.000006692685,"about_ca_topic_score_gemma":0.0000037973023,"teacher_disagreement_score":0.9028067,"about_ca_system_score_codex":0.000015037752,"about_ca_system_score_gemma":0.000022641016,"threshold_uncertainty_score":0.5422394},"labels":[],"label_agreement":null},{"id":"W2027568724","doi":"10.1016/j.disc.2008.05.033","title":"Sweeping graphs with large clique number","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Combinatorics; Clique; Enhanced Data Rates for GSM Evolution; Monotonic function; Clique number; Discrete mathematics; Upper and lower bounds; Clique-sum; Chordal graph; Graph; Computer science; 1-planar graph","score_opus":0.0245550563354613,"score_gpt":0.29721376348614753,"score_spread":0.27265870715068624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027568724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08447641,0.000029513942,0.894789,0.00018078636,0.000039531533,0.00023012227,0.0000043356113,0.00024284796,0.02000747],"genre_scores_gemma":[0.69268495,0.000030114428,0.3063238,0.00014306259,0.000019106976,0.00003430581,0.0000028488398,0.000029786468,0.00073204824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983519,0.00006363176,0.00024822593,0.0003291311,0.0004889449,0.00051820744],"domain_scores_gemma":[0.9985542,0.00018968688,0.00010619828,0.0009044558,0.000104474646,0.00014097431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003806866,0.0001845117,0.00023673395,0.00009375771,0.00029409473,0.00006798943,0.00088492513,0.000053352163,0.000041649397],"category_scores_gemma":[0.00007271231,0.00013803861,0.00008416502,0.00065377954,0.00015581891,0.00048005357,0.00028759724,0.00023192842,0.00021220034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000546118,0.00007537483,0.0015881063,0.000050675797,0.00002450468,0.0001017215,0.0023366183,0.000016793754,0.00009305464,0.99542034,0.00013804874,0.00014929543],"study_design_scores_gemma":[0.0011768028,0.00018727178,0.0010895344,0.00021134737,0.00001442806,0.0009721188,0.0007721146,0.037903916,0.004009313,0.95049787,0.0023198023,0.0008454884],"about_ca_topic_score_codex":0.0000024875044,"about_ca_topic_score_gemma":0.0000047076164,"teacher_disagreement_score":0.60820854,"about_ca_system_score_codex":0.00003255553,"about_ca_system_score_gemma":0.000052890515,"threshold_uncertainty_score":0.5629051},"labels":[],"label_agreement":null},{"id":"W2027773173","doi":"10.1016/j.disc.2014.07.011","title":"Independent protection in graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Asian Industrial and Economic Development","field":"Social Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Graph; Cardinality (data modeling); Discrete mathematics; Computer science","score_opus":0.037156462146025034,"score_gpt":0.2704268025110541,"score_spread":0.23327034036502908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027773173","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46783257,0.00000596316,0.0073867342,0.0020941866,0.0005309003,0.0007017046,0.0000015827877,0.00008970592,0.52135664],"genre_scores_gemma":[0.99653333,0.0000048943098,0.0013528181,0.000033531283,0.00008258824,0.000037539,0.0000010734902,0.0000063303614,0.0019478713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993281,0.00005385372,0.0001993148,0.000102989776,0.00013517137,0.00018057573],"domain_scores_gemma":[0.9997488,0.000027597182,0.0000704264,0.00008790646,0.000011282374,0.000053972653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008943362,0.00005854502,0.00010937185,0.00006337097,0.00012627365,0.000045977707,0.00011640724,0.00007685374,0.00015980023],"category_scores_gemma":[0.00016815217,0.00005375143,0.00002930274,0.000121715166,0.000052747568,0.00008302533,0.000022948367,0.00009183349,0.00013860715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000983311,0.0001102484,0.0045929467,0.00004636121,0.00001847105,0.0000020565208,0.06900856,0.000040293442,0.000038061324,0.8776554,0.0005988489,0.047878902],"study_design_scores_gemma":[0.0013319091,0.00008081751,0.0091320705,0.00022935866,0.000017089824,0.0000029258372,0.048259214,0.0030780248,0.00030072546,0.8025606,0.1342898,0.0007174688],"about_ca_topic_score_codex":0.00037942186,"about_ca_topic_score_gemma":0.0009283096,"teacher_disagreement_score":0.52870077,"about_ca_system_score_codex":0.000085767795,"about_ca_system_score_gemma":0.0000453311,"threshold_uncertainty_score":0.21919197},"labels":[],"label_agreement":null},{"id":"W2027879769","doi":"10.1016/j.disc.2007.08.059","title":"Equitable coloring planar graphs with large girth","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Mathematics; Combinatorics; Girth (graph theory); Edge coloring; Discrete mathematics; Planar graph; Graph coloring; Graph; Line graph; Graph power","score_opus":0.023172484547257583,"score_gpt":0.2980767138213042,"score_spread":0.2749042292740466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027879769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038085155,0.00007486,0.94257545,0.00008165348,0.00006040091,0.00025762088,0.000006976957,0.00021883236,0.018639036],"genre_scores_gemma":[0.62583286,0.000010046924,0.37301823,0.000094247356,0.000028246543,0.000019469931,0.0000045244938,0.000034622502,0.00095778605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978395,0.000027931608,0.00027878326,0.0003287174,0.00058146636,0.00094360835],"domain_scores_gemma":[0.9984819,0.00031385146,0.000114611226,0.0008165416,0.00008875398,0.00018433029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015088279,0.0001883007,0.00023016601,0.0002030819,0.00026407803,0.00014013458,0.0010188685,0.000052148553,0.000019282093],"category_scores_gemma":[0.0000699292,0.00014122704,0.000060264,0.0008175123,0.000092792216,0.0004944905,0.00029485338,0.00021659481,0.00006960798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016111177,0.00006852475,0.0005422734,0.00007186088,0.00002658262,0.000076678705,0.0013246504,0.000025259056,0.00054349384,0.9967419,0.00007738814,0.00048529188],"study_design_scores_gemma":[0.0015000331,0.0005668336,0.0006263558,0.00023932362,0.00002400636,0.00014430577,0.0025050568,0.021047441,0.015009489,0.95301557,0.0044585806,0.0008630175],"about_ca_topic_score_codex":0.0000023982977,"about_ca_topic_score_gemma":0.000027009897,"teacher_disagreement_score":0.5877477,"about_ca_system_score_codex":0.000038080885,"about_ca_system_score_gemma":0.000036190428,"threshold_uncertainty_score":0.5759072},"labels":[],"label_agreement":null},{"id":"W2027899079","doi":"10.1016/j.disc.2005.06.009","title":"Chromatic numbers and products","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Chromatic scale; Mathematics; Combinatorics; Discrete mathematics; Graph; Graph theory; Product (mathematics); Geometry","score_opus":0.02251451114500187,"score_gpt":0.2876285084972687,"score_spread":0.2651139973522668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027899079","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9513025,0.00029399738,0.0023729845,0.0009328317,0.00016432664,0.00054177095,0.000012815705,0.00025779346,0.04412097],"genre_scores_gemma":[0.812742,0.00003068928,0.1851161,0.0001388447,0.00022205229,0.000019471821,0.0000030555134,0.000054522356,0.0016732566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986958,0.000040089,0.00041230425,0.000260181,0.00028452397,0.00030712847],"domain_scores_gemma":[0.99880725,0.0002975638,0.00016717475,0.00057373685,0.000053478765,0.0001007983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040023559,0.00024486595,0.00034551808,0.00007145508,0.00023287642,0.000059836766,0.00022113818,0.00008876351,0.00012993693],"category_scores_gemma":[0.000559227,0.00018220617,0.00006896656,0.00014844238,0.00018048876,0.00015999445,0.00016253928,0.00015445732,0.000030075335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050646154,0.00007529649,0.000085026164,0.00076791126,0.00007149501,0.000003811663,0.009439286,0.0000017389755,0.00032400148,0.98408395,0.0032074028,0.0019350006],"study_design_scores_gemma":[0.00039267098,0.000037941878,0.000136804,0.00013116344,0.000110261964,0.00011159468,0.00090157916,0.0013057854,0.0020117778,0.990222,0.004262938,0.00037549197],"about_ca_topic_score_codex":0.0000017106865,"about_ca_topic_score_gemma":0.0000058305695,"teacher_disagreement_score":0.18274312,"about_ca_system_score_codex":0.000026148899,"about_ca_system_score_gemma":0.000015819265,"threshold_uncertainty_score":0.7430152},"labels":[],"label_agreement":null},{"id":"W2028246501","doi":"10.1016/s0012-365x(00)00311-3","title":"Ramsey properties of generalised irredundant sets in graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.05613135934968266,"score_gpt":0.2956441910405573,"score_spread":0.23951283169087462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028246501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99098396,0.00025544348,0.0005972112,0.00008856308,0.00014849652,0.00041523308,0.000014261313,0.00006868665,0.007428147],"genre_scores_gemma":[0.9811907,0.00008748151,0.018221151,0.000050318697,0.00002654713,0.000028513165,0.0000040564328,0.000050452945,0.0003407948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981968,0.00008663056,0.00075651763,0.00022893258,0.0003749904,0.0003561743],"domain_scores_gemma":[0.99879813,0.00014475633,0.00027607658,0.00063030707,0.000076873745,0.000073842995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005045015,0.0002661232,0.0005478939,0.00021359808,0.00009800053,0.000028840792,0.00038673726,0.00012619511,0.00009134083],"category_scores_gemma":[0.0003205549,0.00018656395,0.0001845238,0.000351288,0.00022235668,0.00011313208,0.0001473746,0.00018125263,0.0000041498615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063665786,0.00027440875,0.0016606669,0.0009579265,0.00009515135,0.000029003466,0.014943105,0.000025883108,0.0061089722,0.9749052,0.00034267147,0.00059337064],"study_design_scores_gemma":[0.0006640163,0.0000500878,0.0003716175,0.00040434513,0.000053486758,0.000044710305,0.0015379771,0.0019733547,0.007282355,0.9871237,0.00017916546,0.00031518322],"about_ca_topic_score_codex":0.000019005945,"about_ca_topic_score_gemma":0.000026807702,"teacher_disagreement_score":0.01762394,"about_ca_system_score_codex":0.0000257329,"about_ca_system_score_gemma":0.00002630808,"threshold_uncertainty_score":0.7607857},"labels":[],"label_agreement":null},{"id":"W2028544177","doi":"10.1016/j.disc.2009.08.013","title":"Absolute retracts and varieties generated by chordal graphs","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"","keywords":"Mathematics; Chordal graph; Treewidth; Combinatorics; Discrete mathematics; Interval graph; Indifference graph; Pathwidth; Graph; 1-planar graph; Line graph","score_opus":0.013144400365500943,"score_gpt":0.27025405220967247,"score_spread":0.2571096518441715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028544177","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.3571445,0.00020242902,0.6359625,0.00060689537,0.00024401642,0.00042609323,0.000020148198,0.0003429976,0.0050504105],"genre_scores_gemma":[0.70736104,0.000074452706,0.29040298,0.00014595542,0.00004433329,0.000047898342,0.000012628777,0.00003977873,0.0018709089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863,0.000040426054,0.00024650828,0.000334525,0.00036740463,0.00038113495],"domain_scores_gemma":[0.9987244,0.0001813876,0.000096843585,0.00072387693,0.00009453052,0.00017897967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052900315,0.00018168762,0.00019790647,0.00010326386,0.00019252449,0.00029001944,0.00072593795,0.000104179395,0.000027793993],"category_scores_gemma":[0.0001815006,0.00015076577,0.00004784012,0.00038588833,0.00024878548,0.00044768045,0.00030215512,0.00042780416,0.000028496079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003632034,0.000047019108,0.000058659334,0.000045947203,0.000021697811,0.000008339332,0.0011904205,0.000002805516,0.0536679,0.9414303,0.001819473,0.0017038529],"study_design_scores_gemma":[0.00032249236,0.00008306862,0.00028100703,0.000013938881,0.000009302778,0.000058585178,0.000104273604,0.048833217,0.018257197,0.92766595,0.003990277,0.0003806848],"about_ca_topic_score_codex":0.000004495738,"about_ca_topic_score_gemma":0.0000070362794,"teacher_disagreement_score":0.35021657,"about_ca_system_score_codex":0.000006711295,"about_ca_system_score_gemma":0.000026640548,"threshold_uncertainty_score":0.614805},"labels":[],"label_agreement":null},{"id":"W2028659954","doi":"10.1016/j.disc.2012.05.010","title":"Shift graphs on precompact families of finite sets of natural numbers","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Fondo Nacional de Ciencia Tecnología e Innovación; Centre National de la Recherche Scientifique","keywords":"Mathematics; Combinatorics; Homomorphism; Discrete mathematics; Indifference graph; 1-planar graph; Pathwidth; Chordal graph; Maximal independent set; Chromatic scale; Natural number; Graph; Line graph","score_opus":0.028505839719055393,"score_gpt":0.3114435045596719,"score_spread":0.2829376648406165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028659954","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9709754,0.00017013072,0.00052966777,0.000020961568,0.00043316153,0.00030407982,0.00009678561,0.000056366734,0.02741343],"genre_scores_gemma":[0.98039746,0.000023869175,0.019341782,0.000028483475,0.000036713358,0.0000071707113,0.0000099350655,0.00004508509,0.00010949148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825716,0.000085488195,0.000677987,0.00015005919,0.00045366224,0.0003756395],"domain_scores_gemma":[0.9971813,0.0014749152,0.00051772443,0.0006655237,0.00006207826,0.0000984588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005215621,0.00028793965,0.0006186312,0.0001817089,0.00008946908,0.000010833031,0.00035238158,0.00011991113,0.000116928146],"category_scores_gemma":[0.00059829047,0.00020333116,0.0003264519,0.00022632269,0.00025579843,0.00014443877,0.00011555794,0.00022409165,0.0000064375336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004369249,0.00023576531,0.002552724,0.0010782474,0.00019588921,6.686598e-7,0.02314775,0.000010900687,0.00016372002,0.97179395,0.00041861783,0.00035805575],"study_design_scores_gemma":[0.0004418016,0.00011526796,0.0033202767,0.000378491,0.00016060888,0.0000066082316,0.0024062402,0.0003863249,0.008526944,0.98380387,0.00012154659,0.00033202706],"about_ca_topic_score_codex":0.000006919253,"about_ca_topic_score_gemma":0.000003749877,"teacher_disagreement_score":0.027303938,"about_ca_system_score_codex":0.00001622228,"about_ca_system_score_gemma":0.000013378071,"threshold_uncertainty_score":0.8291604},"labels":[],"label_agreement":null},{"id":"W2028666977","doi":"10.1016/j.disc.2009.11.002","title":"Balanced Cayley graphs and balanced planar graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Cayley graph; Chordal graph; Indifference graph; Discrete mathematics; Pathwidth; Clique-sum; Planar graph; 1-planar graph; Graph; Line graph","score_opus":0.016906704231970684,"score_gpt":0.28275048225219723,"score_spread":0.2658437780202266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028666977","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.26413032,0.00087368157,0.71090126,0.0023872936,0.0002549316,0.0010772095,0.000038954742,0.0010934001,0.019242935],"genre_scores_gemma":[0.83422863,0.00015370702,0.16479607,0.00043284128,0.000016310029,0.000022745799,0.0000086420705,0.000023295854,0.00031775946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997957,0.00006982696,0.00036609752,0.00051307346,0.00050244917,0.00059158663],"domain_scores_gemma":[0.99831355,0.00021284758,0.00014226168,0.0010131459,0.00007962669,0.00023857759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043970929,0.00028194868,0.0003786462,0.00023837882,0.00020802529,0.00020236589,0.0010251808,0.00008857997,0.000010981712],"category_scores_gemma":[0.000120449644,0.0002360046,0.00010811019,0.0007349405,0.00016178029,0.00048536266,0.00013667266,0.0002517725,0.000033257264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010599464,0.000058227284,0.0003508262,0.000047409012,0.000020663136,0.000028746888,0.0011568922,0.000011749895,0.0031442803,0.9903571,0.00028526387,0.0045282515],"study_design_scores_gemma":[0.00049700344,0.00016940065,0.0024444584,0.00007067423,0.0000084909325,0.000048157184,0.0001513585,0.011767194,0.0015539293,0.9827614,0.00018825571,0.00033972206],"about_ca_topic_score_codex":0.0000024720205,"about_ca_topic_score_gemma":0.0000027266217,"teacher_disagreement_score":0.5700983,"about_ca_system_score_codex":0.000020499549,"about_ca_system_score_gemma":0.000026573796,"threshold_uncertainty_score":0.9623988},"labels":[],"label_agreement":null},{"id":"W2028813890","doi":"10.1016/j.disc.2004.12.005","title":"Disjoint paths in arborescences","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Digraph; Disjoint sets; Vertex (graph theory); Arc (geometry); Directed graph; Discrete mathematics; Tree (set theory); Graph","score_opus":0.021412973483374637,"score_gpt":0.30044547099507074,"score_spread":0.2790324975116961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028813890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0640418,0.0002187343,0.9210558,0.0016666326,0.00007886679,0.000332495,0.0000037986101,0.00019114919,0.012410733],"genre_scores_gemma":[0.66663456,0.000027766344,0.3329042,0.0000860806,0.000038546277,0.000027675524,0.0000010294906,0.000012130519,0.00026804712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863476,0.000051947118,0.00030327582,0.0002682262,0.00036929565,0.00037250033],"domain_scores_gemma":[0.99898905,0.00016674711,0.00007160374,0.0006513808,0.000031937157,0.00008928013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005044249,0.0001313623,0.00017951967,0.00015211779,0.00005514351,0.00010529422,0.000978994,0.000038483005,0.00002704055],"category_scores_gemma":[0.00014486875,0.00010395176,0.000057798312,0.00047858225,0.00008881022,0.00047706068,0.00029543776,0.0001740603,0.00015158449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027924802,0.0001270178,0.00047630872,0.0000449894,0.00000567421,0.00002075694,0.0035649939,0.000288533,0.0005023635,0.9693896,0.00008157581,0.025495404],"study_design_scores_gemma":[0.00039871325,0.00006817007,0.0011000292,0.00013631476,0.0000027246197,0.000017638737,0.0005148962,0.41597682,0.0036958922,0.57597333,0.0017330887,0.0003823485],"about_ca_topic_score_codex":0.0000026684925,"about_ca_topic_score_gemma":0.000023740693,"teacher_disagreement_score":0.6025927,"about_ca_system_score_codex":0.00004359445,"about_ca_system_score_gemma":0.000029351553,"threshold_uncertainty_score":0.42390296},"labels":[],"label_agreement":null},{"id":"W2029352747","doi":"10.1016/j.disc.2007.12.088","title":"On the complexity of crossings in permutations","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Permutation (music); Minification; Discrete mathematics; Rank (graph theory); Complete bipartite graph; Monochromatic color; Graph; Mathematical optimization","score_opus":0.10620018999446688,"score_gpt":0.3393784880129924,"score_spread":0.23317829801852552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029352747","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53163064,0.000014485271,0.45762768,0.0011098742,0.00002173916,0.00020402082,0.0000059388544,0.000035080728,0.009350573],"genre_scores_gemma":[0.95905393,0.000002871229,0.040672828,0.00006200902,0.000003434148,0.00001229515,7.5442637e-7,0.000005913119,0.0001859529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991344,0.000060821174,0.00021461135,0.00012804203,0.00029500498,0.00016709234],"domain_scores_gemma":[0.99879384,0.00051240105,0.00008104212,0.000530473,0.000052994605,0.000029270075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031931096,0.00007438873,0.00012728391,0.00008344052,0.00016762946,0.000030244291,0.0006806053,0.000019664656,0.00002036883],"category_scores_gemma":[0.00028656377,0.000047974845,0.000048788363,0.0004555186,0.0007692856,0.00013155329,0.00013487136,0.00013207649,0.000025549196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018818146,0.000055463708,0.000081638434,0.00001489587,0.0000028222296,0.00000503129,0.006388285,0.00012113517,0.00024354698,0.99295956,0.000057664973,0.00006806747],"study_design_scores_gemma":[0.00011473413,0.0000316988,0.0015515888,0.000034317898,7.188421e-7,0.0000120956865,0.00023179656,0.049557343,0.0015365585,0.9468462,0.000020572219,0.000062374136],"about_ca_topic_score_codex":0.0000058481155,"about_ca_topic_score_gemma":0.000005168924,"teacher_disagreement_score":0.42742333,"about_ca_system_score_codex":0.000017837488,"about_ca_system_score_gemma":0.000035144338,"threshold_uncertainty_score":0.2834465},"labels":[],"label_agreement":null},{"id":"W2030083434","doi":"10.1016/s0012-365x(03)00287-5","title":"Generalized cover-free families","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"","keywords":"Cover (algebra); Generalization; Mathematics; Set (abstract data type); Combinatorics; Set cover problem; Discrete mathematics; Computer science","score_opus":0.01802210635800287,"score_gpt":0.25065760863665953,"score_spread":0.23263550227865668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030083434","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.016130777,0.00011747094,0.94209033,0.00020276142,0.00026352907,0.00011766611,0.00000413063,0.00011166038,0.040961687],"genre_scores_gemma":[0.21873954,0.000032149157,0.77790487,0.00037605502,0.00005663705,0.0000208989,0.000011560185,0.00001274521,0.0028455388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990729,0.00004953296,0.00022159581,0.00019730345,0.00028711552,0.00017153716],"domain_scores_gemma":[0.99910593,0.00009987775,0.000077404264,0.00058520975,0.00006915357,0.00006241183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025201842,0.000118158925,0.00013819922,0.00008393375,0.000111981106,0.00014478962,0.00048189642,0.000036599125,0.00004668858],"category_scores_gemma":[0.0002324752,0.00010317889,0.00006689468,0.00034727078,0.000022583923,0.0002522054,0.00010582669,0.000053948675,0.0001394739],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.911749e-7,0.000034977715,0.000010818407,0.000020863441,0.000011748703,0.0000017779971,0.00058421004,0.001917536,0.00047357442,0.9916904,0.0044234293,0.00083006633],"study_design_scores_gemma":[0.0009625249,0.00006984621,0.000083898354,0.000027172484,0.000018379258,0.00005238354,0.00014704489,0.2687305,0.017033983,0.64280075,0.069625534,0.00044798694],"about_ca_topic_score_codex":0.0000014783826,"about_ca_topic_score_gemma":0.0000010597957,"teacher_disagreement_score":0.34888965,"about_ca_system_score_codex":0.000019009884,"about_ca_system_score_gemma":0.000050832292,"threshold_uncertainty_score":0.4207513},"labels":[],"label_agreement":null},{"id":"W2030361986","doi":"10.1016/s0012-365x(01)00112-1","title":"On periodically-cyclic Gale 4-polytopes","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Integer (computer science); Discrete mathematics; Computer science","score_opus":0.008232989244292563,"score_gpt":0.20847555361806516,"score_spread":0.2002425643737726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030361986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82582414,0.0001617566,0.009688647,0.000049257236,0.00025033834,0.00017023608,0.000008746462,0.00044180668,0.16340508],"genre_scores_gemma":[0.99786264,0.00004317887,0.0007314412,0.000050378403,0.00006907252,0.000025307963,0.000005337829,0.0000428908,0.0011697278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921715,0.000017734792,0.00023618659,0.00011327393,0.00017361807,0.00024201926],"domain_scores_gemma":[0.99946904,0.00006947343,0.000027433302,0.00033617194,0.000010487635,0.00008738939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012934662,0.00016666432,0.00020432456,0.00006105711,0.00007309109,0.000057622354,0.00017739888,0.000070537484,0.00035712728],"category_scores_gemma":[0.000033698074,0.00013790972,0.00009312204,0.0001344397,0.0000436951,0.00005750317,0.000015837724,0.00012226177,0.0005838236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004479395,0.00034800151,0.00086293084,0.0014429721,0.00033980852,0.00018448604,0.011235241,0.006372155,0.022144003,0.9348329,0.014559022,0.007633711],"study_design_scores_gemma":[0.0034764372,0.000771314,0.0022524928,0.0025138857,0.00030834932,0.000737521,0.007934558,0.28070834,0.036114976,0.51729363,0.14331536,0.0045731515],"about_ca_topic_score_codex":0.000001014159,"about_ca_topic_score_gemma":0.000002204482,"teacher_disagreement_score":0.41753927,"about_ca_system_score_codex":0.000017199462,"about_ca_system_score_gemma":0.0000035727244,"threshold_uncertainty_score":0.75040656},"labels":[],"label_agreement":null},{"id":"W2030620609","doi":"10.1016/s0012-365x(02)00469-7","title":"On the existence and application of incomplete nearly Kirkman triple systems with a hole of size 6 or 12","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Shanghai Jiao Tong University","keywords":"Mathematics; Combinatorics; Existential quantification; Order (exchange); Embedding; Triple system; Discrete mathematics; Steiner system; Pure mathematics; Computer science","score_opus":0.012984800326886172,"score_gpt":0.2039888512577339,"score_spread":0.1910040509308477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030620609","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94774795,0.00016885958,0.039747503,0.000010268388,0.000053865147,0.0007502956,0.000028076449,0.00005555471,0.011437655],"genre_scores_gemma":[0.99864036,0.0000053935837,0.0011482618,0.0000038471867,0.000005806684,0.00006032698,9.768814e-7,0.000019632585,0.00011542236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993468,0.000045623576,0.00027233904,0.000084238985,0.00014942064,0.00010158099],"domain_scores_gemma":[0.9991568,0.0003307557,0.00011901359,0.0003382768,0.000026683767,0.00002852433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003113045,0.00011118428,0.00023604112,0.000026263959,0.00003760559,0.000017778337,0.00011317854,0.000035038927,0.0000064311644],"category_scores_gemma":[0.000066871515,0.00006167973,0.000028467903,0.00013915902,0.0000846718,0.000036372334,0.000007811425,0.000058614034,0.0000027870533],"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.000031447766,0.0000379492,0.00013705048,0.00179536,0.00007481617,9.679676e-7,0.0031725303,0.0017818972,0.0040019066,0.9888616,0.000036213263,0.00006825593],"study_design_scores_gemma":[0.0050953464,0.0024998544,0.0018123692,0.005797824,0.0005681104,0.00025583032,0.05042167,0.6610123,0.05265743,0.21362227,0.0041476684,0.0021093048],"about_ca_topic_score_codex":0.000008096393,"about_ca_topic_score_gemma":0.0000054050547,"teacher_disagreement_score":0.77523935,"about_ca_system_score_codex":0.0000070917577,"about_ca_system_score_gemma":0.000006173078,"threshold_uncertainty_score":0.25152266},"labels":[],"label_agreement":null},{"id":"W2032005618","doi":"10.1016/j.disc.2009.05.029","title":"Adaptable chromatic number of graph products","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Mathematics; Combinatorics; Chromatic scale; Conjecture; Hypergraph; Vertex (graph theory); Graph; Discrete mathematics; Critical graph; Graph power; Line graph","score_opus":0.02673794540202884,"score_gpt":0.30292517599615304,"score_spread":0.2761872305941242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032005618","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9068669,0.0001693347,0.007903092,0.00029256355,0.00026717264,0.00073863973,0.000028984652,0.00023929673,0.083494],"genre_scores_gemma":[0.8514998,0.000018918267,0.14736114,0.00006546926,0.000080474165,0.000009192501,0.000005166703,0.000038152546,0.0009216718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981124,0.000056984274,0.0007204261,0.00026434005,0.00047358518,0.00037228758],"domain_scores_gemma":[0.9981464,0.00026674068,0.00039984993,0.0009527333,0.00014842716,0.00008583211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050149666,0.00029359947,0.000603884,0.000096130636,0.00015816135,0.000029046256,0.0004279227,0.00011749166,0.00025409274],"category_scores_gemma":[0.00063754234,0.00021884592,0.0001904325,0.0004106288,0.0001496219,0.00014553705,0.00008372267,0.00017131167,0.000021050479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010908204,0.00020472055,0.00008097412,0.00072020805,0.00007093988,0.000004745106,0.0038614958,0.00000315522,0.0011334643,0.9915797,0.001857216,0.00047247045],"study_design_scores_gemma":[0.00030326462,0.00007341333,0.0002167474,0.0002060636,0.00011500147,0.000053104075,0.00047598017,0.0002984787,0.006862981,0.9909119,0.00020956226,0.00027350395],"about_ca_topic_score_codex":0.0000022572624,"about_ca_topic_score_gemma":7.0778816e-7,"teacher_disagreement_score":0.13945806,"about_ca_system_score_codex":0.000018774617,"about_ca_system_score_gemma":0.000030146102,"threshold_uncertainty_score":0.89242774},"labels":[],"label_agreement":null},{"id":"W2034251757","doi":"10.1016/j.disc.2008.01.038","title":"Maximal planar graphs of inscribable type and diagonal flips","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Diagonal; Combinatorics; Type (biology); Planar; Discrete mathematics; Chordal graph; Graph; Geometry; Computer science","score_opus":0.038431571477227956,"score_gpt":0.2788313624387978,"score_spread":0.24039979096156985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034251757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69283634,0.000594334,0.29732937,0.00021263795,0.00012449748,0.00031406173,0.000021263048,0.00013431757,0.008433161],"genre_scores_gemma":[0.79111207,0.00015707265,0.20827089,0.00003859195,0.0000135102555,0.000007865571,0.0000043909426,0.000016823611,0.00037877678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989192,0.000035984736,0.00023710559,0.00020966001,0.00034288093,0.0002551993],"domain_scores_gemma":[0.99905133,0.0001795225,0.00008869883,0.00046939304,0.000112739275,0.00009832042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023295516,0.00012142255,0.00021703362,0.00012938022,0.00011565623,0.000024377097,0.00052043214,0.000043286447,0.000013642888],"category_scores_gemma":[0.0001388066,0.000100914054,0.00004215303,0.000530219,0.00025768942,0.00026533668,0.00019588847,0.00012241448,0.000013703995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013964475,0.00006826274,0.0012859637,0.00010658508,0.000025495168,0.00003256989,0.0020013019,0.000011937258,0.0018889587,0.99375397,0.0002724909,0.0005384709],"study_design_scores_gemma":[0.0004981973,0.00029710535,0.002222901,0.00007373241,0.000010330127,0.00024771824,0.00024677604,0.016343893,0.0064843427,0.97229445,0.0009523976,0.0003281798],"about_ca_topic_score_codex":0.0000030521423,"about_ca_topic_score_gemma":0.0000012937656,"teacher_disagreement_score":0.09827573,"about_ca_system_score_codex":0.000008325248,"about_ca_system_score_gemma":0.00004469228,"threshold_uncertainty_score":0.41151556},"labels":[],"label_agreement":null},{"id":"W2034438073","doi":"10.1016/s0012-365x(02)00442-9","title":"A criterion for the applicability of Zeilberger's algorithm to rational functions","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Univerza v Ljubljani","keywords":"Mathematics; Combinatorics; Generating function; Algorithm","score_opus":0.02481368113949652,"score_gpt":0.2568352382709909,"score_spread":0.2320215571314944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034438073","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.0024119224,0.00003149565,0.99377054,0.0027262045,0.00016432165,0.00041909044,0.000024978966,0.000042299052,0.00040913804],"genre_scores_gemma":[0.4083096,0.0000030582592,0.59004295,0.00032263057,0.00018408106,0.00028020228,0.000008965978,0.000011434406,0.00083710166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993048,0.000013354231,0.0002412314,0.00015641746,0.0001644171,0.00011978845],"domain_scores_gemma":[0.99907255,0.00039364665,0.00007441311,0.00033304896,0.000081165344,0.000045158475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019594945,0.000077243865,0.00011234699,0.000034158304,0.00013108429,0.000057267924,0.00032688788,0.00002154403,0.000033506203],"category_scores_gemma":[0.000078152676,0.00005238328,0.00008415926,0.00020774188,0.0000309171,0.0001136281,0.00009699383,0.000035668585,0.000031028],"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.0000075936578,0.0004584239,0.000021245985,0.00017406692,0.000082138475,4.7148805e-7,0.0100597525,0.00193548,0.0019378304,0.31727284,0.016166292,0.6518839],"study_design_scores_gemma":[0.00012506751,0.00005679132,0.00017573881,0.00001106567,0.000010595174,0.0000030399644,0.000088148954,0.9675554,0.00047402232,0.026746824,0.0046711764,0.00008215445],"about_ca_topic_score_codex":0.0000037611396,"about_ca_topic_score_gemma":0.0000018638981,"teacher_disagreement_score":0.9656199,"about_ca_system_score_codex":0.0000147043265,"about_ca_system_score_gemma":0.000011015165,"threshold_uncertainty_score":0.21361281},"labels":[],"label_agreement":null},{"id":"W2034818478","doi":"10.1016/j.disc.2003.11.020","title":"Tight incomplete block designs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Mathematics; Block (permutation group theory); Automorphism; Prime power; Discrete mathematics; Element (criminal law); Upper and lower bounds; Automorphism group; Type (biology); Group (periodic table); Prime (order theory); Physics; Mathematical analysis","score_opus":0.019179472657135925,"score_gpt":0.2161653535992005,"score_spread":0.19698588094206457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034818478","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7349219,0.00037450047,0.16939324,0.000083905354,0.0006260086,0.0005305757,0.000034691977,0.0012613067,0.09277388],"genre_scores_gemma":[0.99283576,0.000007562763,0.006859606,0.000018706993,0.00006277081,0.0000207028,0.000005174962,0.000043853364,0.00014586074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927676,0.000012308548,0.0002465182,0.00009850237,0.0001392931,0.00022659416],"domain_scores_gemma":[0.99954146,0.000035442376,0.00003023303,0.00030210867,0.000014903416,0.00007586056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013559955,0.00016077384,0.00019633239,0.00005672615,0.00006249472,0.000038104714,0.00017940051,0.00006139204,0.00004377665],"category_scores_gemma":[0.00001234731,0.0001383679,0.000082536804,0.00014282235,0.000035042915,0.00006941645,0.000019942114,0.00009972874,0.00033825185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006277458,0.00011147957,0.00008939685,0.0013890425,0.0002620703,0.000058478538,0.01030439,0.050296888,0.031683736,0.9042208,0.00124436,0.0003330683],"study_design_scores_gemma":[0.0020987804,0.00017134061,0.00030275589,0.0009908685,0.00017708648,0.00030165713,0.0025352517,0.036481503,0.06647929,0.87566906,0.012963201,0.0018291762],"about_ca_topic_score_codex":0.0000019332147,"about_ca_topic_score_gemma":0.0000033190881,"teacher_disagreement_score":0.25791386,"about_ca_system_score_codex":0.000032203152,"about_ca_system_score_gemma":0.0000070099627,"threshold_uncertainty_score":0.56424797},"labels":[],"label_agreement":null},{"id":"W2035387780","doi":"10.1016/j.disc.2008.01.026","title":"The existence of regular self-complementary 3-uniform hypergraphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Modulo; Vertex (graph theory); Discrete mathematics; Existential quantification; Set (abstract data type); Graph; Computer science","score_opus":0.07538995794446773,"score_gpt":0.32456908064244394,"score_spread":0.2491791226979762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035387780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9423941,0.0002977508,0.0050762687,0.0005119312,0.0001509151,0.0012210904,0.00007559749,0.00029822174,0.04997414],"genre_scores_gemma":[0.7224525,0.00042306475,0.2738373,0.00005785631,0.00010623566,0.0001084246,0.000021805594,0.00014009935,0.0028526757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735874,0.00013228825,0.0008085453,0.00024311406,0.00091842085,0.0005388728],"domain_scores_gemma":[0.9961423,0.0018906269,0.00033786337,0.0013179771,0.00019582018,0.000115360635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013875443,0.00026164815,0.00043560218,0.000111094334,0.0005399976,0.000032940054,0.0009827719,0.00007833259,0.00011784055],"category_scores_gemma":[0.00055938005,0.0001718848,0.00023550699,0.00042111412,0.0005561234,0.00013033152,0.00029998194,0.00025374943,0.000055158216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033018205,0.0002787213,0.0003243004,0.0005624603,0.00019100275,0.000027103319,0.006990182,0.0000013186941,0.0006620341,0.98759043,0.0030690383,0.00027036297],"study_design_scores_gemma":[0.0005820158,0.0001832606,0.00015492523,0.0001302227,0.000079016296,0.00016418559,0.004798674,0.0022506358,0.004534031,0.9833914,0.0034149217,0.00031671417],"about_ca_topic_score_codex":0.0000093007375,"about_ca_topic_score_gemma":0.000012625457,"teacher_disagreement_score":0.26876104,"about_ca_system_score_codex":0.00005464987,"about_ca_system_score_gemma":0.00006127613,"threshold_uncertainty_score":0.7009259},"labels":[],"label_agreement":null},{"id":"W2035417355","doi":"10.1016/j.disc.2008.04.004","title":"The capture time of a graph","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":74,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; McGill University","keywords":"Chordal graph; Mathematics; Combinatorics; Discrete mathematics; Time complexity; Bounded function; Indifference graph; Graph","score_opus":0.06822045206016554,"score_gpt":0.34083261311603175,"score_spread":0.2726121610558662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035417355","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7970381,0.0002586036,0.040742345,0.0021328952,0.00008477464,0.00044633888,0.000059758066,0.000068269954,0.15916894],"genre_scores_gemma":[0.9792139,0.0000146488255,0.0029348328,0.00004692997,0.000017997912,0.000014474588,0.0000014726584,0.000007707855,0.017748028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876064,0.000056357112,0.00040210516,0.00012041451,0.0005419019,0.00011856112],"domain_scores_gemma":[0.9974152,0.0014830801,0.00021560177,0.0007212568,0.00012205157,0.00004284504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001042078,0.00007228831,0.00016156428,0.000040230367,0.00027081784,0.000033076536,0.0006803703,0.000032529508,0.00016897239],"category_scores_gemma":[0.0008416284,0.000035552745,0.00011285907,0.00041025304,0.0003495295,0.0000523307,0.00006851123,0.000066689274,0.0006014759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013615225,0.00012391669,0.00024673858,0.000011966999,0.00003698608,0.0000036624986,0.016921202,0.000074652766,0.003258332,0.9410167,0.036937073,0.0013551844],"study_design_scores_gemma":[0.0000878479,0.00001540786,0.00035806105,0.000009460578,0.000011099637,0.000028405351,0.0024667578,0.0016448821,0.0016196478,0.9834684,0.010208065,0.00008195505],"about_ca_topic_score_codex":0.0000014139545,"about_ca_topic_score_gemma":0.0000013344693,"teacher_disagreement_score":0.18217584,"about_ca_system_score_codex":0.0000029968016,"about_ca_system_score_gemma":0.00002007629,"threshold_uncertainty_score":0.7730956},"labels":[],"label_agreement":null},{"id":"W2036328331","doi":"10.1016/j.disc.2004.12.004","title":"Self-generating sets, integers with missing blocks, and substitutions","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Sequence (biology); Discrete mathematics; Integer sequence; Enumeration; Generating function; Computer science","score_opus":0.010716206607207889,"score_gpt":0.23314440528652391,"score_spread":0.222428198679316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036328331","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.14031477,0.00034807413,0.8539552,0.0011413663,0.00004433641,0.00013509214,0.0000033559575,0.00038745167,0.0036703453],"genre_scores_gemma":[0.3762154,0.000010477417,0.62351954,0.00013856914,0.000035958314,0.0000051934726,0.0000019876065,0.000008858896,0.00006400719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918836,0.000020619163,0.00019211574,0.00021765068,0.00016645077,0.0002147936],"domain_scores_gemma":[0.9993427,0.000089897214,0.00008599469,0.0003627052,0.00003001365,0.00008871146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022681821,0.00014184194,0.00014884006,0.000051045765,0.0002362084,0.00028346144,0.0002912073,0.00003601557,0.000008610849],"category_scores_gemma":[0.000024884732,0.00010333866,0.00002765291,0.00016386858,0.00006335569,0.0003631868,0.0001151893,0.00009618557,0.00001149766],"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.0000027368444,0.00018616997,0.00017184232,0.00024543892,0.00010604819,0.00003197223,0.021775387,0.00081272476,0.0027067757,0.9272926,0.00052326976,0.046145026],"study_design_scores_gemma":[0.00021552264,0.000030947805,0.000022144652,0.00013602481,0.000024762257,0.00015653837,0.00048061172,0.98746264,0.0026008512,0.0071596093,0.0014628783,0.00024747907],"about_ca_topic_score_codex":0.0000024528515,"about_ca_topic_score_gemma":0.0000051659945,"teacher_disagreement_score":0.98664993,"about_ca_system_score_codex":0.000026930284,"about_ca_system_score_gemma":0.000037352016,"threshold_uncertainty_score":0.4214028},"labels":[],"label_agreement":null},{"id":"W2036371515","doi":"10.1016/s0012-365x(01)00273-4","title":"The stable set polytope and some operations on graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Polytope; Mathematics; Chordal graph; Independent set; Discrete mathematics; Indifference graph; Split graph; Set (abstract data type); Maximal independent set; Clique; 1-planar graph; Graph; Computer science","score_opus":0.03863547424493796,"score_gpt":0.29495089754384707,"score_spread":0.2563154232989091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036371515","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.22060378,0.0041946433,0.70661527,0.021858552,0.00062889815,0.0023815231,0.00009845781,0.00083936966,0.04277948],"genre_scores_gemma":[0.9123515,0.0009481139,0.075556345,0.0006722274,0.000061655825,0.000117260606,0.0000040353843,0.00004723188,0.010241625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895394,0.000060311373,0.00017609968,0.00020827504,0.0003003046,0.00030104522],"domain_scores_gemma":[0.99875,0.00035280132,0.000033099845,0.0007347145,0.00003983096,0.00008960884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034145918,0.00011643516,0.00011236496,0.00006778215,0.00057546986,0.00040103213,0.0006585139,0.00002816834,0.000019818644],"category_scores_gemma":[0.00012416932,0.00007237801,0.000038421113,0.00027860986,0.00015093976,0.00040281273,0.00022579543,0.00014841025,0.00009530248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.998788e-7,0.000022716626,0.000008024348,0.000009750156,0.000009468186,0.0000026437858,0.0011380119,0.00008348842,0.00015676678,0.9963602,0.000463601,0.0017444184],"study_design_scores_gemma":[0.00019440692,0.00010575631,0.000034638815,0.00002839151,0.000004378194,0.000014900971,0.00035862456,0.27541068,0.0011529472,0.7201667,0.0023499383,0.00017863022],"about_ca_topic_score_codex":0.0000019077486,"about_ca_topic_score_gemma":0.00000393299,"teacher_disagreement_score":0.6917477,"about_ca_system_score_codex":0.000012649185,"about_ca_system_score_gemma":0.000007812387,"threshold_uncertainty_score":0.4426107},"labels":[],"label_agreement":null},{"id":"W2036553843","doi":"10.1016/j.disc.2010.03.033","title":"The complexity of colouring by locally semicomplete digraphs","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; University of Victoria","funders":"","keywords":"Homomorphism; Mathematics; Discrete mathematics; Combinatorics; Polynomial","score_opus":0.03142701722840945,"score_gpt":0.2938779925286236,"score_spread":0.26245097530021416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036553843","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.13621862,0.00010962214,0.855488,0.0010737805,0.00021688397,0.00044280654,0.00003406478,0.000158409,0.0062578283],"genre_scores_gemma":[0.8768845,0.000019072519,0.12274302,0.000039966686,0.000018086213,0.000022080363,0.0000033136969,0.000019584808,0.0002503687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984368,0.00006363243,0.00038392865,0.00023541812,0.00048411082,0.00039612243],"domain_scores_gemma":[0.9978036,0.00060075213,0.00020580132,0.0011489341,0.00013128253,0.000109610475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008025783,0.0001534869,0.000222422,0.0000564341,0.0003151767,0.0001393953,0.0020284355,0.000052739888,0.000012033042],"category_scores_gemma":[0.00022337862,0.00010199405,0.00010864547,0.00037844936,0.0011175905,0.00019666698,0.0005279295,0.0003732522,0.000018450468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046155074,0.000042189076,0.00007960439,0.00004256605,0.000020144842,0.0000014213983,0.00051903835,0.0000058420715,0.039631795,0.95786697,0.0003543067,0.00143151],"study_design_scores_gemma":[0.00022417655,0.000060677674,0.00013598004,0.000030375393,0.0000052952128,0.00001554817,0.00016786718,0.047943756,0.025465818,0.9230944,0.0026657202,0.0001904043],"about_ca_topic_score_codex":0.000005674332,"about_ca_topic_score_gemma":0.000028480423,"teacher_disagreement_score":0.7406659,"about_ca_system_score_codex":0.000010073065,"about_ca_system_score_gemma":0.000032824584,"threshold_uncertainty_score":0.41591966},"labels":[],"label_agreement":null},{"id":"W2036576396","doi":"10.1016/j.disc.2014.01.002","title":"Extremal words in morphic subshifts","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Word (group theory); Lexicographical order; Mathematics; Morphism; Closure (psychology); Combinatorics; Alphabet; Simple (philosophy); Binary number; Discrete mathematics; Arithmetic; Linguistics","score_opus":0.012280867258995631,"score_gpt":0.230111695002526,"score_spread":0.21783082774353038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036576396","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.24687438,0.000056427754,0.7404718,0.00045463204,0.00015914987,0.00011385743,0.0000012326523,0.00019998742,0.011668561],"genre_scores_gemma":[0.9236497,0.000003993739,0.0758699,0.00018010491,0.000048689195,0.0000123714135,0.0000018534608,0.000014489082,0.00021889055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988501,0.000060920604,0.00028706546,0.0002551419,0.00024600877,0.0003007566],"domain_scores_gemma":[0.9988983,0.00019634199,0.000089334804,0.0007284802,0.000015837775,0.00007166432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065721944,0.0001486552,0.00021978148,0.00010690183,0.000045722103,0.00013146698,0.0008373614,0.000057584784,0.000034594963],"category_scores_gemma":[0.000106791864,0.00012260725,0.00006208915,0.0003169497,0.00004125802,0.00027181505,0.00022177622,0.00012048537,0.00015027997],"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.0000012197419,0.00007261696,0.000414805,0.00006335947,0.0000054879924,0.000012636132,0.003014541,0.00006619939,0.00038033037,0.987441,0.00014690652,0.00838087],"study_design_scores_gemma":[0.00027704687,0.000030874504,0.0015226186,0.00010821872,0.00000391261,0.000016197615,0.00014763363,0.6607182,0.00055315235,0.3358607,0.0005199931,0.00024145251],"about_ca_topic_score_codex":0.000006404028,"about_ca_topic_score_gemma":0.00000959811,"teacher_disagreement_score":0.67677534,"about_ca_system_score_codex":0.000019719797,"about_ca_system_score_gemma":0.00001506862,"threshold_uncertainty_score":0.49997786},"labels":[],"label_agreement":null},{"id":"W2036867308","doi":"10.1016/j.disc.2006.06.050","title":"Power Hadamard matrices","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Hadamard transform; Combinatorics; Power (physics); Discrete mathematics; Mathematical analysis","score_opus":0.00612364456533038,"score_gpt":0.21358403106871565,"score_spread":0.20746038650338527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036867308","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.600769,0.0006255137,0.08458237,0.000016304977,0.0006069855,0.00019879326,0.000010684106,0.0006447533,0.31254563],"genre_scores_gemma":[0.996383,0.000010514734,0.0030651605,0.000015691978,0.000051011746,0.0000045878332,0.0000028650006,0.000036634876,0.00043051987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923754,0.000007097171,0.00026571332,0.000081872204,0.00015580049,0.0002519961],"domain_scores_gemma":[0.9995467,0.00008107992,0.00003317861,0.00024994608,0.000016246453,0.00007285128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040974273,0.00013397956,0.00016171703,0.00007676153,0.000042388976,0.000036393525,0.00015151192,0.00006643211,0.0001551494],"category_scores_gemma":[0.000015998423,0.00011344948,0.00007671385,0.00016403064,0.00002516436,0.00007668524,0.000016785356,0.00008924625,0.0002516585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028153496,0.00016300008,0.0014565436,0.0024849281,0.00046566295,0.00015774355,0.019767188,0.001530215,0.018642182,0.9370073,0.015234141,0.0030629497],"study_design_scores_gemma":[0.003315582,0.00044950738,0.0071354546,0.0018889597,0.00042505068,0.00063487526,0.046216194,0.059633173,0.11443099,0.4495265,0.3101643,0.006179424],"about_ca_topic_score_codex":7.2202533e-7,"about_ca_topic_score_gemma":0.0000019906981,"teacher_disagreement_score":0.48748082,"about_ca_system_score_codex":0.000016156513,"about_ca_system_score_gemma":0.0000023428418,"threshold_uncertainty_score":0.46263355},"labels":[],"label_agreement":null},{"id":"W2036902154","doi":"10.1016/s0012-365x(00)00402-7","title":"On chromatic roots of large subdivisions of graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Subdivision; Mathematics; Chromatic scale; Combinatorics; Chromatic polynomial; Graph; Discrete mathematics; Geography","score_opus":0.03589829816462702,"score_gpt":0.31512349734950185,"score_spread":0.2792251991848748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036902154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90748143,0.00017344693,0.054054417,0.000108077424,0.00043033843,0.0013092933,0.00017056336,0.00022646379,0.036045954],"genre_scores_gemma":[0.92410403,0.000027193173,0.07515558,0.000018499499,0.000023964161,0.00003471041,0.0000043329333,0.00010227659,0.00052938383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99676996,0.00008458889,0.0014445863,0.00029469468,0.0009234704,0.00048267443],"domain_scores_gemma":[0.9948306,0.0023023505,0.0011148317,0.0013994043,0.00021300299,0.00013982355],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053982285,0.00041083575,0.0011059603,0.00027908938,0.00009935047,0.000016431453,0.00061580155,0.00017155513,0.0007703208],"category_scores_gemma":[0.0027431238,0.00034261929,0.00036663978,0.00060497166,0.00017249053,0.00013776342,0.0001782562,0.00024560286,0.00010789397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068949334,0.0015304906,0.000023548611,0.001920022,0.00010106488,0.0000049682517,0.002402542,0.0000131148145,0.0012920077,0.99121374,0.0013950025,0.00009661322],"study_design_scores_gemma":[0.0009594891,0.00030989613,0.000026946225,0.00095173647,0.00015083821,0.000009365813,0.0006185232,0.008210562,0.0074835084,0.9809109,0.000045027045,0.0003232362],"about_ca_topic_score_codex":0.000001079898,"about_ca_topic_score_gemma":0.0000022611982,"teacher_disagreement_score":0.03551657,"about_ca_system_score_codex":0.000045035584,"about_ca_system_score_gemma":0.000016393155,"threshold_uncertainty_score":0.9999026},"labels":[],"label_agreement":null},{"id":"W2037002007","doi":"10.1016/s0012-365x(00)00260-0","title":"Thomason's algorithm for finding a second hamiltonian circuit through a given edge in a cubic graph is exponential on Krawczyk's graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Cubic graph; Corollary; Combinatorics; Discrete mathematics; Planar graph; Exponential function; Constructive; Hamiltonian path; Algorithm; Hamiltonian (control theory); Graph; Line graph; Voltage graph; Mathematical analysis; Computer science","score_opus":0.04762917201134028,"score_gpt":0.3176212309829411,"score_spread":0.26999205897160083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037002007","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.0472972,0.00015500908,0.9466462,0.00033582703,0.00022364444,0.0011662805,0.00007887888,0.0001639759,0.0039329664],"genre_scores_gemma":[0.41207865,0.00019132368,0.58319175,0.00073055865,0.000178079,0.0009228102,0.000038813698,0.00018267022,0.0024853426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968851,0.00011723237,0.00056835613,0.00080317206,0.00063527684,0.000990842],"domain_scores_gemma":[0.9977635,0.00057337177,0.00023481998,0.0011652013,0.000097414275,0.00016565275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007439528,0.00040728634,0.00052949635,0.00054814125,0.00030094036,0.00028910494,0.0015207108,0.00015599433,0.00008922371],"category_scores_gemma":[0.0000895264,0.00037816606,0.00034611044,0.0014168478,0.00018228307,0.0007568853,0.00025140442,0.00038551455,0.000053967135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053004584,0.00067102816,0.00021925941,0.00039287648,0.00016846468,0.00023741335,0.03415985,0.00005189122,0.0020758852,0.91478014,0.0011856011,0.046004612],"study_design_scores_gemma":[0.0014561708,0.00030887756,0.00012706898,0.0002634586,0.00001501049,0.00006318927,0.0006417,0.05515149,0.0031966409,0.9349495,0.0032696745,0.00055719214],"about_ca_topic_score_codex":0.0000066121447,"about_ca_topic_score_gemma":0.000026267913,"teacher_disagreement_score":0.36478144,"about_ca_system_score_codex":0.000086295026,"about_ca_system_score_gemma":0.000059750197,"threshold_uncertainty_score":0.999867},"labels":[],"label_agreement":null},{"id":"W2037123085","doi":"10.1016/j.disc.2004.02.024","title":"A characterization of pancyclic complements of line graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Characterization (materials science); Line (geometry); Pancyclic graph; Discrete mathematics; Graph; Chordal graph; 1-planar graph; Physics; Geometry","score_opus":0.044991997299765475,"score_gpt":0.324081271733818,"score_spread":0.2790892744340525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037123085","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97100645,0.000009552184,0.026356552,0.00010611983,0.000017863034,0.0003737729,0.00014612966,0.00004145301,0.0019420921],"genre_scores_gemma":[0.95655125,0.000016889036,0.043092206,0.000019093724,0.000022007534,0.00003403761,0.00006281163,0.000023015346,0.00017866668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988235,0.000031033534,0.00068132416,0.000116832976,0.00020715698,0.0001401574],"domain_scores_gemma":[0.99874836,0.00015837583,0.000526975,0.00043189907,0.000093668,0.00004070704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027117113,0.00012991256,0.00032968598,0.000099742145,0.000045220768,0.000006320107,0.0002065701,0.000047719142,0.00016015445],"category_scores_gemma":[0.00008095272,0.00011270984,0.00012230595,0.00025561368,0.00008918599,0.000079216086,0.000046914225,0.000060357368,0.000011710927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005487243,0.0002856531,0.00011175595,0.0003603016,0.000046248195,8.831285e-8,0.0015416223,0.0000022696815,0.114091225,0.88297874,0.00003001405,0.0005466062],"study_design_scores_gemma":[0.00039600016,0.000053232085,0.00033549438,0.00017001657,0.000109720066,0.0000026351524,0.00029235496,0.0017758847,0.12867756,0.86752015,0.00051374687,0.00015319558],"about_ca_topic_score_codex":0.0000011930106,"about_ca_topic_score_gemma":0.0000036817955,"teacher_disagreement_score":0.016735654,"about_ca_system_score_codex":0.000009611322,"about_ca_system_score_gemma":0.000012124134,"threshold_uncertainty_score":0.45961738},"labels":[],"label_agreement":null},{"id":"W2037418399","doi":"10.1016/s0012-365x(03)00081-5","title":"General constructions of c-Bhaskar Rao designs and the (c,λ) spectrum of a c-BRD(v,k,λ)","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BGC Engineering (Canada)","funders":"","keywords":"Mathematics; Hadamard transform; Combinatorics; Order (exchange); Spectrum (functional analysis); Group (periodic table); Construct (python library); Series (stratigraphy); Discrete mathematics; Computer science; Mathematical analysis; Physics","score_opus":0.010786752776677944,"score_gpt":0.2004288778269069,"score_spread":0.18964212505022895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037418399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91918576,0.0006939599,0.05573514,0.00003078221,0.00022192778,0.00038234444,0.000047679376,0.000063784726,0.02363865],"genre_scores_gemma":[0.9946257,0.000037640697,0.00517142,0.0000037917089,0.00001347932,0.000012023601,9.232863e-7,0.000017279908,0.00011773959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932444,0.00006277694,0.00032416417,0.00006552702,0.000099143515,0.00012394392],"domain_scores_gemma":[0.99948585,0.00013814798,0.00008017362,0.00024753046,0.00001752574,0.000030797277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003429908,0.00010816283,0.00028161635,0.00004739011,0.000041914664,0.000008443928,0.000087581146,0.000043299853,0.00003886119],"category_scores_gemma":[0.000046206147,0.0000730333,0.000084299965,0.00013389363,0.00028639726,0.000035224646,0.000010421263,0.00007003606,0.000002453642],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054257007,0.000012086108,0.000098568045,0.000312096,0.00009499879,5.397932e-7,0.0023205343,0.0006270135,0.0035304807,0.99289036,0.00007307597,0.000034851746],"study_design_scores_gemma":[0.0028526415,0.000087993016,0.00014945917,0.00031215505,0.00031985083,0.00028423918,0.0088007245,0.04604402,0.11359415,0.8261262,0.0009424484,0.00048609238],"about_ca_topic_score_codex":0.000003851711,"about_ca_topic_score_gemma":0.0000026459127,"teacher_disagreement_score":0.16676411,"about_ca_system_score_codex":0.000005360664,"about_ca_system_score_gemma":0.000008050099,"threshold_uncertainty_score":0.29782116},"labels":[],"label_agreement":null},{"id":"W2037821860","doi":"10.1016/s0012-365x(00)00247-8","title":"Characterization of Zm-well-covered graphs for some classes of graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Mathematics; Combinatorics; Characterization (materials science); Discrete mathematics; Indifference graph; Chordal graph; Graph","score_opus":0.027794869945388264,"score_gpt":0.29900215391933355,"score_spread":0.2712072839739453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037821860","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.419404,0.000032090957,0.5793183,0.00008314264,0.00007337669,0.0004489924,0.000040177372,0.000048732683,0.00055119547],"genre_scores_gemma":[0.9324289,0.00017619914,0.066927694,0.000037451635,0.00001699057,0.00005791866,0.000036309077,0.000029602339,0.0002889552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850714,0.000045636076,0.00051852356,0.00024779208,0.00038746957,0.000293465],"domain_scores_gemma":[0.9983292,0.0002985882,0.00039055332,0.0007126991,0.00020174304,0.00006721668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003856594,0.00015856652,0.00035208184,0.00027458332,0.000064696316,0.000036736812,0.0008057959,0.00005608734,0.00001577171],"category_scores_gemma":[0.00012286621,0.00013708393,0.00018560453,0.00059479295,0.00015228459,0.00058392243,0.00015333151,0.00007445043,0.0000063119132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023552733,0.000118602926,0.00022866263,0.00032281608,0.000036317768,0.0000015044457,0.00060227007,0.000015427016,0.13113862,0.8665366,0.000014558163,0.00096105906],"study_design_scores_gemma":[0.00042360302,0.00017297371,0.0003986058,0.000092200156,0.000015689222,0.000007592994,0.00010838022,0.015686793,0.1279893,0.8547227,0.00021306911,0.00016909686],"about_ca_topic_score_codex":0.000001434619,"about_ca_topic_score_gemma":9.1059115e-7,"teacher_disagreement_score":0.51302487,"about_ca_system_score_codex":0.000011860336,"about_ca_system_score_gemma":0.00003537079,"threshold_uncertainty_score":0.55901206},"labels":[],"label_agreement":null},{"id":"W2037974267","doi":"10.1016/s0012-365x(00)00368-x","title":"The cyclic structure of unimodal permutations","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Disjoint sets; Noncommutative geometry; Class (philosophy); Permutation (music); Discrete mathematics; Pure mathematics; Computer science","score_opus":0.02397954122586825,"score_gpt":0.32028258861241693,"score_spread":0.29630304738654867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037974267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8785377,0.0001695349,0.104486,0.00060599414,0.0006269159,0.0010743163,0.00007096613,0.00028005848,0.014148523],"genre_scores_gemma":[0.94170797,0.00005267037,0.057019096,0.000017280949,0.00011175908,0.00002178202,0.0000074747277,0.00008396918,0.0009780168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99781674,0.000071732815,0.0008806417,0.00021635558,0.00060001283,0.00041451317],"domain_scores_gemma":[0.9959486,0.0020766878,0.00059374643,0.001049081,0.00023021546,0.000101682584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028903593,0.0003006224,0.0004736013,0.00007637214,0.0003514065,0.000064804626,0.000656296,0.00012540538,0.00008282029],"category_scores_gemma":[0.0019226838,0.00019906079,0.00018174853,0.00045442223,0.00026801886,0.00014650454,0.00015168532,0.00025901862,0.000019333893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010648598,0.00010715871,0.000055167395,0.00019087557,0.00007147256,0.00000457027,0.002197425,0.000037275448,0.002508314,0.99414724,0.00032587576,0.00034396065],"study_design_scores_gemma":[0.00037361792,0.000053211636,0.000034719338,0.00009432294,0.00010022568,0.000054649576,0.00217686,0.0021051527,0.0030537662,0.99065435,0.0010690584,0.00023005932],"about_ca_topic_score_codex":0.0000034108684,"about_ca_topic_score_gemma":0.000026529078,"teacher_disagreement_score":0.06317026,"about_ca_system_score_codex":0.000059775084,"about_ca_system_score_gemma":0.000056746045,"threshold_uncertainty_score":0.8117463},"labels":[],"label_agreement":null},{"id":"W2038467436","doi":"10.1016/j.disc.2009.01.001","title":"Hamiltonian cycles in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>c</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-circulant digraphs","year":2009,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Mathematics; Algorithm","score_opus":0.01930495299547091,"score_gpt":0.2547848728405514,"score_spread":0.2354799198450805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038467436","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89363587,0.0027490107,0.004796771,0.0015745566,0.0026619965,0.00051376806,0.0029837228,0.0011928205,0.089891486],"genre_scores_gemma":[0.96960926,0.0027655447,0.013178967,0.0024862995,0.0027980204,0.0032594348,0.0031095927,0.0021710908,0.0006218012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9760638,0.0012007535,0.00625522,0.0046593896,0.005720107,0.006100724],"domain_scores_gemma":[0.9803551,0.00462032,0.005810221,0.005754959,0.00062433357,0.0028351],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005528894,0.0033019695,0.0017775595,0.0017261006,0.00425829,0.003701576,0.006066701,0.005416116,0.016738342],"category_scores_gemma":[0.0038881297,0.005240978,0.005322746,0.003683086,0.0039625913,0.002849236,0.0035545144,0.004837895,0.004863516],"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.0015574732,0.0022172632,0.000032265747,0.0042790473,0.0034128001,0.0015665441,0.008218858,0.0016998785,0.0060588922,0.90915734,0.059200704,0.0025989634],"study_design_scores_gemma":[0.007127541,0.003946078,0.00022744575,0.008111108,0.007939702,0.0049022385,0.012087888,0.24542594,0.6020605,0.08960916,0.010346189,0.008216202],"about_ca_topic_score_codex":0.0013785756,"about_ca_topic_score_gemma":0.001607479,"teacher_disagreement_score":0.81954813,"about_ca_system_score_codex":0.00011600787,"about_ca_system_score_gemma":0.0020642644,"threshold_uncertainty_score":0.999311},"labels":[],"label_agreement":null},{"id":"W2038755312","doi":"10.1016/j.disc.2009.08.011","title":"Vertex-transitive self-complementary uniform hypergraphs of prime order","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Transitive relation; Vertex (graph theory); Prime (order theory); Discrete mathematics; Order (exchange); Graph","score_opus":0.035175078841656715,"score_gpt":0.3266885821138939,"score_spread":0.2915135032722372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038755312","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.866574,0.000103372586,0.019283473,0.0008420875,0.00012757855,0.001842773,0.00018285298,0.00050221925,0.11054165],"genre_scores_gemma":[0.8407481,0.00002798373,0.15857731,0.000112496185,0.000037334725,0.000019094614,0.00004070211,0.00007113726,0.00036586582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746037,0.00011369613,0.0007915089,0.00030520846,0.0007667468,0.0005624805],"domain_scores_gemma":[0.99771196,0.00075821823,0.00025959255,0.0008429796,0.00028263655,0.00014458818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089027104,0.00034196666,0.00063576584,0.00024663017,0.00010583206,0.000033456658,0.00055878935,0.00012097228,0.0003297962],"category_scores_gemma":[0.0003139396,0.000289544,0.00019817064,0.0006457495,0.00014406636,0.00015026044,0.00009355284,0.00028992593,0.000038105838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097327174,0.0014310686,0.00016566635,0.00083751226,0.00038403465,0.0000301877,0.0149944555,0.0000035737946,0.007351912,0.9725945,0.0006333749,0.001476408],"study_design_scores_gemma":[0.001191603,0.00052574323,0.00020442944,0.00025368668,0.0001975027,0.000032947926,0.0033066217,0.0060178176,0.014702255,0.9728989,0.00020934035,0.00045915807],"about_ca_topic_score_codex":0.000010009643,"about_ca_topic_score_gemma":0.000009143906,"teacher_disagreement_score":0.13929383,"about_ca_system_score_codex":0.00007129349,"about_ca_system_score_gemma":0.00008250916,"threshold_uncertainty_score":0.99995565},"labels":[],"label_agreement":null},{"id":"W2040201663","doi":"10.1016/j.disc.2007.07.098","title":"Disjoint triangles and quadrilaterals in a graph","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Graph; Quadrilateral; Discrete mathematics; Simple graph; Order (exchange)","score_opus":0.009345719196038967,"score_gpt":0.21952165460769377,"score_spread":0.2101759354116548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040201663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9791372,0.00038796212,0.011460375,0.000014829527,0.00011486138,0.0001734891,0.000005379945,0.00012304621,0.00858285],"genre_scores_gemma":[0.99859506,0.000024695762,0.0012413583,0.000008550697,0.000023401853,0.000008410067,0.0000025074633,0.00002193541,0.0000741088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993049,0.000013056362,0.00030689038,0.00008633553,0.00008193573,0.00020689027],"domain_scores_gemma":[0.99967206,0.00008512507,0.000026282341,0.00015338162,0.0000059828044,0.00005718488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005083321,0.000119932265,0.00020073006,0.0001280317,0.00002174056,0.000028624001,0.000065975306,0.000056167268,0.000014223376],"category_scores_gemma":[0.000018471555,0.00010000193,0.000044414315,0.00015558283,0.000031863783,0.00006617472,0.0000139180165,0.0000789649,0.000012082968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008254493,0.00024021896,0.011988314,0.004591372,0.00028120197,0.00026415515,0.068150565,0.0014063763,0.034378868,0.8682576,0.0007068985,0.009651913],"study_design_scores_gemma":[0.0038826987,0.00019282218,0.028941184,0.0019172642,0.000116153366,0.0002493696,0.020897865,0.04182371,0.02751872,0.8686566,0.003555838,0.0022477747],"about_ca_topic_score_codex":0.000003913856,"about_ca_topic_score_gemma":0.00003696648,"teacher_disagreement_score":0.0472527,"about_ca_system_score_codex":0.000010782086,"about_ca_system_score_gemma":0.0000013740585,"threshold_uncertainty_score":0.40779606},"labels":[],"label_agreement":null},{"id":"W2040241884","doi":"10.1016/j.disc.2007.10.002","title":"Open irredundance and maximum degree in graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University; University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Degree (music); Vertex (graph theory); Graph; Cardinality (data modeling); Discrete mathematics; Independent set; Computer science","score_opus":0.07577418455312727,"score_gpt":0.3270013896165228,"score_spread":0.2512272050633955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040241884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30421165,0.0005718169,0.64735746,0.00094919425,0.00011781927,0.0011013636,0.000009167143,0.00016855747,0.04551295],"genre_scores_gemma":[0.64108884,0.00014739462,0.35786954,0.00010390874,0.000008164305,0.000056618024,0.0000015226973,0.000021566275,0.00070245593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987174,0.000057019475,0.000259472,0.00034788984,0.00027357118,0.00034464707],"domain_scores_gemma":[0.9988787,0.00017541564,0.00007632697,0.0007228997,0.000038680377,0.00010797695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004416222,0.0001436756,0.00023728967,0.00015599719,0.0001481232,0.0001624943,0.0018116646,0.000042528904,0.000010189319],"category_scores_gemma":[0.000114304385,0.00012344458,0.00003422983,0.0005998624,0.00021952597,0.00074974005,0.0013073675,0.00017085472,0.000030467985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009687635,0.00009979896,0.002164545,0.000076012315,0.000011432615,0.00013703873,0.0046145613,0.000014657217,0.00025852476,0.98080873,0.00017232166,0.011632664],"study_design_scores_gemma":[0.000460854,0.00005248223,0.0043235426,0.00006680346,0.0000014917584,0.0001365933,0.0001718016,0.010021557,0.00044164227,0.98378044,0.00032500556,0.00021776426],"about_ca_topic_score_codex":0.000013373582,"about_ca_topic_score_gemma":0.000022768261,"teacher_disagreement_score":0.33687717,"about_ca_system_score_codex":0.000020599997,"about_ca_system_score_gemma":0.00004231779,"threshold_uncertainty_score":0.5033924},"labels":[],"label_agreement":null},{"id":"W2040440669","doi":"10.1016/j.disc.2009.03.018","title":"All countable monoids embed into the monoid of the infinite random graph","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Monoid; Mathematics; Countable set; Syntactic monoid; Endomorphism; Free monoid; Combinatorics; Undecidable problem; Discrete mathematics; Graph; Decidability","score_opus":0.021322646506343676,"score_gpt":0.30491185600556237,"score_spread":0.2835892094992187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040440669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8506223,0.0007001399,0.10509725,0.004109553,0.00047635252,0.0018736722,0.000040938205,0.00024888755,0.036830936],"genre_scores_gemma":[0.9753091,0.00009259189,0.021953505,0.00089067424,0.00006864013,0.00003762848,0.0000062021318,0.00004158354,0.001600084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825007,0.00018490374,0.0006682663,0.00020493405,0.00034392445,0.0003479335],"domain_scores_gemma":[0.99705404,0.0012124943,0.00044768275,0.0011347785,0.00009397216,0.000057042456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092460256,0.00028204237,0.0005181986,0.00005729858,0.00027578435,0.000027898845,0.00077394606,0.00015696861,0.000082647086],"category_scores_gemma":[0.00072089856,0.00014707247,0.0002870543,0.00028373,0.00042791342,0.00012361375,0.00011934733,0.0003558257,0.000019852134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010122204,0.0002035132,0.000093111536,0.00015234479,0.00014220308,0.0000025912666,0.02117741,0.00016226203,0.0013941922,0.9746115,0.0014856026,0.0004740284],"study_design_scores_gemma":[0.0009277316,0.000055462428,0.00007933091,0.00008324268,0.0001651581,0.000011517453,0.0022369744,0.0016256989,0.003641817,0.9899431,0.0010387833,0.00019118143],"about_ca_topic_score_codex":0.000008143787,"about_ca_topic_score_gemma":0.000016886106,"teacher_disagreement_score":0.12468682,"about_ca_system_score_codex":0.0000272513,"about_ca_system_score_gemma":0.000037058424,"threshold_uncertainty_score":0.59974414},"labels":[],"label_agreement":null},{"id":"W2040487904","doi":"10.1016/j.disc.2009.04.009","title":"Generalizations of Świerczkowski’s lemma and the arity gap of finite functions","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arity; Mathematics; Unary operation; Lemma (botany); Generalization; Discrete mathematics; Projection (relational algebra); Finite set; Characterization (materials science); Combinatorics; Set (abstract data type); Algorithm; Computer science; Mathematical analysis","score_opus":0.023876523985910506,"score_gpt":0.25396668351699736,"score_spread":0.23009015953108686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040487904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0132860625,0.000187315,0.9808003,0.00085143745,0.000041095715,0.00013459333,0.000007673112,0.00002870922,0.004662828],"genre_scores_gemma":[0.9202912,0.000049788945,0.07929002,0.000121516954,0.000014612751,0.000004625664,0.000002903435,0.0000032504322,0.00022209695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993617,0.000034432196,0.00026059733,0.00010818999,0.00013640196,0.000098695025],"domain_scores_gemma":[0.99913925,0.00020671898,0.00015990033,0.00040211616,0.000063758824,0.000028277766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017605517,0.00007828134,0.00018332267,0.000039748586,0.000087951106,0.000022471671,0.00027909223,0.000027704531,0.000008829398],"category_scores_gemma":[0.0001323691,0.000048480728,0.00007168605,0.0002394938,0.0001449458,0.00013678921,0.00007333217,0.000055607667,0.0000022672973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019726863,0.00003648381,0.000033616183,0.000022425871,0.000009799109,2.923845e-7,0.001377884,0.0006689515,0.00013715791,0.9964957,0.000064758424,0.0011509517],"study_design_scores_gemma":[0.0004452658,0.000063404295,0.000762272,0.00003216188,0.000031818672,0.0000073596398,0.00019768451,0.13357715,0.0005552176,0.8640478,0.00018413462,0.000095694566],"about_ca_topic_score_codex":0.0000025904305,"about_ca_topic_score_gemma":0.0000025731692,"teacher_disagreement_score":0.90700513,"about_ca_system_score_codex":0.000003756214,"about_ca_system_score_gemma":0.000015382995,"threshold_uncertainty_score":0.19769867},"labels":[],"label_agreement":null},{"id":"W2041190751","doi":"10.1016/j.disc.2010.06.035","title":"On the size of maximal chains and the number of pairwise disjoint maximal antichains","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Integer (computer science); Pairwise comparison; Natural number; Maximal set; Enumeration; Discrete mathematics; Set (abstract data type); Statistics; Computer science","score_opus":0.01065944028338643,"score_gpt":0.2423140936012091,"score_spread":0.23165465331782267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041190751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8066564,0.000021838458,0.18459253,0.0026655493,0.0001283623,0.0003405882,0.000011469438,0.000038904815,0.0055443193],"genre_scores_gemma":[0.96193117,0.000010182694,0.037700586,0.00016268725,0.00002349388,0.00001242474,4.050722e-7,0.000010233459,0.00014878836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894667,0.00005805686,0.00032569,0.00017986396,0.0002921957,0.00019752436],"domain_scores_gemma":[0.99756557,0.0013107249,0.0002495018,0.0007753688,0.000053854346,0.000045006273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056841644,0.00015237535,0.00028359145,0.00001849933,0.00010605357,0.00003945546,0.000679033,0.000048270525,0.000045448676],"category_scores_gemma":[0.00055087334,0.00007028927,0.00013203284,0.00016303208,0.0005554426,0.00009235323,0.00028956254,0.00022296926,0.000009106847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012241668,0.000062750434,0.00014204269,0.000048785692,0.000018517698,0.0000018706091,0.0027331617,0.0000049007604,0.00078259036,0.9956689,0.000022610671,0.00050161604],"study_design_scores_gemma":[0.0008184516,0.000081368606,0.002133784,0.00007212455,0.00003206994,0.00004184152,0.00066662574,0.080445275,0.0026721722,0.91279054,0.000052100466,0.00019363381],"about_ca_topic_score_codex":0.0000042444653,"about_ca_topic_score_gemma":0.0000039958963,"teacher_disagreement_score":0.15527476,"about_ca_system_score_codex":0.0000037772486,"about_ca_system_score_gemma":0.000019330286,"threshold_uncertainty_score":0.28663135},"labels":[],"label_agreement":null},{"id":"W2041356670","doi":"10.1016/j.disc.2004.11.016","title":"Tandem-win graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Acadia University","funders":"","keywords":"Mathematics; Combinatorics; Tandem; Discrete mathematics; Characterization (materials science)","score_opus":0.031119267248758825,"score_gpt":0.2927926974345515,"score_spread":0.2616734301857927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041356670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02130933,0.000109238485,0.94855994,0.001986703,0.00017698787,0.0001564504,0.0000014925592,0.00032365948,0.027376186],"genre_scores_gemma":[0.66474634,0.000015825608,0.3338254,0.00033340478,0.00008205466,0.000013164066,9.3076454e-7,0.000014276998,0.0009685973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988109,0.00002206571,0.0003316046,0.00023909633,0.0003093134,0.00028702267],"domain_scores_gemma":[0.998944,0.00012569636,0.00010011949,0.00068605936,0.00005316949,0.0000909985],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026354537,0.00014255181,0.00016505875,0.00007768481,0.00010006889,0.00017203587,0.00096333784,0.000055271477,0.00009386639],"category_scores_gemma":[0.000100386016,0.00011851379,0.00009436483,0.00028234094,0.00007615554,0.0004227387,0.0002003298,0.000109427,0.0008880579],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.4436914e-7,0.00006987727,0.00014140927,0.0000146618495,0.000013561853,0.0000052302353,0.0043988996,0.00020646061,0.0004237618,0.9631995,0.0019508511,0.029575344],"study_design_scores_gemma":[0.00007792068,0.000054037424,0.000094034156,0.0000589991,0.0000127078065,0.000029619145,0.0005198485,0.43164977,0.028309442,0.52068263,0.018081786,0.0004292197],"about_ca_topic_score_codex":0.0000036542124,"about_ca_topic_score_gemma":0.000011244748,"teacher_disagreement_score":0.643437,"about_ca_system_score_codex":0.000027875489,"about_ca_system_score_gemma":0.000023754514,"threshold_uncertainty_score":0.99988985},"labels":[],"label_agreement":null},{"id":"W2042269609","doi":"10.1016/j.disc.2004.05.003","title":"Tight bounds on maximal and maximum matchings","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Upper and lower bounds; Planar graph; Discrete mathematics; Graph; Class (philosophy); Degree (music); Computer science","score_opus":0.01734329773186264,"score_gpt":0.28195897687854693,"score_spread":0.26461567914668427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042269609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14147097,0.00007600687,0.84241265,0.0017944064,0.00009610465,0.00025711453,0.0000058501064,0.00022703933,0.0136598395],"genre_scores_gemma":[0.64931834,0.000025725576,0.34958884,0.00034569122,0.000040996085,0.000025170973,0.0000027649473,0.000036397483,0.0006160683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859524,0.000026543536,0.00022060049,0.00034437716,0.00043152628,0.00038170902],"domain_scores_gemma":[0.99894875,0.00011929314,0.000076463686,0.00067145296,0.000038276547,0.00014575562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003372054,0.00018571549,0.00019795388,0.00013022682,0.00019006818,0.00026454136,0.00069928315,0.0000554566,0.000014109392],"category_scores_gemma":[0.000070015485,0.00014841634,0.000058403908,0.00027377007,0.00015180458,0.00037494846,0.0003444757,0.00021544893,0.00014457571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006124334,0.000058908026,0.000019465942,0.00005721731,0.000011381879,0.000030277819,0.0018721564,0.0000527002,0.00042071202,0.99519664,0.00003419786,0.0022402476],"study_design_scores_gemma":[0.00038745586,0.00013897967,0.0001318037,0.000074263226,0.0000037803104,0.000057588717,0.00011226501,0.0024880904,0.0021422303,0.99364066,0.00062162906,0.00020125246],"about_ca_topic_score_codex":0.0000030925191,"about_ca_topic_score_gemma":0.0000015853168,"teacher_disagreement_score":0.50784737,"about_ca_system_score_codex":0.000046813664,"about_ca_system_score_gemma":0.00003397323,"threshold_uncertainty_score":0.60522425},"labels":[],"label_agreement":null},{"id":"W2042880596","doi":"10.1016/s0012-365x(00)00075-3","title":"Stable 2-pairs and (X,Y)-intersection graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Intersection (aeronautics); Discrete mathematics","score_opus":0.022613387874989576,"score_gpt":0.286789227492788,"score_spread":0.26417583961779845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042880596","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.1138301,0.00009793571,0.8722693,0.0002456771,0.00009184919,0.0001770171,0.0000016991668,0.00019177789,0.013094681],"genre_scores_gemma":[0.8806484,0.00010870402,0.117606856,0.00007235048,0.00002099369,0.000023861701,0.0000018786028,0.00002079721,0.0014961761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989914,0.00003946291,0.00017848192,0.00025083977,0.00024848877,0.0002913618],"domain_scores_gemma":[0.9991782,0.00011815506,0.00006126929,0.0004881624,0.000052088653,0.00010213234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003457485,0.00011957257,0.00014083792,0.00014029989,0.00013504215,0.00015058549,0.0004023707,0.000036997364,0.000028464709],"category_scores_gemma":[0.000068809684,0.000100926525,0.000047969355,0.0004389785,0.00009372088,0.00048837526,0.00022863164,0.00012077961,0.000040298997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067566984,0.00004626214,0.0005453294,0.00005377766,0.000019116693,0.000020463225,0.0017805414,0.000026884434,0.0008680701,0.99104166,0.00018601459,0.005405105],"study_design_scores_gemma":[0.0002567726,0.000093952534,0.0002682327,0.000045781188,0.0000058314836,0.00012023256,0.00072989025,0.06729558,0.0011490779,0.92829514,0.0015275612,0.00021192546],"about_ca_topic_score_codex":0.0000049925275,"about_ca_topic_score_gemma":0.000006738729,"teacher_disagreement_score":0.7668183,"about_ca_system_score_codex":0.000021624552,"about_ca_system_score_gemma":0.000012160404,"threshold_uncertainty_score":0.41156644},"labels":[],"label_agreement":null},{"id":"W2043020651","doi":"10.1016/s0012-365x(03)00084-0","title":"On upper domination Ramsey numbers for graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Ramsey's theorem; Mathematics; Domination analysis; Graph; Independence number; Integer (computer science); Dominating set; Upper and lower bounds; Cardinality (data modeling); Discrete mathematics; Vertex (graph theory)","score_opus":0.020983167306812715,"score_gpt":0.3109859675149543,"score_spread":0.29000280020814156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043020651","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.013087428,0.000017714472,0.9692879,0.00022726489,0.00014361742,0.00052590616,0.000006038517,0.00010249836,0.016601654],"genre_scores_gemma":[0.47833553,0.000008121955,0.519796,0.00018689246,0.000013145703,0.00016183994,0.000006151132,0.000034640092,0.0014576411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987423,0.000067426365,0.00022330922,0.0002871295,0.00034332337,0.00033652183],"domain_scores_gemma":[0.99844384,0.00064176763,0.00009340894,0.00063495064,0.00009681548,0.00008923708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065797544,0.00014803841,0.0001673289,0.00014594667,0.00015333496,0.00011422624,0.0005412697,0.000055328233,0.00002462375],"category_scores_gemma":[0.0006101833,0.00012271064,0.000127666,0.00036920447,0.0000675415,0.00026612295,0.000051618943,0.00010818813,0.000070203525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056574654,0.00005425029,0.0000127450685,0.000043754935,0.000011892307,0.0000012184445,0.00067729206,0.000051949155,0.00019214797,0.99745643,0.00033029154,0.0011623913],"study_design_scores_gemma":[0.00042199867,0.000092185204,0.000010098362,0.000030369452,0.000004718497,0.000006084786,0.00015001395,0.013973144,0.004640451,0.97948027,0.0010288615,0.00016182013],"about_ca_topic_score_codex":3.8424e-7,"about_ca_topic_score_gemma":7.0705306e-7,"teacher_disagreement_score":0.4652481,"about_ca_system_score_codex":0.0000344572,"about_ca_system_score_gemma":0.000026178914,"threshold_uncertainty_score":0.5003995},"labels":[],"label_agreement":null},{"id":"W2043278008","doi":"10.1016/j.disc.2013.08.020","title":"Recursive construction of non-cyclic pandiagonal Latin squares","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Orthogonality; Mathematics; Latin square; Integer (computer science); Construct (python library); Order (exchange); Least-squares function approximation; Cyclic group; Combinatorics; Discrete mathematics; Algorithm; Statistics; Computer science","score_opus":0.006462384230597858,"score_gpt":0.1989928853913748,"score_spread":0.19253050116077694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043278008","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9671589,0.0000666869,0.014967481,0.000013945256,0.00023734174,0.00027073608,0.000019299905,0.000090263246,0.017175337],"genre_scores_gemma":[0.99152184,0.000011086895,0.008273293,0.0000036227405,0.000038823135,0.000038144182,0.000008935024,0.000021377593,0.00008287597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936223,0.000015467247,0.00028997197,0.00007312232,0.000118713884,0.00014048815],"domain_scores_gemma":[0.999573,0.000082213155,0.00007384393,0.00018859353,0.000037544578,0.00004482942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000080996084,0.00011545183,0.00020734055,0.00008076358,0.000028660676,0.000019889765,0.00009374539,0.00006349752,0.00021389664],"category_scores_gemma":[0.000022914259,0.000098867895,0.00007327995,0.0001394038,0.00006978221,0.000093996765,0.00001225415,0.00007402117,0.00011348746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021286189,0.00019309568,0.007877381,0.006466036,0.00077621615,0.000008384121,0.032989774,0.0043681352,0.09972138,0.8246942,0.0059661698,0.016917937],"study_design_scores_gemma":[0.0011916601,0.00020668203,0.0075072865,0.0012241409,0.0001566397,0.00007502084,0.018427767,0.099583246,0.08668677,0.783111,0.0007533721,0.0010764461],"about_ca_topic_score_codex":0.0000063164966,"about_ca_topic_score_gemma":0.0000011621305,"teacher_disagreement_score":0.09521511,"about_ca_system_score_codex":0.000010468442,"about_ca_system_score_gemma":0.000004101864,"threshold_uncertainty_score":0.40317157},"labels":[],"label_agreement":null},{"id":"W2043963103","doi":"10.1016/j.disc.2004.12.010","title":"Completion of Laplacian integral graphs via edge addition","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Integrally closed; Mathematics; Combinatorics; Laplacian matrix; Algebraic connectivity; Resistance distance; Discrete mathematics; Integral graph; Laplace operator; Graph; Line graph; Graph power; Mathematical analysis","score_opus":0.03295297523356717,"score_gpt":0.3015378562735073,"score_spread":0.26858488103994016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043963103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75251406,0.000048205584,0.21144564,0.0006274105,0.0000987994,0.0008783054,0.00022447752,0.00030730225,0.033855774],"genre_scores_gemma":[0.9125691,0.0000069406406,0.08687901,0.000045680626,0.00006108793,0.000062689935,0.00007781477,0.000031510164,0.00026615942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988002,0.000050172188,0.00053639925,0.00016929331,0.0002395337,0.00020437007],"domain_scores_gemma":[0.99875075,0.00029617766,0.00031050824,0.00047087707,0.00010097193,0.00007071171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036360946,0.00018286347,0.00032162937,0.00012753923,0.000115436655,0.00001906285,0.00023572132,0.00008922057,0.00039047076],"category_scores_gemma":[0.00012104979,0.00015809527,0.000186712,0.00026818615,0.0001538825,0.00013012801,0.000042674004,0.00014461025,0.00008325446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007310928,0.0002599317,0.000032404572,0.00016911149,0.000032690918,2.972021e-7,0.0012832612,0.0000038007288,0.0026113945,0.9920799,0.0019954247,0.0015244485],"study_design_scores_gemma":[0.000261869,0.000041947795,0.00011385727,0.00011389198,0.000080198864,0.000012573601,0.00055631844,0.002413475,0.0075698094,0.9864716,0.0021780932,0.00018635848],"about_ca_topic_score_codex":0.0000026334017,"about_ca_topic_score_gemma":0.00001722498,"teacher_disagreement_score":0.16005503,"about_ca_system_score_codex":0.000024179113,"about_ca_system_score_gemma":0.000011036659,"threshold_uncertainty_score":0.64469373},"labels":[],"label_agreement":null},{"id":"W2044878800","doi":"10.1016/s0012-365x(99)00323-4","title":"On the girth of digraphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Conjecture; Girth (graph theory); Counterexample; Order (exchange); Discrete mathematics","score_opus":0.020229973716509912,"score_gpt":0.2800074361875158,"score_spread":0.25977746247100586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044878800","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.3999429,0.00011001184,0.42251456,0.0018986403,0.00007323663,0.0006399454,0.00001635812,0.00019737931,0.17460696],"genre_scores_gemma":[0.97102976,0.000028208011,0.027007727,0.0001615628,0.0000105476065,0.000020150921,7.6212643e-7,0.000013639043,0.0017276356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989863,0.000060979753,0.00020096646,0.00015796236,0.00038422277,0.000209575],"domain_scores_gemma":[0.9982948,0.0006008238,0.00006276561,0.0009611372,0.00003478273,0.00004569893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037985994,0.000100282734,0.00013560765,0.00005902784,0.00008880956,0.000046117853,0.0011373444,0.000024782892,0.00029295575],"category_scores_gemma":[0.00009945668,0.000057352183,0.00008944084,0.00043819225,0.00014933237,0.00011979719,0.00008805213,0.00012344436,0.00014869536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003789216,0.00004341319,0.000008822783,0.000017784876,0.000010459844,0.0000018129317,0.0009746119,0.00008096103,0.000121657606,0.9930301,0.00019261865,0.0055139787],"study_design_scores_gemma":[0.00009862322,0.00008345907,0.000064413696,0.000046074758,0.0000026810299,0.0000040668406,0.00009053827,0.016834786,0.0032262844,0.97889215,0.0005639267,0.000093013536],"about_ca_topic_score_codex":0.0000010692298,"about_ca_topic_score_gemma":6.132927e-7,"teacher_disagreement_score":0.5710869,"about_ca_system_score_codex":0.0000063318703,"about_ca_system_score_gemma":0.0000135838545,"threshold_uncertainty_score":0.32076603},"labels":[],"label_agreement":null},{"id":"W2045160518","doi":"10.1016/s0012-365x(00)00302-2","title":"Steiner pentagon covering designs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Pentagon; Combinatorics; Mathematics; Path (computing); Graph; Order (exchange); Undirected graph; Discrete mathematics; Geometry; Computer science","score_opus":0.020964857172028985,"score_gpt":0.2246420895706413,"score_spread":0.20367723239861232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045160518","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76849484,0.00026513357,0.13214862,0.000017234106,0.00041762122,0.00024937728,0.000009513402,0.00058611773,0.097811535],"genre_scores_gemma":[0.9973413,0.000034871427,0.0015617836,0.00001403849,0.00007293415,0.000019240406,0.000006238505,0.000045721572,0.0009039094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930876,0.00001451616,0.0002238818,0.00009297149,0.00013451575,0.00022536983],"domain_scores_gemma":[0.9995856,0.000043867385,0.000027942911,0.00026522714,0.000012297979,0.00006501912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014971895,0.00014833383,0.00017563498,0.000050349543,0.00004979161,0.000046868256,0.00014387116,0.000051666135,0.00017031151],"category_scores_gemma":[0.000011998818,0.00013084848,0.00007282462,0.00013155975,0.000020230844,0.000105390915,0.000019375477,0.00008440848,0.00022524271],"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.00006867375,0.00038397635,0.0056289774,0.004900817,0.001008761,0.00042899972,0.026978353,0.07731145,0.24297309,0.6188473,0.012584768,0.008884828],"study_design_scores_gemma":[0.0031524203,0.00032234413,0.0012725997,0.001601832,0.00039625156,0.00089886534,0.014183782,0.63620484,0.081959106,0.15094773,0.10501475,0.0040454706],"about_ca_topic_score_codex":0.0000018029228,"about_ca_topic_score_gemma":0.0000025040185,"teacher_disagreement_score":0.5588934,"about_ca_system_score_codex":0.000022416882,"about_ca_system_score_gemma":0.000002888078,"threshold_uncertainty_score":0.5335846},"labels":[],"label_agreement":null},{"id":"W2045251507","doi":"10.1016/j.disc.2009.01.018","title":"Vertex domination of generalized Petersen graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Dominating set; Vertex (graph theory); Mathematics; Domination analysis; Neighbourhood (mathematics); Modulo; Discrete mathematics; Graph","score_opus":0.01943357779614378,"score_gpt":0.30040339959807083,"score_spread":0.28096982180192703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045251507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10324393,0.00007398045,0.8877922,0.0004395429,0.00007931272,0.00027290903,0.0000041985463,0.00011204449,0.007981846],"genre_scores_gemma":[0.7549702,0.000018059125,0.24472336,0.00006309765,0.0000068904533,0.00000586085,0.0000031631905,0.000007455448,0.0002019018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988285,0.000058408084,0.000294836,0.0001975318,0.00039196122,0.00022879783],"domain_scores_gemma":[0.9989251,0.00012252165,0.00014112334,0.0006422742,0.00010061277,0.00006839992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036565925,0.0001179872,0.00021336724,0.00017363463,0.000057038356,0.000048562706,0.00072360935,0.000039658025,0.000014362354],"category_scores_gemma":[0.000116758354,0.00009821025,0.00010697533,0.00045467028,0.00006754547,0.00031577097,0.000091422335,0.00008137122,0.000018899813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057583857,0.000056926227,0.000008980735,0.000028531449,0.000009913194,0.0000040088153,0.0011447355,0.000034521592,0.011699035,0.97996557,0.000075070115,0.006966958],"study_design_scores_gemma":[0.00038464958,0.000111045156,0.0003106171,0.000036215402,0.0000062924437,0.000008783013,0.00007602235,0.049833655,0.013584694,0.9354493,0.000066635504,0.00013206953],"about_ca_topic_score_codex":9.954299e-7,"about_ca_topic_score_gemma":5.0389497e-7,"teacher_disagreement_score":0.6517263,"about_ca_system_score_codex":0.000016708409,"about_ca_system_score_gemma":0.00001912559,"threshold_uncertainty_score":0.40048978},"labels":[],"label_agreement":null},{"id":"W2045324891","doi":"10.1016/j.disc.2004.10.012","title":"Isotone relations revisited","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Mathematics; Property (philosophy); Characterization (materials science); Fixed point; Product (mathematics); Discrete mathematics; Fixed-point theorem; Combinatorics; Epistemology","score_opus":0.011928744731955357,"score_gpt":0.24924527298086396,"score_spread":0.23731652824890861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045324891","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.0010270438,0.00003745146,0.9607755,0.0026525191,0.000045153512,0.00012565409,0.0000025646414,0.00022718821,0.0351069],"genre_scores_gemma":[0.2657935,0.00001820485,0.7316795,0.00028571137,0.000048198708,0.000008708986,0.000009002754,0.000008462711,0.0021487353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993365,0.000017038245,0.00022742782,0.00014347833,0.00015703216,0.000118526594],"domain_scores_gemma":[0.9993838,0.000056737033,0.00008623691,0.00036682218,0.00005058737,0.00005583667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012869085,0.00008060749,0.000095802665,0.00007410744,0.00010041686,0.00010397911,0.00021511571,0.000037278187,0.00031297168],"category_scores_gemma":[0.00006751914,0.00007330235,0.000047211477,0.0002683036,0.000022696286,0.0004050184,0.00005993716,0.00007198972,0.00054856314],"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":[6.098293e-7,0.000049927672,0.00025109042,0.00001953571,0.000016244325,0.0000015446375,0.0020970746,0.0018703173,0.00020139692,0.9601834,0.0040326016,0.03127626],"study_design_scores_gemma":[0.0002556597,0.000015447848,0.0012714437,0.00004323237,0.000012785337,0.000028323195,0.000085857966,0.96651435,0.0002869561,0.01258646,0.018678235,0.00022123806],"about_ca_topic_score_codex":6.26952e-7,"about_ca_topic_score_gemma":0.0000031928598,"teacher_disagreement_score":0.964644,"about_ca_system_score_codex":0.00002991633,"about_ca_system_score_gemma":0.000020581108,"threshold_uncertainty_score":0.7050852},"labels":[],"label_agreement":null},{"id":"W2045836875","doi":"10.1016/j.disc.2013.02.021","title":"Hamilton paths in generalized Petersen graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.021707420690217437,"score_gpt":0.2835553962889854,"score_spread":0.261847975598768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045836875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6005882,0.00012371015,0.3867798,0.0004950737,0.00015647386,0.00090622815,0.000004332649,0.00026166037,0.010684546],"genre_scores_gemma":[0.680686,0.00005591961,0.31783402,0.00020989106,0.00002061047,0.00020082082,0.000005271261,0.00003597301,0.00095150934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829763,0.00010426549,0.00036625974,0.0003393552,0.0003986208,0.0004938702],"domain_scores_gemma":[0.9986034,0.00017251041,0.00009510341,0.0009266857,0.00007157372,0.00013069468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038364806,0.00018731624,0.00025859004,0.00025893966,0.000069545196,0.00019851806,0.0010738719,0.000060611128,0.00007763646],"category_scores_gemma":[0.00008481317,0.00015262596,0.00010037119,0.00064132706,0.0000951681,0.0006232794,0.0002645012,0.00019110354,0.00035853722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028533061,0.000102813225,0.00034960292,0.00008400516,0.000016656813,0.000031570205,0.005274123,0.00011320182,0.0053039845,0.9844674,0.0003065969,0.0039471826],"study_design_scores_gemma":[0.00045239105,0.000046453453,0.0008086981,0.000052731346,0.0000024248154,0.00001390358,0.00027922852,0.116411135,0.0012308934,0.8801684,0.000261735,0.0002720273],"about_ca_topic_score_codex":0.000026966896,"about_ca_topic_score_gemma":0.000010384838,"teacher_disagreement_score":0.11629794,"about_ca_system_score_codex":0.000035089517,"about_ca_system_score_gemma":0.000021631207,"threshold_uncertainty_score":0.62239057},"labels":[],"label_agreement":null},{"id":"W2046062574","doi":"10.1016/j.disc.2006.01.029","title":"Hex and combinatorics","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Enumerative combinatorics; Extremal combinatorics; Algebraic combinatorics; Discrete mathematics","score_opus":0.017423255086028776,"score_gpt":0.2593164744615726,"score_spread":0.2418932193755438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046062574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054963253,0.00015588284,0.9194898,0.00057078333,0.0001727464,0.000116990246,0.0000013747251,0.000183757,0.02434541],"genre_scores_gemma":[0.92455983,0.000009245839,0.07443336,0.000055520857,0.000037156184,0.00000641218,9.984361e-7,0.000009898225,0.0008876074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999225,0.000013578639,0.0002169823,0.00017345275,0.00019138899,0.00017957589],"domain_scores_gemma":[0.99936414,0.0001130377,0.00007065599,0.000367697,0.000041519055,0.00004293142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014995417,0.00010047677,0.00012345758,0.00004204553,0.00008373631,0.00017243379,0.00038625463,0.000039516253,0.000007749821],"category_scores_gemma":[0.00004401223,0.00008607612,0.000029969386,0.00017196151,0.00007189259,0.00020962498,0.00018557998,0.000065143606,0.000072672025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.9001583e-7,0.000033867535,0.00028234118,0.000020148409,0.0000024890392,0.0000051644543,0.00054407294,0.00001588892,0.00017841227,0.9969791,0.0005972272,0.0013410713],"study_design_scores_gemma":[0.000035223828,0.00002384166,0.00022504998,0.000017865666,0.0000043172427,0.000014363219,0.00013351797,0.09467689,0.006849065,0.8964564,0.0014150251,0.00014839592],"about_ca_topic_score_codex":0.000022612227,"about_ca_topic_score_gemma":0.000005523243,"teacher_disagreement_score":0.86959654,"about_ca_system_score_codex":0.00001462744,"about_ca_system_score_gemma":0.000011789237,"threshold_uncertainty_score":0.35100824},"labels":[],"label_agreement":null},{"id":"W2046546000","doi":"10.1016/j.disc.2012.01.028","title":"Two results on the digraph chromatic number","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Combinatorics; Digraph; Girth (graph theory); Chromatic scale; Integer (computer science); Discrete mathematics; Graph; Computer science","score_opus":0.043220335193595145,"score_gpt":0.32276929236353363,"score_spread":0.2795489571699385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046546000","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6701391,0.000057478075,0.0010587068,0.0005962798,0.0005451947,0.0006303856,0.000060866605,0.000222291,0.3266897],"genre_scores_gemma":[0.9824758,0.000011252429,0.015364068,0.00038748953,0.00036003627,0.000052146188,0.00000772124,0.00007545112,0.0012659979],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977487,0.00016864942,0.00065521814,0.00022192065,0.00058379624,0.00062174135],"domain_scores_gemma":[0.99554086,0.0025959304,0.00033987837,0.001314255,0.000050637133,0.00015842372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014557906,0.00036306115,0.00039729715,0.000063703155,0.0004986005,0.00007608496,0.0005631874,0.000104859864,0.00040803527],"category_scores_gemma":[0.0014122218,0.00019515409,0.00027047045,0.0002707393,0.00022936358,0.00014945702,0.0001928493,0.0003363626,0.00028692678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018759809,0.00014255842,0.00018008544,0.00012094263,0.00009330907,0.0000018821562,0.007745728,8.0535796e-7,0.000043708515,0.9837901,0.0077593653,0.000102768514],"study_design_scores_gemma":[0.0005266566,0.00003506179,0.00025205206,0.00018548862,0.00012053634,0.00004436766,0.0024990083,0.00025824615,0.0011490649,0.9926099,0.001962574,0.0003570527],"about_ca_topic_score_codex":0.00000446222,"about_ca_topic_score_gemma":0.0000026760904,"teacher_disagreement_score":0.32542372,"about_ca_system_score_codex":0.000047698548,"about_ca_system_score_gemma":0.000011671548,"threshold_uncertainty_score":0.7958153},"labels":[],"label_agreement":null},{"id":"W2046755592","doi":"10.1016/j.disc.2008.05.031","title":"Brambles and independent packings in chordal graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Chordal graph; Mathematics; Split graph; Indifference graph; Treewidth; Discrete mathematics; Pathwidth; Disjoint sets; Maximal independent set; Interval graph; Independent set; Cograph; Graph; 1-planar graph; Line graph","score_opus":0.027302086804797048,"score_gpt":0.28550113844060665,"score_spread":0.2581990516358096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046755592","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7581134,0.00019074233,0.2378577,0.00024408549,0.000046309797,0.00025712623,0.0000026047628,0.00010314064,0.0031849232],"genre_scores_gemma":[0.92307794,0.00011427442,0.076547824,0.000053849766,0.000008465477,0.000018726294,0.0000010179253,0.000013883824,0.00016401109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870014,0.000049592985,0.00024663654,0.00029005655,0.00038104542,0.0003325005],"domain_scores_gemma":[0.9991524,0.00017275008,0.00006794686,0.00046902703,0.000035572375,0.0001022591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003802289,0.00013950358,0.00019854802,0.00021758836,0.00011213078,0.00007267459,0.0005671504,0.000052697847,0.00000771864],"category_scores_gemma":[0.0001059225,0.00011857766,0.000043686876,0.00046612343,0.00017692699,0.00039950028,0.00036523136,0.00020219629,0.000017195267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056039007,0.00008429693,0.007695422,0.00007450153,0.000012065575,0.00012534276,0.007479724,0.000022859202,0.0007051885,0.98133826,0.000049739643,0.0024070211],"study_design_scores_gemma":[0.000577638,0.000081142214,0.0097584175,0.0000778936,0.0000026446564,0.00022989606,0.0004093919,0.018783033,0.0018386074,0.96775526,0.00017057346,0.00031549658],"about_ca_topic_score_codex":0.000008622242,"about_ca_topic_score_gemma":0.000012948927,"teacher_disagreement_score":0.16496457,"about_ca_system_score_codex":0.00002011254,"about_ca_system_score_gemma":0.000026562913,"threshold_uncertainty_score":0.48354566},"labels":[],"label_agreement":null},{"id":"W2047548144","doi":"10.1016/j.disc.2006.05.027","title":"Tamari lattices and noncrossing partitions in type B","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Bijection; Combinatorics; Mathematics; Lattice (music); Order (exchange); Type (biology); Discrete mathematics; Physics","score_opus":0.03473768432901951,"score_gpt":0.3265942049032501,"score_spread":0.29185652057423056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047548144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9588934,0.000263731,0.015643904,0.00023702104,0.0002987436,0.00058910745,0.000015801528,0.00025802854,0.023800248],"genre_scores_gemma":[0.81781423,0.000019492001,0.18098074,0.00002304177,0.000120393284,0.00003515919,0.000009602021,0.00007377584,0.0009235463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834657,0.0000427551,0.0006624946,0.0002656198,0.0002917743,0.0003908176],"domain_scores_gemma":[0.9983283,0.00080996513,0.00025730714,0.00044922528,0.00008421861,0.00007097868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035032706,0.00026246876,0.00044467286,0.00012378723,0.00014912203,0.00014556518,0.00018428793,0.00012091498,0.000062367886],"category_scores_gemma":[0.0006592725,0.00023829946,0.000056372093,0.00038789804,0.00015851285,0.00025006483,0.0001277716,0.00020612266,0.000032725897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007699313,0.00026904576,0.0007691058,0.0005464825,0.000015246425,0.000019433726,0.0013322451,0.00003786687,0.0006991177,0.9956802,0.00040941584,0.00021415135],"study_design_scores_gemma":[0.00049539155,0.000038004913,0.00026228515,0.00025249188,0.00004732994,0.000021680265,0.0004997971,0.0029868004,0.0007667223,0.9937374,0.0005963047,0.0002957641],"about_ca_topic_score_codex":0.000023097955,"about_ca_topic_score_gemma":0.00008611188,"teacher_disagreement_score":0.16533683,"about_ca_system_score_codex":0.00006357205,"about_ca_system_score_gemma":0.000026828176,"threshold_uncertainty_score":0.971757},"labels":[],"label_agreement":null},{"id":"W2047567341","doi":"10.1016/s0012-365x(99)00370-2","title":"Bipartite Ramsey numbers and Zarankiewicz numbers","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Ramsey's theorem; Combinatorics; Bipartite graph; Discrete mathematics; Ramsey theory; Graph","score_opus":0.020216719679944057,"score_gpt":0.2899892336094061,"score_spread":0.26977251392946205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047567341","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8558282,0.00020174589,0.0010025526,0.0001769275,0.00016739633,0.00039899698,0.00003160016,0.00024096298,0.14195159],"genre_scores_gemma":[0.927148,0.00028481972,0.062077906,0.0003699047,0.00018187973,0.000038249113,0.000011555601,0.00012896917,0.009758736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982098,0.00007324766,0.000534366,0.0003448439,0.00037369927,0.00046409102],"domain_scores_gemma":[0.9985194,0.00041116774,0.0001512606,0.00068963843,0.000039556908,0.0001889711],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043967285,0.00034878473,0.00048715697,0.00007076859,0.0003456749,0.00010315258,0.00030740723,0.00016491409,0.0019098892],"category_scores_gemma":[0.00017434036,0.00027251692,0.00016670283,0.00020950344,0.00031179967,0.000172742,0.00010184939,0.00024532323,0.000093101014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048687718,0.00012840005,0.0008523222,0.00063746434,0.00022742822,0.0000278731,0.015954753,0.000010061019,0.00009754755,0.96835476,0.0062776213,0.0073830658],"study_design_scores_gemma":[0.00062987435,0.0000473339,0.00022748655,0.00015584019,0.00013135448,0.00011065108,0.00085717655,0.0007167815,0.00023372746,0.9855864,0.010800743,0.0005026191],"about_ca_topic_score_codex":0.000014669151,"about_ca_topic_score_gemma":0.000014368151,"teacher_disagreement_score":0.13219287,"about_ca_system_score_codex":0.000023001505,"about_ca_system_score_gemma":0.000015916428,"threshold_uncertainty_score":0.9999727},"labels":[],"label_agreement":null},{"id":"W2047785497","doi":"10.1016/j.disc.2006.03.076","title":"The chromatic number and rank of the complements of the Kasami graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Rank (graph theory); Counterexample; Chromatic scale; Conjecture; Discrete mathematics","score_opus":0.03315402156511491,"score_gpt":0.31832079128952084,"score_spread":0.2851667697244059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047785497","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98230606,0.000084680294,0.00048724838,0.00046183594,0.000104822364,0.001067281,0.000069663016,0.000023716015,0.015394716],"genre_scores_gemma":[0.99533737,0.000013175704,0.0032925985,0.000019343282,0.000022659468,0.000034578065,0.0000021843348,0.00004454853,0.0012335732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975298,0.0003032953,0.0008207577,0.00015783895,0.0008471702,0.00034114698],"domain_scores_gemma":[0.99575627,0.002241012,0.0005783424,0.0012608368,0.00012943754,0.00003409183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013793475,0.00021423565,0.00038953967,0.000032606855,0.00036514632,0.000051446143,0.0009818136,0.00006638755,0.00008431127],"category_scores_gemma":[0.00070223614,0.00009444313,0.00023322059,0.00041484527,0.00092931674,0.00005404691,0.0005264241,0.00021881358,0.0000090205485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013016156,0.00016208732,0.005149711,0.0010372314,0.000109069275,4.5663927e-7,0.0017844528,0.0000029270009,0.0018506175,0.9875508,0.002241302,0.00009835403],"study_design_scores_gemma":[0.00054112886,0.000023139979,0.0051279524,0.000311973,0.00011075548,0.000014942326,0.0011706323,0.0013831928,0.0052295336,0.98570657,0.00025249523,0.00012771043],"about_ca_topic_score_codex":0.00003472952,"about_ca_topic_score_gemma":0.000068529705,"teacher_disagreement_score":0.0141611425,"about_ca_system_score_codex":0.000023828552,"about_ca_system_score_gemma":0.00003762679,"threshold_uncertainty_score":0.3851279},"labels":[],"label_agreement":null},{"id":"W2048219129","doi":"10.1016/j.disc.2005.11.003","title":"On almost self-complementary graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Circulant matrix; Discrete mathematics; Cograph; Indifference graph; Chordal graph; Circulant graph; Pathwidth; Vertex (graph theory); Strongly regular graph; Complement (music); Graph; 1-planar graph; Line graph; Voltage graph","score_opus":0.05574125409828888,"score_gpt":0.3509366385757403,"score_spread":0.2951953844774514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048219129","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8045925,0.00007797366,0.006615739,0.002881462,0.00021570786,0.001843705,0.00019114962,0.0011996977,0.18238206],"genre_scores_gemma":[0.70207185,0.000027589887,0.2931637,0.0010324301,0.00028703234,0.00014075986,0.00006944228,0.00024161515,0.0029655986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973319,0.00012792196,0.00064116897,0.00037688526,0.0008558939,0.0006661971],"domain_scores_gemma":[0.9968904,0.0015761965,0.00018577336,0.0010652792,0.00008502447,0.00019730217],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010423781,0.00036317026,0.00043887596,0.00023776705,0.00021847406,0.000090852656,0.0006553014,0.00010457824,0.0020193064],"category_scores_gemma":[0.00042773125,0.0003025172,0.0002124827,0.00034541986,0.00010608008,0.00023524645,0.00021167459,0.00037562446,0.0013675161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025057687,0.00062187976,0.000037106,0.00027230373,0.000120439094,0.000013862254,0.0027870468,0.0000064112573,0.00017882006,0.9796093,0.01560195,0.0007258299],"study_design_scores_gemma":[0.0008051275,0.00020563889,0.000023245739,0.00012721668,0.00007213413,0.000028920416,0.0010118487,0.00424911,0.0016723148,0.9839934,0.007387786,0.00042321792],"about_ca_topic_score_codex":0.0000032310309,"about_ca_topic_score_gemma":0.00001250696,"teacher_disagreement_score":0.28654796,"about_ca_system_score_codex":0.00013200787,"about_ca_system_score_gemma":0.000034168927,"threshold_uncertainty_score":0.9999427},"labels":[],"label_agreement":null},{"id":"W2048460015","doi":"10.1016/s0012-365x(01)00180-7","title":"The average connectivity of a graph","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Graph; Discrete mathematics","score_opus":0.021246706973682777,"score_gpt":0.22796406053922214,"score_spread":0.20671735356553936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048460015","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.020228108,0.00020434805,0.9486355,0.00046172418,0.00046643315,0.00016663382,0.0000019159459,0.00007335188,0.029761996],"genre_scores_gemma":[0.9958969,0.000027774613,0.0030628443,0.00003411157,0.000037325484,0.000010708768,1.4712306e-7,0.000005762641,0.00092447945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992003,0.0000566864,0.00026705634,0.00012292137,0.0001937881,0.00015927576],"domain_scores_gemma":[0.99886197,0.00034736766,0.00015434119,0.0005420526,0.00006112294,0.00003315839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039037937,0.000083679006,0.00014982007,0.000029432724,0.00016174234,0.000103397884,0.0005029459,0.000033072953,0.000023968687],"category_scores_gemma":[0.00007045364,0.000050635634,0.00010372482,0.00020319961,0.000051748077,0.00012372689,0.000090986396,0.00007541993,0.00003398936],"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":[8.4829134e-7,0.000051596566,0.000048487236,0.000043228905,0.000033133103,0.000002682329,0.0037393179,0.00016861188,0.000098258126,0.98983747,0.0030562924,0.0029200525],"study_design_scores_gemma":[0.00017742575,0.00007038449,0.000061893676,0.00006528137,0.000005703112,0.00003604017,0.00028289476,0.93291503,0.0006409626,0.061289176,0.0043098168,0.0001453978],"about_ca_topic_score_codex":0.0000061810015,"about_ca_topic_score_gemma":0.000009624955,"teacher_disagreement_score":0.9756687,"about_ca_system_score_codex":0.0000096355825,"about_ca_system_score_gemma":0.0000037045395,"threshold_uncertainty_score":0.20648612},"labels":[],"label_agreement":null},{"id":"W2049191074","doi":"10.1016/j.disc.2008.02.010","title":"Representation of ideals of relational structures","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Countable set; Isomorphism (crystallography); Signature (topology); Ideal (ethics); Partially ordered set; Discrete mathematics; Binary relation; Combinatorics; Metric space; Set (abstract data type); Computer science","score_opus":0.08013886432723465,"score_gpt":0.35816533286285174,"score_spread":0.2780264685356171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049191074","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8952937,0.00009068229,0.09005521,0.00005296428,0.00006980057,0.00022179248,0.000046366684,0.000039653965,0.014129798],"genre_scores_gemma":[0.8425966,0.000023274406,0.15683633,0.000008762035,0.000022491417,0.0000047516614,0.000013740793,0.000015456402,0.00047861732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893105,0.000057925645,0.00055054965,0.000111678644,0.00023908999,0.00010971071],"domain_scores_gemma":[0.99815226,0.00092738523,0.00045816845,0.00032866042,0.0001056524,0.000027852007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017565288,0.00010401377,0.00036426634,0.00007163414,0.00006025305,0.0000010183355,0.00012218808,0.000087984525,0.00020936187],"category_scores_gemma":[0.0009805916,0.00008637398,0.00010988017,0.00014946608,0.0003075268,0.00008256217,0.000030383928,0.000086429245,0.0000042415345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000206013,0.000054276275,0.00087164406,0.00017413858,0.000050807128,0.0000029432176,0.003219686,0.000070908434,0.002012271,0.9932668,0.00020591907,0.0000499802],"study_design_scores_gemma":[0.00024080859,0.00003095638,0.0009329446,0.000034277564,0.000035136058,0.000036470155,0.0005193354,0.00033422216,0.029015778,0.9687214,0.000019668094,0.00007898644],"about_ca_topic_score_codex":0.0000024761982,"about_ca_topic_score_gemma":0.0000012892323,"teacher_disagreement_score":0.066781126,"about_ca_system_score_codex":0.000009000176,"about_ca_system_score_gemma":0.000024578101,"threshold_uncertainty_score":0.35222286},"labels":[],"label_agreement":null},{"id":"W2049216882","doi":"10.1016/j.disc.2009.05.019","title":"Hamiltonicity and restricted block-intersection graphs of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>t</mml:mi></mml:math>-designs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Intersection graph; Intersection (aeronautics); Graph; Vertex (graph theory); Block (permutation group theory); Discrete mathematics; Line graph","score_opus":0.01453078966665457,"score_gpt":0.22596034589161323,"score_spread":0.21142955622495865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049216882","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9926034,0.0002499334,0.003424256,0.000029085664,0.00037811827,0.000106496664,0.000067112895,0.0002516,0.0028899533],"genre_scores_gemma":[0.99777776,0.0001532583,0.001682304,0.000046791592,0.00010859921,0.000049238093,0.000052591076,0.00008703937,0.00004242409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998045,0.00005896117,0.0007038007,0.00032779918,0.0004199937,0.00044441805],"domain_scores_gemma":[0.9986135,0.0002203334,0.00031777984,0.0006434575,0.00004609034,0.00015888829],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040657903,0.00033986304,0.00031814506,0.0001581194,0.00021066859,0.00012474248,0.00030406468,0.00034979836,0.000013166528],"category_scores_gemma":[0.00013992279,0.00037066758,0.00032008818,0.0003530559,0.00015877174,0.00025233577,0.00008870925,0.0003469143,0.00006104933],"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.00007058527,0.00009212009,0.000011590867,0.00069339323,0.00020327998,0.000037063044,0.0018500107,0.0017645725,0.010491683,0.9844456,0.00017551282,0.000164636],"study_design_scores_gemma":[0.0005449253,0.00036345568,0.00017837138,0.0006557424,0.00023675337,0.0001795114,0.0011218973,0.97321427,0.0144988615,0.0084817195,0.00013998026,0.00038448555],"about_ca_topic_score_codex":0.000042918742,"about_ca_topic_score_gemma":0.000028555924,"teacher_disagreement_score":0.97596383,"about_ca_system_score_codex":0.000014707949,"about_ca_system_score_gemma":0.000038263464,"threshold_uncertainty_score":0.99987453},"labels":[],"label_agreement":null},{"id":"W2049246407","doi":"10.1016/j.disc.2011.06.003","title":"Paley graphs have Hamilton decompositions","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Australian Research Council","keywords":"Mathematics; Combinatorics; Discrete mathematics; Chordal graph; Indifference graph; Graph","score_opus":0.020762865953767026,"score_gpt":0.20976294429888379,"score_spread":0.18900007834511676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049246407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61548454,0.00027780322,0.051812842,0.000006136066,0.00048039327,0.00034607353,0.000038515504,0.00079006306,0.33076364],"genre_scores_gemma":[0.9927538,0.00002235057,0.0068714293,0.000012876349,0.00002130845,0.000038045095,0.000012121743,0.00004019941,0.00022784283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993176,0.000018375556,0.00024979108,0.00009953969,0.00010371747,0.00021099449],"domain_scores_gemma":[0.9995087,0.000032822674,0.000033250264,0.00032646395,0.000019117706,0.000079679885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000116308816,0.00015545997,0.00017776905,0.000079001475,0.00007370287,0.000023882078,0.0001669486,0.000066605025,0.00014374654],"category_scores_gemma":[0.0000053379845,0.00013875405,0.0001131324,0.0001018455,0.000046128636,0.00008411708,0.000012984657,0.00009851993,0.00014344289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007891059,0.0001607415,0.0010419437,0.00083881797,0.0002875911,0.000034966088,0.041329578,0.0002944872,0.0054176203,0.9487762,0.001380322,0.00042984757],"study_design_scores_gemma":[0.00087435637,0.00015485562,0.0023183145,0.0006607251,0.0002680694,0.0001701176,0.008970635,0.0567861,0.043276336,0.8808987,0.004049623,0.0015721584],"about_ca_topic_score_codex":0.0000030184842,"about_ca_topic_score_gemma":0.000009364503,"teacher_disagreement_score":0.3772693,"about_ca_system_score_codex":0.000010386806,"about_ca_system_score_gemma":0.000002335375,"threshold_uncertainty_score":0.56582266},"labels":[],"label_agreement":null},{"id":"W2049622061","doi":"10.1016/j.disc.2007.08.006","title":"Small maximally disjoint union-free families","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Disjoint sets; Disjoint union (topology); Combinatorics; Discrete mathematics","score_opus":0.03713383757873842,"score_gpt":0.27907554878819735,"score_spread":0.24194171120945893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049622061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54003364,0.00016800307,0.25211558,0.00035069784,0.000711933,0.00075416284,0.00007556316,0.000576396,0.20521407],"genre_scores_gemma":[0.6017075,0.00008587816,0.395448,0.00023951937,0.0003059481,0.000019795129,0.000017745253,0.00015618966,0.0020194023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976244,0.00006573355,0.0008208081,0.00034501843,0.0004980915,0.00064592354],"domain_scores_gemma":[0.99687076,0.0010158155,0.0002996723,0.0015013214,0.00011964287,0.00019280496],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018005156,0.00040622713,0.0005170708,0.00023109795,0.00034364106,0.000074303534,0.0009051026,0.00019575184,0.00016199242],"category_scores_gemma":[0.0012345416,0.0003044025,0.0002798412,0.00031085234,0.00027198612,0.00010548593,0.0005896543,0.00031837114,0.000029177228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020663909,0.000108357635,0.0002327565,0.0003847068,0.00008848579,0.000030060091,0.005484945,0.000002297112,0.00019422773,0.98992306,0.0010478185,0.0024825928],"study_design_scores_gemma":[0.00054239016,0.00007091985,0.000561655,0.00012932644,0.0000967345,0.000049957824,0.003977159,0.00022098862,0.0015911795,0.9897961,0.0025105837,0.0004530326],"about_ca_topic_score_codex":0.000011445454,"about_ca_topic_score_gemma":0.00009515085,"teacher_disagreement_score":0.20319466,"about_ca_system_score_codex":0.00005516352,"about_ca_system_score_gemma":0.00002643611,"threshold_uncertainty_score":0.9999408},"labels":[],"label_agreement":null},{"id":"W2049916150","doi":"10.1016/j.disc.2010.01.002","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si37.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>G</mml:mi></mml:math>-parking functions, acyclic orientations and spanning trees","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Bijection; Mathematics; Graph; Combinatorics; Vertex (graph theory); Discrete mathematics; Function (biology)","score_opus":0.020716285225112926,"score_gpt":0.2785681418201496,"score_spread":0.2578518565950367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049916150","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87727726,0.00011569959,0.11964002,0.00025216537,0.00052718667,0.00009765485,0.000037946476,0.00020807504,0.001843979],"genre_scores_gemma":[0.92087525,0.00006904668,0.078069694,0.00015117424,0.0002486583,0.00017799911,0.00006167006,0.000093214934,0.0002533194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972057,0.00007187377,0.000601029,0.00064302806,0.0007846378,0.00069374754],"domain_scores_gemma":[0.9971772,0.0008023817,0.00041606388,0.0012353031,0.0000888005,0.0002802786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080835045,0.0003310955,0.00024154776,0.00020093529,0.00089210895,0.0006565367,0.00091796473,0.00024818565,0.000029654975],"category_scores_gemma":[0.00065547565,0.0003531544,0.00024369874,0.0005704341,0.00041732896,0.00100806,0.00083888974,0.00067793037,0.0003243886],"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.000026750517,0.00008873064,0.00006151183,0.00016159481,0.00009315627,0.00004619311,0.0026993223,0.0002755742,0.0031084802,0.9913658,0.00011596284,0.00195693],"study_design_scores_gemma":[0.00044881905,0.00016133134,0.0001800565,0.00020774653,0.00008590907,0.00018605252,0.0013815896,0.9710275,0.0029981,0.02152567,0.0014199094,0.00037730052],"about_ca_topic_score_codex":0.000029730361,"about_ca_topic_score_gemma":0.000098349155,"teacher_disagreement_score":0.97075194,"about_ca_system_score_codex":0.000013041261,"about_ca_system_score_gemma":0.00014595408,"threshold_uncertainty_score":0.99989206},"labels":[],"label_agreement":null},{"id":"W2050718596","doi":"10.1016/s0012-365x(03)00196-1","title":"MGDD with block size 4 and its application to sampling designs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Block size; Block (permutation group theory); Block design; Sampling (signal processing); Combinatorics; Discrete mathematics; Computer science","score_opus":0.017915803458780806,"score_gpt":0.22782177702843118,"score_spread":0.20990597356965038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050718596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7071298,0.00017867029,0.2836241,0.000014759841,0.00004210791,0.00051820884,0.0000067295186,0.00020250076,0.008283155],"genre_scores_gemma":[0.98664343,0.000005350606,0.0131217195,0.000015260757,0.00001440003,0.00006794996,0.000001008777,0.000032508295,0.00009834907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994812,0.0000139670565,0.00014942803,0.00010980178,0.00009153492,0.00015404965],"domain_scores_gemma":[0.9995967,0.00010011534,0.000023742297,0.00017892684,0.000019488005,0.00008103584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001644276,0.00012291287,0.00014321617,0.000029879046,0.000052605505,0.000030418716,0.00006392296,0.000039167484,0.0000089319565],"category_scores_gemma":[0.000041512485,0.00010050207,0.000018148243,0.00014053502,0.000009692216,0.00004407346,0.000007218904,0.00005444053,0.000035764744],"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.00001839342,0.00007298436,0.00035550323,0.0021111541,0.00020395212,0.000005659752,0.01164952,0.033815373,0.16283387,0.7881856,0.00012425792,0.00062374637],"study_design_scores_gemma":[0.0048242053,0.0010525427,0.002152731,0.0031341403,0.00088757096,0.0010230448,0.02230943,0.28843862,0.34010047,0.29208288,0.037044376,0.0069500236],"about_ca_topic_score_codex":3.555292e-7,"about_ca_topic_score_gemma":0.0000018418325,"teacher_disagreement_score":0.49610272,"about_ca_system_score_codex":0.000010837909,"about_ca_system_score_gemma":0.0000036163874,"threshold_uncertainty_score":0.40983552},"labels":[],"label_agreement":null},{"id":"W2050946959","doi":"10.1016/j.disc.2008.01.016","title":"Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Illinois State University","keywords":"Digraph; Mathematics; Combinatorics; Hamiltonian path; Hamiltonian (control theory); Vertex (graph theory); Directed graph; Prime (order theory); Discrete mathematics; Graph","score_opus":0.014615531942675482,"score_gpt":0.19341050584554423,"score_spread":0.17879497390286875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050946959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97323126,0.000987479,0.001593966,0.000008659196,0.00063069345,0.00044652107,0.000079844845,0.00042793795,0.022593658],"genre_scores_gemma":[0.99935156,0.000044114102,0.00026726094,0.000005570506,0.000038420916,0.000030984833,0.0000055064224,0.000048770587,0.00020778415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987103,0.00007202306,0.0005063037,0.00013034853,0.00030994657,0.0002711001],"domain_scores_gemma":[0.9989642,0.00014985567,0.00013194085,0.0006417999,0.000042942647,0.00006929692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001823309,0.0002124334,0.0004045614,0.00015364404,0.00014933816,0.000021902255,0.00040227873,0.00008296645,0.000010781478],"category_scores_gemma":[0.00005107917,0.000146884,0.00020692468,0.00091212307,0.00014090385,0.00006505307,0.0000439545,0.00014643355,0.00003257032],"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.000038429247,0.0007553283,0.037812274,0.014224489,0.0024554075,0.00008894826,0.04035472,0.07041193,0.072856605,0.7529746,0.0073214937,0.00070572895],"study_design_scores_gemma":[0.0027317547,0.00019824055,0.10713129,0.0030033058,0.0005397758,0.0009421697,0.005663473,0.8268335,0.015785208,0.025411116,0.008918439,0.0028417686],"about_ca_topic_score_codex":0.000028872395,"about_ca_topic_score_gemma":0.0000061444416,"teacher_disagreement_score":0.75642157,"about_ca_system_score_codex":0.000022760227,"about_ca_system_score_gemma":0.000008051096,"threshold_uncertainty_score":0.5989756},"labels":[],"label_agreement":null},{"id":"W2051187346","doi":"10.1016/j.disc.2013.03.011","title":"Determinants of grids, tori, cylinders and Möbius ladders","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Torus; Planar; Cylinder; Singularity; Grid; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.02793990506582787,"score_gpt":0.3053568767351376,"score_spread":0.27741697166930973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051187346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97789043,0.00012206135,0.012544878,0.00011101983,0.0004432663,0.0012957242,0.000020507332,0.00020884478,0.007363291],"genre_scores_gemma":[0.82825625,0.000043333468,0.17079593,0.000035015946,0.000088805806,0.00010193277,0.0000029521875,0.00011634312,0.00055944256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764097,0.00005067116,0.0009929416,0.0003226352,0.00052107376,0.0004716863],"domain_scores_gemma":[0.99716103,0.0010025373,0.00062730914,0.00080877414,0.00020674209,0.00019362492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034899163,0.00039377404,0.00082684006,0.00012356756,0.000104768966,0.00006592233,0.00039099244,0.00018216945,0.00015984665],"category_scores_gemma":[0.0012749167,0.0003315068,0.0001404618,0.00022425903,0.0002512794,0.00033139775,0.00022850852,0.00020408533,0.000055158438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020774976,0.0007478618,0.0025924058,0.0053091934,0.00021609032,0.000019434035,0.0106967185,0.0000071444383,0.00258516,0.97019297,0.0034598396,0.004152426],"study_design_scores_gemma":[0.0007001956,0.0001232784,0.00014419979,0.00032143877,0.000110378096,0.000034493412,0.003085627,0.00330892,0.004637329,0.9870286,0.000087507724,0.00041804707],"about_ca_topic_score_codex":0.000019547488,"about_ca_topic_score_gemma":0.0000086588525,"teacher_disagreement_score":0.15825106,"about_ca_system_score_codex":0.000044116478,"about_ca_system_score_gemma":0.000040357958,"threshold_uncertainty_score":0.9999137},"labels":[],"label_agreement":null},{"id":"W2051200764","doi":"10.1016/s0012-365x(03)00251-6","title":"The metamorphosis of λ-fold block designs with block size four into a maximum packing of λKn with 4-cycles","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Combinatorics; Disjoint sets; Mathematics; Partition (number theory); Block (permutation group theory); Metamorphosis; Block size; Block design; Fold (higher-order function); Discrete mathematics; Computer science; Biology; Key (lock)","score_opus":0.014499723671043461,"score_gpt":0.20286254224414088,"score_spread":0.18836281857309742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051200764","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9766284,0.00046526015,0.016756207,0.000020075588,0.00006318182,0.00045292085,0.000010973873,0.000100340476,0.005502641],"genre_scores_gemma":[0.9824487,0.00002609671,0.01732138,0.0000039106144,0.000010069202,0.000038524835,5.930562e-7,0.00006396309,0.000086757784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99873745,0.00007666085,0.00045630417,0.00013756473,0.00032082383,0.00027121388],"domain_scores_gemma":[0.99860376,0.00050598255,0.00020866029,0.00053726754,0.00008008849,0.00006423259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004997068,0.00025451067,0.00044878593,0.000053300828,0.00010132408,0.000035004334,0.0002487697,0.00006565999,0.000012263105],"category_scores_gemma":[0.00008767386,0.000145729,0.00010876413,0.0003233985,0.00015291532,0.00006700943,0.000018365436,0.00011987152,0.000003055046],"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.00055005366,0.0008427798,0.014592321,0.018438574,0.01028531,0.00010970835,0.07363037,0.061819404,0.2119561,0.60507476,0.00089346577,0.0018071734],"study_design_scores_gemma":[0.0036539107,0.0012901851,0.0006385046,0.004384443,0.002069925,0.00045994736,0.040849566,0.014799562,0.7891506,0.13832474,0.0021311052,0.0022475389],"about_ca_topic_score_codex":0.000009145071,"about_ca_topic_score_gemma":0.000034134187,"teacher_disagreement_score":0.57719445,"about_ca_system_score_codex":0.000016650196,"about_ca_system_score_gemma":0.000020107425,"threshold_uncertainty_score":0.59426564},"labels":[],"label_agreement":null},{"id":"W2051202422","doi":"10.1016/j.disc.2007.12.061","title":"Volume requirements of 3D upward drawings","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Directed acyclic graph; Mathematics; Combinatorics; Directed graph; Volume (thermodynamics); Upper and lower bounds; Discrete mathematics; Grid; Line (geometry); Geometry; Mathematical analysis","score_opus":0.03419053521280606,"score_gpt":0.26760955334706366,"score_spread":0.23341901813425758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051202422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14582753,0.00003901422,0.84965265,0.00014733468,0.00013603912,0.00009381855,0.000002340272,0.00005353977,0.0040477505],"genre_scores_gemma":[0.69121504,0.000008981882,0.30754834,0.00006187941,0.000036241574,0.00000503066,0.0000066417197,0.000005798484,0.0011120426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990503,0.000017972921,0.00029165202,0.0001563192,0.00035256887,0.00013116376],"domain_scores_gemma":[0.9993492,0.000042760254,0.0001426652,0.00031273635,0.000106763335,0.00004590366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017380885,0.00008861421,0.00014663087,0.0000842568,0.00009725144,0.000025654397,0.0003521312,0.000029757906,0.000028091],"category_scores_gemma":[0.00006368506,0.00008132303,0.000053521242,0.00030593446,0.00004324419,0.00028966827,0.00012622123,0.000043250926,0.00006252021],"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.000019731602,0.0011019271,0.0042788954,0.00085756177,0.0002702977,0.000086882785,0.041505557,0.013141718,0.022157652,0.8610397,0.01925867,0.036281418],"study_design_scores_gemma":[0.0007720699,0.00024002545,0.004152565,0.00012330292,0.000028324546,0.0001255832,0.00011760109,0.90140325,0.01926118,0.067905195,0.0053449706,0.0005259224],"about_ca_topic_score_codex":0.0000023186333,"about_ca_topic_score_gemma":2.9006358e-7,"teacher_disagreement_score":0.88826156,"about_ca_system_score_codex":0.000016098129,"about_ca_system_score_gemma":0.00004780692,"threshold_uncertainty_score":0.33162567},"labels":[],"label_agreement":null},{"id":"W2051389005","doi":"10.1016/j.disc.2012.05.011","title":"A class of graphs with depression three","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Graph; Discrete mathematics; Integer (computer science); Path (computing); Class (philosophy); Degree (music); Physics; Computer science","score_opus":0.027368966003536815,"score_gpt":0.28358906149630747,"score_spread":0.25622009549277064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051389005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9453147,0.00024711524,0.025353016,0.000020753023,0.0001443157,0.0003534022,0.00001860247,0.00009419023,0.028453927],"genre_scores_gemma":[0.92154133,0.00000610929,0.07820936,0.00002123425,0.000051476436,0.00001784283,0.0000029148512,0.000047949852,0.000101756494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986578,0.000036928388,0.0003958057,0.00014417112,0.00040562113,0.00035967323],"domain_scores_gemma":[0.9984325,0.00039211087,0.0003105,0.0006762681,0.00006989608,0.00011869714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042219152,0.0002269012,0.00039732226,0.00009673623,0.00013213827,0.000013307898,0.0002787529,0.0001087394,0.000104486],"category_scores_gemma":[0.00016268942,0.00013549294,0.00013435399,0.00019590397,0.000188763,0.00015462702,0.00014069362,0.00015578211,0.000004509702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030355495,0.00014365857,0.015778603,0.0004780585,0.00010062224,0.0000013692081,0.0039660693,0.0000016327955,0.00030332347,0.97853446,0.00028063302,0.00038122846],"study_design_scores_gemma":[0.00042738437,0.00006876895,0.0021027422,0.00024375731,0.0001709024,0.000040532694,0.0007348351,0.00026487876,0.0045151925,0.9909864,0.00018025421,0.00026432972],"about_ca_topic_score_codex":0.0000028275715,"about_ca_topic_score_gemma":0.000007274779,"teacher_disagreement_score":0.05285635,"about_ca_system_score_codex":0.000011420388,"about_ca_system_score_gemma":0.000011648252,"threshold_uncertainty_score":0.5525242},"labels":[],"label_agreement":null},{"id":"W2051859441","doi":"10.1016/j.disc.2004.05.018","title":"On the order of the recurrence produced by the method of creative telescoping","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Telescoping series; Mathematics; Maple; Term (time); Order (exchange); Recurrence relation; Hypergeometric distribution; Algorithm; Algebra over a field; Combinatorics; Pure mathematics; Mathematical analysis; Botany","score_opus":0.013903059328247128,"score_gpt":0.2902473432465428,"score_spread":0.27634428391829563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051859441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039322734,0.0002402699,0.95184594,0.001385383,0.000027161566,0.0006604194,0.000025121304,0.00010835122,0.006384623],"genre_scores_gemma":[0.8528885,0.000051459912,0.14668527,0.000085414074,0.000023127794,0.00006509161,0.0000014298529,0.000032906442,0.00016679846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99918723,0.000071214454,0.000300786,0.00009725315,0.00022494516,0.000118599164],"domain_scores_gemma":[0.9986415,0.0005884147,0.00015393227,0.00053789903,0.00006523041,0.000013033948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003288471,0.00012489471,0.00022126806,0.00001780209,0.000054591077,0.0000075965245,0.00040983624,0.000029003662,0.000033362416],"category_scores_gemma":[0.0005834578,0.000051696516,0.00008570716,0.00038863884,0.000109965236,0.000040279443,0.00005776112,0.00017193209,0.0000029060693],"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.000039549668,0.000676317,0.00012861913,0.0018806264,0.0012870331,6.076028e-7,0.034602087,0.10802207,0.3299961,0.38942534,0.022599021,0.111342624],"study_design_scores_gemma":[0.000060851744,0.00003076193,0.000017509275,0.0003319014,0.000073721436,0.0000011807099,0.00060422794,0.09425623,0.88050896,0.023224318,0.0007495584,0.00014081111],"about_ca_topic_score_codex":0.0000035262753,"about_ca_topic_score_gemma":0.0000017215178,"teacher_disagreement_score":0.8135658,"about_ca_system_score_codex":0.000025424162,"about_ca_system_score_gemma":0.00000728835,"threshold_uncertainty_score":0.21081227},"labels":[],"label_agreement":null},{"id":"W2051877440","doi":"10.1016/s0012-365x(01)00356-9","title":"Dyck paths and a bijection for multisets of hook numbers","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bijection; Mathematics; Skew; Combinatorics; Hook; Class (philosophy); Lattice (music); Path (computing); Discrete mathematics; Computer science","score_opus":0.05179768231474255,"score_gpt":0.31680320103733656,"score_spread":0.26500551872259404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051877440","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5058541,0.00042177987,0.47419187,0.0003019013,0.00087538385,0.0039235996,0.0001933194,0.0005256366,0.013712407],"genre_scores_gemma":[0.5523498,0.00007347003,0.4459402,0.000021420574,0.00009901134,0.00017195521,0.000006123677,0.00012836329,0.001209693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822694,0.000033919794,0.0007604362,0.00029084366,0.0003439572,0.00034387776],"domain_scores_gemma":[0.9973683,0.0012413483,0.0005431535,0.00056681107,0.00016473507,0.00011565604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033560744,0.00030730394,0.00063123746,0.000112833004,0.00011662938,0.000034801822,0.00021161194,0.00015196166,0.00007112375],"category_scores_gemma":[0.0016471823,0.00027541313,0.00016580086,0.00019885847,0.00013438304,0.00017693064,0.00009483987,0.0001313059,0.000013959014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026909713,0.0007737843,0.00009163632,0.00466291,0.00017365205,0.000004679948,0.011834329,0.0000102754875,0.0022715027,0.97441053,0.0030797618,0.0026600284],"study_design_scores_gemma":[0.0013555416,0.0002029164,0.000009175951,0.00032122157,0.00017172577,0.00003076468,0.0012467724,0.028961647,0.0036677425,0.9631009,0.00055836875,0.0003731988],"about_ca_topic_score_codex":0.0000026380706,"about_ca_topic_score_gemma":0.0000043457076,"teacher_disagreement_score":0.046495672,"about_ca_system_score_codex":0.000050605846,"about_ca_system_score_gemma":0.000010057317,"threshold_uncertainty_score":0.9999698},"labels":[],"label_agreement":null},{"id":"W2051966902","doi":"10.1016/j.disc.2011.12.006","title":"Triple metamorphosis of twofold triple systems","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Triple system; Combinatorics; Mathematics; Metamorphosis; Zero (linguistics); Pairing; Discrete mathematics; Pure mathematics; Physics; Biology","score_opus":0.02683210484313919,"score_gpt":0.20368523395798685,"score_spread":0.17685312911484766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051966902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7157878,0.003550136,0.064197086,0.0000057265065,0.003110966,0.0013550107,0.00018540942,0.0008942907,0.21091354],"genre_scores_gemma":[0.9970625,0.000025275676,0.0020422006,0.0000026539662,0.00003412975,0.00005450017,0.0000061415226,0.000050357834,0.00072226283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99887174,0.00003876151,0.00054794096,0.00011710746,0.00019116621,0.00023328366],"domain_scores_gemma":[0.9992564,0.00004661829,0.00011722629,0.0004649527,0.000037920585,0.00007693753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039012806,0.0001914007,0.0004574942,0.00011023808,0.000033674845,0.000018400091,0.00025720574,0.000087648936,0.00013604217],"category_scores_gemma":[0.000027999145,0.00015993712,0.00016886136,0.00023752476,0.000044479846,0.00009884819,0.00002417169,0.000087484754,0.00007310886],"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.000048603015,0.00037555743,0.00085918885,0.008220292,0.0014276279,0.000027736123,0.029791985,0.0011914168,0.025249626,0.92494893,0.0073968535,0.00046217564],"study_design_scores_gemma":[0.005859547,0.00080563076,0.001267437,0.0031060998,0.0021466934,0.0002755141,0.04300979,0.37641367,0.42389917,0.11884197,0.01993005,0.004444397],"about_ca_topic_score_codex":0.00002779731,"about_ca_topic_score_gemma":0.000002312249,"teacher_disagreement_score":0.806107,"about_ca_system_score_codex":0.000015031154,"about_ca_system_score_gemma":0.000005657374,"threshold_uncertainty_score":0.65220463},"labels":[],"label_agreement":null},{"id":"W2052201505","doi":"10.1016/s0012-365x(00)00388-5","title":"Colouring Steiner systems with specified block colour patterns","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Gruppo Nazionale per le Strutture Algebriche, Geometriche e le loro Applicazioni","keywords":"Mathematics; Combinatorics; Integer (computer science); Block (permutation group theory); Type (biology); Discrete mathematics; Steiner system; Computer science","score_opus":0.010682379561719704,"score_gpt":0.1909996477849388,"score_spread":0.18031726822321908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052201505","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9672522,0.00016077951,0.010674119,0.000013918716,0.00031889367,0.00042192425,0.000021374899,0.0004525188,0.020684272],"genre_scores_gemma":[0.9981098,0.000028179362,0.0003315122,0.0000070702777,0.00014316653,0.000064334185,0.0000075754506,0.0000792776,0.001229093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988477,0.000030128376,0.00035240222,0.00016380545,0.00025024192,0.00035572084],"domain_scores_gemma":[0.9993252,0.00006819407,0.00005256802,0.00040965923,0.000036934645,0.00010743566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019121847,0.00025506737,0.00034775876,0.00007992972,0.0000777308,0.00011005272,0.00021142261,0.00008782445,0.00004053511],"category_scores_gemma":[0.0000069482253,0.00019632635,0.000059835027,0.000186201,0.000029716148,0.00009234803,0.000024462048,0.0001508378,0.00008738368],"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.0004938338,0.0010989154,0.050985258,0.022280866,0.004318845,0.0030667647,0.047082227,0.5206534,0.024701362,0.31410527,0.009890353,0.0013228579],"study_design_scores_gemma":[0.008766524,0.001661424,0.0097191585,0.011154135,0.0012736705,0.006528378,0.09451336,0.7724959,0.020382538,0.007740224,0.05655641,0.009208279],"about_ca_topic_score_codex":0.0000068666573,"about_ca_topic_score_gemma":0.0000133078665,"teacher_disagreement_score":0.30636504,"about_ca_system_score_codex":0.000041026477,"about_ca_system_score_gemma":0.000005902902,"threshold_uncertainty_score":0.80059564},"labels":[],"label_agreement":null},{"id":"W2052851790","doi":"10.1016/j.disc.2006.11.026","title":"On realizations of point determining graphs, and obstructions to full homomorphisms","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph homomorphism; Vertex (graph theory); Graph; Homomorphism; Discrete mathematics; Induced subgraph; Wheel graph; Graph power; Line graph","score_opus":0.022561029521324626,"score_gpt":0.30560892087986674,"score_spread":0.28304789135854214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052851790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1602353,0.00001286971,0.8364502,0.00010503739,0.00005539195,0.00018667009,0.0000087973685,0.00006616045,0.0028795523],"genre_scores_gemma":[0.5971909,0.0000063330917,0.40264812,0.000048638096,0.000005901031,0.000009370225,0.0000019630284,0.000013272869,0.00007551684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989053,0.000025239651,0.00031489917,0.00022091182,0.00028110843,0.00025256304],"domain_scores_gemma":[0.9986584,0.0004168752,0.00010442081,0.0005717285,0.00009431898,0.00015421983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050244486,0.000112685855,0.00016654316,0.00032393794,0.00013512805,0.0000459802,0.00039215002,0.000037937814,0.0000069392217],"category_scores_gemma":[0.00029943127,0.000100182595,0.000045813234,0.000674565,0.000111374226,0.00016165448,0.0001981486,0.00009555124,0.000008377572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004874837,0.000029396153,0.000040712053,0.000030937714,0.0000083806035,0.0000057157226,0.0018454485,0.00012677752,0.0017097591,0.9923541,0.000024526107,0.003819379],"study_design_scores_gemma":[0.00016864743,0.00023591606,0.00043447493,0.00010309258,0.0000071270624,0.000051478488,0.0005857467,0.008977677,0.0054914816,0.98372287,0.00005727088,0.00016424939],"about_ca_topic_score_codex":0.0000018611817,"about_ca_topic_score_gemma":0.000008989069,"teacher_disagreement_score":0.4369556,"about_ca_system_score_codex":0.00001755661,"about_ca_system_score_gemma":0.0000142577055,"threshold_uncertainty_score":0.40853277},"labels":[],"label_agreement":null},{"id":"W2052869910","doi":"10.1016/j.disc.2014.12.010","title":"Maximal bifix decoding","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca; Università degli Studi di Salerno; Agence Nationale de la Recherche","keywords":"Mathematics; Decoding methods; Generalization; Class (philosophy); Tree (set theory); Combinatorics; Discrete mathematics; Interval (graph theory); Natural number; Algorithm; Computer science; Artificial intelligence","score_opus":0.04140851047828288,"score_gpt":0.26999016780454593,"score_spread":0.22858165732626307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052869910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046695225,0.00011173018,0.92340386,0.0004671204,0.00029796406,0.00009900363,0.0000026535001,0.00037917285,0.028543252],"genre_scores_gemma":[0.5548227,0.0000042715606,0.44421273,0.00024372876,0.00008424392,0.000010261293,0.0000029447729,0.000019084031,0.0006000095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990471,0.000024698862,0.00021062685,0.0001973815,0.00027434572,0.00024581855],"domain_scores_gemma":[0.9990665,0.00007940511,0.00008296027,0.00058158487,0.000041386236,0.00014820954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004752888,0.00012324935,0.0001580914,0.000059923233,0.00005784999,0.00020031432,0.0007686439,0.000040829724,0.000017351294],"category_scores_gemma":[0.00010925369,0.00009817124,0.000057889603,0.00020078226,0.00003362778,0.00035166653,0.00029859215,0.00007414736,0.00033891556],"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.0000013263342,0.00004583789,0.00006505791,0.000032175052,0.0000126790965,0.00002298341,0.0037398164,0.00002534317,0.0002652416,0.9867445,0.002676247,0.0063687526],"study_design_scores_gemma":[0.00032664737,0.000055385535,0.00004655733,0.000057918318,0.000009626758,0.00007691492,0.00084569183,0.5178431,0.0022312878,0.4747143,0.0034863667,0.00030614538],"about_ca_topic_score_codex":0.0000030243843,"about_ca_topic_score_gemma":6.3061077e-7,"teacher_disagreement_score":0.5178178,"about_ca_system_score_codex":0.000028042557,"about_ca_system_score_gemma":0.000037561535,"threshold_uncertainty_score":0.4356187},"labels":[],"label_agreement":null},{"id":"W2053756329","doi":"10.1016/j.disc.2008.08.013","title":"More on almost self-complementary graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Isomorphism (crystallography); Complement (music); Constructive proof; Automorphism; Discrete mathematics; Graph; Matching (statistics); Order (exchange); Existential quantification","score_opus":0.051814792430309294,"score_gpt":0.295176398150736,"score_spread":0.2433616057204267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053756329","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.2911917,0.00071336236,0.5700902,0.014823585,0.00071399275,0.0014015083,0.000025009507,0.0021055902,0.11893507],"genre_scores_gemma":[0.8093565,0.00056377455,0.18736857,0.0022345395,0.000042100353,0.000030015424,0.000017998049,0.000020116495,0.00036638725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903494,0.00005044567,0.00024244738,0.00020552202,0.00026268643,0.00020398157],"domain_scores_gemma":[0.9986893,0.00013564767,0.00008253885,0.00095897075,0.000056659883,0.00007691212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015051043,0.00014617939,0.00015897094,0.00007517247,0.00036125153,0.000053380256,0.0009741925,0.000025308645,0.000061055005],"category_scores_gemma":[0.00002112918,0.00012260122,0.00007395273,0.00033556676,0.0000559004,0.0002346365,0.00032963915,0.00013231712,0.0001202525],"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.0000021274382,0.0002669796,0.00037221907,0.000027521291,0.000052846688,0.00002478661,0.013791461,0.000047282483,0.00016177766,0.97147524,0.009810354,0.003967388],"study_design_scores_gemma":[0.0027397033,0.0006952452,0.009507855,0.00048895745,0.00006173289,0.00039618768,0.001857816,0.78660315,0.0057622087,0.06979001,0.11978046,0.0023166928],"about_ca_topic_score_codex":0.0000015890067,"about_ca_topic_score_gemma":0.0000024537112,"teacher_disagreement_score":0.90168524,"about_ca_system_score_codex":0.000031648924,"about_ca_system_score_gemma":0.000025798692,"threshold_uncertainty_score":0.49995327},"labels":[],"label_agreement":null},{"id":"W2053952882","doi":"10.1016/j.disc.2008.05.003","title":"Independence polynomials of circulants with an application to music","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Cardinality (data modeling); Complement (music); Independence (probability theory); Graph; Polynomial; Tutte polynomial; Voltage graph; Line graph","score_opus":0.04803095456035274,"score_gpt":0.31168601970545834,"score_spread":0.2636550651451056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053952882","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6380374,0.0000093820545,0.35873017,0.000031554373,0.00006608659,0.00095307303,0.000020421352,0.00015372747,0.0019982029],"genre_scores_gemma":[0.7468604,0.000003442763,0.25271907,0.000032977332,0.00006559172,0.00010601332,0.000006270627,0.00008161309,0.00012460668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975023,0.000053922762,0.00079832843,0.00039500848,0.00086503464,0.0003853719],"domain_scores_gemma":[0.9971497,0.00040456787,0.0005788257,0.0013397313,0.00028951094,0.00023765475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042310677,0.0003416715,0.00071997894,0.00016226045,0.0001394642,0.000019456193,0.00061666046,0.00014443621,0.000039685816],"category_scores_gemma":[0.0005392406,0.0002797589,0.000084995685,0.00049067015,0.0001472946,0.00026506255,0.0001285785,0.00018525268,0.000052791216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015667173,0.0016733774,0.0006955265,0.0015789041,0.00017363444,0.000047212063,0.024352819,0.00030408145,0.021481967,0.948078,0.00040322784,0.0010546172],"study_design_scores_gemma":[0.0010826758,0.0006665333,0.00026172548,0.00037303273,0.00013627757,0.000252771,0.0018288874,0.0029956403,0.027511869,0.9640253,0.00008724777,0.0007780409],"about_ca_topic_score_codex":0.0000124909975,"about_ca_topic_score_gemma":0.000017802011,"teacher_disagreement_score":0.108823024,"about_ca_system_score_codex":0.000073228846,"about_ca_system_score_gemma":0.00010094652,"threshold_uncertainty_score":0.9999654},"labels":[],"label_agreement":null},{"id":"W2054087167","doi":"10.1016/s0012-365x(01)00042-5","title":"The Tutte polynomial for homeomorphism classes of graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Tutte polynomial; Mathematics; Combinatorics; Chromatic polynomial; Homeomorphism (graph theory); Discrete mathematics; Polynomial; Class (philosophy); Graph; Line graph; Computer science; Voltage graph; Artificial intelligence","score_opus":0.05471248833812317,"score_gpt":0.30077858165186755,"score_spread":0.24606609331374438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054087167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87521976,0.001107236,0.06687058,0.004946697,0.0006079483,0.004558371,0.00063759764,0.0004675645,0.045584247],"genre_scores_gemma":[0.9574755,0.00012078843,0.039056875,0.00005027444,0.00008612033,0.00033544475,0.000008897374,0.0000625909,0.0028035264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988296,0.000033499124,0.00051221345,0.00015593854,0.00019621935,0.0002725206],"domain_scores_gemma":[0.99698025,0.0019095679,0.00032231104,0.0006371331,0.00009177941,0.00005898014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042951966,0.00017223285,0.0002875434,0.000056875255,0.0003455317,0.000043715365,0.00040907506,0.00007409987,0.0000712305],"category_scores_gemma":[0.0004057078,0.000114370065,0.00025533125,0.00020723612,0.0002768336,0.000059482558,0.00004922765,0.00009764188,0.000021309674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072578696,0.00012743814,0.000011363802,0.00014665174,0.00007011683,2.2028847e-7,0.0009104667,7.5129685e-7,0.0009239194,0.97995573,0.017410377,0.00043570864],"study_design_scores_gemma":[0.00034926995,0.00005271947,0.000012781146,0.0000446159,0.00010601692,0.0000063387834,0.0007357449,0.0017272756,0.003619015,0.9820374,0.01115193,0.00015687748],"about_ca_topic_score_codex":0.0000010034938,"about_ca_topic_score_gemma":0.0000054313623,"teacher_disagreement_score":0.08225571,"about_ca_system_score_codex":0.000009954093,"about_ca_system_score_gemma":0.000008363677,"threshold_uncertainty_score":0.46638757},"labels":[],"label_agreement":null},{"id":"W2054709282","doi":"10.1016/j.disc.2011.06.011","title":"Finite Sholander trees, trees, and their betweenness","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Canada Research Chairs","keywords":"Betweenness centrality; Mathematics; Tree (set theory); Intersection (aeronautics); Characterization (materials science); Combinatorics; Discrete mathematics; Order (exchange)","score_opus":0.056277129533041564,"score_gpt":0.2814007296774125,"score_spread":0.2251236001443709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054709282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043291904,0.00021289823,0.94566983,0.00009053738,0.000058921592,0.00021803695,0.000015045208,0.00017301872,0.010269819],"genre_scores_gemma":[0.9191691,0.000037790196,0.08007968,0.000055122335,0.000028572416,0.000023949518,0.000004811077,0.000027010057,0.0005739148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987318,0.00006795576,0.00026105985,0.00034263812,0.00021032497,0.00038622072],"domain_scores_gemma":[0.99851495,0.00034283297,0.000091121816,0.0008364393,0.000056569494,0.00015805828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042134512,0.00021492275,0.00026514658,0.00013021831,0.00013995811,0.000107819535,0.0008777182,0.000066899374,0.000040047842],"category_scores_gemma":[0.00009640303,0.00014955814,0.00007006522,0.00033230058,0.00016792657,0.00043261796,0.00045610685,0.00017618065,0.00003725229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018770264,0.00022243765,0.0036418973,0.00013828631,0.00010963127,0.000044948756,0.030746173,0.00001903242,0.00037508213,0.93940073,0.00015180664,0.025131207],"study_design_scores_gemma":[0.00054375816,0.00019650879,0.003841909,0.000086243395,0.000013951545,0.000044922523,0.001144124,0.054373663,0.0031708789,0.93552506,0.0005605235,0.0004984769],"about_ca_topic_score_codex":0.0000043218834,"about_ca_topic_score_gemma":0.000016230473,"teacher_disagreement_score":0.87587726,"about_ca_system_score_codex":0.000012243894,"about_ca_system_score_gemma":0.000020961497,"threshold_uncertainty_score":0.6098804},"labels":[],"label_agreement":null},{"id":"W2055586003","doi":"10.1016/j.disc.2008.11.001","title":"Hamming distance for conjugates","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hamming distance; Combinatorics; Mathematics; Alphabet; String (physics); Hamming code; Hamming graph; Binary number; Hamming bound; Conjugate; Discrete mathematics; Arithmetic; Algorithm; Block code","score_opus":0.02867343019447815,"score_gpt":0.2616710702256235,"score_spread":0.23299764003114537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055586003","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.0028488273,0.00012612733,0.9952474,0.00017655596,0.00013051221,0.00017169755,0.000021020358,0.00011782058,0.001159999],"genre_scores_gemma":[0.1180094,0.000027260643,0.88100433,0.000099982375,0.00006899526,0.000038136994,0.00001623098,0.000013370725,0.0007222598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992433,0.000007325555,0.00018959306,0.00020062269,0.00016439008,0.00019477682],"domain_scores_gemma":[0.9991691,0.00015215811,0.000085925734,0.0004860847,0.000048151127,0.000058578567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010487539,0.00010398294,0.00014872334,0.000024611618,0.00022989121,0.00006901391,0.0005378472,0.000029357658,0.000005788996],"category_scores_gemma":[0.00006341874,0.000080130696,0.000057769663,0.0000909762,0.00004583829,0.0003350161,0.00016728751,0.00004491081,0.000024293297],"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.0000068854883,0.00014124594,0.00017121792,0.00024961645,0.000029462464,0.000030215231,0.006766978,0.00006714007,0.00088859536,0.96903175,0.012980109,0.009636775],"study_design_scores_gemma":[0.0005143672,0.00007872116,0.00012349917,0.00012674349,0.000008862395,0.00006510978,0.00017728118,0.87686735,0.004437847,0.071112946,0.04610326,0.00038403986],"about_ca_topic_score_codex":0.0000025309662,"about_ca_topic_score_gemma":8.313203e-7,"teacher_disagreement_score":0.8979188,"about_ca_system_score_codex":0.000011133471,"about_ca_system_score_gemma":0.000020689777,"threshold_uncertainty_score":0.3267635},"labels":[],"label_agreement":null},{"id":"W2055714468","doi":"10.1016/j.disc.2004.02.026","title":"IC-Colorings and IC-Indices of graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Integer (computer science); Edge coloring; Discrete mathematics; Graph power; Computer science; Line graph","score_opus":0.011820432619405085,"score_gpt":0.23298965538140437,"score_spread":0.2211692227619993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055714468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9556116,0.000610555,0.035683822,0.0011305034,0.00008625157,0.00016877837,0.000003489376,0.00016479494,0.0065401937],"genre_scores_gemma":[0.8278698,0.000041107643,0.17182782,0.000108922846,0.0000031879697,0.0000051124903,6.615754e-7,0.000007227646,0.00013615059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999098,0.000014290718,0.00028865793,0.00019440844,0.00022864007,0.00017597027],"domain_scores_gemma":[0.9992588,0.00008463816,0.00015860776,0.00037324688,0.000048872145,0.00007582469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002868116,0.00011247145,0.00019000414,0.00011187846,0.00006948389,0.00006337152,0.00034308538,0.00004453627,0.000007560528],"category_scores_gemma":[0.000034795423,0.00008850195,0.000053146676,0.00023533088,0.00008588945,0.0002276137,0.00016442644,0.0000684226,0.000016242417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001091764,0.000057042944,0.0002569963,0.000108374494,0.00001851428,0.0000013282435,0.0035006332,0.000016990294,0.002793739,0.99051154,0.00016517515,0.002568587],"study_design_scores_gemma":[0.00069288374,0.0001831634,0.000539147,0.00022511273,0.00004436503,0.00003794724,0.000452624,0.045639116,0.03648576,0.9138641,0.0014101074,0.00042568377],"about_ca_topic_score_codex":0.000007121001,"about_ca_topic_score_gemma":0.0000037712018,"teacher_disagreement_score":0.13614401,"about_ca_system_score_codex":0.0000043434666,"about_ca_system_score_gemma":0.000012930512,"threshold_uncertainty_score":0.36090046},"labels":[],"label_agreement":null},{"id":"W2055751002","doi":"10.1016/j.disc.2014.03.015","title":"Recognition of prime graphs from a prime subgraph","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Combinatorics; Mathematics; Digraph; Prime (order theory); Vertex (graph theory); Graph; Discrete mathematics; Singleton","score_opus":0.025591788007199887,"score_gpt":0.27737762576300273,"score_spread":0.2517858377558028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055751002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14490065,0.000054560318,0.8508067,0.000088221175,0.00007520792,0.00023917742,0.000022156866,0.00013293875,0.0036803808],"genre_scores_gemma":[0.67257786,0.000015408921,0.32722205,0.000035372675,0.0000222799,0.000021656251,0.000019121484,0.000021071324,0.000065189764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834776,0.00014050443,0.00040474994,0.00033053293,0.00047575255,0.00030069222],"domain_scores_gemma":[0.9979621,0.00052135903,0.000247464,0.0010149429,0.0001449529,0.000109157314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006304026,0.00016944848,0.00030363008,0.00020771519,0.000072824165,0.0000649898,0.00095611333,0.00007149381,0.000034486322],"category_scores_gemma":[0.00029814712,0.00014527369,0.00014725221,0.00058108836,0.00015816024,0.0003376312,0.00025171242,0.00015462103,0.00010163053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024967045,0.00029266873,0.0005220951,0.00016308903,0.0001095191,0.000004720774,0.003936818,0.0000102379645,0.033385407,0.8989337,0.00009006015,0.06252671],"study_design_scores_gemma":[0.00028139557,0.00009514802,0.00033180014,0.00009746438,0.000012657772,0.0000031036268,0.00006384783,0.018710533,0.061755776,0.9183573,0.00010482466,0.00018611063],"about_ca_topic_score_codex":0.0000134758075,"about_ca_topic_score_gemma":0.0000038381763,"teacher_disagreement_score":0.5276772,"about_ca_system_score_codex":0.000012572939,"about_ca_system_score_gemma":0.000024012386,"threshold_uncertainty_score":0.5924089},"labels":[],"label_agreement":null},{"id":"W2055996616","doi":"10.1016/s0012-365x(02)00864-6","title":"Homomorphisms and amalgamation","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Homomorphism; Discrete mathematics; Combinatorics; Countable set; Graph homomorphism; Homogeneous; Graph; Random regular graph; Class (philosophy); Line graph; Voltage graph; 1-planar graph; Computer science","score_opus":0.030106388836899423,"score_gpt":0.30582616568153176,"score_spread":0.27571977684463234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055996616","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49021572,0.00026434753,0.3965653,0.00020163995,0.00019647545,0.00048080133,0.00001309299,0.0002625464,0.11180009],"genre_scores_gemma":[0.81488085,0.000028503291,0.18306765,0.000094011775,0.000023972581,0.000024143215,0.000004502054,0.00003710525,0.0018392768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991501,0.00007521989,0.00027263703,0.0001653181,0.00012579032,0.00021094445],"domain_scores_gemma":[0.9990124,0.00045469546,0.00012540487,0.00030374154,0.00003380267,0.00006992475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041233012,0.00015713673,0.00024273379,0.000051933723,0.00013557739,0.000021465075,0.00008357799,0.00009794124,0.00020794751],"category_scores_gemma":[0.00080062187,0.00013134458,0.000046571866,0.00008390178,0.00016213403,0.000110897796,0.000027771803,0.00012539412,0.000047162284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029272899,0.0000432369,0.000052368785,0.00009802771,0.000018518589,0.0000048068746,0.0011194065,0.000001181051,0.00018181106,0.9981276,0.00014585123,0.00020428721],"study_design_scores_gemma":[0.000289726,0.00002880822,0.00002809685,0.000032185384,0.000039811308,0.00007944607,0.001100757,0.00027716733,0.0018712973,0.99532187,0.00076558103,0.000165281],"about_ca_topic_score_codex":2.4624538e-7,"about_ca_topic_score_gemma":0.0000011320988,"teacher_disagreement_score":0.32466513,"about_ca_system_score_codex":0.000014666763,"about_ca_system_score_gemma":0.000011975078,"threshold_uncertainty_score":0.5356077},"labels":[],"label_agreement":null},{"id":"W2056137755","doi":"10.1016/j.disc.2011.10.009","title":"Schröder quasigroups with a specified number of idempotents","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; University Research Committee, Emory University; Mount Saint Vincent University; National Science Foundation","keywords":"Quasigroup; Mathematics; Idempotence; Combinatorics; Order (exchange); Commutative property; Discrete mathematics; Invariant (physics); Arithmetic; Variety (cybernetics)","score_opus":0.02227717268754375,"score_gpt":0.21127794351454662,"score_spread":0.18900077082700287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056137755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82750773,0.000042893407,0.030242164,0.0000018127561,0.00010136381,0.00017681187,0.000009761988,0.0001549894,0.14176248],"genre_scores_gemma":[0.98909545,0.000005656159,0.010657357,0.000003652691,0.000019742247,0.000014738996,0.0000026404036,0.000041905732,0.00015883599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992791,0.000015988253,0.00028036124,0.000092223156,0.00015944299,0.0001729301],"domain_scores_gemma":[0.99951994,0.000026342184,0.00004578197,0.00032385785,0.000028323726,0.000055757424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001328867,0.00014908428,0.00024727228,0.0000377087,0.000022173243,0.000009459463,0.00015635116,0.000056815876,0.00022789193],"category_scores_gemma":[0.0000074926834,0.000110357876,0.00006481834,0.00013390495,0.00005621327,0.00008500973,0.000015707736,0.00008204215,0.000105480976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013963936,0.00043625938,0.013624911,0.003873219,0.0009868077,0.00006873329,0.04453185,0.00030296252,0.006845023,0.92749244,0.0008229046,0.00087524665],"study_design_scores_gemma":[0.0062038894,0.0008601968,0.029360086,0.005688271,0.0011405011,0.0010405695,0.053003963,0.051161602,0.27071968,0.57218826,0.0029048722,0.005728125],"about_ca_topic_score_codex":0.00000454178,"about_ca_topic_score_gemma":0.0000026702255,"teacher_disagreement_score":0.35530418,"about_ca_system_score_codex":0.000007511995,"about_ca_system_score_gemma":0.0000035342046,"threshold_uncertainty_score":0.45002636},"labels":[],"label_agreement":null},{"id":"W2056838769","doi":"10.1016/s0012-365x(03)00154-7","title":"Bipartite rainbow Ramsey numbers","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Rainbow; Bipartite graph; Combinatorics; Monochromatic color; Mathematics; Ramsey's theorem; Edge coloring; Discrete mathematics; Colored; Complete bipartite graph; Graph; Graph power; Line graph; Physics","score_opus":0.03297050843445634,"score_gpt":0.3058187435489176,"score_spread":0.2728482351144612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056838769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5567172,0.00025268426,0.028821949,0.00020549801,0.0011075176,0.0009512422,0.0000430249,0.00059028476,0.41131058],"genre_scores_gemma":[0.86397153,0.000025957648,0.13064845,0.00024130273,0.0000997199,0.00004005003,0.0000061014994,0.00011172149,0.0048551387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981003,0.000131709,0.000550277,0.00030091067,0.00041753007,0.0004993046],"domain_scores_gemma":[0.9980895,0.0005786485,0.0002327553,0.00085964164,0.00007129847,0.00016814936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007934343,0.00032856822,0.00044782407,0.000098180375,0.0003297146,0.000076383985,0.0003431383,0.00015717284,0.0007657899],"category_scores_gemma":[0.0012971989,0.0002517771,0.0002472423,0.00027286063,0.00019062197,0.00012376235,0.0000930389,0.00024596072,0.00008171345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049854843,0.000068928064,0.00022553401,0.00018975582,0.00007882562,0.000009669006,0.0038500852,0.0000035583705,0.000119980694,0.99166036,0.0036448475,0.00014345738],"study_design_scores_gemma":[0.00041768365,0.000030291649,0.00002437917,0.00006979264,0.00008308984,0.00005340285,0.0011285556,0.00020272072,0.0018544853,0.9822412,0.01352491,0.000369477],"about_ca_topic_score_codex":0.0000020092555,"about_ca_topic_score_gemma":0.0000035990497,"teacher_disagreement_score":0.40645543,"about_ca_system_score_codex":0.00003494692,"about_ca_system_score_gemma":0.000030473155,"threshold_uncertainty_score":0.99999344},"labels":[],"label_agreement":null},{"id":"W2057066268","doi":"10.1016/s0012-365x(01)00158-3","title":"A family of universal pseudo-homogeneous G-colourable graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Combinatorics; Countable set; Homogeneous; Discrete mathematics; Graph isomorphism; Graph; Line graph","score_opus":0.028750135858627665,"score_gpt":0.26149008944714447,"score_spread":0.2327399535885168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057066268","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.4115012,0.0004938174,0.5474453,0.0002913051,0.00015744827,0.0005127417,0.000020724414,0.0002917962,0.03928566],"genre_scores_gemma":[0.82825714,0.00008886195,0.17023829,0.000046873367,0.0000052617233,0.000010317746,0.0000010027821,0.000022399925,0.0013298622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985028,0.000063845924,0.00030942186,0.00027383806,0.00046659974,0.00038351907],"domain_scores_gemma":[0.99850625,0.00022436155,0.00015304946,0.00088270125,0.000115703064,0.00011795136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027141155,0.00016350714,0.00027037,0.00019973375,0.000102384896,0.00005358503,0.0012081041,0.00006005905,0.00007299836],"category_scores_gemma":[0.00008540029,0.00014247738,0.0001333717,0.0007647571,0.00017860044,0.00029321,0.00028759823,0.00014354198,0.00009693802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004488013,0.00014903504,0.00006564466,0.00009312948,0.000040217874,0.000048395086,0.0022800302,0.00023254268,0.006247928,0.98808223,0.0004388834,0.0023175003],"study_design_scores_gemma":[0.0005254146,0.00023316013,0.00005793305,0.00007356762,0.000017087246,0.000058860198,0.0006029732,0.27031794,0.007973307,0.7194586,0.00034318972,0.00033799617],"about_ca_topic_score_codex":0.000005280722,"about_ca_topic_score_gemma":0.0000011993284,"teacher_disagreement_score":0.41675594,"about_ca_system_score_codex":0.000028540999,"about_ca_system_score_gemma":0.000018821518,"threshold_uncertainty_score":0.5810059},"labels":[],"label_agreement":null},{"id":"W2057179567","doi":"10.1016/j.disc.2011.03.026","title":"Graphs with equal eternal vertex cover and eternal domination numbers","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex cover; Vertex (graph theory); Domination analysis; Cover (algebra); Graph; Discrete mathematics","score_opus":0.029087318685136275,"score_gpt":0.2742533542844277,"score_spread":0.24516603559929143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057179567","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.18600808,0.000027061204,0.80330557,0.000029412517,0.000075005235,0.00018117146,0.0000044349867,0.000073277275,0.010295973],"genre_scores_gemma":[0.81952643,0.000013308185,0.17993031,0.00004997283,0.000009360021,0.000016194508,0.0000014660853,0.000018974086,0.000433994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865955,0.000056031982,0.00021449204,0.00029286498,0.0004643524,0.0003127367],"domain_scores_gemma":[0.999061,0.0001436695,0.00012461124,0.00045692953,0.00007745455,0.00013636194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003555579,0.00016988398,0.00018031933,0.00012356021,0.00011040913,0.00012558904,0.0005906734,0.000047797417,0.000056912097],"category_scores_gemma":[0.000046026962,0.00012606253,0.00004880718,0.00024397297,0.00019887536,0.00063288066,0.00022366144,0.00016844086,0.000062119354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058458096,0.00008126683,0.0018888591,0.000086067805,0.000060384256,0.000056188008,0.0081351325,0.000008179126,0.0004573146,0.9851438,0.000058344536,0.003966024],"study_design_scores_gemma":[0.0012869567,0.00045487823,0.0021644577,0.00016079163,0.000027221942,0.00023129194,0.0004070506,0.04879385,0.0044239,0.9414353,0.00012899241,0.0004853237],"about_ca_topic_score_codex":0.000011028512,"about_ca_topic_score_gemma":0.0000045839874,"teacher_disagreement_score":0.63351834,"about_ca_system_score_codex":0.000020601225,"about_ca_system_score_gemma":0.000024429397,"threshold_uncertainty_score":0.51406807},"labels":[],"label_agreement":null},{"id":"W2058209797","doi":"10.1016/s0012-365x(02)00461-2","title":"Existence of self-orthogonal diagonal Latin squares with a missing subsquare","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Latin square; Diagonal; Combinatorics; Orthogonal array; Discrete mathematics; Statistics; Geometry; Taguchi methods","score_opus":0.010705066625756082,"score_gpt":0.20211905626375562,"score_spread":0.19141398963799955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058209797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94733685,0.00032152518,0.021990357,0.0000072003913,0.000078690726,0.00019746093,0.000023849898,0.00021603225,0.029828046],"genre_scores_gemma":[0.9754634,0.0000054661737,0.024388492,0.000004524109,0.000016118724,0.000017087848,0.0000053665663,0.00003858284,0.000060987484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999048,0.00004128669,0.0003255451,0.00012176847,0.00024219305,0.00022123058],"domain_scores_gemma":[0.99940324,0.00012731111,0.00008385726,0.0002693384,0.000043177148,0.000073079194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022382643,0.000186189,0.00027699352,0.00007911893,0.000054415803,0.000028213046,0.00012308694,0.000058800277,0.00006401816],"category_scores_gemma":[0.0000353029,0.00014612776,0.00007851944,0.0002529363,0.000057581685,0.00008139499,0.0000083249015,0.00010277442,0.000010739563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016652795,0.00015347988,0.0071827834,0.0036965641,0.00026414543,0.000033369364,0.013210733,0.0028056796,0.0030004915,0.9691641,0.00008073076,0.00039131535],"study_design_scores_gemma":[0.006580035,0.0014106543,0.012063928,0.010182957,0.0011587681,0.0011247554,0.04788619,0.23664182,0.17106998,0.496235,0.009241476,0.006404425],"about_ca_topic_score_codex":7.674119e-7,"about_ca_topic_score_gemma":0.0000033792235,"teacher_disagreement_score":0.47292906,"about_ca_system_score_codex":0.0000145880485,"about_ca_system_score_gemma":0.00001948944,"threshold_uncertainty_score":0.59589165},"labels":[],"label_agreement":null},{"id":"W2058216532","doi":"10.1016/j.disc.2007.12.002","title":"On a cycle partition problem","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Partition (number theory); Circumference; Vertex (graph theory); Discrete mathematics; Graph; Chordal graph; Pathwidth; Line graph","score_opus":0.029932927174198425,"score_gpt":0.29276310488968144,"score_spread":0.262830177715483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058216532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06883495,0.000018722729,0.9007898,0.00037512626,0.000043423806,0.0002699454,0.0000030710667,0.0002456979,0.029419271],"genre_scores_gemma":[0.78971463,0.000014106801,0.20930767,0.000121576086,0.000021264812,0.000053789146,0.0000026072146,0.00001663383,0.00074769306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988919,0.00004169332,0.00018559433,0.00022581399,0.0003788993,0.00027611208],"domain_scores_gemma":[0.99903136,0.00016266455,0.00006603772,0.00060607394,0.000046615067,0.00008727053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021324163,0.00010987206,0.00012833808,0.000083744046,0.00017940465,0.00004529449,0.0005381599,0.000033020904,0.00002747966],"category_scores_gemma":[0.000081741404,0.00008872671,0.000060134167,0.00031292514,0.00008896793,0.00027634113,0.00013863474,0.00012464977,0.00040570978],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003277672,0.00008460971,0.00001766934,0.00002822913,0.0000064606725,0.000024950177,0.0014540816,0.00029558333,0.00023721554,0.99673665,0.00037008018,0.0007412212],"study_design_scores_gemma":[0.00018076236,0.00011008972,0.000060198323,0.00004047088,0.000001586279,0.000043642875,0.00003501711,0.046963457,0.0022098708,0.9499493,0.0002667737,0.0001387769],"about_ca_topic_score_codex":8.3250325e-7,"about_ca_topic_score_gemma":5.7066256e-7,"teacher_disagreement_score":0.7208797,"about_ca_system_score_codex":0.000024694637,"about_ca_system_score_gemma":0.00002346065,"threshold_uncertainty_score":0.5214714},"labels":[],"label_agreement":null},{"id":"W2058470877","doi":"10.1016/s0012-365x(02)00346-1","title":"q-Enumeration of alternating sign matrices with exactly one −1","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Mathematics; Enumeration; Sign (mathematics); Generating function","score_opus":0.0564142510595318,"score_gpt":0.2915754565951829,"score_spread":0.23516120553565112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058470877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5123604,0.00029815373,0.4463678,0.00022405988,0.00026195956,0.0015180727,0.000035183366,0.0004992737,0.038435105],"genre_scores_gemma":[0.6421286,0.000036799698,0.35700426,0.00001402509,0.00010271303,0.000044533193,0.0000037722873,0.00009767401,0.00056765816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973678,0.000064395936,0.0009764397,0.00031032387,0.0008828536,0.00039820478],"domain_scores_gemma":[0.99672747,0.0010638456,0.0010376439,0.00080761453,0.00025107022,0.000112353584],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004056692,0.0003656804,0.000725493,0.00015835771,0.0001277933,0.000071856695,0.00044418065,0.00011490393,0.00030287457],"category_scores_gemma":[0.00081223156,0.00030012048,0.0001212682,0.00042977577,0.00011614551,0.0003610121,0.00010264962,0.00022864655,0.00005765181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025885225,0.0012425665,0.000115088675,0.0027902096,0.0002743149,0.000018477342,0.008993677,0.00014267272,0.0040187878,0.9801322,0.00047860507,0.0017674746],"study_design_scores_gemma":[0.0013243158,0.0004356833,0.000011624961,0.0010834362,0.00031304557,0.000044150154,0.0014356425,0.025592698,0.020904198,0.9480711,0.00011993853,0.0006641422],"about_ca_topic_score_codex":0.000004427923,"about_ca_topic_score_gemma":0.0000037347356,"teacher_disagreement_score":0.12976818,"about_ca_system_score_codex":0.000066718705,"about_ca_system_score_gemma":0.000017214072,"threshold_uncertainty_score":0.9999451},"labels":[],"label_agreement":null},{"id":"W2058537654","doi":"10.1016/j.disc.2004.06.019","title":"On minimal prime extensions of a four-vertex graph in a prime graph","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Circulant graph; Neighbourhood (mathematics); Vertex (graph theory); Discrete mathematics; Graph; Prime (order theory); Complement graph; Graph power; Line graph","score_opus":0.030063820658872933,"score_gpt":0.29746555709682104,"score_spread":0.2674017364379481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058537654","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.3693414,0.000083818064,0.62708056,0.00039154425,0.00008215778,0.0005889578,0.000011116861,0.00011564514,0.0023047961],"genre_scores_gemma":[0.8346898,0.00001603727,0.16509314,0.0000621726,0.0000065841127,0.0000329593,0.0000019559334,0.000024881427,0.00007244217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778295,0.00008257343,0.00053301686,0.00043782676,0.0006591193,0.0005045003],"domain_scores_gemma":[0.9979397,0.00043201452,0.00019947189,0.0011757175,0.000108771346,0.00014430023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005698149,0.00023990504,0.0004111148,0.000573223,0.000083260195,0.00004819173,0.0011251055,0.000087518354,0.000012118054],"category_scores_gemma":[0.00039934274,0.00020029116,0.00019173704,0.001329012,0.00022999411,0.00028410886,0.000340431,0.00028179673,0.00004707531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028638064,0.0004162805,0.000062450694,0.00007532902,0.000025932495,0.0000665812,0.0026218798,0.0004693887,0.0065912213,0.9885817,0.00002045124,0.0010401112],"study_design_scores_gemma":[0.0008918589,0.00031115394,0.00083439756,0.00034767675,0.000007602704,0.000030327967,0.00016315744,0.0047117863,0.0123168165,0.9801299,0.000008790925,0.00024653686],"about_ca_topic_score_codex":0.000011320637,"about_ca_topic_score_gemma":0.0000134443,"teacher_disagreement_score":0.4653484,"about_ca_system_score_codex":0.000051278035,"about_ca_system_score_gemma":0.00010247747,"threshold_uncertainty_score":0.81676364},"labels":[],"label_agreement":null},{"id":"W2058654435","doi":"10.1016/j.disc.2009.03.012","title":"The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Johnson and Johnson","keywords":"Digraph; Mathematics; Closure (psychology); Strongly connected component; Combinatorics; Plane (geometry); Arc (geometry); Reliability (semiconductor); Complex plane; Set (abstract data type); Discrete mathematics; Mathematical analysis; Geometry; Computer science","score_opus":0.03803243306271469,"score_gpt":0.3106649010428753,"score_spread":0.2726324679801606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058654435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99267757,0.00006449862,0.00044315978,0.0025731116,0.000041210056,0.0009965836,0.00057704863,0.000026755724,0.002600092],"genre_scores_gemma":[0.99764466,0.000011287653,0.002050145,0.00003595335,0.00002289754,0.00001755966,0.0000096720405,0.00001611487,0.00019172985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980602,0.00022196765,0.00095208373,0.00015884938,0.00039511904,0.00021175783],"domain_scores_gemma":[0.99498034,0.0022074685,0.000996162,0.0015897192,0.0001912189,0.000035077384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011474894,0.00019275678,0.00046498672,0.00002477401,0.00024993843,0.000017930892,0.0009127954,0.00008910984,0.00007383538],"category_scores_gemma":[0.0007507584,0.00009019473,0.00030928495,0.00026393696,0.00058508746,0.000034706427,0.00010207793,0.00017630008,0.000002587824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041569547,0.00024048152,0.0004856679,0.00036075272,0.000120884615,1.08615446e-7,0.005369403,0.000019028303,0.011261784,0.9776661,0.004302255,0.00013201495],"study_design_scores_gemma":[0.0004066304,0.00010536261,0.008773052,0.0001790211,0.00025418124,0.000004255879,0.003793133,0.0006625374,0.036281522,0.9486419,0.00074978254,0.00014861973],"about_ca_topic_score_codex":0.00000968322,"about_ca_topic_score_gemma":0.000014514211,"teacher_disagreement_score":0.029024148,"about_ca_system_score_codex":0.000011545102,"about_ca_system_score_gemma":0.000040844774,"threshold_uncertainty_score":0.36780342},"labels":[],"label_agreement":null},{"id":"W2059685480","doi":"10.1016/j.disc.2004.02.022","title":"A generalization of the theorem of Lekkerkerker and Boland","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Mathematics; Generalization; Discrete mathematics; Combinatorics; Algebra over a field; Pure mathematics; Mathematical analysis","score_opus":0.015036969796973682,"score_gpt":0.2766363574825042,"score_spread":0.26159938768553054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059685480","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.27629223,0.00021321351,0.71992403,0.00040232379,0.000027587446,0.00020899293,0.000005607292,0.000020208623,0.0029058077],"genre_scores_gemma":[0.91110134,0.000022239201,0.088616155,0.000027033124,0.000011487426,0.0000038663557,4.5061736e-7,0.000007000633,0.00021044085],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992633,0.00005550419,0.00021983215,0.00010858921,0.00024113001,0.000111681555],"domain_scores_gemma":[0.99916947,0.00010510825,0.00014185312,0.0004892706,0.00006720937,0.00002708112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033211982,0.00006944044,0.00012956245,0.000044325137,0.00004388061,0.000018902208,0.00045960612,0.000026058262,0.000008642614],"category_scores_gemma":[0.000093529176,0.000041765477,0.000043914857,0.000247988,0.00016294105,0.00015449924,0.00024752165,0.000051308292,0.0000012028938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027612116,0.000028588047,0.00068251963,0.00007242417,0.000011943034,1.422213e-7,0.0023169462,0.00021459996,0.004741538,0.9893907,0.00003384272,0.0025039972],"study_design_scores_gemma":[0.00044424584,0.000054027412,0.0019792223,0.00012739455,0.00001639125,0.000016831907,0.00023258688,0.2533781,0.06978598,0.6732418,0.00056155,0.00016188262],"about_ca_topic_score_codex":0.0000014157051,"about_ca_topic_score_gemma":0.000003294706,"teacher_disagreement_score":0.6348091,"about_ca_system_score_codex":0.000006235137,"about_ca_system_score_gemma":0.00001607503,"threshold_uncertainty_score":0.17031467},"labels":[],"label_agreement":null},{"id":"W2059892291","doi":"10.1016/s0012-365x(01)00102-9","title":"The level of nonmultiplicativity of graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Combinatorics; Multiplicative function; Discrete mathematics; Graph product; Cograph; Conjecture; Block graph; Graph; Split graph; 1-planar graph; Pathwidth; Indifference graph; Chordal graph; Line graph","score_opus":0.16044129254998377,"score_gpt":0.3319080170067017,"score_spread":0.17146672445671793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059892291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89860564,0.00032210615,0.05375855,0.0007863577,0.000078160934,0.0012843204,0.0003696247,0.0001190059,0.044676214],"genre_scores_gemma":[0.9712452,0.00005627889,0.027699627,0.0000067439723,0.000008335295,0.000054438926,0.0000016779068,0.000021380443,0.0009062611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988649,0.00005013277,0.000546026,0.0001254805,0.00024052762,0.00017294579],"domain_scores_gemma":[0.9969622,0.0015603218,0.0004624152,0.00086578773,0.00010635737,0.000042921758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005139584,0.00013482715,0.00028715713,0.000045158406,0.000149834,0.000010648323,0.00042468612,0.00005629532,0.00007022577],"category_scores_gemma":[0.000459374,0.000087052744,0.00018689207,0.0002902405,0.00035801544,0.000044594588,0.00007060687,0.00010079044,0.000017032538],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026618654,0.00024237228,0.000081982806,0.00018465679,0.00004690183,1.1449913e-7,0.0015256082,9.694977e-7,0.002830525,0.9933573,0.0008470528,0.0008798792],"study_design_scores_gemma":[0.000169837,0.000025375,0.00015747292,0.000054956163,0.0000560817,0.0000031493214,0.0006078429,0.0016670626,0.017328909,0.97940797,0.0004185807,0.00010279447],"about_ca_topic_score_codex":0.0000028771517,"about_ca_topic_score_gemma":0.000007678808,"teacher_disagreement_score":0.07263959,"about_ca_system_score_codex":0.0000056084987,"about_ca_system_score_gemma":0.0000051837305,"threshold_uncertainty_score":0.35499078},"labels":[],"label_agreement":null},{"id":"W2060176530","doi":"10.1016/j.disc.2007.12.053","title":"Claw-free graphs are not universal fixers","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.035678591440143834,"score_gpt":0.27477813120168937,"score_spread":0.23909953976154552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060176530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10326828,0.000091574904,0.8776703,0.0014011043,0.00021991422,0.00041210814,0.000034066787,0.00054550415,0.016357131],"genre_scores_gemma":[0.7082906,0.00009247921,0.2886162,0.00028694465,0.000042510594,0.00002099587,0.000005128979,0.000047384325,0.0025977588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820215,0.00006798358,0.00026098668,0.000367873,0.00062826043,0.00047273055],"domain_scores_gemma":[0.99767876,0.0002620489,0.00015080422,0.0016194102,0.00010818733,0.00018081184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002710452,0.00020441435,0.00026482015,0.00020151529,0.0002980723,0.000067273744,0.0022260088,0.000073433395,0.000031588217],"category_scores_gemma":[0.00023280554,0.00017978656,0.00015152765,0.0006836847,0.00032300333,0.0005151166,0.00071580656,0.00024883583,0.00013425693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010015977,0.000086660904,0.00028919123,0.00005850334,0.00003193065,0.0001880963,0.0026414995,0.000080023594,0.0003449871,0.99377006,0.0021427278,0.00035631968],"study_design_scores_gemma":[0.0012804614,0.00014861878,0.0010573096,0.00010802504,0.000015414395,0.00020662181,0.0012672235,0.0372933,0.0045733307,0.9510714,0.0022802728,0.00069805165],"about_ca_topic_score_codex":0.000003620273,"about_ca_topic_score_gemma":0.0000043144964,"teacher_disagreement_score":0.6050223,"about_ca_system_score_codex":0.00004520861,"about_ca_system_score_gemma":0.00005275013,"threshold_uncertainty_score":0.7331483},"labels":[],"label_agreement":null},{"id":"W2060988680","doi":"10.1016/j.disc.2008.01.029","title":"Multiple partitions, lattice paths and a Burge–Bressoud-type correspondence","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Bijection; Mathematics; Combinatorics; Partition (number theory); Constructive; Lattice (music); Type (biology); Discrete mathematics; Physics","score_opus":0.07364891201867933,"score_gpt":0.32467019932149493,"score_spread":0.2510212873028156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060988680","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9344919,0.000567771,0.05447797,0.0002725928,0.00030226627,0.00093028264,0.000071830866,0.0006212994,0.008264113],"genre_scores_gemma":[0.74531394,0.00036386022,0.24072655,0.00012058435,0.00013260143,0.00011944098,0.000018624234,0.00014510978,0.013059301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976307,0.000082554514,0.0007538693,0.00040626508,0.00059956237,0.0005270408],"domain_scores_gemma":[0.99588853,0.0025678694,0.00031480897,0.00077875867,0.00021216366,0.00023786075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041080077,0.00038440267,0.000630079,0.00012792963,0.00041510523,0.00007965037,0.00031813272,0.00014569504,0.00027710624],"category_scores_gemma":[0.0050983694,0.0003355881,0.00012370033,0.0003272619,0.00048342656,0.0004140048,0.00025751156,0.00028351226,0.0002529794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012353272,0.0012003847,0.0026408723,0.0032950065,0.00026268672,0.00044773959,0.02445977,0.00003543931,0.003700152,0.94569904,0.017903019,0.00023238016],"study_design_scores_gemma":[0.00060369645,0.00009392246,0.000202532,0.0003638249,0.00013967145,0.00039569943,0.0020097832,0.0060473396,0.001897311,0.9863146,0.0013722905,0.0005593591],"about_ca_topic_score_codex":0.0000069994876,"about_ca_topic_score_gemma":0.000009979717,"teacher_disagreement_score":0.18917795,"about_ca_system_score_codex":0.000049787173,"about_ca_system_score_gemma":0.000052219457,"threshold_uncertainty_score":0.99990964},"labels":[],"label_agreement":null},{"id":"W2062166560","doi":"10.1016/j.disc.2012.08.013","title":"Quasigroups satisfying Stein’s third law with a specified number of idempotents","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Mathematics; Idempotence; Combinatorics; Order (exchange); Block (permutation group theory); Type (biology); Discrete mathematics; Block size; Arithmetic","score_opus":0.014594174514120125,"score_gpt":0.22851908390816383,"score_spread":0.2139249093940437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062166560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8817895,0.0001628626,0.014829289,0.0000048555557,0.00019565997,0.00022732334,0.000015469963,0.00017678042,0.10259825],"genre_scores_gemma":[0.99201614,0.000006510208,0.0077245664,0.0000099553645,0.000070999544,0.0000203072,0.000005243668,0.000052959676,0.00009334044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989532,0.000040395673,0.0003618561,0.00008857672,0.00024651623,0.0003094413],"domain_scores_gemma":[0.999355,0.00010375135,0.00006829671,0.00035008945,0.000024561814,0.000098305325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038478905,0.00019217636,0.00032735677,0.000032379823,0.000046849487,0.000022364698,0.00014663915,0.000073639145,0.00006202612],"category_scores_gemma":[0.000011788339,0.00014707638,0.00007860961,0.00013241745,0.00006489553,0.00020637503,0.000023647008,0.00011640588,0.000092523966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030262863,0.000100601,0.010081995,0.0016709806,0.00027024993,0.0000050849762,0.011869191,0.00029400777,0.004699763,0.9706327,0.00016437608,0.00018082099],"study_design_scores_gemma":[0.012341647,0.0010000027,0.051914692,0.015888924,0.0028375688,0.0028752265,0.121153,0.064877905,0.28524497,0.40879813,0.019809917,0.013258027],"about_ca_topic_score_codex":0.0000126454115,"about_ca_topic_score_gemma":0.000008197323,"teacher_disagreement_score":0.5618345,"about_ca_system_score_codex":0.000019453277,"about_ca_system_score_gemma":0.000002823415,"threshold_uncertainty_score":0.59976006},"labels":[],"label_agreement":null},{"id":"W2062277114","doi":"10.1016/s0012-365x(02)00806-3","title":"Changing upper irredundance by edge addition","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of South Africa; National Research Foundation","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Vertex (graph theory); Graph; Discrete mathematics; Computer science","score_opus":0.01799772471379416,"score_gpt":0.2838632688220105,"score_spread":0.26586554410821633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062277114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043563466,0.00019194656,0.9762372,0.00015718932,0.00013476578,0.00020174113,0.000018518209,0.0001639047,0.018538397],"genre_scores_gemma":[0.49665233,0.000051124425,0.4945405,0.00034763722,0.00006859209,0.00014449305,0.000032832995,0.000071534814,0.008090952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857104,0.000075261894,0.00021449251,0.00029678506,0.00035785587,0.00048457316],"domain_scores_gemma":[0.99890655,0.00016417146,0.00009048702,0.0006702656,0.000060600334,0.000107893015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049095927,0.00015501524,0.00016380429,0.00013806937,0.00019741448,0.00014671337,0.0006173721,0.000047736223,0.00010494745],"category_scores_gemma":[0.00021121361,0.00013807905,0.00007344657,0.0006073712,0.00008165657,0.000497328,0.00013416793,0.00014813466,0.00021553437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.912711e-7,0.000052220257,0.000012794396,0.000051214545,0.000010902613,0.000004447377,0.0015653671,0.00001267676,0.0014185472,0.99259156,0.00190451,0.0023747936],"study_design_scores_gemma":[0.0004298627,0.000078995305,0.000012489929,0.00014715095,0.000008566724,0.000056503257,0.0010342594,0.029327033,0.043123994,0.89453834,0.030673556,0.0005692776],"about_ca_topic_score_codex":2.1883767e-7,"about_ca_topic_score_gemma":2.0019453e-7,"teacher_disagreement_score":0.49229598,"about_ca_system_score_codex":0.00003899723,"about_ca_system_score_gemma":0.000025504673,"threshold_uncertainty_score":0.56307006},"labels":[],"label_agreement":null},{"id":"W2062741368","doi":"10.1016/j.disc.2004.04.036","title":"Ovals and hyperovals in nets","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Corollary; Combinatorics; Order (exchange); Integer (computer science); Net (polyhedron); Latin square; Set (abstract data type); Discrete mathematics; Finite set; Geometry; Computer science","score_opus":0.007665902235596891,"score_gpt":0.2060537377521739,"score_spread":0.19838783551657702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062741368","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97725385,0.0006612097,0.0011582524,0.00005613337,0.00006173159,0.00012853721,0.0000042500274,0.000119942124,0.020556081],"genre_scores_gemma":[0.9970333,0.00004017186,0.0026660815,0.000025118872,0.00003565201,0.000012785835,0.0000014911118,0.00002158,0.00016382211],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947333,0.000013089643,0.0002116123,0.00007519792,0.00007306201,0.00015368921],"domain_scores_gemma":[0.999736,0.000047576497,0.00001760235,0.00015257196,0.0000052541122,0.000040985196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019925662,0.00010125405,0.00016766315,0.00005728943,0.000017326844,0.000025338908,0.000069191134,0.000046965368,0.000034815013],"category_scores_gemma":[0.000015155131,0.00008929425,0.000026399957,0.000083920844,0.000020922456,0.00008268865,0.00001432933,0.00006774306,0.000056227604],"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.00002007726,0.0002662802,0.004446475,0.0036258753,0.0002764773,0.00006367945,0.046774413,0.029626302,0.043188248,0.8239582,0.004864867,0.04288909],"study_design_scores_gemma":[0.0026490313,0.00010467945,0.0050502084,0.0012897312,0.00009542275,0.00027457505,0.0064693824,0.75281745,0.02533427,0.1557233,0.048148915,0.002043051],"about_ca_topic_score_codex":0.0000011500456,"about_ca_topic_score_gemma":0.000008743721,"teacher_disagreement_score":0.72319114,"about_ca_system_score_codex":0.000011170693,"about_ca_system_score_gemma":0.0000017126679,"threshold_uncertainty_score":0.3641314},"labels":[],"label_agreement":null},{"id":"W2062888049","doi":"10.1016/s0012-365x(02)00609-x","title":"Maximal arcs in Steiner systems S(2,4,v)","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Arc (geometry); Steiner system; Block (permutation group theory); Discrete mathematics; Point (geometry); Set (abstract data type); Zero (linguistics); Construct (python library); Geometry; Computer science","score_opus":0.009829290237370867,"score_gpt":0.19804312760531687,"score_spread":0.188213837367946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062888049","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79019,0.0012898879,0.018340856,0.000008462981,0.00091834663,0.00050629047,0.000016930378,0.0003766148,0.18835261],"genre_scores_gemma":[0.998504,0.0000122607635,0.0007951381,0.000004928332,0.000028198996,0.000046971087,0.0000034815002,0.000044957138,0.0005601028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990421,0.00005045477,0.00035905506,0.00011470851,0.00015340903,0.00028028587],"domain_scores_gemma":[0.9995297,0.00005621962,0.000033447635,0.0003054201,0.000013865482,0.00006133635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036459885,0.00017195595,0.0002628998,0.00010101642,0.000025832493,0.000049503993,0.00012855398,0.000079662466,0.000043293556],"category_scores_gemma":[0.000035591343,0.00015008371,0.00005952467,0.00021201897,0.000024657718,0.0000817443,0.00000944189,0.00012964547,0.00012906056],"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.0000033348651,0.00006279324,0.0008514794,0.0015084613,0.00006260529,0.000043625525,0.0028529041,0.018295823,0.002367493,0.97328866,0.0005631506,0.00009968361],"study_design_scores_gemma":[0.0048117354,0.00025262617,0.001130674,0.003307953,0.00020665803,0.0007799454,0.035360698,0.65291625,0.015798967,0.2062512,0.074558675,0.0046246042],"about_ca_topic_score_codex":0.0000035356682,"about_ca_topic_score_gemma":0.000004292154,"teacher_disagreement_score":0.76703745,"about_ca_system_score_codex":0.000031623185,"about_ca_system_score_gemma":0.0000061730316,"threshold_uncertainty_score":0.6120236},"labels":[],"label_agreement":null},{"id":"W2063519616","doi":"10.1016/j.disc.2011.06.033","title":"How to play Reverse Hex","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Educational Games and Gamification","field":"Psychology","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Mathematics; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.06746740577934818,"score_gpt":0.3244433510782647,"score_spread":0.25697594529891654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063519616","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36728904,0.00014926484,0.079783805,0.009076751,0.0016637855,0.001002415,0.00006596229,0.00021126911,0.5407577],"genre_scores_gemma":[0.8681134,0.0000039262154,0.06191371,0.00079984264,0.00018621483,0.00012521794,0.00002570836,0.00003753453,0.068794444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993686,0.000021001832,0.00015277763,0.00017348825,0.00011553435,0.0001686018],"domain_scores_gemma":[0.99929583,0.000044550583,0.00007879055,0.00043902633,0.000047234673,0.00009455389],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00013753239,0.00009721077,0.00011171799,0.000053419564,0.00003601484,0.000028134846,0.00017812621,0.00005495926,0.0013987217],"category_scores_gemma":[0.00007106228,0.00008276856,0.00004983128,0.000118528216,0.0000273004,0.000052434454,0.000024516949,0.00006354046,0.0013825374],"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.00001806145,0.00035188172,0.00092053064,0.00005262233,0.0000706567,0.000005363229,0.13194908,5.0381857e-7,0.0004868849,0.7980428,0.06522852,0.0028731432],"study_design_scores_gemma":[0.0011213066,0.0005362581,0.12543723,0.00023269252,0.00023303863,0.000102473074,0.14739278,0.00014382257,0.003396855,0.14624201,0.57365775,0.0015037704],"about_ca_topic_score_codex":0.000019338895,"about_ca_topic_score_gemma":0.000004975979,"teacher_disagreement_score":0.65180075,"about_ca_system_score_codex":0.000016725086,"about_ca_system_score_gemma":0.000010745692,"threshold_uncertainty_score":0.99951416},"labels":[],"label_agreement":null},{"id":"W2063549704","doi":"10.1016/s0012-365x(99)00144-2","title":"Exponents of 2-regular digraphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Digraph; Combinatorics; Mathematics; Vertex (graph theory); Conjecture; Exponent; Integer (computer science); Discrete mathematics; Graph","score_opus":0.05237147473006117,"score_gpt":0.33351579602623466,"score_spread":0.2811443212961735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063549704","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9306481,0.000075994336,0.0025192914,0.0000726933,0.000038883154,0.00046501888,0.000050654966,0.00013166871,0.06599773],"genre_scores_gemma":[0.931782,0.000052997777,0.059010815,0.00002647832,0.00005759935,0.000049119197,0.000019118146,0.00011172306,0.008890165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978318,0.00010644666,0.00066413585,0.00024958866,0.000717457,0.00043054883],"domain_scores_gemma":[0.9979611,0.0006352028,0.0001683672,0.0010190442,0.00008786224,0.0001284347],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00078217237,0.00024332512,0.00049639377,0.00015131707,0.00007925625,0.000034105975,0.0005751036,0.00011415901,0.0036981015],"category_scores_gemma":[0.00038042734,0.00020224415,0.00022112364,0.00038004312,0.0002387245,0.00013484787,0.0000912438,0.00018566154,0.00030134548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011232879,0.001057684,0.0003936556,0.0018919095,0.00027856344,0.000031810123,0.008213511,0.000011130695,0.0058997525,0.96950555,0.0035426994,0.009061388],"study_design_scores_gemma":[0.0006446648,0.000120918,0.0001455278,0.0002575463,0.000072507944,0.000021954667,0.0008072409,0.0014129058,0.009022121,0.98582363,0.0013507038,0.0003202685],"about_ca_topic_score_codex":0.0000053672516,"about_ca_topic_score_gemma":0.000002279172,"teacher_disagreement_score":0.05710756,"about_ca_system_score_codex":0.000023456427,"about_ca_system_score_gemma":0.000020951558,"threshold_uncertainty_score":0.99721265},"labels":[],"label_agreement":null},{"id":"W2064592298","doi":"10.1016/s0012-365x(02)00319-9","title":"Enumeration of Cayley graphs and digraphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Université du Québec à Montréal; University of Regina","funders":"","keywords":"Cayley graph; Combinatorics; Mathematics; Enumeration; Circulant matrix; Symmetric group; Abelian group; Cayley transform; Cayley's theorem; Graph; Voltage graph; Line graph","score_opus":0.0738408948285501,"score_gpt":0.31466088664430447,"score_spread":0.24081999181575436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064592298","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9642148,0.0003595536,0.004971372,0.00017438475,0.000054678032,0.0005551589,0.000042273216,0.00013359722,0.029494196],"genre_scores_gemma":[0.9701808,0.00011067794,0.028479185,0.000017344468,0.000015734286,0.000026480742,0.0000052446453,0.00004649006,0.0011180083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998562,0.00007880917,0.00047370917,0.00020302738,0.00041549795,0.00026696254],"domain_scores_gemma":[0.9983674,0.00074149977,0.0001901842,0.0005100154,0.00009610817,0.000094753996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005443179,0.00018346138,0.00035306235,0.00019040974,0.000088223984,0.00004446568,0.00020288429,0.00009282759,0.000389169],"category_scores_gemma":[0.00067059585,0.00015423236,0.000100761834,0.00030580902,0.00021451974,0.00013861487,0.00009191038,0.0001575376,0.000033169516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074764343,0.00019271286,0.0004794501,0.000750969,0.00006433003,0.00000475524,0.0066806385,7.616868e-7,0.0024003265,0.987211,0.0010674446,0.0011401755],"study_design_scores_gemma":[0.00041099815,0.00011293338,0.00010451049,0.00012301106,0.0000580981,0.000023020855,0.00091223366,0.00733506,0.0034629924,0.9871034,0.00013707437,0.00021664762],"about_ca_topic_score_codex":0.0000048913535,"about_ca_topic_score_gemma":0.000007001412,"teacher_disagreement_score":0.028376188,"about_ca_system_score_codex":0.000011912203,"about_ca_system_score_gemma":0.0000057608418,"threshold_uncertainty_score":0.6289413},"labels":[],"label_agreement":null},{"id":"W2064645351","doi":"10.1016/j.disc.2010.10.005","title":"Strongly regular graphs with non-trivial automorphisms","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Automorphism; Combinatorics; Prime (order theory); Automorphism group; Strongly regular graph; Discrete mathematics; Two-graph; Order (exchange); Pathwidth; Graph; Line graph","score_opus":0.026020517956813226,"score_gpt":0.3024070351341039,"score_spread":0.2763865171772907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064645351","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95003057,0.000008314952,0.022698082,0.00024495806,0.00022340492,0.0009887528,0.00005631766,0.00037319676,0.02537639],"genre_scores_gemma":[0.80486596,0.0000026061916,0.19187012,0.000025710802,0.00016599416,0.00010649772,0.00002577431,0.00018465891,0.0027526896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703413,0.0000768901,0.00058399054,0.00046313464,0.0010551407,0.0007866987],"domain_scores_gemma":[0.9967977,0.00081568176,0.0002846394,0.0015897072,0.00022076748,0.00029153787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001280981,0.00044662235,0.000612033,0.00025668013,0.00024084856,0.00017872515,0.0008471371,0.0002437794,0.0006796169],"category_scores_gemma":[0.00063258054,0.0003291124,0.00019243547,0.00052246405,0.000531573,0.00022973695,0.00021827003,0.00092673226,0.00025842254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008247113,0.00038870407,0.00036878858,0.00049680367,0.00016338321,0.000086938075,0.0024117336,0.0000048727193,0.014031449,0.97937447,0.0022555178,0.00033486803],"study_design_scores_gemma":[0.00189069,0.0004657338,0.00024017005,0.00021114272,0.0001902635,0.00018836308,0.0011793872,0.0074390005,0.01028413,0.9759403,0.0011213769,0.0008494439],"about_ca_topic_score_codex":0.0000076245515,"about_ca_topic_score_gemma":0.00006359043,"teacher_disagreement_score":0.16917203,"about_ca_system_score_codex":0.00003506348,"about_ca_system_score_gemma":0.000114869545,"threshold_uncertainty_score":0.9999161},"labels":[],"label_agreement":null},{"id":"W2064696340","doi":"10.1016/j.disc.2011.08.022","title":"List monopolar partitions of claw-free graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Partition (number theory); Disjoint sets; Graph; Discrete mathematics; Claw","score_opus":0.05239536688332093,"score_gpt":0.29177298737165336,"score_spread":0.23937762048833244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064696340","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037216812,0.00013146036,0.9148537,0.00015132152,0.000107933934,0.00031009072,0.000039362745,0.00019361732,0.046995725],"genre_scores_gemma":[0.60795766,0.000023243587,0.39166373,0.00003178718,0.000009754077,0.000030519048,0.0000026614114,0.000018404136,0.00026225168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987442,0.000057016598,0.00034285846,0.00022138623,0.00033429253,0.00030024003],"domain_scores_gemma":[0.997931,0.00013247048,0.00014754233,0.0015601586,0.000114587056,0.0001142388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036754843,0.00013216103,0.0002133868,0.00015093536,0.00010287362,0.00003599664,0.0016533309,0.000049192196,0.000091582566],"category_scores_gemma":[0.00019796463,0.00011269102,0.00012491802,0.0005283543,0.0002530439,0.00037452753,0.00049216294,0.0001374778,0.00004375128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028563952,0.00011171205,0.00020413949,0.00006098967,0.000020833566,0.0000053912177,0.0027545097,0.0000025005988,0.0006821697,0.9956459,0.00022860254,0.0002803984],"study_design_scores_gemma":[0.00016370184,0.00007728305,0.00021644136,0.000038569644,0.000008816908,0.0000071804575,0.00024259437,0.0029777952,0.010369132,0.985611,0.00015494614,0.00013250877],"about_ca_topic_score_codex":0.000011855228,"about_ca_topic_score_gemma":0.000009166316,"teacher_disagreement_score":0.5707408,"about_ca_system_score_codex":0.000011124958,"about_ca_system_score_gemma":0.00002652288,"threshold_uncertainty_score":0.45954064},"labels":[],"label_agreement":null},{"id":"W2064783977","doi":"10.1016/j.disc.2008.05.040","title":"Maximum uniformly resolvable designs with block sizes 2 and 4","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Block (permutation group theory); Combinatorics; Block size; Pairwise comparison; Class (philosophy); Discrete mathematics; Resolution (logic); Block design; Combinatorial design; Statistics; Computer science","score_opus":0.01656889570623384,"score_gpt":0.1919247001294121,"score_spread":0.17535580442317825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064783977","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9440436,0.00039462314,0.012739233,0.000016405358,0.00006770903,0.00024630365,0.000011348191,0.00034201736,0.042138763],"genre_scores_gemma":[0.9917814,0.000055845063,0.0074777217,0.000009181287,0.000023966542,0.00001747935,0.0000028145148,0.000041059462,0.0005905126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936527,0.000012804088,0.00017661824,0.00010237721,0.0001298111,0.000213109],"domain_scores_gemma":[0.999577,0.000060820974,0.000029900326,0.00023877525,0.000017979897,0.00007554606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010858415,0.00015846352,0.00020464922,0.000046892572,0.00011070136,0.00002669063,0.00009565768,0.000053425887,0.000018179728],"category_scores_gemma":[0.000009633767,0.00011760032,0.000029512037,0.00012395233,0.00008411531,0.00009397676,0.000016348995,0.00008656083,0.000029363866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042201075,0.0008009724,0.014919518,0.01749493,0.0030095757,0.0025481926,0.14460295,0.0561149,0.052912507,0.68424195,0.020505393,0.0024270685],"study_design_scores_gemma":[0.010320195,0.0024940795,0.004197537,0.004121703,0.0009703242,0.019420829,0.033668123,0.37701148,0.09980651,0.4031141,0.03633385,0.008541268],"about_ca_topic_score_codex":0.0000024781614,"about_ca_topic_score_gemma":0.0000032299574,"teacher_disagreement_score":0.32089657,"about_ca_system_score_codex":0.000009793726,"about_ca_system_score_gemma":0.000007124943,"threshold_uncertainty_score":0.4795602},"labels":[],"label_agreement":null},{"id":"W2065396130","doi":"10.1016/j.disc.2012.05.023","title":"Obstructions to partitions of chordal graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Chordal graph; Combinatorics; Discrete mathematics; Treewidth; Outerplanar graph; Indifference graph; Pathwidth; Graph; Line graph","score_opus":0.03427589843562042,"score_gpt":0.3221639786332235,"score_spread":0.2878880801976031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065396130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08533389,0.000048859874,0.9077877,0.00027280577,0.00017125277,0.00021684502,0.000016443611,0.000091125265,0.006061066],"genre_scores_gemma":[0.6623137,0.0000035795067,0.33745468,0.000026940783,0.000021790845,0.000035975612,0.0000015685301,0.000008810011,0.00013294331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989716,0.000036172343,0.00024102787,0.00012843331,0.00028032518,0.00034248535],"domain_scores_gemma":[0.9988557,0.00014198844,0.00006897324,0.000656509,0.00007821317,0.00019858849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029325855,0.00009354294,0.00015106553,0.0001633579,0.0001023475,0.000030628547,0.0005468573,0.000028186236,0.000039756243],"category_scores_gemma":[0.00015727188,0.000081107304,0.00008148003,0.0007232231,0.00008323359,0.0004085168,0.00022466514,0.00008829215,0.00010258904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.190442e-7,0.00007158771,0.0003895113,0.000027520251,0.000012059693,3.180168e-7,0.002200443,0.00005490593,0.0015552273,0.9947258,0.00017435981,0.000787352],"study_design_scores_gemma":[0.00014272187,0.00006924172,0.0018250005,0.000045375975,0.000012776685,0.000023207338,0.0006292484,0.0019914755,0.014064338,0.9794338,0.0015337786,0.00022907775],"about_ca_topic_score_codex":0.0000015647615,"about_ca_topic_score_gemma":0.0000013852937,"teacher_disagreement_score":0.5769798,"about_ca_system_score_codex":0.00001462572,"about_ca_system_score_gemma":0.000014788083,"threshold_uncertainty_score":0.330746},"labels":[],"label_agreement":null},{"id":"W2065404513","doi":"10.1016/j.disc.2014.05.002","title":"A winning strategy for<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mn>3</mml:mn><mml:mo>×</mml:mo><mml:mi>n</mml:mi></mml:math>Cylindrical Hex","year":2014,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"London School of Economics and Political Science","keywords":"Mathematics; Scroll; Circumference; Combinatorics; Algorithm; Discrete mathematics; Geometry; Theology; Philosophy","score_opus":0.03323576613227676,"score_gpt":0.27800724431614376,"score_spread":0.24477147818386702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065404513","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.781993,0.0005004932,0.20513645,0.0007526342,0.0019229245,0.0002149126,0.00025129388,0.00040564995,0.008822693],"genre_scores_gemma":[0.9554744,0.00021626435,0.04015322,0.000898312,0.0017441813,0.0004969826,0.00022846431,0.0004542488,0.0003339552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909024,0.00028989962,0.0024146857,0.0018505239,0.0022573352,0.0022851508],"domain_scores_gemma":[0.9919702,0.0023932655,0.0019394587,0.0025291352,0.00030620166,0.00086177065],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002441145,0.001100433,0.00074721593,0.0003079261,0.0015086804,0.0022630591,0.0031147846,0.0014645447,0.00045362502],"category_scores_gemma":[0.0021579587,0.0014211582,0.0014575508,0.0009332882,0.0012707245,0.0014243794,0.002047961,0.001441963,0.0026441938],"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.0002217232,0.00041656414,0.000008824547,0.0012521547,0.00051616976,0.00022762896,0.0064457417,0.0043544313,0.00095611776,0.97548455,0.0034371926,0.006678901],"study_design_scores_gemma":[0.0005642196,0.0012721879,0.00001422222,0.0013104577,0.0005782917,0.00039689217,0.0025148292,0.90470463,0.063558005,0.021113167,0.0027102416,0.0012628816],"about_ca_topic_score_codex":0.00031483077,"about_ca_topic_score_gemma":0.00019085009,"teacher_disagreement_score":0.9543714,"about_ca_system_score_codex":0.00004862386,"about_ca_system_score_gemma":0.0008003019,"threshold_uncertainty_score":0.99983174},"labels":[],"label_agreement":null},{"id":"W2066380283","doi":"10.1016/s0012-365x(99)00354-4","title":"Embedding trees into graphs of large girth","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Girth (graph theory); Conjecture; Embedding; Discrete mathematics; Graph; Tree (set theory); Degree (music); Computer science","score_opus":0.015694521293340452,"score_gpt":0.3198006587394579,"score_spread":0.3041061374461175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066380283","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.2993545,0.00019506269,0.6864766,0.00016591245,0.000052311767,0.0002587631,0.000011802383,0.00018397455,0.013301106],"genre_scores_gemma":[0.77517974,0.000043011947,0.22384605,0.000036070716,0.000011638594,0.000013337279,0.0000026051032,0.000017882956,0.0008496768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855703,0.000060089085,0.00034081616,0.00025369728,0.00042853033,0.00035985734],"domain_scores_gemma":[0.9987171,0.00019018604,0.00009826664,0.00083812594,0.000060232178,0.00009604653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047947725,0.00014917602,0.0002560834,0.00015138996,0.00011643599,0.00006010272,0.0010567056,0.000047030786,0.00022908175],"category_scores_gemma":[0.00007423017,0.00012274297,0.00012512156,0.000592821,0.000111738336,0.00037281454,0.00019506263,0.00013015822,0.0000831817],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071846207,0.00012847946,0.00012503234,0.00013323878,0.000031152198,0.000009533025,0.0067382175,0.0003036371,0.0011898209,0.9776906,0.000102822145,0.013540287],"study_design_scores_gemma":[0.00032986558,0.00008930512,0.00009882242,0.00009637134,0.0000073076603,0.000009538639,0.00040751093,0.13629283,0.005136728,0.85635376,0.00096024043,0.00021773278],"about_ca_topic_score_codex":0.0000031646125,"about_ca_topic_score_gemma":0.0000061499363,"teacher_disagreement_score":0.47582522,"about_ca_system_score_codex":0.00001424268,"about_ca_system_score_gemma":0.00002201865,"threshold_uncertainty_score":0.5005313},"labels":[],"label_agreement":null},{"id":"W2066393114","doi":"10.1016/j.disc.2011.02.022","title":"Structure of 4-connected claw-free graphs not containing a subdivision of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>","year":2011,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Subdivision; Mathematics; Scroll; Combinatorics; Discrete mathematics","score_opus":0.025372589599595936,"score_gpt":0.25995595225731705,"score_spread":0.23458336265772112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066393114","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7761726,0.0007783191,0.011923213,0.00025981743,0.0015548853,0.000094114526,0.00073890167,0.00022634442,0.20825185],"genre_scores_gemma":[0.9754569,0.0005094267,0.021277111,0.00049782475,0.0005544297,0.00035804205,0.0005738776,0.0006177273,0.00015466502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9892371,0.0005812833,0.0025157803,0.0018346874,0.0033481028,0.0024829938],"domain_scores_gemma":[0.98871547,0.0025756408,0.0030757512,0.0042094304,0.00039160112,0.0010321176],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0024471795,0.0009993374,0.0005988977,0.0007805506,0.001158982,0.0009035817,0.0044774483,0.001879032,0.16184407],"category_scores_gemma":[0.0032978274,0.0016654956,0.0018533717,0.0019223947,0.0024373927,0.001763637,0.0038500885,0.0018462318,0.0004817525],"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.0016317539,0.00037911342,0.000029706951,0.0025210152,0.0014132565,0.0007524937,0.009028482,0.0006208502,0.008841773,0.9451092,0.028326083,0.0013462651],"study_design_scores_gemma":[0.0020429362,0.0020815746,0.0001263512,0.001962907,0.00082004117,0.0006194733,0.0029711588,0.18148547,0.80215245,0.0042228736,0.00020427257,0.001310474],"about_ca_topic_score_codex":0.00064725766,"about_ca_topic_score_gemma":0.0008273,"teacher_disagreement_score":0.9408863,"about_ca_system_score_codex":0.000016001999,"about_ca_system_score_gemma":0.0011894256,"threshold_uncertainty_score":0.9994167},"labels":[],"label_agreement":null},{"id":"W2066586325","doi":"10.1016/j.disc.2007.03.083","title":"The structure of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si23.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>-subdivision-free toroidal graphs","year":2007,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Vertex (graph theory); Toroid; Torus; Discrete mathematics; Graph; Geometry; Physics","score_opus":0.016993430092239498,"score_gpt":0.25766892586190454,"score_spread":0.24067549576966504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066586325","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54777867,0.0034507404,0.01581845,0.0010656447,0.0046784794,0.0001866314,0.0014062513,0.0005789352,0.42503616],"genre_scores_gemma":[0.9753569,0.0016970068,0.016309239,0.0012257205,0.0019207897,0.0007099308,0.0009360328,0.0012533343,0.0005910837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98131925,0.0009428179,0.0037022752,0.0030309595,0.006207505,0.004797176],"domain_scores_gemma":[0.9821678,0.0050846315,0.003954944,0.0062005688,0.0005526056,0.0020394577],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005475126,0.0016832211,0.0007582432,0.0010943281,0.0033809014,0.0029563033,0.007854158,0.0032357713,0.2152026],"category_scores_gemma":[0.004637209,0.0027731142,0.0032603974,0.0031487648,0.0043803863,0.0027291607,0.005823624,0.003383474,0.0018017],"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.0014674594,0.00043015167,0.000016540725,0.0020642618,0.0019553679,0.0013029893,0.0053096167,0.0012013833,0.005019718,0.76848906,0.20897852,0.0037649388],"study_design_scores_gemma":[0.00265965,0.0023607912,0.00009481453,0.001998649,0.0013982104,0.0017923616,0.0044615185,0.06786167,0.90240747,0.008717174,0.0036170627,0.0026306103],"about_ca_topic_score_codex":0.00089387177,"about_ca_topic_score_gemma":0.0018813817,"teacher_disagreement_score":0.8973878,"about_ca_system_score_codex":0.00004269033,"about_ca_system_score_gemma":0.0021322374,"threshold_uncertainty_score":0.99959147},"labels":[],"label_agreement":null},{"id":"W2066705994","doi":"10.1016/j.disc.2014.06.023","title":"On the strong metric dimension of Cartesian and direct products of graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metric dimension; Mathematics; Combinatorics; Vertex (graph theory); Cartesian product; Discrete mathematics; Packing dimension; Dimension (graph theory); Graph; Chordal graph; Minkowski–Bouligand dimension; 1-planar graph","score_opus":0.01435913185574652,"score_gpt":0.22230911527552924,"score_spread":0.2079499834197827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066705994","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96917975,0.00032467424,0.023584532,0.0008269878,0.00013743516,0.00034119983,0.000003869367,0.00006965694,0.005531922],"genre_scores_gemma":[0.9787663,0.000008854081,0.021151265,0.000030770363,0.0000017824409,0.0000035914172,6.135345e-7,0.000006971027,0.000029808794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990462,0.00007226156,0.000269289,0.00019211379,0.00029009656,0.00013001925],"domain_scores_gemma":[0.99856293,0.00045019106,0.00020681591,0.00064404926,0.00009879704,0.00003722326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007195244,0.00010610041,0.00022345388,0.00014317426,0.00006321397,0.00002311946,0.0002848053,0.000028352037,0.000001327001],"category_scores_gemma":[0.0004036028,0.00006097199,0.0000462768,0.0005654968,0.00009857264,0.000058469286,0.00011077488,0.00006149409,0.0000020600755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013175412,0.00004920949,0.00009060211,0.00011497267,0.000015450356,1.7986109e-7,0.000809813,0.000075523996,0.003577427,0.99438983,0.00012596312,0.0007497282],"study_design_scores_gemma":[0.0004067923,0.00052654813,0.0005156219,0.000407637,0.00006111252,0.0000060566804,0.00024912303,0.17034487,0.10089791,0.7262759,0.000045663914,0.00026274813],"about_ca_topic_score_codex":0.000008639173,"about_ca_topic_score_gemma":6.2044023e-7,"teacher_disagreement_score":0.26811388,"about_ca_system_score_codex":0.000002668166,"about_ca_system_score_gemma":0.000010441887,"threshold_uncertainty_score":0.24863656},"labels":[],"label_agreement":null},{"id":"W2066869105","doi":"10.1016/j.disc.2010.03.013","title":"Ultracritical and hypercritical binary structures","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Combinatorics; Digraph; Mathematics; Vertex (graph theory); Binary number; Discrete mathematics; Arithmetic; Graph","score_opus":0.016442633351885966,"score_gpt":0.31152094399518226,"score_spread":0.2950783106432963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066869105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65038764,0.00006270978,0.34237957,0.0016226958,0.00022556633,0.00020648543,0.000009283437,0.00022092852,0.0048851087],"genre_scores_gemma":[0.7045918,0.000004706437,0.2952067,0.000086777225,0.00003952058,0.0000076206065,8.166925e-7,0.000011488389,0.000050547435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882495,0.00003473152,0.00018909799,0.0002846376,0.00031271906,0.00035386317],"domain_scores_gemma":[0.9986183,0.00048851117,0.000014816863,0.0006021431,0.00006467294,0.00021153707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028732396,0.00013710925,0.00016828114,0.00007740608,0.00013655695,0.00018233208,0.0006069857,0.00008171186,0.0000385228],"category_scores_gemma":[0.0005612405,0.00010730043,0.000043867734,0.00016773815,0.00040389562,0.00031972316,0.0003129047,0.0004216772,0.000030550742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001708556,0.00002888701,0.00006106717,0.00004679121,0.0000045569172,0.000025798208,0.00033166443,7.377331e-7,0.018330457,0.97956,0.00003238489,0.0015759186],"study_design_scores_gemma":[0.000152916,0.0000580264,0.0007224931,0.000012341889,0.00000559164,0.00023038739,0.00015651845,0.026279086,0.0036667702,0.9682163,0.00031080865,0.00018877398],"about_ca_topic_score_codex":8.0955147e-7,"about_ca_topic_score_gemma":0.0000015165582,"teacher_disagreement_score":0.05420418,"about_ca_system_score_codex":0.0000048100824,"about_ca_system_score_gemma":0.000021392963,"threshold_uncertainty_score":0.43755844},"labels":[],"label_agreement":null},{"id":"W2067133893","doi":"10.1016/j.disc.2004.03.020","title":"Minimum chromaticity of circulant graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Circulant matrix; Combinatorics; Mathematics; Circulant graph; Chromaticity; Chromatic scale; Discrete mathematics; Graph; Graph power; Line graph; Computer science; Artificial intelligence","score_opus":0.02417981242639211,"score_gpt":0.2962456602513835,"score_spread":0.2720658478249914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067133893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19368702,0.000114830116,0.7979036,0.0003416613,0.000048718823,0.00026671324,0.000008324924,0.00012918095,0.007499961],"genre_scores_gemma":[0.7400881,0.000011354981,0.25969246,0.000040410523,0.000016880384,0.000011793655,0.0000014591492,0.000012225399,0.00012527943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998487,0.00005351116,0.00041998146,0.00023216486,0.00048799152,0.00031932953],"domain_scores_gemma":[0.9984813,0.00022590817,0.00018040906,0.00092053734,0.00008851765,0.000103381586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047007133,0.00014640251,0.00028058328,0.00015504779,0.00006758422,0.0000461773,0.001089104,0.000047446487,0.000036862224],"category_scores_gemma":[0.00013719681,0.000119560165,0.00012883624,0.00047727668,0.00014999838,0.00032964328,0.00027768302,0.00011599671,0.00007346826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025401225,0.00015093402,0.00008902266,0.00019329159,0.00003378181,0.0000053576405,0.002578794,0.00012264027,0.008830194,0.9840047,0.0001351659,0.0038535888],"study_design_scores_gemma":[0.0004324192,0.00010006341,0.00034678855,0.00012759643,0.000014622976,0.000039799837,0.0002573517,0.21400759,0.036712162,0.7472543,0.00038478256,0.00032253686],"about_ca_topic_score_codex":0.0000015446869,"about_ca_topic_score_gemma":0.000002079053,"teacher_disagreement_score":0.5464011,"about_ca_system_score_codex":0.000023853703,"about_ca_system_score_gemma":0.000033358538,"threshold_uncertainty_score":0.4875522},"labels":[],"label_agreement":null},{"id":"W2067247085","doi":"10.1016/j.disc.2014.10.001","title":"Forbidden minors for graphs with no first obstruction to parametric Feynman integration","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Feynman diagram; Mathematics; Combinatorics; Planar graph; Parametric statistics; Discrete mathematics; Feynman integral; Graph; Mathematical physics","score_opus":0.017260534697099403,"score_gpt":0.23521452140082533,"score_spread":0.21795398670372593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067247085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022584358,0.0000059432796,0.97219217,0.00030533108,0.00029350273,0.0004934369,0.000005142909,0.00011392436,0.0040062177],"genre_scores_gemma":[0.61724395,0.0000025086504,0.38206962,0.00012357885,0.00007320627,0.000069760186,0.000015300351,0.000015699767,0.0003864022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885434,0.000017050563,0.00029199637,0.00030160084,0.0002627152,0.0002723268],"domain_scores_gemma":[0.99876267,0.00026518427,0.00015482873,0.000522689,0.00015172872,0.00014288157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002712438,0.00018145524,0.0002338469,0.00015836523,0.00017036204,0.00018338185,0.00042176954,0.000071437236,0.0000069060407],"category_scores_gemma":[0.000057564695,0.00013302836,0.00007697493,0.00049186987,0.000033584416,0.00022136318,0.0000655452,0.00007886092,0.00004654256],"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.000046834866,0.000117209,0.00028693612,0.0002729079,0.00006118193,0.0000034762977,0.002625987,0.00040521662,0.000023900748,0.85293174,0.0070203515,0.13620426],"study_design_scores_gemma":[0.00031075755,0.00039829424,0.00008879819,0.000102909995,0.000030946623,0.000016130089,0.00012868311,0.9273216,0.00010523048,0.069165796,0.0020735147,0.00025732664],"about_ca_topic_score_codex":0.000008306032,"about_ca_topic_score_gemma":0.000024501602,"teacher_disagreement_score":0.9269164,"about_ca_system_score_codex":0.000026180232,"about_ca_system_score_gemma":0.00001937652,"threshold_uncertainty_score":0.5424739},"labels":[],"label_agreement":null},{"id":"W2067443412","doi":"10.1016/j.disc.2008.03.009","title":"Vertex arboricity of integer distance graph <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si11.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>G</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>m</mml:mi><mml:mo>,</mml:mo><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>","year":2008,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"","keywords":"Arboricity; Combinatorics; Vertex (graph theory); Mathematics; Graph; Integer (computer science); Discrete mathematics; Planar graph; Computer science","score_opus":0.021571592716490357,"score_gpt":0.2563671469383798,"score_spread":0.23479555422188944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067443412","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45573065,0.0037194667,0.017642012,0.0013018957,0.006088381,0.00020726955,0.0013931966,0.000909136,0.513008],"genre_scores_gemma":[0.9697515,0.003978823,0.011912,0.002379225,0.0033786397,0.003263566,0.0020064935,0.0025761444,0.00075363566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9706969,0.001684843,0.0059529515,0.005478082,0.008703144,0.0074840267],"domain_scores_gemma":[0.9757306,0.005852637,0.0064684665,0.0072871167,0.0009004527,0.0037607118],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.006264558,0.0029086908,0.0012676005,0.0021379532,0.0048357933,0.003991344,0.009550209,0.0057676644,0.3789556],"category_scores_gemma":[0.0065920246,0.0056623593,0.005962656,0.005441731,0.0075497017,0.004959309,0.007744431,0.0057189083,0.00464545],"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.0031867085,0.0011622926,0.000045021716,0.0038441755,0.0038419352,0.0034260086,0.0059237713,0.0036118089,0.004023148,0.6636491,0.30449706,0.0027890156],"study_design_scores_gemma":[0.004557255,0.004135959,0.00013174638,0.004140978,0.003147627,0.0041575967,0.004562283,0.06352818,0.89572865,0.007122524,0.0036063953,0.005180802],"about_ca_topic_score_codex":0.0029039506,"about_ca_topic_score_gemma":0.0026956499,"teacher_disagreement_score":0.8917055,"about_ca_system_score_codex":0.00007997797,"about_ca_system_score_gemma":0.00426262,"threshold_uncertainty_score":0.9983644},"labels":[],"label_agreement":null},{"id":"W2069262458","doi":"10.1016/s0012-365x(02)00495-8","title":"On the monotonicity of the broadcast function","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University","funders":"","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Conjecture; Monotonic function; Broadcasting (networking); Graph; Function (biology); Discrete mathematics; Computer science; Computer network","score_opus":0.024571823278013213,"score_gpt":0.2714664504881405,"score_spread":0.24689462721012728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069262458","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.11566573,0.000046078196,0.8537861,0.00061411667,0.00017421709,0.000458223,0.0000032722583,0.000046127636,0.02920614],"genre_scores_gemma":[0.99158245,0.0000040420696,0.007764279,0.00014185128,0.000005794909,0.000019559082,1.415746e-7,0.000009101663,0.0004727624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892676,0.00016945064,0.00018272955,0.00014959172,0.00038845022,0.00018304434],"domain_scores_gemma":[0.9981586,0.0005277391,0.00012086541,0.0011064112,0.000057185916,0.000029213441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066035683,0.00009517399,0.00010650501,0.000031864827,0.00017062982,0.000044820084,0.0008992513,0.00002900678,0.000032781947],"category_scores_gemma":[0.0004887171,0.000045181794,0.00009676383,0.00042919462,0.00013887929,0.000099608864,0.00015456745,0.00017352708,0.0000336469],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024091316,0.00003355926,0.000024224051,0.000013378197,0.000009144154,2.1364727e-7,0.00047880903,0.00016159285,0.00049103005,0.9981961,0.00009974489,0.0004897812],"study_design_scores_gemma":[0.000099466655,0.00005591252,0.00014195238,0.00003433749,0.0000053037365,0.000004069658,0.00019838667,0.0145599125,0.015231893,0.9688948,0.000700154,0.00007380515],"about_ca_topic_score_codex":9.3539956e-7,"about_ca_topic_score_gemma":8.2060996e-7,"teacher_disagreement_score":0.8759167,"about_ca_system_score_codex":0.000018109844,"about_ca_system_score_gemma":0.000029225097,"threshold_uncertainty_score":0.184246},"labels":[],"label_agreement":null},{"id":"W2069528460","doi":"10.1016/j.disc.2007.11.044","title":"List-edge and list-total colorings of graphs embedded on hyperbolic surfaces","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics; Euler's formula; Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.03229358121360019,"score_gpt":0.28555978410736266,"score_spread":0.25326620289376245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069528460","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9838832,0.00016002922,0.008038677,0.00010031476,0.000051775,0.0002615168,0.000011492817,0.00010157041,0.007391404],"genre_scores_gemma":[0.96555376,0.000093356764,0.03363255,0.000030103964,0.00000930101,0.000016749174,0.0000017695484,0.000020963465,0.00064142345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998458,0.000063698906,0.0003316316,0.00033241097,0.00047362343,0.00034057914],"domain_scores_gemma":[0.9984922,0.00042765043,0.00015704407,0.0006909466,0.000094676674,0.00013751061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032586502,0.00019867661,0.00034844762,0.00017625093,0.00016998436,0.00005110804,0.0006336417,0.0000636739,0.000013613196],"category_scores_gemma":[0.0001844049,0.0001649769,0.00009375433,0.00050724216,0.000421214,0.00029002022,0.00032461726,0.00017991575,0.000015933601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025506057,0.00018478165,0.0008361364,0.00022367245,0.00004301281,0.00004088723,0.0069977,0.00007560747,0.008059549,0.9829224,0.000107291904,0.00048350773],"study_design_scores_gemma":[0.0024038015,0.0017152712,0.00846131,0.00051508914,0.000047674803,0.0005886789,0.001912114,0.081146315,0.087527305,0.81332064,0.00082683674,0.0015350011],"about_ca_topic_score_codex":0.000007428423,"about_ca_topic_score_gemma":0.000002195025,"teacher_disagreement_score":0.16960174,"about_ca_system_score_codex":0.000015769252,"about_ca_system_score_gemma":0.00003319553,"threshold_uncertainty_score":0.67275625},"labels":[],"label_agreement":null},{"id":"W2072209133","doi":"10.1016/j.disc.2004.10.026","title":"The recognition of bound quivers using edge-coloured homomorphisms","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University; Thompson Rivers University","funders":"","keywords":"Homomorphism; Digraph; Mathematics; Combinatorics; Upper and lower bounds; Quiver; Discrete mathematics; Directed graph; Enhanced Data Rates for GSM Evolution; Graph; Time complexity; Pure mathematics; Computer science; Artificial intelligence","score_opus":0.048571281772499336,"score_gpt":0.3108193656923948,"score_spread":0.2622480839198955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072209133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21963422,0.00019740804,0.7746121,0.000492794,0.00014487599,0.00038576193,0.000012479537,0.000085528256,0.0044348356],"genre_scores_gemma":[0.5467666,0.000054188764,0.4526936,0.000048199254,0.00006488842,0.00001630503,0.0000034533964,0.000023415778,0.00032934058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987654,0.000079115955,0.00030508765,0.00017813139,0.00037873685,0.00029351533],"domain_scores_gemma":[0.998599,0.0003917365,0.00019960434,0.0006005582,0.00014430907,0.00006481138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006718482,0.00011477096,0.00015929289,0.000079848935,0.00028843054,0.00011960521,0.0008172677,0.00004397344,0.000014903166],"category_scores_gemma":[0.00018594696,0.00008183132,0.000087335226,0.00037036696,0.00026705445,0.00036747727,0.00021828103,0.0001312447,0.000044141594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039943985,0.00024718273,0.00003808298,0.00016091563,0.0001236051,0.000012395545,0.007289156,0.0009992191,0.016817514,0.8802834,0.00036892085,0.09361965],"study_design_scores_gemma":[0.00045362723,0.00008841853,0.00003131793,0.00010095284,0.000022153863,0.000035430123,0.00082527957,0.26444048,0.025699915,0.7068673,0.0011879115,0.00024724807],"about_ca_topic_score_codex":0.0000024026363,"about_ca_topic_score_gemma":0.0000055051687,"teacher_disagreement_score":0.32713237,"about_ca_system_score_codex":0.000055097593,"about_ca_system_score_gemma":0.000052173524,"threshold_uncertainty_score":0.33369845},"labels":[],"label_agreement":null},{"id":"W2072270436","doi":"10.1016/j.disc.2010.01.003","title":"Generating self-complementary uniform hypergraphs","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Permutation (music); Isomorphism (crystallography); Order (exchange); Discrete mathematics; Expressive power; Representation (politics); Theoretical computer science; Computer science","score_opus":0.007141301343670306,"score_gpt":0.20805923246738756,"score_spread":0.20091793112371725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072270436","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9655479,0.000044933917,0.0047554174,0.000019547453,0.00069395447,0.00019638707,0.000023818251,0.00066289713,0.028055152],"genre_scores_gemma":[0.95874316,0.000006452568,0.040905315,0.00002971343,0.00014927832,0.000025012363,0.000022721131,0.000047323705,0.00007103306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918735,0.000010697661,0.00029567917,0.00010882928,0.000145935,0.00025148675],"domain_scores_gemma":[0.9994709,0.00004425821,0.000038215232,0.00034837634,0.000018794406,0.00007947403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023329195,0.00017349524,0.00017988574,0.000067591754,0.00010981069,0.00005539995,0.00020244703,0.00006429125,0.00018659573],"category_scores_gemma":[0.000009000418,0.0001514539,0.00008740258,0.00013700928,0.000025453108,0.00010185479,0.000028121342,0.00021195598,0.00008072282],"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.00000384665,0.00016482321,0.0013845224,0.0017015046,0.0005158055,0.000027901604,0.01393155,0.0037714825,0.27374685,0.6982322,0.0037584691,0.002761105],"study_design_scores_gemma":[0.0010194825,0.000080614314,0.00017743566,0.00015864025,0.00018280644,0.00019172372,0.006097471,0.8386598,0.034843497,0.086407036,0.030671418,0.0015100463],"about_ca_topic_score_codex":0.000003221847,"about_ca_topic_score_gemma":0.000026135227,"teacher_disagreement_score":0.83488834,"about_ca_system_score_codex":0.000009600207,"about_ca_system_score_gemma":0.000005139508,"threshold_uncertainty_score":0.6176111},"labels":[],"label_agreement":null},{"id":"W2072445778","doi":"10.1016/j.disc.2013.08.017","title":"The cluster deletion problem for cographs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Split graph; Time complexity; Partition (number theory); Cograph; Clique graph; Graph; Clique; Discrete mathematics; Chordal graph; Line graph; Graph power; 1-planar graph","score_opus":0.015411901310856943,"score_gpt":0.2459727440412529,"score_spread":0.23056084273039595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072445778","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.0015798608,0.000066566565,0.9910912,0.0031110966,0.0001700854,0.0008592619,0.000003270423,0.00012558931,0.0029930824],"genre_scores_gemma":[0.052805025,0.00002868911,0.9451045,0.00040355595,0.00008583624,0.000619024,0.000006336179,0.000020026895,0.00092704163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990599,0.000025189975,0.00025228548,0.00018231018,0.00019956227,0.00028073043],"domain_scores_gemma":[0.99878377,0.00041213262,0.000104099636,0.00052405096,0.000120713274,0.00005525361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034155409,0.00011757486,0.000115186966,0.000041670533,0.0004083091,0.0004906665,0.00080686423,0.000038553597,0.000009489816],"category_scores_gemma":[0.000047080677,0.00007287501,0.00012687159,0.00021378508,0.00009044983,0.00027437415,0.00018069887,0.00007783828,0.00006114647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001139045,0.00003783011,0.000011686692,0.000068742156,0.000023645802,1.7223387e-7,0.0009914055,0.0000144979485,0.000051745148,0.9593653,0.0076123443,0.031821463],"study_design_scores_gemma":[0.00015658699,0.000044837336,0.000047551923,0.000023299754,0.000005805148,0.0000055177147,0.0001278087,0.31377736,0.00012397149,0.67607945,0.009492679,0.00011514675],"about_ca_topic_score_codex":0.000006805989,"about_ca_topic_score_gemma":0.000006707766,"teacher_disagreement_score":0.31376284,"about_ca_system_score_codex":0.000009515141,"about_ca_system_score_gemma":0.000013300801,"threshold_uncertainty_score":0.47315085},"labels":[],"label_agreement":null},{"id":"W2073055376","doi":"10.1016/s0012-365x(03)00277-2","title":"Some new orthogonal designs in orders 32 and 40","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Complement (music); Order (exchange); Orthogonal array; Resolution (logic); Discrete mathematics; Orthogonal complement; Statistics; Mathematical analysis; Computer science","score_opus":0.1952039077306143,"score_gpt":0.43652435207368806,"score_spread":0.24132044434307376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073055376","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.46079424,0.0020108086,0.47983533,0.0006329878,0.00047838385,0.0009906751,0.000014686325,0.00010333272,0.05513956],"genre_scores_gemma":[0.2759763,0.000029691244,0.72100914,0.00023264735,0.00003773296,0.00001301264,0.000001237263,0.00003260044,0.0026676543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741095,0.00032609707,0.00067625893,0.00041214342,0.0008472844,0.00032724702],"domain_scores_gemma":[0.99775845,0.0013462834,0.00017039315,0.0004717125,0.00004463678,0.00020849849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002948103,0.00020400246,0.00039163322,0.00022411026,0.0000737136,0.00023125547,0.00036628224,0.00008941645,0.00047852934],"category_scores_gemma":[0.0030709123,0.00015198824,0.00007829442,0.0005791763,0.00013537613,0.00038156906,0.00009161381,0.00014493507,0.00017339735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044624834,0.00019762876,0.003211394,0.000036602516,0.000027263923,0.000044306318,0.0071269386,0.00022964507,0.0129369255,0.9664295,0.0027525993,0.006962616],"study_design_scores_gemma":[0.0007912332,0.0001167526,0.00086952734,0.00004883388,0.000012967409,0.000040931267,0.004346552,0.006633276,0.007444256,0.9765922,0.0027245781,0.00037888237],"about_ca_topic_score_codex":0.000011291486,"about_ca_topic_score_gemma":0.000008591753,"teacher_disagreement_score":0.2411738,"about_ca_system_score_codex":0.000033438253,"about_ca_system_score_gemma":0.00010585648,"threshold_uncertainty_score":0.6197901},"labels":[],"label_agreement":null},{"id":"W2073231246","doi":"10.1016/j.disc.2011.01.011","title":"Coding discretizations of continuous functions","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Discretization; Subsequence; Coding (social sciences); Sequence (biology); Limit (mathematics); Discrete mathematics; Applied mathematics; Algorithm; Mathematical analysis; Statistics","score_opus":0.0264572524158426,"score_gpt":0.2299051483951956,"score_spread":0.203447895979353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073231246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013776,0.000032660424,0.9460108,0.000054151566,0.00014293347,0.000107504566,0.000012787336,0.00016167552,0.03970148],"genre_scores_gemma":[0.863613,0.0000065047097,0.1357724,0.00003189618,0.000016234162,0.000011021101,0.000005097543,0.000011416345,0.00053241604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992121,0.00002325485,0.00029317717,0.00015461103,0.00015450403,0.00016239265],"domain_scores_gemma":[0.99908024,0.0000891762,0.00016003753,0.00055504596,0.000061556835,0.000053947668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018946263,0.00010315474,0.00018315365,0.000074881,0.00008632967,0.00003693981,0.0005215731,0.000036388203,0.000108815286],"category_scores_gemma":[0.00006848456,0.000084119856,0.0000796622,0.00026634944,0.0000750277,0.00024738378,0.00016357754,0.000057425004,0.00005080675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.1854466e-7,0.000081867256,0.00025387233,0.000040553256,0.000020375,0.0000021435396,0.0052336897,0.0000034882232,0.0007550475,0.99239296,0.00024965534,0.0009655324],"study_design_scores_gemma":[0.0008863554,0.00031461267,0.004307447,0.00048816213,0.00015233913,0.00009398737,0.008224853,0.24411194,0.02794068,0.7111332,0.0013268465,0.0010195787],"about_ca_topic_score_codex":0.0000087575045,"about_ca_topic_score_gemma":0.0000017065876,"teacher_disagreement_score":0.849837,"about_ca_system_score_codex":0.000008104359,"about_ca_system_score_gemma":0.000018677616,"threshold_uncertainty_score":0.3430308},"labels":[],"label_agreement":null},{"id":"W2073490544","doi":"10.1016/j.disc.2005.09.015","title":"The metric dimension of Cayley digraphs","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":118,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Metric dimension; Cayley graph; Vertex (graph theory); Discrete mathematics; Connectivity; Graph; Line graph; Pathwidth","score_opus":0.008927144760715572,"score_gpt":0.2222670857452978,"score_spread":0.21333994098458223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073490544","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.4733408,0.0051978235,0.4886785,0.0020168144,0.00096060015,0.0007618027,0.000010784432,0.00060592894,0.02842697],"genre_scores_gemma":[0.9450737,0.000030165902,0.054496367,0.000028733855,0.000005231292,0.0000069291887,0.0000018755828,0.000009547899,0.00034742377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998789,0.00003455896,0.0003947009,0.00017928987,0.0003808541,0.00022158057],"domain_scores_gemma":[0.99859494,0.0003147422,0.00020762118,0.0007330565,0.00010928611,0.00004033031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004873976,0.000118139826,0.00016880617,0.0001240933,0.00019365465,0.00009024906,0.00057637173,0.000040359,0.0000016883221],"category_scores_gemma":[0.000076191,0.000068977715,0.00010915983,0.000824007,0.000098148535,0.00010351577,0.00016666696,0.00007415148,0.000019434383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.04664e-7,0.000055487188,0.00017178777,0.00002720067,0.000011160663,0.0000015160338,0.00020938402,0.00019460618,0.0018100529,0.99555326,0.0010289253,0.00093570125],"study_design_scores_gemma":[0.00025158297,0.000062386614,0.00035960728,0.00006098839,0.000021802854,0.0000102925205,0.00012215742,0.07670529,0.013282375,0.90818316,0.00075352704,0.00018684806],"about_ca_topic_score_codex":0.000051915496,"about_ca_topic_score_gemma":0.0000068089735,"teacher_disagreement_score":0.4717329,"about_ca_system_score_codex":0.0000067682377,"about_ca_system_score_gemma":0.00001799864,"threshold_uncertainty_score":0.28128296},"labels":[],"label_agreement":null},{"id":"W2073783222","doi":"10.1016/j.disc.2003.11.027","title":"On the chromatic index of path decompositions","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Graph; Vertex (graph theory); Chromatic scale; Path (computing); Block (permutation group theory); Edge coloring; Windmill graph; Discrete mathematics; Graph power; Line graph; Computer science","score_opus":0.007012095072584522,"score_gpt":0.2003267415899903,"score_spread":0.1933146465174058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073783222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9233945,0.00005143391,0.055293676,0.0000654081,0.00010526189,0.00022911777,0.000014537241,0.00012070945,0.020725382],"genre_scores_gemma":[0.9991888,0.0000033651454,0.0007093847,0.000018261346,0.000013110424,0.000023378672,0.0000028385757,0.000019462386,0.000021407084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994804,0.000014412199,0.00021780553,0.000050484206,0.00012679493,0.000110080604],"domain_scores_gemma":[0.99950784,0.0001241926,0.000041866115,0.0002873945,0.000011815778,0.000026867909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012912996,0.00009831787,0.00014116416,0.000034543024,0.00005218314,0.000014971753,0.00014695563,0.00003474159,0.000039552946],"category_scores_gemma":[0.000020571471,0.00006313358,0.00007330991,0.00012040663,0.000042517284,0.000029846335,0.0000107308,0.000078305915,0.00005045056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011786818,0.00004532445,0.000008895907,0.00030298662,0.00005146919,0.0000018048521,0.0024473083,0.016033482,0.0024464303,0.9785268,0.00010661335,0.000027724394],"study_design_scores_gemma":[0.00036236757,0.00007167897,0.00023605819,0.0008394947,0.00004228092,0.000021226328,0.0017309554,0.030015621,0.012920002,0.9534804,0.00005328876,0.00022662654],"about_ca_topic_score_codex":0.0000012827941,"about_ca_topic_score_gemma":0.0000014016122,"teacher_disagreement_score":0.07579432,"about_ca_system_score_codex":0.000017444754,"about_ca_system_score_gemma":0.0000052126998,"threshold_uncertainty_score":0.25745127},"labels":[],"label_agreement":null},{"id":"W2075048357","doi":"10.1016/j.disc.2013.04.013","title":"The inertia of distance matrices of some graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Government of Shandong Province; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Eigenvalues and eigenvectors; Inertia; Distance matrix; Graph; Discrete mathematics; Distance matrices in phylogeny; Matrix (chemical analysis)","score_opus":0.018403199891204293,"score_gpt":0.2777834953767149,"score_spread":0.25938029548551056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075048357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9819259,0.0005958188,0.010087926,0.00043867494,0.000061410974,0.0008464394,0.000053184962,0.00007082776,0.005919799],"genre_scores_gemma":[0.98427254,0.00009890476,0.015010736,0.000011727148,0.000013892961,0.00011226343,0.00000303599,0.000024101888,0.00045279285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879885,0.000039093975,0.00062218594,0.000114889976,0.00023851883,0.0001864511],"domain_scores_gemma":[0.9975929,0.001041166,0.0005097012,0.0006838487,0.00012717627,0.000045199333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034821616,0.0001400054,0.0002868328,0.000051651354,0.00012256276,0.000026091458,0.00045417884,0.000050123723,0.00005904794],"category_scores_gemma":[0.00024230812,0.000084681444,0.00015464779,0.0002860488,0.000300454,0.0001264781,0.000068163514,0.000085534244,0.000023249244],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002357113,0.000096828815,0.00010314697,0.00034355538,0.000042846088,8.527331e-8,0.00083271146,0.0000010017096,0.002179389,0.99516165,0.0009255978,0.00031084416],"study_design_scores_gemma":[0.00010755409,0.000018420475,0.0001365363,0.0000854418,0.00005298848,0.000001419066,0.0011734609,0.00045455634,0.006960843,0.99054545,0.00036558203,0.00009777522],"about_ca_topic_score_codex":0.000008353823,"about_ca_topic_score_gemma":0.0000040264754,"teacher_disagreement_score":0.0054670065,"about_ca_system_score_codex":0.000005383523,"about_ca_system_score_gemma":0.000012064597,"threshold_uncertainty_score":0.3453209},"labels":[],"label_agreement":null},{"id":"W2075223139","doi":"10.1016/j.disc.2014.02.009","title":"A new look at an old construction: Constructing (simple) 3-designs from resolvable 2-designs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Simple (philosophy); Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.022443692911218813,"score_gpt":0.2276431449358064,"score_spread":0.2051994520245876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075223139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49053782,0.00013729141,0.4746294,0.00002124028,0.0006807756,0.00038616103,0.00005729762,0.0009116279,0.032638375],"genre_scores_gemma":[0.87333566,0.000009107369,0.12514836,0.000040954805,0.0004733168,0.00002250199,0.000063320804,0.00012172705,0.0007850643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983613,0.00010466032,0.00055058714,0.00030317804,0.0002576795,0.00042258226],"domain_scores_gemma":[0.9985541,0.00028090485,0.00013509559,0.0007244065,0.000034770823,0.000270715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037105771,0.00033185416,0.0004693104,0.00008630612,0.00018985046,0.00013796901,0.00030100756,0.00017017397,0.0007097263],"category_scores_gemma":[0.000060900613,0.00031833083,0.0001241674,0.00018223988,0.000110764355,0.0002468511,0.000055038967,0.00019539142,0.0001956529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060424652,0.00006705835,0.0045867157,0.0010111408,0.0005748256,0.000027291826,0.013716918,0.005295937,0.09322504,0.8638301,0.00771263,0.009891898],"study_design_scores_gemma":[0.0027269763,0.0002864678,0.0001495134,0.0008010801,0.00040631887,0.00035958277,0.016864285,0.18266031,0.07713714,0.7041244,0.012106646,0.0023772863],"about_ca_topic_score_codex":0.000044442535,"about_ca_topic_score_gemma":0.000042102663,"teacher_disagreement_score":0.38279784,"about_ca_system_score_codex":0.000065828324,"about_ca_system_score_gemma":0.000020209112,"threshold_uncertainty_score":0.99992687},"labels":[],"label_agreement":null},{"id":"W2075649093","doi":"10.1016/s0012-365x(03)00283-8","title":"New combinatorial designs and their applications to authentication codes and secret sharing schemes","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":89,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Secret sharing; Mathematics; Converse; Combinatorial design; Discrete mathematics; Upper and lower bounds; Type (biology); Construct (python library); Combinatorics; Scheme (mathematics); Equivalence (formal languages); Cryptography; Computer science; Algorithm","score_opus":0.018966663341195778,"score_gpt":0.2364626543621001,"score_spread":0.2174959910209043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075649093","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.30702665,0.00039380626,0.68785083,0.00002307341,0.00011540797,0.00055027026,0.000013246794,0.00019113408,0.0038355482],"genre_scores_gemma":[0.9905607,0.000013584479,0.009200746,0.000007070261,0.00003332114,0.000069390335,0.0000056031868,0.000025442383,0.00008410256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947995,0.000014573439,0.0001748028,0.00013320812,0.000061199855,0.00013626223],"domain_scores_gemma":[0.9995463,0.00007017547,0.00002640971,0.00022080661,0.00001569064,0.00012060391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019663812,0.0001299998,0.00015719593,0.00004972143,0.00008219675,0.00008323838,0.00008504464,0.000050712933,0.000013658611],"category_scores_gemma":[0.000028453169,0.000112804424,0.000021896672,0.00011731403,0.000022271704,0.00006508981,0.00002216378,0.000058073667,0.00001068246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012746132,0.000008686522,0.00014092006,0.0002044797,0.00003375911,1.2984293e-7,0.0037653395,0.000027509835,0.006557524,0.9887468,0.000067523266,0.00044601638],"study_design_scores_gemma":[0.0004965254,0.00004013452,0.000092042814,0.00017060136,0.000060024122,0.000024420406,0.0033678375,0.01864408,0.023562185,0.9453549,0.00772211,0.00046516772],"about_ca_topic_score_codex":0.0000014298358,"about_ca_topic_score_gemma":0.0000013349069,"teacher_disagreement_score":0.6835341,"about_ca_system_score_codex":0.000010499378,"about_ca_system_score_gemma":0.0000059052204,"threshold_uncertainty_score":0.4600031},"labels":[],"label_agreement":null},{"id":"W2076752886","doi":"10.1016/s0012-365x(02)00372-2","title":"No iterated morphism generates any Arshon sequence of odd order","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Morphism; Iterated function; Mathematics; Sequence (biology); Order (exchange); Combinatorics; Discrete mathematics","score_opus":0.03221271644476364,"score_gpt":0.24233306495041634,"score_spread":0.2101203485056527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076752886","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.35968947,0.0010261947,0.6102834,0.0007238338,0.00065942405,0.0005100469,0.00007020638,0.0006695175,0.026367944],"genre_scores_gemma":[0.7031513,0.000088808876,0.29307133,0.00035715156,0.0000831003,0.000018388606,0.000014093432,0.00003475413,0.0031810908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870497,0.00004433864,0.00039821683,0.0002755754,0.00029148886,0.00028543474],"domain_scores_gemma":[0.9986778,0.00010906064,0.00020021228,0.0007598262,0.00017489608,0.000078189514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023187787,0.00019382792,0.0002789372,0.00008055697,0.00007190554,0.00012932783,0.00080391066,0.000068822905,0.00027125116],"category_scores_gemma":[0.00010176045,0.00015465432,0.0000714465,0.00047656507,0.000086030115,0.00036419136,0.00018386771,0.00009989984,0.00030941403],"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.0000059301547,0.0006454502,0.00018316855,0.0006278805,0.00016434374,0.00012197429,0.0140087735,0.00061759725,0.2430698,0.71847177,0.009424387,0.01265895],"study_design_scores_gemma":[0.00021171336,0.00006471523,0.000023797716,0.00014056951,0.000012331115,0.00003393367,0.000057001722,0.96313274,0.0167917,0.0182961,0.00095656305,0.00027884022],"about_ca_topic_score_codex":0.000006450341,"about_ca_topic_score_gemma":5.6237786e-7,"teacher_disagreement_score":0.9625151,"about_ca_system_score_codex":0.000018467177,"about_ca_system_score_gemma":0.000014913307,"threshold_uncertainty_score":0.630662},"labels":[],"label_agreement":null},{"id":"W2076955343","doi":"10.1016/j.disc.2013.07.018","title":"List-homomorphism problems on graphs and arc consistency","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Homomorphism; Mathematics; Semilattice; Combinatorics; Bipartite graph; Discrete mathematics; Graph homomorphism; Consistency (knowledge bases); Idempotence; Arc (geometry); Graph; Line graph; Voltage graph","score_opus":0.02610413603892978,"score_gpt":0.267608695764183,"score_spread":0.24150455972525323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076955343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49445602,0.00081752235,0.40309945,0.005965848,0.00040229378,0.0037426273,0.000023886076,0.00115578,0.09033656],"genre_scores_gemma":[0.8958303,0.00006500169,0.102187544,0.0002822185,0.000014078589,0.00016380314,0.0000031482791,0.000032383774,0.0014215715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984974,0.000050192713,0.0002943621,0.00036727954,0.00040105375,0.00038967296],"domain_scores_gemma":[0.9984761,0.00028498523,0.000110794084,0.00083632296,0.00010879823,0.00018300366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031949807,0.00019728109,0.00023890403,0.00015784898,0.00017538153,0.0002717105,0.0006806558,0.000057195433,0.00006679288],"category_scores_gemma":[0.00011872,0.00015163983,0.00006825109,0.0003388539,0.00027718072,0.00040188624,0.00030643356,0.00020512441,0.00022395694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012012677,0.00006111623,0.000113490045,0.0001053157,0.000015922147,0.0000068221293,0.0012602523,0.0000058541664,0.0011078047,0.9942517,0.00038818075,0.002682296],"study_design_scores_gemma":[0.00023240187,0.000148728,0.00029209495,0.00009846255,0.00000450645,0.000032395375,0.00015054582,0.015855359,0.0005955256,0.9820526,0.00031712474,0.00022021832],"about_ca_topic_score_codex":0.000010292498,"about_ca_topic_score_gemma":0.0000026094021,"teacher_disagreement_score":0.40137422,"about_ca_system_score_codex":0.000015858346,"about_ca_system_score_gemma":0.00002066612,"threshold_uncertainty_score":0.6183693},"labels":[],"label_agreement":null},{"id":"W2077159664","doi":"10.1016/j.disc.2010.03.034","title":"The complexity of locally injective homomorphisms","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Island University; University of Victoria","funders":"","keywords":"Injective function; Digraph; Homomorphism; Mathematics; Combinatorics; Tournament; Vertex (graph theory); Discrete mathematics; Antichain; Graph; Partially ordered set","score_opus":0.037456553879670465,"score_gpt":0.30552801845569166,"score_spread":0.2680714645760212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077159664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033872727,0.00003013674,0.9504555,0.0006474502,0.00020064051,0.0003157069,0.000009926349,0.00008493489,0.01438298],"genre_scores_gemma":[0.7864295,0.000005738142,0.21332271,0.000023477638,0.000019663496,0.000017142625,9.108753e-7,0.000011614462,0.00016923413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876416,0.00006088784,0.0002831987,0.00018900684,0.0004210081,0.0002817545],"domain_scores_gemma":[0.9979219,0.0005422151,0.0001623193,0.0010979107,0.00019733798,0.000078358695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075083785,0.00011804966,0.00017864374,0.00005392405,0.000231519,0.00009385561,0.0016932262,0.000045745208,0.000013500463],"category_scores_gemma":[0.0003620818,0.00007399918,0.0000842683,0.00037477346,0.0014544872,0.00018683932,0.00048699547,0.0003330531,0.000034077893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004194233,0.00003738273,0.000021518486,0.000018889556,0.000014134275,0.0000020038133,0.00079678104,0.000006985432,0.003094035,0.99307495,0.000036129084,0.0028930057],"study_design_scores_gemma":[0.00012331539,0.000057697576,0.00023676947,0.000012991303,0.0000030363153,0.000015178915,0.00020387009,0.02857706,0.009925287,0.960442,0.0003058098,0.000096968164],"about_ca_topic_score_codex":0.0000040948235,"about_ca_topic_score_gemma":0.000026967175,"teacher_disagreement_score":0.7525568,"about_ca_system_score_codex":0.000010439091,"about_ca_system_score_gemma":0.000052849748,"threshold_uncertainty_score":0.53591186},"labels":[],"label_agreement":null},{"id":"W2077219596","doi":"10.1016/j.disc.2014.04.007","title":"A note on the real part of complex chromatic roots","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Chromatic scale; Combinatorics; Chromatic polynomial; Bounded function; Graph; Conjecture; Discrete mathematics; Friendship graph; Windmill graph; Graph power; Line graph; Mathematical analysis","score_opus":0.056421055226195595,"score_gpt":0.32637315449939247,"score_spread":0.26995209927319685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077219596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.515023,0.000021949001,0.2197104,0.002170984,0.0011884343,0.0035051422,0.00009654741,0.00086828193,0.25741526],"genre_scores_gemma":[0.89799523,0.000014283733,0.10059701,0.00014326148,0.0002705029,0.00011939185,0.000010491516,0.00016277186,0.00068708166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99683,0.00021835098,0.0011980264,0.00032956954,0.0009261231,0.0004979357],"domain_scores_gemma":[0.99151325,0.0054138275,0.00094542786,0.001830842,0.00016842618,0.00012823984],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001286913,0.00045692766,0.00091973867,0.000098981116,0.00020283836,0.000053497253,0.0008594033,0.000147226,0.00022384118],"category_scores_gemma":[0.003952149,0.00029637784,0.0002739042,0.00034506817,0.000272464,0.000094689196,0.00021008142,0.00030328362,0.00015628633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012010735,0.00031794095,0.000008585841,0.0008124235,0.000059034443,0.0000016445374,0.0018542679,0.00002252295,0.0011870386,0.9931103,0.002296019,0.00031821683],"study_design_scores_gemma":[0.00054028124,0.00023964139,0.00004125972,0.000593914,0.00012730734,0.000008095467,0.00046508078,0.017557973,0.003186658,0.97549796,0.0013894277,0.00035241956],"about_ca_topic_score_codex":0.000004181007,"about_ca_topic_score_gemma":0.000007544764,"teacher_disagreement_score":0.3829722,"about_ca_system_score_codex":0.000077891884,"about_ca_system_score_gemma":0.000039925548,"threshold_uncertainty_score":0.99994886},"labels":[],"label_agreement":null},{"id":"W2078027397","doi":"10.1016/s0012-365x(01)00440-x","title":"Isomorphism certificates for undirected graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Subgraph isomorphism problem; Graph isomorphism; Induced subgraph isomorphism problem; Discrete mathematics; Isomorphism (crystallography); Graph; Grid; Line graph; Voltage graph","score_opus":0.08590900831975816,"score_gpt":0.3012478759326275,"score_spread":0.2153388676128693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078027397","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70891416,0.002240555,0.1364126,0.0045541674,0.0030023477,0.0066224067,0.0006274447,0.003138661,0.13448767],"genre_scores_gemma":[0.87765276,0.00006235883,0.11749576,0.00017904976,0.0001289133,0.00016086893,0.000021084312,0.00012949703,0.0041697193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838644,0.0000429956,0.000547405,0.00030921315,0.00027796274,0.00043599465],"domain_scores_gemma":[0.9978086,0.0010101256,0.00024260298,0.0007116968,0.00011077223,0.0001162207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003060779,0.00030589252,0.00044815976,0.00013680769,0.00040043864,0.00006760979,0.00041176495,0.00015335274,0.00060603954],"category_scores_gemma":[0.00069962954,0.0002331838,0.00030210777,0.00024113119,0.00018079847,0.00009446784,0.00008750152,0.00015054541,0.000036029316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009009067,0.00013910735,0.0000480691,0.00031710562,0.00011710704,0.0000028521113,0.0038117373,0.000001082862,0.0004642609,0.9708507,0.023511399,0.00072758965],"study_design_scores_gemma":[0.00044436892,0.00005942123,0.000022573387,0.000064880056,0.00013227596,0.000018969982,0.00035306808,0.006142127,0.001870981,0.98546124,0.005083029,0.00034706006],"about_ca_topic_score_codex":0.0000013208332,"about_ca_topic_score_gemma":0.000002719256,"teacher_disagreement_score":0.16873862,"about_ca_system_score_codex":0.000023663591,"about_ca_system_score_gemma":0.0000045947204,"threshold_uncertainty_score":0.95089597},"labels":[],"label_agreement":null},{"id":"W2078116611","doi":"10.1016/j.disc.2014.11.020","title":"A note on the discrepancy of matrices with bounded row and column sums","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Bounded function; Combinatorics; Lemma (botany); Column (typography); Context (archaeology); Discrete mathematics; Degree (music); Enhanced Data Rates for GSM Evolution; Computer science; Connection (principal bundle)","score_opus":0.005801646184660525,"score_gpt":0.19188970979506242,"score_spread":0.1860880636104019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078116611","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9652225,0.00012393153,0.01224132,0.00008725573,0.000065682216,0.0002923761,0.000014923299,0.00010867489,0.021843353],"genre_scores_gemma":[0.99838376,0.0000140241245,0.0013972691,0.000014731792,0.000024999852,0.000023158665,0.0000019519562,0.000028765715,0.00011135032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999355,0.000035571,0.0002041653,0.000094600175,0.0001636697,0.00014695985],"domain_scores_gemma":[0.99926907,0.00027152643,0.000072638075,0.0003304281,0.00001732991,0.000039033028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002874239,0.00013875292,0.00022211521,0.000036315978,0.00006758543,0.000048969006,0.00013658934,0.000041321313,0.000014169262],"category_scores_gemma":[0.000035517784,0.000079086065,0.000041494826,0.00012375647,0.000092875714,0.000049006034,0.000017716126,0.000084361025,0.000009732556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025555322,0.0000437115,0.0004508089,0.0013305562,0.00012096576,0.0000019994382,0.00559771,0.00038034958,0.0010579247,0.990204,0.00023998185,0.0005464758],"study_design_scores_gemma":[0.002621516,0.0013407535,0.003154343,0.003854777,0.0005705889,0.00012758673,0.01030962,0.40941238,0.024829973,0.5321064,0.0097101275,0.0019619677],"about_ca_topic_score_codex":0.0000059670865,"about_ca_topic_score_gemma":0.00002082311,"teacher_disagreement_score":0.45809758,"about_ca_system_score_codex":0.000006527443,"about_ca_system_score_gemma":0.0000036102483,"threshold_uncertainty_score":0.32250363},"labels":[],"label_agreement":null},{"id":"W2078558807","doi":"10.1016/j.disc.2004.09.014","title":"Pancomponented 2-factorizations of complete graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"University of Vermont; University of Minnesota Duluth","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.014412601359995727,"score_gpt":0.21198889922382003,"score_spread":0.1975762978638243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078558807","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86227435,0.0002735691,0.10784555,0.000039784485,0.00033859254,0.00032053192,0.00015097208,0.0004813044,0.028275345],"genre_scores_gemma":[0.99549234,0.000012779382,0.0043309475,0.000005438735,0.000030029054,0.00000979188,0.0000232101,0.000025988174,0.000069467664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934375,0.000014718205,0.00031550057,0.00006578509,0.00012296367,0.000137281],"domain_scores_gemma":[0.9995753,0.00005337927,0.000052925505,0.00024667903,0.000026767915,0.0000449091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008447235,0.00011371176,0.00020431344,0.00007742563,0.00003486894,0.0000111279915,0.00013256267,0.00004057154,0.00007782778],"category_scores_gemma":[0.000011104022,0.00010236069,0.00008537279,0.0001818361,0.00003796828,0.00006999208,0.000013080353,0.000061230596,0.000047343823],"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.0000050984113,0.00013982084,0.000818926,0.0010902898,0.0002652536,0.0000017581687,0.0062618325,0.016556265,0.08873009,0.8843605,0.0010516185,0.00071857165],"study_design_scores_gemma":[0.0019365927,0.00012619939,0.0032988628,0.00096739247,0.00028599778,0.00005356071,0.0040614745,0.72561294,0.062840484,0.16234855,0.036774494,0.001693446],"about_ca_topic_score_codex":0.0000012458203,"about_ca_topic_score_gemma":0.0000036412878,"teacher_disagreement_score":0.7220119,"about_ca_system_score_codex":0.000010185504,"about_ca_system_score_gemma":0.0000026326659,"threshold_uncertainty_score":0.41741475},"labels":[],"label_agreement":null},{"id":"W2078598924","doi":"10.1016/j.disc.2007.04.021","title":"An answer to Hirasaka and Muzychuk: Every p-Schur ring over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msubsup><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msubsup></mml:math> is Schurian","year":2007,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Lethbridge","funders":"","keywords":"Mathematics; Abelian group; Rank (graph theory); Ring (chemistry); Combinatorics; Group (periodic table); Discrete mathematics; Physics","score_opus":0.02620430582951997,"score_gpt":0.2763898744956428,"score_spread":0.2501855686661228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078598924","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4952336,0.0009768336,0.0025356133,0.0005712284,0.0020771916,0.00010894836,0.0006718642,0.00036095697,0.49746376],"genre_scores_gemma":[0.9730654,0.001252832,0.013622467,0.0024430335,0.0032345585,0.0014221737,0.0013868132,0.0022042631,0.0013684713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9809097,0.0009282595,0.0039754836,0.003279582,0.005606773,0.0053001875],"domain_scores_gemma":[0.9830853,0.0045932126,0.0032742207,0.005740845,0.00044462617,0.0028618004],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0067913956,0.0019005759,0.00084829744,0.0014667226,0.0027004527,0.0035101532,0.0044643413,0.004332076,0.6967437],"category_scores_gemma":[0.0053911577,0.0036413881,0.0027867549,0.0026025528,0.0029893746,0.0030797054,0.004274885,0.0035716237,0.005065637],"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.0022756692,0.0008262601,0.00004384493,0.0046317833,0.0029308146,0.002780999,0.010972021,0.00064359955,0.00377585,0.58866477,0.3806501,0.0018042445],"study_design_scores_gemma":[0.0036120762,0.0026563124,0.0002105081,0.0036109353,0.0026861294,0.0021997772,0.0086271595,0.0596032,0.9071811,0.0012600882,0.004726546,0.0036261613],"about_ca_topic_score_codex":0.001466494,"about_ca_topic_score_gemma":0.002003147,"teacher_disagreement_score":0.90340525,"about_ca_system_score_codex":0.00005958005,"about_ca_system_score_gemma":0.002352449,"threshold_uncertainty_score":0.9997239},"labels":[],"label_agreement":null},{"id":"W2078953187","doi":"10.1016/s0012-365x(02)00749-5","title":"Further results on nearly Kirkman triple systems with subsystems","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Combinatorics; Triple system; Discrete mathematics; Steiner system; Pure mathematics","score_opus":0.01098084679741697,"score_gpt":0.19544290743097195,"score_spread":0.18446206063355497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078953187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5774221,0.00080315873,0.016344275,0.000035883422,0.0020035761,0.0017458391,0.00014335259,0.0012270563,0.40027475],"genre_scores_gemma":[0.99704814,0.0000063060306,0.00036479865,0.000008408032,0.00007509791,0.00008161066,0.00001201335,0.00010029217,0.0023033463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984233,0.000107754386,0.00051692803,0.00023130643,0.00034275575,0.000377985],"domain_scores_gemma":[0.9989109,0.00011574804,0.000112054266,0.0006925266,0.000041613537,0.0001271442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059947826,0.00031265194,0.00041416517,0.00010457041,0.00008523164,0.00014313355,0.00019742225,0.00011767221,0.000017845825],"category_scores_gemma":[0.000046739377,0.00022592215,0.00008764217,0.00027885067,0.000043834807,0.00010150999,0.0000066805255,0.00017786423,0.00027178202],"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.00022718903,0.0003010974,0.00037209716,0.0045596613,0.0008600508,0.00014684771,0.027535558,0.056078322,0.0022101526,0.8999563,0.0075724684,0.00018025766],"study_design_scores_gemma":[0.0299251,0.0051708617,0.00075106014,0.017003682,0.0011982443,0.0022232854,0.13422355,0.43544677,0.0336086,0.034982193,0.2928435,0.012623159],"about_ca_topic_score_codex":0.000008700226,"about_ca_topic_score_gemma":0.000007352713,"teacher_disagreement_score":0.8649741,"about_ca_system_score_codex":0.000043220964,"about_ca_system_score_gemma":0.00001182786,"threshold_uncertainty_score":0.9212838},"labels":[],"label_agreement":null},{"id":"W2079295608","doi":"10.1016/j.disc.2005.12.035","title":"Matrix partitions of perfect graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Matrix (chemical analysis); Discrete mathematics","score_opus":0.016787369410474616,"score_gpt":0.303388922085106,"score_spread":0.2866015526746314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079295608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085042074,0.0001580198,0.89746046,0.00019796823,0.00005895173,0.00023123527,0.000017024484,0.00015297817,0.016681265],"genre_scores_gemma":[0.8295329,0.000008029962,0.16980378,0.000008434562,0.000015307845,0.000021994923,0.000004709739,0.000012606894,0.00059219735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886364,0.000048481215,0.00030619302,0.00018607445,0.00033353854,0.0002620676],"domain_scores_gemma":[0.9988667,0.00020112465,0.000116352174,0.0006810752,0.00008427719,0.000050485538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031122917,0.00011169628,0.00018571637,0.00014858165,0.000090508845,0.000051733787,0.0006420438,0.00003564733,0.00003415083],"category_scores_gemma":[0.00005716052,0.000093398114,0.00012306326,0.0005641064,0.00013739272,0.00023862418,0.00016668376,0.00009424399,0.000055055254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012028825,0.00007350019,0.00021296668,0.000065983695,0.000007991365,0.0000037628395,0.000212199,0.00021649353,0.0022345916,0.9965227,0.000263663,0.000184949],"study_design_scores_gemma":[0.0001416927,0.000047968908,0.00028349957,0.00003326308,0.000006980282,0.000011224656,0.000066092536,0.014476091,0.008338638,0.9762294,0.00024313673,0.00012199164],"about_ca_topic_score_codex":0.000007668895,"about_ca_topic_score_gemma":0.000004399098,"teacher_disagreement_score":0.74449086,"about_ca_system_score_codex":0.0000122139145,"about_ca_system_score_gemma":0.000022953584,"threshold_uncertainty_score":0.38086644},"labels":[],"label_agreement":null},{"id":"W2079449107","doi":"10.1016/j.disc.2012.02.018","title":"Almost all cop-win graphs contain a universal vertex","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.03664615384126237,"score_gpt":0.3029478184586781,"score_spread":0.2663016646174157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079449107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91562814,0.000409302,0.008496595,0.00023290387,0.0010908007,0.0008606381,0.0001102257,0.0004360106,0.072735384],"genre_scores_gemma":[0.9706813,0.000044016677,0.027413035,0.00030092703,0.00012515491,0.000019570278,0.000024221994,0.000097012795,0.0012947319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978786,0.00012214643,0.0005237271,0.00025049565,0.00046659732,0.00075842015],"domain_scores_gemma":[0.99786353,0.0007002616,0.0002594323,0.0008059933,0.00007414144,0.000296666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073521596,0.0003956245,0.00053751294,0.00014505233,0.00026853336,0.000053166226,0.00043278618,0.00020399368,0.0004914752],"category_scores_gemma":[0.0004104892,0.00031050062,0.00029291576,0.00022955205,0.00022498051,0.0002852716,0.00025883655,0.00030053873,0.000075188356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022572554,0.00015676695,0.0010726887,0.00023089707,0.0001976035,0.000010151335,0.010873909,6.495973e-7,0.00014855646,0.98020613,0.006879218,0.00020087439],"study_design_scores_gemma":[0.0007886225,0.00007080748,0.00046406468,0.000118385346,0.00028826518,0.000067558394,0.0024370763,0.00047076997,0.00064312725,0.9854288,0.008654241,0.00056828966],"about_ca_topic_score_codex":0.000017212,"about_ca_topic_score_gemma":0.000008425587,"teacher_disagreement_score":0.07144065,"about_ca_system_score_codex":0.00006826408,"about_ca_system_score_gemma":0.00002471714,"threshold_uncertainty_score":0.99993473},"labels":[],"label_agreement":null},{"id":"W2079465187","doi":"10.1016/j.disc.2006.06.035","title":"Large forbidden trade volumes and edge packings of random graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Disjoint union (topology); Discrete mathematics; Graph; Pairwise comparison","score_opus":0.018677608037279168,"score_gpt":0.28845611920286046,"score_spread":0.26977851116558127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079465187","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9494697,0.00042797037,0.036842834,0.00006807303,0.00018344383,0.00049324485,0.00006148274,0.000101708625,0.012351575],"genre_scores_gemma":[0.97428983,0.00005254655,0.025256345,0.000057495294,0.000056526653,0.0000061543965,0.0000053714493,0.00005229834,0.00022340895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982767,0.000040975152,0.0006812712,0.0002224178,0.00035097156,0.0004276464],"domain_scores_gemma":[0.9980551,0.00096457754,0.00033683414,0.00047946768,0.000044693967,0.00011933384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014308055,0.00026262834,0.00058258115,0.00015900187,0.00019271563,0.00002953789,0.00025970725,0.00015662804,0.00006291204],"category_scores_gemma":[0.000481041,0.00019616717,0.00021664325,0.00019594324,0.00024023831,0.00010510926,0.00015153206,0.00018275602,0.0000013702495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005280759,0.00009261499,0.00093790493,0.00074885384,0.00011781553,0.000007491775,0.015757151,9.801549e-8,0.0004445613,0.98028475,0.0007271484,0.0008287832],"study_design_scores_gemma":[0.0015452086,0.00006362017,0.00073991646,0.00015054234,0.00015268501,0.000033099648,0.0036491253,0.00030440706,0.0035167863,0.9888994,0.00067856413,0.0002666143],"about_ca_topic_score_codex":0.000002140846,"about_ca_topic_score_gemma":0.000012484402,"teacher_disagreement_score":0.024820184,"about_ca_system_score_codex":0.000011262679,"about_ca_system_score_gemma":0.000010942342,"threshold_uncertainty_score":0.7999465},"labels":[],"label_agreement":null},{"id":"W2079678732","doi":"10.1016/j.disc.2013.05.023","title":"Dead ends in misère play: The misère monoid of canonical numbers","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Monoid; Integer (computer science); Combinatorics; Left and right; Dead end; Dead body; Discrete mathematics; Computer science","score_opus":0.023520981532640484,"score_gpt":0.2786696937595663,"score_spread":0.2551487122269258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079678732","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7971295,0.00020239808,0.17122222,0.0046434514,0.00031534422,0.00081861543,0.000008240936,0.00013054012,0.025529686],"genre_scores_gemma":[0.95989466,0.000011196553,0.039400745,0.00013316535,0.000030930885,0.000049293652,0.0000011135162,0.0000152145685,0.00046367865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984453,0.00006266492,0.0005599567,0.00024236544,0.00035539144,0.0003343238],"domain_scores_gemma":[0.99836284,0.00045295543,0.00018229791,0.00084489834,0.00008069401,0.00007631572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003330317,0.00016655301,0.00026336327,0.00006323679,0.00005468453,0.000105838735,0.001401642,0.00008550984,0.00011020747],"category_scores_gemma":[0.00020988578,0.000111285946,0.00010070083,0.0003547849,0.00019338717,0.00027833608,0.0002874781,0.00020126419,0.00021583235],"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.000008532086,0.0004818299,0.006404681,0.00029159192,0.00009793381,0.00003494134,0.07404746,0.0018333527,0.0051519894,0.86912066,0.0058295513,0.0366975],"study_design_scores_gemma":[0.00025788505,0.00015082161,0.0025740825,0.00034938497,0.000029501425,0.000048051705,0.008823411,0.6433593,0.048663735,0.29290375,0.0020783236,0.0007617589],"about_ca_topic_score_codex":0.0005566259,"about_ca_topic_score_gemma":0.000244378,"teacher_disagreement_score":0.6415259,"about_ca_system_score_codex":0.000040755887,"about_ca_system_score_gemma":0.00008551157,"threshold_uncertainty_score":0.45381093},"labels":[],"label_agreement":null},{"id":"W2079923544","doi":"10.1016/j.disc.2009.06.004","title":"Avoiding squares and overlaps over the natural numbers","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Natural number; Combinatorics; Discrete mathematics; Natural (archaeology); Geography","score_opus":0.00740418815523247,"score_gpt":0.23990761968987745,"score_spread":0.23250343153464498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079923544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8470048,0.0012383586,0.13860042,0.002460756,0.0003656257,0.00027799464,0.0000044620665,0.00036981518,0.009677775],"genre_scores_gemma":[0.9869852,0.000022579618,0.011952719,0.00076489965,0.000046368124,0.0000024484675,0.0000010851954,0.000006849211,0.00021783654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916834,0.000050504703,0.00016525413,0.0001846326,0.00021833957,0.00021294813],"domain_scores_gemma":[0.9991435,0.00028692553,0.00008007006,0.0004291149,0.000014875437,0.00004555131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041098834,0.00013167478,0.00013387158,0.000029392666,0.00026870813,0.00030013276,0.00053809024,0.000032583714,0.000010117782],"category_scores_gemma":[0.00009246508,0.000078886755,0.000056907626,0.0001449418,0.000053798998,0.00032237972,0.00013632499,0.000194219,0.000015009599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012948911,0.000020840176,0.00003065871,0.0000214037,0.000011800597,0.00000819306,0.0059360107,0.0000058768937,0.0009384969,0.982063,0.0011131335,0.009849291],"study_design_scores_gemma":[0.0004057645,0.000071859344,0.0075933645,0.00018067127,0.00002526607,0.00016533908,0.002087635,0.32896167,0.0015348054,0.65686786,0.0016295868,0.00047619504],"about_ca_topic_score_codex":0.000003959028,"about_ca_topic_score_gemma":9.498296e-7,"teacher_disagreement_score":0.3289558,"about_ca_system_score_codex":0.000013151729,"about_ca_system_score_gemma":0.000009595471,"threshold_uncertainty_score":0.32169086},"labels":[],"label_agreement":null},{"id":"W2079989676","doi":"10.1016/j.disc.2004.09.001","title":"A family of switch equivalent graphs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Graph; Discrete mathematics; Disjoint sets","score_opus":0.023447709108356495,"score_gpt":0.255370136399964,"score_spread":0.23192242729160747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079989676","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.0844811,0.00009200075,0.9038738,0.00016004064,0.00036964944,0.00014110212,0.0000019153088,0.000077623175,0.01080278],"genre_scores_gemma":[0.9586298,0.000010263396,0.041101716,0.00007090096,0.000029416353,0.00001006709,7.2972836e-7,0.000008471546,0.00013863435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990141,0.00001698105,0.0003681195,0.00016115443,0.00026103563,0.00017865073],"domain_scores_gemma":[0.9991877,0.00004006719,0.00015766603,0.0004883401,0.00007547444,0.000050751823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025611694,0.00010586982,0.00020879772,0.00007068977,0.0000473197,0.00005641038,0.00048983167,0.000044614786,0.0000063377643],"category_scores_gemma":[0.000018834391,0.00008228929,0.00012377837,0.00025086346,0.000029469285,0.00014279797,0.00011515882,0.00006639584,0.000033687862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010149759,0.000059301798,0.00002115318,0.00009264003,0.000021871547,0.0000040739887,0.002453094,0.00063936075,0.0012902063,0.9948311,0.00019386414,0.00039235546],"study_design_scores_gemma":[0.0012579584,0.00040474057,0.00037166633,0.0008481871,0.00003102145,0.00009966427,0.0017102435,0.109358065,0.008656941,0.87538344,0.0012839647,0.0005941234],"about_ca_topic_score_codex":0.0000266202,"about_ca_topic_score_gemma":0.0000042291,"teacher_disagreement_score":0.8741487,"about_ca_system_score_codex":0.000023752416,"about_ca_system_score_gemma":0.000028206308,"threshold_uncertainty_score":0.33556598},"labels":[],"label_agreement":null},{"id":"W2080042417","doi":"10.1016/j.disc.2007.12.043","title":"A survey of known results and research areas for<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si11.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math>-queens","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":179,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Diagonal; Simple (philosophy); Mathematics; Modular design; Discrete mathematics; Combinatorics; Computer science; Programming language; Geometry","score_opus":0.06173433587611936,"score_gpt":0.3231308080187126,"score_spread":0.2613964721425932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080042417","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9872834,0.00021743138,0.0073367255,0.00014980066,0.00043821393,0.0004468809,0.00062085973,0.00019583777,0.0033108157],"genre_scores_gemma":[0.941575,0.0003107534,0.056303047,0.000051061772,0.00033127054,0.0003744684,0.00023345248,0.0003522307,0.00046873232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99423164,0.00026148578,0.0018373914,0.000840927,0.001683274,0.0011452769],"domain_scores_gemma":[0.98911875,0.0066609024,0.0012790652,0.001966106,0.0005867795,0.0003883765],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036077786,0.00062725187,0.0008281555,0.00025610032,0.00073281524,0.00018880011,0.000945653,0.0006642284,0.000017760978],"category_scores_gemma":[0.011640772,0.0006594002,0.00045580234,0.0006674281,0.00086618616,0.00042564122,0.00089490536,0.00079698407,0.00016719772],"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.00040135035,0.0005169434,0.000018996809,0.0023540487,0.0002888475,0.00008281326,0.0050448,0.000056069854,0.00037596558,0.9891047,0.0016131639,0.00014232371],"study_design_scores_gemma":[0.0031103494,0.0011262876,0.0001226666,0.0017488151,0.0003852976,0.00032849694,0.0018613674,0.7361894,0.00823046,0.24501409,0.00090099836,0.0009817664],"about_ca_topic_score_codex":0.00015627535,"about_ca_topic_score_gemma":0.00015745168,"teacher_disagreement_score":0.7440906,"about_ca_system_score_codex":0.000051822004,"about_ca_system_score_gemma":0.00043348837,"threshold_uncertainty_score":0.99958575},"labels":[],"label_agreement":null},{"id":"W2080199983","doi":"10.1016/j.disc.2008.02.005","title":"A criterion for the half-plane property","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Matroid; Property (philosophy); Homogeneous; Plane (geometry); Polynomial; Combinatorics; Pure mathematics; Discrete mathematics; Mathematical analysis; Geometry","score_opus":0.03454349146865929,"score_gpt":0.25355978755827313,"score_spread":0.21901629608961384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080199983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008826504,0.000071446106,0.9862446,0.003170509,0.00020529673,0.00035280522,0.0000033624603,0.000110800414,0.0010146643],"genre_scores_gemma":[0.826785,0.00002507416,0.16936968,0.0005336578,0.00020847759,0.00010890722,0.000008449119,0.00001660816,0.0029440855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936646,0.000012493546,0.00016857625,0.00014496084,0.00014647467,0.00016100473],"domain_scores_gemma":[0.99933666,0.00020527715,0.0000652125,0.0003165703,0.000039657603,0.000036609796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001414738,0.00009071428,0.00010685067,0.000022757502,0.00026074544,0.00007775753,0.00047798376,0.00002324959,0.0000065432123],"category_scores_gemma":[0.00005469053,0.00004300915,0.00006334386,0.000103217106,0.000044699496,0.0001598938,0.00010038105,0.000047328926,0.000034645465],"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.000045525707,0.00048591866,0.000100583406,0.0006247868,0.00017663158,0.000052014842,0.04764957,0.0005468047,0.0051677707,0.690624,0.049707875,0.2048185],"study_design_scores_gemma":[0.000408028,0.000117179785,0.00037147535,0.00004393505,0.000015479307,0.00016518596,0.00009879072,0.93168414,0.0016828089,0.03777875,0.027397677,0.00023654499],"about_ca_topic_score_codex":0.000013261219,"about_ca_topic_score_gemma":0.0000027157607,"teacher_disagreement_score":0.9311373,"about_ca_system_score_codex":0.000011333156,"about_ca_system_score_gemma":0.00003216977,"threshold_uncertainty_score":0.20054695},"labels":[],"label_agreement":null},{"id":"W2080714423","doi":"10.1016/j.disc.2008.06.012","title":"Existence of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si3.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>r</mml:mi></mml:math>-fold perfect <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si4.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mi>K</mml:mi><mml:mo>,</mml:mo><mml:mn>1</mml:mn><mml:mo>)</mml:mo></mml:mrow></mml:math>-Mendelsohn designs with <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si5.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>K</mml:mi><mml:mo>⊆</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mn>4</mml:mn><mml:mo>,</mml:mo><mml:mn>5</mml:mn><mml:mo>,</mml:mo><mml:mn>6</mml:mn><mml:mo>,</mml:mo><mml:mn>7</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:math>","year":2008,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Combinatorics; Mathematics; Integer (computer science); Block (permutation group theory); Discrete mathematics; Computer science","score_opus":0.021037681548531122,"score_gpt":0.23780148741442605,"score_spread":0.21676380586589494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080714423","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8473517,0.009192137,0.006638147,0.0017856869,0.013025134,0.0010717135,0.008747551,0.0038026155,0.10838533],"genre_scores_gemma":[0.9257808,0.009425226,0.014029278,0.0050749145,0.01129922,0.01212481,0.011785829,0.009024174,0.0014558012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9308945,0.0041910126,0.015811836,0.013875608,0.017689306,0.017537741],"domain_scores_gemma":[0.9464475,0.011315487,0.016886832,0.013604463,0.0023953088,0.009350432],"candidate_categories":["metaresearch","metaepi_narrow","metaepi_broad","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.014814724,0.0103007015,0.004838853,0.0051571373,0.012843768,0.010761648,0.01737938,0.01756084,0.05010842],"category_scores_gemma":[0.010486105,0.017238738,0.01576103,0.009937222,0.013063959,0.010901802,0.013811487,0.014970366,0.0136170145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010726144,0.00382152,0.0000660877,0.010319707,0.014102629,0.008734633,0.009384538,0.013315366,0.012338481,0.7563635,0.15715235,0.0036750284],"study_design_scores_gemma":[0.012820267,0.010030075,0.00013386126,0.011374325,0.014193821,0.016361127,0.01128233,0.29914257,0.5860426,0.005725838,0.01845183,0.014441387],"about_ca_topic_score_codex":0.008558476,"about_ca_topic_score_gemma":0.0055937544,"teacher_disagreement_score":0.7506377,"about_ca_system_score_codex":0.00045947594,"about_ca_system_score_gemma":0.009651302,"threshold_uncertainty_score":0.9980436},"labels":[],"label_agreement":null},{"id":"W2080876227","doi":"10.1016/j.disc.2008.02.040","title":"Linear bound on extremal functions of some forbidden patterns in 0–1 matrices","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Matrix (chemical analysis); Upper and lower bounds; Discrete mathematics; Mathematical analysis","score_opus":0.02140650063974825,"score_gpt":0.22544171372958507,"score_spread":0.20403521308983683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080876227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.991876,0.00015894785,0.002972236,0.000008427557,0.00018068597,0.00014992454,0.000042413754,0.00009102398,0.004520353],"genre_scores_gemma":[0.999185,0.000049447357,0.00033031768,0.0000061121314,0.00006661559,0.000019619023,0.00000957539,0.00002941407,0.00030385656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992327,0.00001707195,0.00033180753,0.00009286704,0.00015422147,0.00017130193],"domain_scores_gemma":[0.9995657,0.00008167339,0.00005354635,0.00024799124,0.0000130677345,0.00003802222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011849132,0.00013152798,0.00023101695,0.0001449734,0.000041325668,0.000008387737,0.00012175612,0.00006400002,0.000053752483],"category_scores_gemma":[0.00001540739,0.000115255985,0.00008331581,0.00015394154,0.00003323121,0.00010083494,0.00001520357,0.000107612956,0.00006534494],"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.00025678013,0.0027568392,0.08173483,0.022913903,0.0014585031,0.00064435916,0.09928356,0.16504294,0.030819466,0.5843823,0.007717273,0.0029892572],"study_design_scores_gemma":[0.009208446,0.0018581129,0.06042753,0.008166518,0.0005608547,0.00079274765,0.036986537,0.61340743,0.062096324,0.19352648,0.0069415695,0.006027466],"about_ca_topic_score_codex":0.000008777611,"about_ca_topic_score_gemma":0.000010626775,"teacher_disagreement_score":0.44836447,"about_ca_system_score_codex":0.00001806735,"about_ca_system_score_gemma":0.0000060412895,"threshold_uncertainty_score":0.47000027},"labels":[],"label_agreement":null},{"id":"W2081110589","doi":"10.1016/j.disc.2015.01.034","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si6.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>{</mml:mo><mml:mn>0</mml:mn><mml:mo>,</mml:mo><mml:mn>2</mml:mn><mml:mo>}</mml:mo></mml:mrow></mml:math>-Degree free spanning forests in graphs","year":2015,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Honjo International Scholarship Foundation","keywords":"Combinatorics; Mathematics; Degree (music); Spanning tree; Minimum degree spanning tree; Connected dominating set; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.034849909263913265,"score_gpt":0.27708938093796787,"score_spread":0.2422394716740546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081110589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9045091,0.0032068712,0.026862767,0.0012122104,0.003759875,0.00047181427,0.0014868063,0.0010199624,0.05747054],"genre_scores_gemma":[0.958346,0.0011579306,0.031613197,0.0013061604,0.0021424755,0.0019535592,0.0011551626,0.0015773679,0.0007481469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97725224,0.0011643283,0.0045675333,0.0043077734,0.0068240482,0.0058840797],"domain_scores_gemma":[0.9822287,0.004033731,0.004135962,0.0059636384,0.00078448636,0.0028534802],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.006771366,0.0025769805,0.0014439982,0.0016871475,0.0027618436,0.0037017823,0.008415476,0.0035500014,0.004434233],"category_scores_gemma":[0.0059116394,0.003834382,0.0033042068,0.0039881347,0.00382963,0.004127075,0.0078644855,0.0045024254,0.0034623265],"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.001511111,0.000995591,0.00007405176,0.0026922326,0.0017981888,0.0022851366,0.008535788,0.0039513167,0.0017156888,0.9386195,0.034189407,0.0036320162],"study_design_scores_gemma":[0.0051772464,0.0032263175,0.00017399093,0.0045207837,0.0016819398,0.0024878078,0.0055896556,0.7563269,0.17230287,0.039976794,0.004193119,0.004342553],"about_ca_topic_score_codex":0.0012994212,"about_ca_topic_score_gemma":0.001989621,"teacher_disagreement_score":0.89864266,"about_ca_system_score_codex":0.00013250712,"about_ca_system_score_gemma":0.0024240608,"threshold_uncertainty_score":0.9988814},"labels":[],"label_agreement":null},{"id":"W2081444314","doi":"10.1016/j.disc.2011.02.005","title":"Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Nokia Foundation; Academy of Finland","keywords":"Triple system; Disjoint sets; Combinatorics; Isomorphism (crystallography); Mathematics; Order (exchange); Steiner system; Discrete mathematics; Pure mathematics; Crystallography","score_opus":0.024616523113820062,"score_gpt":0.2165696212181642,"score_spread":0.19195309810434413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081444314","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91149336,0.00527148,0.04577443,0.0000043533823,0.0018507236,0.0016900579,0.00020702042,0.00032422086,0.03338436],"genre_scores_gemma":[0.9974454,0.000044893037,0.0013142994,0.0000023083421,0.000045318076,0.000056660254,0.000010617759,0.00007305937,0.0010074357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821997,0.000083919476,0.0009128077,0.00019451737,0.00028561798,0.0003031911],"domain_scores_gemma":[0.99877167,0.00008943465,0.00028233088,0.00057371764,0.00015526553,0.0001275949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057919207,0.00028531003,0.0007719763,0.00016665107,0.000056826153,0.000044855213,0.0002661093,0.0001647566,0.00005991293],"category_scores_gemma":[0.000087009284,0.00023956649,0.00009887037,0.0004361448,0.00011498103,0.00014263767,0.000045004013,0.00012524061,0.000016581424],"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.00018513523,0.000661649,0.0047911447,0.062402673,0.00234994,0.000047396778,0.07813482,0.0058048023,0.02235888,0.81572723,0.007205741,0.00033058558],"study_design_scores_gemma":[0.011857407,0.00197421,0.0023276845,0.010412402,0.0020768752,0.00064002525,0.123602994,0.7761778,0.033582494,0.02115745,0.010868505,0.0053221504],"about_ca_topic_score_codex":0.00031203285,"about_ca_topic_score_gemma":0.000014452049,"teacher_disagreement_score":0.7945698,"about_ca_system_score_codex":0.000019204788,"about_ca_system_score_gemma":0.000022134458,"threshold_uncertainty_score":0.9769238},"labels":[],"label_agreement":null},{"id":"W2081625090","doi":"10.1016/j.disc.2014.03.006","title":"Edge-critical cops and robber in planar graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Graph; Vertex (graph theory); Discrete mathematics","score_opus":0.01873342575711553,"score_gpt":0.30105570400728,"score_spread":0.2823222782501645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081625090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039764285,0.00011747088,0.9481064,0.00097431755,0.000089107656,0.00019352279,0.0000036223455,0.00010581367,0.010645452],"genre_scores_gemma":[0.7838978,0.000018132385,0.21568942,0.00016539144,0.000020929345,0.000022223814,0.0000017286314,0.000018716088,0.00016565266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987692,0.00009612463,0.00023174072,0.00028194714,0.00026837832,0.00035259032],"domain_scores_gemma":[0.9985304,0.00074234494,0.000033396456,0.00052720815,0.000037510148,0.00012915253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063972134,0.00013028496,0.00020787395,0.00015529098,0.000073392446,0.00011380836,0.00052633265,0.000053399624,0.000010873662],"category_scores_gemma":[0.00049045176,0.000109160304,0.000036502548,0.0003308441,0.00020471656,0.0002749162,0.00020002112,0.0001869725,0.000039732837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022198683,0.000032205164,0.00040716128,0.00007330324,0.0000033689398,0.000008280392,0.00073144975,0.000005863801,0.00015912698,0.9967693,0.000083610386,0.001724096],"study_design_scores_gemma":[0.00022124691,0.000054810673,0.00044190386,0.000061491075,0.0000026145167,0.000023605167,0.00011480614,0.0564696,0.00025004704,0.9417648,0.00043642588,0.0001586483],"about_ca_topic_score_codex":0.0000019660627,"about_ca_topic_score_gemma":0.000006616778,"teacher_disagreement_score":0.74413353,"about_ca_system_score_codex":0.000011971614,"about_ca_system_score_gemma":0.000011477218,"threshold_uncertainty_score":0.4451428},"labels":[],"label_agreement":null},{"id":"W2081993715","doi":"10.1016/j.disc.2006.01.005","title":"Generating indecomposable permutations","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Indecomposable module; Mathematics; Combinatorics; Permutation (music); Transposition (logic); Parity of a permutation; Discrete mathematics; Cyclic permutation; Symmetric group; Geometry","score_opus":0.011048546643465667,"score_gpt":0.23843785035046883,"score_spread":0.22738930370700317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081993715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08733473,0.000033932363,0.8905056,0.00023996334,0.0000854761,0.00007482096,0.000002405566,0.00020788122,0.021515159],"genre_scores_gemma":[0.6620978,0.0000011292797,0.33739465,0.00009744198,0.00006640833,0.000012487663,0.0000060638968,0.000008685117,0.00031530886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992519,0.000027227043,0.00020945996,0.00016616825,0.00015855023,0.00018667319],"domain_scores_gemma":[0.9993806,0.00009438443,0.00007519342,0.00037864453,0.00003603894,0.000035143068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002031902,0.00010047227,0.000107465195,0.00007569426,0.00021752206,0.0002287362,0.00041714756,0.000030341043,0.000028576012],"category_scores_gemma":[0.000018490031,0.00008903362,0.00007727199,0.00030679416,0.00003173878,0.00023803128,0.0001023258,0.000068643094,0.000057533412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.4583446e-7,0.000041652245,0.00012935362,0.000015569663,0.0000057086386,0.0000028723186,0.00057376927,0.0010476935,0.0012718936,0.99574924,0.00053579663,0.000626181],"study_design_scores_gemma":[0.00013060182,0.000023569386,0.00017272767,0.000023161725,0.000008649985,0.000018505021,0.00012133054,0.33367875,0.0015200762,0.6631804,0.0009272437,0.00019499105],"about_ca_topic_score_codex":0.00000832696,"about_ca_topic_score_gemma":0.000006731415,"teacher_disagreement_score":0.5747631,"about_ca_system_score_codex":0.000010172363,"about_ca_system_score_gemma":0.000016502583,"threshold_uncertainty_score":0.36306858},"labels":[],"label_agreement":null},{"id":"W2082281988","doi":"10.1016/j.disc.2007.11.065","title":"The chromatic number of 5-valent circulants","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics; Chromatic scale; Degree (music); Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.050005829680336726,"score_gpt":0.3275820930475847,"score_spread":0.27757626336724794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082281988","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9670516,0.00005465316,0.0049277795,0.00016656413,0.00006127555,0.0004400739,0.000021696462,0.00009067189,0.027185656],"genre_scores_gemma":[0.98280346,0.00007208491,0.015880615,0.00001767633,0.000031316195,0.00007526484,0.0000038825483,0.00003325622,0.0010824694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986768,0.000054202697,0.0005583431,0.00013858822,0.00033189854,0.00024019492],"domain_scores_gemma":[0.9978437,0.00092467235,0.00031244667,0.0007803329,0.0000751926,0.000063657455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041762664,0.00016261527,0.00028834897,0.000025515472,0.0003840938,0.000015285488,0.00039339438,0.000057517784,0.00009557355],"category_scores_gemma":[0.00030995038,0.000103725186,0.00017561518,0.00020651447,0.00031956687,0.000050792813,0.00006924305,0.00011114126,0.00014575507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003157255,0.00016127246,0.00038835168,0.00023308505,0.000066803725,0.0000028276686,0.002418513,0.0000011228354,0.00045093964,0.99419093,0.0019898203,0.00009316813],"study_design_scores_gemma":[0.00020169187,0.000012534499,0.00039418915,0.0000884094,0.00006398911,0.00013904703,0.0007136024,0.0004738143,0.0029952514,0.9941901,0.0005777787,0.00014962378],"about_ca_topic_score_codex":0.0000019352515,"about_ca_topic_score_gemma":0.0000017476362,"teacher_disagreement_score":0.026103187,"about_ca_system_score_codex":0.000014963731,"about_ca_system_score_gemma":0.000027547727,"threshold_uncertainty_score":0.42297906},"labels":[],"label_agreement":null},{"id":"W2082570149","doi":"10.1016/j.disc.2006.03.068","title":"Linear transformations on codes","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Victoria","funders":"","keywords":"Hamming code; Linear code; Mathematics; Block code; Hamming distance; Discrete mathematics; Hamming weight; Expander code; Construct (python library); Hamming(7,4); Luby transform code; Reed–Muller code; Combinatorics; Algorithm; Decoding methods; Computer science","score_opus":0.009856434514622547,"score_gpt":0.2397584361478432,"score_spread":0.22990200163322067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082570149","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.04044465,0.0000080872505,0.9480578,0.0018951709,0.00008860511,0.0001336726,0.000008699377,0.0002290827,0.009134238],"genre_scores_gemma":[0.43538427,7.679213e-7,0.56388104,0.00032140428,0.00011150755,0.000009133856,0.0000056950994,0.000011780908,0.00027440282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992064,0.000014763032,0.00020446669,0.00015774716,0.00021777398,0.00019885263],"domain_scores_gemma":[0.9994226,0.00008975298,0.00004050861,0.00036239135,0.000027077263,0.000057659505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012608609,0.00011485607,0.00012516796,0.00008638401,0.00013721279,0.000098837016,0.00044179554,0.000027623117,0.0000046065],"category_scores_gemma":[0.000015981064,0.00008763702,0.00006181312,0.00026287668,0.00001552469,0.00007090481,0.00005403852,0.0000935773,0.00016484917],"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.0000015107872,0.00015848983,0.0000085290285,0.000057826408,0.000010624541,0.000008031854,0.0037220365,0.07612931,0.00036581763,0.9072099,0.0023308094,0.00999713],"study_design_scores_gemma":[0.000102322614,0.00007274266,0.00010915879,0.00005281961,0.0000031719737,0.000010313535,0.00002188134,0.9383397,0.0016345233,0.05612354,0.003375454,0.00015434275],"about_ca_topic_score_codex":0.0000063067105,"about_ca_topic_score_gemma":0.0000028585957,"teacher_disagreement_score":0.86221045,"about_ca_system_score_codex":0.000010430103,"about_ca_system_score_gemma":0.000013224048,"threshold_uncertainty_score":0.3573734},"labels":[],"label_agreement":null},{"id":"W2082662222","doi":"10.1016/j.disc.2011.10.010","title":"Existence of 2 SOLS and 2 ISOLS","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"University of New South Wales; University Research Committee, Emory University; Mount Saint Vincent University","keywords":"Mathematics; Latin square; Combinatorics; Order (exchange); Discrete mathematics; Chemistry","score_opus":0.02486804389908685,"score_gpt":0.1981370191634325,"score_spread":0.17326897526434565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082662222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82358414,0.0003722693,0.015125064,0.0000023910263,0.000116659896,0.00017183555,0.000013336032,0.00013214136,0.16048217],"genre_scores_gemma":[0.99246716,0.000019704668,0.007384623,0.0000027738265,0.000008528746,0.000007903825,6.7317615e-7,0.000014519678,0.00009410854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959725,0.000007798761,0.00018260634,0.000054470365,0.000060347596,0.000097544784],"domain_scores_gemma":[0.99971724,0.000026253507,0.00003292594,0.00017736528,0.000011875164,0.00003436577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010844135,0.000078357676,0.00014964888,0.000026775338,0.000014948127,0.000006167815,0.00008480608,0.00003423012,0.00004420353],"category_scores_gemma":[0.000011459724,0.000065501765,0.00003193118,0.000052321364,0.00005155458,0.00005078815,0.000016307209,0.00003874393,0.000013188349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055128467,0.000040553678,0.00054050126,0.002046537,0.00009192763,0.000005840147,0.023459272,0.000017462971,0.008405382,0.96439075,0.00013914143,0.0008571218],"study_design_scores_gemma":[0.000760568,0.00023021837,0.002290239,0.0011149518,0.00015679856,0.00011417181,0.013053517,0.036692932,0.11919941,0.8243383,0.001038268,0.0010106051],"about_ca_topic_score_codex":0.0000021520252,"about_ca_topic_score_gemma":8.1161267e-7,"teacher_disagreement_score":0.16888304,"about_ca_system_score_codex":0.0000023130524,"about_ca_system_score_gemma":0.0000020383634,"threshold_uncertainty_score":0.26710844},"labels":[],"label_agreement":null},{"id":"W2083261017","doi":"10.1016/j.disc.2008.06.011","title":"Hamiltonicity in vertex envelopes of plane cubic graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Montréal; Texas A and M University","keywords":"Bipartite graph; Combinatorics; Mathematics; Hamiltonian path problem; Cubic graph; Vertex (graph theory); Discrete mathematics; Pancyclic graph; Hamiltonian path; Foster graph; 1-planar graph; Line graph; Graph; Graph power; Voltage graph","score_opus":0.030867328028344927,"score_gpt":0.2816540099414354,"score_spread":0.2507866819130905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083261017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77567095,0.00023895576,0.21499404,0.00011689189,0.000081915176,0.00032682,0.000011088364,0.000101190904,0.008458169],"genre_scores_gemma":[0.9071171,0.00011754845,0.09249038,0.000026879776,0.0000038142755,0.000013985701,0.0000028141235,0.000012766119,0.00021466285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985486,0.000065886125,0.00038578414,0.00024909212,0.0004218114,0.00032881755],"domain_scores_gemma":[0.99874765,0.00030356945,0.00011670443,0.0007012303,0.000055723118,0.0000751242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037520012,0.00014316065,0.00030135884,0.00024640662,0.00007067541,0.000016627442,0.001004874,0.000054044525,0.00002124807],"category_scores_gemma":[0.00016014243,0.000121654135,0.00007660831,0.0007254299,0.00022228603,0.00027315438,0.00028278216,0.00017694279,0.000033672655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013613085,0.0002218949,0.0031087007,0.00021203942,0.000026515514,0.00009730751,0.0067931493,0.00016464698,0.0033665027,0.98473126,0.00018833956,0.0010760329],"study_design_scores_gemma":[0.0008362832,0.00015852923,0.006287708,0.0002214757,0.0000055398286,0.00011915731,0.00028856768,0.036921654,0.03202592,0.9224803,0.00022128732,0.00043361494],"about_ca_topic_score_codex":0.000013416446,"about_ca_topic_score_gemma":0.000011861673,"teacher_disagreement_score":0.13144621,"about_ca_system_score_codex":0.000024390101,"about_ca_system_score_gemma":0.00005909342,"threshold_uncertainty_score":0.4960912},"labels":[],"label_agreement":null},{"id":"W2084708927","doi":"10.1016/s0012-365x(03)00284-x","title":"Minimum embedding of balanced P4-designs into 5-cycle systems","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Università di Catania","keywords":"Mathematics; Embedding; Combinatorics; Discrete mathematics; Value (mathematics); Computer science; Statistics","score_opus":0.012596166783818169,"score_gpt":0.2365351013061136,"score_spread":0.22393893452229544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084708927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7832224,0.0010941391,0.1545815,0.000004980231,0.0009182243,0.0005125383,0.000018941098,0.0003608843,0.059286427],"genre_scores_gemma":[0.9957725,0.000012250014,0.0039334144,0.0000027925314,0.000028711042,0.000032477907,0.0000035134497,0.000049367703,0.00016500524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989153,0.00005968551,0.00047208162,0.00012331059,0.00018715621,0.00024244924],"domain_scores_gemma":[0.9992948,0.00012199735,0.000096203235,0.00038059932,0.000032882468,0.000073502284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038770854,0.00018838988,0.00037950516,0.0000804458,0.000049228704,0.000034090397,0.00017074302,0.00008994627,0.00003552822],"category_scores_gemma":[0.00006546428,0.00016919148,0.00010138682,0.0001927489,0.000041985284,0.00008630674,0.000012586528,0.000090579495,0.000041949777],"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.000009835154,0.000115320196,0.00031404907,0.008078599,0.00037245595,0.000015299362,0.01729053,0.07440533,0.13766384,0.7606216,0.00096752006,0.00014562478],"study_design_scores_gemma":[0.0013677719,0.0001538016,0.000048235597,0.0020030285,0.00018968091,0.000090634494,0.019728407,0.779579,0.08690315,0.10586338,0.0026882356,0.0013847068],"about_ca_topic_score_codex":0.0000044855656,"about_ca_topic_score_gemma":0.0000010240568,"teacher_disagreement_score":0.7051736,"about_ca_system_score_codex":0.000026981137,"about_ca_system_score_gemma":0.000008633184,"threshold_uncertainty_score":0.68994284},"labels":[],"label_agreement":null},{"id":"W2085045539","doi":"10.1016/j.disc.2008.01.023","title":"Measure preserving homomorphisms and independent sets in tensor graph powers","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Amirkabir University of Technology","keywords":"Mathematics; Homomorphism; Measure (data warehouse); Tensor (intrinsic definition); Discrete mathematics; Graph; Combinatorics; Upper and lower bounds; Pure mathematics; Mathematical analysis; Data mining; Computer science","score_opus":0.03993079443253282,"score_gpt":0.2781595298436143,"score_spread":0.23822873541108147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085045539","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9860052,0.0003264025,0.0016914472,0.00012042692,0.00014595385,0.0005133297,0.00002587569,0.000110216635,0.01106119],"genre_scores_gemma":[0.97766346,0.00010189255,0.02171569,0.000077851364,0.00003188667,0.000028386385,0.0000043587706,0.000062959116,0.0003135469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980172,0.00009612563,0.00055901863,0.00034448018,0.00055631646,0.0004268748],"domain_scores_gemma":[0.99852777,0.00040942538,0.00020363578,0.0006437822,0.00007385121,0.00014156036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060589676,0.00032472078,0.00051272905,0.00023457216,0.00029641486,0.00003918169,0.00037382854,0.0001904939,0.000091757785],"category_scores_gemma":[0.0005545279,0.00025372958,0.00012938205,0.0002645432,0.00025970477,0.00016411107,0.00028803875,0.0003609263,0.0000049695964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000756511,0.00036110074,0.022121172,0.001155539,0.0002515252,0.0004138674,0.056680724,0.00002670202,0.00046427286,0.91596586,0.0019739016,0.0005096817],"study_design_scores_gemma":[0.00085554784,0.00005586714,0.008335775,0.00023580636,0.00005548742,0.00033801232,0.0021380696,0.00074735284,0.00033380568,0.9864043,0.000068206115,0.00043179796],"about_ca_topic_score_codex":0.000012247442,"about_ca_topic_score_gemma":0.000026189084,"teacher_disagreement_score":0.07043841,"about_ca_system_score_codex":0.00003742871,"about_ca_system_score_gemma":0.000025690655,"threshold_uncertainty_score":0.9999915},"labels":[],"label_agreement":null},{"id":"W2085599297","doi":"10.1016/j.disc.2006.03.060","title":"Canonical forms of shift-invariant maps on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">[</mml:mo><mml:mi mathvariant=\"double-struck\">N</mml:mi><mml:msup><mml:mrow><mml:mo stretchy=\"false\">]</mml:mo></mml:mrow><mml:mrow><mml:mo>∞</mml:mo></mml:mrow></mml:msup></mml:math>","year":2006,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Invariant (physics); Scroll; Combinatorics; Discrete mathematics; Algorithm; Mathematical physics; Theology","score_opus":0.019047662760679134,"score_gpt":0.2542959365121355,"score_spread":0.23524827375145638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085599297","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7903921,0.0014149399,0.0054865587,0.001107145,0.0027326355,0.00026182024,0.001924263,0.0006340436,0.19604649],"genre_scores_gemma":[0.97587436,0.001108673,0.013308355,0.0012408838,0.0025338726,0.0015724655,0.0019934846,0.0017499392,0.0006179667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9814256,0.0008424548,0.0051239827,0.0033150113,0.004520215,0.004772749],"domain_scores_gemma":[0.9834028,0.004585201,0.005338072,0.004443905,0.00042344056,0.0018065918],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.003950024,0.0023682392,0.0013779245,0.0009697342,0.0025453272,0.00179743,0.0043164766,0.005420461,0.055530775],"category_scores_gemma":[0.0032616053,0.003723324,0.0037342003,0.0017279977,0.003868941,0.0021873298,0.0034016736,0.0039409203,0.0034793888],"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.0031595272,0.0013555741,0.000017212255,0.004392309,0.003372015,0.0022167193,0.0056472323,0.0026726215,0.0015862955,0.9352095,0.039152376,0.0012186031],"study_design_scores_gemma":[0.007197095,0.0043406426,0.000060222497,0.004584153,0.0055078487,0.004066919,0.009567723,0.21684703,0.6531962,0.087444834,0.0023708476,0.004816494],"about_ca_topic_score_codex":0.001881481,"about_ca_topic_score_gemma":0.0018763079,"teacher_disagreement_score":0.8477647,"about_ca_system_score_codex":0.00008597759,"about_ca_system_score_gemma":0.0024719965,"threshold_uncertainty_score":0.9992388},"labels":[],"label_agreement":null},{"id":"W2086013184","doi":"10.1016/j.disc.2010.12.006","title":"The quasi order of graphs on an ordinal","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Discrete mathematics; Order (exchange)","score_opus":0.053423251499947096,"score_gpt":0.305496046871558,"score_spread":0.2520727953716109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086013184","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87034816,0.00007483492,0.0076016216,0.000058029233,0.00043859362,0.0005439627,0.00003725559,0.00014428637,0.12075324],"genre_scores_gemma":[0.9545577,0.000024793511,0.04479291,0.00004843176,0.000041869505,0.000019741447,0.000002921203,0.000053997483,0.00045761504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985259,0.00010565243,0.0005091017,0.0001921004,0.00037347837,0.00029375317],"domain_scores_gemma":[0.99786544,0.0005927735,0.00030569156,0.0010146998,0.00013589248,0.00008550925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071987626,0.00022878604,0.00031978596,0.0000737864,0.00035681995,0.000025989933,0.0006027419,0.00009704544,0.00015153774],"category_scores_gemma":[0.00047185106,0.00012569217,0.00015700636,0.00022036945,0.0003334304,0.00008128723,0.000106649306,0.00019077225,0.0000082380875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004579589,0.00021186913,0.00010581731,0.000104749655,0.00007196717,0.0000026067923,0.008428253,3.5061467e-7,0.000036373844,0.9897998,0.0002721244,0.0009203189],"study_design_scores_gemma":[0.0002048287,0.00034014328,0.00017738991,0.00006026215,0.000067162844,0.000010442922,0.0021026372,0.0002917584,0.0015077,0.99483585,0.00022304503,0.00017877332],"about_ca_topic_score_codex":0.0000071586983,"about_ca_topic_score_gemma":0.000013588632,"teacher_disagreement_score":0.12029563,"about_ca_system_score_codex":0.00000947257,"about_ca_system_score_gemma":0.000019246485,"threshold_uncertainty_score":0.5125578},"labels":[],"label_agreement":null},{"id":"W2086234498","doi":"10.1016/s0012-365x(02)00466-1","title":"Bicolour graphs of Steiner triple systems","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Discrete mathematics; Graph","score_opus":0.010595045897118486,"score_gpt":0.20264115917750886,"score_spread":0.19204611328039037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086234498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8625928,0.0017845604,0.019437842,0.0000049474697,0.0014130145,0.0006449404,0.000048090493,0.0003631601,0.11371061],"genre_scores_gemma":[0.9984107,0.000016579444,0.0007922486,0.000002558312,0.000014206465,0.000032675198,0.0000033491237,0.000039310897,0.0006883978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906117,0.000051756128,0.0004186992,0.00009359105,0.00017159058,0.0002031948],"domain_scores_gemma":[0.99941707,0.00006372277,0.00007787151,0.00034571203,0.00003405812,0.00006154736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003552006,0.00015823776,0.00032790637,0.00010244674,0.000031489413,0.000024215271,0.00013825363,0.0000797185,0.000041483712],"category_scores_gemma":[0.000043004606,0.00013069111,0.000114348986,0.00025767795,0.000036589798,0.00006012295,0.000007986398,0.000080379126,0.00003591213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002339986,0.000045239332,0.00018684438,0.0015616344,0.00012619235,0.000003895324,0.0012833951,0.0033040787,0.006754176,0.98569757,0.0010005722,0.00003403979],"study_design_scores_gemma":[0.0066138166,0.00073461194,0.00044127027,0.0034912322,0.00087017554,0.00047070262,0.044476766,0.25364697,0.15241899,0.45906302,0.07320899,0.0045634755],"about_ca_topic_score_codex":0.0000025166385,"about_ca_topic_score_gemma":9.812654e-7,"teacher_disagreement_score":0.5266346,"about_ca_system_score_codex":0.00001162752,"about_ca_system_score_gemma":0.0000068202517,"threshold_uncertainty_score":0.5329429},"labels":[],"label_agreement":null},{"id":"W2086492126","doi":"10.1016/s0012-365x(03)00041-4","title":"Weighted graphs with all Hamiltonian cycles of the same length","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Combinatorics; Hamiltonian (control theory); Undirected graph; Hamiltonian path; Discrete mathematics; Directed graph; Simple (philosophy); Characterization (materials science); Indifference graph; Pancyclic graph; Graph; Chordal graph; 1-planar graph","score_opus":0.02701261443584759,"score_gpt":0.2765974889872433,"score_spread":0.2495848745513957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086492126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9642108,0.000050335293,0.0049804,0.0003185583,0.000046469853,0.0007062986,0.000045817953,0.000103272956,0.029538035],"genre_scores_gemma":[0.9343656,0.000011673947,0.06474461,0.000078257195,0.000007968936,0.00006114727,0.0000033161232,0.000049419104,0.00067805534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986984,0.000111395784,0.0004195074,0.00019584766,0.00031491206,0.0002599186],"domain_scores_gemma":[0.99815136,0.00040522934,0.00032831077,0.00096814294,0.000077337034,0.00006959013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040495204,0.0002251611,0.00032377982,0.00006214324,0.00015888215,0.000025484072,0.00040183312,0.00007843847,0.00008678569],"category_scores_gemma":[0.00015812664,0.00012836093,0.00017316338,0.0003975245,0.0002891319,0.00006311852,0.00004374978,0.00016878048,0.0000134091015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044406006,0.00018719507,0.00029251154,0.00015994589,0.0000964398,6.4636015e-7,0.0020632148,0.0000020729985,0.000814944,0.99612635,0.00021094405,0.000041319272],"study_design_scores_gemma":[0.00030127168,0.000034783574,0.00023377492,0.00013288081,0.00016805566,0.000021202215,0.001237601,0.00011884652,0.010697206,0.98556536,0.0012949789,0.00019401895],"about_ca_topic_score_codex":0.0000034315274,"about_ca_topic_score_gemma":0.00002602102,"teacher_disagreement_score":0.05976421,"about_ca_system_score_codex":0.0000124920625,"about_ca_system_score_gemma":0.000033072996,"threshold_uncertainty_score":0.52344066},"labels":[],"label_agreement":null},{"id":"W2086629303","doi":"10.1016/j.disc.2005.03.005","title":"Supersolvable LL-lattices of binary trees","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Binary number; Discrete mathematics; Binary tree; Arithmetic","score_opus":0.04033738929752605,"score_gpt":0.3223062354964241,"score_spread":0.28196884619889806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086629303","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92223847,0.00049260777,0.028925993,0.00066495116,0.00049314636,0.0012505959,0.00006599447,0.00063726056,0.045230985],"genre_scores_gemma":[0.6226249,0.000035925874,0.37516928,0.000031500134,0.00019847891,0.000043421875,0.0000067288797,0.000116403906,0.0017733668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971867,0.00006190113,0.0011537076,0.00034344973,0.000716435,0.00053779996],"domain_scores_gemma":[0.9966598,0.0012324796,0.0006351727,0.0011192331,0.00019492662,0.00015836085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005790587,0.00043462572,0.00089723716,0.00018486298,0.00012788046,0.0000465536,0.00067473424,0.00018216402,0.00035026748],"category_scores_gemma":[0.001082566,0.00037118114,0.0002727128,0.000399673,0.00020934334,0.00044303745,0.00022562906,0.00024406599,0.00012731834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002570526,0.0010469358,0.000073583564,0.0014601222,0.00016542905,0.0000087231865,0.0069679115,0.00015608649,0.00940346,0.97779644,0.0022032924,0.0006922991],"study_design_scores_gemma":[0.0011413192,0.0002414308,0.00002436642,0.0005305518,0.00027475427,0.00003021507,0.003332914,0.013530769,0.028644487,0.9494124,0.0021561512,0.00068061793],"about_ca_topic_score_codex":0.000003890804,"about_ca_topic_score_gemma":0.000012883185,"teacher_disagreement_score":0.3462433,"about_ca_system_score_codex":0.00008929288,"about_ca_system_score_gemma":0.000057744262,"threshold_uncertainty_score":0.999874},"labels":[],"label_agreement":null},{"id":"W2087041390","doi":"10.1016/s0012-365x(00)00021-2","title":"On the blocking sets in S(3,6,22) and S(4,7,23)","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Blocking (statistics); Combinatorics; Discrete mathematics; Statistics","score_opus":0.008277703968288011,"score_gpt":0.20151276103660234,"score_spread":0.19323505706831434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087041390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9464417,0.00012639911,0.000105424966,0.000047716774,0.000045381224,0.00014886633,0.00000463824,0.000081561586,0.0529983],"genre_scores_gemma":[0.9994592,0.000026146256,0.00012287077,0.000036341356,0.000013714632,0.000018822251,0.0000014787009,0.000021707749,0.00029971288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994708,0.0000260668,0.00017218881,0.000080298545,0.00009471775,0.00015596507],"domain_scores_gemma":[0.9995831,0.0001593152,0.000014302378,0.00021124247,0.0000034303212,0.00002859057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023304757,0.0001132392,0.0001310556,0.000036988553,0.000045860306,0.00003704477,0.00010240153,0.00004259746,0.00022493118],"category_scores_gemma":[0.000015583806,0.00007549044,0.000029705623,0.000106440624,0.000029191016,0.000035146175,0.000008695091,0.00011637569,0.00009656408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021989295,0.00010207286,0.0005092581,0.001006344,0.0001307844,0.000050586306,0.02577381,0.014046985,0.001290599,0.94301355,0.0025214949,0.011532538],"study_design_scores_gemma":[0.00095406576,0.00009660282,0.0012818367,0.0015080337,0.000051357252,0.00010069768,0.0045389254,0.37533286,0.0027474265,0.6078654,0.0045632385,0.00095956755],"about_ca_topic_score_codex":0.0000017737942,"about_ca_topic_score_gemma":0.000004523735,"teacher_disagreement_score":0.36128587,"about_ca_system_score_codex":0.000009560371,"about_ca_system_score_gemma":0.0000015522205,"threshold_uncertainty_score":0.3078411},"labels":[],"label_agreement":null},{"id":"W2087893738","doi":"10.1016/s0012-365x(01)00257-6","title":"Stirling numbers interpolation using permutations with forbidden subsequences","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Stirling numbers of the first kind; Interpolation (computer graphics); Stirling number; Stirling numbers of the second kind; Discrete mathematics; Artificial intelligence; Computer science","score_opus":0.09971105842266578,"score_gpt":0.3382802443469355,"score_spread":0.2385691859242697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087893738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3685034,0.00006055324,0.6125412,0.0001128133,0.00023327718,0.00075372955,0.000018142016,0.00037286835,0.017404031],"genre_scores_gemma":[0.6026757,0.0000067261867,0.39658287,0.00001644458,0.000085811465,0.000032966866,0.0000049207774,0.00008844935,0.0005061529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978222,0.000055670545,0.00070988125,0.00033554924,0.00061661,0.00046008316],"domain_scores_gemma":[0.9976198,0.0007183577,0.0007054562,0.00062350684,0.000193449,0.00013945211],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027814825,0.00038224255,0.0005034472,0.0001503102,0.0002876738,0.0001431616,0.0003569014,0.00011940978,0.00041610963],"category_scores_gemma":[0.0008340932,0.0003101958,0.00012466373,0.00045462052,0.00016629687,0.0005113462,0.00008151456,0.00025309925,0.00008217634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014971396,0.00040291337,0.0002211222,0.0008942321,0.00020296163,0.000036187288,0.022554336,0.00054363103,0.0020054043,0.97240895,0.000351954,0.00036334893],"study_design_scores_gemma":[0.00058565877,0.00010140622,0.000004397902,0.0005435025,0.00023060036,0.00012758031,0.0063311975,0.2003634,0.00071255997,0.79039764,0.000068559784,0.0005334816],"about_ca_topic_score_codex":0.000009387872,"about_ca_topic_score_gemma":0.00002088084,"teacher_disagreement_score":0.23417227,"about_ca_system_score_codex":0.00013758404,"about_ca_system_score_gemma":0.000028524117,"threshold_uncertainty_score":0.99993503},"labels":[],"label_agreement":null},{"id":"W2088306445","doi":"10.1016/j.disc.2012.01.002","title":"Characterizations of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-copwin graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Scroll; Vertex (graph theory); Combinatorics; Order (exchange); Discrete mathematics; Graph","score_opus":0.026386083277995066,"score_gpt":0.26777340620684853,"score_spread":0.24138732292885345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088306445","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90415955,0.00012568168,0.09211306,0.0002582363,0.00077529036,0.000100019104,0.00007140129,0.00017845251,0.0022183023],"genre_scores_gemma":[0.9648077,0.00009887088,0.034151968,0.0002706589,0.0002681119,0.00011345958,0.00007347574,0.00008865562,0.00012713253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701476,0.0000674685,0.00094130426,0.0004527894,0.00079670205,0.0007269916],"domain_scores_gemma":[0.99707824,0.0004514927,0.0007440669,0.0013581499,0.000109390494,0.00025865922],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00069302955,0.0003494198,0.00030849263,0.00015553094,0.00034879954,0.00029882614,0.0012587397,0.00030103367,0.00006082356],"category_scores_gemma":[0.0004716904,0.00037340896,0.00039357535,0.000533569,0.00034913849,0.00107035,0.00070291996,0.00032332688,0.00093247526],"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.000014294304,0.00022408582,0.000059720438,0.00024745532,0.00010285217,0.00001548895,0.005876377,0.00014825225,0.0032592628,0.98892653,0.00017978196,0.0009458833],"study_design_scores_gemma":[0.00012277601,0.0001442813,0.0001357857,0.00030597343,0.00011093408,0.000068110836,0.0007374701,0.95575094,0.033174742,0.008161669,0.00089597836,0.00039130688],"about_ca_topic_score_codex":0.0000540798,"about_ca_topic_score_gemma":0.000021576352,"teacher_disagreement_score":0.98076487,"about_ca_system_score_codex":0.000015201002,"about_ca_system_score_gemma":0.00014691011,"threshold_uncertainty_score":0.9998718},"labels":[],"label_agreement":null},{"id":"W2088390361","doi":"10.1016/s0012-365x(00)00190-4","title":"On nice graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; North Atlantic Treaty Organization","keywords":"Mathematics; Combinatorics; Nice; Discrete mathematics; Computer science","score_opus":0.02756542105570989,"score_gpt":0.3109214902902431,"score_spread":0.28335606923453316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088390361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04225252,0.00004802522,0.89249766,0.00055597344,0.0001098615,0.00020730351,0.0000022742356,0.00027040156,0.064055994],"genre_scores_gemma":[0.81595474,0.000066218934,0.17989711,0.00052191917,0.000035669527,0.000045042478,0.000003131318,0.00004001652,0.003436163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998673,0.000047464706,0.0002017957,0.0002784236,0.00044111305,0.00035818986],"domain_scores_gemma":[0.99842155,0.00035033518,0.00006944453,0.0009900002,0.000052916144,0.000115745366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003509444,0.00014276613,0.00015585902,0.00014941768,0.00012355203,0.000113536575,0.0010970606,0.0000411968,0.0000533232],"category_scores_gemma":[0.00017117687,0.00011369626,0.00008825027,0.0006320559,0.00007462353,0.00026944416,0.00021646521,0.00016939144,0.0004474412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004259157,0.000058272257,0.000033211185,0.000014929178,0.00000896836,0.000026980953,0.0004548148,0.000053951364,0.00016061525,0.99637747,0.00030238755,0.002504133],"study_design_scores_gemma":[0.00017099113,0.00008689113,0.00005553151,0.000033964727,0.000002490246,0.000030749907,0.00007099976,0.02119623,0.00059934345,0.97637904,0.0012147008,0.0001590637],"about_ca_topic_score_codex":0.0000010165735,"about_ca_topic_score_gemma":0.0000012802702,"teacher_disagreement_score":0.7737022,"about_ca_system_score_codex":0.000020606898,"about_ca_system_score_gemma":0.000016265212,"threshold_uncertainty_score":0.5751101},"labels":[],"label_agreement":null},{"id":"W2088429527","doi":"10.1016/j.disc.2007.07.033","title":"A generalised upper bound for the k-tuple domination number","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Tuple; Upper and lower bounds; Domination analysis; Degree (music); Graph; Discrete mathematics; Vertex (graph theory)","score_opus":0.029152086963418405,"score_gpt":0.34070622518997407,"score_spread":0.31155413822655564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088429527","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.015011345,0.000050477913,0.9790643,0.0007667853,0.00014531375,0.00056295376,0.000005625149,0.00008142516,0.0043118102],"genre_scores_gemma":[0.37679234,0.000014523811,0.61881965,0.00034701047,0.00017223507,0.0001454726,0.000008584734,0.000040168572,0.0036600125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987423,0.000027268123,0.0002646088,0.00021903781,0.00035826935,0.00038852755],"domain_scores_gemma":[0.99790466,0.0010850859,0.00010287391,0.00069891027,0.0001385919,0.000069900496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015398427,0.00012551299,0.00013319313,0.00005734252,0.00029650173,0.00020072726,0.00087573915,0.000047123805,0.000031790572],"category_scores_gemma":[0.00025477377,0.00008035619,0.00011529153,0.00032840064,0.00010493353,0.0002927022,0.00016796339,0.00010157185,0.00006292943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000105305935,0.00003305005,0.000047491885,0.000035310484,0.000020718793,0.0000018834229,0.0015210037,0.000027268805,0.0010288889,0.9922586,0.0005508601,0.004464356],"study_design_scores_gemma":[0.00063593365,0.000040857005,0.00024623124,0.000023624933,0.000017016044,0.000023474357,0.00072366965,0.18553683,0.0096976515,0.7933127,0.009494248,0.0002477479],"about_ca_topic_score_codex":0.0000035226694,"about_ca_topic_score_gemma":0.000009183401,"teacher_disagreement_score":0.361781,"about_ca_system_score_codex":0.00005638431,"about_ca_system_score_gemma":0.000025993038,"threshold_uncertainty_score":0.32768303},"labels":[],"label_agreement":null},{"id":"W2088696758","doi":"10.1016/s0012-365x(99)00384-2","title":"Diffraction from visible lattice points and kth power free integers","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":79,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Diffraction; Lattice (music); Point (geometry); Combinatorics; Dimension (graph theory); Discrete mathematics; Geometry; Physics; Quantum mechanics","score_opus":0.010126028754151422,"score_gpt":0.22893661980495023,"score_spread":0.2188105910507988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088696758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98627305,0.00019598898,0.000452246,0.00037100352,0.00012689784,0.000115768446,0.00008236002,0.000070553775,0.012312121],"genre_scores_gemma":[0.982261,0.000051238178,0.016461562,0.0002176051,0.000059304748,0.0000058777982,0.000009153565,0.000023959466,0.0009102939],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991291,0.000033813103,0.00022186677,0.00020879481,0.00021108204,0.00019535066],"domain_scores_gemma":[0.99938524,0.000090235015,0.000071541086,0.00035612594,0.00002128822,0.00007557375],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013611068,0.00014802178,0.00019173365,0.000020562418,0.0001194754,0.00018022193,0.00019904402,0.00006486369,0.007843526],"category_scores_gemma":[0.000070402566,0.00010375094,0.000038737908,0.000052387484,0.0000955852,0.00024263731,0.00007288012,0.0000903669,0.00024591046],"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.0006296195,0.00038576103,0.0008703918,0.0007550498,0.00018668306,0.00005560358,0.05140187,0.00008844442,0.87288773,0.03888337,0.010813402,0.023042053],"study_design_scores_gemma":[0.0022310955,0.000496119,0.007935154,0.00064108643,0.00023209087,0.000086006774,0.007143087,0.0069895852,0.16706564,0.76607656,0.03950639,0.0015972063],"about_ca_topic_score_codex":0.00020902717,"about_ca_topic_score_gemma":0.00002052963,"teacher_disagreement_score":0.7271932,"about_ca_system_score_codex":0.00001774095,"about_ca_system_score_gemma":0.000008321083,"threshold_uncertainty_score":0.99306345},"labels":[],"label_agreement":null},{"id":"W2089397652","doi":"10.1016/j.disc.2014.06.020","title":"Firefighting on square, hexagonal, and triangular grids","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Ryerson University","keywords":"Vertex (graph theory); Combinatorics; Mathematics; Conjecture; Square tiling; Square (algebra); Multiplicative function; Grid; Hexagonal crystal system; Discrete mathematics; Graph; Geometry; Mathematical analysis; Crystallography","score_opus":0.011190456765124372,"score_gpt":0.2579566958760887,"score_spread":0.24676623911096435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089397652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.598246,0.00006995272,0.2999989,0.00031269965,0.000058465866,0.0003361464,0.000021418631,0.00022150626,0.10073492],"genre_scores_gemma":[0.9874047,0.0000017058534,0.011826106,0.00005461736,0.00027701212,0.00002029753,0.00002779895,0.000024777793,0.00036297645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991687,0.000039501672,0.00024887928,0.00019152004,0.00016231825,0.00018908495],"domain_scores_gemma":[0.99926585,0.00018862975,0.00012256889,0.0003325615,0.000025813202,0.00006456387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026634822,0.00016143003,0.00026951073,0.00005420002,0.000117084805,0.00007749663,0.00012895865,0.000026452051,0.0002219466],"category_scores_gemma":[0.000019697984,0.00013093368,0.0001081503,0.00011215456,0.000037578633,0.00004553377,0.00006892643,0.000108211076,0.000029644723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058813253,0.000120345045,0.0028027499,0.0000639421,0.00010826603,7.057227e-7,0.0006789852,0.00003548017,0.00016953102,0.96813834,0.0029889545,0.024886832],"study_design_scores_gemma":[0.0011891513,0.00033148352,0.0013023658,0.0005187207,0.00033034754,0.0000033481197,0.0011055743,0.27169198,0.0049243085,0.67323756,0.044245318,0.0011198595],"about_ca_topic_score_codex":0.000013467925,"about_ca_topic_score_gemma":8.2444114e-7,"teacher_disagreement_score":0.38915873,"about_ca_system_score_codex":0.000008432768,"about_ca_system_score_gemma":0.0000055807927,"threshold_uncertainty_score":0.5339321},"labels":[],"label_agreement":null},{"id":"W2089708856","doi":"10.1016/j.disc.2005.09.045","title":"Combinatorial pseudo-triangulations","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University; National Science Foundation","keywords":"Mathematics; Triangulation; Combinatorics; Property (philosophy); Plane (geometry); Graph; Planar graph; Planar; Combinatorial proof; Combinatorial algorithms; Discrete mathematics; Geometry; Computer science","score_opus":0.00530349729458748,"score_gpt":0.19845867172203693,"score_spread":0.19315517442744945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089708856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58947974,0.00014495853,0.26208243,0.00012626428,0.0011184051,0.00031173788,0.00003482939,0.0008544637,0.14584717],"genre_scores_gemma":[0.98638594,0.000004089607,0.013180692,0.000002809137,0.00018105832,0.0000051132465,0.000060101644,0.000017642586,0.00016258082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954695,0.0000041371013,0.00018444484,0.00005747403,0.000106982945,0.000099994024],"domain_scores_gemma":[0.9997842,0.00002159863,0.000025319769,0.00012502512,0.000023515302,0.000020358164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000030659452,0.00008289835,0.00011340258,0.000040717012,0.000047112695,0.00004032719,0.000059906193,0.000038552025,0.00012438348],"category_scores_gemma":[0.0000074883974,0.000069216905,0.000058054604,0.00015516093,0.000012166715,0.00006182119,0.000008473121,0.000039018974,0.00003390286],"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.0000011746056,0.000022322922,0.00021142009,0.00008018664,0.00005165507,0.000001872203,0.00023587806,0.33491603,0.0014210512,0.6598644,0.0027646103,0.0004293888],"study_design_scores_gemma":[0.00022146788,0.0000045466422,0.0007043054,0.00001094232,0.00004971844,0.0000036357267,0.00004470947,0.8580172,0.0011639206,0.13921341,0.0004075974,0.00015854459],"about_ca_topic_score_codex":0.000007182709,"about_ca_topic_score_gemma":0.0000035262528,"teacher_disagreement_score":0.52310115,"about_ca_system_score_codex":0.00001944928,"about_ca_system_score_gemma":0.0000023056843,"threshold_uncertainty_score":0.28225836},"labels":[],"label_agreement":null},{"id":"W2089778934","doi":"10.1016/j.disc.2015.01.024","title":"On the spectrum and number of convex sets in graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics; Cograph; Split graph; Block graph; Convex set; Vertex (graph theory); Line graph; Graph; Regular polygon; Pathwidth; Convex optimization","score_opus":0.038613218446952,"score_gpt":0.32228538706123816,"score_spread":0.2836721686142862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089778934","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9073059,0.000054700708,0.06954367,0.0017412843,0.00006481046,0.0003548049,0.000005360581,0.00004256459,0.020886926],"genre_scores_gemma":[0.9854563,0.0000072703638,0.014357717,0.00006692279,0.0000029708779,0.0000095731575,3.8114305e-7,0.000007891548,0.000090960784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991033,0.00007628006,0.00018154694,0.0001478842,0.00030709474,0.00018391051],"domain_scores_gemma":[0.99887353,0.0004491394,0.000070519985,0.0005091693,0.00003113509,0.0000665055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007126437,0.00008831753,0.00015337433,0.000066812936,0.000026960723,0.00003767013,0.0004989179,0.000026999516,0.000012481201],"category_scores_gemma":[0.00022409073,0.000054782686,0.000028433818,0.00035059924,0.00015859303,0.00011690503,0.00020607136,0.00012879164,0.000029901841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042824104,0.000028621831,0.0006400407,0.000020743319,0.000005013819,0.000004669909,0.002301572,0.000010501045,0.000023640863,0.9967085,0.00009268706,0.00015969711],"study_design_scores_gemma":[0.00019030266,0.000041020954,0.00021774945,0.000040055464,0.0000012733253,0.000011536009,0.00039479093,0.016560901,0.00086859125,0.9815822,0.000024272736,0.00006729144],"about_ca_topic_score_codex":0.0000040791037,"about_ca_topic_score_gemma":0.000004311613,"teacher_disagreement_score":0.07815043,"about_ca_system_score_codex":0.0000119104125,"about_ca_system_score_gemma":0.000022393106,"threshold_uncertainty_score":0.22339731},"labels":[],"label_agreement":null},{"id":"W2090014573","doi":"10.1016/j.disc.2006.06.046","title":"When is a partial Latin square uniquely completable, but not its completable product?","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Latin square; Mathematics; Combinatorics; Product (mathematics); Class (philosophy); Square (algebra); Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.03146294528738935,"score_gpt":0.23948568130272163,"score_spread":0.20802273601533228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090014573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8301565,0.00068829395,0.11722138,0.0002869648,0.0008797693,0.0017361235,0.00037175714,0.0013210356,0.0473382],"genre_scores_gemma":[0.99200857,0.000007837946,0.006313656,0.00010347484,0.0001482573,0.000038629492,0.000032845594,0.00009359777,0.0012531386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980186,0.000043597076,0.00067494216,0.00027407086,0.00036774363,0.00062103005],"domain_scores_gemma":[0.9988904,0.00013536528,0.00011698461,0.0006021999,0.00009095791,0.00016410826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076780724,0.0003416862,0.0004964839,0.00011267685,0.00015171674,0.00009972775,0.00032684425,0.000101931546,0.00039598712],"category_scores_gemma":[0.00005465381,0.00031424724,0.00014227704,0.00025104027,0.00006391118,0.00018326199,0.00006032071,0.00024366229,0.00034110015],"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.00017137143,0.0005797856,0.0013352258,0.012932987,0.0010764204,0.00016117633,0.057038352,0.006696816,0.12596825,0.7591202,0.032923393,0.0019959845],"study_design_scores_gemma":[0.0021830956,0.0002286888,0.0009552139,0.0012363249,0.0003610239,0.00013354044,0.0058094757,0.3179127,0.49190405,0.09813605,0.07817218,0.0029676515],"about_ca_topic_score_codex":0.000015590651,"about_ca_topic_score_gemma":0.00001529905,"teacher_disagreement_score":0.66098416,"about_ca_system_score_codex":0.000040692827,"about_ca_system_score_gemma":0.0000132627265,"threshold_uncertainty_score":0.999931},"labels":[],"label_agreement":null},{"id":"W2090123683","doi":"10.1016/j.disc.2011.03.009","title":"The order of hypotraceable oriented graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"University of South Africa","keywords":"Mathematics; Digraph; Combinatorics; Order (exchange); Graph; Discrete mathematics","score_opus":0.03619054761954036,"score_gpt":0.28107950846148855,"score_spread":0.2448889608419482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090123683","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.022898857,0.00017026908,0.94336635,0.00010357296,0.00013978971,0.00030132473,0.0000037596249,0.00010767092,0.032908395],"genre_scores_gemma":[0.40276736,0.00008190448,0.5952071,0.000032613458,0.00001080558,0.000045049856,0.0000012415229,0.000029500756,0.001824447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987744,0.000058639424,0.00030129048,0.00018072745,0.00036672343,0.0003182082],"domain_scores_gemma":[0.99824727,0.00030397114,0.0001498268,0.0010218236,0.00020789182,0.000069200236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060585333,0.000114282935,0.00015418848,0.00007319799,0.00018189079,0.000037759215,0.001228543,0.000034607685,0.000026001075],"category_scores_gemma":[0.0002602581,0.000069515416,0.00007448986,0.0007856718,0.0002535787,0.00023493022,0.00031153284,0.00012499592,0.000036962727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005670282,0.000053689808,0.000086261796,0.000026382744,0.000021374173,0.0000025427723,0.002396605,0.0000037595973,0.00029608898,0.99547154,0.00007379364,0.0015623177],"study_design_scores_gemma":[0.00016514791,0.0000805278,0.00013695809,0.000025923993,0.000006510955,0.000008556938,0.0006026886,0.01158068,0.0108319335,0.97559106,0.00084473565,0.00012528317],"about_ca_topic_score_codex":0.0000048552297,"about_ca_topic_score_gemma":0.0000038992985,"teacher_disagreement_score":0.3798685,"about_ca_system_score_codex":0.000008165823,"about_ca_system_score_gemma":0.000034149834,"threshold_uncertainty_score":0.28347564},"labels":[],"label_agreement":null},{"id":"W2090259579","doi":"10.1016/j.disc.2003.11.022","title":"Latin Squares with Self-Orthogonal Conjugates","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Latin square; Mathematics; Idempotence; Combinatorics; Orthogonal array; Conjugate; Transpose; Graph; Idempotent matrix; Discrete mathematics; Order (exchange); Eigenvalues and eigenvectors; Statistics","score_opus":0.005529690822069073,"score_gpt":0.18325978756344172,"score_spread":0.17773009674137263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090259579","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9702733,0.00013394108,0.012499921,0.00002740821,0.00008516846,0.00019530409,0.000017007005,0.0006441028,0.016123846],"genre_scores_gemma":[0.9903967,0.0000070207916,0.009384713,0.000013397126,0.00004150675,0.00002511728,0.000009093088,0.00004297231,0.000079516125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993214,0.000009149934,0.00020438289,0.00010059873,0.00015987668,0.00020459345],"domain_scores_gemma":[0.99961615,0.000041702704,0.000035300123,0.00022046594,0.00002105643,0.00006534664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000097206634,0.00016749173,0.00019066969,0.000059528484,0.000056608875,0.00004550979,0.00011630592,0.000051383333,0.00003947714],"category_scores_gemma":[0.000007218039,0.00012452321,0.000051618856,0.00016170199,0.00003810348,0.000078550096,0.0000118202925,0.000095695286,0.000098922756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012680379,0.00010656042,0.0015676414,0.0013275843,0.00029668346,0.00003819135,0.013347454,0.032164488,0.0019579611,0.94892186,0.00013458075,0.00012429297],"study_design_scores_gemma":[0.007881157,0.0010425182,0.005712398,0.0035697012,0.0006534187,0.00043799923,0.022224544,0.074710995,0.0707392,0.80089676,0.0075818887,0.0045494107],"about_ca_topic_score_codex":0.0000018971266,"about_ca_topic_score_gemma":0.000009514405,"teacher_disagreement_score":0.14802511,"about_ca_system_score_codex":0.000019746909,"about_ca_system_score_gemma":0.0000106303405,"threshold_uncertainty_score":0.5077909},"labels":[],"label_agreement":null},{"id":"W2090338574","doi":"10.1016/j.disc.2008.07.031","title":"Spanning cubic graph designs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Cubic graph; Combinatorics; Mathematics; Graph; Discrete mathematics; Symmetric graph; Line graph; Voltage graph","score_opus":0.03203451386966064,"score_gpt":0.21934337109967816,"score_spread":0.18730885723001753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090338574","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77378833,0.0005559421,0.16289443,0.000013484894,0.00031246664,0.00024041667,0.00001226752,0.0008211656,0.061361484],"genre_scores_gemma":[0.99520415,0.00003732349,0.0042606397,0.000014522846,0.000046559544,0.000021505606,0.0000062413383,0.000047686433,0.00036135977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992368,0.000018836117,0.0002456266,0.00010175651,0.00015015343,0.00024679673],"domain_scores_gemma":[0.999507,0.00008102893,0.000032969183,0.00028782955,0.00001549382,0.00007569143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014039857,0.00016312643,0.00021115065,0.000084455496,0.0001152223,0.000019318624,0.00016027168,0.00006320525,0.00006540857],"category_scores_gemma":[0.00002246885,0.00014544824,0.00010570655,0.00019947572,0.000057202367,0.00009153969,0.000015706844,0.00011232438,0.00024362197],"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.00003118321,0.0003731105,0.0063038827,0.0051517133,0.0012425645,0.0006964534,0.08469257,0.038329646,0.11255783,0.7208081,0.02850777,0.0013052174],"study_design_scores_gemma":[0.0035935899,0.00043602876,0.0036983322,0.002292334,0.0004385084,0.0029429423,0.016260196,0.42975876,0.08627044,0.41627273,0.031691924,0.006344206],"about_ca_topic_score_codex":0.0000012415236,"about_ca_topic_score_gemma":6.376852e-7,"teacher_disagreement_score":0.39142913,"about_ca_system_score_codex":0.000012774634,"about_ca_system_score_gemma":0.0000051566303,"threshold_uncertainty_score":0.5931207},"labels":[],"label_agreement":null},{"id":"W2090735384","doi":"10.1016/j.disc.2009.06.034","title":"Blocking numbers and fixing numbers of convex bodies","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Peking University","keywords":"Mathematics; Blocking (statistics); Combinatorics; Regular polygon; Discrete mathematics; Geometry; Statistics","score_opus":0.04043078438145104,"score_gpt":0.32279426921063,"score_spread":0.28236348482917895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090735384","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92754686,0.00056166394,0.013622847,0.00049261126,0.00011432366,0.00034078636,0.00004463545,0.00017148348,0.057104763],"genre_scores_gemma":[0.95948523,0.0000860651,0.039249785,0.000090250694,0.00006730392,0.0000051722545,0.0000047669314,0.000024772347,0.0009866373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985298,0.000024048613,0.00060548325,0.00018982794,0.0003408136,0.0003100109],"domain_scores_gemma":[0.99852175,0.00063831586,0.000352273,0.00029908036,0.000111502006,0.00007708888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048145026,0.00022317121,0.0005387921,0.00014556256,0.00010262364,0.000057846202,0.00017326989,0.00008926729,0.00005658118],"category_scores_gemma":[0.0009345695,0.00018792198,0.00010238259,0.00022587454,0.00011162514,0.00016127387,0.000065088534,0.00012767155,0.0000052786354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002540776,0.000257352,0.00085688086,0.004234744,0.00019987443,0.000016475406,0.04548143,0.0000075397693,0.0007470879,0.9434507,0.0023542366,0.0023683035],"study_design_scores_gemma":[0.0005034222,0.00012671672,0.00013105474,0.0005733724,0.00013844341,0.00004545146,0.013331914,0.0009809962,0.0044396967,0.9787582,0.00057071715,0.0004000119],"about_ca_topic_score_codex":0.000018783547,"about_ca_topic_score_gemma":0.000007801586,"teacher_disagreement_score":0.056118123,"about_ca_system_score_codex":0.000018964154,"about_ca_system_score_gemma":0.000023360408,"threshold_uncertainty_score":0.7663236},"labels":[],"label_agreement":null},{"id":"W2090816779","doi":"10.1016/j.disc.2009.10.001","title":"A note on the rank parity function","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Mathematics; Parity (physics); Combinatorics; Rank (graph theory); Discrete mathematics","score_opus":0.04614618136873212,"score_gpt":0.32470854157232665,"score_spread":0.27856236020359454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090816779","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.07951369,0.000105442676,0.61857265,0.010130566,0.0005251914,0.0023616084,0.000040360344,0.0012417157,0.2875088],"genre_scores_gemma":[0.9252041,0.000027579597,0.06424793,0.0014096939,0.00030254858,0.00010209059,0.000009005359,0.00010041275,0.00859667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978947,0.000083598265,0.000610243,0.00029604987,0.0006720167,0.00044339008],"domain_scores_gemma":[0.9965396,0.0019361614,0.00028518916,0.0010375795,0.000096558186,0.000104936385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007297705,0.0003491684,0.00045930385,0.00007692103,0.0003033424,0.00013903713,0.0004357647,0.00012595588,0.00037229742],"category_scores_gemma":[0.0023831727,0.000215316,0.00023370709,0.00025005243,0.00014075157,0.00019571105,0.00006862767,0.00038535194,0.00044566285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022809449,0.00024459,0.0000017111676,0.00012737577,0.000027388447,0.0000047656254,0.0011230437,0.000007570683,0.00028951745,0.9921331,0.0055622985,0.0004558667],"study_design_scores_gemma":[0.00027314154,0.00016763328,0.000047720423,0.00019760712,0.00011225262,0.000011095581,0.0006098452,0.002182133,0.0012190056,0.9939562,0.00094968156,0.0002736977],"about_ca_topic_score_codex":0.0000012124827,"about_ca_topic_score_gemma":0.00000455498,"teacher_disagreement_score":0.84569037,"about_ca_system_score_codex":0.000072499875,"about_ca_system_score_gemma":0.000023058732,"threshold_uncertainty_score":0.87803316},"labels":[],"label_agreement":null},{"id":"W2091988189","doi":"10.1016/j.disc.2008.04.063","title":"Edge-disjoint spanners in tori","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Torus; Spanner; Enhanced Data Rates for GSM Evolution; Graph; Discrete mathematics; Geometry; Computer science","score_opus":0.03796996279367364,"score_gpt":0.2981838599308869,"score_spread":0.26021389713721327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091988189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10096381,0.00014524734,0.874518,0.00069757074,0.00021328745,0.0003561295,0.0000032768548,0.00022466772,0.022878047],"genre_scores_gemma":[0.7457818,0.00005768075,0.25220445,0.00010448783,0.000053253487,0.000041717576,0.000002506957,0.000028435317,0.0017256809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855196,0.00005334883,0.00029932338,0.00028989153,0.00039418903,0.00041125467],"domain_scores_gemma":[0.99882054,0.00016279497,0.0000709859,0.0007838953,0.000048503978,0.000113294926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036890747,0.00014720389,0.00021945931,0.00017974131,0.00009905104,0.00004430048,0.0009239742,0.00004868325,0.00002509717],"category_scores_gemma":[0.00017987835,0.00012533103,0.00007402635,0.00062051514,0.00013318416,0.00037010407,0.00032766594,0.0001976729,0.00016822427],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006142926,0.00014694293,0.0008271617,0.00007720155,0.000013046736,0.00020590369,0.008279333,0.00029832814,0.0006639198,0.9869362,0.0006759735,0.0018698137],"study_design_scores_gemma":[0.0009637244,0.00016444793,0.0019095058,0.00015662948,0.0000046933815,0.00022767163,0.00097442506,0.12023889,0.006002111,0.86571217,0.0028858017,0.0007599593],"about_ca_topic_score_codex":0.000005386507,"about_ca_topic_score_gemma":0.0000059134163,"teacher_disagreement_score":0.644818,"about_ca_system_score_codex":0.00006023956,"about_ca_system_score_gemma":0.00005206732,"threshold_uncertainty_score":0.5110851},"labels":[],"label_agreement":null},{"id":"W2092204243","doi":"10.1016/j.disc.2009.12.012","title":"Broadcasts and domination in trees","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.01369033957713226,"score_gpt":0.2972594238184539,"score_spread":0.2835690842413216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092204243","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6669501,0.000030961604,0.32775226,0.0004017486,0.00008084933,0.00019062991,0.0000014330059,0.00006156597,0.0045304596],"genre_scores_gemma":[0.84500676,0.000006734866,0.15476406,0.000015780122,0.000011791281,0.000012259152,6.474325e-7,0.000006480459,0.00017550155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993189,0.000023458962,0.00014527878,0.0001681609,0.00017453951,0.00016964221],"domain_scores_gemma":[0.9993458,0.00017685587,0.00004240039,0.0003544025,0.000027554246,0.000052996016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003979992,0.00007566375,0.00010246714,0.0001311594,0.00004109658,0.00008954077,0.00035672414,0.000038563667,0.000009060094],"category_scores_gemma":[0.00017772474,0.000062923136,0.00001820327,0.00024442954,0.00007835823,0.0003270052,0.00017569057,0.00017094483,0.000015693784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020153761,0.0000365832,0.0005243512,0.000028775868,0.0000023760872,0.000008020205,0.002379443,0.0000058552305,0.010425405,0.96186805,0.00001269569,0.024706407],"study_design_scores_gemma":[0.00041363997,0.00003739799,0.005166532,0.00003166796,0.0000017595486,0.00003258575,0.00019526601,0.12815544,0.004696957,0.86079687,0.00029620522,0.00017570217],"about_ca_topic_score_codex":0.0000022038703,"about_ca_topic_score_gemma":0.0000566657,"teacher_disagreement_score":0.17805666,"about_ca_system_score_codex":0.0000067265396,"about_ca_system_score_gemma":0.000011053469,"threshold_uncertainty_score":0.25659308},"labels":[],"label_agreement":null},{"id":"W2092855545","doi":"10.1016/s0012-365x(01)00251-5","title":"Shifted quasi-symmetric functions and the Hopf algebra of peak functions","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Hopf algebra; Symmetric function; Quotient; Combinatorics; Subalgebra; Schubert polynomial; Pure mathematics; Algebra over a field","score_opus":0.03567777624807792,"score_gpt":0.27016336014146,"score_spread":0.23448558389338206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092855545","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.30348608,0.0029957935,0.50364155,0.004293997,0.0023661198,0.0053030145,0.00027885372,0.0012871568,0.17634743],"genre_scores_gemma":[0.9461538,0.00016369614,0.044116464,0.00005191336,0.00019730233,0.0002135857,0.00001101626,0.00015714247,0.008935075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973137,0.00015580725,0.0010913769,0.00034116476,0.0006626206,0.00043535078],"domain_scores_gemma":[0.9940306,0.003687149,0.0007004319,0.0012064785,0.00022957746,0.00014578833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006650358,0.00041144804,0.00086420705,0.00027491682,0.00035555995,0.000082141676,0.00044439835,0.00016524285,0.00034790294],"category_scores_gemma":[0.0037687744,0.0002797874,0.0002856663,0.0011334193,0.00056923286,0.00021870119,0.00024127078,0.00038075531,0.00012640185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021407393,0.00070559,0.000021339569,0.0005316815,0.00017471204,0.0000029339224,0.0035492117,0.0000039345146,0.00004062291,0.9913692,0.0027980006,0.0007813865],"study_design_scores_gemma":[0.0023012473,0.00019004021,0.000019625515,0.00016437778,0.00052013516,0.00007208303,0.0040909327,0.018045308,0.000108678556,0.9731739,0.00093936303,0.0003742845],"about_ca_topic_score_codex":0.000008152631,"about_ca_topic_score_gemma":0.000007855161,"teacher_disagreement_score":0.6426677,"about_ca_system_score_codex":0.00005488326,"about_ca_system_score_gemma":0.000019729003,"threshold_uncertainty_score":0.9999654},"labels":[],"label_agreement":null},{"id":"W2093085368","doi":"10.1016/s0012-365x(02)00757-4","title":"Idempotents for derangement numbers","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Derangement; Mathematics; Symmetric group; Combinatorics; Mathematical proof; Group (periodic table); Generating function; Function (biology); Discrete mathematics","score_opus":0.09211082856488614,"score_gpt":0.34019823681360245,"score_spread":0.2480874082487163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093085368","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.04260665,0.00025970524,0.895229,0.001146277,0.0015003954,0.0042064604,0.00010273609,0.001014845,0.053933956],"genre_scores_gemma":[0.18314421,0.000047334157,0.80822057,0.00020295139,0.00034664889,0.000628418,0.00001450181,0.00027354722,0.0071218545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99752355,0.000037221984,0.00085792516,0.00038288286,0.00057360384,0.00062480423],"domain_scores_gemma":[0.9971964,0.001132626,0.0004232154,0.0008953846,0.00017078086,0.00018164379],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004447345,0.00041666982,0.00063262566,0.000099126984,0.00022872943,0.000086395805,0.0005041649,0.00014902111,0.0003903445],"category_scores_gemma":[0.0015819205,0.00037037165,0.0003005548,0.00022612257,0.000084197454,0.00020674891,0.00013112328,0.00017013667,0.00021254893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001063407,0.0006259394,0.000019920999,0.0012381135,0.00015936815,0.000007103328,0.0033989286,0.000012336831,0.00024205186,0.9671787,0.025996672,0.0011102355],"study_design_scores_gemma":[0.0012550178,0.00010211774,0.0000017856543,0.00017242468,0.00016022277,0.00001665452,0.0006875944,0.013700794,0.0010053209,0.97579336,0.0066246004,0.00048007924],"about_ca_topic_score_codex":0.0000011099714,"about_ca_topic_score_gemma":0.0000027090762,"teacher_disagreement_score":0.14053755,"about_ca_system_score_codex":0.00012303753,"about_ca_system_score_gemma":0.000010122115,"threshold_uncertainty_score":0.99987483},"labels":[],"label_agreement":null},{"id":"W2093094658","doi":"10.1016/j.disc.2008.06.028","title":"Isonemal prefabrics with only parallel axes of symmetry","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Design Education and Practice","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Weaving; Combinatorics; Symmetry (geometry); Order (exchange); Discrete mathematics; Geometry","score_opus":0.022786645087648827,"score_gpt":0.24649249607275464,"score_spread":0.22370585098510581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093094658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6081685,0.00046537982,0.22042955,0.00017795071,0.00022718556,0.00036401275,0.000023310093,0.00034588022,0.16979824],"genre_scores_gemma":[0.92049646,0.00010850587,0.077955365,0.000029135263,0.000035487214,0.000008799314,0.000007138082,0.000036924677,0.0013221543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993664,0.000013199425,0.00021402154,0.00007713914,0.00018944747,0.00013976249],"domain_scores_gemma":[0.99943507,0.00014584989,0.00007112616,0.00024798125,0.000043105578,0.000056886754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093318245,0.00011815043,0.00017849109,0.00005510085,0.000037630045,0.000012096958,0.000117741474,0.000044369106,0.00010707071],"category_scores_gemma":[0.00005656484,0.000095002986,0.00003555891,0.0001786062,0.000049256258,0.00013564677,0.000011024852,0.00010459091,0.00005915656],"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.00033002923,0.0033197657,0.02529354,0.01418069,0.00259099,0.000224379,0.14763653,0.04595096,0.009575539,0.60833365,0.12960269,0.012961247],"study_design_scores_gemma":[0.011358175,0.0026882503,0.07334893,0.003034124,0.0022109332,0.006964843,0.051293172,0.53453994,0.058592346,0.040700015,0.20582625,0.0094430465],"about_ca_topic_score_codex":0.0000038032695,"about_ca_topic_score_gemma":0.000002213883,"teacher_disagreement_score":0.5676336,"about_ca_system_score_codex":0.000014289726,"about_ca_system_score_gemma":0.00004099547,"threshold_uncertainty_score":0.38741094},"labels":[],"label_agreement":null},{"id":"W2093448135","doi":"10.1016/s0012-365x(00)00166-7","title":"On generalized constraints and certificates","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Calgary","keywords":"Mathematics; Boolean function; Boolean expression; Permutation (music); Constant (computer programming); Discrete mathematics; Parity function; Set (abstract data type); Complete Boolean algebra; Maximum satisfiability problem; Boolean network; Two-element Boolean algebra; Product term; Standard Boolean model; Combinatorics; And-inverter graph; Algebra over a field; Computer science; Pure mathematics","score_opus":0.02833773675154287,"score_gpt":0.2662817561944066,"score_spread":0.23794401944286372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093448135","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.1365429,0.000099586374,0.8492246,0.0011200733,0.000079965845,0.00013210451,0.0000020859056,0.00016261211,0.012636029],"genre_scores_gemma":[0.8856231,0.000042945834,0.1135916,0.00034314595,0.000018015615,0.000008316136,0.0000017070653,0.000007703454,0.00036346485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993471,0.000015773463,0.00014676891,0.00019594863,0.00012307815,0.0001713205],"domain_scores_gemma":[0.9994277,0.0001127708,0.000055857457,0.0003182932,0.000016988253,0.0000684304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000826278,0.00010621468,0.00013131357,0.000035804784,0.000076821714,0.00008423157,0.00025593946,0.00003053235,0.000042884298],"category_scores_gemma":[0.00005427833,0.00007798274,0.000037610178,0.00010862519,0.000095692914,0.00011804026,0.00007540843,0.0000577413,0.00006497286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016383731,0.000029990599,0.00003817731,0.000012072353,0.000008057644,0.000017040713,0.00051817874,0.000023477425,0.00044471378,0.9899907,0.00014918686,0.008766741],"study_design_scores_gemma":[0.0003330145,0.00006551841,0.00019757176,0.00003431228,0.000007157513,0.000085553074,0.000102147285,0.044106487,0.0011385307,0.9527902,0.0009189729,0.00022055008],"about_ca_topic_score_codex":5.487221e-7,"about_ca_topic_score_gemma":3.9512645e-7,"teacher_disagreement_score":0.7490802,"about_ca_system_score_codex":0.000007306614,"about_ca_system_score_gemma":0.000006493547,"threshold_uncertainty_score":0.3180044},"labels":[],"label_agreement":null},{"id":"W2093495451","doi":"10.1016/s0012-365x(99)00300-3","title":"On P4-transversals of perfect graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Transversal (combinatorics); Conjecture; Graph; Discrete mathematics; Induced subgraph; Chordal graph; Split graph; 1-planar graph","score_opus":0.017158800873379818,"score_gpt":0.28878315858051556,"score_spread":0.2716243577071357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093495451","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55009186,0.00010723505,0.37003985,0.00029054546,0.00007719574,0.000484731,0.00002129137,0.00023470762,0.078652576],"genre_scores_gemma":[0.94766897,0.000044181867,0.051391546,0.000061444895,0.000008069178,0.00001402535,0.000001794113,0.00001950756,0.0007904417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986577,0.00007043089,0.000273678,0.00024639565,0.00046215742,0.0002896298],"domain_scores_gemma":[0.99857754,0.00037027037,0.0000655794,0.0008553926,0.000045230176,0.00008600153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038394512,0.00014599433,0.00023666471,0.0001348225,0.000072251096,0.000041430838,0.00092098606,0.00004560907,0.0003481385],"category_scores_gemma":[0.00006147222,0.00011649805,0.00014386278,0.0004885848,0.00013098656,0.00020621943,0.000054056884,0.00013962862,0.0001727146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014284457,0.000103302205,0.000020988915,0.00008318525,0.00002357361,0.000007655405,0.0017617327,0.00030970536,0.0012631135,0.9881183,0.00009070837,0.008203459],"study_design_scores_gemma":[0.000348199,0.0002791849,0.000091861955,0.00010570053,0.00000853743,0.000009876586,0.00006629938,0.019210922,0.014049569,0.96536344,0.00025924653,0.00020715052],"about_ca_topic_score_codex":0.0000025277734,"about_ca_topic_score_gemma":8.166782e-7,"teacher_disagreement_score":0.39757714,"about_ca_system_score_codex":0.000012665575,"about_ca_system_score_gemma":0.000019677922,"threshold_uncertainty_score":0.47506526},"labels":[],"label_agreement":null},{"id":"W2093500811","doi":"10.1016/j.disc.2009.10.006","title":"Rooted directed path graphs are leaf powers","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft; Wilfrid Laurier University","keywords":"Mathematics; Combinatorics; Discrete mathematics; Graph; Pathwidth; Interval graph; Line graph","score_opus":0.018272626899669405,"score_gpt":0.28614597697249655,"score_spread":0.26787335007282714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093500811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06467502,0.00032749242,0.91257805,0.0018413652,0.00021548443,0.0006631521,0.000019721856,0.001704537,0.017975193],"genre_scores_gemma":[0.8123381,0.00002740744,0.1864388,0.00030735953,0.000025709964,0.000016667125,0.000008582814,0.000029755052,0.0008076366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801314,0.00008959357,0.0003413925,0.0004232266,0.0005854373,0.00054722064],"domain_scores_gemma":[0.9981384,0.00017086322,0.00018844346,0.0011764886,0.00013614929,0.00018962586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038330522,0.00024465797,0.00031436753,0.0002173526,0.00017732465,0.00018354112,0.0012968155,0.00008106484,0.000025314434],"category_scores_gemma":[0.00028054861,0.00020353438,0.00014941746,0.0010984504,0.000095679854,0.00042263226,0.00017650868,0.00025620518,0.00009698173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000105065865,0.00022623836,0.0002049638,0.000059431673,0.000038116832,0.00007610179,0.0023433294,0.00007211583,0.0021839235,0.9854513,0.0012892354,0.008044783],"study_design_scores_gemma":[0.0004404685,0.0001697626,0.0026976739,0.00014130154,0.00001073926,0.000022490638,0.0003450095,0.047518495,0.0017718695,0.9458499,0.00057281286,0.00045951043],"about_ca_topic_score_codex":0.0000011870211,"about_ca_topic_score_gemma":0.0000018148946,"teacher_disagreement_score":0.7476631,"about_ca_system_score_codex":0.00003699008,"about_ca_system_score_gemma":0.000030380297,"threshold_uncertainty_score":0.8299891},"labels":[],"label_agreement":null},{"id":"W2094159810","doi":"10.1016/j.disc.2013.11.010","title":"A simple combinatorial interpretation of certain generalized Bell and Stirling numbers","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stirling number; Bell polynomials; Stirling numbers of the first kind; Stirling numbers of the second kind; Interpretation (philosophy); Simple (philosophy); Mathematics; Combinatorics; Generalization; Series (stratigraphy); Natural number; Discrete mathematics; Computer science","score_opus":0.0200517363745567,"score_gpt":0.30154425982799915,"score_spread":0.28149252345344244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094159810","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8715247,0.000064943044,0.12242632,0.00007994801,0.00047157632,0.0013489096,0.000018511066,0.0001929799,0.0038721198],"genre_scores_gemma":[0.8673437,0.00001566906,0.13213256,0.00002234837,0.00008239572,0.00010102061,0.000012544938,0.00009115149,0.00019858424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976493,0.000099746256,0.0010568558,0.00030931304,0.0004933781,0.00039141675],"domain_scores_gemma":[0.99700266,0.0012559667,0.0006940504,0.0006185278,0.00026987938,0.00015889195],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042644405,0.0003678416,0.00080224493,0.00012383332,0.00010991888,0.000084117084,0.0003167555,0.00016674916,0.00014795325],"category_scores_gemma":[0.001579413,0.00032731637,0.00014775152,0.00024380536,0.00017002026,0.00033297407,0.00021485289,0.00020817196,0.000029371264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025505888,0.00026209437,0.00012006313,0.0014040727,0.00012035157,0.000002306191,0.0078090676,0.0000381766,0.003385166,0.9856092,0.0005223347,0.0007016641],"study_design_scores_gemma":[0.0012016518,0.00010486569,0.000014948319,0.0002123338,0.000114963055,0.000009149687,0.0019119947,0.04253922,0.0029012293,0.9505985,0.00005778104,0.00033340044],"about_ca_topic_score_codex":0.000050430863,"about_ca_topic_score_gemma":0.0000058380915,"teacher_disagreement_score":0.042501044,"about_ca_system_score_codex":0.00006534458,"about_ca_system_score_gemma":0.000035479577,"threshold_uncertainty_score":0.99991786},"labels":[],"label_agreement":null},{"id":"W2094278957","doi":"10.1016/j.disc.2010.11.007","title":"Well-covered circulant graphs","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circulant matrix; Lexicographical order; Mathematics; Combinatorics; Circulant graph; Discrete mathematics; Characterization (materials science); Graph; Line graph; Voltage graph","score_opus":0.016664478147683726,"score_gpt":0.28505904869301746,"score_spread":0.2683945705453337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094278957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15879852,0.00003410912,0.80041766,0.0004620918,0.0004921152,0.0003906792,0.000009798809,0.0003891844,0.03900584],"genre_scores_gemma":[0.7914971,0.000010107654,0.20763826,0.00011198105,0.000040844832,0.00002890578,0.0000044259627,0.000028033966,0.0006403355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984638,0.00003617716,0.0002673719,0.0003341602,0.0004748296,0.00042364464],"domain_scores_gemma":[0.99812627,0.00020439584,0.00010180257,0.0013265593,0.00007877024,0.00016221876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048671677,0.00017309278,0.00020435172,0.00014836769,0.00014624879,0.00018801476,0.001445973,0.00007647187,0.000101971214],"category_scores_gemma":[0.00016540347,0.0001408101,0.00012515555,0.00048110815,0.00014220345,0.00036538602,0.00035738284,0.00037669254,0.00041691895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016667564,0.000048945112,0.00010145826,0.000037696962,0.000015203139,0.000017225817,0.0005854105,0.00000997236,0.012767646,0.98517203,0.00019544437,0.0010472989],"study_design_scores_gemma":[0.00023128295,0.000032553235,0.00018846244,0.000019105428,0.0000054631396,0.000062645835,0.000084875064,0.03721462,0.00695046,0.9527211,0.002235869,0.00025355766],"about_ca_topic_score_codex":0.0000026000812,"about_ca_topic_score_gemma":0.00000573043,"teacher_disagreement_score":0.6326986,"about_ca_system_score_codex":0.000010618118,"about_ca_system_score_gemma":0.000037735106,"threshold_uncertainty_score":0.5742069},"labels":[],"label_agreement":null},{"id":"W2094589803","doi":"10.1016/j.disc.2004.03.018","title":"On automorphism groups of circulant digraphs of square-free order","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Wreath product; Circulant matrix; Combinatorics; Digraph; Automorphism group; Degree (music); Automorphism; Order (exchange); Free product; Discrete mathematics; Product (mathematics); Direct product; Group (periodic table); Permutation group; Permutation (music)","score_opus":0.043856239545983874,"score_gpt":0.3194297307008574,"score_spread":0.2755734911548735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094589803","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94331264,0.00011542858,0.020909576,0.00037588808,0.00008904375,0.0009585011,0.00024880454,0.00017467524,0.03381542],"genre_scores_gemma":[0.94088876,0.000017107794,0.058385834,0.000041077332,0.000058867583,0.000037290294,0.000017306522,0.00010180206,0.00045196345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969609,0.00013100631,0.0010504753,0.00030139062,0.0010895133,0.0004667411],"domain_scores_gemma":[0.9953341,0.0019328023,0.0005400459,0.0017754042,0.00028907828,0.0001285777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011715074,0.0003286449,0.0007910387,0.00034971072,0.000066513705,0.000022993958,0.0009372842,0.00016983955,0.0005719479],"category_scores_gemma":[0.0024319536,0.00026736213,0.000281984,0.00059523905,0.00033956364,0.00011679393,0.00026765626,0.00030337487,0.00007845688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055582772,0.000836733,0.00008921602,0.0014850044,0.00018415967,0.000007609859,0.003919963,0.000046132827,0.0029638791,0.9880936,0.0019104335,0.00040765127],"study_design_scores_gemma":[0.0012461361,0.00034281175,0.00010181539,0.0005571306,0.00011004198,0.000019621779,0.0008439843,0.0071195425,0.011600894,0.9775492,0.00016253666,0.00034629364],"about_ca_topic_score_codex":0.0000076043534,"about_ca_topic_score_gemma":0.000014454982,"teacher_disagreement_score":0.037476256,"about_ca_system_score_codex":0.00005660232,"about_ca_system_score_gemma":0.00006109395,"threshold_uncertainty_score":0.9999779},"labels":[],"label_agreement":null},{"id":"W2094803507","doi":"10.1016/s0012-365x(03)00241-3","title":"Analysis of greedy algorithms on graphs with bounded degrees","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Heuristics; Combinatorics; Bounded function; Sequence (biology); Greedy algorithm; Algorithm; Random graph; Discrete mathematics; Mathematical optimization; Graph","score_opus":0.028575948934962812,"score_gpt":0.2982504229598212,"score_spread":0.2696744740248584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094803507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06456934,0.000047006077,0.92417556,0.000044241355,0.000029693516,0.00021448544,0.000010758615,0.00007842609,0.010830461],"genre_scores_gemma":[0.6140214,0.000010464767,0.38560784,0.000029379084,0.0000033288572,0.000020332267,0.0000036072963,0.0000189923,0.00028464402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820954,0.000102089936,0.00031064186,0.00033366223,0.0006763846,0.00036768743],"domain_scores_gemma":[0.9981298,0.00031825269,0.00018846501,0.0011174813,0.00013879211,0.00010722085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059599284,0.00018694211,0.0004100417,0.0005974147,0.0001126914,0.00008055705,0.0007754929,0.000045065848,0.000029231644],"category_scores_gemma":[0.00012706523,0.0001311493,0.00017740519,0.0028259393,0.00020538193,0.00020634147,0.00008928506,0.00013657268,0.000012691972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073922197,0.00012017468,0.00070478464,0.00003476086,0.0004764244,0.000011095127,0.00097183225,0.0010876354,0.000093036644,0.9956768,0.0000075662083,0.00080847414],"study_design_scores_gemma":[0.0008049295,0.0007446826,0.0013623644,0.00011608146,0.00045835486,0.000021079426,0.0009018849,0.2566201,0.007585137,0.7305775,0.00018556353,0.0006222871],"about_ca_topic_score_codex":0.0000039068127,"about_ca_topic_score_gemma":0.000011986616,"teacher_disagreement_score":0.54945207,"about_ca_system_score_codex":0.000022182814,"about_ca_system_score_gemma":0.000040508636,"threshold_uncertainty_score":0.5348113},"labels":[],"label_agreement":null},{"id":"W2095991286","doi":"10.1016/j.disc.2008.05.005","title":"Linear-time certifying algorithms for near-graphical sequences","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"","keywords":"Mathematics; Algorithm; Combinatorics; Discrete mathematics; Time complexity","score_opus":0.06133415210901777,"score_gpt":0.3142347807293254,"score_spread":0.25290062862030765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095991286","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.0043656034,0.000081154794,0.98991543,0.0006724928,0.00005926648,0.00028793834,0.000009491515,0.0008941389,0.0037145116],"genre_scores_gemma":[0.053000737,0.000009888888,0.9461126,0.00017345647,0.000046705947,0.00006568755,0.000006672179,0.000026572277,0.0005576813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998571,0.000015890488,0.00035641648,0.0003540776,0.0003461486,0.0003564708],"domain_scores_gemma":[0.99886626,0.00019509898,0.00014411389,0.0005390732,0.00014842646,0.000107017986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002643655,0.00020090416,0.00027291192,0.00007407037,0.00029775567,0.00039055105,0.0010471479,0.00008249632,0.0000048228576],"category_scores_gemma":[0.00023604733,0.00016667396,0.00014176588,0.00037038064,0.0002625308,0.0009006389,0.00025982843,0.000115401905,0.000055257267],"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.000067328874,0.0027571712,0.00095904904,0.004296178,0.0006042578,0.0008065721,0.044929437,0.0002442687,0.034671135,0.5846953,0.040372953,0.28559637],"study_design_scores_gemma":[0.00016855751,0.00012066353,0.000020146243,0.0001245663,0.000011264181,0.00017113326,0.00002383428,0.80516464,0.010729731,0.18152002,0.0015693024,0.00037613866],"about_ca_topic_score_codex":0.0000028375218,"about_ca_topic_score_gemma":2.2815902e-7,"teacher_disagreement_score":0.8049204,"about_ca_system_score_codex":0.000021235106,"about_ca_system_score_gemma":0.00008977797,"threshold_uncertainty_score":0.67967665},"labels":[],"label_agreement":null},{"id":"W2098101530","doi":"10.1016/s0012-365x(03)00128-6","title":"Simply connected incidence algebras","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Universidad Nacional del Sur; Consejo Nacional de Investigaciones Científicas y Técnicas","keywords":"Mathematics; Incidence (geometry); Converse; Incidence algebra; Partially ordered set; Quiver; Combinatorics; Strongly connected component; Simply connected space; Discrete mathematics; Pure mathematics; Algebra over a field; Algebra representation; Cellular algebra; Geometry","score_opus":0.029255388882786837,"score_gpt":0.2962791128912523,"score_spread":0.26702372400846547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098101530","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9311721,0.00009729081,0.03970531,0.0001573178,0.00069834944,0.0006058321,0.000011818407,0.0003719021,0.027180132],"genre_scores_gemma":[0.96048886,0.000011215827,0.03849657,0.00016523422,0.00008001283,0.000036956753,0.0000048868687,0.00007317347,0.00064308784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980525,0.000096295604,0.00057040324,0.0003283234,0.0004936651,0.0004588456],"domain_scores_gemma":[0.9979878,0.00069300336,0.00026372663,0.000759632,0.00013065431,0.00016516665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003919353,0.0003296673,0.00047808257,0.000070248076,0.00017722187,0.00009264773,0.00037764345,0.00016295859,0.0006126595],"category_scores_gemma":[0.0021108298,0.00027066167,0.00016598102,0.00028993038,0.00009761825,0.00014641482,0.00008249252,0.0002278166,0.00008447126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040908126,0.000059771875,0.00006569709,0.00011208415,0.000047636742,0.000008390311,0.0015391102,0.000004133313,0.00014964132,0.99655885,0.0013993302,0.000051242274],"study_design_scores_gemma":[0.00045716966,0.000052611875,0.00002409417,0.00006665041,0.000069414964,0.000045329394,0.0010230014,0.00040121443,0.0032825582,0.9931281,0.0010865278,0.00036331767],"about_ca_topic_score_codex":0.000007940138,"about_ca_topic_score_gemma":0.000008371638,"teacher_disagreement_score":0.029316816,"about_ca_system_score_codex":0.00005567688,"about_ca_system_score_gemma":0.00007584081,"threshold_uncertainty_score":0.99997455},"labels":[],"label_agreement":null},{"id":"W2100075407","doi":"10.1016/j.disc.2009.11.037","title":"Locally toroidal polytopes and modular linear groups","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Coxeter group; Polytope; Combinatorics; Quotient; Prime (order theory); Integer (computer science); Group (periodic table); Modulo; Automorphism; Euclidean geometry; Polyhedron; Discrete mathematics; Geometry","score_opus":0.021833471607629988,"score_gpt":0.29969325283046083,"score_spread":0.27785978122283084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100075407","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58096135,0.00045862744,0.39905047,0.0010483534,0.0004475133,0.0013754041,0.000030065148,0.000907158,0.015721068],"genre_scores_gemma":[0.6435189,0.00005125978,0.3551038,0.00019633405,0.00028019183,0.00002287524,0.0000067413193,0.0000981168,0.00072176266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975209,0.000054665004,0.00081479276,0.0004349012,0.0006053754,0.00056931865],"domain_scores_gemma":[0.9978536,0.0005076673,0.00034325063,0.00090789335,0.00013527588,0.00025236487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047377165,0.0004902118,0.00075827684,0.00011148236,0.00019173208,0.00010283358,0.0004428155,0.00020626876,0.00005624514],"category_scores_gemma":[0.0010601364,0.0004204658,0.00015547145,0.000245016,0.0001364223,0.00031079698,0.00016075915,0.00031343297,0.00005033756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017437442,0.0003194741,0.000016373331,0.00032807057,0.000047902322,0.000021949076,0.0021503188,0.000016349713,0.0018824745,0.9931981,0.0003288261,0.001672705],"study_design_scores_gemma":[0.0007693167,0.00026209923,0.000048271955,0.00021350264,0.00010248863,0.0000584852,0.0006283959,0.008971981,0.0020641412,0.98590493,0.00044979094,0.00052660704],"about_ca_topic_score_codex":0.000001746588,"about_ca_topic_score_gemma":0.000002803679,"teacher_disagreement_score":0.06255759,"about_ca_system_score_codex":0.00007213679,"about_ca_system_score_gemma":0.000035928253,"threshold_uncertainty_score":0.9998247},"labels":[],"label_agreement":null},{"id":"W2101758859","doi":"10.1016/j.disc.2005.11.031","title":"Efficient computation of 2-medians in a tree network with positive/negative weights","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Queen's University","funders":"","keywords":"Mathematics; Median; Combinatorics; Computation; Tree (set theory); Discrete mathematics; Algorithm","score_opus":0.00960064485197893,"score_gpt":0.21025245240602075,"score_spread":0.20065180755404183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101758859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8644078,0.00003154118,0.073454335,0.00057797704,0.000117230156,0.0006598679,0.000005301621,0.00006698699,0.060679007],"genre_scores_gemma":[0.9945117,8.565541e-7,0.0050664158,0.000086510605,0.00011627622,0.00001898516,0.000045318324,0.000013588294,0.00014029964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990113,0.000008982556,0.00036454253,0.00016032395,0.00026549274,0.00018940531],"domain_scores_gemma":[0.99958676,0.000030665065,0.00013875744,0.00013416648,0.00010318543,0.0000064748506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000212274,0.00013490567,0.0001985635,0.00015139463,0.000056589226,0.000040177987,0.0001024569,0.000027779468,0.000042732358],"category_scores_gemma":[0.000020927402,0.00010642628,0.000042981123,0.0005688052,0.00006231633,0.00010843512,0.000046915167,0.00005259321,0.00005344164],"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.00006323108,0.00063898636,0.0065429583,0.0009938374,0.000050434774,0.000009513015,0.0012111276,0.6407211,0.000038560338,0.34744203,0.0011911304,0.0010970902],"study_design_scores_gemma":[0.00080612424,0.000021978529,0.04508396,0.00033794856,0.00005955914,4.2846668e-7,0.0011218517,0.9243751,0.000042076274,0.027712442,0.0001872512,0.00025128343],"about_ca_topic_score_codex":0.00081069657,"about_ca_topic_score_gemma":0.002099488,"teacher_disagreement_score":0.31972957,"about_ca_system_score_codex":0.000026081176,"about_ca_system_score_gemma":0.000008305874,"threshold_uncertainty_score":0.4339938},"labels":[],"label_agreement":null},{"id":"W2102027040","doi":"10.1016/s0012-365x(00)00265-x","title":"Using simulated annealing to construct extremal graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Combinatorics; Mathematics; Girth (graph theory); Discrete mathematics; Graph","score_opus":0.08826871707175327,"score_gpt":0.3565440002992728,"score_spread":0.26827528322751953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102027040","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9484906,0.00005935825,0.0367939,0.00004801109,0.0003145661,0.0005019087,0.000026620524,0.00023114304,0.013533859],"genre_scores_gemma":[0.84969777,0.000007081334,0.14973058,0.000119645876,0.00009639926,0.0000027474937,0.000004797713,0.00008290483,0.0002580626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978155,0.00007710233,0.00070319464,0.0003721909,0.00044904393,0.0005829631],"domain_scores_gemma":[0.99810076,0.00050478266,0.00023821443,0.0007764795,0.00013657434,0.00024321752],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048438006,0.00038551947,0.0005581796,0.0002501196,0.0004400328,0.00009712257,0.00042339033,0.000167057,0.00034974565],"category_scores_gemma":[0.0005867972,0.00031393868,0.00023522307,0.00058105675,0.00015603895,0.00013496025,0.0002402116,0.00022586933,0.000018453535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049394483,0.0000751806,0.0015037733,0.0002540737,0.0001655808,0.00012690767,0.006243571,0.001497704,0.0015232512,0.987731,0.00025582852,0.0005737309],"study_design_scores_gemma":[0.0004638618,0.000050674527,0.000045158413,0.0002261897,0.0001387204,0.0004052346,0.0013838884,0.035049655,0.00086755765,0.9604837,0.0003494753,0.00053591083],"about_ca_topic_score_codex":0.000010003222,"about_ca_topic_score_gemma":0.000002837662,"teacher_disagreement_score":0.112936676,"about_ca_system_score_codex":0.00004678111,"about_ca_system_score_gemma":0.000026673477,"threshold_uncertainty_score":0.9999313},"labels":[],"label_agreement":null},{"id":"W2102693912","doi":"10.1016/j.disc.2005.02.007","title":"Altitude of regular graphs with girth at least five","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Girth (graph theory); Altitude (triangle); Discrete mathematics; Graph; Geometry","score_opus":0.015220925666949678,"score_gpt":0.26418970163527294,"score_spread":0.24896877596832326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102693912","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97018725,0.00019242716,0.0048606927,0.00016219649,0.00007228234,0.00046662224,0.00006124023,0.00012165875,0.02387565],"genre_scores_gemma":[0.8541795,0.000027702214,0.14272518,0.000062583305,0.0000690959,0.000017942393,0.000009133292,0.00006950742,0.0028393464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825174,0.000050476025,0.00055513525,0.00027111318,0.0005236525,0.00034788807],"domain_scores_gemma":[0.9981886,0.00029266003,0.00040350397,0.0008843743,0.00011861385,0.00011225444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033095694,0.00031110502,0.00054435886,0.00012212046,0.00021130283,0.000020645743,0.00040598857,0.00011841309,0.00026036036],"category_scores_gemma":[0.00013178439,0.00020794838,0.00019716397,0.00021424466,0.0003460682,0.0001174333,0.00021384709,0.00016436962,0.000015765301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005933059,0.00013696097,0.00035923268,0.0005372076,0.00020933856,0.0000073179367,0.007965587,0.00005599425,0.00046179688,0.9883361,0.0014361179,0.00043505867],"study_design_scores_gemma":[0.0010887714,0.0002036419,0.00033854364,0.00036348638,0.00027823445,0.00009778583,0.0015664961,0.0012475314,0.011231961,0.98107046,0.001972839,0.0005402264],"about_ca_topic_score_codex":0.0000033327435,"about_ca_topic_score_gemma":0.000042031686,"teacher_disagreement_score":0.13786449,"about_ca_system_score_codex":0.00004367832,"about_ca_system_score_gemma":0.000018702778,"threshold_uncertainty_score":0.8479889},"labels":[],"label_agreement":null},{"id":"W2102761613","doi":"10.1016/j.disc.2009.04.032","title":"Homomorphisms of triangle-free graphs without a <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si4.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-minor","year":2009,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Univerzita Karlova v Praze","keywords":"Mathematics; Homomorphism; Combinatorics; Conjecture; Graph; Minor (academic); Graph homomorphism; Discrete mathematics; Planar graph; Graph minor; Line graph; Graph power","score_opus":0.023136840028414683,"score_gpt":0.26391603190692375,"score_spread":0.24077919187850907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102761613","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5385955,0.00195437,0.018641185,0.001140711,0.002198169,0.00014913395,0.0007643849,0.00039779997,0.43615875],"genre_scores_gemma":[0.9689669,0.0009600992,0.025064271,0.0010141153,0.0010621785,0.0008019998,0.00063175533,0.0007320599,0.00076664385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9873371,0.0006335453,0.0027248396,0.0021837847,0.0039996435,0.00312109],"domain_scores_gemma":[0.9878641,0.0023929735,0.0029328447,0.0050653974,0.00032876543,0.001415953],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0033378003,0.0011978562,0.00068489625,0.0009130564,0.001513047,0.0016861232,0.0052377214,0.0019445601,0.14068745],"category_scores_gemma":[0.003133239,0.0020334388,0.0025033723,0.002391465,0.0026263427,0.002043347,0.0032006432,0.002013104,0.0015418758],"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.0013346152,0.0006446428,0.000013825397,0.0018375714,0.0012906656,0.001403631,0.0045709107,0.0009436155,0.002737057,0.88764274,0.09482324,0.0027574524],"study_design_scores_gemma":[0.0032009394,0.0028222085,0.00007410195,0.0022225229,0.001245785,0.0014332354,0.0020913372,0.20220245,0.7758349,0.005712881,0.0011838629,0.001975742],"about_ca_topic_score_codex":0.00036993294,"about_ca_topic_score_gemma":0.0005301376,"teacher_disagreement_score":0.8819299,"about_ca_system_score_codex":0.00002379158,"about_ca_system_score_gemma":0.001511722,"threshold_uncertainty_score":0.99978685},"labels":[],"label_agreement":null},{"id":"W2102857168","doi":"10.1016/s0012-365x(99)00247-2","title":"Extremal properties of ray-nonsingular matrices","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Invertible matrix; Mathematics; Matrix (chemical analysis); Combinatorics; Square matrix; Order (exchange); Square (algebra); Row; Involutory matrix; Pure mathematics; Discrete mathematics; Symmetric matrix; Eigenvalues and eigenvectors; Computer science; Geometry; Physics","score_opus":0.011510298309909744,"score_gpt":0.1873934737358378,"score_spread":0.17588317542592807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102857168","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97592515,0.0015458589,0.0013997167,0.0000070197175,0.000079149504,0.00015117986,0.0000074439276,0.00018761333,0.020696893],"genre_scores_gemma":[0.9974479,0.000054675118,0.0017792087,0.0000030141346,0.00003531428,0.00000950924,0.0000018414247,0.000030866322,0.0006376909],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992868,0.00001892395,0.00030512403,0.00007893612,0.00014719731,0.0001630198],"domain_scores_gemma":[0.99962693,0.00001907824,0.0000355266,0.00025776387,0.000022997934,0.000037723185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014449486,0.00013288355,0.00023271138,0.000051810577,0.000035147477,0.000023397162,0.00014351068,0.0000533679,0.0002862345],"category_scores_gemma":[0.00001183619,0.000103359445,0.000073230134,0.00016800537,0.00005474111,0.00008533704,0.000009229974,0.00006105602,0.00008948056],"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.00021002893,0.0009142852,0.0011510846,0.03804542,0.0019003319,0.000117078096,0.11261924,0.09115916,0.5476341,0.15647766,0.0048051286,0.044966474],"study_design_scores_gemma":[0.0023484007,0.0003072049,0.0005983373,0.006270512,0.00064022356,0.00025721188,0.014125762,0.45213243,0.44884995,0.054389138,0.01690037,0.0031804761],"about_ca_topic_score_codex":0.000002668403,"about_ca_topic_score_gemma":7.934018e-7,"teacher_disagreement_score":0.36097327,"about_ca_system_score_codex":0.000007510724,"about_ca_system_score_gemma":0.000005253836,"threshold_uncertainty_score":0.42148757},"labels":[],"label_agreement":null},{"id":"W2104170615","doi":"10.1016/j.disc.2007.04.044","title":"The reconstruction conjecture and edge ideals","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Betti number; Conjecture; Hilbert series and Hilbert polynomial; Vertex (graph theory); Discrete mathematics; Monomial ideal; Algebraic number; Simple graph; Krull dimension; Ideal (ethics); Graph; Pure mathematics; Hilbert space; Algebra over a field; Noetherian; Polynomial ring","score_opus":0.02916167738349223,"score_gpt":0.32663152882984064,"score_spread":0.2974698514463484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104170615","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8059124,0.0005191721,0.14343007,0.001840887,0.00017791537,0.00085553405,0.000023429633,0.00019361412,0.047046978],"genre_scores_gemma":[0.9391131,0.00011863216,0.05892956,0.00008189148,0.00014802092,0.000043826498,0.0000051996158,0.000049067614,0.0015107174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907166,0.000028342232,0.00037403227,0.00014107622,0.00015636385,0.00022855446],"domain_scores_gemma":[0.9973908,0.0018859702,0.00018356349,0.0003992494,0.000067061934,0.00007332919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008359941,0.0001411114,0.00017470494,0.000038148843,0.00042955656,0.000086398606,0.00016196612,0.000065107626,0.000032761178],"category_scores_gemma":[0.0004319375,0.000088276516,0.000054098815,0.00014591345,0.00021171385,0.00006774498,0.00007214051,0.0001577692,0.000019523133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003935587,0.000017108605,0.00010435122,0.000052137362,0.000031482923,8.339917e-7,0.0016663867,6.2123085e-8,0.00036680078,0.9797498,0.0011492777,0.016857823],"study_design_scores_gemma":[0.00017141011,0.000024398807,0.0005610533,0.000039804363,0.00004458002,0.000092484515,0.0026282216,0.0002128273,0.0015367612,0.98978734,0.0047644814,0.0001366541],"about_ca_topic_score_codex":0.0000029961743,"about_ca_topic_score_gemma":0.00006105727,"teacher_disagreement_score":0.13320069,"about_ca_system_score_codex":0.000022641903,"about_ca_system_score_gemma":0.000014881775,"threshold_uncertainty_score":0.35998118},"labels":[],"label_agreement":null},{"id":"W2104859703","doi":"10.1016/j.disc.2006.04.031","title":"Construction of trees and graphs with equal domination parameters","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Constructive; Domination analysis; Characterization (materials science); Combinatorics; Simple (philosophy); Discrete mathematics; Constructive proof; Tree (set theory); Graph; Process (computing); Computer science; Vertex (graph theory)","score_opus":0.012808463335140137,"score_gpt":0.2573611950184089,"score_spread":0.24455273168326874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104859703","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.3701002,0.000023207436,0.6288129,0.000042970078,0.000012948157,0.00010644579,0.0000024952797,0.000028833614,0.0008700044],"genre_scores_gemma":[0.6304126,0.000003643697,0.36954302,0.0000025712866,0.0000025737613,0.0000061643577,0.0000015897699,0.000004660153,0.00002318959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999247,0.000034042372,0.00018515567,0.0001536661,0.0002460623,0.00013407758],"domain_scores_gemma":[0.99933904,0.00017940157,0.00012927392,0.00025966656,0.00006333708,0.00002928602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019973391,0.000086247936,0.00013902968,0.00012936007,0.000051083483,0.00004805741,0.00018888513,0.00002637215,0.0000016200248],"category_scores_gemma":[0.0000285033,0.000063936524,0.000026404809,0.00029195592,0.00028057522,0.00027079208,0.000058227648,0.00005390222,0.0000010849808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008082456,0.000024191757,0.00063236756,0.0000478537,0.000009440161,0.0000017390082,0.00035292437,0.00010193184,0.0011242087,0.9941491,0.0000048609245,0.0035433276],"study_design_scores_gemma":[0.0003671917,0.0001334557,0.0008802904,0.000048183225,0.000009606597,0.0000351816,0.000326555,0.024659006,0.012233632,0.9611829,0.0000079042175,0.00011611441],"about_ca_topic_score_codex":0.0000070170727,"about_ca_topic_score_gemma":0.000012694591,"teacher_disagreement_score":0.26031238,"about_ca_system_score_codex":0.000008299212,"about_ca_system_score_gemma":0.000011535983,"threshold_uncertainty_score":0.26072556},"labels":[],"label_agreement":null},{"id":"W2106210406","doi":"10.1016/j.disc.2007.07.029","title":"Graphs with the n-e.c. adjacency property constructed from affine planes","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; Wilfrid Laurier University; Sackville Memorial Hospital","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Mathematics; Adjacency list; Affine transformation; Combinatorics; Property (philosophy); Discrete mathematics; Affine plane (incidence geometry); Pure mathematics; Geometry; Plane (geometry)","score_opus":0.02013294716597633,"score_gpt":0.2593920561754373,"score_spread":0.23925910900946099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106210406","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94075704,0.00014671331,0.014399902,0.0003980957,0.00024464325,0.0008668921,0.00011186599,0.00030583478,0.042769004],"genre_scores_gemma":[0.9384572,0.000012026354,0.059810784,0.00016463653,0.0001612156,0.00002092362,0.0000307947,0.00008309861,0.001259359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980855,0.0000645406,0.0005116203,0.00031488808,0.0005423804,0.00048106912],"domain_scores_gemma":[0.9972829,0.0012482685,0.00031514166,0.0009170964,0.000117275755,0.000119314114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000635132,0.00038041707,0.00044864704,0.0000882528,0.0004576646,0.00007700493,0.0005882211,0.00014205297,0.00042399485],"category_scores_gemma":[0.0002281197,0.00015454213,0.0001324619,0.00031654554,0.0005265361,0.00009983675,0.00015250118,0.0003353855,0.000013554359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016726828,0.00013309182,0.0025956037,0.00023543517,0.0003818638,0.00006383259,0.012143415,0.0000024227763,0.0007572281,0.9757962,0.005668203,0.0020553852],"study_design_scores_gemma":[0.0009144082,0.00012701313,0.001513923,0.00020400515,0.00028216807,0.000118043405,0.008951076,0.00017632192,0.0028570348,0.98142844,0.0028626283,0.0005649554],"about_ca_topic_score_codex":0.00004079305,"about_ca_topic_score_gemma":0.00014959883,"teacher_disagreement_score":0.04541088,"about_ca_system_score_codex":0.000021405414,"about_ca_system_score_gemma":0.000032011514,"threshold_uncertainty_score":0.6302045},"labels":[],"label_agreement":null},{"id":"W2106280765","doi":"10.1016/j.disc.2005.04.004","title":"Edge-disjoint spanners in Cartesian products of graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Cartesian product; Mathematics; Disjoint sets; Hypercube; Discrete mathematics; Graph; Cograph; Chordal graph; 1-planar graph","score_opus":0.021931015845525842,"score_gpt":0.2876060824299282,"score_spread":0.2656750665844023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106280765","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.39338937,0.00075795397,0.5711974,0.0061433944,0.00026689772,0.0016197129,0.00001727753,0.00034944544,0.026258534],"genre_scores_gemma":[0.7728792,0.000014507432,0.22675288,0.000030143208,0.000022432332,0.000020027153,0.0000016926144,0.000016206624,0.00026291612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984233,0.00006305038,0.00042136482,0.00031717448,0.00039492108,0.00038019085],"domain_scores_gemma":[0.99864036,0.00011167289,0.00013599005,0.0009279786,0.0001000917,0.00008391731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060605526,0.00015378394,0.00027463614,0.0002939492,0.00003925716,0.000039367293,0.00089476065,0.00004440922,0.000011865345],"category_scores_gemma":[0.00022903718,0.00013107932,0.000072399176,0.0009785484,0.00014809621,0.0003876902,0.000238568,0.00016837152,0.000036212252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005723022,0.00018450826,0.00031580275,0.00022603394,0.000015366451,0.000010689952,0.005932923,0.00051215116,0.0039055098,0.9807625,0.00016650042,0.0079623],"study_design_scores_gemma":[0.0009371275,0.00020368664,0.0011630193,0.00032891645,0.000012706832,0.000038373382,0.00131736,0.09778701,0.0855746,0.81063503,0.0013388741,0.0006633205],"about_ca_topic_score_codex":0.0000045196584,"about_ca_topic_score_gemma":0.00001857128,"teacher_disagreement_score":0.3794898,"about_ca_system_score_codex":0.000038234557,"about_ca_system_score_gemma":0.000056184574,"threshold_uncertainty_score":0.53452593},"labels":[],"label_agreement":null},{"id":"W2106547329","doi":"10.1016/j.disc.2009.03.049","title":"Random maximal independent sets and the unfriendly theater seating arrangement problem","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Toronto; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Combinatorics; Freedman; Limit (mathematics); Discrete mathematics; Mathematical analysis; Law","score_opus":0.02337288482308188,"score_gpt":0.2941904887986892,"score_spread":0.27081760397560733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106547329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015271585,0.0001937863,0.96489733,0.0021493454,0.00008642566,0.0014757375,0.000039168175,0.00013804546,0.01574855],"genre_scores_gemma":[0.7722039,0.000028147579,0.22681738,0.00038023613,0.00007300838,0.00010522781,0.000007170992,0.00004276034,0.0003421385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806803,0.00007297227,0.0005981173,0.00029412677,0.00054585235,0.00042088065],"domain_scores_gemma":[0.99810576,0.001069736,0.00022904096,0.00038847388,0.000089181114,0.00011780536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010502603,0.00030047746,0.0005264889,0.000043344615,0.0002529127,0.0001762939,0.0002736031,0.000086062755,0.00008060183],"category_scores_gemma":[0.00073170086,0.00016886236,0.00010416082,0.00012484506,0.00012119555,0.00008492087,0.00011304752,0.00024273426,0.00001835473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016350644,0.00010096787,0.0000026884447,0.00031684496,0.000064336615,0.000010810439,0.0053453306,0.000005965775,0.00007573753,0.98952097,0.00030232058,0.0040905196],"study_design_scores_gemma":[0.0035677094,0.00012821169,0.0000137696725,0.0001881347,0.0001876049,0.000053404987,0.0013754162,0.033731554,0.00017019939,0.9602635,0.00007994234,0.00024056324],"about_ca_topic_score_codex":0.0000035429057,"about_ca_topic_score_gemma":0.0000034345574,"teacher_disagreement_score":0.7569323,"about_ca_system_score_codex":0.000029721845,"about_ca_system_score_gemma":0.00002504385,"threshold_uncertainty_score":0.6886007},"labels":[],"label_agreement":null},{"id":"W2106653152","doi":"10.1016/j.disc.2005.04.024","title":"Labeling trees with a condition at distance two","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Combinatorics; Mathematics; Degree (music); Span (engineering); Graph; Integer (computer science); Edge-graceful labeling; Discrete mathematics; Graph power; Physics; Computer science","score_opus":0.008680740982188557,"score_gpt":0.2300537654908175,"score_spread":0.22137302450862895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106653152","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.27212727,0.0002669634,0.7174869,0.0004901484,0.00009455164,0.00020277784,0.000011555891,0.00041279732,0.008907033],"genre_scores_gemma":[0.81705755,0.0000029749544,0.18178792,0.00007804813,0.000009205074,0.000015973485,0.000016917971,0.000014287844,0.0010170974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989193,0.00001936683,0.00024936293,0.00026472096,0.00030542264,0.00024183394],"domain_scores_gemma":[0.9991814,0.00007251836,0.00014367509,0.0004804711,0.000068609654,0.000053350966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016427995,0.00015005468,0.00016854305,0.00005748559,0.00018684308,0.00013067303,0.00029319353,0.000029095327,0.000012248815],"category_scores_gemma":[0.000011493217,0.00010784364,0.00004489483,0.00027054758,0.00007280863,0.00020073574,0.00009563875,0.00006568961,0.000066591405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003689306,0.000071660164,0.00042507958,0.000046901147,0.000012104141,0.00001576248,0.00047237435,0.0014656641,0.0034250834,0.9930887,0.0007976271,0.00017532981],"study_design_scores_gemma":[0.0014319848,0.00013054715,0.00028347498,0.00035403244,0.00004149857,0.00008447872,0.00010832349,0.22031009,0.010659123,0.7647636,0.0012472008,0.0005856623],"about_ca_topic_score_codex":0.000026625876,"about_ca_topic_score_gemma":0.00011055447,"teacher_disagreement_score":0.5449303,"about_ca_system_score_codex":0.000027649672,"about_ca_system_score_gemma":0.000015509153,"threshold_uncertainty_score":0.4397736},"labels":[],"label_agreement":null},{"id":"W2107127602","doi":"10.1016/j.disc.2014.12.014","title":"Vertex elimination orderings for hereditary graph classes","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Université de Lyon; EGIDE; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja; Providence Health Care; Agence Nationale de la Recherche; Ministère de l'Europe et des Affaires Étrangères","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Discrete mathematics; Property (philosophy); Graph","score_opus":0.049916631788807925,"score_gpt":0.3235960227806383,"score_spread":0.27367939099183036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107127602","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.0069947094,0.000099400386,0.9884893,0.0007681399,0.00023690204,0.00038619284,0.000008256618,0.00018722551,0.0028299075],"genre_scores_gemma":[0.31918234,0.000013221901,0.6797257,0.00012857706,0.0000733345,0.00015706877,0.000018774563,0.000039742466,0.0006612564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987345,0.000032967815,0.00023707381,0.00026368207,0.00041183585,0.00031999208],"domain_scores_gemma":[0.9986139,0.00032469915,0.000091587564,0.0005566752,0.00026220112,0.00015092129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005816374,0.00014268873,0.000176656,0.00013891453,0.00009491878,0.0001205368,0.00079228356,0.000054006177,0.0000042087995],"category_scores_gemma":[0.00054657564,0.00012284084,0.00008116212,0.00039194588,0.00007587208,0.0005850917,0.00021373706,0.000094197225,0.00003659614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012201671,0.000072827475,0.000017712233,0.0001364894,0.000022276836,0.0000071627983,0.0021726857,0.00012870417,0.00024410801,0.98835397,0.003103354,0.00572849],"study_design_scores_gemma":[0.00041802457,0.0001685634,0.00003107,0.000036011323,0.000007510169,0.000017412254,0.0006726367,0.108022034,0.0015033277,0.8869281,0.002006983,0.00018832534],"about_ca_topic_score_codex":0.000001797652,"about_ca_topic_score_gemma":0.0000030665765,"teacher_disagreement_score":0.3121876,"about_ca_system_score_codex":0.000039840143,"about_ca_system_score_gemma":0.00006187649,"threshold_uncertainty_score":0.50093037},"labels":[],"label_agreement":null},{"id":"W2109408352","doi":"10.1016/j.disc.2015.10.008","title":"Triangle-free graphs with the maximum number of cycles","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Upper and lower bounds; Triangle-free graph; Pancyclic graph; Discrete mathematics; Graph; Complete bipartite graph; 1-planar graph; Chordal graph","score_opus":0.0421209842775522,"score_gpt":0.30227501331117884,"score_spread":0.26015402903362667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109408352","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87781227,0.00014358247,0.010072349,0.00075250707,0.00022448177,0.0007244594,0.000078072124,0.00015683232,0.11003545],"genre_scores_gemma":[0.9200686,0.000009587447,0.0788122,0.000096632895,0.00007993138,0.000035278885,0.0000049316363,0.00008271702,0.00081010046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983333,0.00010409391,0.00046159208,0.00019036543,0.0006195038,0.00029119416],"domain_scores_gemma":[0.99730897,0.00068762526,0.00038472554,0.0013352546,0.00016684606,0.00011659479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008723985,0.00026561628,0.00050024857,0.000060585415,0.00014820475,0.000039382496,0.0008285863,0.00009908743,0.00009104258],"category_scores_gemma":[0.0006361687,0.00013222637,0.00018770741,0.00028550095,0.00042118246,0.00009453583,0.00026523403,0.0001914151,0.0000107325195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006062939,0.00007964447,0.0004426718,0.00020445723,0.00015347413,0.0000064869937,0.00901692,0.000003679088,0.000015675036,0.98256415,0.007189318,0.00026291222],"study_design_scores_gemma":[0.0010102192,0.00007136691,0.000056422312,0.00008852394,0.00016964476,0.00006728832,0.0056241564,0.00011543767,0.0005056315,0.9913797,0.0007008444,0.00021076942],"about_ca_topic_score_codex":0.000008172171,"about_ca_topic_score_gemma":0.000014609032,"teacher_disagreement_score":0.10922535,"about_ca_system_score_codex":0.000016854758,"about_ca_system_score_gemma":0.0000415113,"threshold_uncertainty_score":0.53920346},"labels":[],"label_agreement":null},{"id":"W2111826700","doi":"10.1016/s0012-365x(03)00089-x","title":"Embedding Steiner triple systems into Steiner systems S(2,4,v)","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steiner system; Embedding; Steiner tree problem; Mathematics; Combinatorics; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.009964591549771824,"score_gpt":0.22347137955274649,"score_spread":0.21350678800297465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111826700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5733933,0.013446915,0.22904108,0.000021333179,0.01134789,0.0028771944,0.000085503205,0.0026132572,0.16717353],"genre_scores_gemma":[0.99467885,0.000026520158,0.0011316942,0.0000064402407,0.00016635064,0.0001731922,0.0000149136295,0.00013957387,0.0036624551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782836,0.00015145697,0.00081203895,0.0002748181,0.00040805593,0.0005252758],"domain_scores_gemma":[0.9987338,0.00013503923,0.00013807246,0.0007333018,0.00007398501,0.00018577656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008174678,0.0004219024,0.00064223836,0.00017945548,0.00015068769,0.0002625018,0.00030123326,0.0001915364,0.000045676858],"category_scores_gemma":[0.00009540307,0.00035438416,0.00016770187,0.00036287852,0.00005104739,0.00022428446,0.000027623415,0.00022780178,0.00027052074],"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.000008486178,0.000096751566,0.00014003566,0.0073887478,0.000502413,0.00004919316,0.0070213485,0.18924433,0.008900314,0.7805979,0.0059467317,0.000103734914],"study_design_scores_gemma":[0.0014435623,0.000108223205,0.0000071007566,0.001595007,0.00022378824,0.00027531953,0.022679234,0.89608175,0.0029544514,0.007870056,0.06503459,0.0017269311],"about_ca_topic_score_codex":0.000018940731,"about_ca_topic_score_gemma":0.0000024262622,"teacher_disagreement_score":0.77272785,"about_ca_system_score_codex":0.00009348444,"about_ca_system_score_gemma":0.000016740352,"threshold_uncertainty_score":0.9998908},"labels":[],"label_agreement":null},{"id":"W2114702003","doi":"10.1016/j.disc.2013.01.011","title":"Oriented trees in digraphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Agence Nationale de la Recherche","keywords":"Digraph; Combinatorics; Conjecture; Mathematics; Order (exchange); Tree (set theory); Integer (computer science); Chromatic scale; Discrete mathematics; Computer science","score_opus":0.018996780892726,"score_gpt":0.27824834799511794,"score_spread":0.25925156710239194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114702003","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95928735,0.00006592972,0.0034279188,0.0001433965,0.00018193384,0.0006040042,0.000009783992,0.00015296128,0.03612673],"genre_scores_gemma":[0.96564543,0.000015155003,0.03311587,0.00008099414,0.000047379704,0.00008787178,0.0000054996535,0.000048744598,0.00095304626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984781,0.00005633978,0.000539345,0.00023721368,0.00029967222,0.0003892888],"domain_scores_gemma":[0.9986246,0.0004501202,0.00015482314,0.00061219267,0.00006157151,0.00009669129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027531225,0.00025084402,0.0003864426,0.00019310719,0.000119759454,0.000053835956,0.0003204561,0.00011767446,0.00062634825],"category_scores_gemma":[0.00042343666,0.00018056031,0.00014702333,0.00034883316,0.0001317664,0.0001835201,0.00014514533,0.00020656132,0.00006293467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041474914,0.00011447955,0.0018017519,0.00011475391,0.00003453156,0.000006083423,0.0056821066,0.000002711876,0.0002807859,0.98984313,0.0015205344,0.00059499475],"study_design_scores_gemma":[0.00039164876,0.000032028438,0.0023436863,0.00010070655,0.000022586815,0.000009904398,0.0018109515,0.0013491012,0.00042352255,0.99286205,0.0003930224,0.0002607966],"about_ca_topic_score_codex":0.000025374678,"about_ca_topic_score_gemma":0.000038568178,"teacher_disagreement_score":0.035173684,"about_ca_system_score_codex":0.00002539797,"about_ca_system_score_gemma":0.000011113313,"threshold_uncertainty_score":0.73630357},"labels":[],"label_agreement":null},{"id":"W2115400757","doi":"10.1016/s0012-365x(02)00491-0","title":"Toward the rectilinear crossing number of Kn: new drawings, upper bounds, and asymptotics","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Crossing number (knot theory); Point (geometry); Graph; Enhanced Data Rates for GSM Evolution; Complete graph; Line segment; Plane (geometry); Discrete mathematics; Geometry; Computer science","score_opus":0.023865429777955555,"score_gpt":0.2814076873342632,"score_spread":0.25754225755630766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115400757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09892558,0.00020626068,0.89555305,0.0006864352,0.00022092846,0.00012503625,0.0000016005292,0.000036497757,0.00424462],"genre_scores_gemma":[0.6424643,0.0000110527535,0.35658288,0.00016680518,0.000059505284,0.0000019653696,0.0000017456181,0.000009338228,0.0007024039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913037,0.00004289252,0.00026611963,0.00016783275,0.00024780183,0.00014500583],"domain_scores_gemma":[0.999263,0.00018427128,0.00012435668,0.00028871017,0.000079231846,0.000060428225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003545139,0.00010856358,0.00014288646,0.000033847024,0.00018935607,0.0003774338,0.0002249485,0.000041352363,0.000021860886],"category_scores_gemma":[0.00022384118,0.00007756042,0.000052201674,0.0002939272,0.00010805109,0.00021096303,0.00008255363,0.00008268572,0.0000136819035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026055914,0.000059918813,0.0007338609,0.00011682538,0.000041507876,0.000002142401,0.017141478,0.00078522915,0.00045656395,0.97278595,0.0009911576,0.006882746],"study_design_scores_gemma":[0.0008540765,0.00009328706,0.0012286992,0.00018302894,0.00007145556,0.00036653722,0.0013357702,0.271697,0.019414155,0.67368543,0.030493822,0.00057672686],"about_ca_topic_score_codex":0.0000059775216,"about_ca_topic_score_gemma":0.0000010797123,"teacher_disagreement_score":0.54353875,"about_ca_system_score_codex":0.00001286476,"about_ca_system_score_gemma":0.00013689889,"threshold_uncertainty_score":0.3639603},"labels":[],"label_agreement":null},{"id":"W2115498309","doi":"10.1016/j.disc.2005.10.013","title":"On the biased <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si9.gif\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math>-in-a-row game","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Order (exchange); Scroll; Combinatorics; Limit (mathematics); Discrete mathematics; Mathematical analysis; Theology; Philosophy","score_opus":0.030854778058483547,"score_gpt":0.26731498438581824,"score_spread":0.2364602063273347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115498309","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9567944,0.00011880439,0.030116959,0.0019795392,0.00048134723,0.00013616722,0.000020440648,0.00023637182,0.01011598],"genre_scores_gemma":[0.9809369,0.00006488619,0.016704783,0.0014737064,0.00030930724,0.00014993474,0.000013307707,0.00009292404,0.00025424064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662507,0.000105953746,0.0008517299,0.00063584186,0.0009874032,0.00079399615],"domain_scores_gemma":[0.9962968,0.0012416864,0.0005013555,0.0017004344,0.00006658648,0.00019309306],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010753432,0.00039363914,0.0002796978,0.00014427227,0.00034982126,0.00060049654,0.0017919904,0.00030894627,0.00015771824],"category_scores_gemma":[0.000806542,0.00036396636,0.00038080825,0.0005033729,0.0003371584,0.00058287027,0.00062085805,0.0005393404,0.0033823834],"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.000025323718,0.00016256733,0.000004578545,0.000091739435,0.00005745593,0.000068352834,0.0058375574,0.0020106533,0.00041594947,0.98756653,0.001167839,0.0025914614],"study_design_scores_gemma":[0.00015669929,0.00019838975,0.000014245934,0.0003448651,0.000042679814,0.000056302448,0.00096203625,0.9462974,0.027669689,0.022129659,0.0017507832,0.0003772733],"about_ca_topic_score_codex":0.000081275546,"about_ca_topic_score_gemma":0.00013217663,"teacher_disagreement_score":0.9654369,"about_ca_system_score_codex":0.000035615256,"about_ca_system_score_gemma":0.00018911659,"threshold_uncertainty_score":0.9998812},"labels":[],"label_agreement":null},{"id":"W2115696218","doi":"10.1016/j.disc.2006.07.020","title":"Multicomplexes and polynomials with real zeros","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Polynomial; Polytope; Discrete mathematics; Mathematical analysis","score_opus":0.02252980996007601,"score_gpt":0.2897096351266191,"score_spread":0.2671798251665431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115696218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90320957,0.00007973535,0.069593735,0.00019817849,0.00016198272,0.0012073066,0.00004628272,0.0006268085,0.024876421],"genre_scores_gemma":[0.5950883,0.000016056563,0.4033723,0.000018311996,0.00018462536,0.00006804223,0.0000103476095,0.00013523077,0.0011067786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786794,0.000048105965,0.00071953365,0.00037822674,0.0004879085,0.0004982646],"domain_scores_gemma":[0.9976549,0.0009567266,0.0004273432,0.00072115584,0.00011079277,0.00012904889],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003168852,0.00043942424,0.00071664795,0.00010403704,0.00019619426,0.00012759269,0.00027602888,0.00012810424,0.00003709345],"category_scores_gemma":[0.00025845953,0.00032859857,0.00008434393,0.0001972963,0.0002514554,0.00021202108,0.00014994656,0.00018660257,0.00002524167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024636332,0.00027192157,0.0002486928,0.0005602091,0.00005109686,0.000017945948,0.0009286779,0.000010797401,0.0031716037,0.99392897,0.00064590585,0.00013952494],"study_design_scores_gemma":[0.001226268,0.00013274039,0.00018003801,0.00021871258,0.00014759848,0.00007664861,0.00068729965,0.0016060858,0.005268525,0.9896517,0.00026686612,0.0005375562],"about_ca_topic_score_codex":0.000047809528,"about_ca_topic_score_gemma":0.000033245324,"teacher_disagreement_score":0.33377856,"about_ca_system_score_codex":0.00006464065,"about_ca_system_score_gemma":0.000034161763,"threshold_uncertainty_score":0.9999166},"labels":[],"label_agreement":null},{"id":"W2116924935","doi":"10.1016/s0012-365x(03)00272-3","title":"On group-divisible designs with block size four and group-type 6um1","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Group (periodic table); Block size; Block (permutation group theory); Type (biology); Class (philosophy); Spectrum (functional analysis); Construct (python library); Discrete mathematics; Automorphism group; Automorphism; Computer science","score_opus":0.01639847693871242,"score_gpt":0.20255324714007103,"score_spread":0.18615477020135862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116924935","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9511483,0.00015131218,0.013165983,0.000013274007,0.00020581171,0.0003681854,0.0000076035303,0.0002575105,0.034682065],"genre_scores_gemma":[0.99293995,0.000017571536,0.006661768,0.00002484831,0.000021959437,0.000019195679,0.0000016053212,0.000064389744,0.00024871298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912757,0.00004051408,0.00021471138,0.0001693555,0.00017987822,0.0002679649],"domain_scores_gemma":[0.99916595,0.00023490688,0.00005596187,0.0004237588,0.000019186202,0.00010021794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027653898,0.00023385054,0.0002607367,0.00004402849,0.00013603388,0.000108690896,0.00013659512,0.000077805,0.000043900844],"category_scores_gemma":[0.00009252387,0.00017895772,0.00004267461,0.00013958842,0.000056444766,0.00009512368,0.000016187807,0.00013563909,0.00004033157],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034328463,0.00010088647,0.0008600742,0.0010800111,0.00023233087,0.000045489465,0.0018620436,0.0015721458,0.0049915733,0.98855954,0.00052352186,0.00013806099],"study_design_scores_gemma":[0.007420957,0.0032233777,0.005499611,0.0033527864,0.0007838989,0.0009911829,0.00817166,0.06617604,0.015932558,0.87676,0.006606278,0.005081649],"about_ca_topic_score_codex":0.0000018206475,"about_ca_topic_score_gemma":0.000007201281,"teacher_disagreement_score":0.11179953,"about_ca_system_score_codex":0.000015478352,"about_ca_system_score_gemma":0.0000040104096,"threshold_uncertainty_score":0.72976846},"labels":[],"label_agreement":null},{"id":"W2117152550","doi":"10.1016/j.disc.2010.03.019","title":"Strong embeddings of minimum genus","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"American Roentgen Ray Society","keywords":"Genus; Mathematics; Combinatorics; Biology; Zoology","score_opus":0.007247097993559703,"score_gpt":0.21757489133790484,"score_spread":0.21032779334434512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117152550","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.960391,0.000041258383,0.0059330165,0.0000050484828,0.0003979852,0.000105295796,0.000017313605,0.00012647317,0.03298264],"genre_scores_gemma":[0.9961263,0.0000022218392,0.0036004325,0.0000022355453,0.000051173465,0.000008627748,0.0000034305758,0.000029223147,0.00017635473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939495,0.0000062987447,0.00025510456,0.00007003349,0.00011719645,0.00015640384],"domain_scores_gemma":[0.99954224,0.000050053848,0.000050265462,0.00028683728,0.000020701376,0.00004991687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016097646,0.0001123246,0.00019024457,0.000048189355,0.000022946226,0.000015427504,0.00016338438,0.000070896655,0.00011107713],"category_scores_gemma":[0.000026141504,0.00009879909,0.000077878896,0.00008506987,0.000046788206,0.00005675328,0.000018194387,0.00013730467,0.00004061971],"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.0000064524897,0.00008021524,0.0005038069,0.0021940689,0.00020079549,0.000008767173,0.010714882,0.0008797506,0.35583997,0.6266569,0.001355583,0.0015587982],"study_design_scores_gemma":[0.0017954154,0.00020386385,0.0009335996,0.0007922224,0.00033894443,0.00017808944,0.013340439,0.43998557,0.3824654,0.14131744,0.016486801,0.002162237],"about_ca_topic_score_codex":0.0000011565703,"about_ca_topic_score_gemma":0.0000031375282,"teacher_disagreement_score":0.48533946,"about_ca_system_score_codex":0.000003759747,"about_ca_system_score_gemma":0.0000037431168,"threshold_uncertainty_score":0.402891},"labels":[],"label_agreement":null},{"id":"W2118486152","doi":"10.1016/s0012-365x(03)00297-8","title":"Well-located graphs: a collection of well-covered ones","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Dominating set; Graph; Maximal independent set; Discrete mathematics; Independent set; Characterization (materials science); Chordal graph; 1-planar graph","score_opus":0.02135974380539746,"score_gpt":0.2823232364815937,"score_spread":0.26096349267619623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118486152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06403628,0.00014842639,0.88539326,0.00014017333,0.00020121712,0.00056211144,0.000005308551,0.00019096791,0.049322248],"genre_scores_gemma":[0.8708024,0.000047601985,0.12733126,0.000034734952,0.0000073510814,0.00003503721,0.0000032968705,0.000028233057,0.0017100804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836874,0.00014353405,0.0004050287,0.00029303588,0.0004579989,0.0003316407],"domain_scores_gemma":[0.99854344,0.0002066295,0.00020366095,0.0007912517,0.00016301408,0.0000919762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056202925,0.00017537591,0.00028737442,0.00026223084,0.00013261318,0.00006052347,0.00063097157,0.00007174588,0.00007472847],"category_scores_gemma":[0.00024193308,0.00015228611,0.00012360205,0.0014674861,0.00014065382,0.00028652177,0.000112140166,0.00014218199,0.000086158405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011121993,0.00014784996,0.00016931078,0.00014692987,0.000047726353,0.000005465881,0.0013924107,0.00019556633,0.0031834801,0.99415785,0.0003952267,0.00014708936],"study_design_scores_gemma":[0.00059197744,0.00017059411,0.000084096064,0.000092933995,0.000016900718,0.000036081434,0.0005751321,0.038138818,0.062688164,0.89634943,0.0009679696,0.00028790793],"about_ca_topic_score_codex":0.0000054603365,"about_ca_topic_score_gemma":0.000004546603,"teacher_disagreement_score":0.8067661,"about_ca_system_score_codex":0.00003273563,"about_ca_system_score_gemma":0.00006684864,"threshold_uncertainty_score":0.6210047},"labels":[],"label_agreement":null},{"id":"W2118876122","doi":"10.1016/j.disc.2009.09.005","title":"Minimal Euclidean representations of graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; University of Calgary","keywords":"Mathematics; Combinatorics; Euclidean geometry; Discrete mathematics; Geometry","score_opus":0.0383726678968565,"score_gpt":0.34198105174236,"score_spread":0.3036083838455035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118876122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8937961,0.00004333835,0.018818673,0.0008201969,0.00004748998,0.0006145567,0.00006627881,0.00020729797,0.08558611],"genre_scores_gemma":[0.9044742,0.000008322614,0.09481972,0.00004948446,0.000020617126,0.000022152455,0.000012840012,0.000018480352,0.00057418476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987902,0.000039558294,0.00055561133,0.00018334226,0.00023337157,0.0001979121],"domain_scores_gemma":[0.99845177,0.0004294299,0.00028390915,0.0006730288,0.00008621888,0.00007564571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032172963,0.00015440486,0.00029472896,0.00011561463,0.00010757906,0.000021009873,0.0002825165,0.000063037485,0.00012489525],"category_scores_gemma":[0.00032895105,0.00013425294,0.00019457152,0.00036759465,0.00011312948,0.0000893612,0.000029905454,0.00010199663,0.000025120005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051339803,0.0002529774,0.00006413078,0.000070092254,0.000025848916,0.0000011677643,0.0017106695,0.0000022293598,0.0033433465,0.9929115,0.0013004803,0.00031240846],"study_design_scores_gemma":[0.0001981997,0.000058837737,0.00046744753,0.00005512614,0.000081697806,0.0000091407255,0.0011409174,0.0002465511,0.006539131,0.9908995,0.00016073973,0.00014271511],"about_ca_topic_score_codex":0.0000015433953,"about_ca_topic_score_gemma":0.0000017918017,"teacher_disagreement_score":0.08501193,"about_ca_system_score_codex":0.000007052797,"about_ca_system_score_gemma":0.000014904118,"threshold_uncertainty_score":0.54746765},"labels":[],"label_agreement":null},{"id":"W2118962918","doi":"10.1016/s0012-365x(03)00280-2","title":"Splitting systems and separating systems","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.016749313579064496,"score_gpt":0.24829603083223578,"score_spread":0.23154671725317127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118962918","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.15149991,0.00058949133,0.83976346,0.00010060188,0.00032766286,0.00024016491,0.0000021802646,0.00027691096,0.007199583],"genre_scores_gemma":[0.960957,0.00000964416,0.03884662,0.000025280486,0.0000636175,0.000019493173,8.654647e-7,0.000011572887,0.000065936656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989939,0.0000327815,0.0002978676,0.00023811252,0.00020337883,0.00023399718],"domain_scores_gemma":[0.9991876,0.00011253387,0.00014390412,0.0004374696,0.000036041416,0.00008245364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000575162,0.0001422776,0.00020804124,0.00007319393,0.00019884465,0.00054024387,0.0003727207,0.00004704708,5.8508937e-7],"category_scores_gemma":[0.000040594354,0.00011908749,0.000050645554,0.0002425388,0.000044077966,0.00026783158,0.00016991397,0.000094056944,0.000018003237],"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":[5.427184e-7,0.000015010433,0.00006675967,0.00023138442,0.0000151624745,0.000006968947,0.0027908722,0.0010188915,0.00020395606,0.99543893,0.000012546143,0.00019896952],"study_design_scores_gemma":[0.0011553011,0.00024839473,0.00015072706,0.0020530047,0.00006546082,0.00057675916,0.0072720842,0.5919865,0.00073838443,0.39317635,0.0014770372,0.0011000629],"about_ca_topic_score_codex":0.000016751206,"about_ca_topic_score_gemma":6.267296e-7,"teacher_disagreement_score":0.80945706,"about_ca_system_score_codex":0.000018568848,"about_ca_system_score_gemma":0.00001783063,"threshold_uncertainty_score":0.5209584},"labels":[],"label_agreement":null},{"id":"W2121129417","doi":"10.1016/j.disc.2004.06.006","title":"Addressing the Petersen graph","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Redeemer University","funders":"","keywords":"Combinatorics; Mathematics; Tuple; Graph; Petersen graph; Discrete mathematics; Eigenvalues and eigenvectors; Graph power; Line graph","score_opus":0.1290262573121771,"score_gpt":0.35734721239166956,"score_spread":0.22832095507949246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121129417","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7456887,0.00014827038,0.17386903,0.004809423,0.0002140668,0.0014076871,0.0000534274,0.00064048124,0.07316895],"genre_scores_gemma":[0.94269866,0.000009481918,0.056483548,0.00019202029,0.00007770894,0.00009786566,0.00000687042,0.00004694078,0.0003868909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893796,0.000038118433,0.00032956374,0.00017748612,0.00024856065,0.00026830923],"domain_scores_gemma":[0.99860895,0.00037707394,0.00016941006,0.0007317311,0.000044024222,0.0000688364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043946973,0.00018272788,0.00020116057,0.000053582222,0.00039865644,0.00009210376,0.0004071841,0.000060414197,0.00005758851],"category_scores_gemma":[0.00019982913,0.000113596216,0.00017286268,0.00027819313,0.00020720839,0.00009083584,0.00007681164,0.00018703328,0.00010706432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019378076,0.000084532745,0.0000053886515,0.00007478281,0.000031082604,0.000002317371,0.003108258,0.000020469006,0.0006179959,0.9955714,0.00035023867,0.00013161563],"study_design_scores_gemma":[0.0002454423,0.000014076289,0.000034945013,0.00010991244,0.00007487358,0.000030674746,0.0020207143,0.00006516615,0.0017773899,0.9948415,0.0006234455,0.00016183083],"about_ca_topic_score_codex":0.000003374255,"about_ca_topic_score_gemma":0.000008180887,"teacher_disagreement_score":0.19701001,"about_ca_system_score_codex":0.000021009464,"about_ca_system_score_gemma":0.000023465656,"threshold_uncertainty_score":0.46323192},"labels":[],"label_agreement":null},{"id":"W2121911143","doi":"10.1016/s0012-365x(00)00145-x","title":"Domino tableaux, Schützenberger involution, and the symmetric group action","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Combinatorics; Domino; Mathematics; Bijection; Young tableau; Symmetric group; Permutation group; Permutation (music); Philosophy","score_opus":0.030698894733745884,"score_gpt":0.2968365589327087,"score_spread":0.26613766419896284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121911143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86396706,0.0012412538,0.07501145,0.0013885633,0.0010548811,0.0036343583,0.000041180596,0.000994758,0.052666485],"genre_scores_gemma":[0.86537516,0.0009715102,0.1245517,0.00026716682,0.0005565551,0.0003930422,0.000023144166,0.00025513774,0.007606553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974062,0.00017618806,0.00087647,0.00038281767,0.00063830934,0.00052002067],"domain_scores_gemma":[0.9963468,0.002025737,0.0003849381,0.0009784478,0.00011602776,0.00014808154],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010030394,0.00042882355,0.0007120264,0.00015175955,0.0004480338,0.00016446233,0.00045661957,0.00016347833,0.0003559369],"category_scores_gemma":[0.0014888417,0.0002818373,0.0001837935,0.00082966813,0.00043388596,0.00038724564,0.00014314087,0.00039324493,0.00017623015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007704478,0.00018448828,0.000026553385,0.00043631002,0.00009488869,0.0000032357127,0.0017770149,0.000012430718,0.00004120488,0.9921729,0.0017417441,0.003432215],"study_design_scores_gemma":[0.0023862908,0.000050750004,0.00006315495,0.000121789984,0.00023896064,0.00006262027,0.00072783744,0.008147184,0.00012935209,0.9842183,0.003469892,0.0003838833],"about_ca_topic_score_codex":0.000013438196,"about_ca_topic_score_gemma":0.000017414151,"teacher_disagreement_score":0.04954025,"about_ca_system_score_codex":0.00010559439,"about_ca_system_score_gemma":0.000026432537,"threshold_uncertainty_score":0.9999634},"labels":[],"label_agreement":null},{"id":"W2122599841","doi":"10.1016/j.disc.2013.08.032","title":"A Dirac-type characterization of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-chordal graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Chordal graph; Mathematics; Combinatorics; Characterization (materials science); Graph; Discrete mathematics; Physics","score_opus":0.018689806947235477,"score_gpt":0.2611651905464756,"score_spread":0.2424753835992401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122599841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9288545,0.00006499264,0.06909236,0.00020964611,0.00040677265,0.00017873681,0.000050986095,0.0001795966,0.0009623881],"genre_scores_gemma":[0.96634287,0.00014552867,0.032519497,0.00019809425,0.00014786757,0.00019938443,0.00014594995,0.000117646436,0.00018314837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966478,0.000110964094,0.0008193826,0.00062819506,0.0010447144,0.0007489629],"domain_scores_gemma":[0.99687123,0.00044394057,0.0006768328,0.0015361772,0.00020293864,0.000268853],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00071947946,0.0003835109,0.00033888,0.00021969584,0.00035102057,0.00043227055,0.0014139824,0.00029810745,0.000059541428],"category_scores_gemma":[0.00048024612,0.0003965906,0.00036321866,0.00080465927,0.00037167984,0.0012483947,0.0008883318,0.0004464925,0.0008470369],"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.000046980484,0.00015439316,0.000026363665,0.00038694183,0.00012050364,0.000033928645,0.0018509569,0.00008836796,0.018397283,0.9775764,0.00006316262,0.0012547262],"study_design_scores_gemma":[0.00041032507,0.0003309231,0.00026088185,0.00029387997,0.00006252176,0.00007697095,0.00021808111,0.9517632,0.012366797,0.033474658,0.00033762664,0.0004041458],"about_ca_topic_score_codex":0.000038672388,"about_ca_topic_score_gemma":0.000009830803,"teacher_disagreement_score":0.9516748,"about_ca_system_score_codex":0.000015837883,"about_ca_system_score_gemma":0.00016241625,"threshold_uncertainty_score":0.9999309},"labels":[],"label_agreement":null},{"id":"W2122813432","doi":"10.1016/j.disc.2008.09.009","title":"Acyclic improper colourings of graphs with bounded maximum degree","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Commonwealth Scholarship Commission","keywords":"Mathematics; Combinatorics; Infimum and supremum; Degree (music); Bipartite graph; Bounded function; Discrete mathematics; Graph","score_opus":0.05244063705834468,"score_gpt":0.273282174174059,"score_spread":0.2208415371157143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122813432","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9756485,0.000074136595,0.0043145968,0.000047824607,0.00009245971,0.00047960135,0.000023070726,0.00012636755,0.019193422],"genre_scores_gemma":[0.90691715,0.000037847785,0.092031755,0.000049091628,0.000033513123,0.000028775461,0.000004289782,0.00008259621,0.00081496296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998074,0.000050489045,0.00061932736,0.00028826142,0.0005539006,0.00041404186],"domain_scores_gemma":[0.9981107,0.00031523977,0.00042175033,0.0008745393,0.00015564213,0.00012214629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030531478,0.00034825507,0.0006366924,0.00015284849,0.00035045005,0.000023138551,0.00048695045,0.00014572935,0.00013608525],"category_scores_gemma":[0.0002069443,0.00022247751,0.00021307959,0.00030612483,0.00063474965,0.00013278231,0.00018034354,0.00024273958,0.000008353795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119635595,0.000281151,0.0019982385,0.00096990395,0.00033857315,0.00006315821,0.0138729755,0.0000030084532,0.0011116791,0.98001117,0.0009220992,0.00030839263],"study_design_scores_gemma":[0.0009077826,0.00024898016,0.0009459308,0.00017221172,0.00015380385,0.00028314156,0.00083713065,0.00016037788,0.006206435,0.98940605,0.00026873033,0.00040940082],"about_ca_topic_score_codex":0.000010765231,"about_ca_topic_score_gemma":0.000008933928,"teacher_disagreement_score":0.08771716,"about_ca_system_score_codex":0.00002509044,"about_ca_system_score_gemma":0.000050185685,"threshold_uncertainty_score":0.90723693},"labels":[],"label_agreement":null},{"id":"W2123039547","doi":"10.1016/j.disc.2011.10.026","title":"Cover starters for covering arrays of strength two","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Carleton University","funders":"","keywords":"Cover (algebra); Mathematics; Combinatorics; Heuristic; Covering space; Upper and lower bounds; Representation (politics); Discrete mathematics; Mathematical optimization; Engineering","score_opus":0.04715693982522598,"score_gpt":0.2780852931107338,"score_spread":0.23092835328550784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123039547","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.009974373,0.00001096815,0.9843478,0.000014454289,0.00008269677,0.00016983045,0.000011349979,0.0014262696,0.0039622374],"genre_scores_gemma":[0.35477006,0.0000010614818,0.6451298,0.000026545184,0.000010314813,0.000015325193,0.0000013846424,0.000009787803,0.00003571288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992425,0.000010906151,0.00024718023,0.00016646228,0.00015140527,0.00018153414],"domain_scores_gemma":[0.9989422,0.0002678288,0.0001634333,0.00051519857,0.00006630336,0.000045067805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000235616,0.000112967675,0.00018699064,0.000056875586,0.000043779928,0.00003172639,0.0005024334,0.000028600814,0.000009042687],"category_scores_gemma":[0.00020126236,0.00009732294,0.00007775883,0.00010983238,0.000040900075,0.00015670569,0.0001088192,0.00004691325,0.0000066621396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003661258,0.0006825725,0.0021946984,0.0015378045,0.00020143138,0.000015717565,0.050686322,0.00017500002,0.00217443,0.8938323,0.026078872,0.022384224],"study_design_scores_gemma":[0.0005185025,0.00030334256,0.00010380065,0.0002891335,0.000031940854,0.000011741068,0.00009096779,0.30183172,0.03436921,0.6617922,0.00028700716,0.00037040803],"about_ca_topic_score_codex":0.00001880949,"about_ca_topic_score_gemma":7.1286877e-7,"teacher_disagreement_score":0.3447957,"about_ca_system_score_codex":0.000013486057,"about_ca_system_score_gemma":0.000023943694,"threshold_uncertainty_score":0.39687142},"labels":[],"label_agreement":null},{"id":"W2124170870","doi":"10.1016/j.disc.2012.02.025","title":"Friendship 3-hypergraphs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Friendship; Combinatorics; Discrete mathematics; Social psychology; Psychology","score_opus":0.011234086696318393,"score_gpt":0.20991442903738364,"score_spread":0.19868034234106524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124170870","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63017,0.0011845628,0.015008567,0.000013943174,0.00096219924,0.00017560094,0.00001659772,0.0006737347,0.3517948],"genre_scores_gemma":[0.99809194,0.000010111753,0.0015940685,0.000013631245,0.00012279663,0.00001954875,0.000004981599,0.00003710723,0.00010579837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993213,0.0000143477255,0.00018375926,0.000056188994,0.00011923343,0.00030520296],"domain_scores_gemma":[0.99955285,0.000045583944,0.000021969612,0.000260794,0.000009131329,0.00010969832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021565057,0.00013147989,0.00015302193,0.000052899446,0.00004022898,0.000021421303,0.00012094245,0.000059030568,0.00011892272],"category_scores_gemma":[0.00001602346,0.00011070204,0.00008112174,0.0001415329,0.000025701524,0.00014145054,0.0000146873035,0.00008616816,0.0003143033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015057348,0.000047683257,0.001721521,0.00042822488,0.00007906822,0.0000016081636,0.0043479665,0.00015659622,0.0027431843,0.98885065,0.0012075842,0.00041438174],"study_design_scores_gemma":[0.002593021,0.00020617331,0.008484659,0.0011393597,0.00066101586,0.0005378445,0.031337276,0.07574096,0.08359948,0.56746846,0.22227332,0.0059584337],"about_ca_topic_score_codex":5.163022e-7,"about_ca_topic_score_gemma":3.5407308e-7,"teacher_disagreement_score":0.42138222,"about_ca_system_score_codex":0.000010124095,"about_ca_system_score_gemma":0.0000014951725,"threshold_uncertainty_score":0.4514298},"labels":[],"label_agreement":null},{"id":"W2125208816","doi":"10.1016/j.disc.2003.10.030","title":"Enumerating branched orientable surface coverings over a non-orientable surface","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Surface (topology); Combinatorics; Discrete mathematics; Geometry","score_opus":0.03230022985800513,"score_gpt":0.32981736089546,"score_spread":0.29751713103745486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125208816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94090235,0.00013415795,0.028198615,0.00021227365,0.00020550776,0.0010243084,0.00009483569,0.00032420486,0.028903725],"genre_scores_gemma":[0.7844992,0.000029266652,0.20000729,0.00014627447,0.0002447251,0.000035638743,0.00004006729,0.00024452433,0.014752994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955881,0.00014565849,0.0010710988,0.0006799505,0.0012351999,0.0012799524],"domain_scores_gemma":[0.99623615,0.0014313578,0.00042321585,0.001360509,0.00021925425,0.00032950955],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002012964,0.00060658355,0.0008976175,0.00010056528,0.00043302972,0.00036117726,0.00077269203,0.00024556264,0.001774998],"category_scores_gemma":[0.0009660296,0.0005629087,0.00026029488,0.00072406285,0.0001882803,0.00077636406,0.0005058537,0.00063453196,0.0007849461],"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.0004317245,0.0034782526,0.0061519095,0.0068391426,0.0011120635,0.00014787503,0.076907545,0.009357028,0.15597989,0.6901243,0.048138518,0.0013318113],"study_design_scores_gemma":[0.008761836,0.0006608881,0.00021801805,0.0018495672,0.00052533014,0.00023262802,0.011688822,0.43284106,0.18090236,0.32223412,0.035532124,0.0045532254],"about_ca_topic_score_codex":0.000055136763,"about_ca_topic_score_gemma":0.000037104954,"teacher_disagreement_score":0.42348406,"about_ca_system_score_codex":0.00031845292,"about_ca_system_score_gemma":0.0001277619,"threshold_uncertainty_score":0.9999931},"labels":[],"label_agreement":null},{"id":"W2125862453","doi":"10.1016/s0012-365x(01)00466-6","title":"On the injective chromatic number of graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":134,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds pour la Formation de Chercheurs et l'Aide à la Recherche; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy","keywords":"Injective function; Mathematics; Chromatic scale; Combinatorics; Graph; Discrete mathematics; Monomorphism; Upper and lower bounds; Hypercube; Critical graph; Context (archaeology); Line graph; Voltage graph","score_opus":0.012410563887565994,"score_gpt":0.2081247982007641,"score_spread":0.1957142343131981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125862453","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86098725,0.00006517881,0.001216257,0.000023718922,0.000118232485,0.00020643242,0.000011243241,0.000109140645,0.13726257],"genre_scores_gemma":[0.9994625,0.000009270313,0.00025481798,0.00001620082,0.000011640926,0.000026174914,8.1265057e-7,0.000025523364,0.00019309849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937844,0.00003230634,0.0002329543,0.00006576638,0.00015617652,0.00013434568],"domain_scores_gemma":[0.99930423,0.00026912097,0.00005283195,0.00033127045,0.000015883781,0.000026634974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001537699,0.00012473819,0.00018356851,0.00003453094,0.000043270124,0.00001448844,0.00016555985,0.00004279061,0.0005825274],"category_scores_gemma":[0.0000473065,0.00007834503,0.00009744853,0.00019038477,0.000060904258,0.000037182068,0.000012025276,0.00009728389,0.0002921654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012864303,0.000052139916,0.000057759542,0.00041720088,0.00011853923,0.000001828376,0.008427766,0.00041304014,0.0005491009,0.9877007,0.002143387,0.00011724553],"study_design_scores_gemma":[0.0003036033,0.000068690344,0.00014756012,0.0005754982,0.00007313305,0.00003898844,0.0038390004,0.11980241,0.0071757296,0.86740977,0.00018535135,0.0003802759],"about_ca_topic_score_codex":9.683943e-7,"about_ca_topic_score_gemma":5.591323e-7,"teacher_disagreement_score":0.13847522,"about_ca_system_score_codex":0.000009954559,"about_ca_system_score_gemma":9.089104e-7,"threshold_uncertainty_score":0.6378267},"labels":[],"label_agreement":null},{"id":"W2126829018","doi":"10.1016/j.disc.2005.03.020","title":"Rebuilding convex sets in graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Combinatorics; Mathematics; Convex hull; Neighbourhood (mathematics); Convex set; Vertex (graph theory); Wheel graph; Discrete mathematics; Independent set; Chordal graph; Distance; Graph; Graph power; Regular polygon; Line graph; Geometry; Convex optimization","score_opus":0.026380368166790867,"score_gpt":0.32054564366337096,"score_spread":0.2941652754965801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126829018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20114599,0.0002752962,0.7789472,0.0017200668,0.00011244375,0.00046816235,0.000004776032,0.00031328466,0.017012777],"genre_scores_gemma":[0.669961,0.000022485157,0.32962176,0.00012312755,0.000015585238,0.000020664447,0.0000012576055,0.00001621895,0.00021791879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985467,0.000059948674,0.0003222102,0.00029245354,0.00035961717,0.00041902962],"domain_scores_gemma":[0.998827,0.00022741532,0.00008208255,0.0007239772,0.00004081638,0.00009873028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064213277,0.00014463771,0.00021234486,0.0002514048,0.000071824965,0.00010515599,0.0009834957,0.000052274892,0.000028693134],"category_scores_gemma":[0.00013929355,0.00012750307,0.00006869683,0.000680031,0.00008156351,0.00053679966,0.00030754338,0.00021478141,0.00012669674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022665872,0.000056138142,0.00027648843,0.00004267762,0.0000072611647,0.000016456477,0.0023439752,0.0002549627,0.00067203783,0.9874189,0.00012403233,0.008784835],"study_design_scores_gemma":[0.0003930147,0.000034698605,0.00023617629,0.00009488331,0.000002537776,0.000026218435,0.00024010536,0.20026344,0.0035863544,0.7935828,0.0012647957,0.00027498175],"about_ca_topic_score_codex":0.0000017828137,"about_ca_topic_score_gemma":0.0000092456485,"teacher_disagreement_score":0.468815,"about_ca_system_score_codex":0.000047100086,"about_ca_system_score_gemma":0.000025113568,"threshold_uncertainty_score":0.5199424},"labels":[],"label_agreement":null},{"id":"W213041943","doi":"10.1016/s0012-365x(00)00009-1","title":"The complexity of H-colouring of bounded degree graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Degree (music); Bounded function; Mathematics; Combinatorics; Discrete mathematics; Computer science; Physics","score_opus":0.0813376872937042,"score_gpt":0.3177632359906591,"score_spread":0.23642554869695487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W213041943","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6421498,0.0003587897,0.31471404,0.0006673668,0.00009576022,0.00068338367,0.000020386358,0.00013579032,0.041174702],"genre_scores_gemma":[0.87421197,0.00005364028,0.12532498,0.0000106547195,0.0000058879173,0.000010925221,7.8504456e-7,0.000011440932,0.0003697516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986339,0.00008151475,0.00040603528,0.0001598396,0.00044245523,0.0002762058],"domain_scores_gemma":[0.9983264,0.00040261704,0.00017210787,0.00094701146,0.00009591293,0.000055925906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006528539,0.00011078424,0.00022968103,0.00006253176,0.00018075207,0.00004946714,0.0014044787,0.00003196726,0.000042913824],"category_scores_gemma":[0.00009705484,0.000073516625,0.00012090754,0.00045989046,0.000935276,0.00016126019,0.00020136799,0.00012068937,0.00001378809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009817887,0.00004661098,0.00005239936,0.000073240146,0.00002402034,0.0000013417924,0.0010462827,0.000029886245,0.0005293278,0.9899749,0.000019416993,0.008192718],"study_design_scores_gemma":[0.0001650848,0.000058490645,0.00046334515,0.000046200956,0.0000050603494,0.000006078488,0.00014126231,0.016149119,0.0080720065,0.9746463,0.00016231812,0.000084786334],"about_ca_topic_score_codex":0.0000064622213,"about_ca_topic_score_gemma":0.00001088692,"teacher_disagreement_score":0.23206216,"about_ca_system_score_codex":0.000012205895,"about_ca_system_score_gemma":0.00003119231,"threshold_uncertainty_score":0.34460634},"labels":[],"label_agreement":null},{"id":"W2131552237","doi":"10.1016/j.disc.2011.06.032","title":"State transfer on graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":223,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Adjacency matrix; Vertex (graph theory); Combinatorics; Discrete mathematics; Regular graph; Graph; Transfer (computing); Line graph; Computer science; Graph power","score_opus":0.022213408380759768,"score_gpt":0.22897733315431235,"score_spread":0.20676392477355257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131552237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17281918,0.000017016862,0.81531394,0.00012201391,0.00018039155,0.000120036544,0.0000046760483,0.00026211265,0.011160613],"genre_scores_gemma":[0.780779,0.000005889433,0.21870744,0.00025721765,0.000021480697,0.0000068748054,0.0000010878247,0.000020342422,0.00020066756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990257,0.000026779497,0.00020441393,0.0002472022,0.00022968615,0.00026622874],"domain_scores_gemma":[0.9992485,0.00005788781,0.000032921696,0.00054854003,0.000024189647,0.000087945904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016700597,0.00015871944,0.0001594215,0.000083978994,0.000094154784,0.000065576074,0.00066710415,0.000031143467,0.000020886462],"category_scores_gemma":[0.000011538057,0.00011552734,0.00009940146,0.000214638,0.000040579136,0.00008323543,0.00007962099,0.00014869368,0.00009155998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005998491,0.00024075677,0.00003493129,0.00008034311,0.000045213244,0.000055071712,0.03187805,0.0003263836,0.00017826288,0.93098843,0.00021715052,0.035949435],"study_design_scores_gemma":[0.00031676944,0.00031943346,0.00056090736,0.00011174977,0.00000994139,0.000032299216,0.00007906613,0.43482837,0.0059344405,0.5569083,0.00048206717,0.0004166277],"about_ca_topic_score_codex":0.0000052618275,"about_ca_topic_score_gemma":0.0000011918694,"teacher_disagreement_score":0.6079598,"about_ca_system_score_codex":0.000006025432,"about_ca_system_score_gemma":0.000013959215,"threshold_uncertainty_score":0.47110686},"labels":[],"label_agreement":null},{"id":"W2131690757","doi":"10.1016/j.disc.2006.04.037","title":"Steiner intervals and Steiner geodetic numbers in distance-hereditary graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Steiner tree problem; Connectivity; Discrete mathematics; Path graph; Graph; Graph power; Line graph","score_opus":0.012587430546820573,"score_gpt":0.2672030840537653,"score_spread":0.2546156535069447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131690757","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.4323628,0.00076091825,0.55480236,0.0005653745,0.00017164806,0.0005220596,0.000021229887,0.00019058373,0.010603012],"genre_scores_gemma":[0.9327614,0.000023882616,0.06602236,0.000058375623,0.000036210524,0.00004522584,0.0000079332185,0.000032468968,0.0010121887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981272,0.000091455586,0.00046263277,0.00042297077,0.00041871506,0.00047697403],"domain_scores_gemma":[0.9987597,0.00025620556,0.00011150428,0.0007208296,0.000054528617,0.00009726678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004807961,0.00023296315,0.00031665416,0.0002121011,0.000074009,0.00014903721,0.0007113942,0.00006753045,0.00002072744],"category_scores_gemma":[0.00006523628,0.00019257626,0.000079398764,0.0005984443,0.00021531177,0.00051549444,0.00036776272,0.00022314923,0.000025666255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011893437,0.00013868249,0.0024276187,0.00023025653,0.000019477991,0.0001205173,0.0014230601,0.00022633429,0.00070815784,0.9921694,0.00055555935,0.0019690762],"study_design_scores_gemma":[0.00063698407,0.000072270006,0.0017729503,0.00020138889,0.000008403673,0.00004117847,0.00042620936,0.03811708,0.0006260509,0.9571813,0.0005305776,0.00038562695],"about_ca_topic_score_codex":0.000047529367,"about_ca_topic_score_gemma":0.00015122598,"teacher_disagreement_score":0.5003986,"about_ca_system_score_codex":0.000040396528,"about_ca_system_score_gemma":0.00001988071,"threshold_uncertainty_score":0.7853032},"labels":[],"label_agreement":null},{"id":"W2132073309","doi":"10.1016/s0012-365x(03)00197-3","title":"Coloring the hypergraph of maximal cliques of a graph with no long path","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":80,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Hypergraph; Mathematics; Graph; Discrete mathematics; Fractional coloring; Graph coloring; Graph power; Line graph","score_opus":0.01983438949883126,"score_gpt":0.2645574246920283,"score_spread":0.24472303519319705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132073309","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96037126,0.0001807808,0.009593562,0.000020727228,0.00011459529,0.0004901582,0.000026854252,0.000051474253,0.029150564],"genre_scores_gemma":[0.938718,0.000048177877,0.06096557,0.000021288139,0.00002175875,0.000023534052,0.000001569577,0.00004774001,0.0001523098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831903,0.00012579978,0.0006320896,0.00019151645,0.00044543738,0.0002861281],"domain_scores_gemma":[0.9977267,0.0007096579,0.0005254144,0.0007640027,0.0002175485,0.00005672225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076667673,0.00026092326,0.0005426381,0.00010285179,0.00015762389,0.000018869454,0.00038658272,0.000095073134,0.00006837171],"category_scores_gemma":[0.00047241306,0.00014030647,0.00022659721,0.00032398143,0.00047710098,0.000078118945,0.00008088152,0.00019310163,0.0000014173652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045167915,0.000115977244,0.0024464624,0.0008516118,0.0001942669,0.000005380145,0.0039880914,0.0000065579857,0.00041531515,0.99178046,0.00009015909,0.000060569233],"study_design_scores_gemma":[0.0004617232,0.00033094516,0.00048808928,0.00043524508,0.00025372667,0.000053260148,0.0022729845,0.00012659395,0.014566562,0.98057973,0.0001419806,0.0002891724],"about_ca_topic_score_codex":0.000005016496,"about_ca_topic_score_gemma":0.000006680158,"teacher_disagreement_score":0.05137201,"about_ca_system_score_codex":0.000010134231,"about_ca_system_score_gemma":0.00003460034,"threshold_uncertainty_score":0.57215315},"labels":[],"label_agreement":null},{"id":"W2132290920","doi":"10.1016/s0012-365x(99)00291-5","title":"Exponents of vertex-transitive digraphs","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Digraph; Combinatorics; Mathematics; Vertex (graph theory); Transitive relation; Conjecture; Exponent; Discrete mathematics; Abelian group; Integer (computer science); Order (exchange); Graph","score_opus":0.016401083506896945,"score_gpt":0.2788626426154422,"score_spread":0.26246155910854524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132290920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5053029,0.0001436002,0.4355282,0.00019139424,0.00007674471,0.00041998122,0.000019967301,0.00018044829,0.058136765],"genre_scores_gemma":[0.9456242,0.00004667918,0.053554744,0.00003277841,0.000006803014,0.000015334943,0.0000023879354,0.000015839694,0.00070125214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872667,0.00005595426,0.0002850799,0.00022880953,0.00041939388,0.0002840818],"domain_scores_gemma":[0.99891543,0.00017885109,0.000066441266,0.00068875414,0.0000626627,0.00008787122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024193618,0.00013317652,0.00022362774,0.00010508502,0.00005552536,0.000033583983,0.0008318311,0.000041492778,0.00012064358],"category_scores_gemma":[0.000037122965,0.000112283684,0.00010468776,0.00047019907,0.00014475218,0.00025456463,0.00007873957,0.00010952413,0.000058087113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004112155,0.00039886835,0.0002465786,0.00024743855,0.00011539495,0.000039176448,0.015050222,0.00014658007,0.008156853,0.9252883,0.00008170939,0.050187744],"study_design_scores_gemma":[0.00070869614,0.00020155172,0.00067154557,0.00020578061,0.000017325998,0.000026053474,0.00046586138,0.07231513,0.029824203,0.8948237,0.00033451256,0.0004056537],"about_ca_topic_score_codex":0.0000036477472,"about_ca_topic_score_gemma":0.0000010175759,"teacher_disagreement_score":0.44032127,"about_ca_system_score_codex":0.000011177367,"about_ca_system_score_gemma":0.000019644214,"threshold_uncertainty_score":0.45787957},"labels":[],"label_agreement":null},{"id":"W2132342512","doi":"10.1016/s0012-365x(02)00446-6","title":"Application des fonctions symétriques à la résolution d’équations différentielles autonomes combinatoires","year":2002,"lang":"fr","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Mathematics; Isomorphism (crystallography); Ring (chemistry); Pure mathematics; Context (archaeology); Combinatorics; Algebra over a field","score_opus":0.034071277776162416,"score_gpt":0.29261164641680054,"score_spread":0.2585403686406381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132342512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014187142,0.008263135,0.919606,0.0026117703,0.0015588193,0.002252218,0.00020607903,0.0010251701,0.050289694],"genre_scores_gemma":[0.65261626,0.0042803735,0.29537645,0.00007037539,0.0005600724,0.0010403908,0.000112959235,0.0004948692,0.04544827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995221,0.00040473894,0.0017742297,0.0007224796,0.0008480157,0.0010294963],"domain_scores_gemma":[0.99349016,0.0029311085,0.0011427869,0.0015936499,0.00048079278,0.00036152487],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007965583,0.0009103074,0.0011107649,0.0003726515,0.0010447636,0.0004178192,0.000766259,0.00066017616,0.0010136268],"category_scores_gemma":[0.0018888635,0.0009627471,0.0005356069,0.0010312333,0.0012407159,0.00094584626,0.0003407582,0.00073004386,0.0010094686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049473615,0.0027470717,0.00008129755,0.002682326,0.00027057796,0.000008947105,0.010532233,0.00020328126,0.00021143649,0.9645678,0.003957107,0.014732966],"study_design_scores_gemma":[0.00082315,0.00013396832,0.000029214965,0.0010037853,0.0005793371,0.00008549808,0.0023157543,0.23860474,0.0005647979,0.7376119,0.017489994,0.00075785076],"about_ca_topic_score_codex":0.00003727965,"about_ca_topic_score_gemma":0.000028861732,"teacher_disagreement_score":0.6384291,"about_ca_system_score_codex":0.00069008744,"about_ca_system_score_gemma":0.000081848906,"threshold_uncertainty_score":0.99989957},"labels":[],"label_agreement":null},{"id":"W2132838208","doi":"10.1016/s0012-365x(02)00352-7","title":"Lattice animals and heaps of dimers","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"University of Melbourne","keywords":"Bijection; Mathematics; Combinatorics; Algebraic number; Enumeration; Generating function; Constant (computer programming); Exponential growth; Discrete mathematics; Function (biology); Biology; Evolutionary biology","score_opus":0.05433294052060191,"score_gpt":0.2997596365732926,"score_spread":0.24542669605269066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132838208","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.826948,0.0008335949,0.036346857,0.0008367025,0.00011145353,0.000964381,0.00010620234,0.00021298521,0.13363981],"genre_scores_gemma":[0.8546536,0.00012022215,0.14377627,0.00004703032,0.000032176034,0.000017633916,0.000002216672,0.00006221066,0.0012886105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835193,0.00003970623,0.0007073355,0.0002288804,0.00036603847,0.00030608856],"domain_scores_gemma":[0.9979352,0.001018649,0.00032594876,0.0004979441,0.00007682294,0.00014544852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044806988,0.00024531543,0.0006024268,0.00008498795,0.0000712796,0.00004202417,0.00020966584,0.00011491806,0.0006740434],"category_scores_gemma":[0.00083864876,0.0001957026,0.00012696775,0.00017731496,0.00018562366,0.000090560585,0.000121609315,0.00014658825,0.000045660054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003857052,0.0002571989,0.00007600278,0.0015273865,0.000083201536,0.000005974244,0.002838266,6.1999697e-7,0.000980899,0.9926358,0.0008299165,0.00076089724],"study_design_scores_gemma":[0.00043568146,0.000119708595,0.00006668603,0.00029345672,0.00017429066,0.000042133164,0.0008945296,0.07029293,0.0006703076,0.92616355,0.00048541132,0.00036131853],"about_ca_topic_score_codex":0.0000032858159,"about_ca_topic_score_gemma":0.0000022326476,"teacher_disagreement_score":0.1323512,"about_ca_system_score_codex":0.000013815574,"about_ca_system_score_gemma":0.0000051567044,"threshold_uncertainty_score":0.798052},"labels":[],"label_agreement":null},{"id":"W2132893794","doi":"10.1016/j.disc.2008.02.018","title":"Minimal factorizations of permutations into star transpositions","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; St. Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Permutation (music); Combinatorics; Simple (philosophy); Star (game theory); Symmetry (geometry); Parity of a permutation; Discrete mathematics; Cyclic permutation; Symmetric group","score_opus":0.012347586672236626,"score_gpt":0.21153801401279682,"score_spread":0.1991904273405602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132893794","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8431219,0.000084184416,0.15039262,0.000016351518,0.00009740465,0.00014817205,0.00012221053,0.0001568114,0.0058603766],"genre_scores_gemma":[0.9925959,0.000019756371,0.007175235,0.0000025923162,0.00001952184,0.000022644335,0.00004877886,0.000023609891,0.00009194193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994151,0.000013745427,0.00028070237,0.000064052896,0.000117794174,0.0001086304],"domain_scores_gemma":[0.9996434,0.00006110779,0.000032871343,0.00017592177,0.000039095576,0.000047605863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004125789,0.00010055615,0.00015865348,0.00007780276,0.00011303513,0.000006446258,0.00009570151,0.000044989487,0.0000769014],"category_scores_gemma":[0.000012363075,0.00009612337,0.000085388514,0.0001985699,0.000074346106,0.000090737194,0.0000045574843,0.000058643305,0.00002206991],"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.0000088931965,0.0003380785,0.0012090094,0.0022252419,0.0004349729,0.000021069076,0.19410972,0.022018932,0.110015534,0.6687108,0.0007975109,0.00011020534],"study_design_scores_gemma":[0.0037119642,0.000692723,0.01879188,0.001569547,0.0011237599,0.0004760979,0.057759862,0.40847817,0.17324919,0.3240914,0.0061174384,0.003937966],"about_ca_topic_score_codex":0.0000032523863,"about_ca_topic_score_gemma":0.0000051174525,"teacher_disagreement_score":0.38645926,"about_ca_system_score_codex":0.00001255498,"about_ca_system_score_gemma":0.000011006186,"threshold_uncertainty_score":0.39197972},"labels":[],"label_agreement":null},{"id":"W2132962549","doi":"10.1016/j.disc.2011.07.029","title":"A pattern sequence approach to Stern’s sequence","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Sequence (biology); Complement (music); Base (topology); Word (group theory); Integer (computer science); Binary number; Discrete mathematics; Arithmetic; Geometry","score_opus":0.09206309257501788,"score_gpt":0.2726519713867397,"score_spread":0.1805888788117218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132962549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036372658,0.000018155093,0.93523806,0.00009864233,0.00012425522,0.000269157,0.000014094698,0.00033133992,0.027533617],"genre_scores_gemma":[0.68661445,0.000002618207,0.31242502,0.00057042553,0.000029642484,0.000049535174,0.0000032830071,0.000020313924,0.0002847041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984284,0.00003831445,0.00032722056,0.00045497736,0.0003413709,0.00040970693],"domain_scores_gemma":[0.9984997,0.000054400916,0.00012112336,0.0010844202,0.000050555278,0.00018980169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039045778,0.00022815457,0.0002477656,0.00008794438,0.00008662803,0.0001594434,0.001782276,0.000060649556,0.00003287053],"category_scores_gemma":[0.000041968862,0.00018416959,0.00008360116,0.0003082738,0.000061354185,0.00042360896,0.00051808474,0.00012270121,0.00038623478],"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.0000052182436,0.00047706318,0.0003991116,0.00042161945,0.00006804458,0.00009628008,0.079668805,0.000031368236,0.0068494305,0.86125326,0.00075769075,0.049972106],"study_design_scores_gemma":[0.00066037674,0.00036828071,0.0010399133,0.0005438763,0.00005406613,0.0004886027,0.003258287,0.6379561,0.02277328,0.32968423,0.0010618656,0.0021111616],"about_ca_topic_score_codex":0.000039567964,"about_ca_topic_score_gemma":0.0000018500972,"teacher_disagreement_score":0.6502418,"about_ca_system_score_codex":0.000039081726,"about_ca_system_score_gemma":0.000032721182,"threshold_uncertainty_score":0.7510218},"labels":[],"label_agreement":null},{"id":"W2133964621","doi":"10.1016/s0012-365x(00)00309-5","title":"On an adjacency property of almost all graphs","year":2001,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Adjacency list; Combinatorics; Property (philosophy); Discrete mathematics","score_opus":0.04621793690242231,"score_gpt":0.31474598516234925,"score_spread":0.26852804825992693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133964621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93495154,0.00004208688,0.0020906986,0.00009494427,0.00018990833,0.0005194897,0.000034041102,0.00014810049,0.061929207],"genre_scores_gemma":[0.96913487,0.00008766312,0.028814591,0.00017245227,0.000054008957,0.000023723811,0.00001533449,0.00008385354,0.0016135095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981708,0.00009375111,0.00060595723,0.00029152905,0.0004784828,0.00035948848],"domain_scores_gemma":[0.9980959,0.0003162953,0.00030540116,0.0010389333,0.00010319073,0.00014023682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048166947,0.00030768974,0.00048306058,0.00013868224,0.00014753395,0.000027512908,0.00045347435,0.00014119835,0.00036964667],"category_scores_gemma":[0.0003982657,0.00017651904,0.00020833852,0.00023162493,0.00018402997,0.0001379239,0.000112833215,0.00020800742,0.000014518439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049751045,0.0003822846,0.00029221684,0.00031193413,0.000089405024,0.000014562601,0.005138301,0.0000058836276,0.00035831158,0.9911204,0.0012145176,0.0010224249],"study_design_scores_gemma":[0.00037246125,0.00029832768,0.00016000544,0.00016354308,0.000092821014,0.000035936202,0.00041872042,0.0007199432,0.0011274191,0.9952772,0.001035806,0.00029778696],"about_ca_topic_score_codex":0.000014542732,"about_ca_topic_score_gemma":0.0000127367475,"teacher_disagreement_score":0.0603157,"about_ca_system_score_codex":0.000018596782,"about_ca_system_score_gemma":0.000018362203,"threshold_uncertainty_score":0.7198237},"labels":[],"label_agreement":null},{"id":"W2135113048","doi":"10.1016/j.disc.2012.06.016","title":"Upper bounds on the broadcast function using minimum dominating sets","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University","funders":"","keywords":"Mathematics; Combinatorics; Dominating set; Upper and lower bounds; Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.04128615133262544,"score_gpt":0.2757651594480155,"score_spread":0.23447900811539005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135113048","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.21619627,0.00009846056,0.7657208,0.00030122657,0.0018782057,0.000229327,0.0000016294734,0.00009610572,0.0154779935],"genre_scores_gemma":[0.9905833,0.000001144322,0.008278432,0.00030757723,0.000345163,0.000013520904,0.0000010989584,0.000015900267,0.00045383727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885184,0.00009147292,0.00029050425,0.0001560344,0.00028068657,0.0003294641],"domain_scores_gemma":[0.9989568,0.00026357255,0.00017381374,0.00048980315,0.000052633543,0.00006335253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008329132,0.00014640065,0.00015260118,0.000054070893,0.0003355306,0.0002798089,0.0003372188,0.000060623603,0.000045328085],"category_scores_gemma":[0.000068526584,0.000090495116,0.00010008646,0.00019781112,0.000030200597,0.0003653125,0.00011556149,0.0001396332,0.0001134306],"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.00000685974,0.00012219977,0.0002994113,0.000083732884,0.00007275299,0.0000016889059,0.014506286,0.000348209,0.0010263374,0.9751365,0.003453549,0.004942471],"study_design_scores_gemma":[0.00017860268,0.00007909335,0.00014927749,0.00023408596,0.00002880839,0.00007944292,0.0022745726,0.98349655,0.00048580323,0.00776496,0.0049524764,0.00027635024],"about_ca_topic_score_codex":0.000006029609,"about_ca_topic_score_gemma":8.354692e-7,"teacher_disagreement_score":0.98314834,"about_ca_system_score_codex":0.00004653184,"about_ca_system_score_gemma":0.000012142987,"threshold_uncertainty_score":0.3690284},"labels":[],"label_agreement":null},{"id":"W2135393175","doi":"10.1016/s0012-365x(02)00680-5","title":"On Hamilton cycle decompositions of the tensor product of complete graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"","keywords":"Tensor product; Mathematics; Product (mathematics); Tensor (intrinsic definition); Combinatorics; Tensor product of Hilbert spaces; Tensor contraction; Pure mathematics; Geometry","score_opus":0.014568636633819994,"score_gpt":0.199769635454023,"score_spread":0.185200998820203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135393175","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97890836,0.0001402226,0.0008771965,0.00003185778,0.00016948294,0.00029040597,0.00008231674,0.0000679846,0.019432187],"genre_scores_gemma":[0.99911314,0.00001003833,0.00073320477,0.000007820514,0.000010323836,0.0000118808475,0.000002357516,0.000021225113,0.00009000106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930966,0.000030240784,0.00030421847,0.0000785659,0.0001569389,0.00012035843],"domain_scores_gemma":[0.99931294,0.00008685024,0.00008428429,0.00046291205,0.000028573004,0.000024449244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009590036,0.00011135752,0.00021202488,0.00005487797,0.000050316015,0.00000665726,0.0002023118,0.000028055161,0.000058828242],"category_scores_gemma":[0.000020602432,0.00007563896,0.00013619449,0.00020288285,0.00008499668,0.000029538307,0.000013936559,0.00007633488,0.00001920564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009678073,0.00042281463,0.0003677437,0.0026520335,0.00032187917,0.000002156789,0.01274628,0.02669649,0.10883296,0.8451517,0.0024547544,0.00034145766],"study_design_scores_gemma":[0.0014552618,0.00033197112,0.0039303913,0.0027232748,0.00036808915,0.000077443685,0.002193314,0.34261915,0.21116993,0.43265274,0.0013599836,0.0011184539],"about_ca_topic_score_codex":0.0000016015741,"about_ca_topic_score_gemma":0.0000015269975,"teacher_disagreement_score":0.412499,"about_ca_system_score_codex":0.000006921733,"about_ca_system_score_gemma":0.0000010942465,"threshold_uncertainty_score":0.30844676},"labels":[],"label_agreement":null},{"id":"W2136080029","doi":"10.1016/s0012-365x(03)00235-8","title":"A note on random homomorphism from arbitrary graphs to Z","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Homomorphism; Combinatorics; Discrete mathematics; Random graph; Graph","score_opus":0.03144709697083665,"score_gpt":0.27727898541952223,"score_spread":0.2458318884486856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136080029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02201563,0.0001987613,0.92961484,0.0013977959,0.0002307672,0.00035478812,0.000007543834,0.00018021553,0.045999654],"genre_scores_gemma":[0.70417416,0.00012058259,0.293013,0.0022470395,0.000026920545,0.000047779336,0.000006891433,0.000019995787,0.0003436432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889797,0.00013254162,0.0002626163,0.00026217976,0.00023625621,0.00020843504],"domain_scores_gemma":[0.9981659,0.00044618215,0.00007370157,0.0011235105,0.00005753924,0.00013314227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029723466,0.00016462384,0.00022839468,0.00009306341,0.00017521385,0.00017970258,0.0008412401,0.000041671025,0.00007522913],"category_scores_gemma":[0.00023333367,0.00013787366,0.00009131109,0.0004263808,0.00003111537,0.00014403705,0.00016198921,0.00016476726,0.00029711888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006243351,0.000093182476,0.000016520362,0.0000063222183,0.000019268931,0.0000068558575,0.004391108,0.000055350978,0.0007732234,0.98819625,0.0014862461,0.004949416],"study_design_scores_gemma":[0.004409892,0.00037863618,0.00067688426,0.00071896776,0.000054501903,0.000026192296,0.00032261314,0.15822381,0.019039012,0.7280182,0.08645581,0.0016754556],"about_ca_topic_score_codex":0.0000026115913,"about_ca_topic_score_gemma":0.000010323235,"teacher_disagreement_score":0.6821585,"about_ca_system_score_codex":0.000025398655,"about_ca_system_score_gemma":0.000033130924,"threshold_uncertainty_score":0.5622325},"labels":[],"label_agreement":null},{"id":"W2136941318","doi":"10.1016/j.disc.2015.09.021","title":"On Hilbert bases of cuts","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Subdivision; Semigroup; Discrete mathematics; Graph","score_opus":0.05055297230452935,"score_gpt":0.32561556219233206,"score_spread":0.27506258988780274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136941318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03561806,0.000059464128,0.9057603,0.00041676813,0.00012080545,0.00022075004,0.000007776441,0.00011384967,0.05768222],"genre_scores_gemma":[0.7777396,0.000005317513,0.22037064,0.0001342544,0.000023898769,0.000016486892,0.0000026635837,0.000021931384,0.0016852362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988678,0.000049041617,0.00021436327,0.0001760867,0.00048717065,0.0002055477],"domain_scores_gemma":[0.9985407,0.0003516562,0.00009555469,0.00076900754,0.00011347434,0.00012958601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041703056,0.00010387094,0.00017837784,0.00010500236,0.00002912633,0.00003339842,0.0007765367,0.000029608704,0.000013022619],"category_scores_gemma":[0.00051771395,0.00007954177,0.000059636805,0.00031034107,0.00008496751,0.00019343056,0.00022908306,0.00008744087,0.00010413144],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065976146,0.00007758659,0.000028260665,0.00003817027,0.000009128568,0.000006113092,0.0011923207,0.00013808944,0.00016940833,0.9962081,0.0010741947,0.0010520725],"study_design_scores_gemma":[0.00027153047,0.00020823753,0.000015523363,0.000072714625,0.0000035494502,0.000008693079,0.00018109883,0.032861184,0.008671569,0.95684355,0.0007289686,0.00013337021],"about_ca_topic_score_codex":0.0000021489661,"about_ca_topic_score_gemma":8.38459e-7,"teacher_disagreement_score":0.7421215,"about_ca_system_score_codex":0.00002130209,"about_ca_system_score_gemma":0.00004729467,"threshold_uncertainty_score":0.32436195},"labels":[],"label_agreement":null},{"id":"W2137430154","doi":"10.1016/j.disc.2008.03.021","title":"Edge-switching homomorphisms of edge-coloured graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Homomorphism; Vertex (graph theory); Isomorphism (crystallography); Discrete mathematics; Homomorphic encryption; Graph; Graph homomorphism; Corollary; Graph isomorphism; Line graph; Voltage graph; Computer science","score_opus":0.03286005786231506,"score_gpt":0.2848804775606165,"score_spread":0.25202041969830147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137430154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18044156,0.00018312695,0.8128857,0.00015111922,0.00015915134,0.000326179,0.000006893869,0.00017760484,0.0056686765],"genre_scores_gemma":[0.77222145,0.00004635467,0.22722901,0.00004048399,0.000021552032,0.00002323474,0.0000024686021,0.000027024373,0.00038843637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979874,0.00008604928,0.00049601146,0.00034633838,0.00063181634,0.00045238223],"domain_scores_gemma":[0.9979306,0.0003436345,0.0002530926,0.0011554817,0.00016511737,0.00015209267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000532437,0.0002180632,0.00040105285,0.00026308274,0.00023982629,0.000043744352,0.0015077649,0.00007974722,0.000027874576],"category_scores_gemma":[0.00023846742,0.00018496644,0.00018831075,0.00084144075,0.0002552195,0.00041203917,0.00044794718,0.0002581745,0.0000592102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008813496,0.00016481361,0.0002686089,0.0001386916,0.000047043246,0.00006232803,0.005632938,0.000066783876,0.0066589965,0.9849104,0.00029338663,0.0017471726],"study_design_scores_gemma":[0.0005516215,0.00016053717,0.0004743178,0.000110375375,0.000013663187,0.00017537961,0.00029427093,0.029454622,0.019634131,0.9485142,0.00023588432,0.00038099336],"about_ca_topic_score_codex":0.0000033292306,"about_ca_topic_score_gemma":0.0000012373666,"teacher_disagreement_score":0.5917799,"about_ca_system_score_codex":0.000025812846,"about_ca_system_score_gemma":0.000076239725,"threshold_uncertainty_score":0.75427127},"labels":[],"label_agreement":null},{"id":"W2137906639","doi":"10.1016/s0012-365x(99)00251-4","title":"Extremal graphs for inequalities involving domination parameters","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Science Foundation","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Domination analysis; Characterization (materials science); Upper and lower bounds; Discrete mathematics; Graph; Extremal combinatorics; Inequality; Chordal graph","score_opus":0.04637501544429559,"score_gpt":0.31262080457621927,"score_spread":0.26624578913192365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137906639","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.1239051,0.000111645124,0.87135136,0.00021871121,0.0000695668,0.0005140348,0.000013228682,0.00016977507,0.0036465935],"genre_scores_gemma":[0.40673506,0.000033490378,0.5909881,0.00008559252,0.000022292044,0.00017318544,0.000011794757,0.000028382192,0.001922104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986021,0.00006866722,0.0003311023,0.00028459678,0.00033931015,0.00037420334],"domain_scores_gemma":[0.99846816,0.00069432246,0.00009077985,0.00057836104,0.00008548693,0.00008291002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006746509,0.00015877206,0.00020798591,0.00015003313,0.00017673588,0.00019941384,0.0007249423,0.00005199431,0.000056145418],"category_scores_gemma":[0.00022285082,0.00013795446,0.00012804913,0.00034900894,0.0001070046,0.00061315135,0.000086610045,0.00009521929,0.000033890607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011760609,0.000040680432,0.000017504164,0.0001333486,0.00001756753,0.0000033390847,0.0038838906,0.00016475048,0.000321768,0.9787561,0.00008943778,0.016559811],"study_design_scores_gemma":[0.00031215034,0.000075477,0.000019150295,0.000055470136,0.000006529025,0.000011109721,0.00049431983,0.12557495,0.0021198997,0.8708577,0.000274188,0.0001990489],"about_ca_topic_score_codex":0.000002796277,"about_ca_topic_score_gemma":0.000001868558,"teacher_disagreement_score":0.28282997,"about_ca_system_score_codex":0.000029585692,"about_ca_system_score_gemma":0.000022567601,"threshold_uncertainty_score":0.562562},"labels":[],"label_agreement":null},{"id":"W2137962531","doi":"10.1016/j.disc.2013.05.012","title":"A lower bound for the chromatic capacity in terms of the chromatic number of a graph","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Combinatorics; Mathematics; Monochromatic color; Chromatic scale; Conjecture; Graph; Wheel graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Upper and lower bounds; Graph power; Physics; Line graph; Computer science; Optics; Mathematical analysis","score_opus":0.03284534236989184,"score_gpt":0.29258533012331056,"score_spread":0.2597399877534187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137962531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7528689,0.000029643876,0.24327715,0.00044170837,0.00011281039,0.0017750474,0.000012244996,0.000025706631,0.001456775],"genre_scores_gemma":[0.9533216,0.000004861121,0.04621463,0.000039217914,0.0000100343195,0.000255798,4.24246e-7,0.000018008543,0.00013545348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982852,0.000100601756,0.0005908129,0.00020077676,0.00048095055,0.00034168837],"domain_scores_gemma":[0.99695593,0.0011760518,0.0003510108,0.001375286,0.00009575241,0.00004598546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000709871,0.00017182689,0.00035445424,0.00007692641,0.000109741326,0.00007468047,0.0017718838,0.000054610988,0.000048351154],"category_scores_gemma":[0.0004116068,0.00008867602,0.0002207078,0.0007136647,0.00051346165,0.0003071802,0.00034639295,0.00015666174,0.000017969132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001254546,0.0005694477,0.0032280276,0.0028930139,0.00018130819,0.0000016774171,0.017892698,0.00021626388,0.010871533,0.9621573,0.00040290254,0.0015732587],"study_design_scores_gemma":[0.00035010377,0.000048872127,0.0031855279,0.00031651015,0.00001646553,0.000012985151,0.00027292082,0.08598913,0.0038053838,0.90586126,0.000013002033,0.00012781989],"about_ca_topic_score_codex":0.00003241558,"about_ca_topic_score_gemma":0.000022015749,"teacher_disagreement_score":0.20045266,"about_ca_system_score_codex":0.000029189921,"about_ca_system_score_gemma":0.000033188902,"threshold_uncertainty_score":0.3616103},"labels":[],"label_agreement":null},{"id":"W2139277171","doi":"10.1016/j.disc.2008.02.023","title":"On the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si66.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-orientability of random graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Scroll; Combinatorics; Discrete mathematics; Algorithm; Theology; Philosophy","score_opus":0.022976516589453093,"score_gpt":0.2663674007408643,"score_spread":0.2433908841514112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139277171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9480267,0.000113733244,0.0480129,0.00028641312,0.00030830572,0.0001979643,0.00006521116,0.00014182283,0.0028469102],"genre_scores_gemma":[0.9837628,0.00011791621,0.01539665,0.00023695851,0.000084627194,0.00019213534,0.000029110444,0.00008077884,0.00009900446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961084,0.00021534611,0.0008580898,0.0006785601,0.0013888918,0.0007507118],"domain_scores_gemma":[0.99462986,0.0021618798,0.00058320764,0.002261525,0.00013120896,0.00023229582],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016574486,0.00039094596,0.0003815083,0.00014632911,0.00066887384,0.00017421716,0.0018064403,0.0002473329,0.00004326637],"category_scores_gemma":[0.0012005416,0.0003295736,0.00060610817,0.00073199073,0.00095219666,0.0005205735,0.0008941155,0.00059307204,0.00032071825],"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.00020150989,0.0002531899,0.000023034325,0.00026089075,0.00012805918,0.00006137133,0.0031738188,0.00039456805,0.0005177239,0.99452823,0.00019875832,0.00025887124],"study_design_scores_gemma":[0.0011022864,0.00039876235,0.000068139634,0.00024905923,0.00006319986,0.00013022535,0.0005900092,0.86060494,0.010366058,0.12581794,0.00024518947,0.00036419218],"about_ca_topic_score_codex":0.000033134485,"about_ca_topic_score_gemma":0.000017913651,"teacher_disagreement_score":0.8687103,"about_ca_system_score_codex":0.000019801171,"about_ca_system_score_gemma":0.00019707656,"threshold_uncertainty_score":0.99991566},"labels":[],"label_agreement":null},{"id":"W2139563752","doi":"10.1016/s0012-365x(03)00158-4","title":"On the iteration of certain quadratic maps over GF(p)","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Quadratic equation; GF(2); Combinatorics; Discrete mathematics; Finite field","score_opus":0.015836492332065445,"score_gpt":0.2384164064629816,"score_spread":0.22257991413091616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139563752","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.16785467,0.000027868751,0.80398667,0.00052781036,0.00014858537,0.0002482352,0.0000043429154,0.00006656298,0.027135251],"genre_scores_gemma":[0.98631525,0.0000025553054,0.013217537,0.00026583063,0.000008938625,0.00001281725,0.0000013189443,0.000007531664,0.00016824799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999151,0.00012864188,0.00022392151,0.00013616723,0.0002270738,0.00013322652],"domain_scores_gemma":[0.99870294,0.0005034463,0.00012074004,0.0006142064,0.000029920515,0.000028756054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005504407,0.00010624896,0.0001254285,0.000060462928,0.000100765945,0.00009360129,0.00040414478,0.000031082294,0.00007190258],"category_scores_gemma":[0.00019452178,0.000066173976,0.00009356769,0.00029536287,0.000048920996,0.00011849741,0.000038580998,0.000078457924,0.000025189183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014813771,0.000047082733,0.000018551173,0.00002955392,0.000011250577,7.6175735e-7,0.0021689208,0.000030790936,0.00040326908,0.9966943,0.00037217827,0.00022183132],"study_design_scores_gemma":[0.00011340832,0.00007944042,0.000032004722,0.000069050206,0.000009175715,0.000003513339,0.00020361229,0.017004427,0.0041654864,0.9777158,0.00049323053,0.000110873705],"about_ca_topic_score_codex":8.30238e-7,"about_ca_topic_score_gemma":0.0000013178152,"teacher_disagreement_score":0.8184605,"about_ca_system_score_codex":0.000007854801,"about_ca_system_score_gemma":0.000014958846,"threshold_uncertainty_score":0.26984966},"labels":[],"label_agreement":null},{"id":"W2139964171","doi":"10.1016/j.disc.2010.03.007","title":"On the base sequence conjecture","year":2010,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; Mathematics; Combinatorics; Base (topology); Hadamard transform; Hadamard matrix; Sequence (biology); Graph; Order (exchange); Discrete mathematics","score_opus":0.012978194770711046,"score_gpt":0.21385572170279482,"score_spread":0.20087752693208377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139964171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9544487,0.000018976814,0.0033740513,0.00019395912,0.0005175592,0.0002079781,0.000025145704,0.00025095593,0.040962704],"genre_scores_gemma":[0.99914443,0.0000015082088,0.00048650737,0.00007686608,0.00005348347,0.000022579052,0.0000028310228,0.000024669396,0.00018714421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995221,0.000015801057,0.00012938706,0.00007383544,0.000115303235,0.00014356658],"domain_scores_gemma":[0.99928707,0.00022326807,0.00002293344,0.0004152934,0.000010068158,0.00004134652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022447637,0.00011939076,0.000105287036,0.00002186004,0.00006861909,0.0000411673,0.00020582024,0.00006215432,0.0002799861],"category_scores_gemma":[0.00007365479,0.000069294736,0.00005633758,0.00008333031,0.000055341214,0.000031433316,0.000011538553,0.00027973615,0.00021089619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.054502e-7,0.000008013669,0.000006854414,0.0000867873,0.000018409284,0.0000050054095,0.0010863254,0.0003842928,0.021146776,0.97583574,0.0013207021,0.00010019453],"study_design_scores_gemma":[0.00031152938,0.00006171774,0.000043835378,0.00022597883,0.000049253587,0.00010758318,0.0016127442,0.1270978,0.056364916,0.8062653,0.00720479,0.00065457774],"about_ca_topic_score_codex":7.639718e-7,"about_ca_topic_score_gemma":0.0000047072695,"teacher_disagreement_score":0.16957046,"about_ca_system_score_codex":0.0000049335295,"about_ca_system_score_gemma":0.0000039290994,"threshold_uncertainty_score":0.30656514},"labels":[],"label_agreement":null},{"id":"W2140257813","doi":"10.1016/j.disc.2011.07.005","title":"Forbidden configurations and repeated induction","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Forb; Simple (philosophy); Matrix (chemical analysis); Conjecture; Permutation (music); Concatenation (mathematics); Discrete mathematics; Physics","score_opus":0.026610481705318167,"score_gpt":0.2025038179924041,"score_spread":0.17589333628708595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140257813","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8593003,0.000105249535,0.015285375,0.00000808081,0.00021168347,0.00019721505,0.000009383217,0.00034393268,0.124538764],"genre_scores_gemma":[0.99815565,0.000011079801,0.0015823162,0.000003816602,0.000020436206,0.000016609663,0.0000058301493,0.00001645796,0.00018778136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996433,0.000009524398,0.00014957173,0.000061192164,0.00004852437,0.000087860746],"domain_scores_gemma":[0.99976814,0.000012625467,0.000022998936,0.00014559372,0.000014519853,0.000036104087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008736301,0.00007581177,0.00009232397,0.000038585837,0.000043392443,0.000017451275,0.00004413658,0.000046074383,0.00007837768],"category_scores_gemma":[0.000012061552,0.00006610728,0.000021947933,0.00006758096,0.00002772382,0.000088207664,0.00000703466,0.000053614578,0.000029416798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008810041,0.000058588932,0.00036917554,0.0007912028,0.00023246108,0.000011166405,0.04999051,0.0000773694,0.031299356,0.9134859,0.0011556601,0.002519812],"study_design_scores_gemma":[0.0016907206,0.00028982092,0.009914862,0.00073623,0.00041759468,0.00051788596,0.033805132,0.10789659,0.13161531,0.70561624,0.0053994204,0.0021001736],"about_ca_topic_score_codex":0.000003509223,"about_ca_topic_score_gemma":0.0000026333287,"teacher_disagreement_score":0.20786963,"about_ca_system_score_codex":0.0000051658335,"about_ca_system_score_gemma":0.000001782977,"threshold_uncertainty_score":0.26957765},"labels":[],"label_agreement":null},{"id":"W2141324117","doi":"10.1016/j.disc.2015.05.025","title":"Generalized de Bruijn words for primitive words and powers","year":2015,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; De Bruijn sequence; Combinatorics; Word (group theory); Alphabet; Mathematics; Order (exchange); Upper and lower bounds; Combinatorics on words; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.03411923224235038,"score_gpt":0.2946641922986173,"score_spread":0.2605449600562669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141324117","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.059452612,0.00041859262,0.93431485,0.00054341386,0.00043607134,0.0007270944,0.00006610019,0.00024549174,0.003795781],"genre_scores_gemma":[0.1667714,0.00014079208,0.83158773,0.00038290911,0.00020047998,0.0002956857,0.000043474425,0.00006564236,0.0005119083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982651,0.00010183282,0.00037314865,0.0005568968,0.0002797912,0.00042321978],"domain_scores_gemma":[0.9981406,0.0002810272,0.00029140478,0.00094571215,0.00012573518,0.00021552535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012222982,0.00036839725,0.0005115534,0.00017144483,0.000120378856,0.00042915152,0.0010855165,0.0002478523,0.000007496482],"category_scores_gemma":[0.00019928292,0.00033281944,0.00025297454,0.00018241188,0.00013590489,0.00012986935,0.0013121724,0.00031350672,0.000003998485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000330077,0.00007871714,0.000043484233,0.0006167115,0.00018826452,0.000007366518,0.026723277,0.00011813407,0.00008162523,0.966098,0.0017180747,0.004293344],"study_design_scores_gemma":[0.00052474416,0.00008594078,0.000022741373,0.00031808135,0.00009582441,0.000016122178,0.00060467434,0.06377362,0.00027238243,0.93208385,0.001691459,0.0005105861],"about_ca_topic_score_codex":0.000006895057,"about_ca_topic_score_gemma":0.000004108353,"teacher_disagreement_score":0.10731878,"about_ca_system_score_codex":0.00006856601,"about_ca_system_score_gemma":0.00019646638,"threshold_uncertainty_score":0.9999124},"labels":[],"label_agreement":null},{"id":"W2142062721","doi":"10.1016/s0012-365x(99)00359-3","title":"On the problem of a matching orthogonal to a 2-factorization","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Graph factorization; Factorization; Bipartite graph; Enhanced Data Rates for GSM Evolution; Graph; Factor-critical graph; Discrete mathematics; Algorithm; Line graph; Graph power; Computer science; Artificial intelligence","score_opus":0.007633022768852604,"score_gpt":0.1989644467495303,"score_spread":0.19133142398067768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142062721","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9343497,0.000011165789,0.028478213,0.00004778507,0.00003576633,0.0002920291,0.000016568234,0.00009650179,0.036672242],"genre_scores_gemma":[0.9979034,0.0000023954697,0.0017500868,0.00002528035,0.000019540534,0.000027537637,0.0000033752456,0.000022015627,0.00024639018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944484,0.000020234038,0.00021083823,0.00006309772,0.0001476481,0.00011335328],"domain_scores_gemma":[0.9996447,0.00010029305,0.000025094861,0.00018568819,0.000011943831,0.00003225647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017712703,0.000095446856,0.00012286128,0.00003281552,0.000039367602,0.000019491634,0.0001239202,0.000030105524,0.00033655143],"category_scores_gemma":[0.000007074952,0.00006194268,0.00004910222,0.00015423006,0.000012236893,0.000033988184,0.0000069228463,0.00006478406,0.000102761434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011010836,0.000036877045,0.000024484492,0.00039308175,0.000057039,0.0000011006703,0.012741977,0.03829768,0.0044545736,0.94162416,0.0003792615,0.0019787739],"study_design_scores_gemma":[0.00036830807,0.0001845896,0.00032329376,0.0013174511,0.00006158839,0.000018009849,0.0025561021,0.034126904,0.011260935,0.94552356,0.0036331688,0.00062607025],"about_ca_topic_score_codex":0.0000011804927,"about_ca_topic_score_gemma":0.0000015107227,"teacher_disagreement_score":0.063553646,"about_ca_system_score_codex":0.000008870753,"about_ca_system_score_gemma":0.0000031714085,"threshold_uncertainty_score":0.3685002},"labels":[],"label_agreement":null},{"id":"W2142143427","doi":"10.1016/j.disc.2015.09.027","title":"Uniqueness and minimal obstructions for tree-depth","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Conjecture; Discrete mathematics; Graph; Uniqueness","score_opus":0.06581150215029835,"score_gpt":0.3367363074743629,"score_spread":0.27092480532406454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142143427","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.02368083,0.000073317686,0.9717608,0.00037073437,0.00009022371,0.00030038838,0.000010385962,0.00012071507,0.0035925736],"genre_scores_gemma":[0.21868378,0.0000052949763,0.7804741,0.00003237735,0.000040342442,0.00008508143,0.0000030449628,0.000020746038,0.0006551944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991319,0.000032084143,0.00017464769,0.00021845588,0.00020327844,0.00023961288],"domain_scores_gemma":[0.99898607,0.00022984718,0.00006188546,0.00043179473,0.0001251774,0.00016522835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037013675,0.0001087365,0.00015259838,0.00008377352,0.000097120406,0.000113262635,0.00044118543,0.00004012868,0.0000012857508],"category_scores_gemma":[0.00023724535,0.0000905697,0.000042637606,0.00022071223,0.00011689797,0.00031742308,0.00020021254,0.00006946278,0.000007731608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069955922,0.000024339077,0.000077161254,0.00005602109,0.000011878394,0.0000023442083,0.0017536712,0.000018909228,0.00022982225,0.9911505,0.00020129523,0.006467056],"study_design_scores_gemma":[0.00042710887,0.00011759636,0.000098256365,0.000021036145,0.000007995414,0.000039857387,0.0008438457,0.06641092,0.0017736867,0.9287872,0.0013053142,0.00016720274],"about_ca_topic_score_codex":0.0000013498233,"about_ca_topic_score_gemma":0.0000066235184,"teacher_disagreement_score":0.19500294,"about_ca_system_score_codex":0.000022809849,"about_ca_system_score_gemma":0.000049018745,"threshold_uncertainty_score":0.36933252},"labels":[],"label_agreement":null},{"id":"W2142334108","doi":"10.1016/j.disc.2005.02.022","title":"Detailed wordlength pattern of regular fractional factorial split-plot designs in terms of complementary sets","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Optimal Experimental Design Methods","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Science Foundation","keywords":"Mathematics; Fractional factorial design; Factorial; Split plot; Factorial experiment; Plot (graphics); Arithmetic; Discrete mathematics; Combinatorics; Statistics; Mathematical analysis","score_opus":0.14529886469096281,"score_gpt":0.4207809977068823,"score_spread":0.2754821330159195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142334108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7064618,0.000034697765,0.28840822,0.000050617335,0.00032378707,0.0005029819,0.00018029692,0.000021470407,0.0040161675],"genre_scores_gemma":[0.8052124,0.0000014162483,0.19455184,0.000014846329,0.000058648682,0.000013982303,0.000026651196,0.000021966209,0.000098249766],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957625,0.00035402217,0.0016491134,0.00036037306,0.0015971015,0.00027684233],"domain_scores_gemma":[0.99668914,0.0017446423,0.00076008006,0.00063067,0.000110702545,0.000064748325],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021988044,0.00022831709,0.0006736601,0.00029439473,0.000045908317,0.00005311815,0.0006472701,0.00009057588,0.0010034073],"category_scores_gemma":[0.00041125034,0.00017647263,0.00019326837,0.0004702564,0.00018502313,0.0002633553,0.00017192283,0.00013792382,0.00003232756],"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.0007296462,0.0044266805,0.36009023,0.00058895326,0.00030529796,0.000071140545,0.013613887,0.0035845528,0.50925964,0.07852597,0.006415184,0.02238884],"study_design_scores_gemma":[0.0033030978,0.0005323166,0.08069436,0.00033081675,0.00007879337,0.000018138253,0.004518082,0.04224767,0.21898894,0.6480331,0.00047496604,0.000779732],"about_ca_topic_score_codex":0.00012332853,"about_ca_topic_score_gemma":0.00007020712,"teacher_disagreement_score":0.5695071,"about_ca_system_score_codex":0.000069721405,"about_ca_system_score_gemma":0.000029803487,"threshold_uncertainty_score":0.9999098},"labels":[],"label_agreement":null},{"id":"W2143157065","doi":"10.1016/j.disc.2008.04.052","title":"Nordhaus–Gaddum inequalities for the fractional and circular chromatic numbers","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Graph; Inequality; Discrete mathematics; Rational number; Windmill graph; Integer (computer science); Graph power; Line graph; Mathematical analysis","score_opus":0.03739885792471782,"score_gpt":0.25553148185387725,"score_spread":0.21813262392915944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143157065","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.12896983,0.000676684,0.86642146,0.0021056016,0.00030183402,0.00044429736,0.000011791705,0.00018398362,0.00088450307],"genre_scores_gemma":[0.8841001,0.00007424459,0.1147704,0.00045799333,0.000021972732,0.000078194505,0.000005478626,0.000017231505,0.00047442154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905944,0.000022152026,0.000263163,0.00018684076,0.00027297088,0.00019544119],"domain_scores_gemma":[0.99875724,0.0005759566,0.00011527038,0.00041836273,0.000074222145,0.0000589197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033405732,0.00012652465,0.00016314401,0.000043868873,0.00043512994,0.000092262926,0.00031161262,0.000043222233,0.000009503043],"category_scores_gemma":[0.00013058691,0.000082957085,0.00007575523,0.0001447921,0.00014158174,0.00018659238,0.000097238866,0.0000803764,0.000016128484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028271002,0.00008071159,0.00025207506,0.0003586702,0.00010833706,0.0000063558646,0.0115891425,0.00023708565,0.0003081052,0.982266,0.0041264496,0.00066420855],"study_design_scores_gemma":[0.0006476474,0.00008190692,0.00056410115,0.000100576544,0.000051480987,0.00026418897,0.0012131827,0.34677425,0.00045629145,0.6469929,0.0024865195,0.00036694916],"about_ca_topic_score_codex":0.000017118153,"about_ca_topic_score_gemma":0.0000016660791,"teacher_disagreement_score":0.75513023,"about_ca_system_score_codex":0.000010034794,"about_ca_system_score_gemma":0.000037168033,"threshold_uncertainty_score":0.33828917},"labels":[],"label_agreement":null},{"id":"W2144688537","doi":"10.1016/s0012-365x(03)00236-x","title":"Channel assignment on graphs of bounded treewidth","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Treewidth; Mathematics; Partial k-tree; Bipartite graph; Discrete mathematics; Vertex (graph theory); Bounded function; Chordal graph; Clique-sum; 1-planar graph; Pathwidth; Graph; Line graph","score_opus":0.032515523825681424,"score_gpt":0.29640658569259887,"score_spread":0.26389106186691746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144688537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013061768,0.000060951694,0.9562262,0.00013239823,0.00011856988,0.00033198428,0.0000063201674,0.00008614798,0.029975642],"genre_scores_gemma":[0.91098356,0.000016245414,0.0882533,0.00006639713,0.0000066773837,0.00003341754,0.0000014924622,0.00002157948,0.0006173603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837255,0.00010967024,0.00031594568,0.00027590772,0.0005807406,0.00034518284],"domain_scores_gemma":[0.9984918,0.0002536477,0.00015606455,0.0009269477,0.000063052255,0.00010848823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006032194,0.00016731884,0.00025310155,0.00017645523,0.000091945745,0.000057147867,0.00072607386,0.000047638274,0.00002539547],"category_scores_gemma":[0.00019265419,0.00013279609,0.00011796596,0.00049688335,0.00012311178,0.00016708966,0.000105450395,0.00013316945,0.000040297342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000389648,0.00014745079,0.000012705823,0.00005204553,0.000022090308,0.000004907325,0.00091812405,0.00012527884,0.0004885268,0.99771816,0.00006887428,0.00043794035],"study_design_scores_gemma":[0.00031291114,0.000211823,0.00002519456,0.00006155538,0.0000053550157,0.000006674076,0.00021649624,0.0075109964,0.026270254,0.9649377,0.00027568065,0.00016538678],"about_ca_topic_score_codex":7.6496354e-7,"about_ca_topic_score_gemma":7.721252e-7,"teacher_disagreement_score":0.89792174,"about_ca_system_score_codex":0.000032646898,"about_ca_system_score_gemma":0.000037266364,"threshold_uncertainty_score":0.54152673},"labels":[],"label_agreement":null},{"id":"W2146551015","doi":"10.1016/j.disc.2009.03.047","title":"Hamiltonian decompositions of complete<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-uniform hypergraphs","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Mathematics; Hamiltonian (control theory); Scroll; Discrete mathematics; Combinatorics; Algorithm","score_opus":0.013538983090129991,"score_gpt":0.22829075911196148,"score_spread":0.2147517760218315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146551015","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9825945,0.00025699582,0.0055592004,0.00007542148,0.00040460555,0.000112603164,0.00025260792,0.000284457,0.010459641],"genre_scores_gemma":[0.99168205,0.00010119509,0.007495997,0.00012100517,0.0001598203,0.00007842663,0.00019118466,0.00012235486,0.000047966656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765325,0.000043719177,0.0008651372,0.00033122147,0.00051665306,0.00059002225],"domain_scores_gemma":[0.998239,0.00022952245,0.00032425468,0.00093496585,0.00005391731,0.0002183815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004105098,0.00040694646,0.00039206166,0.00016730615,0.0003370111,0.00015323311,0.0005514871,0.00032781894,0.00004337176],"category_scores_gemma":[0.00006586158,0.00045062456,0.0005388175,0.00035738293,0.00019388797,0.00029538063,0.00011527914,0.0003631363,0.00034421418],"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.000034835484,0.0001254383,0.000008176461,0.00065849914,0.0002478786,0.00004244113,0.0016962439,0.0030128288,0.007027314,0.9866967,0.00025142892,0.00019818962],"study_design_scores_gemma":[0.0005487252,0.00027119252,0.000121218654,0.00067921245,0.00025226886,0.00020825745,0.0010329965,0.9772614,0.006832686,0.011348041,0.0009449706,0.0004990143],"about_ca_topic_score_codex":0.000027597149,"about_ca_topic_score_gemma":0.00004369454,"teacher_disagreement_score":0.9753487,"about_ca_system_score_codex":0.000016019887,"about_ca_system_score_gemma":0.000048245103,"threshold_uncertainty_score":0.99979454},"labels":[],"label_agreement":null},{"id":"W2148534827","doi":"10.1016/j.disc.2005.11.002","title":"Contributions to zero-sum problems","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Subsequence; Modulo; Mathematics; Generalization; Zero (linguistics); Sequence (biology); Integer (computer science); Combinatorics; Discrete mathematics; Computer science","score_opus":0.023228310909942266,"score_gpt":0.31802018887315664,"score_spread":0.2947918779632144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148534827","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.33706233,0.00030668272,0.5347832,0.0064419406,0.0007475275,0.0030356927,0.0006237915,0.0011017335,0.115897104],"genre_scores_gemma":[0.85087067,0.000010776137,0.14501163,0.00048887864,0.00028862926,0.000095654264,0.000012634349,0.00006992583,0.003151224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982825,0.000047168392,0.0005589822,0.00026740786,0.00036700658,0.00047696862],"domain_scores_gemma":[0.9983507,0.0003715132,0.00015643168,0.00073641445,0.00016243529,0.00022250303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052220863,0.0002736009,0.0004002511,0.00011909019,0.0003531983,0.000072295414,0.00041800423,0.00012754227,0.0002564249],"category_scores_gemma":[0.00088752137,0.00020876648,0.00017933197,0.00025249296,0.00008970249,0.00012252065,0.00022552085,0.00020817918,0.00018869514],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005215744,0.00009952343,0.000023927863,0.00012571462,0.00005808517,0.0000017713121,0.0045971116,0.000057483623,0.00043082435,0.9829172,0.010955387,0.00072775857],"study_design_scores_gemma":[0.0003481743,0.000053822656,0.000025881216,0.00011178659,0.00007619552,0.000023584123,0.00024080469,0.0010750748,0.0018599425,0.96602684,0.029821694,0.00033621676],"about_ca_topic_score_codex":0.0000020853122,"about_ca_topic_score_gemma":0.000010841924,"teacher_disagreement_score":0.5138083,"about_ca_system_score_codex":0.00008187464,"about_ca_system_score_gemma":0.00002573141,"threshold_uncertainty_score":0.851325},"labels":[],"label_agreement":null},{"id":"W2148613230","doi":"10.1016/j.disc.2007.09.036","title":"Existence of HSOLSSOMs of type<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mn>2</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:msup><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math>","year":2007,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; University Research Committee, Emory University; Mount Saint Vincent University; National Science Foundation","keywords":"Type (biology); Mathematics; Combinatorics","score_opus":0.018511940353796677,"score_gpt":0.23985099198396553,"score_spread":0.22133905163016887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148613230","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31497946,0.0031718006,0.002724876,0.00054503273,0.0053527146,0.00011874604,0.0010988857,0.00056962186,0.6714389],"genre_scores_gemma":[0.97584504,0.002689422,0.0075758607,0.0012227312,0.0037685733,0.0020284452,0.0028610942,0.0026139175,0.0013949363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9768063,0.0011551438,0.0058677653,0.0037852982,0.006269342,0.006116149],"domain_scores_gemma":[0.97989964,0.0044047832,0.0055828732,0.0066536865,0.0006238114,0.002835176],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005577645,0.0024964751,0.0011563977,0.0016956439,0.0026760106,0.0025833412,0.0061130053,0.0059423214,0.75041264],"category_scores_gemma":[0.0046365387,0.0049796063,0.005152197,0.0036729996,0.004398987,0.0032321957,0.004198442,0.0040783784,0.0046022334],"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.0027603689,0.00079278875,0.00003064404,0.006879753,0.004849715,0.0031463483,0.0073092254,0.0040479535,0.0060501816,0.583159,0.37912574,0.0018482596],"study_design_scores_gemma":[0.00398758,0.0033962738,0.00011454958,0.004399771,0.004030025,0.0039527724,0.008689048,0.058640745,0.90185463,0.0004918298,0.0061794505,0.0042633493],"about_ca_topic_score_codex":0.002407609,"about_ca_topic_score_gemma":0.001949113,"teacher_disagreement_score":0.8958044,"about_ca_system_score_codex":0.000052754865,"about_ca_system_score_gemma":0.0028297168,"threshold_uncertainty_score":0.9992644},"labels":[],"label_agreement":null},{"id":"W2148690319","doi":"10.1016/j.disc.2011.01.008","title":"Existence of cyclic <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>λ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-GDD of type <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mi>g</mml:mi></mml:mrow><mml:mrow><mml:mi>v</mml:mi></mml:mrow></mml:msup></mml:math> having prescribed number of short orbits","year":2011,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Block (permutation group theory); Mathematics; Scroll; Algorithm; Combinatorics; Theology; Philosophy","score_opus":0.021680919208669144,"score_gpt":0.2432433234344426,"score_spread":0.22156240422577345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148690319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7424682,0.002496083,0.0020585663,0.0003216961,0.0047844285,0.00020604413,0.001617197,0.00073335867,0.24531442],"genre_scores_gemma":[0.9748508,0.0027086686,0.008504381,0.0010842425,0.0033857361,0.002941397,0.0029509235,0.0029647527,0.0006091005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9740092,0.0012368282,0.007031361,0.004598736,0.0068625887,0.006261267],"domain_scores_gemma":[0.97887146,0.0041647623,0.006662733,0.006541229,0.00083920156,0.0029206206],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005606943,0.003205884,0.0016458402,0.0015153443,0.0030921914,0.0026049002,0.006647016,0.0066124476,0.10375892],"category_scores_gemma":[0.005061189,0.0056591476,0.0058465484,0.003580768,0.004778148,0.0040006917,0.0053448835,0.0047598416,0.0043068053],"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.0039121276,0.0014066708,0.00006067064,0.008747388,0.006230034,0.0025695965,0.0084760655,0.004686139,0.00956315,0.8863613,0.06651505,0.0014718119],"study_design_scores_gemma":[0.003639498,0.0031634178,0.00012633466,0.00582697,0.005141264,0.004024433,0.006053329,0.30215907,0.6620902,0.0012539446,0.0023724425,0.004149099],"about_ca_topic_score_codex":0.0035942302,"about_ca_topic_score_gemma":0.0017832188,"teacher_disagreement_score":0.88510734,"about_ca_system_score_codex":0.00007215724,"about_ca_system_score_gemma":0.0030024282,"threshold_uncertainty_score":0.9987275},"labels":[],"label_agreement":null},{"id":"W2148892386","doi":"10.1016/j.disc.2014.01.013","title":"A new proof for the Erdős–Ko–Rado theorem for the alternating group","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Coset; Alternating group; Group (periodic table); Discrete mathematics; Combinatorial proof; Algebraic number; Symmetric group","score_opus":0.03293154812879251,"score_gpt":0.30649463699279755,"score_spread":0.27356308886400504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148892386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040097893,0.00027398395,0.98700523,0.00134132,0.00064793945,0.0027898862,0.00004812958,0.00011476506,0.003768949],"genre_scores_gemma":[0.5950759,0.000032562624,0.39745617,0.00071183656,0.0021420566,0.00088194414,0.000015056741,0.00024858786,0.0034358783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998097,0.0000754081,0.00060743024,0.0003112697,0.00039219522,0.00051670393],"domain_scores_gemma":[0.98676455,0.0114483945,0.0004377166,0.0011523645,0.00010685529,0.00009013708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021479784,0.0003569612,0.00042657513,0.00004496007,0.0010444369,0.00019129213,0.0011597401,0.00011778886,0.00005509704],"category_scores_gemma":[0.0026065265,0.00016582393,0.0004563571,0.00012685145,0.0001833309,0.00009029103,0.00022853399,0.00022422992,0.0000031487918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036740134,0.000027557942,0.000008784297,0.00040771134,0.00019658808,1.6948174e-7,0.005224709,0.00002902559,0.000055107303,0.9750901,0.0046861037,0.0142374],"study_design_scores_gemma":[0.00072672026,0.00011348023,0.00001175637,0.0001066317,0.00032966613,0.000011975392,0.0013004304,0.070001885,0.0005739219,0.9118727,0.014700538,0.00025033444],"about_ca_topic_score_codex":0.000007082509,"about_ca_topic_score_gemma":0.000018261528,"teacher_disagreement_score":0.5910661,"about_ca_system_score_codex":0.000026022326,"about_ca_system_score_gemma":0.000026096404,"threshold_uncertainty_score":0.803307},"labels":[],"label_agreement":null},{"id":"W2149824583","doi":"10.1016/j.disc.2008.01.030","title":"Shortened recurrence relations for Bernoulli numbers","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bernoulli number; Mathematics; Stirling numbers of the first kind; Recurrence relation; Stirling number; Stirling numbers of the second kind; Bernoulli's principle; Combinatorics; Bernoulli polynomials; Discrete mathematics; Bernoulli process","score_opus":0.0917419491776357,"score_gpt":0.3525544244270336,"score_spread":0.2608124752493979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149824583","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.11080387,0.00016013163,0.7840859,0.0005954719,0.00042843824,0.0025535806,0.00021220186,0.000862178,0.100298174],"genre_scores_gemma":[0.08355545,0.00006914995,0.8729954,0.00005412539,0.00017401115,0.00050189276,0.000042225405,0.00016876904,0.042438995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977122,0.000024041132,0.00085510954,0.00037868644,0.0005014471,0.0005285171],"domain_scores_gemma":[0.9966339,0.0019514438,0.00034887058,0.00063836406,0.00025294453,0.00017451603],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037263465,0.00035381786,0.00060067134,0.00011293175,0.00045108533,0.00005274315,0.0004146491,0.00015336528,0.00026137175],"category_scores_gemma":[0.002518597,0.00031784136,0.0002995737,0.00026838458,0.00030732612,0.00038700472,0.000112025766,0.00021278972,0.00019014867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011844539,0.000269526,0.000117879244,0.0006118808,0.00008814029,0.000008867646,0.0037069812,0.000015150422,0.00018966841,0.9758983,0.018987333,0.00009440129],"study_design_scores_gemma":[0.00042880443,0.000058291193,0.000027401531,0.00019689398,0.00012716575,0.00008505554,0.001153556,0.0024398654,0.0008975993,0.99247944,0.0016830594,0.00042288302],"about_ca_topic_score_codex":0.0000029501084,"about_ca_topic_score_gemma":0.000011871662,"teacher_disagreement_score":0.088909425,"about_ca_system_score_codex":0.00009602854,"about_ca_system_score_gemma":0.000060748807,"threshold_uncertainty_score":0.99992734},"labels":[],"label_agreement":null},{"id":"W2149865162","doi":"10.1016/j.disc.2007.03.063","title":"Classes of optical orthogonal codes from arcs in root subspaces","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Linear subspace; Mathematics; Projective test; Combinatorics; Projective space; Projective plane; Finite geometry; Projective geometry; Discrete mathematics; Collineation; Pure mathematics; Algebraic geometry; Geometry","score_opus":0.01075960854073414,"score_gpt":0.23306942574860354,"score_spread":0.2223098172078694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149865162","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96693635,0.00025490543,0.020285115,0.000008267288,0.00013747026,0.000098001095,0.000028327111,0.00007352188,0.012178052],"genre_scores_gemma":[0.99616355,0.000008084016,0.003711333,0.000002674564,0.000049872466,0.000004573884,0.000012470774,0.000023785413,0.000023686016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990805,0.000015534364,0.0004092582,0.00009607975,0.00018113446,0.00021753636],"domain_scores_gemma":[0.9993211,0.00035218793,0.000047480647,0.00020298612,0.000018353343,0.000057869416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038536932,0.0001347496,0.00028952074,0.000089427864,0.000015064899,0.000015530986,0.00014108636,0.00008759833,0.00003798212],"category_scores_gemma":[0.000049165028,0.000116931995,0.000068278525,0.00016382067,0.000067906774,0.00006107384,0.000020264415,0.0001198581,0.000015868784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008428613,0.00035539834,0.073654436,0.002105102,0.0003482988,0.00011357558,0.0141507555,0.005658383,0.06990321,0.83181393,0.00028036817,0.0015322389],"study_design_scores_gemma":[0.002553094,0.00024331313,0.13558966,0.0023482605,0.00024516977,0.000057518606,0.027372945,0.08413105,0.33982855,0.40409243,0.0014270046,0.0021110184],"about_ca_topic_score_codex":0.000007952087,"about_ca_topic_score_gemma":0.00029706306,"teacher_disagreement_score":0.42772153,"about_ca_system_score_codex":0.000014715286,"about_ca_system_score_gemma":0.000005521342,"threshold_uncertainty_score":0.47683483},"labels":[],"label_agreement":null},{"id":"W2150983673","doi":"10.1016/j.disc.2005.09.026","title":"The well-covered dimension of random graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Corollary; Dimension (graph theory); Vector space; Discrete mathematics; Graph; Constant (computer programming); Pure mathematics","score_opus":0.01158243144290393,"score_gpt":0.25639333638352607,"score_spread":0.24481090494062213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150983673","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9118672,0.00057887984,0.008231471,0.00016758156,0.00050224276,0.00079524517,0.00003490677,0.00014221716,0.07768025],"genre_scores_gemma":[0.9861513,0.00005177681,0.0121760955,0.000023017697,0.00006484673,0.00001688445,0.0000068998725,0.000046805875,0.0014623882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828786,0.0000906438,0.00070162315,0.00017621327,0.00044308932,0.00030057013],"domain_scores_gemma":[0.99704427,0.0016373742,0.00041111742,0.00076989626,0.00009598581,0.00004135579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007198059,0.00023011756,0.000411336,0.00006504076,0.0004294401,0.000042033724,0.00038593638,0.00010111653,0.00005662724],"category_scores_gemma":[0.00030438643,0.00012800639,0.00028954807,0.00019436402,0.00030247026,0.000060918865,0.00014835395,0.00014698006,0.000008127497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005276061,0.000061165694,0.00010844959,0.00015780808,0.000059329905,0.000002126058,0.0006450764,0.000015964366,0.0006556885,0.9944651,0.0036631627,0.000113357586],"study_design_scores_gemma":[0.0008577871,0.000033390883,0.000118204916,0.000076798526,0.00009692669,0.000010926004,0.00041889676,0.0010663086,0.00519657,0.9906993,0.0012527101,0.00017221825],"about_ca_topic_score_codex":0.00001240868,"about_ca_topic_score_gemma":0.0000116186175,"teacher_disagreement_score":0.07621786,"about_ca_system_score_codex":0.000013570423,"about_ca_system_score_gemma":0.000013977416,"threshold_uncertainty_score":0.5219949},"labels":[],"label_agreement":null},{"id":"W2151612990","doi":"10.1016/j.disc.2005.12.030","title":"On an adjacency property of almost all tournaments","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tournament; Combinatorics; Mathematics; Vertex (graph theory); Adjacency list; Discrete mathematics; Property (philosophy); Integer (computer science); Graph; Computer science","score_opus":0.03215702963553921,"score_gpt":0.3041861461422333,"score_spread":0.27202911650669415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151612990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9407735,0.000031093532,0.0023556256,0.00006687494,0.00017324682,0.00045265412,0.000047151487,0.000098173914,0.056001674],"genre_scores_gemma":[0.9596329,0.000010811449,0.03776312,0.000086704895,0.000097355376,0.000016496591,0.000019631569,0.00006782819,0.002305179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982706,0.00007509252,0.0006247788,0.00023937286,0.00048027883,0.00030989357],"domain_scores_gemma":[0.9985035,0.0002116388,0.00034757613,0.0007705319,0.000084438834,0.00008232316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038155227,0.00026730128,0.0004159002,0.00009507323,0.0001288365,0.00003158886,0.0003631948,0.0001143417,0.00023135386],"category_scores_gemma":[0.00019099678,0.00015368004,0.00015727476,0.000119111064,0.000121458914,0.00011862477,0.000101641665,0.00016821397,0.00001142748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030518677,0.00053653476,0.00025186792,0.00037206704,0.00006467932,0.000008745508,0.002592772,0.000019569932,0.0007765375,0.9918061,0.0030641502,0.00047649222],"study_design_scores_gemma":[0.0004039289,0.00021270567,0.00026219338,0.00016960928,0.00008063584,0.000012824015,0.0001687184,0.00076770986,0.003306471,0.9936214,0.0007356331,0.00025815496],"about_ca_topic_score_codex":0.000035723937,"about_ca_topic_score_gemma":0.000015016396,"teacher_disagreement_score":0.053696495,"about_ca_system_score_codex":0.00003016792,"about_ca_system_score_gemma":0.000016981176,"threshold_uncertainty_score":0.626689},"labels":[],"label_agreement":null},{"id":"W2152329689","doi":"10.1016/j.disc.2005.06.043","title":"On a new reformulation of Hadwiger's conjecture","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Homomorphism; Combinatorics; Conjecture; Discrete mathematics; Graph; Class (philosophy); Minor (academic); Computer science","score_opus":0.016026557696064973,"score_gpt":0.2854202328056561,"score_spread":0.2693936751095911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152329689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037696306,0.000034204346,0.948758,0.00028824163,0.000044581902,0.00018584245,0.0000034914847,0.00008379227,0.012905561],"genre_scores_gemma":[0.8341741,0.0000015614856,0.16442195,0.00003417752,0.000035841873,0.000004395023,0.000005352378,0.000013504214,0.0013091099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899304,0.000025476687,0.00025516603,0.00017284902,0.00036300448,0.00019043601],"domain_scores_gemma":[0.99898446,0.00018130221,0.00013771452,0.00060023955,0.00004624102,0.00005003511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001880712,0.00010879196,0.00016442199,0.000114507944,0.000047110618,0.000041509687,0.00049523445,0.000047740545,0.000019857986],"category_scores_gemma":[0.00007417569,0.0000812605,0.000068639274,0.00032639527,0.000044322354,0.00018381768,0.000097622855,0.000099693425,0.000032883036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045810707,0.000033613447,0.000021159665,0.00003136992,0.000005423968,0.0000023895982,0.0003656083,0.0012456536,0.00096689863,0.9957677,0.00031535074,0.0012402553],"study_design_scores_gemma":[0.00022248072,0.00008411308,0.0001348781,0.000047315774,0.000002755344,0.0000047848907,0.00001936171,0.032157045,0.0101748435,0.95685744,0.00019811217,0.000096849406],"about_ca_topic_score_codex":0.00001433621,"about_ca_topic_score_gemma":0.0000046877713,"teacher_disagreement_score":0.7964778,"about_ca_system_score_codex":0.000025409376,"about_ca_system_score_gemma":0.000036202746,"threshold_uncertainty_score":0.3313707},"labels":[],"label_agreement":null},{"id":"W2153047381","doi":"10.1016/s0012-365x(01)00429-0","title":"Cyclic BSEC of block size 3","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Mathematics; Block (permutation group theory); Automorphism; Generalization; Combinatorics; Block design; Block size; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.010955568007798157,"score_gpt":0.1896627000552109,"score_spread":0.17870713204741276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153047381","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86537147,0.00044722497,0.0008652316,0.000016516262,0.00019459665,0.00015335064,0.00001711002,0.00022822402,0.1327063],"genre_scores_gemma":[0.9978362,0.000025496023,0.0010798529,0.000006086655,0.00003211937,0.00000896321,7.329146e-7,0.000028335839,0.0009822112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993787,0.00001232686,0.00026957647,0.000067114896,0.00012330429,0.00014897472],"domain_scores_gemma":[0.9995098,0.00010792787,0.000042719876,0.00028302352,0.000012643388,0.000043851767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009188624,0.00011306738,0.00020660726,0.000029430836,0.000021591952,0.000011070805,0.00013808187,0.000053202424,0.00033179094],"category_scores_gemma":[0.000038997536,0.000098759694,0.00008641811,0.00010844121,0.000033443666,0.000031448297,0.000014007115,0.00006757852,0.0001475081],"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.000017913488,0.0009330586,0.0015862318,0.016261091,0.0015322536,0.00008115336,0.07679213,0.017827548,0.21867505,0.62480766,0.03596521,0.0055206926],"study_design_scores_gemma":[0.0033374235,0.0003784793,0.001276994,0.0021597804,0.0005417991,0.00031840813,0.0102177365,0.56528103,0.18299508,0.19780557,0.032362267,0.003325433],"about_ca_topic_score_codex":8.8840363e-7,"about_ca_topic_score_gemma":9.375983e-7,"teacher_disagreement_score":0.54745346,"about_ca_system_score_codex":0.0000074327745,"about_ca_system_score_gemma":7.3974496e-7,"threshold_uncertainty_score":0.40273035},"labels":[],"label_agreement":null},{"id":"W2153548489","doi":"10.1016/j.disc.2005.12.032","title":"How to build a brick","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Graph factorization; Factor-critical graph; Conjecture; Matching (statistics); Graph; Connected component; Discrete mathematics; Graph power; Line graph","score_opus":0.01802467165638636,"score_gpt":0.283069835033532,"score_spread":0.2650451633771456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153548489","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.011221844,0.000043341868,0.97585905,0.0027758912,0.000060483864,0.00025405694,0.000004176245,0.00019358682,0.0095876],"genre_scores_gemma":[0.347391,0.0000017061543,0.6446702,0.0001588044,0.00008132516,0.000041438485,0.0000022476681,0.000024539153,0.007628711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986663,0.000032112763,0.00017534062,0.00029612402,0.00043052965,0.00039963354],"domain_scores_gemma":[0.9987394,0.00013850321,0.000060189253,0.0008662803,0.000077838,0.000117768686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026548168,0.00014250584,0.00017182546,0.00013904127,0.000098347446,0.00039577237,0.0010896829,0.000036208243,0.000007632707],"category_scores_gemma":[0.00013113928,0.00011879123,0.00007453822,0.00065360946,0.000047500802,0.0003422168,0.00039949565,0.0001067924,0.00015182601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014574749,0.00004352602,0.00004922334,0.00003186504,0.0000054785523,0.000014902362,0.00034263756,0.00009289842,0.0018709874,0.9938681,0.0018086025,0.0018702886],"study_design_scores_gemma":[0.00020140794,0.00007982811,0.0001923679,0.000042838405,0.0000043343134,0.00002804692,0.0001371057,0.020942379,0.0073446357,0.95589644,0.01480105,0.00032959474],"about_ca_topic_score_codex":0.00000576048,"about_ca_topic_score_gemma":0.0000065837353,"teacher_disagreement_score":0.33616918,"about_ca_system_score_codex":0.000030583367,"about_ca_system_score_gemma":0.000019192104,"threshold_uncertainty_score":0.48441657},"labels":[],"label_agreement":null},{"id":"W2153808094","doi":"10.1016/j.disc.2011.12.019","title":"Avoiding 3/2-powers over the natural numbers","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Natural number; Mathematics; Lexicographical order; Sequence (biology); Combinatorics; Discrete mathematics; Natural (archaeology); Arithmetic","score_opus":0.011964409503328352,"score_gpt":0.25287049316825305,"score_spread":0.2409060836649247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153808094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48307,0.0015671625,0.47934204,0.0012106505,0.0025091236,0.00039254903,0.000005631247,0.0006226946,0.03128015],"genre_scores_gemma":[0.9808382,0.000008668256,0.018142162,0.0004900808,0.00012524423,0.000008382763,0.0000015634675,0.000015021478,0.0003707136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890214,0.0000753609,0.00019168321,0.00014166108,0.00028922048,0.0003999067],"domain_scores_gemma":[0.9987964,0.0003925377,0.000104088,0.00061016803,0.000016654967,0.00008013854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009109944,0.0001469815,0.0001349176,0.000032235588,0.0002899708,0.0001805381,0.0008905492,0.00003809744,0.00004415382],"category_scores_gemma":[0.00012801205,0.00008695706,0.00010264326,0.00021146066,0.00006565871,0.00060353277,0.00029035044,0.00025589674,0.0001704187],"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":[7.598711e-7,0.000044067667,0.00014536074,0.000028972532,0.000027274507,0.000002370294,0.012696273,0.0000049374157,0.0004465589,0.98223406,0.0025141516,0.0018551938],"study_design_scores_gemma":[0.0013308444,0.00007669748,0.0080708265,0.0005144278,0.0001525991,0.00061148294,0.020814804,0.5727055,0.012220696,0.33888942,0.042161927,0.002450737],"about_ca_topic_score_codex":0.000005022952,"about_ca_topic_score_gemma":6.093823e-7,"teacher_disagreement_score":0.64334464,"about_ca_system_score_codex":0.000028631131,"about_ca_system_score_gemma":0.000011920421,"threshold_uncertainty_score":0.35460058},"labels":[],"label_agreement":null},{"id":"W2154926368","doi":"10.1016/j.disc.2008.12.027","title":"Error-correcting codes from permutation groups","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Engineering and Physical Sciences Research Council; Government of the United Kingdom; GCHQ","keywords":"Mathematics; Conjecture; Permutation (music); Permutation group; Permutation graph; Combinatorics; Symmetric group; Discrete mathematics; Decoding methods; Construct (python library); Partial permutation; Cyclic permutation; Graph; Algorithm; Computer science","score_opus":0.01787885720311226,"score_gpt":0.2609267653700013,"score_spread":0.24304790816688904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154926368","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.262204,0.000038992937,0.73170084,0.00033876303,0.0001577262,0.000078725505,0.000004140067,0.00026431584,0.0052125216],"genre_scores_gemma":[0.9041493,0.0000033472727,0.095485695,0.00024381939,0.000060134014,0.0000037965656,0.000010262342,0.000006588976,0.000037047168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991038,0.00004754114,0.00021980933,0.00023149999,0.00020459323,0.0001927568],"domain_scores_gemma":[0.9991408,0.00022080452,0.00011429876,0.00043438436,0.00003151676,0.00005820095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002690904,0.00013269846,0.0001602665,0.00007210136,0.0001589749,0.00019845192,0.0005100868,0.000050300172,0.000026186106],"category_scores_gemma":[0.00007698234,0.00011673403,0.000087052154,0.00027230504,0.000025380366,0.0003223862,0.000060655293,0.000117760734,0.0000521023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052774944,0.00009995649,0.00016292748,0.00001783443,0.000023496515,0.000010497668,0.017515117,0.000083867606,0.0017374539,0.9375001,0.00022569818,0.04261777],"study_design_scores_gemma":[0.00016569727,0.0000855701,0.0010984078,0.000075460084,0.000019178344,0.000013646066,0.0011164624,0.094427645,0.002178541,0.90043586,0.00013375754,0.00024974396],"about_ca_topic_score_codex":0.0000055278797,"about_ca_topic_score_gemma":0.000003152682,"teacher_disagreement_score":0.6419453,"about_ca_system_score_codex":0.0000134545235,"about_ca_system_score_gemma":0.0000102600325,"threshold_uncertainty_score":0.47602755},"labels":[],"label_agreement":null},{"id":"W2156236336","doi":"10.1016/j.disc.2012.02.014","title":"Combinatorial types of bicyclic polytopes","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Polytope; Combinatorics; Mathematics; Vertex (graph theory); Bicyclic molecule; Abelian group; Homogeneous space; Equivalence (formal languages); Discrete mathematics; Graph; Stereochemistry; Chemistry","score_opus":0.039172386532622845,"score_gpt":0.32858803930279656,"score_spread":0.2894156527701737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156236336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7792706,0.00086646556,0.09910685,0.00022431834,0.0057681412,0.0019279694,0.00007402769,0.0008220276,0.11193961],"genre_scores_gemma":[0.9105945,0.000014914233,0.08844554,0.000016914928,0.00041658495,0.000036800015,0.000005410896,0.00010816989,0.0003611685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99750394,0.00007941967,0.00096230034,0.00020534966,0.0006127986,0.0006361717],"domain_scores_gemma":[0.9970444,0.0010620428,0.00065422844,0.00091631326,0.00010463439,0.00021840307],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057927286,0.0003750912,0.0008263694,0.0001490036,0.00009940777,0.00002712337,0.0004966066,0.00018687895,0.00015607639],"category_scores_gemma":[0.0014127262,0.00031568744,0.00022779511,0.00038893282,0.00016961507,0.0003432877,0.00022266015,0.00022931796,0.000081726976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014006382,0.0006485306,0.00032339507,0.0006516071,0.000090394096,0.0000011223867,0.0026102182,0.0000016030875,0.0017123267,0.9934051,0.00029503013,0.00024664582],"study_design_scores_gemma":[0.000679626,0.000086663014,0.000042474152,0.00017700622,0.00017243602,0.000017432181,0.0006862383,0.00028675288,0.02232127,0.97454464,0.0006071918,0.00037826478],"about_ca_topic_score_codex":0.000001916007,"about_ca_topic_score_gemma":3.3123064e-7,"teacher_disagreement_score":0.1313239,"about_ca_system_score_codex":0.000045326335,"about_ca_system_score_gemma":0.000032734304,"threshold_uncertainty_score":0.99992955},"labels":[],"label_agreement":null},{"id":"W2157363043","doi":"10.1016/s0012-365x(03)00240-1","title":"Geometric thickness in a grid","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; McGill University","keywords":"Mathematics; Grid; Combinatorics; Discrete mathematics; Geometry","score_opus":0.019560097313012927,"score_gpt":0.25778395519751834,"score_spread":0.23822385788450542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157363043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02474978,0.0001321827,0.96320665,0.00016060387,0.00041286834,0.0001245922,0.0000012630957,0.00005460291,0.011157487],"genre_scores_gemma":[0.6690441,0.000014640984,0.33016646,0.0001724131,0.00006992092,0.000023418443,0.0000064078486,0.000009325863,0.00049332675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991002,0.000048884023,0.00023319162,0.00018992083,0.00025200867,0.00017580925],"domain_scores_gemma":[0.9993914,0.00016013908,0.00006496441,0.0002858751,0.00004946277,0.000048208734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048065133,0.00009432902,0.00012539544,0.00032235569,0.00005256725,0.00009998789,0.00028975078,0.000038817114,0.000025912293],"category_scores_gemma":[0.00027727764,0.0000844903,0.0000393393,0.001582943,0.000012978949,0.00024670182,0.000054863143,0.00008524862,0.00007615558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.922782e-7,0.0001237335,0.00025520977,0.000064565844,0.0000055845685,0.000011775815,0.001143029,0.0037851264,0.0001740826,0.9902277,0.00053369504,0.0036748203],"study_design_scores_gemma":[0.0019402689,0.0001883926,0.006310807,0.00016604431,0.000023347462,0.00029332878,0.000588949,0.41252232,0.011074821,0.53796524,0.027645746,0.0012807619],"about_ca_topic_score_codex":0.00000208139,"about_ca_topic_score_gemma":0.0000032504117,"teacher_disagreement_score":0.6442943,"about_ca_system_score_codex":0.000028144996,"about_ca_system_score_gemma":0.000051134157,"threshold_uncertainty_score":0.34454143},"labels":[],"label_agreement":null},{"id":"W2157516444","doi":"10.1016/j.disc.2008.09.016","title":"Regular graphs are not universal fixers","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Discrete mathematics; Domination analysis","score_opus":0.03252796891485716,"score_gpt":0.2708205054394022,"score_spread":0.23829253652454507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157516444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13569912,0.00007941735,0.8546847,0.0008263878,0.00014665323,0.00032012918,0.000013171878,0.00040861618,0.007821818],"genre_scores_gemma":[0.7820902,0.0000675478,0.21497388,0.00016989782,0.000028240154,0.000014786781,0.0000040194377,0.000035412086,0.0026160446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839914,0.00006489514,0.00022951554,0.00033849644,0.00055741804,0.00041052775],"domain_scores_gemma":[0.99838966,0.00017469814,0.0001356723,0.001044009,0.000098916076,0.00015705194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026393402,0.00017902216,0.00023617453,0.00018606974,0.00027211563,0.000055611094,0.0012492274,0.0000628501,0.000023633027],"category_scores_gemma":[0.00011427533,0.00015740123,0.00013556422,0.00064161944,0.0002809002,0.0004559468,0.00035526635,0.00019381988,0.00012729291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000826068,0.00007577642,0.00022527424,0.00005643359,0.000031502164,0.00021832463,0.0027353363,0.000106701285,0.0008649729,0.994366,0.00086412206,0.00044730518],"study_design_scores_gemma":[0.0012088943,0.0001841863,0.0012601126,0.00016539235,0.000020886164,0.0003145857,0.0019877318,0.06611869,0.016708625,0.90736455,0.0037140977,0.0009522263],"about_ca_topic_score_codex":0.000002227121,"about_ca_topic_score_gemma":0.0000014035945,"teacher_disagreement_score":0.64639103,"about_ca_system_score_codex":0.00003904968,"about_ca_system_score_gemma":0.000044283828,"threshold_uncertainty_score":0.6418636},"labels":[],"label_agreement":null},{"id":"W2159855713","doi":"10.1016/j.disc.2015.10.002","title":"On contact numbers of totally separable unit sphere packings","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Unit sphere; Separable space; Combinatorics; Unit (ring theory); Natural number; Euclidean geometry; Euclidean space; Circle packing; Space (punctuation); Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.10173033196819282,"score_gpt":0.3500127294212309,"score_spread":0.2482823974530381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159855713","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57112175,0.000115574,0.01319952,0.00013299215,0.00016836611,0.00037512084,0.00007649819,0.00014803714,0.41466212],"genre_scores_gemma":[0.9715626,0.000012480822,0.020471632,0.00009315059,0.00005537496,0.000017765062,0.000015229967,0.000064166634,0.007707547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980945,0.00004390042,0.00065221655,0.00020231995,0.0006494398,0.0003576238],"domain_scores_gemma":[0.9976736,0.00089249364,0.0004397768,0.0005253608,0.00030410025,0.00016467343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075306866,0.00026640456,0.0005851112,0.00012655572,0.000053469514,0.000056451274,0.00031049468,0.00011713378,0.00033380184],"category_scores_gemma":[0.0022629546,0.00021106386,0.0001463236,0.00047823344,0.00006345695,0.00016811868,0.000086091335,0.0001679004,0.00011150866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004119653,0.00022593662,0.00007027839,0.0010849861,0.00009278143,0.000009415824,0.005578334,0.000031708223,0.0000439504,0.98540956,0.0072736978,0.00013817704],"study_design_scores_gemma":[0.00087238394,0.00037094537,0.00001301546,0.00045289486,0.00008905214,0.000019548173,0.009917842,0.00091971253,0.0023490435,0.98279804,0.00184849,0.00034901127],"about_ca_topic_score_codex":0.000053970452,"about_ca_topic_score_gemma":0.000017638642,"teacher_disagreement_score":0.4069546,"about_ca_system_score_codex":0.000048965052,"about_ca_system_score_gemma":0.00011866226,"threshold_uncertainty_score":0.86069345},"labels":[],"label_agreement":null},{"id":"W2160761829","doi":"10.1016/j.disc.2009.07.030","title":"On the transversal number and VC-dimension of families of positive homothets of a convex body","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Transversal (combinatorics); Mathematics; Dimension (graph theory); Convex body; Combinatorics; Regular polygon; Discrete mathematics; Convex hull; Mathematical analysis; Geometry","score_opus":0.008605788005068239,"score_gpt":0.24061121999814877,"score_spread":0.23200543199308055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160761829","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7704426,0.000025297666,0.22692256,0.0004268017,0.000023699877,0.0001315306,0.000010163833,0.0000074812147,0.0020098733],"genre_scores_gemma":[0.9848271,0.000008815529,0.015069292,0.00005829793,0.000004602427,9.539131e-7,0.000002389644,0.0000022899062,0.000026242677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993914,0.000032677635,0.00021466565,0.00009027333,0.00021102437,0.000060009403],"domain_scores_gemma":[0.9993051,0.0002812107,0.0001381262,0.00017123969,0.00008697615,0.000017333616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016643685,0.000068886155,0.00015739087,0.000043091986,0.000029024168,0.000009058945,0.00013331688,0.000024177334,0.000006948523],"category_scores_gemma":[0.00003650439,0.000046113604,0.000045339242,0.00016206267,0.000061052146,0.00007061294,0.000022132568,0.00003531245,0.0000012472822],"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.0000136399885,0.00013759125,0.000020225487,0.0000613057,0.00002482282,7.076791e-7,0.007112075,0.00036752262,0.024400244,0.96566695,0.0000600521,0.0021348689],"study_design_scores_gemma":[0.0007324804,0.0008261632,0.006098212,0.0003703219,0.00005428769,0.00002031108,0.00087079796,0.2762014,0.44155625,0.27304363,0.000015643294,0.00021048603],"about_ca_topic_score_codex":0.0000027814704,"about_ca_topic_score_gemma":3.599121e-7,"teacher_disagreement_score":0.6926233,"about_ca_system_score_codex":0.0000036194904,"about_ca_system_score_gemma":0.000016770462,"threshold_uncertainty_score":0.18804581},"labels":[],"label_agreement":null},{"id":"W2160893622","doi":"10.1016/j.disc.2003.10.027","title":"Binary optimal linear rate 1/2 codes","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Circulant matrix; Automorphism group; Linear code; Minimum distance; Discrete mathematics; Binary number; Code (set theory); Binary code; Automorphism; Block code; Decoding methods; Algorithm; Arithmetic","score_opus":0.017284274332645698,"score_gpt":0.255960872085661,"score_spread":0.23867659775301528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160893622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15106055,0.00004715706,0.84424555,0.00062647177,0.00013009206,0.00010884942,0.0000042349993,0.00029236628,0.0034847036],"genre_scores_gemma":[0.56960154,0.000018580256,0.42993388,0.00023415977,0.00005513967,0.000012271351,0.0000036265044,0.000015662028,0.0001251579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991006,0.000035785673,0.00021337393,0.0002310366,0.00016780457,0.00025136615],"domain_scores_gemma":[0.9991082,0.00009633511,0.00008076329,0.00059072155,0.0000377944,0.00008616502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039465496,0.0001523603,0.00017440274,0.000089400695,0.0001479194,0.00011777687,0.00073647726,0.00004809826,0.000020116026],"category_scores_gemma":[0.000045412762,0.00012657075,0.00012005289,0.00036879344,0.00008106639,0.00027090363,0.00023210054,0.00011393633,0.00015251568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043480427,0.00009308435,0.000011016542,0.00004480012,0.00002198038,0.000026607633,0.0022839755,0.0019810877,0.0012183276,0.9937695,0.00008240856,0.00046286115],"study_design_scores_gemma":[0.00091126416,0.00036695684,0.00015843556,0.00022740105,0.000036822184,0.00006256414,0.00050742575,0.09420571,0.014977428,0.88575256,0.002125305,0.00066812895],"about_ca_topic_score_codex":0.000002220342,"about_ca_topic_score_gemma":7.3365277e-7,"teacher_disagreement_score":0.41854098,"about_ca_system_score_codex":0.000015197754,"about_ca_system_score_gemma":0.000033819917,"threshold_uncertainty_score":0.5161406},"labels":[],"label_agreement":null},{"id":"W2161786270","doi":"10.1016/j.disc.2004.10.001","title":"Erratum to “Construction of new extremal self-dual codes” [Discrete Mathematics 263 (2003) 81–91]","year":2004,"lang":"en","type":"erratum","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Dual (grammatical number); Discrete mathematics; Combinatorics","score_opus":0.016396793248745076,"score_gpt":0.24953170746511466,"score_spread":0.2331349142163696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161786270","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.00046993632,0.00065053714,0.9174052,0.0007634257,0.016327413,0.0015476969,0.00022038416,0.0011191524,0.061496254],"genre_scores_gemma":[0.0006973919,0.00028369454,0.96129555,0.00024854628,0.0013090257,0.00008131578,0.00020755063,0.0002441809,0.035632756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.993984,0.00015056776,0.0019105761,0.0012281782,0.0015958503,0.0011308558],"domain_scores_gemma":[0.99395657,0.00019384432,0.0015024398,0.0031223171,0.000581057,0.0006437495],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001022181,0.0012397841,0.0018567625,0.00089376833,0.00032907652,0.0005521478,0.002914026,0.00093407766,0.0001344955],"category_scores_gemma":[0.0004412731,0.0011562078,0.000697438,0.0027640667,0.00028213472,0.00057051517,0.0011350539,0.0013371272,0.0001876721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002068711,0.00036800516,0.000004723355,0.0024537684,0.0004890414,0.000050848415,0.016360736,0.00008588714,0.00010252439,0.59255075,0.38601816,0.0014948662],"study_design_scores_gemma":[0.0014974521,0.0009959722,0.000023698842,0.006201056,0.0009918018,0.0006367434,0.0026078993,0.01955825,0.001220784,0.8458292,0.11700095,0.0034362264],"about_ca_topic_score_codex":0.000036419842,"about_ca_topic_score_gemma":0.000031790594,"teacher_disagreement_score":0.2690172,"about_ca_system_score_codex":0.00022293911,"about_ca_system_score_gemma":0.0014140256,"threshold_uncertainty_score":0.9990888},"labels":[],"label_agreement":null},{"id":"W2163288567","doi":"10.1016/j.disc.2009.12.006","title":"The number of irreducible polynomials of degree <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si115.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math> over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si116.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:mi>q</mml:mi></mml:mrow></mml:msub></mml:math> with given trace and constant terms","year":2010,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Degree (music); Combinatorics; TRACE (psycholinguistics); Constant (computer programming); Discrete mathematics; Physics; Computer science","score_opus":0.01869653219332097,"score_gpt":0.24817503262386428,"score_spread":0.22947850043054333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163288567","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84193575,0.00095033523,0.0033751312,0.00073618215,0.0029947131,0.000148229,0.0008848157,0.00032790576,0.14864692],"genre_scores_gemma":[0.98035616,0.0013119179,0.012797372,0.00087027,0.0016280771,0.0010349768,0.0006593331,0.001016652,0.00032525655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98563683,0.0005814577,0.0036274656,0.002827807,0.0038881903,0.0034382674],"domain_scores_gemma":[0.9847233,0.003436014,0.004726941,0.0052103875,0.0003657435,0.0015375743],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0042499388,0.0017572837,0.00093820755,0.0006810237,0.0025857962,0.0028521062,0.0045313737,0.0028788804,0.037188392],"category_scores_gemma":[0.0017412931,0.0025379055,0.0026840905,0.0020088714,0.0043388135,0.0025814646,0.0037049807,0.0027332895,0.0011634943],"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.0030366916,0.0007997321,0.000057255413,0.002867161,0.0027796943,0.0012017541,0.0059574177,0.00094709964,0.006054475,0.94806516,0.02645088,0.001782685],"study_design_scores_gemma":[0.0042528026,0.0022363274,0.00018956375,0.0033497491,0.0028178187,0.003249493,0.0035257204,0.43045014,0.5432203,0.0018184443,0.0022263555,0.0026632715],"about_ca_topic_score_codex":0.0013878603,"about_ca_topic_score_gemma":0.0014235837,"teacher_disagreement_score":0.9462467,"about_ca_system_score_codex":0.000026139582,"about_ca_system_score_gemma":0.0022937343,"threshold_uncertainty_score":0.99961424},"labels":[],"label_agreement":null},{"id":"W2163424543","doi":"10.1016/j.disc.2009.01.022","title":"Packing and covering <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mstyle mathvariant=\"bold\"><mml:mi>k</mml:mi></mml:mstyle></mml:math>-chain free subsets in Boolean lattices","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Chain (unit); Hypergraph; Center (category theory); Discrete mathematics; Crystallography; Physics","score_opus":0.014458789890085151,"score_gpt":0.23765184926040478,"score_spread":0.22319305937031964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163424543","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97492695,0.00043614508,0.018058047,0.0004702443,0.00040831143,0.000092435606,0.00007595851,0.0002858968,0.005246001],"genre_scores_gemma":[0.9728559,0.00019703644,0.025636949,0.00071650825,0.00027798867,0.00006884899,0.00006262673,0.00012138986,0.00006272968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962721,0.000104643426,0.0009255235,0.00083526113,0.0008983015,0.0009641828],"domain_scores_gemma":[0.9966873,0.00065998477,0.0006919834,0.0016194124,0.000045237975,0.00029608846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001337278,0.00050467934,0.00038466277,0.00020314119,0.00048081973,0.0010064889,0.0014816645,0.00043328447,0.00007258452],"category_scores_gemma":[0.00045641564,0.0005920273,0.0003252244,0.00045968147,0.00026679225,0.0011506464,0.001080753,0.0005432329,0.00023171396],"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.00004351633,0.00015523535,0.00002371941,0.00042009534,0.00010157947,0.00035254465,0.004084581,0.00040205818,0.0013035077,0.99086046,0.00038977666,0.0018629467],"study_design_scores_gemma":[0.00084629195,0.0002717945,0.0002933055,0.00096112216,0.00011386291,0.000312512,0.0011296917,0.96981037,0.0075483997,0.017728476,0.00034417264,0.00064001326],"about_ca_topic_score_codex":0.00012206415,"about_ca_topic_score_gemma":0.00011261215,"teacher_disagreement_score":0.97313195,"about_ca_system_score_codex":0.00002170906,"about_ca_system_score_gemma":0.00015008953,"threshold_uncertainty_score":0.9996531},"labels":[],"label_agreement":null},{"id":"W2163735025","doi":"10.1016/j.disc.2015.10.011","title":"Matching divisible designs with block size four","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Block size; Clique; Divisibility rule; Block (permutation group theory); Graph; Discrete mathematics; Matching (statistics); Clique graph; Line graph; Computer science; Statistics; Voltage graph","score_opus":0.03406893018427814,"score_gpt":0.22406720160125312,"score_spread":0.18999827141697498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163735025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8474965,0.00013519751,0.10099291,0.000028360273,0.000228515,0.00031159743,0.000011001367,0.0006494088,0.05014648],"genre_scores_gemma":[0.98574334,0.0000025727347,0.013541829,0.000013849653,0.00005817327,0.000025070254,0.000001927837,0.00006267286,0.0005505338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913657,0.000026410034,0.00022220642,0.000115039315,0.0002376322,0.0002621238],"domain_scores_gemma":[0.9993264,0.00012243676,0.00004347445,0.0003277047,0.000033929966,0.0001460431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031926684,0.00019114961,0.00023960246,0.000040310686,0.000051187715,0.000075304844,0.00018331203,0.000056697794,0.000019398625],"category_scores_gemma":[0.000027321612,0.00014380667,0.000051273084,0.00016214656,0.000028589315,0.00012042199,0.000025413658,0.00011750639,0.000121512785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013268352,0.0003932284,0.0022870484,0.006193475,0.00163265,0.00045271844,0.13204914,0.25800246,0.019398408,0.56719327,0.011126446,0.0011385046],"study_design_scores_gemma":[0.0041956455,0.0006609972,0.00035835736,0.0021278828,0.0004747546,0.00097005354,0.041023597,0.12821797,0.017640295,0.79518425,0.005804915,0.0033412972],"about_ca_topic_score_codex":0.000004488239,"about_ca_topic_score_gemma":0.0000066885914,"teacher_disagreement_score":0.22799098,"about_ca_system_score_codex":0.000026114776,"about_ca_system_score_gemma":0.000013387755,"threshold_uncertainty_score":0.58642656},"labels":[],"label_agreement":null},{"id":"W2164323648","doi":"10.1016/j.disc.2003.09.015","title":"Enumeration of eulerian and unicursal planar maps","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Eulerian path; Mathematics; Valency; Combinatorics; Bipartite graph; Planar; Enumeration; Simple (philosophy); Discrete mathematics; Pure mathematics; Graph; Lagrangian; Computer science","score_opus":0.02551314916711092,"score_gpt":0.2942163599691722,"score_spread":0.2687032108020613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164323648","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6605464,0.0002300186,0.32331502,0.0007033364,0.0005811267,0.0014826298,0.00012398897,0.0004107161,0.01260676],"genre_scores_gemma":[0.63170356,0.000031115735,0.36787504,0.000023508623,0.00008521522,0.000027042217,0.000016914022,0.00008090453,0.00015667641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832606,0.000033872628,0.00071290485,0.000240685,0.00040328156,0.00028322072],"domain_scores_gemma":[0.9983793,0.00036482295,0.000446651,0.0005844552,0.000110267276,0.00011451051],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035062438,0.0002783241,0.0005415106,0.0001024596,0.00009474222,0.000038879967,0.00024289974,0.00013323595,0.00001945228],"category_scores_gemma":[0.0007463509,0.00024654838,0.00008842,0.00020296902,0.00015347738,0.000201657,0.00008525969,0.00016209448,0.000015494717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009838237,0.00017685509,0.000014625207,0.00065974577,0.00004706453,0.000005615547,0.0035739762,0.000017824046,0.0023430667,0.9929299,0.00009303138,0.00012850999],"study_design_scores_gemma":[0.0009669498,0.00012422955,0.000012404852,0.00029623188,0.00008899504,0.000035617762,0.0010118125,0.00021089926,0.00995262,0.9868977,0.00014213736,0.00026038504],"about_ca_topic_score_codex":0.000006291532,"about_ca_topic_score_gemma":0.000008865966,"teacher_disagreement_score":0.04456002,"about_ca_system_score_codex":0.00006172998,"about_ca_system_score_gemma":0.000053526026,"threshold_uncertainty_score":0.9999987},"labels":[],"label_agreement":null},{"id":"W2164662793","doi":"10.1016/j.disc.2011.11.039","title":"Generalized packing designs","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorial design; Generalization; Block (permutation group theory); Block design; Orthogonal array; Packing problems; Combinatorics; Class (philosophy); Block size; Construct (python library); Discrete mathematics; Computer science; Key (lock); Statistics","score_opus":0.0547393547728578,"score_gpt":0.22740142291409257,"score_spread":0.17266206814123478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164662793","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6662258,0.0002968693,0.16320816,0.00000432375,0.00049556786,0.0002807675,0.000010681525,0.000848903,0.16862893],"genre_scores_gemma":[0.9840621,0.000011550951,0.015591283,0.000011541685,0.000040842282,0.00002264374,0.000003215004,0.000043130258,0.0002137385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938864,0.000020868558,0.00021505928,0.00008153071,0.000094036135,0.00019986057],"domain_scores_gemma":[0.99960774,0.000023751172,0.00002997042,0.00026613238,0.000013206851,0.000059191938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016935097,0.00013375768,0.00017105081,0.00004674445,0.00004364447,0.000021316646,0.00014804577,0.00005469059,0.00024028578],"category_scores_gemma":[0.00001143808,0.000113779235,0.000076349235,0.00009789626,0.000025240492,0.000072530085,0.000015070278,0.00006815968,0.00015333285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008939602,0.00006554564,0.00047233218,0.0008027604,0.00023465764,0.000033468325,0.029561749,0.00046002492,0.01749322,0.9484662,0.0013983326,0.0010027979],"study_design_scores_gemma":[0.0014673765,0.00013524528,0.0007265546,0.0006203016,0.0002614866,0.00014379292,0.0067516,0.1357495,0.15259258,0.69489837,0.0045805355,0.0020726458],"about_ca_topic_score_codex":0.0000025357365,"about_ca_topic_score_gemma":0.0000016313492,"teacher_disagreement_score":0.31783625,"about_ca_system_score_codex":0.000010691659,"about_ca_system_score_gemma":0.0000027502779,"threshold_uncertainty_score":0.46397826},"labels":[],"label_agreement":null},{"id":"W2165426231","doi":"10.1016/s0012-365x(03)00086-4","title":"Homomorphisms and oriented colorings of equivalence classes of oriented graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Homomorphism; Combinatorics; Chromatic scale; Friendship graph; Windmill graph; Discrete mathematics; Digraph; Vertex (graph theory); Integer (computer science); Critical graph; Graph; Equivalence (formal languages); Graph homomorphism; Line graph; Graph power; Computer science","score_opus":0.023863299157697044,"score_gpt":0.289789815704448,"score_spread":0.265926516546751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165426231","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.47601297,0.00018326836,0.5181875,0.000033525946,0.000060938717,0.00029379124,0.000014386696,0.000053546086,0.0051600677],"genre_scores_gemma":[0.8393361,0.000060589773,0.16043372,0.00000892963,0.0000015589908,0.00001418245,0.0000011821461,0.0000128134125,0.00013093707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840844,0.000088573455,0.00045069016,0.00028172534,0.00047335052,0.00029720744],"domain_scores_gemma":[0.9982921,0.00039964519,0.00028892735,0.0006782363,0.00023612741,0.00010496039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005512172,0.00015881869,0.00034560196,0.00019586158,0.00006730725,0.000020564603,0.00050097634,0.00005193564,0.000015023649],"category_scores_gemma":[0.000523752,0.00013468873,0.00007386566,0.0009453314,0.00046402705,0.00029417814,0.00023629935,0.00011962605,0.0000027692154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007291346,0.00008767099,0.00078843016,0.00024442142,0.000022890077,0.000004303351,0.0008986673,0.000008624343,0.006915261,0.99086857,0.0000073052224,0.00014655892],"study_design_scores_gemma":[0.0007670969,0.0004426944,0.00046566245,0.00027856647,0.000026435957,0.00004141278,0.0011917081,0.0048165545,0.14326017,0.84795296,0.0004503074,0.00030645067],"about_ca_topic_score_codex":0.0000020527173,"about_ca_topic_score_gemma":7.735654e-7,"teacher_disagreement_score":0.3633231,"about_ca_system_score_codex":0.000013262961,"about_ca_system_score_gemma":0.000048019505,"threshold_uncertainty_score":0.5492447},"labels":[],"label_agreement":null},{"id":"W2166525679","doi":"10.1016/j.disc.2011.11.027","title":"Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Enumeration; Genus; Embedding; Discrete mathematics","score_opus":0.037800835729499827,"score_gpt":0.28083531937180994,"score_spread":0.24303448364231012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166525679","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98142487,0.0002704963,0.007666908,0.000017541275,0.00006007056,0.00019231241,0.00010277479,0.000018130366,0.0102468915],"genre_scores_gemma":[0.95101964,0.000043567466,0.048533723,0.0000072362595,0.000009882385,0.0000060871407,0.000016432085,0.000019632083,0.00034378745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884754,0.00003775654,0.00062093884,0.00013324885,0.0002027825,0.00015774241],"domain_scores_gemma":[0.99876535,0.00030317024,0.0005000967,0.0002846218,0.000099764366,0.000047011425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024513036,0.0001369106,0.00046610224,0.0000865759,0.000025318215,0.0000039623997,0.00014308502,0.000099688215,0.0002948007],"category_scores_gemma":[0.000325074,0.000113244045,0.00006509113,0.00025252026,0.00020841463,0.0000943651,0.00006818024,0.00007159831,0.0000041665007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007075661,0.0012235692,0.015504439,0.0046737143,0.0004032712,0.000004105035,0.022081159,4.5315008e-7,0.007835121,0.9430705,0.0035163632,0.0016165758],"study_design_scores_gemma":[0.00083297887,0.00022966755,0.0006989259,0.00021650987,0.00030931417,0.000028002227,0.0039865905,0.00025993394,0.2615529,0.7314148,0.00020927754,0.00026108508],"about_ca_topic_score_codex":0.00005522099,"about_ca_topic_score_gemma":0.0000031583406,"teacher_disagreement_score":0.25371778,"about_ca_system_score_codex":0.0000060141915,"about_ca_system_score_gemma":0.000022943897,"threshold_uncertainty_score":0.4617958},"labels":[],"label_agreement":null},{"id":"W2166530698","doi":"10.1016/s0012-365x(02)00802-6","title":"An improved upper bound for queens domination numbers","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Domination analysis; Discrete mathematics; Graph; Vertex (graph theory); Mathematical analysis","score_opus":0.01858940680374713,"score_gpt":0.32251044383524996,"score_spread":0.3039210370315028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166530698","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.019575756,0.000020564856,0.9755283,0.00013375243,0.000114509734,0.00054854766,0.000008313185,0.00011294526,0.0039573256],"genre_scores_gemma":[0.34324405,0.000004069309,0.6556771,0.00007625689,0.000024676721,0.00011439051,0.00000821665,0.000029817598,0.0008214619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987473,0.00007812295,0.00024646794,0.00031365716,0.000240511,0.00037395378],"domain_scores_gemma":[0.9985787,0.0002644603,0.00010374993,0.0007872788,0.000142077,0.00012371103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077704666,0.00014761063,0.0001720232,0.00009465311,0.00019062089,0.00022795734,0.00062723167,0.000060483824,0.000018324872],"category_scores_gemma":[0.0003390987,0.00012783859,0.000091899485,0.00025958812,0.00008177271,0.0006363673,0.00005042283,0.00009580313,0.000022848742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004849096,0.00007206583,0.000027043825,0.000058173257,0.000012754263,9.742193e-7,0.0016623583,0.000024251303,0.0041750288,0.99248546,0.00006577878,0.0014112414],"study_design_scores_gemma":[0.00050520577,0.00014064608,0.000021668182,0.000017382912,0.000008421243,0.00001093716,0.0005503465,0.15678066,0.01194081,0.8282642,0.0015185385,0.00024121367],"about_ca_topic_score_codex":0.0000019160482,"about_ca_topic_score_gemma":0.000005173476,"teacher_disagreement_score":0.3236683,"about_ca_system_score_codex":0.00004728514,"about_ca_system_score_gemma":0.000052655185,"threshold_uncertainty_score":0.5213106},"labels":[],"label_agreement":null},{"id":"W2167228424","doi":"10.1016/j.disc.2007.10.022","title":"On <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si20.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-transversals of chordal graphs","year":2007,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Transversal (combinatorics); Chordal graph; Mathematics; Combinatorics; Graph; Algorithm; Discrete mathematics; Mathematical analysis","score_opus":0.02070235063290941,"score_gpt":0.2688354726682089,"score_spread":0.2481331220352995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167228424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5535909,0.0010195263,0.025766743,0.00057492295,0.0021909864,0.000102423764,0.0005234867,0.00029571215,0.4159353],"genre_scores_gemma":[0.97826785,0.0009675734,0.016452093,0.0009352254,0.000979602,0.0005437144,0.0005868263,0.00078741345,0.00047972516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9872808,0.00052897853,0.0026229657,0.0021167523,0.0041657714,0.00328476],"domain_scores_gemma":[0.98839664,0.003536707,0.0024055615,0.003947732,0.0002969265,0.0014164412],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0041834563,0.0011383459,0.0005696901,0.0009241279,0.0014709809,0.0013747627,0.004183997,0.0020067822,0.16959295],"category_scores_gemma":[0.002336084,0.001972294,0.0023602105,0.0022770735,0.0026294657,0.0018646466,0.0024173064,0.0021610102,0.0019234887],"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.0014114713,0.0005872804,0.00001319717,0.0023137063,0.0014015614,0.0013512444,0.005232,0.0017594001,0.0037497135,0.9124677,0.06762944,0.0020832475],"study_design_scores_gemma":[0.0020454922,0.0021864222,0.00006764859,0.0019932108,0.0009000623,0.0007645342,0.0024082588,0.14086893,0.8425256,0.0032785125,0.0012273388,0.0017339754],"about_ca_topic_score_codex":0.00045372944,"about_ca_topic_score_gemma":0.00070479896,"teacher_disagreement_score":0.9091892,"about_ca_system_score_codex":0.000025148804,"about_ca_system_score_gemma":0.0012598691,"threshold_uncertainty_score":0.999829},"labels":[],"label_agreement":null},{"id":"W2169487918","doi":"10.1016/j.disc.2011.10.018","title":"Upper bounds for the bondage number of graphs on topological surfaces","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Graph; Upper and lower bounds; Genus; Mathematical proof; Domination analysis; Planar graph; Discrete mathematics; Surface (topology); Geometry; Botany; Biology","score_opus":0.06550048523045542,"score_gpt":0.3397857713035316,"score_spread":0.2742852860730762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169487918","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.20425278,0.00011554314,0.7648405,0.00044387154,0.00019972358,0.0007358497,0.00002601598,0.00011822089,0.029267535],"genre_scores_gemma":[0.82367265,0.000018506877,0.1754798,0.0000688419,0.000010636548,0.000049016744,8.454332e-7,0.000014215415,0.0006854633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988592,0.000051514788,0.00025961894,0.0002200717,0.0003094212,0.00030017018],"domain_scores_gemma":[0.9980416,0.00090181944,0.00011878187,0.00079860596,0.000083840554,0.000055295735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006352629,0.00013563801,0.00020241742,0.000045140037,0.00015942828,0.000047642945,0.0011849685,0.00005564091,0.000100654404],"category_scores_gemma":[0.0001929261,0.00007528215,0.00015979672,0.00025261787,0.00033656112,0.0001482047,0.0002185557,0.0001271361,0.00003514704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016331966,0.00008191093,0.00037012936,0.000039052968,0.00002494072,0.000001431841,0.0023440123,0.0000054764237,0.00010948973,0.9963298,0.00011602537,0.0005614398],"study_design_scores_gemma":[0.00017494085,0.00015059134,0.00052289176,0.000023751252,0.000009575031,0.00000738632,0.0004912965,0.008148975,0.004756204,0.9850935,0.0004991593,0.0001217626],"about_ca_topic_score_codex":0.0000041068415,"about_ca_topic_score_gemma":0.0000015141255,"teacher_disagreement_score":0.6194199,"about_ca_system_score_codex":0.000008935966,"about_ca_system_score_gemma":0.000017839397,"threshold_uncertainty_score":0.3069917},"labels":[],"label_agreement":null},{"id":"W2170800107","doi":"10.1016/s0012-365x(01)00046-2","title":"Star forests, dominating sets and Ramsey-type problems","year":2002,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Star (game theory); Graph; Upper and lower bounds; Complete bipartite graph; Discrete mathematics; Minimum degree spanning tree; Edge-transitive graph; Graph power; Line graph","score_opus":0.038758774683058876,"score_gpt":0.29286162080845174,"score_spread":0.25410284612539286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170800107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2776404,0.0014427359,0.7066926,0.0010599829,0.00018234273,0.0010576668,0.00000928297,0.00045567425,0.011459354],"genre_scores_gemma":[0.6617229,0.00008619101,0.33713993,0.000052634878,0.000022153026,0.000024322075,0.000002067046,0.000030077332,0.0009197322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864465,0.000051976756,0.00025935457,0.0003016232,0.00035618857,0.00038621464],"domain_scores_gemma":[0.99883544,0.00026288792,0.000105551524,0.0005860012,0.00008455302,0.00012557724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044135324,0.000160522,0.0001983883,0.000099206205,0.0001683448,0.00019839323,0.00060473935,0.000049805825,0.000043566157],"category_scores_gemma":[0.00023364183,0.00013146049,0.00003918591,0.0004060458,0.00011883914,0.0004361444,0.00040142157,0.00017162898,0.00007924229],"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.000005752881,0.00017825789,0.00075798755,0.0007401032,0.00005712532,0.00005099893,0.016050262,0.00017507917,0.0015208644,0.9374907,0.0007620832,0.0422108],"study_design_scores_gemma":[0.0003314587,0.00012458948,0.00012444344,0.00010833984,0.0000060014263,0.00004555821,0.00019736467,0.5919352,0.00049721956,0.40573788,0.0006452287,0.00024672248],"about_ca_topic_score_codex":0.0000015624074,"about_ca_topic_score_gemma":0.0000050003496,"teacher_disagreement_score":0.5917601,"about_ca_system_score_codex":0.000020711264,"about_ca_system_score_gemma":0.000008144867,"threshold_uncertainty_score":0.53608036},"labels":[],"label_agreement":null},{"id":"W2171224738","doi":"10.1016/j.disc.2012.11.016","title":"Nonincident points and blocks in designs","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Steiner system; Block (permutation group theory); Projective plane; Integer (computer science); Order (exchange); Discrete mathematics; Set (abstract data type); Upper and lower bounds; Projective test; Blocking set; Projective space; Pure mathematics; Collineation; Geometry; Computer science; Mathematical analysis","score_opus":0.017609548280486755,"score_gpt":0.22740561784222574,"score_spread":0.209796069561739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171224738","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98354125,0.0005106661,0.0063817822,0.00000905991,0.00013303143,0.00013176343,0.0000029322184,0.00008237911,0.009207134],"genre_scores_gemma":[0.99753356,0.00001520543,0.0022898135,0.0000087914905,0.000034934958,0.000016070708,0.0000013491892,0.000020410249,0.00007985727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945045,0.00001703754,0.00018010642,0.000053840213,0.0000799551,0.00021863285],"domain_scores_gemma":[0.9997103,0.00005285519,0.000019032737,0.00014067067,0.000004855399,0.000072243136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031356758,0.000101675665,0.00014322117,0.000056423647,0.00002034378,0.000018499506,0.00006222198,0.000046985417,0.000035193152],"category_scores_gemma":[0.000017259117,0.00008900943,0.00002485026,0.000078147816,0.00001988528,0.00009650014,0.000019167455,0.000074505486,0.000037562884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025647445,0.00050071976,0.113535024,0.0043655024,0.00035988507,0.00006201361,0.14141245,0.0016939488,0.02727246,0.7026792,0.0022769321,0.0058161756],"study_design_scores_gemma":[0.005515452,0.000301927,0.07953077,0.0038118605,0.0004491059,0.0010786493,0.040919986,0.35420147,0.08124747,0.418193,0.0090426095,0.005707691],"about_ca_topic_score_codex":0.0000018882678,"about_ca_topic_score_gemma":0.0000035112712,"teacher_disagreement_score":0.35250753,"about_ca_system_score_codex":0.000015705074,"about_ca_system_score_gemma":0.0000016220262,"threshold_uncertainty_score":0.3629699},"labels":[],"label_agreement":null},{"id":"W2175518075","doi":"10.1016/j.disc.2003.05.001","title":"Induced matchings in intersection graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Chordal graph; Indifference graph; Split graph; Block graph; Discrete mathematics; Pathwidth; Induced subgraph; Intersection graph; Matching (statistics); Interval graph; 1-planar graph; Cograph; Line graph; Graph; Vertex (graph theory)","score_opus":0.026987633859876316,"score_gpt":0.3014352730218232,"score_spread":0.2744476391619469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175518075","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.4400026,0.000019079049,0.5449464,0.000097431934,0.00014578104,0.00021683895,6.008592e-7,0.00011374755,0.014457568],"genre_scores_gemma":[0.923646,0.000004104708,0.07612487,0.000050030023,0.000004317058,0.000024705267,5.928414e-7,0.000014048145,0.00013138338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878037,0.0001058384,0.0002696711,0.00026002002,0.00027265734,0.0003114203],"domain_scores_gemma":[0.9991422,0.00013585537,0.00007839309,0.00053614547,0.0000368277,0.00007056832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006691866,0.00013159946,0.00016570977,0.00028410353,0.00006377183,0.00009914657,0.0005464577,0.00005391336,0.00001891492],"category_scores_gemma":[0.00022642473,0.00011614936,0.000063680294,0.00078083255,0.000038618542,0.00044315128,0.00011754173,0.00024158497,0.000058205118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017277588,0.000048833375,0.00020897698,0.000030488012,0.000005520597,0.000009423743,0.0030146663,0.000017842236,0.0025734156,0.99313,0.000014505912,0.0009445663],"study_design_scores_gemma":[0.00024456266,0.000048340447,0.00017680781,0.00005341107,0.0000015456209,0.000026841173,0.0006965099,0.0073502185,0.0067226947,0.98440087,0.00011081063,0.0001674022],"about_ca_topic_score_codex":0.0000061520027,"about_ca_topic_score_gemma":0.000012666428,"teacher_disagreement_score":0.48364335,"about_ca_system_score_codex":0.000050940867,"about_ca_system_score_gemma":0.000026180898,"threshold_uncertainty_score":0.47364333},"labels":[],"label_agreement":null},{"id":"W2179550966","doi":"10.1016/j.disc.2011.03.028","title":"The crossing number of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si8.gif\" display=\"inline\" overflow=\"scroll\"><mml:msubsup><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msubsup><mml:mspace width=\"0.16667em\"/><mml:mi>□</mml:mi><mml:mspace width=\"0.16667em\"/><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>","year":2011,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Research Nova Scotia; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; Agentúra na Podporu Výskumu a Vývoja","keywords":"Cartesian product; Combinatorics; Mathematics; Graph; Crossing number (knot theory); Vertex (graph theory); Discrete mathematics","score_opus":0.024330179051812898,"score_gpt":0.2668875939251289,"score_spread":0.242557414873316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179550966","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17747723,0.003931997,0.007458856,0.0020878583,0.0075604348,0.00017248603,0.0014221718,0.0008998499,0.7989891],"genre_scores_gemma":[0.9569376,0.004131663,0.01643651,0.003314194,0.005254867,0.00463964,0.003294882,0.0039870525,0.0020035983],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9638398,0.0025801263,0.006975416,0.0064440626,0.010288341,0.009872246],"domain_scores_gemma":[0.9668327,0.008085173,0.00862015,0.010609822,0.0009809296,0.00487123],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.009143555,0.0034854852,0.0013140292,0.0023720784,0.007183819,0.007731403,0.012086286,0.00786989,0.8898268],"category_scores_gemma":[0.008506335,0.0071287374,0.007297501,0.0058327843,0.010394209,0.00657588,0.010633889,0.0069956593,0.0072848676],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004312037,0.0010868737,0.00006188031,0.0040599653,0.0052439314,0.0044113602,0.008314657,0.0031454703,0.003428464,0.34502465,0.61741257,0.0034981845],"study_design_scores_gemma":[0.0056467364,0.0040995977,0.0001808232,0.0050384817,0.004668049,0.0056073577,0.008111059,0.02439905,0.92480624,0.0016212673,0.009309218,0.006512108],"about_ca_topic_score_codex":0.004879994,"about_ca_topic_score_gemma":0.007822135,"teacher_disagreement_score":0.9213778,"about_ca_system_score_codex":0.00007891835,"about_ca_system_score_gemma":0.0072747013,"threshold_uncertainty_score":0.99984545},"labels":[],"label_agreement":null},{"id":"W2181210596","doi":"10.1016/j.disc.2015.10.040","title":"Constructing new covering arrays from LFSR sequences over finite fields","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Linear feedback shift register; Mathematics; Finite field; Combinatorics; Discrete mathematics; Arithmetic; Shift register; Computer science; Telecommunications","score_opus":0.03939350846225521,"score_gpt":0.26092098253967705,"score_spread":0.22152747407742185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181210596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06690722,0.00006669201,0.91646725,0.0003156321,0.00041787088,0.00007434538,0.000008214943,0.00019207559,0.015550703],"genre_scores_gemma":[0.6630592,0.000006299381,0.33633742,0.00025485814,0.00016535535,0.000003861888,0.000005366379,0.000012212993,0.0001554627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893713,0.00003829366,0.00025550055,0.00025304477,0.00028270003,0.00023334094],"domain_scores_gemma":[0.9987083,0.00041397338,0.00014130949,0.00052437175,0.000035967518,0.00017606038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002776407,0.0001581532,0.00020744318,0.000062405124,0.00008174469,0.00028495924,0.0006936497,0.00006951744,0.000057774265],"category_scores_gemma":[0.00021894851,0.00013825753,0.00009482135,0.0002641094,0.00006442255,0.00040464746,0.00024026998,0.00014669941,0.000045060668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064332653,0.000024229714,0.001419995,0.00003291251,0.000059625454,0.0000218688,0.013053097,0.00047933063,0.00015961753,0.9744179,0.0012688529,0.00905613],"study_design_scores_gemma":[0.00032933473,0.00005283481,0.00002682243,0.00012906491,0.000018814291,0.000012129262,0.0016346255,0.075705774,0.0016072972,0.9190781,0.0011097513,0.00029547198],"about_ca_topic_score_codex":0.00008002956,"about_ca_topic_score_gemma":0.00002249679,"teacher_disagreement_score":0.59615195,"about_ca_system_score_codex":0.000022894827,"about_ca_system_score_gemma":0.000078355224,"threshold_uncertainty_score":0.56379783},"labels":[],"label_agreement":null},{"id":"W2200162493","doi":"10.1016/j.disc.2016.08.005","title":"The complexity of signed graph and edge-coloured graph homomorphisms","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Signed graph; Homomorphism; Mathematics; Combinatorics; Discrete mathematics; Graph homomorphism; Vertex (graph theory); Conjecture; Graph; Line graph; Voltage graph","score_opus":0.0429401250024845,"score_gpt":0.28911771706390726,"score_spread":0.24617759206142276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2200162493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036958802,0.00027265638,0.95823944,0.0019789652,0.000097504104,0.000432495,0.000023990826,0.00010401934,0.0018921023],"genre_scores_gemma":[0.9079445,0.00011855726,0.091502845,0.000031753814,0.000016277543,0.00003599926,8.840324e-7,0.00002023464,0.00032892736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984018,0.00013670765,0.00036754837,0.0002793114,0.00043386055,0.0003807399],"domain_scores_gemma":[0.997546,0.0009850622,0.00021092962,0.0009927124,0.00014384156,0.00012144662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084102456,0.00017131655,0.0002688749,0.00011311184,0.00029563857,0.000087514796,0.0011873206,0.000051405797,0.000010137908],"category_scores_gemma":[0.000272055,0.00008695156,0.0001078954,0.00046541722,0.0018485177,0.0002481005,0.00046546472,0.00009785984,0.000012804159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011460559,0.000036101897,0.000047521327,0.000038810824,0.000030413335,0.0000030087108,0.0005230812,7.1626414e-7,0.0074496646,0.9869259,0.00010653194,0.004826817],"study_design_scores_gemma":[0.00037666835,0.00010923498,0.0004096749,0.000061977065,0.000007752993,0.000013119753,0.00013130017,0.0010562433,0.007588751,0.98995364,0.0001489767,0.00014265749],"about_ca_topic_score_codex":0.0000020571795,"about_ca_topic_score_gemma":0.0000065754853,"teacher_disagreement_score":0.87098575,"about_ca_system_score_codex":0.00001357462,"about_ca_system_score_gemma":0.000028392125,"threshold_uncertainty_score":0.68109405},"labels":[],"label_agreement":null},{"id":"W2214784206","doi":"10.1016/j.disc.2015.10.007","title":"Mapping planar graphs into the Coxeter graph","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre National de la Recherche Scientifique; China Scholarship Council; Université Paris-Sud; Javna Agencija za Raziskovalno Dejavnost RS; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Coxeter group; Combinatorics; Coxeter graph; Planar graph; Discrete mathematics; Artin group; Coxeter element; Outerplanar graph; Graph minor; Coxeter complex; Graph homomorphism; Line graph; Graph; Voltage graph","score_opus":0.04711086523227034,"score_gpt":0.30476144166333313,"score_spread":0.2576505764310628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2214784206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022790428,0.00025557497,0.96543616,0.0017229543,0.00020369126,0.00034637164,0.0000027263177,0.00022081131,0.00902128],"genre_scores_gemma":[0.58086544,0.000038072325,0.41724268,0.00070874044,0.00007957887,0.00010916507,0.0000073935685,0.000053620966,0.0008953213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819934,0.00012489018,0.00030547395,0.00030433544,0.00064927,0.00041666348],"domain_scores_gemma":[0.99802506,0.00030028078,0.00011760625,0.0012259884,0.00012780605,0.00020324852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00114204,0.00018998705,0.00020527065,0.00019446471,0.00022282322,0.00023107653,0.0018778149,0.000052973523,0.000006708332],"category_scores_gemma":[0.00021713626,0.000118323296,0.00011801731,0.0009080542,0.00023954727,0.00038823966,0.0003888631,0.00024623942,0.00015639121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041443423,0.00003302436,0.00013096021,0.00004078957,0.00003502217,0.0000197099,0.027947573,0.000040539104,0.00023116916,0.9680456,0.0013013877,0.0021701052],"study_design_scores_gemma":[0.0002228827,0.00004902451,0.00003967308,0.000036022913,0.000004042803,0.000024743564,0.0027199797,0.013044914,0.0003936736,0.98019344,0.003080893,0.00019072194],"about_ca_topic_score_codex":0.000008847614,"about_ca_topic_score_gemma":0.000006807177,"teacher_disagreement_score":0.558075,"about_ca_system_score_codex":0.000030690182,"about_ca_system_score_gemma":0.000049000962,"threshold_uncertainty_score":0.4825084},"labels":[],"label_agreement":null},{"id":"W2216111877","doi":"10.1016/j.disc.2015.12.005","title":"The difference and ratio of the fractional matching number and the matching number of graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Vertex (graph theory); Graph; Alpha (finance); Discrete mathematics; Bipartite graph; Statistics","score_opus":0.029488448416568232,"score_gpt":0.3089172482565552,"score_spread":0.279428799839987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2216111877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98180556,0.000054390337,0.012117205,0.0008961634,0.0000608812,0.0004376475,0.000025174799,0.000019351359,0.004583605],"genre_scores_gemma":[0.9925338,0.00003632417,0.0068874145,0.00003828986,0.000018989653,0.00004951165,0.00000145801,0.000018979845,0.00041523352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998754,0.0001685623,0.00046306182,0.00012881185,0.0003412986,0.00014424711],"domain_scores_gemma":[0.9963905,0.0024980074,0.00044618075,0.00051594776,0.00010013784,0.000049213155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011726265,0.00015488942,0.0002808173,0.000014081944,0.0003747849,0.00006467678,0.0003148326,0.000054947683,0.000015916823],"category_scores_gemma":[0.00035888082,0.000069800175,0.000103160586,0.00015901479,0.0007221587,0.00007385004,0.00018517891,0.00020547032,0.000003551148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016279695,0.000038906113,0.0010234779,0.00010968158,0.000056493685,8.0244035e-8,0.0092152525,0.0000027205858,0.00024194554,0.98910576,0.00009209524,0.000097302844],"study_design_scores_gemma":[0.00041604662,0.0000038321596,0.001380628,0.00009788441,0.00009822149,0.000037155613,0.006153596,0.0005348118,0.00043161435,0.99071014,0.00005065697,0.00008543377],"about_ca_topic_score_codex":0.00003158051,"about_ca_topic_score_gemma":0.000018441637,"teacher_disagreement_score":0.010728219,"about_ca_system_score_codex":0.0000069751245,"about_ca_system_score_gemma":0.000027018361,"threshold_uncertainty_score":0.28825802},"labels":[],"label_agreement":null},{"id":"W2218365453","doi":"10.1016/j.disc.2016.11.003","title":"Bounded height interlaced pairs of parking functions","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; National Parks Board - Singapore","keywords":"Mathematics; Bounded function; Quotient; Chebyshev polynomials; Enumeration; Chebyshev filter; Ring (chemistry); Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.03790940045275126,"score_gpt":0.3035160457601983,"score_spread":0.26560664530744704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218365453","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.23703264,0.00005344995,0.7358989,0.00048259387,0.0009675186,0.00091024506,0.00006806369,0.000531566,0.024055032],"genre_scores_gemma":[0.8586902,0.000017400786,0.13742168,0.000018451652,0.00013360068,0.00008550769,0.000003939759,0.00013605854,0.0034931386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973187,0.00008490895,0.0011601169,0.000349492,0.0005978695,0.00048889784],"domain_scores_gemma":[0.99560267,0.0020606562,0.0007776814,0.0011678351,0.00024080068,0.00015033616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005917518,0.00039541858,0.00077668356,0.00016710925,0.00013197327,0.00003812448,0.00051052286,0.00016325813,0.00033582852],"category_scores_gemma":[0.0023514347,0.00025870642,0.00029788274,0.0003327639,0.00024459162,0.00027354254,0.00022609998,0.000159703,0.0001149483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027145898,0.0003775705,0.000089427565,0.00073870184,0.0001763437,0.0000060039033,0.002540809,0.0000010525134,0.00789705,0.9851856,0.001667523,0.0012927657],"study_design_scores_gemma":[0.0009968452,0.00013183258,0.0000115405055,0.0009034749,0.00014289805,0.000021300937,0.0013754372,0.00028570276,0.013546656,0.98088646,0.001306495,0.00039137594],"about_ca_topic_score_codex":0.0000016778317,"about_ca_topic_score_gemma":0.000006736458,"teacher_disagreement_score":0.6216576,"about_ca_system_score_codex":0.00013719912,"about_ca_system_score_gemma":0.000061130966,"threshold_uncertainty_score":0.9999865},"labels":[],"label_agreement":null},{"id":"W2230116819","doi":"10.1016/j.disc.2016.04.025","title":"On the chromatic number of Latin square graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University; Iran National Science Foundation","keywords":"Mathematics; Latin square; Chromatic scale; Combinatorics; Square (algebra); Discrete mathematics; Geometry","score_opus":0.012626269838465693,"score_gpt":0.21597526861001257,"score_spread":0.20334899877154688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2230116819","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96440095,0.000023204148,0.0044215336,0.000070458445,0.00011938775,0.00019819273,0.00002596377,0.00012426256,0.030616036],"genre_scores_gemma":[0.99932855,0.0000058564374,0.00031445394,0.000011264684,0.000013526585,0.000026636677,0.0000012339249,0.00002939328,0.00026909445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993123,0.00003241329,0.00027176194,0.0000697523,0.00016751251,0.00014625466],"domain_scores_gemma":[0.9990508,0.0004406562,0.000062013976,0.00039882434,0.000017086719,0.00003064445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020753499,0.00012874953,0.0001850546,0.00003017437,0.000035752382,0.000011330726,0.0001799301,0.000045483885,0.00035718436],"category_scores_gemma":[0.00006637916,0.000060766528,0.00010307661,0.00012630569,0.000062460065,0.000038428676,0.000014448382,0.000051406143,0.00034749214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022464183,0.000021920518,0.00024123599,0.0004493353,0.00006402309,0.000001173862,0.0015804863,0.000045412122,0.0036568865,0.9927053,0.0010281162,0.00020387686],"study_design_scores_gemma":[0.00037787165,0.000046714136,0.0004642461,0.0016051215,0.000047027497,0.000013311759,0.0012910562,0.004494475,0.014573023,0.9764756,0.0002916964,0.00031984647],"about_ca_topic_score_codex":5.955449e-7,"about_ca_topic_score_gemma":8.7941885e-7,"teacher_disagreement_score":0.034927577,"about_ca_system_score_codex":0.000009589557,"about_ca_system_score_gemma":0.0000027228066,"threshold_uncertainty_score":0.44664243},"labels":[],"label_agreement":null},{"id":"W2234839101","doi":"10.1016/j.disc.2015.12.015","title":"Bicircular matroids are 3-colorable","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Matroid; Combinatorics; Mathematics; Graphic matroid; Matroid partitioning; Conjecture; Minor (academic); Discrete mathematics; Oriented matroid; Graph; Weighted matroid","score_opus":0.022580380518233262,"score_gpt":0.2829587157284189,"score_spread":0.26037833521018566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2234839101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019215152,0.00009285132,0.9739293,0.001391933,0.00009250554,0.00021513946,0.000007948187,0.00026561,0.0047895596],"genre_scores_gemma":[0.7709589,0.00004139623,0.22462904,0.00016126441,0.000060493177,0.00007258891,0.0000010506907,0.00004861258,0.0040266383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998424,0.000061019116,0.00025913198,0.00033744422,0.0004507242,0.00046766343],"domain_scores_gemma":[0.9982197,0.00026177228,0.00013150043,0.0011509048,0.0000967663,0.00013932901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047042218,0.00016625524,0.00022756866,0.00012866074,0.0001256065,0.00011469878,0.0012531392,0.000057527013,0.00006957652],"category_scores_gemma":[0.00022884797,0.00010137542,0.00010352045,0.0004127029,0.00012623622,0.00052771415,0.00038767394,0.00009296843,0.0006875599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002792649,0.00005838576,0.00035410884,0.00007066574,0.000025009464,0.00003629841,0.00037750078,0.000011527286,0.011375279,0.9836055,0.000507092,0.0035758058],"study_design_scores_gemma":[0.00044692607,0.000070309005,0.00024662903,0.00018732977,0.0000073313804,0.0000375494,0.00017651991,0.0064434567,0.015245175,0.973732,0.0030986534,0.00030811175],"about_ca_topic_score_codex":8.582179e-7,"about_ca_topic_score_gemma":0.0000010682113,"teacher_disagreement_score":0.75174373,"about_ca_system_score_codex":0.000052639152,"about_ca_system_score_gemma":0.0000313598,"threshold_uncertainty_score":0.88374203},"labels":[],"label_agreement":null},{"id":"W2253326806","doi":"10.1016/j.disc.2016.11.032","title":"The coarse geometry of Hartnell’s firefighter problem on infinite graphs","year":2017,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Containment (computer programming); Square tiling; Bounded function; Conjecture; Converse; Euclidean geometry; Discrete mathematics; Property (philosophy); Constant (computer programming); Euclidean space; Grid; Geometry; Computer science; Mathematical analysis","score_opus":0.058459638982851954,"score_gpt":0.3302508096630953,"score_spread":0.27179117068024333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2253326806","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70208883,0.0024097774,0.013739725,0.0053672986,0.0044385516,0.006837794,0.0013314077,0.00075986277,0.26302677],"genre_scores_gemma":[0.9140286,0.00096061005,0.06373065,0.00017958281,0.00037098388,0.0004102283,0.00012603834,0.0003298329,0.019863496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963279,0.00013717129,0.0014057183,0.00059264293,0.00086087215,0.0006757008],"domain_scores_gemma":[0.99120826,0.0027861947,0.0023447832,0.0032471518,0.00025990963,0.00015371483],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014207409,0.0006998232,0.0013070971,0.00046179144,0.00049664476,0.00023656384,0.0019655158,0.00065583497,0.0001853689],"category_scores_gemma":[0.0023787296,0.0004403466,0.0006520893,0.0002664154,0.00074569957,0.00006445122,0.0014192603,0.0011980715,0.00012802529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003649886,0.00042153316,0.0001690975,0.003234567,0.00061694783,0.000025219695,0.0023899358,0.000023881965,0.0000150263395,0.9735175,0.016432472,0.0031173555],"study_design_scores_gemma":[0.00042661699,0.00014161009,0.0000959474,0.00091724546,0.0002762123,0.000016324819,0.00038971633,0.0006353417,0.0003849678,0.99170613,0.0045059426,0.00050392246],"about_ca_topic_score_codex":0.000022933635,"about_ca_topic_score_gemma":0.000017227476,"teacher_disagreement_score":0.24316327,"about_ca_system_score_codex":0.000051936233,"about_ca_system_score_gemma":0.00014801952,"threshold_uncertainty_score":0.99980485},"labels":[],"label_agreement":null},{"id":"W2254581752","doi":"10.1016/j.disc.2016.04.021","title":"Rainbow Ramsey simple structures","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Rainbow; Substructure; Discrete mathematics; Countable set; Graph; Existential quantification; Homogeneous","score_opus":0.03344862536478752,"score_gpt":0.3313598361187121,"score_spread":0.29791121075392457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254581752","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.32993355,0.00013572304,0.63192844,0.0016449299,0.00044385745,0.00076059496,0.00014210577,0.00076822785,0.034242548],"genre_scores_gemma":[0.8996672,0.000023342956,0.09421101,0.00020857454,0.00018136366,0.00003244008,0.000008078825,0.00008373807,0.005584267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859655,0.000076650176,0.0004152974,0.00026374692,0.00022814306,0.00041959016],"domain_scores_gemma":[0.9976541,0.0012954097,0.00020435556,0.00067826704,0.00005589871,0.000111986395],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003474346,0.00025969153,0.00038877554,0.00006775566,0.00015480402,0.000019610306,0.00033918762,0.00016106144,0.0012383746],"category_scores_gemma":[0.0012764215,0.00014979375,0.00013975316,0.00009708998,0.00028277448,0.00014604317,0.000117280455,0.00013016394,0.00016214549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017223747,0.00004277184,0.00006590223,0.00008994357,0.00005305774,0.000011282131,0.0008847976,8.920994e-7,0.0016120488,0.99170226,0.0029281278,0.0025916677],"study_design_scores_gemma":[0.0005181262,0.000038443704,0.000036981495,0.000050291175,0.000041246105,0.000032511398,0.0004772338,0.00004543438,0.0046242443,0.9901849,0.0036924838,0.00025811573],"about_ca_topic_score_codex":7.9506134e-7,"about_ca_topic_score_gemma":0.0000043021514,"teacher_disagreement_score":0.5697336,"about_ca_system_score_codex":0.000038006146,"about_ca_system_score_gemma":0.000023727369,"threshold_uncertainty_score":0.9996746},"labels":[],"label_agreement":null},{"id":"W2397430903","doi":"10.1016/j.disc.2016.04.009","title":"Decompositions of complete graphs into circulants","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.012335997762790976,"score_gpt":0.22011929591447954,"score_spread":0.20778329815168856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2397430903","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8498498,0.0002092425,0.1354414,0.00004187951,0.0002510044,0.00020893886,0.000104473416,0.00025660862,0.013636613],"genre_scores_gemma":[0.99709547,0.000015033759,0.0027979757,0.000004540108,0.000012999643,0.000013568797,0.0000048758993,0.000022972376,0.000032560612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993852,0.000017725972,0.00027406504,0.00007436468,0.00011081197,0.00013786991],"domain_scores_gemma":[0.99950665,0.00009658922,0.00004551652,0.00027662542,0.000023883047,0.000050742296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010667722,0.000107843334,0.00020016622,0.00007461265,0.000037275877,0.000008498757,0.00014786063,0.00004007943,0.000063907806],"category_scores_gemma":[0.000011861183,0.000073225376,0.00009488097,0.000110029796,0.00006377727,0.00006102086,0.000017044498,0.00003271864,0.00007301692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004605604,0.00006216734,0.00062518957,0.0010932029,0.0002303217,0.000005792754,0.003286341,0.00018264572,0.39700687,0.5951851,0.0005600621,0.0017576894],"study_design_scores_gemma":[0.0010113609,0.00008175485,0.0013020666,0.0015115368,0.00011895391,0.000065454275,0.0011617817,0.0126573555,0.046704832,0.93324673,0.0014104043,0.0007277492],"about_ca_topic_score_codex":0.0000018172701,"about_ca_topic_score_gemma":0.0000028558914,"teacher_disagreement_score":0.35030204,"about_ca_system_score_codex":0.000011753836,"about_ca_system_score_gemma":0.0000029333037,"threshold_uncertainty_score":0.29860443},"labels":[],"label_agreement":null},{"id":"W2417722483","doi":"10.1016/j.disc.2016.05.010","title":"Backbone colourings of graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Nuclear Receptors and Signaling","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Alberta; Brock University","funders":"","keywords":"Combinatorics; Mathematics; Corollary; Chromatic scale; Graph; Spanning tree; Discrete mathematics; Undirected graph","score_opus":0.027468604448550937,"score_gpt":0.2543703894024976,"score_spread":0.2269017849539467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2417722483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98643905,0.000009192208,0.0024360681,0.00020593009,0.00008240265,0.00011051784,0.000013949606,0.000049291146,0.010653596],"genre_scores_gemma":[0.9964011,0.000023371045,0.0024340989,0.00005181632,0.000013515636,0.0000028226234,1.3580477e-7,0.000019997378,0.0010531518],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992625,0.000021855762,0.00021985023,0.00013981927,0.00020011682,0.00015585528],"domain_scores_gemma":[0.9993967,0.00020979546,0.00012331475,0.00020248834,0.000018712586,0.000048985286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001194218,0.00008296074,0.00015829717,0.00004622835,0.000043302574,0.00001332532,0.0001800079,0.000032359414,0.000509286],"category_scores_gemma":[0.0002726199,0.000048694215,0.00007570255,0.000115936455,0.000120520766,0.00007275233,0.000058279125,0.000035659596,0.0001410021],"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.000004789962,0.000036735764,0.000074327814,0.000045577985,0.000002631012,0.0000020295467,0.00041413997,4.5797293e-7,0.8777072,0.1207411,0.0002267812,0.000744235],"study_design_scores_gemma":[0.0002778187,0.000060641913,0.00004068435,0.0001548834,0.000009408601,0.0000078173625,0.00010191435,0.00016537048,0.94586444,0.051626716,0.0015660864,0.00012421318],"about_ca_topic_score_codex":0.0000013127033,"about_ca_topic_score_gemma":2.8722891e-7,"teacher_disagreement_score":0.06911438,"about_ca_system_score_codex":0.000008207627,"about_ca_system_score_gemma":0.0000073080146,"threshold_uncertainty_score":0.55763245},"labels":[],"label_agreement":null},{"id":"W2476701528","doi":"10.1016/s0012-365x(01)00209-6","title":"On dijoins","year":2002,"lang":"es","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Arc (geometry); Integer (computer science); Minimum weight; Combinatorics; Weight function; Discrete mathematics; Function (biology); Statistics; Computer science; Geometry","score_opus":0.04444712923435091,"score_gpt":0.31091035705345427,"score_spread":0.26646322781910337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476701528","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.045233484,0.001022532,0.6827967,0.0038017412,0.00069135946,0.0010949475,0.00008573261,0.0005294986,0.26474398],"genre_scores_gemma":[0.9351928,0.0003345198,0.052341476,0.00040021396,0.0001561983,0.000039222174,0.000003591493,0.00009450683,0.011437424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715817,0.00013561244,0.00047112585,0.00056865986,0.00091979397,0.00074662204],"domain_scores_gemma":[0.9969358,0.0007749059,0.00019807724,0.0017345524,0.000094995914,0.0002616562],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004336387,0.0003700326,0.0004022566,0.00024420625,0.00027666707,0.0005406401,0.0015515594,0.00012481144,0.0008095879],"category_scores_gemma":[0.0004641994,0.00031169315,0.00021575783,0.00074903027,0.0002741631,0.00036389328,0.0004989123,0.00045613002,0.0052386806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004120945,0.00031731316,0.00002420959,0.00020746882,0.000038542617,0.000053378204,0.00236426,0.00010027746,0.00012221138,0.98760515,0.0020391345,0.007123917],"study_design_scores_gemma":[0.00048948394,0.0004579629,0.00007047869,0.00051943556,0.000024114113,0.00003242195,0.0001715782,0.39966786,0.0010540605,0.59132284,0.005584915,0.0006048306],"about_ca_topic_score_codex":0.0000011048288,"about_ca_topic_score_gemma":4.716817e-7,"teacher_disagreement_score":0.88995934,"about_ca_system_score_codex":0.00006434644,"about_ca_system_score_gemma":0.000016556258,"threshold_uncertainty_score":0.99993354},"labels":[],"label_agreement":null},{"id":"W2513820396","doi":"10.1016/j.disc.2018.04.008","title":"Size-Ramsey numbers of cycles versus a path","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Foundation","keywords":"Combinatorics; Ramsey's theorem; Graph; Mathematics; Integer (computer science); Path (computing); Discrete mathematics; Computer science","score_opus":0.046524698944634665,"score_gpt":0.335014328802336,"score_spread":0.2884896298577013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513820396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91098297,0.00023755217,0.0053332527,0.00007812227,0.0029191894,0.0011904462,0.000563622,0.0003308424,0.078363985],"genre_scores_gemma":[0.7929088,0.000108117114,0.20552404,0.000035064797,0.0005006915,0.0000674718,0.000042429925,0.00020921775,0.0006041793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966683,0.00014276923,0.0012473873,0.0005959521,0.0008253579,0.00052023854],"domain_scores_gemma":[0.9939806,0.0021631464,0.0013105783,0.0021182548,0.00026513226,0.00016231714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008131896,0.0007132383,0.0013289102,0.00013164805,0.0001926995,0.000079639554,0.0012112987,0.0007002697,0.0004958142],"category_scores_gemma":[0.0024189942,0.0005706811,0.000704732,0.00016697627,0.000643598,0.000064621745,0.0018844763,0.0007233231,0.000022463048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002340912,0.00030828096,0.00012545999,0.007644574,0.0012157877,0.000028104008,0.020550584,0.000016061605,0.000087843655,0.96234024,0.007028849,0.0004201503],"study_design_scores_gemma":[0.00076354446,0.00011935928,0.00004934942,0.0010575907,0.0005353634,0.000010972195,0.0014177698,0.0006885511,0.0008583439,0.9935822,0.00026846505,0.00064848416],"about_ca_topic_score_codex":0.000019669518,"about_ca_topic_score_gemma":0.000011324397,"teacher_disagreement_score":0.2001908,"about_ca_system_score_codex":0.000075398646,"about_ca_system_score_gemma":0.000112570684,"threshold_uncertainty_score":0.99967444},"labels":[],"label_agreement":null},{"id":"W2521095132","doi":"10.1016/j.disc.2017.08.034","title":"Hall sets, Lazard sets and comma-free codes","year":2017,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Connection (principal bundle); Mathematics; Pure mathematics; Combinatorics; Discrete mathematics; Algebra over a field; Geometry","score_opus":0.06979090799221806,"score_gpt":0.3593128241443918,"score_spread":0.28952191615217376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521095132","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58448887,0.008090607,0.15843202,0.010963333,0.015772566,0.02112572,0.0084433025,0.007344718,0.18533888],"genre_scores_gemma":[0.14157747,0.0012900615,0.8509022,0.00020053782,0.0008043382,0.0006426201,0.00027948897,0.0009807835,0.0033225247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948157,0.0001881723,0.0016605392,0.0011055348,0.0012480888,0.0009819486],"domain_scores_gemma":[0.9881076,0.0019859564,0.002387146,0.0067434493,0.00034369354,0.00043212427],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0013691124,0.0014180164,0.0025538336,0.00023097021,0.0006110818,0.0007950068,0.0031830228,0.001053022,0.0000603282],"category_scores_gemma":[0.0061697676,0.0012960582,0.00048161193,0.00008450269,0.00062366255,0.00037103466,0.006966426,0.0017447461,0.00007358353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002334489,0.00040915888,0.000044825632,0.010904579,0.00049280585,0.00008787839,0.0043999203,0.000017345672,0.000035224406,0.9694671,0.013498303,0.0006194938],"study_design_scores_gemma":[0.0011457454,0.00007909709,0.000016338068,0.0028131388,0.0006529708,0.00007542363,0.00054072525,0.0058468706,0.00029864185,0.98617506,0.0009956503,0.0013603531],"about_ca_topic_score_codex":0.000029140705,"about_ca_topic_score_gemma":0.00005408963,"teacher_disagreement_score":0.69247013,"about_ca_system_score_codex":0.00021304739,"about_ca_system_score_gemma":0.00020642504,"threshold_uncertainty_score":0.999857},"labels":[],"label_agreement":null},{"id":"W2549740858","doi":"10.1016/j.disc.2016.08.027","title":"Graph-intersecting set systems and LYM inequalities","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Digraph; Mathematics; Vertex (graph theory); Graph; Limiting; Upper and lower bounds; Complete graph; Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.05286349505153703,"score_gpt":0.30653047238653497,"score_spread":0.25366697733499793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2549740858","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9514832,0.0002757155,0.035880223,0.00014865621,0.0005556249,0.00038353654,0.0000976813,0.00025331185,0.010922068],"genre_scores_gemma":[0.99235314,0.000044527453,0.005963564,0.00003533306,0.00013167952,0.000025694413,0.0000018215552,0.00005427161,0.00138999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850696,0.000100149795,0.00052537635,0.00025029122,0.0002817629,0.00033545823],"domain_scores_gemma":[0.9977817,0.0012932734,0.00025151178,0.00050637824,0.00006487865,0.000102234335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006812308,0.0002624671,0.00042044919,0.000121760946,0.00023620842,0.00008572555,0.00022531323,0.00011062441,0.000055189346],"category_scores_gemma":[0.0006729337,0.00014697328,0.00011147233,0.00009872853,0.0001660337,0.00015245966,0.00020643369,0.00009871196,0.000007612451],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007884809,0.000013529498,0.00036698524,0.0006191654,0.00008333785,0.000005395488,0.009401662,2.5342337e-7,0.00032792185,0.9882968,0.00057150045,0.00030557634],"study_design_scores_gemma":[0.00042564477,0.000052267173,0.00004071598,0.00061341375,0.000068072455,0.0000876706,0.010060635,0.00021999826,0.0005070727,0.98718524,0.00041710038,0.00032215103],"about_ca_topic_score_codex":0.0000085208285,"about_ca_topic_score_gemma":0.0000040281975,"teacher_disagreement_score":0.040869936,"about_ca_system_score_codex":0.000025520787,"about_ca_system_score_gemma":0.000009954879,"threshold_uncertainty_score":0.59933966},"labels":[],"label_agreement":null},{"id":"W2550083616","doi":"10.1016/j.disc.2016.11.001","title":"On 2-limited packings of complete grid graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Grid; Discrete mathematics; Geometry","score_opus":0.03446265618759715,"score_gpt":0.29242364559519884,"score_spread":0.2579609894076017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550083616","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.081036985,0.000024645587,0.911792,0.00078553514,0.00014601059,0.00028420077,0.000051116866,0.00016836761,0.0057111415],"genre_scores_gemma":[0.91889524,0.000021919619,0.08057286,0.000111023546,0.000019818843,0.000019352494,0.0000025900863,0.00002809563,0.00032908565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840915,0.00007047477,0.00034724767,0.00029214757,0.0005322222,0.0003487595],"domain_scores_gemma":[0.99761766,0.0008972894,0.00019458537,0.0010622503,0.00012381724,0.00010441194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041320067,0.00016712968,0.0002706052,0.00021856195,0.000071674345,0.000037596055,0.0011169713,0.00004532334,0.00004090604],"category_scores_gemma":[0.00033864647,0.000100702724,0.00012905206,0.00049884146,0.00022107355,0.00025050677,0.00028128596,0.00009506051,0.00011696455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009034395,0.000056052508,0.000060370443,0.00005054711,0.000020203712,0.0000051923594,0.00043125558,0.000004930049,0.01042171,0.9858511,0.00026252173,0.0028270893],"study_design_scores_gemma":[0.00043076614,0.00019135301,0.00019269915,0.00023362742,0.0000049748883,0.0000078280145,0.000041672818,0.0027633603,0.013127281,0.98242044,0.0003958,0.00019018193],"about_ca_topic_score_codex":0.000001073195,"about_ca_topic_score_gemma":7.435739e-7,"teacher_disagreement_score":0.83785826,"about_ca_system_score_codex":0.00002215829,"about_ca_system_score_gemma":0.000018883979,"threshold_uncertainty_score":0.41065377},"labels":[],"label_agreement":null},{"id":"W2551168410","doi":"10.1016/j.disc.2016.09.008","title":"A simple shift rule for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml13\" display=\"inline\" overflow=\"scroll\" altimg=\"si13.gif\"><mml:mi>k</mml:mi></mml:math>-ary de Bruijn sequences","year":2016,"lang":"nl","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Substring; De Bruijn sequence; Mathematics; Sequence (biology); Combinatorics; Order (exchange); Amortized analysis; String (physics); Simple (philosophy); Discrete mathematics; Algorithm; Data structure; Computer science","score_opus":0.020056188282154667,"score_gpt":0.25692419384793713,"score_spread":0.23686800556578247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551168410","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.846795,0.00044975997,0.14750166,0.0010588861,0.00086369587,0.00023460024,0.00058016815,0.0003287671,0.0021874078],"genre_scores_gemma":[0.96452,0.00031940342,0.03251043,0.00093954406,0.0007417136,0.0003900932,0.000103660925,0.00019878914,0.0002764073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948797,0.00019112561,0.0012172224,0.0011419065,0.0010398822,0.0015301215],"domain_scores_gemma":[0.99439824,0.0019334551,0.0010153801,0.0019540917,0.000114855364,0.00058399217],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019569544,0.00075670274,0.0005696456,0.00022330353,0.0010281972,0.0009639608,0.0022243652,0.0006364426,0.00016461105],"category_scores_gemma":[0.0008256281,0.0007101104,0.0010794215,0.0005934854,0.00078817236,0.0010892202,0.0011634006,0.00048322824,0.0011293628],"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.0001919071,0.00028263338,0.000029875404,0.001065896,0.00038348977,0.00012684985,0.0039812517,0.00010992856,0.0013584965,0.9891107,0.0013607577,0.0019982164],"study_design_scores_gemma":[0.0011423689,0.0008148888,0.000056006575,0.0013881396,0.000453755,0.00020718823,0.00089130964,0.8137662,0.0057955473,0.16919814,0.0052871346,0.0009993531],"about_ca_topic_score_codex":0.00009889299,"about_ca_topic_score_gemma":0.0000893873,"teacher_disagreement_score":0.81991255,"about_ca_system_score_codex":0.00004059789,"about_ca_system_score_gemma":0.0006088197,"threshold_uncertainty_score":0.9996484},"labels":[],"label_agreement":null},{"id":"W2553698168","doi":"10.1016/j.disc.2016.08.014","title":"Zero-sum flows for triple systems","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Zero (linguistics); Mathematics; Combinatorics; Flow (mathematics); Zero-point energy; Discrete mathematics; Physics; Geometry","score_opus":0.013657764512558332,"score_gpt":0.21520396694117505,"score_spread":0.2015462024286167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2553698168","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.10642807,0.00056087156,0.8758946,0.000049842725,0.0020731557,0.0010983229,0.00021095127,0.0007160053,0.012968189],"genre_scores_gemma":[0.9947822,0.000016417698,0.00207783,0.0000052745045,0.00013594552,0.00023075398,0.0000065495565,0.00006777189,0.0026772763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913037,0.000017365579,0.00033298583,0.00012181556,0.00012363186,0.00027381035],"domain_scores_gemma":[0.99931914,0.00017696366,0.000047390473,0.00035149226,0.00003054145,0.00007450509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002885948,0.00016854818,0.00027073736,0.000054384745,0.000054796434,0.000043153777,0.00018044226,0.00008245661,0.0000233495],"category_scores_gemma":[0.000053188764,0.000106576816,0.00012372027,0.00007789595,0.000021081261,0.00009479386,0.000014049187,0.000037167305,0.000137864],"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.000029713612,0.000074446994,0.000081981016,0.004921111,0.00040225143,0.000006894934,0.002590092,0.0016780657,0.061532613,0.8979313,0.027530009,0.0032215582],"study_design_scores_gemma":[0.0052186,0.00031128796,0.000041078132,0.0030815192,0.0003206806,0.00011232446,0.0030873276,0.4506695,0.027041545,0.2979763,0.20970103,0.002438817],"about_ca_topic_score_codex":8.828608e-7,"about_ca_topic_score_gemma":0.0000011619155,"teacher_disagreement_score":0.8883541,"about_ca_system_score_codex":0.000027908249,"about_ca_system_score_gemma":0.000005008783,"threshold_uncertainty_score":0.43460765},"labels":[],"label_agreement":null},{"id":"W2556067267","doi":"10.1016/j.disc.2016.10.016","title":"The strong chromatic index of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml1\" display=\"inline\" overflow=\"scroll\" altimg=\"si1.gif\"><mml:mrow><mml:mo>(</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>Δ</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-bipartite graphs","year":2016,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; Wuhan University of Technology; National Sanitarium Association","keywords":"Edge coloring; Bipartite graph; Combinatorics; Mathematics; Conjecture; Partition (number theory); Graph; Discrete mathematics; Line graph; Graph power","score_opus":0.01711307893769829,"score_gpt":0.2487024743155098,"score_spread":0.2315893953778115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2556067267","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9292507,0.0022541368,0.0047716447,0.0006831265,0.003171943,0.00031635005,0.0016640791,0.0005348949,0.05735312],"genre_scores_gemma":[0.983832,0.0020606082,0.007331044,0.0008534805,0.001967778,0.0013137974,0.00061784056,0.0014265188,0.00059692096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9833346,0.00085198664,0.004600904,0.0025823598,0.0046297773,0.004000368],"domain_scores_gemma":[0.9830365,0.0053456025,0.0051341886,0.0044573997,0.00048172157,0.0015445912],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0043892,0.00213432,0.0012580364,0.0008096705,0.0032077965,0.0020173062,0.004484141,0.0033188052,0.010599583],"category_scores_gemma":[0.0042144097,0.0026034277,0.0036210886,0.0016405674,0.004097804,0.0018529542,0.0036881045,0.0026086273,0.0017052168],"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.0011982254,0.0007086482,0.000027054257,0.00484594,0.0038599216,0.00052667566,0.0067079915,0.0005232401,0.0028357818,0.9466039,0.029802417,0.0023601805],"study_design_scores_gemma":[0.006204624,0.0036748103,0.00014743373,0.009526705,0.0073090754,0.0026075847,0.010851377,0.37269884,0.45063746,0.12614504,0.0048130597,0.005384004],"about_ca_topic_score_codex":0.0004909271,"about_ca_topic_score_gemma":0.00057068624,"teacher_disagreement_score":0.8204589,"about_ca_system_score_codex":0.00006470559,"about_ca_system_score_gemma":0.0012635962,"threshold_uncertainty_score":0.9996924},"labels":[],"label_agreement":null},{"id":"W2558490395","doi":"10.1016/j.disc.2017.09.013","title":"Structure and algorithms for (cap, even hole)-free graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja","keywords":"Mathematics; Combinatorics; Discrete mathematics; Algorithm","score_opus":0.03568801725379487,"score_gpt":0.3306678270001661,"score_spread":0.2949798097463712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2558490395","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.025029536,0.00014430618,0.9717465,0.00093181396,0.00015877488,0.0005883642,0.00013304736,0.00009895679,0.0011687011],"genre_scores_gemma":[0.32024205,0.000024955078,0.67901117,0.000046218356,0.00006371844,0.000046184887,0.0000057660563,0.000031046628,0.000528887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987512,0.00002532443,0.00020172058,0.0003531325,0.00031009837,0.00035851003],"domain_scores_gemma":[0.99719,0.00021620688,0.00019281893,0.0021723993,0.00009713057,0.00013144311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036848692,0.00017669778,0.00024380126,0.00008284092,0.0005806014,0.0005222262,0.0023795618,0.000073276555,0.000005850732],"category_scores_gemma":[0.00056832103,0.00014029263,0.00008366683,0.00007604808,0.00024578892,0.0005655826,0.0009271548,0.00013898729,0.0000037086065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054681245,0.000018095467,0.00014840513,0.00015714961,0.000032244963,0.0000056220756,0.0008461866,0.000006841913,0.0007292539,0.98496294,0.00037651006,0.012711278],"study_design_scores_gemma":[0.000512892,0.00006740405,0.00043661587,0.000040993917,0.0000090063595,0.000012131461,0.00009023752,0.04725459,0.002034123,0.9489145,0.00043220265,0.00019526637],"about_ca_topic_score_codex":0.0000027529122,"about_ca_topic_score_gemma":0.000006639247,"teacher_disagreement_score":0.2952125,"about_ca_system_score_codex":0.000011698592,"about_ca_system_score_gemma":0.000022517146,"threshold_uncertainty_score":0.57209677},"labels":[],"label_agreement":null},{"id":"W2563260604","doi":"10.1016/j.disc.2017.10.032","title":"New existence and nonexistence results for strong external difference families","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Shanghai Education Development Foundation; National Natural Science Foundation of China","keywords":"Mathematics; Character (mathematics); Combinatorics; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.0303471063625325,"score_gpt":0.26113389886225996,"score_spread":0.23078679249972747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563260604","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.602324,0.00049345574,0.35772914,0.000056811154,0.00054185465,0.00056476495,0.00014176585,0.00022839977,0.03791976],"genre_scores_gemma":[0.9653491,0.00005546195,0.032985475,0.00000386946,0.000088902394,0.000025551482,0.0000031104912,0.000023301956,0.0014652446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920547,0.000007731676,0.00026808397,0.0001675286,0.00012510018,0.0002260966],"domain_scores_gemma":[0.9990791,0.0001139874,0.000108588865,0.0005765773,0.000020703183,0.00010100878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017991257,0.00017018126,0.00022929933,0.000031318756,0.0002363324,0.00022548567,0.00037391286,0.000056213663,0.000002627604],"category_scores_gemma":[0.0001237738,0.00014357032,0.000058317662,0.000020237896,0.00009021481,0.00012992232,0.000058417067,0.00007845362,0.000007069083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011841468,0.00003912671,0.0010604595,0.00305886,0.00014800695,0.000017571023,0.015633198,0.00025494967,0.012781857,0.9412527,0.00064908,0.024985764],"study_design_scores_gemma":[0.0051145875,0.0004209119,0.025931079,0.00424398,0.00024688191,0.00013621977,0.009742397,0.32229847,0.016264193,0.61077297,0.0025427795,0.0022855666],"about_ca_topic_score_codex":0.00001484504,"about_ca_topic_score_gemma":0.000017045344,"teacher_disagreement_score":0.36302504,"about_ca_system_score_codex":0.000009740423,"about_ca_system_score_gemma":0.0000078345165,"threshold_uncertainty_score":0.58546275},"labels":[],"label_agreement":null},{"id":"W2581995822","doi":"10.1016/j.disc.2018.01.017","title":"Characterizing the number of coloured <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml1\" display=\"inline\" overflow=\"scroll\" altimg=\"si1.gif\"><mml:mi>m</mml:mi></mml:math>-ary partitions modulo <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml2\" display=\"inline\" overflow=\"scroll\" altimg=\"si1.gif\"><mml:mi>m</mml:mi></mml:math>, with and without gaps","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Modulo; Mathematics; Combinatorics; Discrete mathematics; Characterization (materials science); Arithmetic","score_opus":0.02256427158167709,"score_gpt":0.27486236480285825,"score_spread":0.2522980932211812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2581995822","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9819188,0.00044040076,0.0064441278,0.00065902213,0.0011352653,0.00058100844,0.0013605342,0.00070458144,0.0067562195],"genre_scores_gemma":[0.950723,0.00076317985,0.041532617,0.0009778382,0.0015028213,0.0015958799,0.0008708916,0.0011193318,0.0009144658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9883402,0.0003667725,0.0034453645,0.002059084,0.0031406588,0.002647901],"domain_scores_gemma":[0.9881067,0.0027128446,0.0036792585,0.003945495,0.0004870179,0.0010686738],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts"],"category_scores_codex":[0.002389117,0.0019257934,0.0016203228,0.00038152788,0.0021980975,0.0013735484,0.0022368832,0.001634365,0.0003580241],"category_scores_gemma":[0.002799896,0.0019345094,0.001431736,0.0010277951,0.0029906926,0.0022030415,0.0022672291,0.0019736628,0.0019932585],"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.00080277334,0.0010522124,0.00004258785,0.0042895786,0.0016639988,0.0003682183,0.0065204944,0.0002515927,0.0034616275,0.9797312,0.0016472016,0.00016849022],"study_design_scores_gemma":[0.002960716,0.0012593837,0.00009557912,0.004615764,0.0028511982,0.0018248291,0.0060870713,0.922058,0.014402576,0.039636035,0.0020013272,0.0022075486],"about_ca_topic_score_codex":0.00025275061,"about_ca_topic_score_gemma":0.00047570435,"teacher_disagreement_score":0.9400952,"about_ca_system_score_codex":0.00009288753,"about_ca_system_score_gemma":0.00086605316,"threshold_uncertainty_score":0.9997226},"labels":[],"label_agreement":null},{"id":"W2590589653","doi":"10.1016/j.disc.2017.01.018","title":"Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Mathematics; Hermitian matrix; Spectral radius; Combinatorics; RADIUS; Discrete mathematics; Hypergraph; Eigenvalues and eigenvectors; Pure mathematics; Physics; Quantum mechanics; Computer science","score_opus":0.02441696141792542,"score_gpt":0.27759628618214044,"score_spread":0.253179324764215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590589653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9709468,0.00006850228,0.008175457,0.0008034643,0.000021807251,0.0007057512,0.00008987235,0.00017075943,0.019017613],"genre_scores_gemma":[0.96914375,0.000039488426,0.030163677,0.000036784957,0.000047164915,0.000082701124,0.000009632516,0.00006310486,0.00041370463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869305,0.000037837886,0.00029509707,0.00036334633,0.00021669663,0.0003939636],"domain_scores_gemma":[0.99771017,0.00023553173,0.0003803183,0.0014355065,0.000059602262,0.00017886011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033667116,0.00036211486,0.00046080342,0.00005208101,0.0008439476,0.00030559828,0.00047533467,0.00008246243,0.000046821708],"category_scores_gemma":[0.00007490745,0.00021751648,0.000093312075,0.000096009,0.000664983,0.00023310231,0.000077633464,0.00022388498,0.000008475004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038677692,0.00020056669,0.003083394,0.00026761912,0.00018174908,0.000018486206,0.002901575,6.3858823e-7,0.00021211927,0.99256194,0.000097957425,0.0004352598],"study_design_scores_gemma":[0.0008498901,0.00020282684,0.0060745985,0.00024648604,0.00018015734,0.00016735803,0.0019312536,0.0002807956,0.002876714,0.9863044,0.00039432003,0.0004911976],"about_ca_topic_score_codex":0.000014862533,"about_ca_topic_score_gemma":0.0001683899,"teacher_disagreement_score":0.021988219,"about_ca_system_score_codex":0.000017095284,"about_ca_system_score_gemma":0.000030132398,"threshold_uncertainty_score":0.88700646},"labels":[],"label_agreement":null},{"id":"W2594363149","doi":"10.1016/j.disc.2012.12.022","title":"On unit weighing matrices with small weight","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Unit (ring theory); Combinatorics; Order (exchange); Decomposition; Multiple; Discrete mathematics; Arithmetic","score_opus":0.010316773478450647,"score_gpt":0.1849298849536345,"score_spread":0.17461311147518385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594363149","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8819564,0.0001451708,0.026629532,0.000036043995,0.0002049325,0.00036976434,0.0000068910813,0.00048486717,0.09016641],"genre_scores_gemma":[0.9908215,0.000014484803,0.008285558,0.000026214248,0.0000611528,0.000066116714,0.00000632354,0.00006466324,0.0006540227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925745,0.000018928386,0.00021302472,0.00011579904,0.00015075179,0.00024405125],"domain_scores_gemma":[0.999399,0.00012507792,0.000047321162,0.00032215915,0.000026179408,0.00008027443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010595315,0.00019825913,0.00020463161,0.000085991516,0.00006643772,0.00009474887,0.00019544773,0.000060785118,0.0002447011],"category_scores_gemma":[0.000009312875,0.00013593076,0.000049601087,0.00017761171,0.000028458631,0.000117028,0.000015922406,0.00013654194,0.000670228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016653994,0.00013715704,0.00053762255,0.0026204048,0.0004364172,0.000036543064,0.007641035,0.005414958,0.0021697194,0.9740953,0.003423262,0.0034709156],"study_design_scores_gemma":[0.002840833,0.0007960289,0.0011706423,0.004243299,0.00041194478,0.00017658973,0.011342637,0.30079454,0.021626996,0.6290734,0.023616858,0.00390624],"about_ca_topic_score_codex":0.000006636231,"about_ca_topic_score_gemma":0.0000040815994,"teacher_disagreement_score":0.3450219,"about_ca_system_score_codex":0.00001244365,"about_ca_system_score_gemma":0.000003710488,"threshold_uncertainty_score":0.86146486},"labels":[],"label_agreement":null},{"id":"W2600202171","doi":"10.1016/j.disc.2017.01.024","title":"On the roots of all-terminal reliability polynomials","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Terminal (telecommunication); Conjecture; Simple graph; Upper and lower bounds; Properties of polynomial roots; Modulus; Graph; Reliability (semiconductor); Discrete mathematics; Enhanced Data Rates for GSM Evolution; Undirected graph; Polynomial; Mathematical analysis; Computer science; Geometry","score_opus":0.06495913138480752,"score_gpt":0.35416698980653794,"score_spread":0.2892078584217304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600202171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9674948,0.000005419991,0.0016269865,0.0017470433,0.00006291868,0.00051880954,0.000052254345,0.000042092903,0.028449718],"genre_scores_gemma":[0.9924805,0.0000037852956,0.0065803467,0.0000633716,0.000038547772,0.0000655708,0.0000024196904,0.000024734609,0.00074070593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988359,0.00007055495,0.0004508073,0.00018761276,0.00025555652,0.00019957348],"domain_scores_gemma":[0.99555534,0.0015154477,0.0006008404,0.0022074783,0.00006426035,0.000056613942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011367308,0.00017200634,0.00031263166,0.00002976651,0.0004374567,0.00007549754,0.00088670105,0.00007631172,0.00020977847],"category_scores_gemma":[0.0022493503,0.00010307259,0.00018749305,0.000040154006,0.0003789001,0.000075227224,0.00014598994,0.00015542713,0.000055807253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011233712,0.00017977701,0.000051977626,0.0001328109,0.000032708816,0.0000010958391,0.00058539846,0.0000014241047,0.0010753154,0.9960416,0.0017802984,0.00010635716],"study_design_scores_gemma":[0.00014754126,0.00004014361,0.000519374,0.00010949755,0.00007648699,0.0000053611916,0.00026272924,0.00030505843,0.006833032,0.99125266,0.0003241986,0.00012392625],"about_ca_topic_score_codex":0.0000048645534,"about_ca_topic_score_gemma":0.000004656092,"teacher_disagreement_score":0.027709013,"about_ca_system_score_codex":0.000012977654,"about_ca_system_score_gemma":0.000018786592,"threshold_uncertainty_score":0.42031783},"labels":[],"label_agreement":null},{"id":"W2603167390","doi":"10.1016/j.disc.2017.01.026","title":"Rainbow Hamilton cycles and lopsidependency","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Lemma (botany); Combinatorics; Rainbow; Discrete mathematics; Hamiltonian path; Graph","score_opus":0.04443084468304953,"score_gpt":0.3372585884944339,"score_spread":0.2928277438113844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603167390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9361178,0.0001481528,0.0021587573,0.0002150502,0.00028672122,0.0003212412,0.000025258785,0.00012642772,0.06060057],"genre_scores_gemma":[0.95656633,0.0000926899,0.04140936,0.000055272583,0.00011953123,0.000014066733,0.0000021938758,0.000052684223,0.0016878895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871355,0.000035929697,0.00036111337,0.0002748631,0.0003026859,0.00031183148],"domain_scores_gemma":[0.99782586,0.000341549,0.00036118756,0.0013012089,0.000051509516,0.00011870967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004979707,0.00025970358,0.0003851075,0.00006196312,0.0011506084,0.0002659733,0.0005902122,0.00013429663,0.00009548653],"category_scores_gemma":[0.000924431,0.0001929843,0.00011562007,0.000027155946,0.00037718622,0.0002279716,0.0003519201,0.00019279763,0.000011487171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000753868,0.00003659507,0.0008153122,0.0003510839,0.00006553648,0.000019781013,0.010581063,2.322988e-7,0.00015277413,0.98608905,0.00053162785,0.0013494123],"study_design_scores_gemma":[0.00035087086,0.000026870368,0.0021687695,0.00012202864,0.00007095413,0.000049437545,0.0011321082,0.0004250785,0.00054111733,0.9943944,0.00043771244,0.0002806224],"about_ca_topic_score_codex":0.000006449906,"about_ca_topic_score_gemma":0.0000129077425,"teacher_disagreement_score":0.058912683,"about_ca_system_score_codex":0.000013897595,"about_ca_system_score_gemma":0.000012334228,"threshold_uncertainty_score":0.8849666},"labels":[],"label_agreement":null},{"id":"W2605510696","doi":"10.1016/j.disc.2017.03.007","title":"Reconfiguring dominating sets in some well-covered and other classes of graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Simons Foundation","keywords":"Combinatorics; Mathematics; Dominating set; Vertex (graph theory); Graph; Discrete mathematics; Bound graph; Domination analysis; Graph power; Line graph","score_opus":0.035875787122762744,"score_gpt":0.32940287477408253,"score_spread":0.2935270876513198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605510696","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94904226,0.00014787505,0.03050742,0.00020767032,0.00008183619,0.00032550914,0.000009603876,0.000040214218,0.019637635],"genre_scores_gemma":[0.9412633,0.000027081122,0.058499325,0.000022256143,0.000007780588,0.000011211029,2.8246598e-7,0.000014339714,0.00015442655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893695,0.000046301826,0.00030055986,0.00023808466,0.0002239021,0.00025418185],"domain_scores_gemma":[0.99847096,0.0002802775,0.00028991586,0.0008707368,0.000033888824,0.000054225417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063706486,0.00012271943,0.0002508779,0.00015609819,0.00014986201,0.00017792599,0.0008900758,0.000047458092,0.000011102907],"category_scores_gemma":[0.00033135922,0.00010649438,0.000048058275,0.000094482595,0.0001911679,0.0006276198,0.00038874173,0.0001320617,0.0000083835575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008407026,0.000051776125,0.00444701,0.0003452855,0.000021334488,0.000013268685,0.0029772685,0.000020740676,0.0040766024,0.98187995,0.000011354605,0.0061470256],"study_design_scores_gemma":[0.00054601044,0.00004270219,0.0026283006,0.0003429862,0.000004017711,0.000010826402,0.00036848424,0.030060567,0.015700376,0.9500478,0.000056765795,0.00019115294],"about_ca_topic_score_codex":0.000011478774,"about_ca_topic_score_gemma":0.0000117488335,"teacher_disagreement_score":0.031832118,"about_ca_system_score_codex":0.000012706011,"about_ca_system_score_gemma":0.000014662122,"threshold_uncertainty_score":0.43427148},"labels":[],"label_agreement":null},{"id":"W2608271081","doi":"10.1016/j.disc.2018.03.026","title":"On 1-uniqueness and dense critical graphs for tree-depth","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Uniqueness; Conjecture; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.03676595863659552,"score_gpt":0.35349044696105836,"score_spread":0.3167244883244628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608271081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031118477,0.000029848808,0.96419114,0.0005428765,0.0000943454,0.0003128771,0.0000080441005,0.0001253819,0.0035770014],"genre_scores_gemma":[0.6728328,0.000005555677,0.32663667,0.00020875238,0.000041914507,0.00006504598,0.0000011453741,0.000025522177,0.0001825934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879324,0.000055162232,0.00019626989,0.00033269176,0.00025725583,0.00036539987],"domain_scores_gemma":[0.99780947,0.0012263736,0.000042346208,0.00061687035,0.00016133077,0.00014359049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046244304,0.00015126074,0.00018988096,0.00012913313,0.00021568725,0.0001486021,0.00054148294,0.00005750263,0.000007400027],"category_scores_gemma":[0.0007228097,0.000120654026,0.00006600689,0.0002416388,0.0004336048,0.00022205482,0.00019314398,0.00009880789,0.000027555468],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001698573,0.000044296146,0.0000130184935,0.000082489976,0.000008570476,0.000004360511,0.00069394597,6.157562e-7,0.0004634426,0.9949449,0.00018598014,0.0035414167],"study_design_scores_gemma":[0.00023045242,0.00038040357,0.00004925025,0.000058794114,0.000006625055,0.000018189037,0.00008002689,0.031672236,0.0057678856,0.961417,0.00015868961,0.00016041388],"about_ca_topic_score_codex":7.177885e-7,"about_ca_topic_score_gemma":0.0000066896537,"teacher_disagreement_score":0.64171433,"about_ca_system_score_codex":0.000013705562,"about_ca_system_score_gemma":0.000022010441,"threshold_uncertainty_score":0.49201283},"labels":[],"label_agreement":null},{"id":"W2736029126","doi":"10.1016/j.disc.2018.03.001","title":"On the metric dimension of incidence graphs","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland","keywords":"Metric dimension; Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Chordal graph; Antipodal point; Dimension (graph theory); Discrete mathematics; Indifference graph; Graph; 1-planar graph; Geometry","score_opus":0.02706137648428678,"score_gpt":0.2649673037469288,"score_spread":0.237905927262642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2736029126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70431477,0.00093000557,0.28134575,0.0019543413,0.0019453127,0.0013229573,0.000033140765,0.00044628826,0.0077074575],"genre_scores_gemma":[0.9214988,0.000059149188,0.07802854,0.00025358237,0.000008756457,0.000031735362,0.000005293393,0.000024152541,0.00009001396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757546,0.0001245117,0.0006427654,0.00052659534,0.0008538476,0.0002768276],"domain_scores_gemma":[0.9956727,0.0008309228,0.0007045186,0.002408177,0.0003018362,0.00008184646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012852222,0.00032508592,0.00045987256,0.00036979027,0.00014972682,0.00014098876,0.0020410593,0.0001976411,0.000019357956],"category_scores_gemma":[0.0006425396,0.0001920048,0.000261316,0.0008230195,0.0002341339,0.000072784,0.0020365494,0.00044646944,0.000088720895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023439125,0.000094461626,0.00002375382,0.00023619918,0.000051567084,0.000003080522,0.001305873,0.0004600967,0.00024511534,0.99490744,0.0024483483,0.0002217229],"study_design_scores_gemma":[0.000077086566,0.00010073782,0.000028534965,0.0007352378,0.000033854052,0.000004155135,0.000047481743,0.09681416,0.0041517913,0.8977746,0.000015074493,0.00021732245],"about_ca_topic_score_codex":0.000021677204,"about_ca_topic_score_gemma":0.0000011921494,"teacher_disagreement_score":0.21718402,"about_ca_system_score_codex":0.000020318914,"about_ca_system_score_gemma":0.00008042155,"threshold_uncertainty_score":0.7829728},"labels":[],"label_agreement":null},{"id":"W2737456378","doi":"10.1016/j.disc.2017.11.003","title":"Orthogonally Resolvable Matching Designs","year":2017,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Matching (statistics); Partition (number theory); Vertex (graph theory); Mathematics; Graph; Bipartite graph; Square (algebra); Discrete mathematics; Geometry; Statistics","score_opus":0.036232110511950265,"score_gpt":0.2616340832965543,"score_spread":0.22540197278460403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737456378","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.26786768,0.0027385007,0.36598024,0.00008483144,0.004129899,0.0016735059,0.00038638315,0.002297679,0.3548413],"genre_scores_gemma":[0.9775459,0.00012940161,0.019293493,0.000014310482,0.00030998827,0.0001472245,0.00009760319,0.00021388756,0.0022481487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983299,0.000048580747,0.0005590682,0.00031360553,0.00032749775,0.00042138898],"domain_scores_gemma":[0.9979147,0.00010106375,0.00024393725,0.0015667785,0.000047138416,0.0001263876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006558384,0.00048048058,0.0006645949,0.00011521898,0.00021825821,0.00041135313,0.0009496587,0.00039325285,0.00008810261],"category_scores_gemma":[0.000053395237,0.00044893968,0.00029556267,0.000041705025,0.000067507186,0.00010876453,0.00037439528,0.00072716136,0.0001958471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043253065,0.00025624537,0.00033890438,0.0455593,0.0028797786,0.00042698113,0.035753682,0.24920705,0.00846814,0.63824934,0.015683979,0.0031333754],"study_design_scores_gemma":[0.00029076735,0.000024201461,0.00008970836,0.003627631,0.0002501259,0.000049367547,0.00087929465,0.07136214,0.0013915126,0.91661155,0.0039561563,0.001467552],"about_ca_topic_score_codex":0.000011116752,"about_ca_topic_score_gemma":0.000013947246,"teacher_disagreement_score":0.7096783,"about_ca_system_score_codex":0.000050832765,"about_ca_system_score_gemma":0.00004015415,"threshold_uncertainty_score":0.9997962},"labels":[],"label_agreement":null},{"id":"W2742025611","doi":"10.1016/j.disc.2017.06.006","title":"On nice and injective-nice tournaments","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; York University","funders":"","keywords":"Nice; Tournament; Mathematics; Combinatorics; Injective function; Homomorphism; Vertex (graph theory); Discrete mathematics; Graph; Computer science","score_opus":0.031090017430859575,"score_gpt":0.3399343565656918,"score_spread":0.3088443391348322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742025611","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.2948847,0.000088978755,0.6437707,0.0011785888,0.00023211897,0.00044202045,0.000009312979,0.00014112954,0.05925245],"genre_scores_gemma":[0.9336924,0.000028492874,0.06488819,0.0001192129,0.000027695505,0.000016989288,4.987224e-7,0.00001812421,0.0012083811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888635,0.0000422214,0.00016061179,0.0002871591,0.0003495619,0.00027409536],"domain_scores_gemma":[0.9980421,0.00026535743,0.00017520523,0.0013473969,0.00005512047,0.00011480311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043213114,0.00013549865,0.00016787142,0.00007140627,0.00050551945,0.00049726194,0.0013422278,0.00004038083,0.000010293659],"category_scores_gemma":[0.0005459997,0.00010877587,0.000042226962,0.00006774431,0.00015148327,0.0005688207,0.00071266486,0.00018425864,0.000073534975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009163197,0.000060820897,0.00022840193,0.00004820668,0.00002537771,0.00001835164,0.001544743,0.000010952746,0.00032457834,0.99032515,0.00014345741,0.007260808],"study_design_scores_gemma":[0.00044488566,0.00016243366,0.0019261956,0.00012480172,0.000006343749,0.000022447875,0.00015716825,0.024532218,0.0014036894,0.97072953,0.00026616876,0.00022411114],"about_ca_topic_score_codex":0.00000385123,"about_ca_topic_score_gemma":0.0000028267373,"teacher_disagreement_score":0.6388077,"about_ca_system_score_codex":0.000027497008,"about_ca_system_score_gemma":0.000018125933,"threshold_uncertainty_score":0.4795108},"labels":[],"label_agreement":null},{"id":"W2751588130","doi":"10.1016/j.disc.2018.06.021","title":"Spanning Euler tours and spanning Euler families in hypergraphs with particular vertex cuts","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Hypergraph; Vertex (graph theory); Euler's formula; Spanning tree; Euler characteristic; Traverse; Discrete mathematics; Graph; Mathematical analysis","score_opus":0.01965353357901875,"score_gpt":0.2796994088672856,"score_spread":0.26004587528826684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751588130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73940516,0.00019877464,0.25621575,0.00025990003,0.000096905715,0.00025283173,0.0000019321283,0.00012789448,0.0034408204],"genre_scores_gemma":[0.87912536,0.000026497351,0.12054092,0.00007123577,0.000030327144,0.00002849613,0.0000013882972,0.000032011416,0.00014377259],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806976,0.00008028239,0.00030576842,0.00046857045,0.00047349642,0.00060212304],"domain_scores_gemma":[0.9985857,0.00032425646,0.00010270907,0.000718947,0.00011443364,0.00015395292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005261457,0.00024999736,0.00032040276,0.00027254285,0.0001861142,0.00020369135,0.0005952733,0.00006516401,0.000012881101],"category_scores_gemma":[0.0002154086,0.00019026993,0.00004733548,0.00079800346,0.00044877044,0.000584445,0.00037772034,0.00022636102,0.000036383448],"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.00012814155,0.00036891355,0.043882124,0.000576974,0.00025586292,0.0004534786,0.070774846,0.00077515276,0.008949463,0.85669726,0.00056502887,0.016572744],"study_design_scores_gemma":[0.0035157364,0.001434511,0.022172192,0.0022773207,0.00008941851,0.0003179854,0.0129111605,0.5135482,0.020965902,0.4179553,0.002414518,0.002397743],"about_ca_topic_score_codex":0.000010878809,"about_ca_topic_score_gemma":0.00002399556,"teacher_disagreement_score":0.51277304,"about_ca_system_score_codex":0.000025583486,"about_ca_system_score_gemma":0.000036003214,"threshold_uncertainty_score":0.7758983},"labels":[],"label_agreement":null},{"id":"W2751759068","doi":"10.1016/j.disc.2018.09.013","title":"A lower bound on the size of an absorbing set in an arc-coloured tournament","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Tournament; Combinatorics; Vertex (graph theory); Monochromatic color; Mathematics; Integer (computer science); Upper and lower bounds; Arc (geometry); Path (computing); Discrete mathematics; Physics; Graph; Computer science; Geometry; Optics; Mathematical analysis","score_opus":0.054529297375144684,"score_gpt":0.3354209737109293,"score_spread":0.28089167633578466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751759068","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99220717,0.000043149234,0.00034997828,0.00018470528,0.0006347355,0.0012000755,0.00016285804,0.00007111479,0.005146225],"genre_scores_gemma":[0.9823587,0.000029156792,0.016728645,0.00018339323,0.00026334703,0.00009613016,0.000022551805,0.00012925643,0.00018879809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965701,0.00038862095,0.0011913447,0.00056545105,0.0007898508,0.00049461063],"domain_scores_gemma":[0.9946589,0.001569616,0.001007441,0.0024611263,0.00016177559,0.00014115703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021021175,0.0006093667,0.0009913832,0.0001745753,0.00023038939,0.00018758228,0.0014188039,0.00046852647,0.00043909176],"category_scores_gemma":[0.0011983548,0.000384834,0.00032943935,0.00015942285,0.0004111184,0.00009843955,0.0008665699,0.001005481,0.00000662913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029777078,0.0013550451,0.00015526665,0.002703146,0.00045540548,0.00006910361,0.08568115,0.00017186916,0.00046516905,0.90666944,0.0016747903,0.00030185527],"study_design_scores_gemma":[0.00037877573,0.00037820832,0.0002155112,0.0012615641,0.00014130514,0.000010401143,0.0029776152,0.0041435957,0.0009264466,0.98902273,0.000069113594,0.00047473723],"about_ca_topic_score_codex":0.000017018301,"about_ca_topic_score_gemma":0.000078665274,"teacher_disagreement_score":0.08270353,"about_ca_system_score_codex":0.00012508972,"about_ca_system_score_gemma":0.00009605356,"threshold_uncertainty_score":0.99986035},"labels":[],"label_agreement":null},{"id":"W2755994256","doi":"10.1016/j.disc.2017.08.039","title":"Constructions for orthogonal designs using signed group orthogonal designs","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"University of Lethbridge","keywords":"Mathematics; Hadamard matrix; Hadamard transform; Orthogonal array; Orthogonal matrix; Group (periodic table); Combinatorics; Orthogonal group; Combinatorial design; Complex Hadamard matrix; Discrete mathematics; Orthogonal basis; Mathematical analysis; Statistics; Taguchi methods","score_opus":0.07403725507723834,"score_gpt":0.2900789309838628,"score_spread":0.21604167590662443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2755994256","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.26718688,0.000056141493,0.72751784,0.000013563748,0.00056107633,0.000524288,0.00013875765,0.0002015989,0.0037998552],"genre_scores_gemma":[0.9391624,0.000003943368,0.060362406,0.000008351432,0.00017794441,0.00008932724,0.00002351728,0.00007729213,0.000094818686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987191,0.000034924466,0.00043835654,0.00021136897,0.00019451731,0.0004017199],"domain_scores_gemma":[0.9988356,0.00016200182,0.0001797994,0.0006270707,0.00006377095,0.00013174883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041594848,0.00028026395,0.00036868767,0.00008810141,0.0007741812,0.00023440403,0.00038172782,0.0001393437,0.00007669453],"category_scores_gemma":[0.00010403288,0.00026401665,0.00023225824,0.00006659343,0.00019571958,0.00027413078,0.000043703847,0.00013221342,0.000022434493],"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.000039788814,0.000094484465,0.00072420645,0.0012653283,0.00048961246,0.00001731022,0.0015975527,0.004399895,0.07847216,0.9108571,0.00030050523,0.0017420682],"study_design_scores_gemma":[0.0020982742,0.00018945329,0.0005906909,0.00069918984,0.00056072115,0.00035255903,0.002606233,0.67359895,0.007996622,0.30814546,0.0014891645,0.0016726733],"about_ca_topic_score_codex":0.0000025610086,"about_ca_topic_score_gemma":0.000011771988,"teacher_disagreement_score":0.6719755,"about_ca_system_score_codex":0.000037122558,"about_ca_system_score_gemma":0.000027182286,"threshold_uncertainty_score":0.9999812},"labels":[],"label_agreement":null},{"id":"W2758605595","doi":"10.1016/j.disc.2017.08.043","title":"Fair and internally fair (holey) hamiltonian decompositions of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml1\" display=\"inline\" overflow=\"scroll\" altimg=\"si1.gif\"><mml:mi>K</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:mo>…</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mo>−</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>;</mml:mo><mml:msub><mml:mrow><mml:mi>λ</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mi>λ</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>","year":2017,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Division of Mathematical Sciences","keywords":"Hamiltonian (control theory); Mathematics; Combinatorics; Hamiltonian path; Partition (number theory); Graph; Discrete mathematics","score_opus":0.015872258556416396,"score_gpt":0.2392087625630316,"score_spread":0.22333650400661523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2758605595","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21714158,0.0076370225,0.0044177496,0.002592624,0.013780558,0.00035374836,0.0045678588,0.0020399643,0.7474689],"genre_scores_gemma":[0.93052197,0.008870352,0.009054162,0.005966808,0.011879468,0.011651938,0.011410819,0.008735912,0.0019086021],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9382001,0.004457592,0.013239162,0.011794394,0.015829496,0.016479233],"domain_scores_gemma":[0.94853866,0.010669846,0.015542114,0.013596883,0.0018636599,0.009788858],"candidate_categories":["metaresearch","metaepi_narrow","metaepi_broad","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.013395005,0.0071981936,0.0027088393,0.0059331288,0.011799681,0.013131463,0.01825068,0.017208932,0.89838904],"category_scores_gemma":[0.012528269,0.015798723,0.014585755,0.009197172,0.014230515,0.010810823,0.01539499,0.012984373,0.01138174],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00933795,0.0022318463,0.00008769295,0.008246878,0.013579076,0.008809934,0.0075165173,0.007496386,0.01127944,0.24385023,0.6818555,0.005708544],"study_design_scores_gemma":[0.011471961,0.008743493,0.00026781528,0.009698329,0.012913771,0.0133772725,0.010914128,0.0142087685,0.8869827,0.0020500373,0.015858864,0.01351287],"about_ca_topic_score_codex":0.01281424,"about_ca_topic_score_gemma":0.0149835665,"teacher_disagreement_score":0.8870073,"about_ca_system_score_codex":0.00019228985,"about_ca_system_score_gemma":0.010009289,"threshold_uncertainty_score":0.99578965},"labels":[],"label_agreement":null},{"id":"W2761354496","doi":"10.1016/j.disc.2017.09.011","title":"Game of cops and robbers in oriented quotients of the integer grid","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Quotient; Digraph; Vertex (graph theory); Grid; Integer (computer science); Transitive relation; Combinatorics; Discrete mathematics; Computer science; Graph; Geometry","score_opus":0.012398138186278645,"score_gpt":0.24427439189744554,"score_spread":0.2318762537111669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761354496","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9898712,0.00005303982,0.008067246,0.00024722904,0.000273456,0.0001478253,0.000005385626,0.000012387808,0.0013222506],"genre_scores_gemma":[0.9893978,0.000007431663,0.010492837,0.000019972953,0.0000013548303,0.0000022312963,4.3844142e-7,0.000004307308,0.00007359502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992693,0.000022327662,0.00027798684,0.00012653343,0.00019462053,0.000109201945],"domain_scores_gemma":[0.99875563,0.000047720718,0.0003154637,0.0007896914,0.000062194435,0.000029293606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027707207,0.000075204545,0.00017330043,0.00004838114,0.000056964418,0.0000333658,0.00060192513,0.000031491483,0.0000017319178],"category_scores_gemma":[0.00016249833,0.000046677855,0.00004332627,0.00010230149,0.00018953015,0.000119897806,0.0003914236,0.00006982098,0.00000128327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000800041,0.00024728378,0.037255585,0.0004975076,0.000040635292,0.0000028075292,0.0154188275,0.00017365612,0.00316552,0.94190633,0.0002539318,0.0010299225],"study_design_scores_gemma":[0.0030126895,0.0002579292,0.04328502,0.0032734263,0.00006158884,0.00002260591,0.001322368,0.2617046,0.041056182,0.64514315,0.00026633692,0.0005941038],"about_ca_topic_score_codex":0.000046287187,"about_ca_topic_score_gemma":0.000011865662,"teacher_disagreement_score":0.29676315,"about_ca_system_score_codex":0.000004950958,"about_ca_system_score_gemma":0.000017406932,"threshold_uncertainty_score":0.19034676},"labels":[],"label_agreement":null},{"id":"W2768050560","doi":"10.1016/j.disc.2017.10.009","title":"A note on <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml1\" display=\"inline\" overflow=\"scroll\" altimg=\"si1.gif\"><mml:mi>k</mml:mi></mml:math>-cop-win graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Scroll; Graph; Mathematics; Combinatorics; Discrete mathematics; Algorithm; Theology","score_opus":0.028265365783923486,"score_gpt":0.28287838718056013,"score_spread":0.25461302139663666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768050560","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9288127,0.00010797134,0.058507483,0.0009666351,0.0013365254,0.00016231519,0.00008375224,0.00033390205,0.009688762],"genre_scores_gemma":[0.9605858,0.00012332783,0.037545774,0.00067544373,0.0004078391,0.00016390704,0.000039325056,0.0001477279,0.00031089893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995755,0.000078957426,0.0009909833,0.00093326886,0.0012574485,0.0009843305],"domain_scores_gemma":[0.99459004,0.0006763512,0.0010680606,0.0032080736,0.000113820315,0.0003436492],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00095270993,0.000564152,0.00042095585,0.00017261195,0.0011747376,0.0014708639,0.003036137,0.00047219582,0.00005042601],"category_scores_gemma":[0.0011029408,0.0005878835,0.0005868233,0.00028259688,0.00062347023,0.0010841412,0.0014078327,0.0006417875,0.0029959888],"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.000049315586,0.00018870065,0.000012246283,0.00023041126,0.000117044285,0.0001904834,0.0036577526,0.00038188987,0.0006805693,0.9899493,0.00071810983,0.003824163],"study_design_scores_gemma":[0.00024236429,0.00034478543,0.000051090814,0.00061901606,0.00010793872,0.00009677179,0.00044232907,0.94826835,0.017140055,0.030449554,0.0016428194,0.0005949349],"about_ca_topic_score_codex":0.00018749412,"about_ca_topic_score_gemma":0.00013865494,"teacher_disagreement_score":0.9594998,"about_ca_system_score_codex":0.000030048526,"about_ca_system_score_gemma":0.00023601246,"threshold_uncertainty_score":0.9996573},"labels":[],"label_agreement":null},{"id":"W2770029606","doi":"10.1016/j.disc.2017.10.015","title":"A result in asymmetric Euclidean Ramsey theory","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Combinatorics; Euclidean geometry; Euclidean distance; Euclidean space; Euclidean distance matrix; Ramsey theory; Space (punctuation); Discrete mathematics; Geometry; Computer science","score_opus":0.04576559176547989,"score_gpt":0.34275639981443695,"score_spread":0.29699080804895706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770029606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6106594,0.00022225855,0.00882862,0.00042110952,0.0007302254,0.0009271059,0.000058751008,0.00023491382,0.3779176],"genre_scores_gemma":[0.9665429,0.000041609655,0.03078537,0.00009091415,0.0001381013,0.000029710485,0.000004306976,0.00007889318,0.0022882079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780345,0.00015519092,0.00071824226,0.00036962554,0.0004433992,0.00051011756],"domain_scores_gemma":[0.9958269,0.0012566681,0.0005852728,0.002134747,0.00007151001,0.00012493109],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002217683,0.0003363959,0.000579193,0.00030013383,0.00071034965,0.00024675363,0.0012655356,0.00020201861,0.00011270597],"category_scores_gemma":[0.006793545,0.00025414806,0.00021745695,0.00019888804,0.00032358247,0.00024532274,0.00054551114,0.00040285254,0.000037885162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033572058,0.00009586946,0.0008376674,0.00021812179,0.000051227616,0.00003761447,0.003755117,0.0000012189807,0.000028430795,0.9909989,0.00062744913,0.003314793],"study_design_scores_gemma":[0.0007770616,0.0000389339,0.0024192827,0.00020062023,0.000055657052,0.00001963767,0.0009112309,0.00048670822,0.00036116355,0.9938516,0.000530352,0.0003477434],"about_ca_topic_score_codex":0.0000137078405,"about_ca_topic_score_gemma":0.0000268768,"teacher_disagreement_score":0.3756294,"about_ca_system_score_codex":0.000050859373,"about_ca_system_score_gemma":0.000028220815,"threshold_uncertainty_score":0.99999106},"labels":[],"label_agreement":null},{"id":"W2776481909","doi":"10.1016/j.disc.2019.06.016","title":"A generalization of Schönemann’s theorem via a graph theoretic method","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Generalization; Combinatorics; Discrete mathematics; Graph","score_opus":0.017736649349728077,"score_gpt":0.3183112587670702,"score_spread":0.30057460941734215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2776481909","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.08610379,0.00007365476,0.8955698,0.00008538667,0.00042179084,0.0013287846,0.000020426878,0.00025336756,0.016143003],"genre_scores_gemma":[0.3987589,0.000022026887,0.5999433,0.00004025036,0.000057509485,0.0000676466,0.000014173939,0.00016752063,0.00092869543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967619,0.0002235561,0.0012436848,0.00044726074,0.000822103,0.00050145475],"domain_scores_gemma":[0.99559015,0.0014407182,0.0009986489,0.0015202357,0.0003181707,0.00013205854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013047761,0.0004883622,0.0010576409,0.00025882683,0.00008390393,0.000046082172,0.0006875709,0.00022527209,0.00046043043],"category_scores_gemma":[0.00095797377,0.00039955185,0.00036089582,0.00063992717,0.00016281953,0.00023161736,0.0002353609,0.00025609613,0.00012744367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021738697,0.0002754977,0.000042257885,0.0018556602,0.0001148367,0.0000026246369,0.0031002895,0.00013860436,0.0063585793,0.9876899,0.00013647728,0.0002635236],"study_design_scores_gemma":[0.0007932829,0.00015033859,0.0000063592297,0.00036285238,0.00018816585,0.000031690422,0.00081183534,0.022932611,0.01401989,0.9601772,0.000087917615,0.00043788095],"about_ca_topic_score_codex":0.0000030657043,"about_ca_topic_score_gemma":0.0000016884148,"teacher_disagreement_score":0.3126551,"about_ca_system_score_codex":0.00007018968,"about_ca_system_score_gemma":0.00005216175,"threshold_uncertainty_score":0.9998456},"labels":[],"label_agreement":null},{"id":"W2779612036","doi":"10.1016/j.disc.2018.05.017","title":"Throttling for the game of Cops and Robbers on graphs","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Bandwidth throttling; Combinatorics; Mathematics; Hypercube; Graph; Discrete mathematics; Physics","score_opus":0.04886693414521081,"score_gpt":0.34045688068476365,"score_spread":0.29158994653955284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2779612036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013752646,0.00034932053,0.9828298,0.00041060115,0.00026784002,0.0012718558,0.000048694732,0.000071059396,0.0009981657],"genre_scores_gemma":[0.51116025,0.0003658827,0.48746502,0.00013473809,0.00011927447,0.00037010503,0.000012305132,0.000084649924,0.00028779873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838966,0.000058427697,0.00038367102,0.00043895785,0.0004199539,0.00030934534],"domain_scores_gemma":[0.9963608,0.0015675162,0.0003492923,0.0014761423,0.00017934082,0.00006691532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010021062,0.00025074912,0.00038801116,0.00013712991,0.00013542212,0.00015032692,0.0016057659,0.00012769629,0.000005250356],"category_scores_gemma":[0.00033912537,0.00016150775,0.0001851373,0.00018527196,0.00047334642,0.00008212998,0.0013516386,0.00034192175,0.0000045750508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001873364,0.000043031356,0.000014849438,0.0008897643,0.00012742964,0.0000010704924,0.004241355,0.00080290466,0.00010249843,0.9910907,0.00019427839,0.0024733646],"study_design_scores_gemma":[0.00016870258,0.00012009077,0.00002055236,0.00035434903,0.000026329919,0.0000030596127,0.00019930578,0.1526363,0.0014758598,0.8446803,0.00014437236,0.00017077372],"about_ca_topic_score_codex":0.0000028362392,"about_ca_topic_score_gemma":0.0000019616905,"teacher_disagreement_score":0.4974076,"about_ca_system_score_codex":0.000020075026,"about_ca_system_score_gemma":0.00005538113,"threshold_uncertainty_score":0.6586095},"labels":[],"label_agreement":null},{"id":"W2782679454","doi":"10.1016/j.disc.2018.05.014","title":"On the roots of Wiener polynomials of graphs","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Wiener index; Closure (psychology); Order (exchange); Polynomial; Graph; Discrete mathematics; Mathematical analysis","score_opus":0.05401071563895392,"score_gpt":0.32432745570121224,"score_spread":0.2703167400622583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782679454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96740633,0.000058148384,0.005182041,0.00034394878,0.00018216317,0.0012549318,0.0004384227,0.00006779064,0.02506624],"genre_scores_gemma":[0.98331845,0.000022411978,0.015900169,0.00004276975,0.000058874823,0.00016689721,0.000022215829,0.00007140091,0.00039679246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978288,0.00014404628,0.001036051,0.0003104086,0.0004461773,0.00023453962],"domain_scores_gemma":[0.9942436,0.0020280073,0.001400679,0.0020631317,0.00020677438,0.000057781297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011802714,0.00036554094,0.0008053939,0.0001575479,0.0000981027,0.000024862517,0.0009963961,0.0002765199,0.0002922395],"category_scores_gemma":[0.00087219593,0.00023032985,0.0004981754,0.00022573206,0.0005610754,0.00002427614,0.00047569408,0.00035723703,0.000026399452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013402786,0.000274051,0.000010959501,0.0010553376,0.0001878413,2.7240486e-7,0.0013416449,0.000012311402,0.0011833712,0.992283,0.0036044917,0.00003331151],"study_design_scores_gemma":[0.000118050586,0.000057534067,0.000034293407,0.0008341239,0.0002351969,0.0000015303518,0.0003710392,0.0002734351,0.02178203,0.9760084,0.00006854127,0.00021582795],"about_ca_topic_score_codex":0.0000065435397,"about_ca_topic_score_gemma":0.000004267036,"teacher_disagreement_score":0.024669448,"about_ca_system_score_codex":0.00001512798,"about_ca_system_score_gemma":0.00005942439,"threshold_uncertainty_score":0.93925786},"labels":[],"label_agreement":null},{"id":"W2784736218","doi":"10.1016/j.disc.2018.02.020","title":"On the Hamilton–Waterloo Problem with cycle lengths of distinct parities","year":2018,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Combinatorics; Mathematics; Factorization; Graph; BETA (programming language); Hamiltonian path; Complete graph; Computer science; Algorithm","score_opus":0.0105022115662468,"score_gpt":0.20158907679462257,"score_spread":0.19108686522837576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784736218","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94091135,0.00013906322,0.0061968546,0.00003713509,0.00030158824,0.0008995695,0.00020227296,0.00029102663,0.051021166],"genre_scores_gemma":[0.99762726,0.000017773313,0.0015465851,0.00000871273,0.00008211912,0.0001667534,0.000032402168,0.00009390487,0.00042451717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986629,0.0000626005,0.00048004815,0.00021406227,0.0003131667,0.00026720556],"domain_scores_gemma":[0.9985203,0.00024983776,0.00019088219,0.00093107764,0.00006042365,0.000047492525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040071472,0.0003846148,0.0005111791,0.00006391122,0.000080546466,0.000081799175,0.0005076754,0.00017383105,0.00007459654],"category_scores_gemma":[0.00002459665,0.00021886732,0.00014741592,0.00008182095,0.00024387975,0.0000349797,0.000117387186,0.00038541033,0.000042990658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008934838,0.0002878803,0.00026823388,0.028880887,0.0018320372,0.000021692165,0.06731706,0.027848648,0.000344731,0.868526,0.004244293,0.00033921326],"study_design_scores_gemma":[0.00048766824,0.0003430262,0.00014284573,0.009132229,0.0003741324,0.000028989825,0.005311154,0.063345805,0.00949654,0.90918076,0.0008248202,0.0013320183],"about_ca_topic_score_codex":0.000014916422,"about_ca_topic_score_gemma":0.000019632214,"teacher_disagreement_score":0.06200591,"about_ca_system_score_codex":0.000025948122,"about_ca_system_score_gemma":0.000015226212,"threshold_uncertainty_score":0.892515},"labels":[],"label_agreement":null},{"id":"W2795132661","doi":"10.1016/j.disc.2018.03.006","title":"Recolouring reflexive digraphs","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Homomorphism; Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Graph; Loop (graph theory); Path (computing); Computer science","score_opus":0.035949377190824854,"score_gpt":0.3399009822795958,"score_spread":0.30395160508877095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795132661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03031575,0.00003977412,0.9102793,0.00037163027,0.00020330606,0.00023444078,0.0000028709376,0.00033000248,0.058222946],"genre_scores_gemma":[0.5376842,0.000012959609,0.46054655,0.00013105376,0.000121438374,0.000028738896,0.0000013299192,0.000026190039,0.0014475615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862695,0.000053038428,0.00024436048,0.00031561186,0.00034313163,0.00041692407],"domain_scores_gemma":[0.99849963,0.00019265468,0.00010016241,0.00095343764,0.00013266866,0.000121462486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049544964,0.0001437899,0.00017167826,0.00014787143,0.00022025759,0.00014699886,0.0011705229,0.000049433766,0.00005311272],"category_scores_gemma":[0.0001894976,0.00011852797,0.000081320715,0.0005856376,0.00023046622,0.0004110744,0.0004534619,0.0001468089,0.0004165333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049910964,0.000040336414,0.0000763516,0.000036550624,0.000022168224,0.00001192129,0.003011695,0.0000033588465,0.0010584433,0.9895857,0.00032581505,0.005822681],"study_design_scores_gemma":[0.00018791956,0.00018651661,0.0001305241,0.000063412284,0.0000049618534,0.000022066748,0.00025069338,0.019886402,0.01230513,0.96432996,0.0023788856,0.00025350734],"about_ca_topic_score_codex":0.0000012319656,"about_ca_topic_score_gemma":0.0000046879663,"teacher_disagreement_score":0.50736845,"about_ca_system_score_codex":0.000029037252,"about_ca_system_score_gemma":0.000026828353,"threshold_uncertainty_score":0.53538316},"labels":[],"label_agreement":null},{"id":"W2802440683","doi":"10.1016/j.disc.2018.03.011","title":"Countable linear orders with disjoint infinite intervals are mutually orthogonal","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Countable set; Disjoint sets; Combinatorics; Discrete mathematics","score_opus":0.03621903001739528,"score_gpt":0.3231965152848577,"score_spread":0.2869774852674624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802440683","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55417776,0.000052170315,0.41158256,0.0005862922,0.00028066974,0.000695266,0.0001123295,0.00043337783,0.032079563],"genre_scores_gemma":[0.766261,0.000015554211,0.22798614,0.0006359691,0.0003746768,0.000064834014,0.000035958932,0.00015684949,0.0044690305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980957,0.00008335888,0.00057840516,0.00035881656,0.00036781293,0.0005159419],"domain_scores_gemma":[0.997811,0.00060126814,0.00044794218,0.0007284983,0.00027247603,0.00013880439],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055613054,0.00037674085,0.0005906291,0.00010171835,0.00027117552,0.000040384348,0.00036229446,0.00016865873,0.0008694295],"category_scores_gemma":[0.0006515715,0.00027097538,0.000118755655,0.0002427281,0.0007263505,0.00022313533,0.00015899928,0.00031870272,0.00031487326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019825842,0.0003548022,0.00087171944,0.0005547128,0.00030525366,0.000057622055,0.0081039015,0.000026060792,0.00016538284,0.98697525,0.0021627827,0.00022423106],"study_design_scores_gemma":[0.0013075417,0.00055168656,0.0001340827,0.0007262228,0.00022765703,0.00016118678,0.0076682596,0.003399257,0.0019249927,0.9758775,0.007208059,0.0008135279],"about_ca_topic_score_codex":0.0000029220312,"about_ca_topic_score_gemma":0.00013818721,"teacher_disagreement_score":0.21208322,"about_ca_system_score_codex":0.000044840872,"about_ca_system_score_gemma":0.00006759468,"threshold_uncertainty_score":0.99997425},"labels":[],"label_agreement":null},{"id":"W2807476228","doi":"10.1016/j.disc.2018.05.016","title":"Distinguishing chromatic numbers of complements of Cartesian products of complete graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cartesian product; Chromatic scale; Mathematics; Combinatorics; Graph; Discrete mathematics; Class (philosophy); Computer science","score_opus":0.030084909417892134,"score_gpt":0.2666163669998542,"score_spread":0.23653145758196206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807476228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.932942,0.00009460337,0.060104966,0.00018620271,0.00031101037,0.0004970654,0.000053192685,0.00009548312,0.00571552],"genre_scores_gemma":[0.7670336,0.0000014620693,0.23291403,0.000012882005,0.0000039428037,0.00000285515,0.000005687329,0.000010288763,0.000015286218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981267,0.000052168318,0.0008548322,0.0002445048,0.0004872583,0.00023453559],"domain_scores_gemma":[0.99771565,0.00012711436,0.0007854292,0.00086154905,0.0004490521,0.00006122708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055449555,0.00015871302,0.0004755847,0.00013826924,0.00007387471,0.000022810105,0.0007250379,0.000034188288,0.0000122975025],"category_scores_gemma":[0.000273516,0.00013385632,0.00009723147,0.0006323402,0.00036693335,0.0001222882,0.00023620977,0.000060231338,0.0000054606776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054888324,0.0003351701,0.002243788,0.0028569621,0.00015091071,0.0000020813643,0.01745468,0.000028570768,0.065714546,0.91017556,0.0005848438,0.00044741225],"study_design_scores_gemma":[0.0014813562,0.00090309244,0.0023016974,0.0027165178,0.00016750638,0.000025868048,0.0014773137,0.119535476,0.15827282,0.7123142,0.0001298164,0.0006743428],"about_ca_topic_score_codex":0.00008107037,"about_ca_topic_score_gemma":0.000009497957,"teacher_disagreement_score":0.19786136,"about_ca_system_score_codex":0.000007642545,"about_ca_system_score_gemma":0.00004111404,"threshold_uncertainty_score":0.5458502},"labels":[],"label_agreement":null},{"id":"W2883849606","doi":"10.1016/j.disc.2018.06.026","title":"A complexity dichotomy for signed <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml3\" display=\"inline\" overflow=\"scroll\" altimg=\"si3.gif\"><mml:mi mathvariant=\"bold\">H</mml:mi></mml:math>-colouring","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scroll; Mathematics; Discrete mathematics; Algorithm; Computer science; Theology","score_opus":0.033416933724127615,"score_gpt":0.290930367711206,"score_spread":0.2575134339870784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883849606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6555393,0.000077029115,0.3401456,0.00032883225,0.00045823812,0.00031702113,0.00016083554,0.00033443153,0.0026387419],"genre_scores_gemma":[0.80696815,0.000031117797,0.19096667,0.00042866686,0.000518708,0.0005608808,0.00009379689,0.00019168535,0.00024029175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99530345,0.00013696523,0.0009870032,0.0010212456,0.0012083609,0.001342993],"domain_scores_gemma":[0.9954744,0.0010965132,0.0007232924,0.0020627591,0.00021325449,0.00042980709],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016273375,0.0005676898,0.00048981427,0.00022368028,0.001054361,0.00075638946,0.0022883494,0.00039955703,0.000058624893],"category_scores_gemma":[0.00076780986,0.0005991973,0.00054014695,0.0006595181,0.00088267605,0.0010085875,0.0015600674,0.00054196594,0.00081151165],"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.00016740593,0.00022895538,0.0000050122467,0.0006283353,0.00020039879,0.00009307852,0.002486548,0.00009856139,0.0024427858,0.9926789,0.00031787535,0.0006521863],"study_design_scores_gemma":[0.0009698967,0.0005912155,0.000032166296,0.0003651543,0.00010121737,0.00015070397,0.000415828,0.9061473,0.007126952,0.08212925,0.0014093957,0.0005609448],"about_ca_topic_score_codex":0.000042575135,"about_ca_topic_score_gemma":0.00006018206,"teacher_disagreement_score":0.91054964,"about_ca_system_score_codex":0.000042099855,"about_ca_system_score_gemma":0.00028553416,"threshold_uncertainty_score":0.99996644},"labels":[],"label_agreement":null},{"id":"W2885945836","doi":"10.1016/j.disc.2018.07.010","title":"A framework for constructing de Bruijn sequences via simple successor rules","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"De Bruijn sequence; Sequence (biology); Successor cardinal; Disjoint sets; Simple (philosophy); Mathematics; Correctness; De Bruijn graph; Discrete mathematics; Shift register; Combinatorics; Algorithm; Computer science","score_opus":0.028255695515363267,"score_gpt":0.3082963769190016,"score_spread":0.2800406814036383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885945836","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.110793464,0.000025668576,0.88689166,0.0002672152,0.00015682324,0.00017680837,0.000011355819,0.00019104815,0.001485957],"genre_scores_gemma":[0.42895788,0.000001940703,0.5707549,0.0001218533,0.00012213108,0.000021560158,0.0000014998744,0.000009252467,0.000008966754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890673,0.000042228166,0.0002557452,0.00026043036,0.0001615011,0.00037335875],"domain_scores_gemma":[0.9984411,0.00072525104,0.00016765526,0.00048685324,0.00009197751,0.00008713463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056885777,0.00015220449,0.00019921259,0.000074554235,0.000305054,0.0002635803,0.0008453487,0.000081375496,0.00003574035],"category_scores_gemma":[0.0003092305,0.00012992506,0.00012547582,0.00026642554,0.00025585157,0.00024440946,0.00016230086,0.00009990376,0.000025185942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042614884,0.000018436329,0.00019666688,0.000080315054,0.00002392778,0.0000017522464,0.0032834413,0.0000015652276,0.0005743551,0.98985225,0.00006450278,0.005898538],"study_design_scores_gemma":[0.00009956866,0.00009698863,0.000017202789,0.000092731476,0.000016205267,0.00003604227,0.00051623554,0.025437703,0.006955871,0.9659761,0.00056774187,0.00018759971],"about_ca_topic_score_codex":0.0000056544413,"about_ca_topic_score_gemma":0.0000053106314,"teacher_disagreement_score":0.31816444,"about_ca_system_score_codex":0.000016040665,"about_ca_system_score_gemma":0.000041409487,"threshold_uncertainty_score":0.529819},"labels":[],"label_agreement":null},{"id":"W2890117438","doi":"10.1016/j.disc.2018.07.029","title":"Shedding vertices of vertex decomposable well-covered graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Redeemer University; Brock University","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Mathematics; Combinatorics; Counterexample; Maximal independent set; Vertex (graph theory); Dominating set; Conjecture; Chordal graph; Discrete mathematics; Indifference graph; 1-planar graph; Graph","score_opus":0.03289806031381621,"score_gpt":0.3346198819930194,"score_spread":0.3017218216792032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890117438","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87516654,0.000078088866,0.03406287,0.00019105837,0.00012692521,0.00051757327,0.00003851369,0.00014655452,0.08967186],"genre_scores_gemma":[0.92767644,0.000017481378,0.07166762,0.000046659854,0.00003916984,0.000032697273,0.000009374312,0.00004683243,0.00046374378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985099,0.0000443695,0.0006045179,0.0002287523,0.0003163067,0.00029614585],"domain_scores_gemma":[0.9978087,0.0008154857,0.00033097775,0.0007500698,0.00020611945,0.000088659064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032488134,0.00021833155,0.00041816046,0.00011634756,0.0001919521,0.00004699877,0.00044896195,0.00007516862,0.0007496482],"category_scores_gemma":[0.00035197724,0.00018479834,0.00015424048,0.0003907632,0.0002660098,0.00017553536,0.00015901815,0.00011169672,0.00020582495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016221906,0.0002510932,0.000317838,0.00035909566,0.00013800547,8.407329e-7,0.004363563,0.0000011897138,0.007476381,0.98180634,0.0049130633,0.00035635522],"study_design_scores_gemma":[0.00041635454,0.00013500315,0.00022242556,0.00019621917,0.0001475512,0.0000071506215,0.0013932437,0.006092161,0.038462978,0.9513236,0.0013376724,0.0002656121],"about_ca_topic_score_codex":0.000011966673,"about_ca_topic_score_gemma":0.000022543174,"teacher_disagreement_score":0.08920811,"about_ca_system_score_codex":0.000027213378,"about_ca_system_score_gemma":0.000033921646,"threshold_uncertainty_score":0.8208122},"labels":[],"label_agreement":null},{"id":"W2891315125","doi":"10.1016/j.disc.2019.04.007","title":"Weighted Turán problems with applications","year":2019,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Simons Foundation","keywords":"Combinatorics; Multipartite; Mathematics; Graph; Function (biology); Weight function; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.04809885223323755,"score_gpt":0.3065435816624653,"score_spread":0.25844472942922775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891315125","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.012224162,0.0009578092,0.90355986,0.00049017044,0.00024511758,0.0047494895,0.0005462594,0.00070364773,0.07652348],"genre_scores_gemma":[0.26311612,0.0004907956,0.69172645,0.00022971476,0.00088730623,0.004665835,0.0009853683,0.0006664469,0.037231952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697804,0.00004574712,0.00095452677,0.00066242326,0.000806236,0.00055300543],"domain_scores_gemma":[0.9960304,0.0007014074,0.0009725966,0.0017558147,0.00040583604,0.00013395985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005531403,0.00067007885,0.0010777276,0.00034453085,0.0001317277,0.00026949096,0.00085536216,0.00043922162,0.00021260377],"category_scores_gemma":[0.00017297363,0.0004781148,0.00024285015,0.00054153835,0.00011912069,0.00011512551,0.00069989293,0.00081939413,0.0002229313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017981813,0.00056975376,0.00008453073,0.03685081,0.0006334024,0.000007638841,0.005544026,0.00029141386,0.0000127648955,0.951999,0.0032106622,0.0007780158],"study_design_scores_gemma":[0.00041769294,0.000091470276,0.0000060068496,0.0015126289,0.0003973816,0.000027754111,0.0012057811,0.00508289,0.00020285742,0.9794009,0.010752848,0.0009018204],"about_ca_topic_score_codex":0.000019294039,"about_ca_topic_score_gemma":0.000014139631,"teacher_disagreement_score":0.25089195,"about_ca_system_score_codex":0.00009811443,"about_ca_system_score_gemma":0.00024298133,"threshold_uncertainty_score":0.99976707},"labels":[],"label_agreement":null},{"id":"W2903758214","doi":"10.1016/j.disc.2019.05.021","title":"Constructions of optimal orthogonal arrays with repeated rows","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Hadamard matrix; Conjecture; Combinatorics; Modulo; Hadamard transform; Row; Matrix (chemical analysis); Construct (python library); Order (exchange); Block (permutation group theory); Orthogonal array; Discrete mathematics; Computer science","score_opus":0.004278981230616464,"score_gpt":0.17707261635291874,"score_spread":0.17279363512230228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903758214","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9252033,0.000027317445,0.022580763,0.000003743001,0.000119450204,0.00018258934,0.000026698615,0.00013190495,0.051724207],"genre_scores_gemma":[0.9862836,0.0000023612909,0.013408472,0.0000018931842,0.000014630161,0.000009759207,0.000010747313,0.000026839061,0.0002417236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938416,0.000012024846,0.00024707252,0.00008848919,0.00013239676,0.00013585045],"domain_scores_gemma":[0.999544,0.0000381398,0.00006171945,0.0002813074,0.000034660734,0.000040120405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009868872,0.0001186251,0.00022418873,0.000052975498,0.000022792063,0.000012670791,0.00009340114,0.000047631653,0.00018754334],"category_scores_gemma":[0.000006158079,0.00009184944,0.000059444093,0.00014776006,0.0000581713,0.000065390705,0.000010323079,0.00008552866,0.000058113368],"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.00005827591,0.0001067213,0.005462346,0.0028363008,0.00077533256,0.000015418007,0.008124581,0.1318192,0.041914597,0.8080753,0.0004104286,0.00040151182],"study_design_scores_gemma":[0.0059516323,0.0011433766,0.0024978942,0.0036550688,0.00075939676,0.0016021446,0.04868767,0.72877663,0.14083181,0.05850094,0.0041367062,0.0034567264],"about_ca_topic_score_codex":7.6392826e-7,"about_ca_topic_score_gemma":0.0000012462569,"teacher_disagreement_score":0.74957436,"about_ca_system_score_codex":0.000007786771,"about_ca_system_score_gemma":0.000009009511,"threshold_uncertainty_score":0.37455115},"labels":[],"label_agreement":null},{"id":"W2904851722","doi":"10.1016/j.disc.2018.10.008","title":"Oriented colourings of graphs with maximum degree three and four","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Degree (music); Graph; Discrete mathematics; Orientation (vector space)","score_opus":0.026081442622298667,"score_gpt":0.22886300690060454,"score_spread":0.20278156427830588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904851722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69331855,0.000056090885,0.3036345,0.00021888042,0.00007165083,0.00017052307,0.0000027720473,0.00010489105,0.002422133],"genre_scores_gemma":[0.71805596,0.000004172187,0.2818225,0.000047302907,0.000003105034,0.000005381318,5.60577e-7,0.000009961515,0.00005102456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906135,0.000012581501,0.00023355866,0.00022849247,0.00026443263,0.00019960498],"domain_scores_gemma":[0.99901974,0.00005905921,0.0001609858,0.00049613015,0.00018121401,0.00008287373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023621725,0.00013093415,0.00019987533,0.000097154356,0.00010009931,0.000047318954,0.00030620454,0.0000422152,0.0000061797377],"category_scores_gemma":[0.000034507186,0.00008965552,0.000033811368,0.0003603111,0.00026097344,0.00013168185,0.0001789447,0.00006301917,0.000009081314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013604241,0.00007487454,0.0025246455,0.000155067,0.0000548409,0.000009079349,0.0025889815,0.0000033240187,0.001311612,0.99114573,0.00021517341,0.0019030806],"study_design_scores_gemma":[0.0008514125,0.0007524712,0.0016873971,0.00028831296,0.000042215703,0.000081697384,0.00017312779,0.03545355,0.006320455,0.95390385,0.00014998738,0.00029554428],"about_ca_topic_score_codex":0.000015260564,"about_ca_topic_score_gemma":0.000029386209,"teacher_disagreement_score":0.037241887,"about_ca_system_score_codex":0.0000039624915,"about_ca_system_score_gemma":0.000022001692,"threshold_uncertainty_score":0.3656046},"labels":[],"label_agreement":null},{"id":"W2907328673","doi":"10.1016/j.disc.2019.111607","title":"A relative bound for independence","year":2019,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Upper and lower bounds; Independence number; Independence (probability theory); Eigenvalues and eigenvectors; Mathematics; Combinatorics; Graph; Physics; Statistics; Mathematical analysis","score_opus":0.06587805643236033,"score_gpt":0.3537486403950447,"score_spread":0.2878705839626844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907328673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09504853,0.00021093956,0.85554653,0.00063650287,0.00065248186,0.0066984203,0.0011672776,0.0004523009,0.039586987],"genre_scores_gemma":[0.5981583,0.000040519033,0.38585636,0.00011628353,0.00026418795,0.0023928036,0.00028453703,0.00026744275,0.01261954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977669,0.00006474042,0.0007432309,0.0006053596,0.0004214728,0.0003982549],"domain_scores_gemma":[0.99543506,0.001862391,0.00077599974,0.001584411,0.00024122866,0.00010088091],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009514753,0.00048325336,0.00077418704,0.0001305931,0.0001934266,0.00015281113,0.000803014,0.00059834233,0.00009521567],"category_scores_gemma":[0.00089619996,0.00042992146,0.0004969371,0.00013517047,0.00014764626,0.00011146591,0.00059594546,0.0008153426,0.00013832746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011857317,0.00014419042,0.000013381212,0.0023032897,0.00019073955,9.0337875e-7,0.0029306458,0.00003881049,0.00006316578,0.992052,0.002182096,0.00006889433],"study_design_scores_gemma":[0.0003058659,0.00003873106,0.000007613511,0.0006081515,0.00034155374,0.000006180232,0.0006155877,0.004958561,0.000443603,0.99082255,0.0013496397,0.0005019658],"about_ca_topic_score_codex":0.0000030557835,"about_ca_topic_score_gemma":0.000005894327,"teacher_disagreement_score":0.5031098,"about_ca_system_score_codex":0.000073986914,"about_ca_system_score_gemma":0.00015733283,"threshold_uncertainty_score":0.9998153},"labels":[],"label_agreement":null},{"id":"W2911106712","doi":"10.1016/j.disc.2018.12.024","title":"Modified Erdös–Ginzburg–Ziv constants for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e22\" altimg=\"si12.gif\"><mml:mi mathvariant=\"double-struck\">Z</mml:mi><mml:mo>∕</mml:mo><mml:mi>n</mml:mi><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:math> and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e33\" altimg=\"si13.gif\"><mml:msup><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi mathvariant=\"double-struck\">Z</mml:mi><mml:mo>∕</mml:mo><mml:mi>n</mml:mi><mml:mi mathvariant=\"double-struck\">Z</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math>","year":2019,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Sanitarium Association; University of Minnesota Duluth","keywords":"Scroll; Mathematics; Combinatorics; Discrete mathematics; Computer graphics (images); Computer science; Theology; Philosophy","score_opus":0.021009833591813968,"score_gpt":0.24561769744811865,"score_spread":0.22460786385630468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911106712","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66215795,0.0032055692,0.011219598,0.0019600077,0.010985509,0.00048427083,0.004418994,0.0017908445,0.30377725],"genre_scores_gemma":[0.9514789,0.0036566455,0.017727101,0.0038227944,0.0061381287,0.006047235,0.0059975013,0.004320518,0.0008111545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.96000075,0.0018063731,0.008926787,0.008557546,0.0101497695,0.010558752],"domain_scores_gemma":[0.96663225,0.0067289416,0.010288367,0.009852965,0.001109624,0.005387873],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.0091534415,0.005124635,0.0022203075,0.00290985,0.0078132395,0.01058932,0.011930383,0.010318012,0.17284702],"category_scores_gemma":[0.0041010818,0.009315808,0.008261767,0.005545547,0.007467298,0.007836464,0.010978781,0.0077358196,0.006739556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010430943,0.0015726866,0.000030617895,0.006300164,0.007585702,0.00510713,0.00667691,0.00576931,0.0043759593,0.8036022,0.14576043,0.0027878932],"study_design_scores_gemma":[0.012977322,0.0053292313,0.000078829806,0.0059558866,0.007667469,0.010966219,0.0065309526,0.30430457,0.6247399,0.0062312884,0.0070673805,0.008150929],"about_ca_topic_score_codex":0.0049033463,"about_ca_topic_score_gemma":0.002750499,"teacher_disagreement_score":0.797371,"about_ca_system_score_codex":0.00012936964,"about_ca_system_score_gemma":0.0066630826,"threshold_uncertainty_score":0.99896824},"labels":[],"label_agreement":null},{"id":"W2916265538","doi":"10.1016/j.disc.2020.112025","title":"On the existence of dense substructures in finite groups","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Quadratic growth; Conjecture; Mathematics; Quadratic equation; Combinatorics; Span (engineering); Group (periodic table); Set (abstract data type); Upper and lower bounds; Finite set; Pure mathematics; Mathematical analysis; Geometry; Physics; Computer science","score_opus":0.06572966962262852,"score_gpt":0.30803539816314485,"score_spread":0.24230572854051632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916265538","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98054636,0.000265579,0.0042480077,0.00065478805,0.00054883695,0.0012569496,0.000221335,0.000103994425,0.012154136],"genre_scores_gemma":[0.98211557,0.00006432077,0.017239446,0.00024017844,0.00009958366,0.00006447164,0.000013728995,0.000089791916,0.00007292122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710345,0.00023549898,0.0011275891,0.0004971743,0.00067925657,0.00035704538],"domain_scores_gemma":[0.99316514,0.0041610734,0.00089069497,0.0016100759,0.00008777045,0.000085259926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007522399,0.0005616056,0.0010414603,0.0001688249,0.00012628539,0.000063474814,0.001342508,0.00038844516,0.00015512179],"category_scores_gemma":[0.0036512194,0.00034170708,0.000433737,0.00024851202,0.0003693733,0.000031918116,0.0012000492,0.0012707843,0.000007240635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043309494,0.00005614348,0.0000550134,0.001967302,0.000105552885,0.000024011391,0.014906758,0.00015999873,0.000046847086,0.9821691,0.00039159824,0.00007435796],"study_design_scores_gemma":[0.00021153304,0.000050639806,0.00021292952,0.0011982112,0.00010174468,0.000006164848,0.0011615804,0.0033716308,0.000843914,0.99246335,0.00001682451,0.0003614656],"about_ca_topic_score_codex":0.000009175121,"about_ca_topic_score_gemma":0.000019179006,"teacher_disagreement_score":0.0137451785,"about_ca_system_score_codex":0.000046317877,"about_ca_system_score_gemma":0.000057228317,"threshold_uncertainty_score":0.9999035},"labels":[],"label_agreement":null},{"id":"W2920900590","doi":"10.1016/j.disc.2019.02.010","title":"Corrigendum to “Enumeration of eulerian and unicursal planar maps” [Discrete Math. 282 (2004) 208–221]","year":2019,"lang":"en","type":"erratum","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Enumeration; Mathematics; Eulerian path; Planar; Combinatorics; Discrete mathematics; Pure mathematics; Computer science; Lagrangian; Computer graphics (images)","score_opus":0.01874557788561455,"score_gpt":0.25190424745218987,"score_spread":0.23315866956657533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920900590","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.0007062022,0.0014126765,0.9578654,0.0012760835,0.021968469,0.0013130481,0.000607426,0.00017511616,0.014675533],"genre_scores_gemma":[0.0102960635,0.00067132775,0.5426958,0.001315905,0.0032556066,0.00017465351,0.006970373,0.0003040369,0.43431622],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997103,0.000089826586,0.00083551905,0.00072780583,0.0008253217,0.0004185457],"domain_scores_gemma":[0.99774706,0.000094405514,0.00061950483,0.0010368625,0.00028357733,0.00021860638],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004826211,0.00050236686,0.00074800785,0.00044007433,0.00015514981,0.0002502356,0.00090817886,0.0003828127,0.0000310263],"category_scores_gemma":[0.00013845859,0.00046982005,0.00015337515,0.0006104111,0.00006014771,0.0003988396,0.0003394975,0.00041143558,0.00015514749],"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.00001601144,0.000086491666,0.000012594811,0.0010689588,0.0001368863,0.000012907383,0.0034271376,0.00067347655,0.00035758366,0.16966899,0.8219749,0.0025641047],"study_design_scores_gemma":[0.0009780895,0.0008493718,0.0003685566,0.0015253794,0.0002361453,0.00011963554,0.0004691021,0.4159949,0.0007487537,0.03497036,0.54179215,0.0019475286],"about_ca_topic_score_codex":0.000022819,"about_ca_topic_score_gemma":0.000027254026,"teacher_disagreement_score":0.4196407,"about_ca_system_score_codex":0.00007975394,"about_ca_system_score_gemma":0.00038460118,"threshold_uncertainty_score":0.99977535},"labels":[],"label_agreement":null},{"id":"W2921699086","doi":"10.1016/j.disc.2020.111811","title":"On rich and poor directions determined by a subset of a finite plane","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Iterated function; Cardinality (data modeling); Multiplicity (mathematics); Mathematics; Combinatorics; Line (geometry); Polynomial; Plane (geometry); Discrete mathematics; Geometry; Computer science; Mathematical analysis","score_opus":0.037212368150733977,"score_gpt":0.30159311182162984,"score_spread":0.26438074367089587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921699086","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70052916,0.0006818929,0.24452363,0.00448932,0.00041938396,0.0047431327,0.011881759,0.0007486546,0.03198305],"genre_scores_gemma":[0.8873214,0.00034289408,0.10936303,0.00055524945,0.0001578844,0.00027946627,0.00057997025,0.00033438002,0.0010657224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971754,0.0000846801,0.001203718,0.0005974057,0.00057465886,0.00036413415],"domain_scores_gemma":[0.99512017,0.002786541,0.00093965564,0.0007439439,0.00010629184,0.00030337617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036236498,0.00062176934,0.0014615252,0.00011762417,0.0000801364,0.000108813685,0.0004632837,0.0004385512,0.00018441642],"category_scores_gemma":[0.0030554077,0.00052007346,0.0002705219,0.0001829104,0.00015829437,0.000042729756,0.0006291627,0.0007027275,0.000026012185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028830557,0.0027139245,0.00008089494,0.058149543,0.0018404303,0.00009277171,0.020861855,0.00009249215,0.003404584,0.8689892,0.042155735,0.0013302448],"study_design_scores_gemma":[0.0005452533,0.00026273247,0.0000066905973,0.0012307393,0.00047515353,0.000010319598,0.00027916007,0.14386563,0.0007315015,0.85163367,0.0002766599,0.0006824861],"about_ca_topic_score_codex":0.000009284747,"about_ca_topic_score_gemma":0.00000576396,"teacher_disagreement_score":0.18679224,"about_ca_system_score_codex":0.000031392465,"about_ca_system_score_gemma":0.000049909755,"threshold_uncertainty_score":0.9997251},"labels":[],"label_agreement":null},{"id":"W2946625573","doi":"10.1016/j.disc.2019.04.022","title":"Corrigendum to “Colorings and spectral radius of digraphs” [Discrete Math. 339 (1) (2016) 327–332]","year":2019,"lang":"en","type":"erratum","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China-Shandong Joint Fund for Marine Science Research Centers","keywords":"Mathematics; Spectral radius; Combinatorics; RADIUS; Order (exchange); Discrete mathematics; Eigenvalues and eigenvectors; Computer science; Physics","score_opus":0.031839465290369476,"score_gpt":0.2884899560437913,"score_spread":0.25665049075342183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946625573","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14600739,0.004685562,0.033257086,0.002826066,0.035449952,0.019487016,0.008283001,0.001967441,0.7480365],"genre_scores_gemma":[0.029533248,0.0014478229,0.10879472,0.00037886674,0.0014874679,0.0009250234,0.0009036009,0.0010564054,0.85547286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99572635,0.00010083214,0.0015130917,0.0009450458,0.0008090729,0.00090563204],"domain_scores_gemma":[0.9955517,0.00047167123,0.0012188626,0.002147276,0.00020408753,0.0004064252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080103544,0.001030093,0.0019204769,0.00054429396,0.00023217873,0.00015445666,0.0011407497,0.00076625677,0.00022617792],"category_scores_gemma":[0.0004426385,0.00089183566,0.00060056715,0.0006484324,0.00037826019,0.00016740854,0.0004743219,0.00106612,0.0002445409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028069751,0.00015975069,0.000017069986,0.00284759,0.00026606247,0.000007942097,0.0028780573,9.655115e-7,0.0002820912,0.6893356,0.30408463,0.00009219948],"study_design_scores_gemma":[0.00063432043,0.00034581003,0.00007822363,0.0022076434,0.00091135746,0.0000705202,0.0018466339,0.00059399765,0.00074988516,0.81237274,0.17874323,0.0014456367],"about_ca_topic_score_codex":0.000027040847,"about_ca_topic_score_gemma":0.000027374199,"teacher_disagreement_score":0.1253414,"about_ca_system_score_codex":0.000078793506,"about_ca_system_score_gemma":0.00019145508,"threshold_uncertainty_score":0.99935323},"labels":[],"label_agreement":null},{"id":"W2949500475","doi":"10.1016/j.disc.2019.05.002","title":"On the reliability roots of simplicial complexes and matroids","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Matroid; Mathematics; h-vector; Combinatorics; Abstract simplicial complex; Simplicial complex; Simplicial homology; Reliability (semiconductor); Simplicial approximation theorem; Discrete mathematics; Simplicial set; Pure mathematics","score_opus":0.023838984940373703,"score_gpt":0.2936747050196915,"score_spread":0.2698357200793178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949500475","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98601526,0.000008115517,0.001440734,0.00049698673,0.00002607261,0.0006010782,0.000043395212,0.000042931402,0.011325412],"genre_scores_gemma":[0.9941149,0.000002691133,0.0054868446,0.00006326381,0.000015042447,0.00003074894,0.0000032830276,0.000020879495,0.00026236015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999072,0.00006003449,0.00034756208,0.00016772331,0.00020053466,0.00015214749],"domain_scores_gemma":[0.9970473,0.0019554894,0.00018776263,0.00072307384,0.00004811058,0.000038277376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000564479,0.00014344287,0.00027928437,0.000032692722,0.00009694253,0.000022084036,0.00023618636,0.000054391523,0.00019981014],"category_scores_gemma":[0.0003411962,0.00008804474,0.000092973976,0.00012625917,0.0001713407,0.000036849873,0.000083545114,0.00012544841,0.000050972903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000099577965,0.00010306325,0.00017596723,0.00023141797,0.000017148359,8.59881e-8,0.00060877175,0.0000060965913,0.0027918892,0.99555653,0.0004572252,0.000041848914],"study_design_scores_gemma":[0.0001495875,0.0000612274,0.0005857007,0.00006762111,0.000033565975,0.000002631305,0.0006795429,0.0010085576,0.0022842644,0.99487644,0.00014734418,0.000103530205],"about_ca_topic_score_codex":0.0000027216963,"about_ca_topic_score_gemma":0.000002246678,"teacher_disagreement_score":0.011063052,"about_ca_system_score_codex":0.000008452995,"about_ca_system_score_gemma":0.000009436516,"threshold_uncertainty_score":0.35903603},"labels":[],"label_agreement":null},{"id":"W2952034745","doi":"10.1016/j.disc.2016.12.019","title":"Cops and Robbers ordinals of cop-win trees","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Characterization (materials science); Discrete mathematics; Graph; Product (mathematics); Geometry","score_opus":0.13995372355013674,"score_gpt":0.42885959388119516,"score_spread":0.2889058703310584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952034745","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91230506,0.000058618592,0.016703367,0.0012337777,0.00005433405,0.00021114388,0.000042674103,0.000020284497,0.069370724],"genre_scores_gemma":[0.98789394,0.00001040079,0.00794776,0.000023159177,0.000017744476,0.000008984457,0.0000011222644,0.0000071594427,0.0040897354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988696,0.00003821444,0.00040406905,0.00018230989,0.0003883189,0.00011747611],"domain_scores_gemma":[0.9975724,0.00072483753,0.00046779806,0.0010661241,0.0000989541,0.00006986335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013484658,0.000090995745,0.0002745489,0.00005348867,0.0002777112,0.00022449638,0.00073948735,0.000039354833,0.00021440873],"category_scores_gemma":[0.0018595733,0.00006110156,0.00006485392,0.000079488855,0.00039322485,0.0001729057,0.0001818668,0.00005205004,0.00009714057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001830639,0.00011842701,0.0054820534,0.00004736649,0.00004258594,0.0000027297513,0.0053735897,0.00004379427,0.0043651834,0.9663155,0.005477676,0.012712803],"study_design_scores_gemma":[0.00029041502,0.000044045348,0.009521018,0.00006369836,0.000036470996,0.000008927624,0.003953852,0.0029383467,0.0044032275,0.9746359,0.0039492003,0.0001549131],"about_ca_topic_score_codex":0.000007573314,"about_ca_topic_score_gemma":0.000015965978,"teacher_disagreement_score":0.07558886,"about_ca_system_score_codex":0.0000036920735,"about_ca_system_score_gemma":0.000014407682,"threshold_uncertainty_score":0.24916492},"labels":[],"label_agreement":null},{"id":"W2954485064","doi":"10.1016/j.disc.2019.06.030","title":"The maximum multiplicity of the largest <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e100\" altimg=\"si3.svg\"> <mml:mi>k</mml:mi> </mml:math> -th eigenvalue in a matrix whose graph is acyclic or unicyclic","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"FP7 People: Marie-Curie Actions; Seventh Framework Programme; Natural Sciences and Engineering Research Council of Canada; Palestine Polytechnic University; Research Executive Agency; Bundesministerium für Bildung und Forschung; Universität Konstanz; Deutscher Akademischer Austauschdienst","keywords":"Mathematics; Eigenvalues and eigenvectors; Combinatorics; Multiplicity (mathematics); Inverse; Graph; Discrete mathematics; Mathematical analysis","score_opus":0.02253368435304887,"score_gpt":0.2810905412138136,"score_spread":0.25855685686076474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954485064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99547887,0.00019033186,0.0009009245,0.0008097845,0.00021810505,0.00052707526,0.00031543462,0.00012578536,0.0014336987],"genre_scores_gemma":[0.9921601,0.00028015854,0.0058691716,0.00032726253,0.0001007696,0.00044609752,0.00006273567,0.00018637534,0.00056735217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621665,0.00020610343,0.0013558615,0.00058588607,0.00082772,0.0008077858],"domain_scores_gemma":[0.9942651,0.0017786401,0.0012763666,0.0024156768,0.000079028774,0.00018522792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014937153,0.0005134369,0.000526751,0.00013884119,0.0006759823,0.00020299245,0.0015189643,0.00041162537,0.000058960795],"category_scores_gemma":[0.00073190127,0.00037723233,0.00069415034,0.0008126913,0.00051443785,0.0002505349,0.0007295209,0.0006908249,0.0004960993],"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.0000918652,0.00041606696,0.0000877376,0.00088309695,0.00021471026,0.000008959524,0.004559567,0.00006538059,0.0011358212,0.99198,0.0003655629,0.0001912038],"study_design_scores_gemma":[0.0017321855,0.0003013343,0.00033253038,0.0014049242,0.00044361444,0.00015159242,0.0075156856,0.5692706,0.008739249,0.40603405,0.0031904387,0.0008837769],"about_ca_topic_score_codex":0.0001127899,"about_ca_topic_score_gemma":0.00030823576,"teacher_disagreement_score":0.58594596,"about_ca_system_score_codex":0.000026433396,"about_ca_system_score_gemma":0.00019865145,"threshold_uncertainty_score":0.999868},"labels":[],"label_agreement":null},{"id":"W2962803950","doi":"10.1016/j.disc.2018.09.025","title":"DP-3-coloring of some planar graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; National Sanitarium Association","keywords":"Mathematics; Combinatorics; Planar graph; Planar; List coloring; Edge coloring; Discrete mathematics; Graph coloring; Graph; Computer science; Line graph; Graph power","score_opus":0.03146660688058853,"score_gpt":0.3079936122252469,"score_spread":0.27652700534465835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962803950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15996172,0.000111090834,0.82435143,0.0002269286,0.0002536491,0.0003196922,0.000010443665,0.00020760456,0.014557438],"genre_scores_gemma":[0.7568049,0.000013171465,0.24276535,0.00005478466,0.000060715647,0.000015869218,0.0000013712166,0.000020173085,0.00026365655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987042,0.000037522244,0.0002984477,0.00023506748,0.00039563427,0.00032914788],"domain_scores_gemma":[0.99864316,0.00019150037,0.00013779287,0.0008271897,0.0001106064,0.00008975816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000439743,0.00012755292,0.00021942152,0.00017926146,0.000105048195,0.000047193113,0.0011189586,0.00004447565,0.000019752075],"category_scores_gemma":[0.00012476716,0.00010593182,0.00008392702,0.000479984,0.00028128817,0.00042656707,0.00025499746,0.00010904323,0.000088935936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040770906,0.00003410072,0.0000667764,0.00006745028,0.000018797367,0.000004239568,0.0015917942,0.000003920973,0.003510334,0.9937249,0.00006984774,0.00090377044],"study_design_scores_gemma":[0.0001642826,0.00015159647,0.00010618907,0.00005963454,0.0000049553564,0.000008509214,0.00016348912,0.01095348,0.02915484,0.95886284,0.00022877265,0.00014141372],"about_ca_topic_score_codex":0.0000022143422,"about_ca_topic_score_gemma":0.0000017265501,"teacher_disagreement_score":0.5968432,"about_ca_system_score_codex":0.000015085101,"about_ca_system_score_gemma":0.00002668996,"threshold_uncertainty_score":0.4319774},"labels":[],"label_agreement":null},{"id":"W2962823499","doi":"10.1016/j.disc.2017.08.041","title":"Ideal ramp schemes and related combinatorial objects","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ideal (ethics); Mathematics; Equivalence (formal languages); Orthogonal array; Scheme (mathematics); Term (time); Discrete mathematics; Algorithm; Combinatorics; Topology (electrical circuits); Mathematical analysis; Statistics","score_opus":0.013044044360356671,"score_gpt":0.2564547124330966,"score_spread":0.24341066807273992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962823499","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7716542,0.00016765177,0.19593112,0.0018381573,0.002456693,0.000401446,0.000005128372,0.00037219012,0.027173443],"genre_scores_gemma":[0.9836667,0.0000069456087,0.016038451,0.000023565124,0.000063659994,0.000004394151,0.0000020177395,0.000007736027,0.00018648451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992256,0.000018405137,0.00020397348,0.00020314755,0.00017494237,0.00017391119],"domain_scores_gemma":[0.99906445,0.00007462814,0.00020212171,0.00054616964,0.000030956882,0.00008168593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021587411,0.00011389769,0.00016878259,0.000034088804,0.00038000225,0.0005261772,0.00059655367,0.000055185876,0.000005931135],"category_scores_gemma":[0.00017258817,0.000096321855,0.0000420554,0.00004461305,0.00008740426,0.00042338535,0.00043246202,0.00009346123,0.00003477075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029486434,0.000059056183,0.000041772997,0.00004284493,0.000028862834,0.000012132564,0.0020520592,0.0000021780872,0.00042876022,0.98260725,0.00019918203,0.01452296],"study_design_scores_gemma":[0.0016425718,0.00009413797,0.0005637607,0.000070830974,0.000015811933,0.000029938199,0.00005895163,0.17275172,0.0018174326,0.8222739,0.00043690333,0.00024404502],"about_ca_topic_score_codex":0.000007878895,"about_ca_topic_score_gemma":9.696221e-7,"teacher_disagreement_score":0.21201257,"about_ca_system_score_codex":0.000011183528,"about_ca_system_score_gemma":0.000030651394,"threshold_uncertainty_score":0.5073939},"labels":[],"label_agreement":null},{"id":"W2962843004","doi":"10.1016/j.disc.2017.09.009","title":"On a class of quaternary complex Hadamard matrices","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Japan Society for the Promotion of Science; Soochow University; Universities Space Research Association","keywords":"Mathematics; Hadamard transform; Complex Hadamard matrix; Class (philosophy); Combinatorics; Complex matrix; Association scheme; Derangement; Unit (ring theory); Skew; Complex conjugate; Discrete mathematics; Hadamard matrix; Algebra over a field; Pure mathematics","score_opus":0.025179432586805526,"score_gpt":0.2555797424418448,"score_spread":0.23040030985503926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962843004","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90585196,0.00006751841,0.0033127822,0.000040631377,0.00027123129,0.00017954015,0.00004129664,0.00013416089,0.09010089],"genre_scores_gemma":[0.9985316,0.000012434196,0.0011608845,0.0000074477093,0.000033584474,0.000009383483,0.000004202648,0.000028033588,0.00021242353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993397,0.000014175612,0.0002562642,0.000083363106,0.00016133109,0.00014519054],"domain_scores_gemma":[0.9991007,0.00007256112,0.00013357268,0.0006338799,0.000016898613,0.0000424163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015582878,0.00013175487,0.00025243405,0.000049961593,0.00009930361,0.000060998223,0.00038569403,0.000051506748,0.000058388585],"category_scores_gemma":[0.000032725566,0.00010792729,0.00009174724,0.00002765952,0.00006628547,0.00007870101,0.00003836707,0.00007263245,0.00008066022],"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.000054839642,0.0001986793,0.001972029,0.0055839997,0.00048972166,0.00004992623,0.006286601,0.0032737225,0.020136487,0.9513372,0.008455267,0.0021614938],"study_design_scores_gemma":[0.0016690143,0.00033435147,0.0061960337,0.0019830472,0.0001856903,0.000047972786,0.0023324017,0.61016047,0.020849345,0.34887692,0.0060962173,0.0012685214],"about_ca_topic_score_codex":0.0000068992504,"about_ca_topic_score_gemma":0.000002938809,"teacher_disagreement_score":0.60688674,"about_ca_system_score_codex":0.00000960344,"about_ca_system_score_gemma":0.0000027763604,"threshold_uncertainty_score":0.4401147},"labels":[],"label_agreement":null},{"id":"W2963210532","doi":"10.1016/j.disc.2014.08.023","title":"Almost all <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"> <mml:mi>k</mml:mi> </mml:math> -cop-win graphs contain a dominating set of cardinality <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"> <mml:mi>k</mml:mi> </mml:math>","year":2014,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Cardinality (data modeling); Vertex (graph theory); Graph; Discrete mathematics; Database; Computer science","score_opus":0.022176361831512063,"score_gpt":0.2696133685318904,"score_spread":0.24743700670037833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963210532","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9825631,0.0007147427,0.004276997,0.00041980017,0.0021868641,0.00058538595,0.001782556,0.00070260925,0.0067679747],"genre_scores_gemma":[0.9697467,0.0006311021,0.023191344,0.0012063237,0.0015914576,0.00093268807,0.0013083732,0.0010948202,0.00029720916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9847849,0.00081976724,0.0046341396,0.002661676,0.0038500708,0.003249455],"domain_scores_gemma":[0.98392856,0.0045545083,0.0046751834,0.0050967373,0.00051030854,0.0012347247],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0058941413,0.0024366486,0.0022201713,0.00064125325,0.0022230276,0.0011964439,0.003222257,0.0026149275,0.00018595246],"category_scores_gemma":[0.0045845755,0.0026501806,0.0034883358,0.0012471675,0.0021602819,0.0015085376,0.0029892237,0.0027067792,0.00081023417],"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.0010761473,0.00077303156,0.00007157981,0.0054375776,0.0024740128,0.0005312845,0.008779409,0.00069244206,0.0021258022,0.9752761,0.0019826326,0.00077998167],"study_design_scores_gemma":[0.0038489539,0.0013672006,0.00010566239,0.0029866172,0.0029525966,0.0010878752,0.004218311,0.9128541,0.009770028,0.054399684,0.0038462998,0.0025626828],"about_ca_topic_score_codex":0.0007686664,"about_ca_topic_score_gemma":0.00046297265,"teacher_disagreement_score":0.92087644,"about_ca_system_score_codex":0.0001198962,"about_ca_system_score_gemma":0.00080467924,"threshold_uncertainty_score":0.99996775},"labels":[],"label_agreement":null},{"id":"W2963285256","doi":"10.1016/j.disc.2018.09.006","title":"Connected <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e220\" altimg=\"si33.gif\"><mml:mi>k</mml:mi></mml:math>-dominating graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Integer (computer science); Dominating set; Cardinality (data modeling); Discrete mathematics; Database; Computer science","score_opus":0.020859113087897004,"score_gpt":0.276190103456706,"score_spread":0.255330990368809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963285256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9001754,0.00013990415,0.093395784,0.00025995777,0.0005724365,0.0001768569,0.00008198223,0.0003946285,0.0048030317],"genre_scores_gemma":[0.9190722,0.00006473314,0.07951251,0.00036067012,0.0003322817,0.00020236007,0.00007748162,0.00016968351,0.00020807903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99529904,0.00017629149,0.000974117,0.0009649747,0.0013550352,0.0012305407],"domain_scores_gemma":[0.99525905,0.0012899007,0.00075102143,0.0020596941,0.0002429487,0.00039738973],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014904055,0.00054248597,0.0004343824,0.00028188125,0.000906387,0.00067003805,0.0021334165,0.0003986363,0.00006503583],"category_scores_gemma":[0.0014222,0.0005721317,0.0004738703,0.0010262071,0.00086221425,0.0010127828,0.0015127274,0.00068703794,0.0012567671],"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.00007471704,0.00015324014,0.000012736885,0.00036401232,0.00017545107,0.000135123,0.0030467906,0.00009575889,0.0024237495,0.9920943,0.00026315614,0.0011609832],"study_design_scores_gemma":[0.00075388764,0.0004678741,0.00002784998,0.00043515174,0.00008507914,0.00019637201,0.0008230976,0.9220824,0.0113688465,0.06251595,0.00067840243,0.00056507165],"about_ca_topic_score_codex":0.000042161522,"about_ca_topic_score_gemma":0.000056596436,"teacher_disagreement_score":0.9295783,"about_ca_system_score_codex":0.000029493764,"about_ca_system_score_gemma":0.00023224285,"threshold_uncertainty_score":0.999673},"labels":[],"label_agreement":null},{"id":"W2963299192","doi":"10.1016/j.disc.2019.04.013","title":"The Hamilton–Waterloo Problem with even cycle lengths","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Hamiltonian path; Discrete mathematics; Graph","score_opus":0.0029876957720433657,"score_gpt":0.17190028242807048,"score_spread":0.16891258665602712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963299192","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9380366,0.00021171752,0.001960362,0.00004123995,0.00020412776,0.0005888128,0.000009187315,0.00032060794,0.058627315],"genre_scores_gemma":[0.9953853,0.000021179118,0.001252364,0.000009259767,0.000032552685,0.00005008467,0.000004396586,0.000056090063,0.0031887963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991765,0.000023384122,0.00022502251,0.00011338083,0.00018535228,0.000276336],"domain_scores_gemma":[0.9993213,0.0000983228,0.000044301316,0.00046635667,0.000021265438,0.000048449318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025120802,0.00016810809,0.00018219181,0.00002469503,0.00009625885,0.000087518216,0.00025621973,0.000050624527,0.00003302875],"category_scores_gemma":[0.0000040510267,0.00009346914,0.000057819827,0.000109678345,0.00004191852,0.00009538827,0.00001896516,0.00012579476,0.00041445624],"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.00008656089,0.00017079666,0.0023095892,0.00544406,0.0012620509,0.00003173481,0.072565116,0.045343593,0.012581821,0.8521362,0.003206465,0.0048620244],"study_design_scores_gemma":[0.0042846138,0.0008872481,0.001045096,0.0029205836,0.00038451375,0.0003672748,0.03854246,0.45934764,0.025568513,0.3435167,0.11931978,0.0038155618],"about_ca_topic_score_codex":0.0000029815078,"about_ca_topic_score_gemma":0.000011148603,"teacher_disagreement_score":0.5086195,"about_ca_system_score_codex":0.000016884745,"about_ca_system_score_gemma":0.0000057247807,"threshold_uncertainty_score":0.5327135},"labels":[],"label_agreement":null},{"id":"W2963423082","doi":"10.1016/j.disc.2016.09.028","title":"Decompositions of edge-colored infinite complete graphs into monochromatic paths","year":2016,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Monochromatic color; Colored; Combinatorics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Optics","score_opus":0.029825100914368602,"score_gpt":0.29478857743477654,"score_spread":0.26496347652040797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963423082","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92459434,0.00010267456,0.06451176,0.00028645893,0.00029752846,0.00072028855,0.00019248435,0.00021828814,0.009076156],"genre_scores_gemma":[0.86436975,0.000033676428,0.13521439,0.00005361865,0.000041928008,0.000052819487,0.000010228828,0.00006647942,0.00015708445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997696,0.00012700546,0.0010421274,0.00029999253,0.00043782085,0.00039709714],"domain_scores_gemma":[0.9962743,0.0018069842,0.00056684203,0.0010288736,0.00017215135,0.00015083552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004697694,0.00036676571,0.0007280117,0.00025725525,0.00029496595,0.000031779837,0.0005818846,0.00015768509,0.00028173742],"category_scores_gemma":[0.00061771675,0.00022742503,0.00035796335,0.00031937644,0.0004845723,0.00016946651,0.00027790217,0.0001359491,0.00003449926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020647123,0.00015475161,0.00022640923,0.00071688695,0.00019606936,0.000005935355,0.0062584304,0.000001341869,0.014968828,0.97583115,0.0006329296,0.0009866441],"study_design_scores_gemma":[0.0007076835,0.00012608316,0.00035636302,0.0005646556,0.00016515364,0.000024988643,0.00051740126,0.00041156248,0.0048424355,0.99175626,0.00017973594,0.0003476818],"about_ca_topic_score_codex":0.000005585811,"about_ca_topic_score_gemma":0.0000094197,"teacher_disagreement_score":0.07070263,"about_ca_system_score_codex":0.00004436353,"about_ca_system_score_gemma":0.00003340586,"threshold_uncertainty_score":0.92741233},"labels":[],"label_agreement":null},{"id":"W2963525585","doi":"10.1016/j.disc.2018.10.021","title":"Balancedly splittable Hadamard matrices","year":2018,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Japan Society for the Promotion of Science; Soochow University","keywords":"Mathematics; Hadamard transform; Complex Hadamard matrix; Hadamard product; Combinatorics; Association scheme; Hadamard matrix; Hadamard's inequality; Diagonalizable matrix; Hadamard three-lines theorem; Connection (principal bundle); Discrete mathematics; Eigenvalues and eigenvectors; Symmetric matrix; Geometry; Mathematical analysis","score_opus":0.007210121603247261,"score_gpt":0.21108673985639514,"score_spread":0.20387661825314787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963525585","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56061727,0.0007366225,0.04958087,0.00004002554,0.0011416562,0.00034919856,0.000036652393,0.001105214,0.3863925],"genre_scores_gemma":[0.993149,0.000022662834,0.0054106447,0.000021654869,0.00024199071,0.000018808467,0.000005189844,0.000043331365,0.0010867605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992206,0.000012941158,0.00024120865,0.00011287971,0.00014842144,0.00026391188],"domain_scores_gemma":[0.99947387,0.00004332737,0.000038120117,0.00034604844,0.00003193264,0.000066696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019297385,0.00015319187,0.0002033851,0.00005527951,0.00007796019,0.00006377235,0.00020366738,0.0000638263,0.00023313159],"category_scores_gemma":[0.00001702919,0.0001298989,0.00006571943,0.00019451178,0.00006326123,0.00011505063,0.00002558703,0.00007496161,0.00073033787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003795022,0.00018665093,0.0021817486,0.0052790227,0.0006609442,0.00004283182,0.018313248,0.0014240715,0.032427043,0.86734563,0.06728515,0.0048156977],"study_design_scores_gemma":[0.0017619827,0.0004049078,0.001151019,0.0013855589,0.0002939974,0.00019033543,0.007414642,0.3256403,0.07663989,0.3650869,0.21710062,0.0029298598],"about_ca_topic_score_codex":0.0000023218595,"about_ca_topic_score_gemma":0.0000032470712,"teacher_disagreement_score":0.5022587,"about_ca_system_score_codex":0.000016471495,"about_ca_system_score_gemma":0.000004613261,"threshold_uncertainty_score":0.93872595},"labels":[],"label_agreement":null},{"id":"W2963542394","doi":"10.1016/j.disc.2019.111773","title":"Block-avoiding point sequencings of directed triple systems","year":2019,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Permutation (music); Combinatorics; Mathematics; Block (permutation group theory); Order (exchange); Directed graph; Graph; Transitive relation; Discrete mathematics; Physics","score_opus":0.026001093610206177,"score_gpt":0.2602901764056131,"score_spread":0.23428908279540692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963542394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018305773,0.00076657825,0.97356087,0.00008699923,0.0020873449,0.0009617548,0.00018792314,0.0004504081,0.0035923577],"genre_scores_gemma":[0.70888203,0.00012279372,0.28935146,0.000031293293,0.0001965934,0.000072160154,0.00014147388,0.00007850072,0.0011236627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973227,0.0001297289,0.00089417404,0.0006310335,0.0006801568,0.0003422529],"domain_scores_gemma":[0.9962112,0.00026777195,0.00097593176,0.002213524,0.00022326189,0.0001083331],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008409233,0.00039105426,0.000885911,0.0001844306,0.000096803655,0.0003212869,0.001968466,0.00027890093,0.000008403552],"category_scores_gemma":[0.00019850086,0.0003142018,0.00022316462,0.00023525444,0.000045210327,0.00025886454,0.0032728782,0.00058849616,0.00003954372],"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.000059983933,0.0016242629,0.00048939546,0.05809068,0.001913606,0.00024965507,0.086351745,0.07826904,0.029856216,0.6897371,0.047603298,0.005755028],"study_design_scores_gemma":[0.00022850808,0.000040154177,0.00001692778,0.002339225,0.00004656252,0.000027537992,0.0003888874,0.9835493,0.0022075472,0.010271533,0.00044306528,0.00044075798],"about_ca_topic_score_codex":0.00018602976,"about_ca_topic_score_gemma":0.0000012947172,"teacher_disagreement_score":0.90528023,"about_ca_system_score_codex":0.000100100944,"about_ca_system_score_gemma":0.0001928957,"threshold_uncertainty_score":0.999931},"labels":[],"label_agreement":null},{"id":"W2963607496","doi":"10.1016/j.disc.2017.10.007","title":"On the unimodality of independence polynomials of very well-covered graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unimodality; Mathematics; Combinatorics; Discrete mathematics; Graph; Independent set","score_opus":0.04967600486227844,"score_gpt":0.33161046863166177,"score_spread":0.28193446376938336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963607496","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9532309,0.00002694651,0.008995891,0.00032087183,0.0004698433,0.0010382854,0.00009796901,0.00007049151,0.035748776],"genre_scores_gemma":[0.98481065,0.000019659568,0.014687528,0.000024658357,0.00003805969,0.000031913354,0.0000019888655,0.00006657617,0.00031896183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99701244,0.00012772385,0.0011795488,0.00029859098,0.0010176942,0.00036398057],"domain_scores_gemma":[0.9905917,0.003292695,0.0024527782,0.0032996938,0.00027479837,0.000088334564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015457107,0.0003766438,0.00095891044,0.000099324025,0.0003344364,0.00007443865,0.001804996,0.00020863897,0.0001313951],"category_scores_gemma":[0.007555019,0.00025682503,0.0003391806,0.00014433151,0.0006277211,0.00023180856,0.00044906052,0.0003466739,0.000026769249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045070417,0.00034226416,0.000110690096,0.0007910149,0.00011993406,0.00000287741,0.001157954,0.000009613511,0.0021145826,0.994819,0.00043057906,0.000056431865],"study_design_scores_gemma":[0.00054480083,0.00012498835,0.00014396934,0.0005722867,0.000113589085,0.0000042435827,0.00062069297,0.00044956352,0.051404953,0.9457518,0.000024101319,0.000245051],"about_ca_topic_score_codex":0.000026453059,"about_ca_topic_score_gemma":0.0000076629,"teacher_disagreement_score":0.04929037,"about_ca_system_score_codex":0.000049927767,"about_ca_system_score_gemma":0.00009125491,"threshold_uncertainty_score":0.9999884},"labels":[],"label_agreement":null},{"id":"W2964123572","doi":"10.1016/j.disc.2019.07.003","title":"On representations of graphs as two-distance sets","year":2019,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Mathematics; Combinatorics; Adjacency matrix; Eigenvalues and eigenvectors; Euclidean geometry; Complement (music); Orthonormal basis; Euclidean distance; Graph; Adjacency list; Simple (philosophy); Matrix (chemical analysis); Discrete mathematics; Geometry","score_opus":0.031216660095504285,"score_gpt":0.35023527059811066,"score_spread":0.3190186105026064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964123572","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5885872,0.000012215331,0.048323743,0.00031200098,0.00014227837,0.0011249286,0.000043226933,0.00016601122,0.36128837],"genre_scores_gemma":[0.8692202,0.0000058636733,0.12439326,0.00014534463,0.000016280206,0.00007108319,0.000036156987,0.000060531413,0.0060513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797636,0.000063655854,0.00080937485,0.00028324532,0.000632802,0.00023453616],"domain_scores_gemma":[0.99736273,0.0010519606,0.00046345798,0.00085565925,0.00017443999,0.00009172678],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041991906,0.0002436222,0.0004802265,0.00014531321,0.00006181232,0.000044908404,0.00028324456,0.000084244566,0.0022534258],"category_scores_gemma":[0.0011492462,0.00018829983,0.0002101813,0.00032889607,0.00008506106,0.00016258791,0.00004895984,0.00017578776,0.00075633294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016692235,0.00029425704,0.000034772966,0.0005857923,0.000038569793,9.678986e-7,0.0018477514,0.000012402698,0.0006157789,0.99500245,0.00142109,0.00012949454],"study_design_scores_gemma":[0.000550122,0.00012730238,0.000017019296,0.00033093613,0.00004019641,0.000007677146,0.0012381629,0.015083198,0.006852264,0.97542524,0.00012140064,0.00020646465],"about_ca_topic_score_codex":0.000006374316,"about_ca_topic_score_gemma":0.0000053611484,"teacher_disagreement_score":0.35523707,"about_ca_system_score_codex":0.00003323134,"about_ca_system_score_gemma":0.00003226107,"threshold_uncertainty_score":0.99865866},"labels":[],"label_agreement":null},{"id":"W2964533042","doi":"10.1016/j.disc.2019.06.036","title":"Characterizations of graphs <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e25\" altimg=\"si20.svg\"><mml:mi>G</mml:mi></mml:math> having all <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e30\" altimg=\"si21.svg\"><mml:mrow><mml:mo>[</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>k</mml:mi><mml:mo>]</mml:mo></mml:mrow></mml:math>-factors in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e44\" altimg=\"si22.svg\"><mml:mrow><mml:mi>k</mml:mi><mml:mi>G</mml:mi></mml:mrow></mml:math>","year":2019,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.02091355520300997,"score_gpt":0.2545854632087166,"score_spread":0.23367190800570664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964533042","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9290619,0.0020379184,0.0033891555,0.001205925,0.0050567784,0.00050601433,0.004421725,0.0014232035,0.052897412],"genre_scores_gemma":[0.95839256,0.003848919,0.01139985,0.0026413319,0.0037338382,0.0059298594,0.009515378,0.0038818158,0.00065644016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9672865,0.0015336538,0.008917607,0.006351681,0.007962012,0.007948518],"domain_scores_gemma":[0.9694741,0.006893373,0.010492287,0.008497077,0.00089687743,0.0037462863],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0073019736,0.0045459224,0.002273643,0.0023425394,0.0054027825,0.0048145824,0.008416306,0.008188242,0.020731661],"category_scores_gemma":[0.005816179,0.0072904257,0.0070852973,0.0046217632,0.0056745065,0.005245565,0.0072645545,0.006819361,0.00890239],"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.002642178,0.0027879404,0.000051902636,0.008186872,0.005859398,0.002072178,0.009594449,0.003154992,0.009724852,0.92813975,0.0264168,0.0013686881],"study_design_scores_gemma":[0.0057189646,0.003884943,0.00015950757,0.0076085483,0.007885371,0.004078012,0.010112174,0.5988349,0.3397602,0.0073628617,0.007828473,0.0067660552],"about_ca_topic_score_codex":0.0026769163,"about_ca_topic_score_gemma":0.002407151,"teacher_disagreement_score":0.9207769,"about_ca_system_score_codex":0.00013568359,"about_ca_system_score_gemma":0.0040010256,"threshold_uncertainty_score":0.99703145},"labels":[],"label_agreement":null},{"id":"W2979458541","doi":"10.1016/j.disc.2020.111886","title":"Set systems related to a house allocation problem","year":2020,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research, Development and Innovation Office; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Institute for Basic Science; Mount Allison University; Magyar Tudományos Akadémia; Korea Basic Science Institute","keywords":"Injective function; Cardinality (data modeling); Preference; Set (abstract data type); Combinatorics; Pareto principle; Mathematics; Mathematical economics; Revealed preference; Discrete mathematics; Computer science; Mathematical optimization; Statistics; Econometrics","score_opus":0.05044665340150343,"score_gpt":0.3165084038017139,"score_spread":0.26606175040021046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979458541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6947565,0.0012916189,0.19283769,0.0060164,0.007024174,0.022621596,0.0017528145,0.008542916,0.06515628],"genre_scores_gemma":[0.8806722,0.00005186367,0.11601232,0.00020396922,0.00026981428,0.0005721149,0.00013694879,0.00048844295,0.0015923065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962822,0.00020616369,0.0014233455,0.0008105778,0.0007760379,0.0005016475],"domain_scores_gemma":[0.99648476,0.0004418088,0.00083837676,0.0017142716,0.00021757474,0.0003032326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083281455,0.0007367013,0.0011891562,0.0002192977,0.00023225485,0.0002846498,0.0010918679,0.00067137205,0.00004373813],"category_scores_gemma":[0.00082834304,0.0006071219,0.0003700539,0.00033253056,0.00009332951,0.00007304788,0.0017683738,0.0010227604,0.00014380694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019209438,0.000055105877,0.000012426657,0.00641909,0.00042743562,0.00002213802,0.04463686,0.0008356761,0.00013434436,0.9382973,0.0090636145,0.00007680221],"study_design_scores_gemma":[0.00025778677,0.00007363138,0.000006386116,0.001390185,0.00035029452,0.00003087394,0.002138955,0.010610177,0.00017422065,0.9833542,0.0008403541,0.00077294593],"about_ca_topic_score_codex":0.00001760271,"about_ca_topic_score_gemma":0.000004099537,"teacher_disagreement_score":0.18591571,"about_ca_system_score_codex":0.00013558958,"about_ca_system_score_gemma":0.00010460421,"threshold_uncertainty_score":0.999638},"labels":[],"label_agreement":null},{"id":"W2982273608","doi":"10.1016/j.disc.2019.111784","title":"Divisible design Cayley digraphs","year":2019,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Hrvatska Zaklada za Znanost; University of Lethbridge","keywords":"Cayley graph; Combinatorics; Digraph; Cayley transform; Characterization (materials science); Mathematics; Discrete mathematics; Physics; Voltage graph; Graph","score_opus":0.022734619903903488,"score_gpt":0.22585510259647767,"score_spread":0.20312048269257418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982273608","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.07118763,0.0023308403,0.8257469,0.000024209296,0.0035901426,0.0021499589,0.00021243306,0.0014963311,0.093261585],"genre_scores_gemma":[0.9891477,0.00013641412,0.008853195,0.000013407774,0.0001225579,0.00015610081,0.000069148475,0.00017334434,0.0013281074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983094,0.000072012874,0.0005526638,0.00033211423,0.0003174604,0.0004163544],"domain_scores_gemma":[0.9983005,0.0001829768,0.00013833067,0.0012270282,0.00004068865,0.0001105109],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004919612,0.00051316665,0.00070210116,0.00018452076,0.000053965417,0.00017027876,0.000622801,0.000399481,0.00012873315],"category_scores_gemma":[0.000032667132,0.00046365923,0.00032793346,0.0001534372,0.000047598416,0.00007042562,0.00024871464,0.0005908061,0.00056248734],"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.00002130637,0.00018603951,0.00043266243,0.02614529,0.0018412201,0.000055989443,0.016200537,0.79794836,0.0020632553,0.13266766,0.021322474,0.0011151759],"study_design_scores_gemma":[0.000553686,0.00007601916,0.00011157726,0.003202184,0.0004040954,0.00003173466,0.0013848838,0.5563248,0.006254248,0.42614055,0.0031312287,0.0023850156],"about_ca_topic_score_codex":0.0000050309372,"about_ca_topic_score_gemma":0.0000015641847,"teacher_disagreement_score":0.9179601,"about_ca_system_score_codex":0.000044596574,"about_ca_system_score_gemma":0.000027920652,"threshold_uncertainty_score":0.9997815},"labels":[],"label_agreement":null},{"id":"W3005139504","doi":"10.1016/j.disc.2020.111837","title":"Disjoint cycles and chorded cycles in a graph with given minimum degree","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Foundation","keywords":"Mathematics; Combinatorics; Degree (music); Disjoint sets; Graph; Discrete mathematics","score_opus":0.02041939034260443,"score_gpt":0.20803890247721818,"score_spread":0.18761951213461375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005139504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9890902,0.00033006334,0.0055087064,0.00020984453,0.00003127664,0.000270621,0.00001894654,0.0001862698,0.004354064],"genre_scores_gemma":[0.99747306,0.000036745667,0.002347854,0.000026603731,0.00002699088,0.00003047341,0.0000052163787,0.000041186733,0.000011842902],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923223,0.000023130691,0.00025464068,0.00015583915,0.00012673264,0.00020744401],"domain_scores_gemma":[0.9996099,0.000059935417,0.00003925899,0.00017212333,0.000009603099,0.00010916302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000098742035,0.00019032336,0.00029110032,0.00006394233,0.000032866876,0.00004547322,0.0001227342,0.00005483624,0.0000130460985],"category_scores_gemma":[0.000021552027,0.00014715873,0.000044529163,0.0002042713,0.00006691576,0.000088401124,0.000030606778,0.0001223046,0.000012233529],"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.00070385356,0.00078763673,0.06658062,0.03235564,0.0023302604,0.0009663004,0.397046,0.02572187,0.0743559,0.3747384,0.004099929,0.020313572],"study_design_scores_gemma":[0.009924691,0.0013364849,0.056281365,0.00537827,0.00058741594,0.0003272311,0.08738974,0.5585893,0.021723652,0.25018975,0.0025937022,0.0056784144],"about_ca_topic_score_codex":0.0000041647095,"about_ca_topic_score_gemma":0.000029914807,"teacher_disagreement_score":0.5328674,"about_ca_system_score_codex":0.000008119167,"about_ca_system_score_gemma":0.0000040566692,"threshold_uncertainty_score":0.6000959},"labels":[],"label_agreement":null},{"id":"W3012606778","doi":"10.1016/j.disc.2021.112368","title":"An efficiently generated family of binary de Bruijn sequences","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Nanyang Technological University","keywords":"De Bruijn sequence; Successor cardinal; Binary number; Shift register; Class (philosophy); Combinatorics; Discrete mathematics; Mathematics; Function (biology); State space; Computer science; Pseudorandom binary sequence; State (computer science); Sequence (biology); Algorithm; Arithmetic; Artificial intelligence; Statistics; Telecommunications","score_opus":0.0204393012070907,"score_gpt":0.2677536446587591,"score_spread":0.24731434345166842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012606778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.652468,0.00016044662,0.34544778,0.000078334284,0.00007961477,0.000045129927,0.000005887881,0.000088833265,0.0016259524],"genre_scores_gemma":[0.84180385,0.000020394955,0.15795755,0.00013564978,0.00001929423,0.000004398709,0.0000060312855,0.000008216624,0.000044596214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989772,0.00011736293,0.0002459476,0.00022970891,0.0002172208,0.0002126006],"domain_scores_gemma":[0.9989607,0.000094286246,0.00010439074,0.0006479243,0.00011017945,0.00008254693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004114442,0.00011523117,0.00018243857,0.00007672972,0.00008988696,0.00010682562,0.0006567381,0.000048709928,0.000018721814],"category_scores_gemma":[0.00004150606,0.000101301455,0.00009314055,0.00066094013,0.00008404019,0.00018121397,0.00012644772,0.00007492683,0.000008282242],"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.0000039932656,0.00028569647,0.00020706466,0.000118945405,0.000035473833,0.000061358915,0.0049909363,0.0011824145,0.34943357,0.64193124,0.0001268135,0.0016224879],"study_design_scores_gemma":[0.00043284093,0.00041151617,0.0014144091,0.00023769538,0.000054395154,0.00009247454,0.0026401677,0.54058874,0.23610291,0.21705912,0.0004039476,0.00056182337],"about_ca_topic_score_codex":0.000004623037,"about_ca_topic_score_gemma":0.0000017430929,"teacher_disagreement_score":0.5394063,"about_ca_system_score_codex":0.000011091715,"about_ca_system_score_gemma":0.000109125,"threshold_uncertainty_score":0.41309533},"labels":[],"label_agreement":null},{"id":"W3016468461","doi":"10.1016/j.disc.2021.112309","title":"Reflexive coloring complexes for 3-edge-colorings of cubic graphs","year":2021,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canada Excellence Research Chairs, Government of Canada","keywords":"Combinatorics; Graph coloring; Edge coloring; Mathematics; Cubic graph; Complete coloring; Discrete mathematics; Graph; 1-planar graph; Line graph; Graph power; Voltage graph","score_opus":0.07047065590626489,"score_gpt":0.3604143091718357,"score_spread":0.2899436532655708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016468461","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.102537625,0.00046311197,0.8913427,0.00018011496,0.00039443534,0.0015225424,0.000096932825,0.00021223028,0.0032503328],"genre_scores_gemma":[0.3743522,0.00009893643,0.62450504,0.000031047977,0.000040229093,0.00050812954,0.000060576018,0.000071384726,0.00033246385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968649,0.00011151098,0.0008818586,0.00085201534,0.00067216315,0.00061755255],"domain_scores_gemma":[0.99558246,0.0010166633,0.0007137696,0.001960939,0.00056899566,0.00015715207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092771224,0.00044804552,0.0010167832,0.0003527755,0.00016894311,0.0002799201,0.002639692,0.00024840608,0.000015035899],"category_scores_gemma":[0.00046678795,0.00043004454,0.00055035757,0.0005555519,0.00039523744,0.0002901808,0.0035405266,0.0005937233,0.0000055635273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020345255,0.0001288203,0.000029603514,0.0032326214,0.00019628897,0.000012410398,0.0045139585,0.00066361396,0.0045604096,0.98602396,0.00005438742,0.00056359486],"study_design_scores_gemma":[0.00040235667,0.00016303331,0.000044468376,0.0010079152,0.00005997875,0.000010632129,0.0010401736,0.030562017,0.039663505,0.9262362,0.0002572693,0.00055240834],"about_ca_topic_score_codex":0.0000069197363,"about_ca_topic_score_gemma":0.0000063154657,"teacher_disagreement_score":0.27181455,"about_ca_system_score_codex":0.000093768685,"about_ca_system_score_gemma":0.00021035926,"threshold_uncertainty_score":0.9998151},"labels":[],"label_agreement":null},{"id":"W3023517918","doi":"10.1016/j.disc.2021.112780","title":"Investigating the discrepancy property of de Bruijn sequences","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"De Bruijn sequence; Substring; Mathematics; Combinatorics; String (physics); Upper and lower bounds; Binary number; Discrete mathematics; De Bruijn graph; Simple (philosophy); Data structure; Arithmetic; Computer science; Mathematical analysis","score_opus":0.02649436287000227,"score_gpt":0.25102502956612394,"score_spread":0.22453066669612168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023517918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.500749,0.000312005,0.4680189,0.0062123234,0.00029876307,0.0006602659,0.00002572359,0.00035405747,0.023368955],"genre_scores_gemma":[0.92262036,0.0000045877664,0.076826744,0.00025733028,0.000019052903,0.00006418388,0.0000012409143,0.000008844837,0.0001976543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988832,0.00017961631,0.00025114656,0.00016342469,0.00032380357,0.00019880015],"domain_scores_gemma":[0.9989668,0.0002096867,0.00018667418,0.00056803634,0.000025394618,0.000043389766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010357657,0.000098371675,0.00013755144,0.00004617762,0.00042829604,0.00007076015,0.0012951061,0.000014107665,0.000036595462],"category_scores_gemma":[0.00011811391,0.000052840034,0.0001009919,0.00050534663,0.00016415212,0.00013463266,0.0006115527,0.0001651653,0.000002291671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010335237,0.000044887296,0.00057633437,0.000067981324,0.000020892543,0.0000022195388,0.015665771,0.0002018877,0.0014310302,0.9795076,0.00021310397,0.0022672499],"study_design_scores_gemma":[0.000109291184,0.0001330408,0.0001917746,0.000057957484,0.000019938507,0.000052490475,0.0036884479,0.0776774,0.0025084235,0.91366565,0.0017098081,0.00018575006],"about_ca_topic_score_codex":0.000026608102,"about_ca_topic_score_gemma":0.0000029982193,"teacher_disagreement_score":0.42187133,"about_ca_system_score_codex":0.000018524914,"about_ca_system_score_gemma":0.000074064716,"threshold_uncertainty_score":0.32941502},"labels":[],"label_agreement":null},{"id":"W3025609620","doi":"10.1016/j.disc.2020.111958","title":"Sum-free sets generated by the period-<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e22\" altimg=\"si8.svg\"><mml:mi>k</mml:mi></mml:math>-folding sequences and some Sturmian sequences","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"China Scholarship Council; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Sequence (biology); Generalization; Period (music); Folding (DSP implementation); Set (abstract data type); Discrete mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.022021716403563683,"score_gpt":0.24535637632110602,"score_spread":0.22333465991754234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025609620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9872509,0.0010962598,0.0074572572,0.002820526,0.00032733878,0.00011326727,0.00015289172,0.00030871268,0.00047282636],"genre_scores_gemma":[0.9826036,0.0002550067,0.014960332,0.001574917,0.00028865624,0.00010303547,0.00009067802,0.000081831386,0.000041942785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704623,0.0001221484,0.0006577725,0.00071178173,0.0008004738,0.0006615713],"domain_scores_gemma":[0.9976452,0.00041235247,0.0005087213,0.0010959563,0.00005154927,0.00028620704],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008022729,0.00042494547,0.00031732087,0.000060528437,0.00073461095,0.0011526654,0.0019342359,0.00025712463,0.00001886361],"category_scores_gemma":[0.00033983053,0.00035590935,0.00021813734,0.00039475656,0.00048934866,0.0009428823,0.0011159169,0.00040746023,0.00017135993],"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.000011894128,0.000039495364,0.000008459028,0.0002711968,0.00012140783,0.000115398936,0.0065756296,0.0001753903,0.00413291,0.9868416,0.00075549213,0.0009510937],"study_design_scores_gemma":[0.00030924598,0.00020517362,0.000013494661,0.00025280842,0.0000982321,0.00022527738,0.00253003,0.9774693,0.0074632973,0.010383546,0.000616232,0.00043331544],"about_ca_topic_score_codex":0.0000902932,"about_ca_topic_score_gemma":0.000032246477,"teacher_disagreement_score":0.97729397,"about_ca_system_score_codex":0.000015489011,"about_ca_system_score_gemma":0.000179305,"threshold_uncertainty_score":0.9998893},"labels":[],"label_agreement":null},{"id":"W3037080634","doi":"10.1016/j.disc.2020.112022","title":"Efficient universal cycle constructions for weak orders","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Science and ICT, South Korea","keywords":"Mathematics; Transitive relation; Combinatorics; Rank (graph theory); Order (exchange); Construct (python library); Discrete mathematics; Event (particle physics); Computer science","score_opus":0.017558851393745693,"score_gpt":0.24588546281322898,"score_spread":0.2283266114194833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037080634","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.004143951,0.000014858624,0.99154925,0.0015413774,0.00014530026,0.00021283256,0.000043434204,0.00014978429,0.0021991853],"genre_scores_gemma":[0.15349066,0.0000025574707,0.84611714,0.00020646623,0.00007700506,0.000013423016,0.000015583702,0.000014047705,0.00006314054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993002,0.000010168567,0.00015504693,0.00021461424,0.00015413323,0.00016585432],"domain_scores_gemma":[0.99938905,0.000084077714,0.000072865274,0.00029447253,0.000047490874,0.000112030655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000059727623,0.00009638882,0.0001277378,0.000026161204,0.00015409419,0.00008933029,0.00046079204,0.000031325922,0.000018073019],"category_scores_gemma":[0.000054919612,0.00008073853,0.00006365667,0.00017950329,0.000047892157,0.00009832898,0.00022952078,0.00005900248,0.000034815064],"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.000005751155,0.00006623773,0.000008595303,0.000108679946,0.000027936077,0.0000033530973,0.0035158775,0.007158964,0.0004230052,0.9791291,0.0044488544,0.0051036957],"study_design_scores_gemma":[0.0002952471,0.00004407544,0.000005376278,0.000018368823,0.0000097071,0.0000051553843,0.0008000508,0.98573494,0.00019016325,0.005541553,0.007238384,0.00011699467],"about_ca_topic_score_codex":0.000003750818,"about_ca_topic_score_gemma":4.5188568e-7,"teacher_disagreement_score":0.97857594,"about_ca_system_score_codex":0.000013380241,"about_ca_system_score_gemma":0.0000364362,"threshold_uncertainty_score":0.32924217},"labels":[],"label_agreement":null},{"id":"W3038218193","doi":"10.1016/j.disc.2020.112043","title":"Counting independent sets in Riordan graphs","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"National Research Foundation of Korea; Ministry of Education; Ministry of Science, ICT and Future Planning; National Research Foundation","keywords":"Mathematics; Toeplitz matrix; Combinatorics; Enumeration; Discrete mathematics; Indifference graph; Pathwidth; 1-planar graph; Generalization; Graph; Chordal graph; Line graph","score_opus":0.0475157165945729,"score_gpt":0.3164951199427309,"score_spread":0.268979403348158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038218193","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9112924,0.0001317407,0.06107833,0.0015098181,0.0005501344,0.0019334346,0.00004258599,0.0008612077,0.022600353],"genre_scores_gemma":[0.8681047,0.000016469998,0.13119838,0.00026438825,0.00009480774,0.000071714065,0.000008300994,0.00015393164,0.00008733278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99680525,0.00008123559,0.0011611669,0.00048357836,0.0008333186,0.00063543033],"domain_scores_gemma":[0.9976812,0.00077426573,0.0005146652,0.0006602227,0.00010947984,0.00026018466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006137013,0.00046405612,0.00083409715,0.00014829359,0.000108303495,0.000103825216,0.00066099456,0.00018712314,0.000117298565],"category_scores_gemma":[0.0023838507,0.0004340296,0.0001938681,0.00071384106,0.00009084831,0.00028876535,0.0003114883,0.00054770114,0.00013726026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021068716,0.0003053504,0.0005906768,0.001390547,0.00005820222,0.00008559537,0.012271677,0.000044704153,0.0007585575,0.98346514,0.0006689977,0.00033947962],"study_design_scores_gemma":[0.0010693102,0.00008507024,0.000053356864,0.0002827226,0.00005960029,0.00001874659,0.0026151254,0.010213517,0.0010305748,0.9837108,0.00032719073,0.00053393166],"about_ca_topic_score_codex":0.0000052842825,"about_ca_topic_score_gemma":0.000016211892,"teacher_disagreement_score":0.07012005,"about_ca_system_score_codex":0.00011090977,"about_ca_system_score_gemma":0.00006070437,"threshold_uncertainty_score":0.9998112},"labels":[],"label_agreement":null},{"id":"W3041462746","doi":"10.1016/j.disc.2022.113229","title":"Atomic weights and the combinatorial game of bipass","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Indian Institute of Technology Bombay; Killam Trusts","keywords":"Mathematics; Integer (computer science); Combinatorics; Surjective function; Function (biology); Combinatorial game theory; Simple (philosophy); STRIPS; Discrete mathematics; Game theory; Sequential game; Mathematical economics; Computer science; Algorithm","score_opus":0.01681235723702562,"score_gpt":0.2571901889042398,"score_spread":0.24037783166721416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041462746","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6139927,0.00045247635,0.37484503,0.0025643974,0.0020138659,0.0006760585,0.000014980626,0.00014237883,0.0052981214],"genre_scores_gemma":[0.9909494,0.0000120777895,0.008833872,0.00005094263,0.000033586268,0.00003371316,6.4348774e-7,0.000008334271,0.00007743518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890804,0.00011790312,0.00030915914,0.0001568876,0.00036158512,0.00014643597],"domain_scores_gemma":[0.99864715,0.0005988257,0.00018193545,0.0005041508,0.000035368546,0.000032577344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006322736,0.000092341026,0.00020551033,0.000047379956,0.00016561612,0.00006258729,0.00089371065,0.000019135266,0.000034707868],"category_scores_gemma":[0.00010931931,0.00006105116,0.00006761551,0.00021919217,0.0002511867,0.00010301223,0.00076695654,0.00013180038,0.000010154053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076987,0.0000312287,0.000033591674,0.000017528202,0.000012985372,0.0000016312704,0.0075426404,0.000027285663,0.00006181753,0.99154395,0.000112202215,0.0006074385],"study_design_scores_gemma":[0.0002235059,0.000042816184,0.000016146067,0.000009155309,0.000010984537,0.000013121342,0.0007844182,0.17194878,0.0026249946,0.8231527,0.0010860892,0.00008725757],"about_ca_topic_score_codex":0.000018575662,"about_ca_topic_score_gemma":0.0000012290581,"teacher_disagreement_score":0.3769567,"about_ca_system_score_codex":0.000020240876,"about_ca_system_score_gemma":0.000031155032,"threshold_uncertainty_score":0.24895942},"labels":[],"label_agreement":null},{"id":"W3047886978","doi":"10.1016/j.disc.2021.112402","title":"The threshold strong dimension of a graph","year":2021,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; University of Minnesota","keywords":"Combinatorics; Mathematics; Discrete mathematics; Vertex (graph theory); Graph","score_opus":0.025044511893581728,"score_gpt":0.26067824739411466,"score_spread":0.23563373550053293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047886978","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.32071665,0.011032507,0.6507139,0.002461679,0.0037513606,0.001360106,0.000032824584,0.0005798628,0.009351102],"genre_scores_gemma":[0.8610456,0.0003723689,0.13815488,0.0000635217,0.0000117445625,0.000042875232,0.000021446564,0.000034490735,0.00025304986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99777615,0.000067332345,0.00069957494,0.00047991768,0.0006524855,0.00032453117],"domain_scores_gemma":[0.99662644,0.00024027909,0.000545947,0.0022313735,0.0002672289,0.0000887452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007493065,0.00029547265,0.0004629356,0.000097474396,0.0002133988,0.00038382894,0.0014703339,0.00018469077,0.000004548143],"category_scores_gemma":[0.00009792448,0.00019028853,0.0003382288,0.00030226307,0.00016319424,0.000093542825,0.002520523,0.0004736677,0.0000058345504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022199556,0.00011556791,0.000044068525,0.0005046729,0.0001434537,0.00001217838,0.0029606214,0.0021311492,0.0010221587,0.99157906,0.0006325905,0.00085227337],"study_design_scores_gemma":[0.00021331149,0.000049699545,0.000033348377,0.0011297993,0.000074834374,0.000012806866,0.0006139681,0.18316706,0.004695313,0.80953807,0.00007512501,0.00039668145],"about_ca_topic_score_codex":0.000016554703,"about_ca_topic_score_gemma":0.000009111262,"teacher_disagreement_score":0.540329,"about_ca_system_score_codex":0.000015101307,"about_ca_system_score_gemma":0.00012904836,"threshold_uncertainty_score":0.7759741},"labels":[],"label_agreement":null},{"id":"W3080338863","doi":"10.1016/j.disc.2020.112122","title":"Towards generalizing MacDougall’s conjecture on vertex-magic total labelings","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Norwich University","keywords":"Combinatorics; Conjecture; Mathematics; MAGIC (telescope); Discrete mathematics; Graph; Regular graph; Vertex (graph theory); Degree (music); Line graph; Graph power","score_opus":0.027085922607382854,"score_gpt":0.24275146228219907,"score_spread":0.21566553967481622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080338863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46837762,0.001157486,0.45053357,0.04632689,0.0016468988,0.0010317366,0.000048202546,0.0023903241,0.028487267],"genre_scores_gemma":[0.8321495,0.000020855663,0.16159238,0.005898445,0.000038827486,0.000010436268,0.000010634104,0.000041259194,0.00023765421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825567,0.0000400398,0.00037432727,0.00046876055,0.00049308955,0.00036814183],"domain_scores_gemma":[0.9989233,0.000069959366,0.00013789044,0.00054757076,0.000074672986,0.0002465887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020292618,0.00027007653,0.00031772855,0.000066203116,0.00013228318,0.00025280257,0.00068820437,0.0000968095,0.000044963766],"category_scores_gemma":[0.00014608075,0.00021301815,0.00014011323,0.00040734984,0.00004959517,0.00017059324,0.0002786656,0.00025256583,0.000346546],"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.0000068830377,0.00007845337,0.000020308817,0.00018484598,0.000055326855,0.000048019665,0.0067000287,0.0015641728,0.0057591847,0.9772072,0.005702875,0.0026727428],"study_design_scores_gemma":[0.0012454437,0.0005496061,0.000037320657,0.00026515787,0.00005596546,0.00006716325,0.00024004771,0.68524563,0.014328556,0.29476076,0.0022887485,0.0009155867],"about_ca_topic_score_codex":0.00001140517,"about_ca_topic_score_gemma":6.294343e-7,"teacher_disagreement_score":0.6836815,"about_ca_system_score_codex":0.000019545505,"about_ca_system_score_gemma":0.00005276089,"threshold_uncertainty_score":0.86866283},"labels":[],"label_agreement":null},{"id":"W3082308132","doi":"10.1016/j.disc.2020.112113","title":"A note on purely imaginary independence roots","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; The Imaginary; Independence (probability theory); Independence number; Combinatorics; Discrete mathematics; Graph; Induced subgraph; Cardinality (data modeling); Computer science","score_opus":0.04075105343456869,"score_gpt":0.32541821535265825,"score_spread":0.28466716191808955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082308132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08642943,0.00018340655,0.70259404,0.011681757,0.0014839589,0.0038154577,0.0001521632,0.002987381,0.19067238],"genre_scores_gemma":[0.7472742,0.000016135564,0.25026727,0.0010607841,0.00044824247,0.000105958774,0.000010584746,0.00026100696,0.00055580994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99651945,0.00008493451,0.0009051852,0.00062023214,0.00122679,0.0006434141],"domain_scores_gemma":[0.99663794,0.0011740347,0.0005245888,0.0010629863,0.00018566784,0.00041478328],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041245687,0.0005926229,0.0008308571,0.00009964964,0.00018203967,0.00012044507,0.00092835265,0.00023896102,0.00019075278],"category_scores_gemma":[0.0036361734,0.00051720685,0.00025677998,0.00050132046,0.00014053458,0.0003088887,0.00035192238,0.0007592937,0.00091573456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069056645,0.00041656443,0.000015328184,0.0010716177,0.00006707413,0.00012776737,0.0051367963,0.000054646083,0.0016090103,0.9843039,0.006445631,0.0006826358],"study_design_scores_gemma":[0.0008680692,0.0003752822,0.0000113801325,0.000310716,0.00010486551,0.000037392787,0.00045262446,0.010587734,0.0038791138,0.98140216,0.0013134985,0.00065717776],"about_ca_topic_score_codex":0.0000014083706,"about_ca_topic_score_gemma":0.0000012682419,"teacher_disagreement_score":0.6608448,"about_ca_system_score_codex":0.00011221992,"about_ca_system_score_gemma":0.0000902128,"threshold_uncertainty_score":0.9998622},"labels":[],"label_agreement":null},{"id":"W3082929499","doi":"10.1016/j.disc.2020.112123","title":"Antimagic orientations of graphs with large maximum degree","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Science Foundation","keywords":"Combinatorics; Mathematics; Bijection; Conjecture; Vertex (graph theory); Bipartite graph; Graph; Digraph; Degree (music); Edge-graceful labeling; Complete bipartite graph; Orientation (vector space); Discrete mathematics; Line graph; Graph power; Geometry","score_opus":0.031605313835322016,"score_gpt":0.24652833615189235,"score_spread":0.21492302231657034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082929499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07673219,0.00009210739,0.9164914,0.0017258595,0.000058983132,0.00020431976,0.000019694711,0.00019346802,0.004481969],"genre_scores_gemma":[0.7090241,0.0000055930886,0.2906361,0.00028882088,0.000002095046,0.000005009144,0.000005215585,0.000010239295,0.000022845197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901456,0.000018424711,0.0002635521,0.00021347943,0.000299649,0.00019034468],"domain_scores_gemma":[0.9991882,0.000048756254,0.00015040171,0.00038714558,0.00011703331,0.00010850745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012930298,0.0001171563,0.00019845262,0.000061519204,0.000076338205,0.000050254403,0.00041073773,0.000026778245,0.000016195081],"category_scores_gemma":[0.000042589258,0.00008418844,0.000061823695,0.0006422407,0.00006278964,0.00017583168,0.000120428704,0.00007745135,0.00003179151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033220679,0.00009510878,0.00063792017,0.00014328565,0.00003140516,0.000008732491,0.0050990065,0.00007424586,0.0008957322,0.99223006,0.00048106644,0.0003000921],"study_design_scores_gemma":[0.0017144522,0.00052791,0.0004790852,0.0002150295,0.0000893991,0.000032350592,0.001384651,0.2037036,0.008489713,0.7823206,0.00049497996,0.0005481979],"about_ca_topic_score_codex":0.0000031207746,"about_ca_topic_score_gemma":0.0000016220071,"teacher_disagreement_score":0.6322919,"about_ca_system_score_codex":0.0000027206277,"about_ca_system_score_gemma":0.000030296938,"threshold_uncertainty_score":0.34331048},"labels":[],"label_agreement":null},{"id":"W3087847018","doi":"10.1016/j.disc.2020.112167","title":"Graded alphabets, circular codes, free Lie algebras and comma-free codes","year":2020,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Generalization; Mathematical proof; Embedding; Characterization (materials science); Degree (music); Discrete mathematics; Combinatorics; Code (set theory); Pure mathematics; Mathematical analysis; Geometry","score_opus":0.021235000057293535,"score_gpt":0.2294300444318054,"score_spread":0.20819504437451186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087847018","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.28953603,0.0032709597,0.68695915,0.015180185,0.00028367882,0.00074495294,0.00017156333,0.0013531898,0.0025002926],"genre_scores_gemma":[0.8427406,0.0001651081,0.15245779,0.004257014,0.00018711836,0.000029769528,0.000029985553,0.00006497047,0.00006762833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982635,0.00007772536,0.00040261334,0.00045190394,0.00042777488,0.00037650988],"domain_scores_gemma":[0.99771726,0.00028566003,0.00017209709,0.0015147496,0.000039144987,0.0002710791],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034463423,0.000289559,0.00045060922,0.00005151686,0.00017545228,0.00034887745,0.0022434657,0.00009564029,0.00002608893],"category_scores_gemma":[0.0003396124,0.00024836254,0.0001077105,0.00025668397,0.00016184917,0.0004556866,0.0013788044,0.00020229089,0.000049281105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028493325,0.000060036487,0.00007970003,0.0003262084,0.000071970135,0.000045049623,0.0044215373,0.0000052652617,0.002145879,0.9831713,0.008229549,0.0014406792],"study_design_scores_gemma":[0.000999895,0.00012101766,0.00021304897,0.00013331785,0.00005904635,0.000049825176,0.00069190905,0.13690573,0.0058725597,0.85268843,0.0017112602,0.00055397605],"about_ca_topic_score_codex":0.000008769552,"about_ca_topic_score_gemma":0.0000027858187,"teacher_disagreement_score":0.5532046,"about_ca_system_score_codex":0.000017461889,"about_ca_system_score_gemma":0.000032225897,"threshold_uncertainty_score":0.99999684},"labels":[],"label_agreement":null},{"id":"W3089503945","doi":"10.1016/j.disc.2020.112153","title":"A universal partition result for infinite homogeneous <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e22\" altimg=\"si24.svg\"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub></mml:math>-free and related graphs","year":2020,"lang":"lv","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Horizon 2020; European Research Council; Natural Sciences and Engineering Research Council of Canada; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Austrian Science Fund; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Combinatorics; Partition (number theory); Conjecture; Bipartite graph; Ramsey's theorem; Discrete mathematics; Graph","score_opus":0.020341867125559226,"score_gpt":0.24270227973976274,"score_spread":0.22236041261420353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089503945","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61251247,0.0011561391,0.0025359397,0.0010164466,0.0018304008,0.00011526266,0.0011910645,0.00032826953,0.37931398],"genre_scores_gemma":[0.9830057,0.00140289,0.010337482,0.0010777292,0.0010738982,0.0006179839,0.001353078,0.00084472506,0.00028651298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9919032,0.00039074678,0.0022027118,0.001524604,0.0019768893,0.002001844],"domain_scores_gemma":[0.9912086,0.002579864,0.0023655093,0.0025572954,0.00020987629,0.001078848],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017430529,0.000959419,0.00048239695,0.00046409687,0.0017101669,0.0011474396,0.0020124484,0.0022344142,0.12494564],"category_scores_gemma":[0.00358299,0.0016348369,0.0017353481,0.0011069856,0.0018098011,0.0009994431,0.002106756,0.0015162835,0.00057399756],"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.0012594095,0.00023550869,0.000006449197,0.0034457035,0.0019118971,0.0009993,0.009882963,0.00059836946,0.0009040858,0.84412557,0.13595119,0.0006795322],"study_design_scores_gemma":[0.0044766185,0.002988461,0.00003336097,0.0029131342,0.004613823,0.0019730965,0.008537659,0.17155007,0.77220976,0.025136223,0.002889182,0.0026786013],"about_ca_topic_score_codex":0.0002693688,"about_ca_topic_score_gemma":0.00046046486,"teacher_disagreement_score":0.81898934,"about_ca_system_score_codex":0.000014838197,"about_ca_system_score_gemma":0.0007368235,"threshold_uncertainty_score":0.9998895},"labels":[],"label_agreement":null},{"id":"W3094133489","doi":"10.1016/j.disc.2022.112971","title":"Laplacian pretty good fractional revival","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; York University","funders":"Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Laplace operator; Hamiltonian (control theory); Fractional Laplacian; Laplacian matrix; Quantum; Combinatorics; Discrete mathematics; Mathematical analysis; Quantum mechanics; Physics; Mathematical optimization","score_opus":0.010851490317494947,"score_gpt":0.24079228523005067,"score_spread":0.22994079491255573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094133489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03067867,0.00013809046,0.95201033,0.002966659,0.000795893,0.00026111293,0.00003364143,0.00043436576,0.012681237],"genre_scores_gemma":[0.58796734,0.000004316166,0.40914267,0.0008211928,0.0002913218,0.00006178452,0.000021504693,0.00003698346,0.0016528626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861825,0.00007633343,0.00023598137,0.0002825264,0.00053288735,0.00025405182],"domain_scores_gemma":[0.9991072,0.0001384171,0.00013568811,0.00051928614,0.000025412719,0.00007404238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037872116,0.0001370821,0.00016851962,0.00006783231,0.00050148077,0.00011882099,0.0008584926,0.000023004628,0.00010249078],"category_scores_gemma":[0.000039388924,0.00012225412,0.00010568275,0.0003122369,0.000025910398,0.000111170084,0.0007229367,0.00033836614,0.0000368638],"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.0000064412316,0.00038138495,0.00019299258,0.0001548874,0.000085657884,0.00008501742,0.0076084123,0.019588351,0.0003213494,0.9431202,0.006116111,0.022339202],"study_design_scores_gemma":[0.00017489814,0.00009786617,0.00019177854,0.000019718216,0.0000078951925,0.00016797968,0.00015656097,0.91164094,0.00006806523,0.0557772,0.031460002,0.00023708341],"about_ca_topic_score_codex":0.0000030302085,"about_ca_topic_score_gemma":4.2330126e-7,"teacher_disagreement_score":0.8920526,"about_ca_system_score_codex":0.000041106225,"about_ca_system_score_gemma":0.00005282747,"threshold_uncertainty_score":0.4985378},"labels":[],"label_agreement":null},{"id":"W3108030130","doi":"10.1016/j.disc.2022.112883","title":"Broadcasting on paths and cycles","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Broadcasting (networking); Mathematics; Combinatorics; Graph; Discrete mathematics; Computer science; Computer network","score_opus":0.028254784988091426,"score_gpt":0.2694434600879379,"score_spread":0.24118867509984648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3108030130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02841124,0.00008038493,0.9299205,0.0021526283,0.00015889495,0.0003418472,0.000012227603,0.00028626792,0.03863602],"genre_scores_gemma":[0.7278651,0.000018276609,0.27021196,0.00065591454,0.000023624543,0.000053810705,0.000005770809,0.000018968502,0.0011465874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992727,0.000043797092,0.00012709716,0.00015433971,0.000261907,0.00014017569],"domain_scores_gemma":[0.9995429,0.00009919996,0.000052425312,0.00023821472,0.000015220425,0.000052058393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026998273,0.00006656962,0.00008127319,0.00005536909,0.00027260452,0.00011741625,0.00029562082,0.0000100583275,0.000050341496],"category_scores_gemma":[0.000046509504,0.000058828868,0.000021097905,0.0001568607,0.000019363533,0.00009793797,0.00042053338,0.00010799859,0.000012997206],"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.0000021107458,0.00011353065,0.000112914924,0.000073286436,0.000012069445,0.000018055658,0.009810491,0.008085383,0.00020157741,0.9571578,0.0007114813,0.02370128],"study_design_scores_gemma":[0.00018040236,0.00011093979,0.00006797057,0.000017234905,0.0000020654218,0.000023450379,0.0006023304,0.96788216,0.00008697862,0.02868949,0.002206015,0.00013094652],"about_ca_topic_score_codex":0.0000012381972,"about_ca_topic_score_gemma":2.0950527e-7,"teacher_disagreement_score":0.9597968,"about_ca_system_score_codex":0.0000148287645,"about_ca_system_score_gemma":0.000014169402,"threshold_uncertainty_score":0.23989716},"labels":[],"label_agreement":null},{"id":"W3122005880","doi":"10.1016/j.disc.2023.113537","title":"Using edge cuts to find Euler tours and Euler families in hypergraphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypergraph; Mathematics; Euler's formula; Traverse; Enhanced Data Rates for GSM Evolution; Combinatorics; Euler characteristic; Discrete mathematics; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.03766042132327078,"score_gpt":0.2887181465537514,"score_spread":0.2510577252304806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122005880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55236334,0.00001732552,0.44348446,0.000774,0.00027604762,0.00020561881,0.000005528245,0.00016479958,0.0027088928],"genre_scores_gemma":[0.7387111,0.000059176855,0.26045296,0.0002119603,0.000030929357,0.000015391946,0.000005564102,0.000021636159,0.000491286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992224,0.000020937163,0.00020063006,0.00020427402,0.0001586557,0.00019310015],"domain_scores_gemma":[0.99950427,0.000118207696,0.00004374379,0.00023273217,0.000029086794,0.00007195281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017290683,0.00010738373,0.00013915203,0.00029487122,0.0000692226,0.00011996523,0.00016192524,0.00004198793,0.00001672598],"category_scores_gemma":[0.00010218554,0.0000994627,0.000028781204,0.00076344586,0.000031965883,0.0002147968,0.00015395011,0.000063986074,0.000046872614],"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.00002422141,0.00028299843,0.050645713,0.00085718336,0.00015306116,0.00016954358,0.13380113,0.0695492,0.020906495,0.5256294,0.008167203,0.18981384],"study_design_scores_gemma":[0.0003531392,0.000027767652,0.0311558,0.0001491639,0.0000097183165,0.000022859684,0.0017677984,0.9565844,0.00042070792,0.008614814,0.00054190325,0.0003519133],"about_ca_topic_score_codex":0.000012557377,"about_ca_topic_score_gemma":0.000026936112,"teacher_disagreement_score":0.8870352,"about_ca_system_score_codex":0.000019009092,"about_ca_system_score_gemma":0.000023582845,"threshold_uncertainty_score":0.4055971},"labels":[],"label_agreement":null},{"id":"W3126958331","doi":"10.1016/j.disc.2021.112319","title":"On Aharoni’s rainbow generalization of the Caccetta–Häggkvist conjecture","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Horizon 2020 Framework Programme; Rutgers, The State University of New Jersey; Natural Sciences and Engineering Research Council of Canada; Grantová Agentura, Univerzita Karlova; Division of Mathematical Sciences; National Science Foundation","keywords":"Conjecture; Combinatorics; Digraph; Rainbow; Mathematics; Generalization; Graph; Physics","score_opus":0.02114310221355421,"score_gpt":0.2860546249544033,"score_spread":0.2649115227408491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126958331","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9514996,0.00022277627,0.016400449,0.0009484465,0.0010003707,0.00067505625,0.00015443219,0.00011962624,0.028979292],"genre_scores_gemma":[0.9868285,0.000016494716,0.010398585,0.00041677733,0.00010628703,0.000013091015,0.000018101966,0.000058112946,0.0021440568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984858,0.00013103767,0.00047747747,0.00022410437,0.0004476433,0.00023391085],"domain_scores_gemma":[0.9980236,0.00048393355,0.0003297535,0.0009784331,0.00013327306,0.00005097908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027216205,0.00023251429,0.00036974146,0.000045396253,0.00026294118,0.00004099358,0.0003870032,0.00013487028,0.00032382278],"category_scores_gemma":[0.001004815,0.00014043215,0.00026342846,0.00028645276,0.00016071493,0.00004533793,0.00020731807,0.00020709162,0.000003995556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006183602,0.00007063141,0.00007821649,0.0003342512,0.00007356551,0.000004595523,0.0026075826,0.00008967821,0.00061721524,0.9924351,0.003574034,0.00010897769],"study_design_scores_gemma":[0.0003639181,0.000027692802,0.000123956,0.00017733373,0.000096025964,0.000027760954,0.00038895098,0.00089984527,0.021947334,0.9749212,0.0008371049,0.00018884153],"about_ca_topic_score_codex":0.0000019847996,"about_ca_topic_score_gemma":0.000009589968,"teacher_disagreement_score":0.03532894,"about_ca_system_score_codex":0.00003431379,"about_ca_system_score_gemma":0.000060000864,"threshold_uncertainty_score":0.5726657},"labels":[],"label_agreement":null},{"id":"W3135193972","doi":"10.1016/j.disc.2021.112362","title":"Chordality of locally semicomplete and weakly quasi-transitive digraphs","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Transitive relation; Digraph; Mathematics; Combinatorics; Strongly connected component; Discrete mathematics; Graph","score_opus":0.020454960617849585,"score_gpt":0.28865346542544035,"score_spread":0.2681985048075908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135193972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07576432,0.00031333385,0.919957,0.00038809804,0.00003857622,0.00016342793,0.000030833122,0.000063222484,0.003281217],"genre_scores_gemma":[0.8376867,0.00008207706,0.16195853,0.00007461769,0.000012081406,0.000010536481,0.000005913579,0.000016063219,0.00015346955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984568,0.00013146899,0.0003588837,0.00035795078,0.0004029646,0.00029194253],"domain_scores_gemma":[0.99840343,0.00037714248,0.0001188672,0.00075266004,0.00022623011,0.00012164597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046456084,0.0001598423,0.00033397513,0.00008176143,0.00008509598,0.00007719602,0.000495534,0.000052723142,0.00001493553],"category_scores_gemma":[0.00016511086,0.00014155876,0.00010405276,0.0005340579,0.00026365035,0.0002734277,0.0003302029,0.00017021579,0.0000065392737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009449015,0.00015186208,0.00026426715,0.00035666281,0.00006561753,0.000041324744,0.0040875087,0.000014148457,0.024371514,0.9662943,0.000022121041,0.004321243],"study_design_scores_gemma":[0.000518758,0.0001666105,0.0013187039,0.00025285815,0.000024503586,0.000098793775,0.0014166968,0.041584294,0.049561124,0.9043906,0.0002782079,0.0003888686],"about_ca_topic_score_codex":0.0000043410796,"about_ca_topic_score_gemma":0.000010047541,"teacher_disagreement_score":0.7619224,"about_ca_system_score_codex":0.0000136142135,"about_ca_system_score_gemma":0.000066475586,"threshold_uncertainty_score":0.5772599},"labels":[],"label_agreement":null},{"id":"W3156797889","doi":"10.1016/j.disc.2022.113079","title":"Irredundance trees of diameter 3","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Graph; Cardinality (data modeling); Discrete mathematics; Computer science","score_opus":0.02566232620976708,"score_gpt":0.29545894767569775,"score_spread":0.26979662146593064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156797889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04981197,0.0001669718,0.9428415,0.00030829714,0.00013182555,0.00022657025,0.000026351472,0.000101006895,0.0063855476],"genre_scores_gemma":[0.78452855,0.0000053499125,0.21433,0.000051682222,0.000010692849,0.00006499944,0.0000023855382,0.000015875732,0.0009904285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987221,0.00008514115,0.00025058704,0.00020483366,0.00050873373,0.00022860969],"domain_scores_gemma":[0.9987581,0.00023961136,0.00013343885,0.00077898946,0.00003899337,0.000050867562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044425583,0.00009521938,0.00018326036,0.00011645238,0.00015985903,0.00003240663,0.0012704767,0.000012888843,0.00010858963],"category_scores_gemma":[0.000086074375,0.00008501685,0.000090787034,0.0005174355,0.00009885742,0.0001901879,0.0008552222,0.00014849364,0.000014289333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068165173,0.00014692674,0.00018452665,0.00007570915,0.000026167161,0.000011006494,0.0042163124,0.0007509841,0.004719377,0.98424375,0.00031346185,0.0053049363],"study_design_scores_gemma":[0.00035281698,0.00025871306,0.00025085994,0.000026373895,0.000007890855,0.00003368275,0.0012158992,0.08004764,0.010427288,0.9038745,0.0032121667,0.00029212513],"about_ca_topic_score_codex":0.0000015583051,"about_ca_topic_score_gemma":0.0000010394839,"teacher_disagreement_score":0.7347166,"about_ca_system_score_codex":0.000027386755,"about_ca_system_score_gemma":0.000029194129,"threshold_uncertainty_score":0.34668866},"labels":[],"label_agreement":null},{"id":"W3158233228","doi":"10.1016/j.disc.2021.112413","title":"A new infinite class of ideal minimally non-packing clutters","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Directorate for Education and Human Resources; National Science Foundation","keywords":"Ideal (ethics); Mathematics; Conjecture; Class (philosophy); Combinatorics; Rank (graph theory); Computer science; Artificial intelligence","score_opus":0.009566289660287362,"score_gpt":0.21686219637917176,"score_spread":0.2072959067188844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158233228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8208188,0.0004600016,0.109927535,0.0001034336,0.00058331375,0.0002300625,0.000035406625,0.00023448752,0.067606956],"genre_scores_gemma":[0.98367447,0.000016527743,0.015759554,0.000037136113,0.00007053625,0.0000059536164,0.000010928611,0.00004525371,0.00037963572],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904686,0.000020471483,0.00041415961,0.00011653396,0.00018386824,0.0002181332],"domain_scores_gemma":[0.9993522,0.000104879015,0.0000763871,0.0003378854,0.00003939084,0.00008922205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015681813,0.00016197927,0.00031535057,0.00006478999,0.000027426495,0.000035866196,0.00015543125,0.00007768652,0.00008695867],"category_scores_gemma":[0.000040250903,0.00015711559,0.00013897459,0.00023406315,0.000025332225,0.00007636886,0.000041928695,0.0001145038,0.00004116273],"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.00005476791,0.00019877363,0.002295271,0.01273721,0.0016646296,0.00033233222,0.06581891,0.017972898,0.4469789,0.42601925,0.01738593,0.008541129],"study_design_scores_gemma":[0.005034198,0.00034287493,0.0030963935,0.006644249,0.0007802206,0.00047332214,0.031450655,0.2998993,0.42493412,0.20128417,0.022422766,0.0036377073],"about_ca_topic_score_codex":0.0000041777016,"about_ca_topic_score_gemma":0.0000097198235,"teacher_disagreement_score":0.28192642,"about_ca_system_score_codex":0.000015966516,"about_ca_system_score_gemma":0.000032805296,"threshold_uncertainty_score":0.6406988},"labels":[],"label_agreement":null},{"id":"W3160395046","doi":"10.1016/j.disc.2021.112441","title":"Reconfiguration of homomorphisms to reflexive digraph cycles","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education","keywords":"Homomorphism; Digraph; Mathematics; Combinatorics; Algebraic number; Discrete mathematics; Graph; Path (computing); Computer science","score_opus":0.03565127811538304,"score_gpt":0.3294347344413274,"score_spread":0.2937834563259444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160395046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05351469,0.000087033004,0.93312114,0.00072591123,0.000089491936,0.00020739205,0.000015545711,0.00008022188,0.012158599],"genre_scores_gemma":[0.56607765,0.00002534889,0.4330427,0.00010988333,0.00002212115,0.000028375382,0.000009528576,0.000017675531,0.0006667083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987236,0.000073099895,0.00033289785,0.00027902512,0.00036031232,0.00023106507],"domain_scores_gemma":[0.99845344,0.00021546723,0.00011903692,0.0008579182,0.0002451853,0.00010895534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031775018,0.00011679595,0.00022662595,0.00013371764,0.00008207598,0.00007777051,0.00059468334,0.000041958832,0.00004016456],"category_scores_gemma":[0.00029204824,0.00010508893,0.00009230987,0.00077303126,0.000067122885,0.00026570918,0.00023324885,0.00009505201,0.000058342925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045229403,0.000060850016,0.00002489008,0.00007287272,0.000021695527,0.000019095112,0.0026494404,0.000091305636,0.02183014,0.9694547,0.00010613263,0.005664353],"study_design_scores_gemma":[0.00016610339,0.00009396997,0.00022048905,0.00012148858,0.0000075497314,0.000027049691,0.0007628066,0.0053633493,0.2260255,0.76662385,0.00038614214,0.00020169411],"about_ca_topic_score_codex":0.0000015261049,"about_ca_topic_score_gemma":0.0000054255584,"teacher_disagreement_score":0.51256293,"about_ca_system_score_codex":0.000018817747,"about_ca_system_score_gemma":0.00005436127,"threshold_uncertainty_score":0.42854023},"labels":[],"label_agreement":null},{"id":"W3173071419","doi":"10.1016/j.disc.2021.112682","title":"A note on distinguishing trees with the chromatic symmetric function","year":2021,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiset; Disjoint sets; Chromatic scale; Combinatorics; Mathematics; Function (biology); Tree (set theory); Degree (music); Physics","score_opus":0.035147988713864244,"score_gpt":0.30288689250370254,"score_spread":0.2677389037898383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173071419","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.280047,0.00052915205,0.6724711,0.0016660676,0.0030244451,0.00500349,0.000114268056,0.0015454572,0.035598986],"genre_scores_gemma":[0.84460217,0.000034480097,0.15205027,0.00019325025,0.0008153765,0.0006360823,0.00010573262,0.0005059229,0.0010567002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947009,0.00028274627,0.001326033,0.0010073521,0.0018672281,0.0008157389],"domain_scores_gemma":[0.9890552,0.005112346,0.0019246397,0.0032482233,0.00045854476,0.00020103577],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011503678,0.0012318455,0.0017112755,0.00031594874,0.0005071453,0.00085703516,0.0013732935,0.0005436313,0.000076973316],"category_scores_gemma":[0.0054949378,0.0007735008,0.00052783085,0.000968192,0.0002462789,0.00017878036,0.0011960099,0.002008785,0.000052349038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112634036,0.0014905626,0.000019828625,0.011504927,0.0011663856,0.00018145728,0.017739184,0.0017040815,0.00016473907,0.9614998,0.002587579,0.0018287889],"study_design_scores_gemma":[0.0009136226,0.0004053279,0.00004990782,0.0061113266,0.0016202717,0.00006548269,0.0045319255,0.018415274,0.00050298544,0.96565914,0.0003364465,0.001388299],"about_ca_topic_score_codex":0.0000120290115,"about_ca_topic_score_gemma":0.00007075979,"teacher_disagreement_score":0.56455517,"about_ca_system_score_codex":0.00042874215,"about_ca_system_score_gemma":0.00026979175,"threshold_uncertainty_score":0.9994716},"labels":[],"label_agreement":null},{"id":"W317728043","doi":"10.1016/j.disc.2015.03.021","title":"Every 3-colorable graph has a faithful representation in the odd-distance graph","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Burnaby Hospital; Simon Fraser University","funders":"Vietnam Institute for Advanced Study in Mathematics","keywords":"Mathematics; Combinatorics; Graph; Wheel graph; Discrete mathematics; Faithful representation; Enhanced Data Rates for GSM Evolution; Plane (geometry); Geometric graph theory; Graph power; Line graph; Computer science; Geometry; Artificial intelligence","score_opus":0.08234569812872485,"score_gpt":0.33084921438935466,"score_spread":0.24850351626062983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W317728043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043735087,0.00029229766,0.944111,0.0017782198,0.00014883897,0.0007275717,0.0000071866234,0.0001455105,0.009054327],"genre_scores_gemma":[0.9173206,0.000029145594,0.08164262,0.00025734818,0.00003902195,0.00019972106,0.000009896389,0.000028580147,0.00047303055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974607,0.00030132642,0.00042489468,0.00042612763,0.0009020322,0.0004849023],"domain_scores_gemma":[0.99769396,0.00048637958,0.00017349307,0.0013705634,0.00015106869,0.00012456621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018130572,0.00020281841,0.00026095187,0.0002599053,0.00017646278,0.00042309012,0.0018160593,0.00006609967,0.000006407045],"category_scores_gemma":[0.00048130075,0.00014256104,0.00011038569,0.0020041526,0.00025953486,0.000891636,0.0002622887,0.0002991448,0.00006660639],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037156286,0.00023594996,0.0010783663,0.00009218126,0.000027224462,0.000092236136,0.027733857,0.0014215237,0.0001494859,0.96470696,0.0034146437,0.0010104048],"study_design_scores_gemma":[0.00049410155,0.000083321625,0.00034343358,0.000055785138,0.00000646899,0.00003034921,0.0042956183,0.02941526,0.0004516986,0.96374273,0.0008589893,0.00022221777],"about_ca_topic_score_codex":0.000032172444,"about_ca_topic_score_gemma":0.00006966037,"teacher_disagreement_score":0.8735855,"about_ca_system_score_codex":0.000054900585,"about_ca_system_score_gemma":0.00009371825,"threshold_uncertainty_score":0.581347},"labels":[],"label_agreement":null},{"id":"W3180039493","doi":"10.1016/j.disc.2021.112708","title":"Recolouring weakly chordal graphs and the complement of triangle-free graphs","year":2021,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Chordal graph; Mathematics; Vertex (graph theory); Graph; Discrete mathematics; Complement graph; Complement (music); Graph power; Line graph; Biology","score_opus":0.03833882838192034,"score_gpt":0.30540646669135735,"score_spread":0.267067638309437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180039493","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.20200324,0.004062885,0.7773231,0.0038215814,0.0010045765,0.0040222746,0.00018286424,0.00033219057,0.007247281],"genre_scores_gemma":[0.47424352,0.0011144697,0.5236494,0.0001127419,0.00004590555,0.00042058766,0.000041747375,0.00008721037,0.0002843775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964537,0.0004841521,0.0009695771,0.0006934527,0.0009002563,0.0004988557],"domain_scores_gemma":[0.9944837,0.0013268682,0.0006959159,0.003105996,0.00024978258,0.00013775004],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0026743615,0.00041419626,0.0010270309,0.00030066923,0.0002190938,0.0004013522,0.0034375086,0.00015346252,0.000030619318],"category_scores_gemma":[0.00072137016,0.00028908384,0.00047694548,0.0005635577,0.0006766317,0.00018025309,0.0074771084,0.0007956371,0.0000021189428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036058584,0.000090148314,0.00006228739,0.0009263693,0.00025898812,0.00001678409,0.0060384385,0.00011670099,0.00012363323,0.990029,0.0001321953,0.0021693974],"study_design_scores_gemma":[0.0014969232,0.000054192948,0.00012898119,0.0004920926,0.00006376841,0.000020487621,0.0012166656,0.022224959,0.0009916123,0.97292733,0.00006200718,0.00032098792],"about_ca_topic_score_codex":0.000026270554,"about_ca_topic_score_gemma":0.000039017687,"teacher_disagreement_score":0.27224028,"about_ca_system_score_codex":0.00003853158,"about_ca_system_score_gemma":0.00012785531,"threshold_uncertainty_score":0.99995613},"labels":[],"label_agreement":null},{"id":"W3187594655","doi":"10.1016/j.disc.2022.113108","title":"Mixing colourings in 2K2-free graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Chromatic scale; Social connectedness; Discrete mathematics","score_opus":0.021336088618649843,"score_gpt":0.28297028056507156,"score_spread":0.26163419194642173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187594655","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.45930767,0.00035594913,0.51144725,0.0024654572,0.00042379892,0.0011310597,0.000035947898,0.0005403828,0.02429247],"genre_scores_gemma":[0.8147229,0.000010242841,0.1839126,0.00019739347,0.000013897908,0.00022838976,0.0000037695543,0.000035790603,0.0008750025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998201,0.00012469728,0.0003035607,0.0003205842,0.00061472744,0.0004354304],"domain_scores_gemma":[0.99841803,0.00027363197,0.00010299509,0.0010973486,0.000028646331,0.00007936444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000975595,0.00013641722,0.00020229889,0.00031815225,0.0002569256,0.00009027089,0.0023734835,0.000023634242,0.00007059457],"category_scores_gemma":[0.00019451031,0.0001355158,0.00008251911,0.0011113611,0.000070412854,0.0002773199,0.00224377,0.00036542054,0.000018997402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000056487347,0.00009383186,0.00035663345,0.000050949497,0.000008972549,0.00007118075,0.0039731846,0.0005912156,0.0005010184,0.99331135,0.00029721975,0.0007388064],"study_design_scores_gemma":[0.00041221484,0.00007791361,0.00016873555,0.000020689136,0.0000021697306,0.000033909793,0.0008969296,0.041248348,0.0005538359,0.9554969,0.0008877687,0.00020059966],"about_ca_topic_score_codex":0.000006834128,"about_ca_topic_score_gemma":0.000007488597,"teacher_disagreement_score":0.35541525,"about_ca_system_score_codex":0.00008840798,"about_ca_system_score_gemma":0.00003946134,"threshold_uncertainty_score":0.55261743},"labels":[],"label_agreement":null},{"id":"W3198239652","doi":"10.1016/j.disc.2022.112869","title":"Minimal induced subgraphs of two classes of 2-connected non-Hamiltonian graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Induced subgraph; Hamiltonian path; Distance-hereditary graph; Indifference graph; Pancyclic graph; Induced path; Cograph; Discrete mathematics; Chordal graph; Hamiltonian path problem; Pathwidth; Induced subgraph isomorphism problem; Vertex (graph theory); Longest path problem; Line graph; Graph; Graph power; Voltage graph","score_opus":0.02732548057777925,"score_gpt":0.3102251781203765,"score_spread":0.28289969754259725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198239652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93418366,0.000051614206,0.062354952,0.00010511266,0.00012116679,0.00040957893,0.000048771155,0.00007994345,0.0026451885],"genre_scores_gemma":[0.9304326,0.0000069065436,0.069371894,0.00002315354,0.000006601399,0.000059382754,0.000006656852,0.000025649759,0.000067153065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749845,0.00019043013,0.00065911125,0.00036641356,0.00087340263,0.00041218364],"domain_scores_gemma":[0.99756414,0.0005294318,0.00045426885,0.0011587827,0.00018702685,0.0001063641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079853396,0.00021161594,0.00047970243,0.00052479666,0.00017776989,0.000031293002,0.0018310833,0.000040227613,0.000070332564],"category_scores_gemma":[0.00016648916,0.00019911288,0.00022638244,0.0019591732,0.0002068829,0.00024716143,0.0009792773,0.00029951992,0.0000040881196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032922362,0.00034973613,0.0010431685,0.00026112449,0.000087780885,0.000018194785,0.0055254274,0.00017579133,0.11751527,0.8740781,0.0000650145,0.0008474713],"study_design_scores_gemma":[0.0017952234,0.0011796388,0.0022781193,0.00011020103,0.000045542925,0.00005365019,0.003428604,0.04967229,0.13924876,0.801446,0.000106512256,0.00063545845],"about_ca_topic_score_codex":0.000018674898,"about_ca_topic_score_gemma":0.000008349923,"teacher_disagreement_score":0.07263209,"about_ca_system_score_codex":0.000029466195,"about_ca_system_score_gemma":0.00011523169,"threshold_uncertainty_score":0.81195873},"labels":[],"label_agreement":null},{"id":"W3200990721","doi":"10.1016/j.disc.2023.113341","title":"Strongly cospectral vertices in normal Cayley graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cayley graph; Mathematics; Combinatorics; Pairwise comparison; Upper and lower bounds; Discrete mathematics; Eigenvalues and eigenvectors; Cayley transform; Vertex-transitive graph; Graph; Line graph; Voltage graph","score_opus":0.037653657690925414,"score_gpt":0.3176544382678461,"score_spread":0.2800007805769207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200990721","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9821421,0.000018726601,0.0008389402,0.0002659476,0.00007038318,0.00040968283,0.00003923221,0.0003660909,0.015848912],"genre_scores_gemma":[0.9911934,0.00001866252,0.0076681282,0.000022120767,0.000030681957,0.00013586538,0.000028835317,0.000046294903,0.0008559986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985019,0.000048285678,0.00047363457,0.00024143324,0.00027269183,0.00046203262],"domain_scores_gemma":[0.9987404,0.00048226342,0.00012921593,0.00052155193,0.000032291864,0.000094294344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005752161,0.0002071151,0.00030203888,0.00022891045,0.00012767946,0.000054231015,0.0003540707,0.00008646605,0.00013885606],"category_scores_gemma":[0.00020199419,0.00018463602,0.00013564844,0.000906968,0.00010395004,0.00014697452,0.000088219545,0.00020468624,0.00031921375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007037483,0.0001242916,0.0008433619,0.00016399156,0.00002650284,0.000011414245,0.0025619082,0.00003536806,0.00048341622,0.9946737,0.0009813638,0.00008761264],"study_design_scores_gemma":[0.00036901276,0.000031821888,0.0015116697,0.0000791618,0.000041693736,0.000006670516,0.0024555784,0.0040017343,0.0011109237,0.9898877,0.00025845965,0.00024553286],"about_ca_topic_score_codex":0.000009633573,"about_ca_topic_score_gemma":0.00008115315,"teacher_disagreement_score":0.014992913,"about_ca_system_score_codex":0.000024721021,"about_ca_system_score_gemma":0.000022048856,"threshold_uncertainty_score":0.75292385},"labels":[],"label_agreement":null},{"id":"W3206226465","doi":"10.1016/j.disc.2021.112679","title":"Serial exchanges in matroids","year":2021,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Thompson Rivers University","keywords":"Matroid; Combinatorics; Mathematics; Conjecture; Rank (graph theory); Binary number; Set (abstract data type); Discrete mathematics; Arithmetic; Computer science","score_opus":0.028078970645199982,"score_gpt":0.3088374225669366,"score_spread":0.2807584519217366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206226465","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.1027116,0.00040192384,0.87903595,0.0015210204,0.00032451976,0.0002528104,0.000008748781,0.00019670282,0.015546721],"genre_scores_gemma":[0.3011719,0.0001010323,0.6949887,0.00020848056,0.00013816214,0.00007059348,0.00001067207,0.00004366875,0.0032667837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880695,0.0000794104,0.0002190834,0.00026682467,0.00030097127,0.00032677583],"domain_scores_gemma":[0.99897254,0.00015014669,0.000047357727,0.0006960116,0.00006261123,0.00007136732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034785207,0.000112786176,0.00018597764,0.000100071265,0.00004766505,0.00013119016,0.00061757857,0.000046249046,0.00006509835],"category_scores_gemma":[0.00017416336,0.00010271032,0.00005649775,0.00059783773,0.000047368223,0.00028256554,0.00046119167,0.00014122136,0.00009135596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004201799,0.00008947803,0.00011842487,0.00011635076,0.000009175018,0.00018508089,0.0029889517,0.00006728719,0.005263971,0.9869065,0.00013701589,0.004113552],"study_design_scores_gemma":[0.0005499926,0.000047517864,0.00029915688,0.000100867415,0.000003490072,0.000059874477,0.00091201917,0.028066013,0.01802975,0.95006925,0.0015578564,0.0003042201],"about_ca_topic_score_codex":0.0000015138221,"about_ca_topic_score_gemma":0.000020972544,"teacher_disagreement_score":0.19846028,"about_ca_system_score_codex":0.000030773437,"about_ca_system_score_gemma":0.000053312437,"threshold_uncertainty_score":0.41884056},"labels":[],"label_agreement":null},{"id":"W4205106693","doi":"10.1016/s0012-365x(04)00022-6","title":"Absorbing sets in arc-coloured tournaments*1","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Tournament; Mathematics; Vertex (graph theory); Combinatorics; Monochromatic color; Arc (geometry); Path (computing); Discrete mathematics; Graph; Geometry; Computer science","score_opus":0.02730265602279779,"score_gpt":0.31723079426519624,"score_spread":0.28992813824239844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205106693","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.21378796,0.00011637822,0.77867377,0.0009949671,0.00011114539,0.0003762097,0.0000029834314,0.00014968652,0.0057868958],"genre_scores_gemma":[0.8016147,0.000027758984,0.19803174,0.00010721295,0.0000140644825,0.00003020738,0.000001608559,0.000020039446,0.00015265965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846673,0.00004321702,0.00033295687,0.00028135386,0.00042122448,0.0004545184],"domain_scores_gemma":[0.9989903,0.00011470942,0.00010037162,0.0006444457,0.000040010702,0.00011014796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005340279,0.00015308124,0.00021148713,0.00020832407,0.00008641499,0.00013573648,0.0009867795,0.00005265833,0.00001582387],"category_scores_gemma":[0.0001526629,0.00013393458,0.00006782106,0.0005686914,0.000064499174,0.00041613582,0.00032951604,0.00024467983,0.00011349736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064074657,0.0001807097,0.00019503514,0.00008301591,0.0000185929,0.00014639045,0.007651407,0.0018361717,0.0019091739,0.9853745,0.000039333067,0.0025592556],"study_design_scores_gemma":[0.0007463582,0.000056814966,0.00033036768,0.00015748202,0.0000024664769,0.00003216813,0.00037191756,0.011190339,0.0032235957,0.98355114,0.00012246011,0.00021487815],"about_ca_topic_score_codex":0.0000072405255,"about_ca_topic_score_gemma":0.000014651489,"teacher_disagreement_score":0.5878267,"about_ca_system_score_codex":0.00013137936,"about_ca_system_score_gemma":0.000057840753,"threshold_uncertainty_score":0.54616934},"labels":[],"label_agreement":null},{"id":"W4205124066","doi":"10.1016/j.disc.2011.08.017","title":"Preface","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.06796630154342118,"score_gpt":0.2720509617976455,"score_spread":0.2040846602542243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205124066","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32602915,0.00005139621,0.009351336,0.000019261503,0.000098483375,0.00036718205,0.00005121652,0.00058898266,0.66344297],"genre_scores_gemma":[0.8916647,0.0000021869264,0.10520065,0.000032396754,0.000032826047,0.000027348202,0.000008054966,0.00011929814,0.0029125372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904495,0.000022143036,0.0002463053,0.00016393185,0.00024641055,0.00027622722],"domain_scores_gemma":[0.99914163,0.000032489857,0.00011950475,0.00056568015,0.000043532862,0.00009714035],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002292005,0.00015673605,0.00018069101,0.00005542366,0.00005322869,0.000023011478,0.00028973114,0.000050325445,0.0014000857],"category_scores_gemma":[0.00010931718,0.00012638846,0.00007592619,0.00016692291,0.000079599835,0.00013402816,0.00008877052,0.00009029952,0.01580441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000658488,0.0011991642,0.00432939,0.00069829635,0.0003179982,0.00007044102,0.09868882,0.000009474418,0.018292768,0.8509429,0.024367673,0.0010171857],"study_design_scores_gemma":[0.002872205,0.0005165974,0.011355523,0.0006425825,0.000676874,0.00023871218,0.022252977,0.021790586,0.18312472,0.73007405,0.023124883,0.0033303122],"about_ca_topic_score_codex":0.000013275487,"about_ca_topic_score_gemma":0.000005912572,"teacher_disagreement_score":0.66053045,"about_ca_system_score_codex":0.000025990192,"about_ca_system_score_gemma":0.0000149656125,"threshold_uncertainty_score":0.9995128},"labels":[],"label_agreement":null},{"id":"W4205253237","doi":"10.1016/s0012-365x(04)00143-8","title":"The structure of strong arc-locally semicomplete digraphs","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Mathematics; Arc (geometry); Digraph; Combinatorics; Vertex (graph theory); Class (philosophy); Generalization; Discrete mathematics; Computer science; Artificial intelligence; Graph","score_opus":0.0176590252653728,"score_gpt":0.2834667429367344,"score_spread":0.26580771767136163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205253237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067484245,0.0001735868,0.9296872,0.00041551722,0.00009235374,0.0003101569,0.000024210294,0.00009205203,0.0017206884],"genre_scores_gemma":[0.8844929,0.000021872533,0.11535447,0.000025984933,0.00001839893,0.0000041465673,0.0000023960165,0.000017024633,0.000062827756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983603,0.000050408085,0.00037655677,0.00024428449,0.00055765937,0.00041079894],"domain_scores_gemma":[0.99816567,0.00031867457,0.00019012942,0.0011176708,0.00011491353,0.000092954004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027915317,0.00017241697,0.00021966208,0.000082892344,0.00023545505,0.00012377961,0.0017806973,0.00004907174,0.0000062610948],"category_scores_gemma":[0.00013350182,0.00010748918,0.00012255865,0.0004792047,0.00032135856,0.00023525328,0.00039891616,0.0002368112,0.000009323907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045285306,0.000019596335,0.000028802677,0.00004748446,0.000028383638,0.0000031840725,0.0010961452,0.00084036915,0.008308822,0.98809195,0.000012414933,0.0015183268],"study_design_scores_gemma":[0.0003013628,0.000072746254,0.00007833218,0.00006961339,0.000006174345,0.000017998733,0.0003314074,0.0062386487,0.01712655,0.97542346,0.00018399577,0.0001497249],"about_ca_topic_score_codex":0.0000041284084,"about_ca_topic_score_gemma":0.000017499435,"teacher_disagreement_score":0.8170086,"about_ca_system_score_codex":0.00003145149,"about_ca_system_score_gemma":0.00006628592,"threshold_uncertainty_score":0.43832815},"labels":[],"label_agreement":null},{"id":"W4205374221","doi":"10.1016/j.disc.2004.02.004","title":"Ramsey numbers in complete balanced multipartite graphs. Part I: Set numbers","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multipartite; Mathematics; Combinatorics; Ramsey's theorem; Discrete mathematics; Diagonal; Monochromatic color; Graph","score_opus":0.045755448733489204,"score_gpt":0.3082959021620013,"score_spread":0.2625404534285121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205374221","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9726621,0.00007847188,0.0044320235,0.0003046333,0.0006161535,0.0009444266,0.00018052146,0.00032099872,0.02046065],"genre_scores_gemma":[0.9456642,0.00004692322,0.05337804,0.00029478152,0.00008846862,0.00007550847,0.000049538812,0.00010990042,0.00029261337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971357,0.00010363539,0.0009716433,0.00047665974,0.00055531436,0.0007570339],"domain_scores_gemma":[0.99792683,0.0004625085,0.00036136116,0.0009740582,0.00007025429,0.00020500406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066877156,0.0004901642,0.0007728035,0.00018799411,0.00025696625,0.000083476574,0.0005716562,0.00022149486,0.00020438687],"category_scores_gemma":[0.00046182572,0.00041057862,0.00030990536,0.00050510676,0.00032490792,0.00020374374,0.00020691346,0.00044446834,0.00006813709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040470564,0.00018752091,0.0017896555,0.0004719372,0.00012362332,0.000053763823,0.015168272,0.00025314192,0.00023697258,0.9802916,0.0012665779,0.00011648093],"study_design_scores_gemma":[0.0020183634,0.000047360205,0.00039152495,0.00040436556,0.000068760964,0.000041922412,0.002119458,0.0006153757,0.0004513412,0.99171954,0.0015279683,0.00059403374],"about_ca_topic_score_codex":0.00006053522,"about_ca_topic_score_gemma":0.0002060139,"teacher_disagreement_score":0.04894602,"about_ca_system_score_codex":0.00011321739,"about_ca_system_score_gemma":0.000041636085,"threshold_uncertainty_score":0.9998346},"labels":[],"label_agreement":null},{"id":"W4205385238","doi":"10.1016/j.disc.2006.03.006","title":"On some applications of graph theory, I","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Fixed Point Theorems Analysis","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Graph; Graph theory","score_opus":0.011758298050407687,"score_gpt":0.2710908438253853,"score_spread":0.2593325457749776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205385238","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.19667876,0.00021828523,0.652368,0.00031885534,0.000087049724,0.0014132002,0.000189098,0.00042607047,0.14830066],"genre_scores_gemma":[0.9198066,0.000011184466,0.07590702,0.00006494944,0.00011194985,0.00017455875,0.000043310873,0.00010993108,0.0037705072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983733,0.00006786038,0.00066807395,0.00022858953,0.00041081553,0.00025133882],"domain_scores_gemma":[0.9973106,0.0011776616,0.00041734794,0.0009537572,0.00008913029,0.00005152245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006592184,0.00023219368,0.0004662536,0.00024143276,0.00008767825,0.000026182639,0.0003608118,0.00009638016,0.00027520163],"category_scores_gemma":[0.00022844445,0.00018486385,0.0003085217,0.0004026174,0.00018056114,0.000076345714,0.00006193972,0.00013484208,0.000113934526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073280826,0.00031437774,0.000010634799,0.00022459356,0.00007899224,0.0000010171195,0.0002530926,0.00003519903,0.000507554,0.99661505,0.0017715186,0.00018062023],"study_design_scores_gemma":[0.00021132293,0.000036934398,0.00001365406,0.00007396916,0.00019564723,0.0000031772784,0.00027732912,0.00043597177,0.0045473212,0.99382657,0.00018314387,0.00019497785],"about_ca_topic_score_codex":0.000012084722,"about_ca_topic_score_gemma":0.0000074377626,"teacher_disagreement_score":0.72312784,"about_ca_system_score_codex":0.000027765363,"about_ca_system_score_gemma":0.000016225673,"threshold_uncertainty_score":0.7538529},"labels":[],"label_agreement":null},{"id":"W4205747721","doi":"10.1016/s0012-365x(04)00145-1","title":"Ramsey numbers in complete balanced multipartite graphs. Part I: Set numbers","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Research Foundation","keywords":"Multipartite; Mathematics; Combinatorics; Ramsey's theorem; Discrete mathematics; Diagonal; Monochromatic color; Graph","score_opus":0.045755448733489204,"score_gpt":0.3082959021620013,"score_spread":0.2625404534285121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205747721","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9726621,0.00007847188,0.0044320235,0.0003046333,0.0006161535,0.0009444266,0.00018052146,0.00032099872,0.02046065],"genre_scores_gemma":[0.9456642,0.00004692322,0.05337804,0.00029478152,0.00008846862,0.00007550847,0.000049538812,0.00010990042,0.00029261337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971357,0.00010363539,0.0009716433,0.00047665974,0.00055531436,0.0007570339],"domain_scores_gemma":[0.99792683,0.0004625085,0.00036136116,0.0009740582,0.00007025429,0.00020500406],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066877156,0.0004901642,0.0007728035,0.00018799411,0.00025696625,0.000083476574,0.0005716562,0.00022149486,0.00020438687],"category_scores_gemma":[0.00046182572,0.00041057862,0.00030990536,0.00050510676,0.00032490792,0.00020374374,0.00020691346,0.00044446834,0.00006813709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040470564,0.00018752091,0.0017896555,0.0004719372,0.00012362332,0.000053763823,0.015168272,0.00025314192,0.00023697258,0.9802916,0.0012665779,0.00011648093],"study_design_scores_gemma":[0.0020183634,0.000047360205,0.00039152495,0.00040436556,0.000068760964,0.000041922412,0.002119458,0.0006153757,0.0004513412,0.99171954,0.0015279683,0.00059403374],"about_ca_topic_score_codex":0.00006053522,"about_ca_topic_score_gemma":0.0002060139,"teacher_disagreement_score":0.04894602,"about_ca_system_score_codex":0.00011321739,"about_ca_system_score_gemma":0.000041636085,"threshold_uncertainty_score":0.9998346},"labels":[],"label_agreement":null},{"id":"W4205847801","doi":"10.1016/j.disc.2006.03.014","title":"Spanning subgraphs with specified valencies","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Valency; Mathematics; Combinatorics; Discrete mathematics; Vertex (graph theory); Graph factorization; Graph; Spanning tree; Voltage graph; Line graph","score_opus":0.019353913978545932,"score_gpt":0.25991806906105447,"score_spread":0.24056415508250853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205847801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07480438,0.00010454507,0.8932929,0.00016420634,0.000042062296,0.00020240764,0.0000029472687,0.00026158127,0.03112497],"genre_scores_gemma":[0.66233885,0.000005602107,0.33641833,0.000023349925,0.000045678953,0.00002022317,0.000003178778,0.000024230549,0.0011205358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843633,0.00003880381,0.00024554116,0.00031611914,0.0005310153,0.0004322138],"domain_scores_gemma":[0.9987588,0.0001870493,0.00007676022,0.0008114407,0.000092018614,0.00007396371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032049307,0.00018469304,0.00020770266,0.00016269328,0.00016539554,0.00025245573,0.00088330114,0.000038667764,0.000016835389],"category_scores_gemma":[0.000030846626,0.00013428023,0.000070845075,0.00066271005,0.00018060056,0.00041240169,0.00019655612,0.00015650953,0.00005405595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062424456,0.0000479086,0.00054305536,0.00005406494,0.000012463574,0.000035012963,0.0006114638,0.00022639317,0.0009943361,0.9967611,0.00016994795,0.00053804676],"study_design_scores_gemma":[0.00042122998,0.00016971068,0.0021617608,0.00015258197,0.000014866452,0.00008883803,0.0006784126,0.025966998,0.013303183,0.95505315,0.0014013181,0.00058795087],"about_ca_topic_score_codex":0.0000061182386,"about_ca_topic_score_gemma":0.00000771018,"teacher_disagreement_score":0.5875345,"about_ca_system_score_codex":0.000023197073,"about_ca_system_score_gemma":0.000026355377,"threshold_uncertainty_score":0.5475789},"labels":[],"label_agreement":null},{"id":"W4210323931","doi":"10.1016/j.disc.2004.02.013","title":"Polychromatic cliques","year":2004,"lang":"fr","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Enhanced Data Rates for GSM Evolution; Function (biology); Discrete mathematics; Computer science","score_opus":0.022469930234868186,"score_gpt":0.2987121381624522,"score_spread":0.27624220792758397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210323931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60204446,0.02013059,0.15223008,0.010271778,0.008530427,0.0026032624,0.00043483096,0.0010788428,0.2026757],"genre_scores_gemma":[0.5905975,0.00094036694,0.38369682,0.00080887106,0.0011716342,0.000063967396,0.000029251138,0.0003611495,0.022330442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99632627,0.00015432261,0.0012894587,0.0005086352,0.0007184228,0.0010028903],"domain_scores_gemma":[0.99686927,0.0006237169,0.0005719111,0.0014491028,0.00013980035,0.00034618072],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008229186,0.0007455968,0.0009940242,0.0001932818,0.0005808833,0.00020954623,0.0007924467,0.0005307381,0.0011959879],"category_scores_gemma":[0.00078136637,0.00064566947,0.0005744295,0.00041159763,0.00080190145,0.00035934953,0.00043592695,0.00061742193,0.00053503533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011414278,0.00043764958,0.000028642642,0.0032055504,0.00029734487,0.00008465809,0.018979646,0.000052708536,0.00011511099,0.97378016,0.0015712766,0.0014358439],"study_design_scores_gemma":[0.0009781729,0.00021430477,0.000056487763,0.0020861684,0.0004995133,0.00031720725,0.002351708,0.0005782398,0.0020955123,0.9854814,0.0045544747,0.00078684505],"about_ca_topic_score_codex":0.0000565996,"about_ca_topic_score_gemma":0.000025324587,"teacher_disagreement_score":0.23146673,"about_ca_system_score_codex":0.00026089075,"about_ca_system_score_gemma":0.00015167176,"threshold_uncertainty_score":0.99971706},"labels":[],"label_agreement":null},{"id":"W4210762532","doi":"10.1016/j.disc.2006.03.011","title":"Tough graphs and hamiltonian circuits","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Hamiltonian path; Graph; Discrete mathematics; Hamiltonian (control theory); Cubic graph; Quartic graph; Graph power; Line graph; Voltage graph","score_opus":0.016694382914690224,"score_gpt":0.2695214490345573,"score_spread":0.2528270661198671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210762532","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.1377666,0.00035297623,0.82192725,0.0006155181,0.00010383792,0.00035753276,0.0000095880905,0.00038965145,0.03847706],"genre_scores_gemma":[0.8899369,0.000019820387,0.10858767,0.000090345995,0.00002336562,0.000022550397,0.0000026434082,0.000022455739,0.0012942429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987601,0.00003965203,0.00023463785,0.00029379938,0.00032332397,0.00034849855],"domain_scores_gemma":[0.9989705,0.00018848565,0.000074332456,0.0006278272,0.000052584,0.000086256776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002993106,0.00014772215,0.00017683476,0.00012390179,0.00014417383,0.00019013038,0.0005965217,0.000046839374,0.000009480538],"category_scores_gemma":[0.000060560986,0.00012569015,0.00005504507,0.0004088785,0.00014640162,0.0003433407,0.00025544016,0.00012226448,0.00003833274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.9428405e-7,0.000025808666,0.00020767386,0.00004647264,0.000006428696,0.000013973869,0.0004749791,0.000010456102,0.00089996133,0.995301,0.00018467338,0.002828088],"study_design_scores_gemma":[0.00018633777,0.00003331085,0.001027241,0.000028833381,0.0000041111557,0.000036371566,0.000060413684,0.008222815,0.0013318136,0.9880579,0.000823914,0.00018689857],"about_ca_topic_score_codex":0.000006213489,"about_ca_topic_score_gemma":0.000007881468,"teacher_disagreement_score":0.7521703,"about_ca_system_score_codex":0.000014503296,"about_ca_system_score_gemma":0.000017704066,"threshold_uncertainty_score":0.5125495},"labels":[],"label_agreement":null},{"id":"W4211103311","doi":"10.1016/j.disc.2005.06.001","title":"Preface","year":2005,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.021165222361376527,"score_gpt":0.2850441144622575,"score_spread":0.263878892100881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211103311","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58023566,0.00021795866,0.0132514825,0.00093662314,0.000092671056,0.00062074454,0.00010475007,0.0010800458,0.4034601],"genre_scores_gemma":[0.8712709,0.0000037975542,0.1214038,0.0001067273,0.00017051802,0.000024840892,0.000014795829,0.00012258251,0.006882042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989223,0.000019647277,0.00027156458,0.00016716728,0.00032286247,0.00029646428],"domain_scores_gemma":[0.9991749,0.00005971963,0.000109738445,0.0005178371,0.000039751012,0.000098056626],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024270658,0.0001612754,0.0001847088,0.000055865614,0.00006423404,0.000054818236,0.00025494894,0.000049880993,0.0007524918],"category_scores_gemma":[0.00012249761,0.0001335809,0.00007862869,0.00016971203,0.000058790756,0.00018381109,0.000076217475,0.000102661856,0.027220294],"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.00006005002,0.0017878761,0.0015890688,0.0009093361,0.00042705084,0.000031619165,0.039025407,0.0028779372,0.072650604,0.67583627,0.19026613,0.014538639],"study_design_scores_gemma":[0.0031399073,0.00019438418,0.0013743435,0.00048116062,0.00040127742,0.00020044138,0.0064302026,0.24849811,0.093777925,0.07153868,0.5712823,0.0026812183],"about_ca_topic_score_codex":0.0000022400895,"about_ca_topic_score_gemma":0.000011032874,"teacher_disagreement_score":0.6042976,"about_ca_system_score_codex":0.00006384313,"about_ca_system_score_gemma":0.000016998381,"threshold_uncertainty_score":0.97353715},"labels":[],"label_agreement":null},{"id":"W4211168395","doi":"10.1016/j.disc.2008.03.030","title":"Preface","year":2008,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.04087345441644402,"score_gpt":0.27466794949584633,"score_spread":0.2337944950794023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211168395","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8364815,0.00008541221,0.005869083,0.00008373861,0.00007256838,0.00031714604,0.000052333573,0.00055562967,0.15648256],"genre_scores_gemma":[0.9505918,0.000010855105,0.042670004,0.00004622227,0.00006056442,0.000023385146,0.00001567483,0.0001160332,0.0064654816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998899,0.000022330101,0.00025584924,0.00017027797,0.0003666115,0.00028595427],"domain_scores_gemma":[0.99914175,0.000066773835,0.00010946713,0.0005333537,0.000048498045,0.00010017518],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00015181705,0.00016259801,0.0002098941,0.000057294656,0.00013604907,0.000018738254,0.00024364905,0.000049949453,0.00037838367],"category_scores_gemma":[0.00015692852,0.00013436108,0.000086039,0.0002161185,0.00013250926,0.0001276064,0.00007579268,0.000103739505,0.0139601445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113649854,0.0025517838,0.017975295,0.0015529061,0.00071315287,0.0007503094,0.11001958,0.00082709384,0.09169384,0.41326222,0.35962442,0.0009157618],"study_design_scores_gemma":[0.011331313,0.001034898,0.03192982,0.001397117,0.00094611157,0.006552169,0.020893237,0.17250687,0.20760426,0.2713698,0.26473168,0.009702742],"about_ca_topic_score_codex":0.000005349943,"about_ca_topic_score_gemma":0.0000023440095,"teacher_disagreement_score":0.17167976,"about_ca_system_score_codex":0.000038904243,"about_ca_system_score_gemma":0.000028838882,"threshold_uncertainty_score":0.9868076},"labels":[],"label_agreement":null},{"id":"W4211207573","doi":"10.1016/s0012-365x(00)00143-6","title":"Preface","year":2000,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"","field":"","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.017098102670636037,"score_gpt":0.26946097604951497,"score_spread":0.2523628733788789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211207573","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56830937,0.00005686646,0.0005974026,0.00009532467,0.000028010316,0.0002599235,0.00005740646,0.00043647215,0.4301592],"genre_scores_gemma":[0.91539204,0.000015926043,0.040368482,0.00011061613,0.00009743349,0.00004050395,0.00003219038,0.00019487082,0.043747947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989396,0.00002454213,0.00025308557,0.00017599328,0.00031088266,0.00029593534],"domain_scores_gemma":[0.99922204,0.00005163923,0.000059462585,0.00054656423,0.00002433099,0.00009593983],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001917728,0.000162516,0.00019070818,0.00003746698,0.00007185114,0.00005778281,0.00025333327,0.00005007845,0.009459303],"category_scores_gemma":[0.000049761293,0.00013422816,0.00008004686,0.00020411653,0.00006835426,0.00013059237,0.000028038978,0.00009665559,0.051261317],"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.00032608933,0.0038256105,0.0030440628,0.0024792773,0.0010692553,0.0002453661,0.08209207,0.0041254335,0.053251352,0.45849228,0.30564204,0.08540716],"study_design_scores_gemma":[0.004333666,0.0003969736,0.0032224634,0.000849141,0.0005855649,0.00036393525,0.0058235084,0.1287066,0.03293879,0.26365793,0.5552329,0.0038885344],"about_ca_topic_score_codex":0.0000060788357,"about_ca_topic_score_gemma":0.000003560089,"teacher_disagreement_score":0.38641125,"about_ca_system_score_codex":0.000032936216,"about_ca_system_score_gemma":0.000014516341,"threshold_uncertainty_score":0.9914462},"labels":[],"label_agreement":null},{"id":"W4213027512","doi":"10.1016/j.disc.2008.11.029","title":"Preface","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.020263602764142997,"score_gpt":0.28783691030822023,"score_spread":0.2675733075440772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213027512","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5030467,0.00016578048,0.015286015,0.00087507843,0.00010369304,0.0006794306,0.0000706842,0.0012113565,0.47856128],"genre_scores_gemma":[0.95494324,0.000002813093,0.042062115,0.00015996612,0.000058053225,0.000006479685,0.000013897022,0.000054681284,0.002698729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989638,0.000019038574,0.00024752755,0.00016573018,0.00031474017,0.00028919557],"domain_scores_gemma":[0.99920034,0.000041070725,0.00010615958,0.00051778916,0.000039521972,0.00009509596],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021201397,0.00016160098,0.00019774823,0.00005632199,0.00006253052,0.000059762762,0.00024951834,0.00004976282,0.00023926736],"category_scores_gemma":[0.00013580371,0.00013221451,0.00007951735,0.00021133563,0.00003739621,0.00013119755,0.000028652104,0.00009943965,0.0073492774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000467135,0.0011209171,0.00039843336,0.00026881587,0.00012533081,0.00005869172,0.01487797,0.00028930634,0.08731169,0.8198274,0.069242954,0.006431822],"study_design_scores_gemma":[0.0025362212,0.00067308574,0.0072996784,0.00054062734,0.00033572735,0.00018329018,0.00469667,0.05321773,0.05412672,0.8334188,0.04059175,0.0023797203],"about_ca_topic_score_codex":0.0000012613701,"about_ca_topic_score_gemma":0.0000011598352,"teacher_disagreement_score":0.47586253,"about_ca_system_score_codex":0.00003782064,"about_ca_system_score_gemma":0.000014813876,"threshold_uncertainty_score":0.99342364},"labels":[],"label_agreement":null},{"id":"W4213143469","doi":"10.1016/j.disc.2011.03.022","title":"Preface","year":2011,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.06796630154342118,"score_gpt":0.2720509617976455,"score_spread":0.2040846602542243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213143469","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32602915,0.00005139621,0.009351336,0.000019261503,0.000098483375,0.00036718205,0.00005121652,0.00058898266,0.66344297],"genre_scores_gemma":[0.8916647,0.0000021869264,0.10520065,0.000032396754,0.000032826047,0.000027348202,0.000008054966,0.00011929814,0.0029125372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904495,0.000022143036,0.0002463053,0.00016393185,0.00024641055,0.00027622722],"domain_scores_gemma":[0.99914163,0.000032489857,0.00011950475,0.00056568015,0.000043532862,0.00009714035],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002292005,0.00015673605,0.00018069101,0.00005542366,0.00005322869,0.000023011478,0.00028973114,0.000050325445,0.0014000857],"category_scores_gemma":[0.00010931718,0.00012638846,0.00007592619,0.00016692291,0.000079599835,0.00013402816,0.00008877052,0.00009029952,0.01580441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000658488,0.0011991642,0.00432939,0.00069829635,0.0003179982,0.00007044102,0.09868882,0.000009474418,0.018292768,0.8509429,0.024367673,0.0010171857],"study_design_scores_gemma":[0.002872205,0.0005165974,0.011355523,0.0006425825,0.000676874,0.00023871218,0.022252977,0.021790586,0.18312472,0.73007405,0.023124883,0.0033303122],"about_ca_topic_score_codex":0.000013275487,"about_ca_topic_score_gemma":0.000005912572,"teacher_disagreement_score":0.66053045,"about_ca_system_score_codex":0.000025990192,"about_ca_system_score_gemma":0.0000149656125,"threshold_uncertainty_score":0.9995128},"labels":[],"label_agreement":null},{"id":"W4213188790","doi":"10.1016/j.disc.2007.07.031","title":"Pancyclic PBD block-intersection graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Mathematics; Intersection (aeronautics); Vertex (graph theory); Graph; Pairwise comparison; Discrete mathematics; Block (permutation group theory); Intersection graph; Line graph","score_opus":0.007455798218356486,"score_gpt":0.2132354064206548,"score_spread":0.20577960820229832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213188790","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8846528,0.0001542806,0.043295685,0.0000072771027,0.00078338344,0.00018244736,0.0000056735244,0.0005640966,0.07035438],"genre_scores_gemma":[0.99870116,0.000009883982,0.00089085527,0.000011649728,0.00007091962,0.00000924382,0.0000044961607,0.000039678278,0.00026214568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917305,0.000011018944,0.0003063822,0.00010424561,0.00013952504,0.00026576934],"domain_scores_gemma":[0.9995434,0.00006051798,0.00004090896,0.0002633384,0.000016857393,0.000074946765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003562246,0.00015425659,0.00017399082,0.000116537965,0.000057561956,0.000028846207,0.0001213614,0.00008009907,0.000037826787],"category_scores_gemma":[0.000015520422,0.00013857956,0.000113601105,0.00021021308,0.000030943585,0.00007343402,0.000013420314,0.00012272375,0.00012477765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046965735,0.0002669347,0.0021363324,0.003155467,0.0007487608,0.00010982801,0.02721123,0.002782628,0.08209663,0.8686764,0.0047330596,0.008035735],"study_design_scores_gemma":[0.0027060062,0.00040254628,0.0055972524,0.0017593777,0.00047500263,0.00081710453,0.03319963,0.09043534,0.17806648,0.6525104,0.03014311,0.0038877535],"about_ca_topic_score_codex":0.0000024853416,"about_ca_topic_score_gemma":0.0000152243165,"teacher_disagreement_score":0.21616603,"about_ca_system_score_codex":0.000025080146,"about_ca_system_score_gemma":0.0000019056644,"threshold_uncertainty_score":0.5651111},"labels":[],"label_agreement":null},{"id":"W4213257702","doi":"10.1016/j.disc.2006.05.004","title":"Classification of extremal double circulant self-dual codes of lengths 74–88","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Circulant matrix; Mathematics; Dual (grammatical number); Combinatorics; Discrete mathematics","score_opus":0.022833401465611032,"score_gpt":0.250057329470382,"score_spread":0.22722392800477098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213257702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55052406,0.00008764342,0.4338619,0.000110585504,0.00009696858,0.00020500834,0.000013811791,0.00016490628,0.014935125],"genre_scores_gemma":[0.9408713,0.0000070697506,0.059024304,0.000006152381,0.000026989539,0.000008020988,0.000006633576,0.0000087907465,0.000040762097],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998852,0.000040558345,0.00044414162,0.00019279475,0.0003024456,0.00016803606],"domain_scores_gemma":[0.9988302,0.0001404448,0.00031365274,0.000596131,0.00008700174,0.00003259448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004209611,0.00012552975,0.00024998322,0.00011578759,0.00005572469,0.00003874812,0.00046447245,0.00005683483,0.00001248833],"category_scores_gemma":[0.000012375717,0.00010802969,0.00013348872,0.00031848182,0.00009002016,0.00016670657,0.00010031836,0.00006540244,0.0000069540324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068133218,0.00022042784,0.00053432764,0.00019962336,0.000025896983,0.0000014584439,0.0012341046,0.000034211214,0.013165625,0.9841105,0.00010266642,0.0003643474],"study_design_scores_gemma":[0.0017733104,0.00030358485,0.011543563,0.00039868834,0.00017617579,0.00005738462,0.0012164565,0.17821565,0.0909585,0.7135836,0.0010094512,0.00076364994],"about_ca_topic_score_codex":0.000014098634,"about_ca_topic_score_gemma":0.000005150775,"teacher_disagreement_score":0.39034724,"about_ca_system_score_codex":0.000011483529,"about_ca_system_score_gemma":0.000030217112,"threshold_uncertainty_score":0.4405323},"labels":[],"label_agreement":null},{"id":"W4236856137","doi":"10.1016/j.disc.2006.03.022","title":"Limit distribution for the existence of Hamiltonian cycles in a random graph","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Random graph; Hamiltonian (control theory); Graph; Discrete mathematics; Quartic graph; Random regular graph; Hamiltonian path; Graph power; Line graph; 1-planar graph","score_opus":0.027158081144164525,"score_gpt":0.29091735446524475,"score_spread":0.26375927332108023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236856137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75125206,0.0006324098,0.23987143,0.0003538307,0.00026425484,0.0019238864,0.00041516713,0.00009158226,0.005195406],"genre_scores_gemma":[0.9783974,0.00003231088,0.021161158,0.00001706051,0.00006469247,0.00010782876,0.000028740526,0.000029266575,0.00016152542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985762,0.000052574367,0.0006533648,0.00017906161,0.00025839248,0.00028037335],"domain_scores_gemma":[0.9968808,0.0021746045,0.00031050795,0.0005266872,0.0000803967,0.000026980553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007674184,0.00019879921,0.00040481813,0.000064965934,0.00019254598,0.000030173522,0.00037327746,0.00009710331,0.000012682793],"category_scores_gemma":[0.00056665845,0.00012100896,0.0002569119,0.00023434157,0.000259277,0.0000644134,0.00007898175,0.00012190468,7.5222425e-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.00006360613,0.000095367664,0.00035759778,0.00039359825,0.000034346762,0.0000011950709,0.0012671351,0.000047101228,0.00014378114,0.9968274,0.00045766187,0.00031119125],"study_design_scores_gemma":[0.0011266712,0.000036101792,0.0016505673,0.00015053523,0.000095102834,0.000006527113,0.00077616295,0.0030319605,0.0012676668,0.9913571,0.00033719398,0.00016440936],"about_ca_topic_score_codex":0.000029892157,"about_ca_topic_score_gemma":0.00008759551,"teacher_disagreement_score":0.22714537,"about_ca_system_score_codex":0.000024112847,"about_ca_system_score_gemma":0.000019366638,"threshold_uncertainty_score":0.4934602},"labels":[],"label_agreement":null},{"id":"W4240114191","doi":"10.1016/s0012-365x(04)00144-x","title":"Ramsey numbers in complete balanced multipartite graphs. Part II: Size numbers","year":2004,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Research Foundation","keywords":"Multipartite; Mathematics; Combinatorics; Discrete mathematics; Ramsey's theorem; Diagonal; Monochromatic color; Cardinality (data modeling); Graph; Computer science","score_opus":0.029877456998500543,"score_gpt":0.28952597875345,"score_spread":0.25964852175494946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240114191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97552335,0.00007029701,0.001569906,0.0003491971,0.00056182133,0.0008526512,0.00010176158,0.00029435364,0.020676648],"genre_scores_gemma":[0.929038,0.000046506233,0.06972337,0.0003306905,0.00009281468,0.000077973746,0.000020316858,0.00011096053,0.0005593976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969473,0.00009819676,0.0010466313,0.0005082846,0.0005934784,0.0008060969],"domain_scores_gemma":[0.9974996,0.0007869994,0.00039473968,0.0010232405,0.00007815969,0.00021728706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006789674,0.00052836275,0.0008396849,0.00014225728,0.00042518773,0.00007504256,0.0006131964,0.00023903267,0.00029571788],"category_scores_gemma":[0.0009674204,0.0004429543,0.00034817064,0.00052778656,0.00036185858,0.00021233509,0.00030915037,0.0004716401,0.000044231456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004734461,0.00030720377,0.0011644833,0.00042033673,0.00013144015,0.000046242665,0.015793033,0.00018825862,0.00037368908,0.9803995,0.0010080226,0.00012046974],"study_design_scores_gemma":[0.0022953856,0.00007293507,0.0004806489,0.00042903173,0.00007682206,0.000037339756,0.001597531,0.0003984514,0.0005640105,0.99185586,0.0015590347,0.00063295517],"about_ca_topic_score_codex":0.000056983692,"about_ca_topic_score_gemma":0.00018084048,"teacher_disagreement_score":0.06815346,"about_ca_system_score_codex":0.000120991564,"about_ca_system_score_gemma":0.000046297475,"threshold_uncertainty_score":0.99980223},"labels":[],"label_agreement":null},{"id":"W4248887642","doi":"10.1016/j.disc.2006.03.009","title":"Edmonds polytopes and a hierarchy of combinatorial problems","year":2006,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Polytope; Closure (psychology); Polyhedron; Rank (graph theory); Integer (computer science); Bounded function; Discrete mathematics; Integer programming; Order (exchange); Upper and lower bounds; Set (abstract data type); Linear programming; Linear inequality; Inequality; Mathematical optimization","score_opus":0.012975112282765456,"score_gpt":0.26285539803572117,"score_spread":0.2498802857529557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248887642","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.21323392,0.000530614,0.7662658,0.0004722231,0.00021190285,0.00060136564,0.000014957034,0.00017997842,0.018489199],"genre_scores_gemma":[0.88735986,0.000012341387,0.11220047,0.00001007304,0.00003962872,0.000018280998,0.0000023553991,0.000014644168,0.00034232912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888605,0.00004356834,0.00028602334,0.00020342712,0.00033785726,0.00024310089],"domain_scores_gemma":[0.9991187,0.00018141509,0.00011562108,0.0004573268,0.00007001212,0.000056949724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034340424,0.00011769542,0.00021528892,0.00011809121,0.00007026016,0.00007329674,0.0005247407,0.00004255715,0.000005095854],"category_scores_gemma":[0.000055924018,0.000095678435,0.00004756541,0.00033494612,0.00019130821,0.00024854744,0.00031275846,0.00010275434,0.000004977357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029363732,0.00006911435,0.00025296188,0.00012617324,0.000007848135,0.0000026589535,0.00059781317,0.000020613548,0.002410903,0.9957133,0.00005923757,0.00073647406],"study_design_scores_gemma":[0.000361598,0.00009447758,0.0002215597,0.000049495105,0.0000042925694,0.000010193287,0.00004549105,0.010841477,0.0053841444,0.9825357,0.00032779918,0.00012375481],"about_ca_topic_score_codex":0.000012977987,"about_ca_topic_score_gemma":0.0000021627395,"teacher_disagreement_score":0.67412597,"about_ca_system_score_codex":0.000010760928,"about_ca_system_score_gemma":0.000024234696,"threshold_uncertainty_score":0.39016533},"labels":[],"label_agreement":null},{"id":"W4286684878","doi":"10.1016/j.disc.2022.113084","title":"The invertible elements of the monoid of dead-ending misère games","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Invertible matrix; Modulo; Mathematics; Combinatorics; Combinatorial game theory; Discrete mathematics; Pure mathematics; Sequential game; Game theory; Mathematical economics","score_opus":0.030726916667810515,"score_gpt":0.28141928171152436,"score_spread":0.25069236504371384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286684878","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71707517,0.0008187104,0.2608537,0.0032912325,0.001438722,0.0012459765,0.000045795587,0.00013333913,0.015097336],"genre_scores_gemma":[0.98604846,0.000013980264,0.013269172,0.000056714925,0.000011899938,0.000031732983,4.954099e-7,0.000010501421,0.0005570525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984686,0.00009780644,0.00052027544,0.00014565855,0.0005598485,0.00020781627],"domain_scores_gemma":[0.9983298,0.000320534,0.00041448607,0.0008506194,0.000058470265,0.000026067475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006500356,0.00009915353,0.00015774093,0.00003919353,0.00036715087,0.000047436486,0.0020341135,0.000016923059,0.000034707282],"category_scores_gemma":[0.00019714508,0.000058796337,0.000118246615,0.00041469213,0.0001498798,0.0001068094,0.0011635922,0.0001338983,0.000004713352],"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.000007878904,0.00017505256,0.0042875945,0.000158945,0.000095901385,0.0000019248196,0.025104018,0.0026831196,0.008402122,0.94039875,0.0021460848,0.016538618],"study_design_scores_gemma":[0.00009805912,0.00013130516,0.00024568988,0.00009588101,0.000032858065,0.000009510065,0.011404056,0.5112083,0.21054178,0.2603307,0.00566054,0.00024130632],"about_ca_topic_score_codex":0.000020437928,"about_ca_topic_score_gemma":0.000009236842,"teacher_disagreement_score":0.680068,"about_ca_system_score_codex":0.000036044927,"about_ca_system_score_gemma":0.000053558193,"threshold_uncertainty_score":0.3779923},"labels":[],"label_agreement":null},{"id":"W4307725203","doi":"10.1016/j.disc.2022.113220","title":"Obstructions for acyclic local tournament orientation completions","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tournament; Directed acyclic graph; Mathematics; Combinatorics; Orientation (vector space); Interval graph; Directed graph; Discrete mathematics; Graph; Class (philosophy); Pathwidth; Computer science; Line graph; Geometry; Artificial intelligence","score_opus":0.035658052615687615,"score_gpt":0.3263953272624663,"score_spread":0.2907372746467787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307725203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005803502,0.000021349915,0.9916803,0.0008789132,0.00024918915,0.00047792282,0.000053204585,0.00010767266,0.00072789955],"genre_scores_gemma":[0.5302042,0.0000035633327,0.4680994,0.00012199088,0.000039584997,0.0007736996,0.000048722217,0.000022787694,0.00068609713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987793,0.00006313537,0.00025552942,0.00023301512,0.00040542582,0.00026357427],"domain_scores_gemma":[0.998991,0.00025466323,0.00010839058,0.0004973908,0.00007156186,0.00007695682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033335647,0.0000972147,0.00013139601,0.00012668724,0.00081353413,0.00008512697,0.0006692502,0.000014259777,0.00008769098],"category_scores_gemma":[0.00006130781,0.000095618576,0.000096299525,0.00045043931,0.00007971962,0.0002131092,0.00039530118,0.00014888066,0.00001531501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042479705,0.000080500206,0.000012735328,0.000024811154,0.000016029773,0.0000016509971,0.0017530945,0.0044221124,0.00031263864,0.9887116,0.00045451472,0.004206053],"study_design_scores_gemma":[0.00038652454,0.0001435655,0.000054980872,0.000006858636,0.000010701913,0.00004493605,0.0034792114,0.2558118,0.0003790051,0.7297983,0.00972242,0.00016167942],"about_ca_topic_score_codex":0.0000019145232,"about_ca_topic_score_gemma":0.0000021288056,"teacher_disagreement_score":0.52440065,"about_ca_system_score_codex":0.00014614256,"about_ca_system_score_gemma":0.00003809678,"threshold_uncertainty_score":0.6257129},"labels":[],"label_agreement":null},{"id":"W4313325064","doi":"10.1016/j.disc.2022.113289","title":"Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Induced subgraph; Mathematics; Distance-hereditary graph; Hamiltonian path; Pancyclic graph; Discrete mathematics; Factor-critical graph; Induced path; Cograph; Graph; Line graph; Vertex (graph theory); Pathwidth; Graph power","score_opus":0.019883120479224105,"score_gpt":0.2683981368726628,"score_spread":0.24851501639343868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313325064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9748816,0.000050878043,0.019860825,0.00046916518,0.00022710729,0.0006319651,0.000084049476,0.00006766708,0.0037267767],"genre_scores_gemma":[0.9777929,0.000003827725,0.02191858,0.000049690458,0.0000071292466,0.00006635422,0.0000027806157,0.000027038755,0.00013170758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972453,0.00026378472,0.0006313368,0.00035219255,0.0010918047,0.0004155621],"domain_scores_gemma":[0.9963505,0.00045117637,0.00049935764,0.0024396435,0.00017254527,0.00008673655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009069954,0.00021346445,0.00041328152,0.00031002867,0.0002763549,0.000032886008,0.00431674,0.0000556162,0.000048173188],"category_scores_gemma":[0.00034046936,0.00016121828,0.00030883844,0.0021997627,0.0002974692,0.00019285253,0.002552855,0.00041757326,0.0000024820254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035656365,0.00031331065,0.0011818013,0.00026029756,0.00009537172,0.000008227411,0.008080939,0.0001650316,0.07590864,0.9130488,0.00031114795,0.00059079804],"study_design_scores_gemma":[0.0013727882,0.0005825055,0.005011547,0.000110254776,0.000041511248,0.00003814468,0.0029353872,0.033527825,0.07983966,0.87589437,0.00018052557,0.00046546015],"about_ca_topic_score_codex":0.000015033356,"about_ca_topic_score_gemma":0.000014393533,"teacher_disagreement_score":0.037154395,"about_ca_system_score_codex":0.00003664647,"about_ca_system_score_gemma":0.0001271754,"threshold_uncertainty_score":0.8021649},"labels":[],"label_agreement":null},{"id":"W4318953856","doi":"10.1016/j.disc.2023.113342","title":"The r-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Hypergraph; Bounded function; Matching (statistics); Vertex (graph theory); Time complexity; Discrete mathematics; Graph","score_opus":0.01991825721515068,"score_gpt":0.2848979128020826,"score_spread":0.26497965558693193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318953856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96552366,0.00010429139,0.028176457,0.0008097119,0.000043557302,0.00062322104,0.0000058615847,0.00021744859,0.00449582],"genre_scores_gemma":[0.8334348,0.00024216775,0.16464487,0.000045406665,0.000017244482,0.00016461955,0.0000022108745,0.00005109196,0.0013975941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986157,0.00006826155,0.00022086113,0.00030495954,0.0003101389,0.0004801023],"domain_scores_gemma":[0.9984001,0.0009681928,0.000071296614,0.00043866292,0.000035817146,0.000085957756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010030989,0.00015742025,0.00019005706,0.00007200415,0.00035538856,0.00045446458,0.00043682556,0.000036825328,0.0000030839535],"category_scores_gemma":[0.00008308776,0.00010019466,0.000020883215,0.0007462862,0.0001925837,0.0003413139,0.00051088026,0.00021096686,0.000014676586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003350975,0.00003310211,0.0051830155,0.00043109414,0.00004938322,0.00007246144,0.015132871,0.00014585131,0.0006133898,0.97458225,0.00010359672,0.0036194941],"study_design_scores_gemma":[0.00037876752,0.000040493418,0.001228878,0.00012757634,0.0000044137437,0.000047200945,0.0021819505,0.013207121,0.00015458427,0.98207915,0.00036431712,0.0001855602],"about_ca_topic_score_codex":0.000014614875,"about_ca_topic_score_gemma":0.00006438113,"teacher_disagreement_score":0.13646841,"about_ca_system_score_codex":0.00002102251,"about_ca_system_score_gemma":0.000030257614,"threshold_uncertainty_score":0.43824124},"labels":[],"label_agreement":null},{"id":"W4320890236","doi":"10.1016/j.disc.2023.113369","title":"One-generator quasi-cyclic codes and their dual codes","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; United Arab Emirates University","keywords":"Linear code; Block code; Expander code; Luby transform code; Mathematics; Concatenated error correction code; Reed–Muller code; Discrete mathematics; Hamming code; Group code; Generator (circuit theory); Generator matrix; Algorithm; Quantum mechanics; Decoding methods; Physics","score_opus":0.022398441982459622,"score_gpt":0.2531003522162354,"score_spread":0.23070191023377576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320890236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6110722,0.00017212931,0.38578773,0.0013999096,0.00021031556,0.00017671511,0.000038027436,0.0007222444,0.00042071863],"genre_scores_gemma":[0.8715148,0.00005819193,0.12771931,0.00020749704,0.00020099031,0.00001645692,0.000017101685,0.000034469715,0.00023116081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873203,0.000057860103,0.00026608762,0.00034992173,0.00023005219,0.0003640317],"domain_scores_gemma":[0.9988938,0.0003284774,0.00009775719,0.00052243366,0.000035494704,0.00012206073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003934316,0.00020825728,0.00030337358,0.0001135971,0.00024496307,0.00029215243,0.00045451312,0.00006217579,0.00000343565],"category_scores_gemma":[0.000072723706,0.00015745153,0.00007292818,0.00044357963,0.00008889964,0.00010542688,0.00047872963,0.00015366406,0.000057875397],"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.000009923764,0.00060265046,0.00040791568,0.0011377708,0.00041662698,0.000124885,0.077573806,0.0032156229,0.029884303,0.71973836,0.0045712963,0.16231686],"study_design_scores_gemma":[0.00018345642,0.00009043359,0.00035575914,0.00009529309,0.0000079235,0.000032779735,0.00037416953,0.9300527,0.0034756602,0.06446871,0.0005764123,0.00028671717],"about_ca_topic_score_codex":0.0000064667443,"about_ca_topic_score_gemma":0.000005552832,"teacher_disagreement_score":0.9268371,"about_ca_system_score_codex":0.000009249759,"about_ca_system_score_gemma":0.000028721812,"threshold_uncertainty_score":0.64206874},"labels":[],"label_agreement":null},{"id":"W4324357480","doi":"10.1016/j.disc.2023.113404","title":"Block colourings of star systems","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bipartite graph; Star (game theory); Vertex (graph theory); Block (permutation group theory); Graph; Discrete mathematics; Stars; Astrophysics; Physics","score_opus":0.011800853276043487,"score_gpt":0.2099673878089681,"score_spread":0.1981665345329246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324357480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9879645,0.00015664908,0.0005205834,0.000007218444,0.00038138666,0.00022384417,0.00003749994,0.0005524044,0.010155875],"genre_scores_gemma":[0.999066,0.00002015276,0.00018948369,0.0000013761039,0.000033668934,0.000026562464,0.0000065043573,0.00003669385,0.00061954954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923366,0.00001622679,0.00031572318,0.000075564465,0.00016694047,0.00019188307],"domain_scores_gemma":[0.9995318,0.000081583996,0.000053054606,0.00026294345,0.00002414951,0.000046452315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027597806,0.000115189796,0.00024655476,0.000097691554,0.000028701072,0.00001957047,0.00015228603,0.00005747144,0.000011748415],"category_scores_gemma":[0.000020709609,0.000101975915,0.000069435504,0.0003019551,0.000029703264,0.00004067321,0.000025123421,0.00006372303,0.00016706972],"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.000019552925,0.00013233314,0.0006625594,0.027189542,0.0009633516,0.00009058697,0.030543057,0.14132088,0.066782,0.70953614,0.022539534,0.00022044772],"study_design_scores_gemma":[0.0008245706,0.00013684487,0.00040186182,0.0015134258,0.00014878306,0.000062057064,0.01744369,0.9173924,0.023234112,0.027324006,0.010546021,0.00097224745],"about_ca_topic_score_codex":0.0000034053944,"about_ca_topic_score_gemma":7.231358e-7,"teacher_disagreement_score":0.7760715,"about_ca_system_score_codex":0.000011369513,"about_ca_system_score_gemma":0.000004081998,"threshold_uncertainty_score":0.41584572},"labels":[],"label_agreement":null},{"id":"W4327630093","doi":"10.1016/j.disc.2023.113405","title":"2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Providence Health Care","keywords":"Combinatorics; Mathematics; Complete coloring; Edge coloring; Injective function; List coloring; Square (algebra); Fractional coloring; Planar graph; Discrete mathematics; Degree (music); Greedy coloring; Graph; Graph power; Geometry; Physics; Line graph","score_opus":0.036004568719994384,"score_gpt":0.2867906976001002,"score_spread":0.25078612888010576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327630093","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.35457557,0.00011989767,0.6375293,0.00012971628,0.000058793015,0.00050027657,0.000031000483,0.0003215365,0.0067338794],"genre_scores_gemma":[0.89898735,0.000055432633,0.10056668,0.0000143043735,0.000010972541,0.00005093081,0.0000063553525,0.00003508654,0.0002729015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985189,0.000049186794,0.0002586484,0.00033802094,0.00046003415,0.00037525233],"domain_scores_gemma":[0.9986286,0.00036783368,0.00014548269,0.0006514956,0.000100452664,0.00010609144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000411888,0.00018258434,0.0002903506,0.0003067983,0.00013039948,0.00007753142,0.0006204543,0.00004738318,0.000005137578],"category_scores_gemma":[0.00009553034,0.00013984993,0.00005277376,0.0013645851,0.00022498891,0.00035073122,0.00023397032,0.00016218613,0.0000106457555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004865611,0.000055388322,0.0049011977,0.0006253385,0.00007184738,0.0000768419,0.0047307755,0.000094040886,0.0006534319,0.9848352,0.00010697132,0.0038003116],"study_design_scores_gemma":[0.0007582423,0.00048564133,0.005707171,0.00042468624,0.000020402165,0.000047379872,0.0026150446,0.022656823,0.0025090107,0.96406704,0.00025516172,0.00045339574],"about_ca_topic_score_codex":0.0000067504498,"about_ca_topic_score_gemma":0.00002485527,"teacher_disagreement_score":0.5444117,"about_ca_system_score_codex":0.00002038096,"about_ca_system_score_gemma":0.00003313942,"threshold_uncertainty_score":0.57029146},"labels":[],"label_agreement":null},{"id":"W4360602557","doi":"10.1016/j.disc.2023.113422","title":"Inverse problems associated with subsequence sums in C ⊕ C II","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Tianjin Municipal Education Commission; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Subsequence; Mathematics; Combinatorics; Sequence (biology); Prime (order theory); Inverse; Abelian group; Longest increasing subsequence; Group (periodic table); Finite group; Discrete mathematics; Bounded function","score_opus":0.047809160837042064,"score_gpt":0.2866357103713065,"score_spread":0.2388265495342644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360602557","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98946965,0.000015005647,0.0003691049,0.00013620188,0.00010110751,0.00052910077,0.000030238394,0.0003905641,0.008959033],"genre_scores_gemma":[0.9915932,0.000024311179,0.0058142794,0.00006304045,0.000028691513,0.00007668336,0.00003335239,0.00008198091,0.00228449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981516,0.000080144644,0.00048915786,0.00029503513,0.00046123966,0.0005228124],"domain_scores_gemma":[0.9984749,0.00057021534,0.0002383999,0.00055397645,0.00007119107,0.00009130135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092424836,0.0002811528,0.00043956834,0.00023744274,0.00026692293,0.0000404691,0.00038273341,0.00014964797,0.000070832226],"category_scores_gemma":[0.0009210739,0.00019871604,0.00009202531,0.0010536616,0.00020436174,0.00014660519,0.00024209588,0.0002843389,0.000025322488],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021182352,0.00021775109,0.0044301455,0.00059492106,0.00017019306,0.0001317437,0.03278121,0.00027499086,0.00042109747,0.95839304,0.0024182054,0.00014554354],"study_design_scores_gemma":[0.0007041829,0.00011108704,0.0011114603,0.00056111737,0.00005121025,0.0000124144835,0.0016141086,0.006839774,0.0002675352,0.98821163,0.00012876478,0.00038672306],"about_ca_topic_score_codex":0.0000105960125,"about_ca_topic_score_gemma":0.0002340939,"teacher_disagreement_score":0.031167101,"about_ca_system_score_codex":0.0000712766,"about_ca_system_score_gemma":0.000038635615,"threshold_uncertainty_score":0.8103405},"labels":[],"label_agreement":null},{"id":"W4366403216","doi":"10.1016/j.disc.2023.113444","title":"An extension of the Erdős-Ko-Rado theorem to set-wise 2-intersecting families of perfect matchings","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Extension (predicate logic); Matching (statistics); Discrete mathematics; Set (abstract data type); Graph","score_opus":0.032072646748614375,"score_gpt":0.3197794347018787,"score_spread":0.2877067879532643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366403216","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99395466,0.00001625718,0.0023757652,0.0001087307,0.0003232623,0.0005217424,0.000060483886,0.00014795542,0.0024911512],"genre_scores_gemma":[0.9884459,0.000011533589,0.011115988,0.00006568478,0.00005524047,0.000013616659,0.00000493352,0.0000769228,0.00021018944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99787086,0.00018115084,0.00074223254,0.00030150948,0.0005530981,0.00035115302],"domain_scores_gemma":[0.9970634,0.00094883825,0.00044604653,0.0013061264,0.0001442499,0.000091321184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013300797,0.00029477448,0.00058566156,0.00020819162,0.00025983632,0.000030198127,0.00077334064,0.00011624718,0.00005101389],"category_scores_gemma":[0.0011683932,0.00017857327,0.00032352918,0.0006179263,0.00023006929,0.000107032436,0.0004913432,0.00022554492,0.000008783858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006752349,0.00011783529,0.000867734,0.0018180652,0.00014439656,0.000005737789,0.1377831,0.00021404143,0.03826491,0.8185295,0.00085020915,0.0013369932],"study_design_scores_gemma":[0.00028441814,0.00016821559,0.0011149937,0.0007875837,0.0001384553,0.000020404545,0.0341763,0.005532309,0.030789174,0.92663217,0.00004305587,0.00031293507],"about_ca_topic_score_codex":0.000017691253,"about_ca_topic_score_gemma":0.000011404489,"teacher_disagreement_score":0.108102694,"about_ca_system_score_codex":0.000023404657,"about_ca_system_score_gemma":0.00002349365,"threshold_uncertainty_score":0.7282007},"labels":[],"label_agreement":null},{"id":"W4366818668","doi":"10.1016/j.disc.2023.113476","title":"Some new results on skew frame starters in cyclic groups","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Skew; Frame (networking); Mathematics; Property (philosophy); Construct (python library); Combinatorics; Discrete mathematics; Computer science; Telecommunications","score_opus":0.01660319553253778,"score_gpt":0.23144399839805008,"score_spread":0.2148408028655123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366818668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9888173,0.00008987626,0.0007981758,0.00020277183,0.0005515241,0.00029737657,0.00004759797,0.0007953635,0.008400015],"genre_scores_gemma":[0.9985474,0.0000468742,0.0003680738,0.00004011113,0.00014715629,0.000020835627,0.000034303794,0.0000574745,0.00073781935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998897,0.000026769787,0.0003895811,0.0001620629,0.00019740032,0.00032717982],"domain_scores_gemma":[0.999293,0.00016328492,0.000041022075,0.00040134517,0.0000050819112,0.00009623824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030740164,0.00018321512,0.00024940196,0.00020190408,0.00003171242,0.00004255041,0.00019344277,0.00009431704,0.00001245427],"category_scores_gemma":[0.000061393504,0.00016524916,0.00007984561,0.00041004684,0.000020506439,0.00010275518,0.00002393076,0.0001874342,0.00077677204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010292197,0.00014457414,0.00021499745,0.0020315181,0.00023051698,0.00021471342,0.051558875,0.03683617,0.0062067118,0.87028176,0.029209638,0.0029676012],"study_design_scores_gemma":[0.0025197975,0.00020292342,0.0024598327,0.0016083696,0.00003898834,0.00001226354,0.0049899826,0.1128998,0.0023192153,0.8657366,0.0060977507,0.0011144798],"about_ca_topic_score_codex":0.000009029632,"about_ca_topic_score_gemma":0.000015496707,"teacher_disagreement_score":0.07606363,"about_ca_system_score_codex":0.00003333091,"about_ca_system_score_gemma":0.000006623424,"threshold_uncertainty_score":0.9984092},"labels":[],"label_agreement":null},{"id":"W4367046853","doi":"10.1016/j.disc.2023.113419","title":"A cop-winning strategy on strongly cop-win graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Monotonic function; Graph; Generalization; Discrete mathematics","score_opus":0.04702494367628042,"score_gpt":0.3317302440295708,"score_spread":0.2847053003532904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367046853","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.3172061,0.000119826036,0.6292714,0.0011085774,0.00047592213,0.0012148474,0.000061368664,0.0024631855,0.048078783],"genre_scores_gemma":[0.9592884,0.000029798237,0.03814697,0.000104547384,0.000054832366,0.00008866994,0.000022402697,0.00006877404,0.002195583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974679,0.00010818646,0.00039085315,0.0005001527,0.0007907484,0.00074219325],"domain_scores_gemma":[0.9978641,0.00055649865,0.00013765368,0.0011599907,0.00008981848,0.00019191914],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008077209,0.00027109866,0.00031491945,0.0004050099,0.0002512976,0.00028350356,0.0014005138,0.0000818206,0.00004535909],"category_scores_gemma":[0.00019719586,0.00023144213,0.00014655672,0.0017055135,0.00014688775,0.00038843314,0.00043576493,0.0003496889,0.00092264946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000874166,0.00005662756,0.000071699826,0.000089886234,0.00003450638,0.000077927485,0.0014168646,0.0023211115,0.0006842342,0.99055743,0.0011862366,0.0034947605],"study_design_scores_gemma":[0.0006073075,0.00039465877,0.00045775445,0.00019611136,0.000010530475,0.000018161549,0.0013972159,0.21456794,0.0022204989,0.7789626,0.0006580053,0.0005091897],"about_ca_topic_score_codex":0.0000027560654,"about_ca_topic_score_gemma":0.0000023616576,"teacher_disagreement_score":0.64208233,"about_ca_system_score_codex":0.000043120093,"about_ca_system_score_gemma":0.0000647233,"threshold_uncertainty_score":0.9998552},"labels":[],"label_agreement":null},{"id":"W4367048681","doi":"10.1016/j.disc.2023.113471","title":"The optimal bound on the 3-independence number obtainable from a polynomial-type method","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics; Independent set; Distance-regular graph; Independence number; Graph; Wheel graph; Upper and lower bounds; Hamming graph; Cubic graph; Graph power; Line graph; Voltage graph; Hamming code; Algorithm","score_opus":0.05090655308444312,"score_gpt":0.35669398881691744,"score_spread":0.3057874357324743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367048681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91047734,0.00005707211,0.02380813,0.008367864,0.0004499164,0.0018312389,0.00014468771,0.00077654753,0.054087203],"genre_scores_gemma":[0.88742375,0.00010531551,0.08032553,0.0005681434,0.0004173589,0.00071059616,0.000052072664,0.00021887457,0.030178335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980724,0.0002223801,0.0004298185,0.0003050663,0.000493777,0.00047657258],"domain_scores_gemma":[0.9909394,0.0073702,0.00022886082,0.0012784192,0.00010014401,0.000082989216],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020579263,0.00026075504,0.00027268825,0.00003748689,0.0011389657,0.00027727822,0.00086109637,0.00012225994,0.0003169918],"category_scores_gemma":[0.0012678396,0.00014168161,0.00017275976,0.0006613013,0.00019355303,0.00007915023,0.00020744816,0.00038655451,0.0015805237],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020310605,0.000057260815,0.000013698953,0.000026829826,0.00009051792,0.0000045662277,0.0023102632,0.000034651082,0.0004402135,0.97125137,0.025530547,0.00021975243],"study_design_scores_gemma":[0.00014612381,0.000022262138,0.00003427646,0.00005565596,0.00008504957,0.000007655302,0.005698612,0.0066805356,0.002327419,0.9735152,0.011215839,0.00021133247],"about_ca_topic_score_codex":0.000024969466,"about_ca_topic_score_gemma":0.000012876549,"teacher_disagreement_score":0.0565174,"about_ca_system_score_codex":0.000034550645,"about_ca_system_score_gemma":0.000059384114,"threshold_uncertainty_score":0.9991969},"labels":[],"label_agreement":null},{"id":"W4368372142","doi":"10.1016/j.disc.2023.113473","title":"Metric hypergraphs and metric-line equivalences","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; HORIZON EUROPE Framework Programme; Grantová Agentura České Republiky; Univerzita Karlova v Praze","keywords":"Mathematics; Metric space; Combinatorics; Real line; Metric (unit); Equivalence (formal languages); Equivalence relation; Line (geometry); Intrinsic metric; Injective metric space; Discrete mathematics; Geometry","score_opus":0.04917666888456311,"score_gpt":0.3371808582659878,"score_spread":0.2880041893814247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4368372142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1037268,0.0013866418,0.8848723,0.0010643117,0.0002492062,0.00048066158,0.000017789223,0.0009499878,0.0072523043],"genre_scores_gemma":[0.848264,0.0006983027,0.14922342,0.00006710361,0.000043337415,0.00004521039,0.0000053738086,0.00003205982,0.0016212421],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981793,0.00006840894,0.00029290063,0.0003808574,0.0006130906,0.00046540998],"domain_scores_gemma":[0.99806875,0.00091590645,0.00009653848,0.00067905086,0.000082923085,0.00015686057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010321643,0.00017350791,0.00026072454,0.0010821134,0.00017526945,0.00019112042,0.0009971911,0.000052732667,0.000015480218],"category_scores_gemma":[0.0007284568,0.00013473126,0.000081670005,0.0061498624,0.00014678141,0.00041050444,0.00072191434,0.00015453105,0.0001710238],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034937975,0.000052126394,0.0004516225,0.0002349043,0.000054786186,0.000047547044,0.0013113165,0.00015008458,0.00070246705,0.972239,0.00036444992,0.02438819],"study_design_scores_gemma":[0.00030271415,0.00015772667,0.0005753396,0.000054648746,0.000016427804,0.00002835546,0.0005743937,0.16296402,0.0021710598,0.8321749,0.00064688793,0.0003335346],"about_ca_topic_score_codex":0.0000026013333,"about_ca_topic_score_gemma":0.00000109849,"teacher_disagreement_score":0.7445372,"about_ca_system_score_codex":0.000014208253,"about_ca_system_score_gemma":0.000022406124,"threshold_uncertainty_score":0.54941815},"labels":[],"label_agreement":null},{"id":"W4376111567","doi":"10.1016/j.disc.2023.113489","title":"On the equivalence of linear cyclic and constacyclic codes","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monomial; Discrete mathematics; Equivalence (formal languages); Finite field; Combinatorics; Equivalence relation; Equivalence class (music); Permutation (music); Linear code; Block code; Algorithm","score_opus":0.03003914856210125,"score_gpt":0.2742312853251732,"score_spread":0.24419213676307197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376111567","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8546418,0.000043370077,0.13760218,0.0013878491,0.00008402516,0.00018025567,0.000011002211,0.00021012222,0.005839405],"genre_scores_gemma":[0.99338585,0.000060564635,0.0063221785,0.00013912635,0.000010522236,0.000009436507,8.381689e-7,0.0000067480514,0.000064754444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927926,0.00005144097,0.00017513215,0.00014945661,0.00018954235,0.00015513964],"domain_scores_gemma":[0.9981968,0.0011528857,0.00008789706,0.00050459756,0.000021674094,0.000036159152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005283081,0.000093033996,0.0001377141,0.00007903053,0.0001268972,0.00004647088,0.0005216246,0.000025814723,0.000011174109],"category_scores_gemma":[0.00018428868,0.00005821832,0.000059479047,0.0004774408,0.00019387073,0.000070829825,0.00022973874,0.00007807085,0.000040217557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017503521,0.000015688129,0.000057208777,0.0000513171,0.000012183656,0.000001973702,0.0017940211,0.000008839636,0.0008742394,0.9961124,0.00021738074,0.00085297093],"study_design_scores_gemma":[0.00011584357,0.000093850984,0.00024567998,0.00016125492,0.000011367074,0.0000062231047,0.00051911926,0.04358035,0.0051521957,0.949791,0.00019311052,0.00013001334],"about_ca_topic_score_codex":0.0000011565431,"about_ca_topic_score_gemma":5.373015e-7,"teacher_disagreement_score":0.13874404,"about_ca_system_score_codex":0.0000024320957,"about_ca_system_score_gemma":0.000008965194,"threshold_uncertainty_score":0.23740742},"labels":[],"label_agreement":null},{"id":"W4379618102","doi":"10.1016/j.disc.2023.113549","title":"On Mneimneh's binomial sum involving harmonic numbers","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Mathematical proof; Harmonic number; Hypergeometric distribution; Binomial (polynomial); Binomial coefficient; Identity (music); Combinatorics; Probabilistic logic; Discrete mathematics; Harmonic; Pure mathematics; Riemann hypothesis; Statistics","score_opus":0.05486940662880617,"score_gpt":0.3320730867935207,"score_spread":0.2772036801647145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379618102","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9244196,0.000072911316,0.021621974,0.0010156865,0.0030512798,0.0022547978,0.000095210075,0.0040514516,0.04341709],"genre_scores_gemma":[0.91275084,0.000094463154,0.078092165,0.00023575535,0.00062210375,0.00031710448,0.00006704131,0.0006075142,0.0072129914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99624145,0.00010013167,0.0010615098,0.0005925273,0.0010172132,0.0009871607],"domain_scores_gemma":[0.9946749,0.0029321993,0.00053079583,0.0014555715,0.00013855645,0.00026798312],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009561175,0.00062475586,0.0008774293,0.00035755016,0.00033296397,0.00016072064,0.00082400546,0.00026056197,0.0002117735],"category_scores_gemma":[0.0036331983,0.0005605073,0.00035141743,0.0010834336,0.000161184,0.00026408123,0.00038053692,0.00052835344,0.0021562015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021633827,0.00022983599,0.000019070385,0.0007430645,0.000101486345,0.000051211406,0.002661526,0.000055469667,0.0007849412,0.97859246,0.016573898,0.00016542203],"study_design_scores_gemma":[0.0009192813,0.00012756627,0.000012792495,0.00044253352,0.00010311423,0.000016275719,0.0014618644,0.0071584256,0.0027261076,0.985731,0.0006485136,0.0006525487],"about_ca_topic_score_codex":0.000004642643,"about_ca_topic_score_gemma":0.0000071847076,"teacher_disagreement_score":0.05647019,"about_ca_system_score_codex":0.00023626903,"about_ca_system_score_gemma":0.00008640546,"threshold_uncertainty_score":0.99968463},"labels":[],"label_agreement":null},{"id":"W4383221941","doi":"10.1016/j.disc.2023.113585","title":"Coarse geometry of the cops and robber game","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Tokyo Metropolitan University","keywords":"Mathematics; Combinatorics; Transitive relation; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.03729046438638072,"score_gpt":0.3007197937221685,"score_spread":0.2634293293357878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383221941","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9920906,0.0000815874,0.0018629046,0.0006774754,0.00018999483,0.00029686082,0.000032100994,0.00011502039,0.004653492],"genre_scores_gemma":[0.98853284,0.000039151113,0.006020158,0.00006493509,0.0000402898,0.000014265019,0.0000037170503,0.000037250455,0.005247412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878794,0.000045127046,0.00041172947,0.00017068774,0.00030048113,0.00028404474],"domain_scores_gemma":[0.99819577,0.0009229244,0.0002362411,0.0005299294,0.000052777774,0.00006233223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046756657,0.00016075856,0.000368106,0.00018765812,0.000072322764,0.00001788242,0.0002883565,0.0001034538,0.00016686904],"category_scores_gemma":[0.0013417328,0.000101292484,0.00011379729,0.0011019384,0.00026597377,0.000042601743,0.00031062993,0.00014918791,0.00006588859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006530478,0.0001485877,0.0029044955,0.00122191,0.00015503868,0.000012680738,0.005230171,0.000012446805,0.00049943454,0.9740575,0.014184502,0.0015667111],"study_design_scores_gemma":[0.0005944467,0.00005942509,0.0031479294,0.00014572767,0.00014602412,0.00006262662,0.004029587,0.0029819338,0.0013744808,0.9855745,0.001610641,0.0002726861],"about_ca_topic_score_codex":0.0000059661324,"about_ca_topic_score_gemma":0.0000035719754,"teacher_disagreement_score":0.0125738615,"about_ca_system_score_codex":0.000011426258,"about_ca_system_score_gemma":0.000023911602,"threshold_uncertainty_score":0.41305876},"labels":[],"label_agreement":null},{"id":"W4386516382","doi":"10.1016/j.disc.2023.113685","title":"New bounds for the average genus and average number of faces of a simple graph","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Conjecture; Simple graph; Graph; Simple (philosophy); Degree (music); Upper and lower bounds; Discrete mathematics","score_opus":0.022763598297855937,"score_gpt":0.2775163825757442,"score_spread":0.2547527842778882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386516382","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.35374373,0.0002581337,0.64421195,0.0004888217,0.00014563843,0.00039594763,0.000035864454,0.0001155496,0.0006043826],"genre_scores_gemma":[0.93319577,0.00007980334,0.066068806,0.000046561952,0.0000058384676,0.0000151280565,0.0000048254037,0.000013775294,0.00056949246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912345,0.000015746913,0.00030213714,0.0001610776,0.00022023331,0.00017737807],"domain_scores_gemma":[0.99883044,0.00043868716,0.00016741604,0.00044680558,0.0000640374,0.0000525992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000395946,0.00010520668,0.00020971755,0.00006239483,0.00010201738,0.00005872954,0.00037715223,0.000038450442,0.00001055292],"category_scores_gemma":[0.000077351906,0.00006832273,0.00009547598,0.00041515386,0.00007181048,0.00008888518,0.00018068879,0.00004736747,0.000007044146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000087852695,0.000056346933,0.00070396,0.000756064,0.00015469735,0.0000031599693,0.015556525,0.0015411888,0.0025754604,0.96382654,0.007412918,0.0074043334],"study_design_scores_gemma":[0.00040162983,0.000053365548,0.00018970748,0.000062413834,0.000027013404,0.00000818758,0.0002473935,0.12766467,0.003081808,0.8674093,0.0007273013,0.00012722742],"about_ca_topic_score_codex":0.00003948966,"about_ca_topic_score_gemma":0.000004326288,"teacher_disagreement_score":0.57945204,"about_ca_system_score_codex":0.0000023233722,"about_ca_system_score_gemma":0.000029104163,"threshold_uncertainty_score":0.27861202},"labels":[],"label_agreement":null},{"id":"W4386532515","doi":"10.1016/j.disc.2023.113691","title":"Improved bounds for the triangle case of Aharoni's rainbow generalization of the Caccetta-Häggkvist conjecture","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Colleges and Universities; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Conjecture; Rainbow; Generalization; Mathematics; Combinatorics; Collatz conjecture; Discrete mathematics; Mathematical analysis; Physics","score_opus":0.06628404101517356,"score_gpt":0.36973093046163885,"score_spread":0.3034468894464653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386532515","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72749346,0.00032618805,0.254077,0.004645677,0.0007231045,0.008182092,0.0012197503,0.0003009232,0.0030318184],"genre_scores_gemma":[0.98666865,0.000017848253,0.005617191,0.00004860383,0.00014263914,0.00018626516,0.000029476467,0.00010598226,0.007183351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981048,0.00015621114,0.0007641142,0.00020857537,0.0004027072,0.00036355754],"domain_scores_gemma":[0.9950989,0.0028969885,0.0005837827,0.0010990815,0.00026642514,0.00005483814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020518266,0.00022097518,0.0005235509,0.00009629005,0.00028956326,0.000053978314,0.0006466009,0.00011881148,0.00010727083],"category_scores_gemma":[0.0027773054,0.00011856365,0.00039700896,0.00075425126,0.0003673722,0.00005984539,0.00023363189,0.00017022381,0.0000051901798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112045855,0.00024119792,0.00009803326,0.0038088744,0.0008386011,0.00002680765,0.014465164,0.0002512434,0.0064589814,0.95096767,0.021753365,0.000978019],"study_design_scores_gemma":[0.0019836903,0.00013269206,0.000021348658,0.0001941256,0.000639815,0.00016710332,0.0076448633,0.23845348,0.017954776,0.73136365,0.0011381985,0.0003062262],"about_ca_topic_score_codex":0.000050692266,"about_ca_topic_score_gemma":0.000098306606,"teacher_disagreement_score":0.25917518,"about_ca_system_score_codex":0.000051101983,"about_ca_system_score_gemma":0.00013154784,"threshold_uncertainty_score":0.48348856},"labels":[],"label_agreement":null},{"id":"W4387135103","doi":"10.1016/j.disc.2023.113708","title":"Binary color-coded magic squares: A study of uniqueness under rotation/reflection, PCA, and LDA analysis","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Sensory Analysis and Statistical Methods","field":"Agricultural and Biological Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"Mount Saint Vincent University; Université Laval","keywords":"Magic square; Uniqueness; Mathematics; Combinatorics; MAGIC (telescope); Binary number; Arithmetic; Mathematical analysis; Physics","score_opus":0.0726810977640017,"score_gpt":0.3436417287089666,"score_spread":0.2709606309449649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387135103","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9965838,0.000018345625,0.0026384403,0.0001699922,0.000020912006,0.00022964981,0.000049229784,0.000056339577,0.00023328626],"genre_scores_gemma":[0.9964663,0.000015115871,0.003076919,0.000027669348,0.00001661722,0.000019419342,0.00006221929,0.0000015155273,0.0003142523],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99870974,0.00025086533,0.00038643257,0.00024341156,0.00024966177,0.00015987207],"domain_scores_gemma":[0.99859476,0.000975999,0.00015456906,0.00009397998,0.000112559486,0.0000681507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049600017,0.00012871649,0.00039652144,0.000075965414,0.00015800315,0.00004995299,0.000118212985,0.000054002383,0.00018655774],"category_scores_gemma":[0.00018165848,0.000051908624,0.000105256,0.002357107,0.000066190805,0.00005266514,0.00005427827,0.00006291787,0.000010034087],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000486529,0.008221062,0.20363735,0.0012040848,0.011963265,0.00020404201,0.04564207,0.045371722,0.47933286,0.15679589,0.001068565,0.04607256],"study_design_scores_gemma":[0.00056365883,0.0015347295,0.5786073,0.000047395275,0.0025420866,0.0000037636619,0.09923428,0.2296569,0.0011958778,0.08593778,0.00008344887,0.00059277605],"about_ca_topic_score_codex":0.00015192713,"about_ca_topic_score_gemma":0.00048613202,"teacher_disagreement_score":0.478137,"about_ca_system_score_codex":0.000011902854,"about_ca_system_score_gemma":0.0000037033194,"threshold_uncertainty_score":0.21167724},"labels":[],"label_agreement":null},{"id":"W4387427243","doi":"10.1016/j.disc.2023.113718","title":"Improved bound for the Gerver-Ramsey collinearity problem","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Collinearity; Combinatorics; Sequence (biology); Upper and lower bounds; Discrete mathematics; Element (criminal law); Statistics; Mathematical analysis","score_opus":0.044815859182103866,"score_gpt":0.29272348703558326,"score_spread":0.2479076278534794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387427243","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.0024211847,0.00006210291,0.9919733,0.0029388568,0.00035927526,0.0009154926,0.000042897835,0.00045149671,0.00083542435],"genre_scores_gemma":[0.05047442,0.0000841317,0.94359493,0.0005114154,0.00039425687,0.0006757507,0.00003981533,0.000060810482,0.0041644853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878776,0.000023945666,0.00029078248,0.0002727156,0.00025362518,0.00037119404],"domain_scores_gemma":[0.9981564,0.0007874988,0.00011675778,0.00078442896,0.00009343033,0.00006143167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008159927,0.00015438157,0.0001898813,0.0000608877,0.0004950778,0.0004334481,0.0012322621,0.00005568839,0.000008711726],"category_scores_gemma":[0.00013271112,0.00010394872,0.00017032752,0.0006873844,0.00010835492,0.00018541134,0.00042891776,0.00013404308,0.000044820597],"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.0000052545956,0.000102956576,0.000019474463,0.00038236327,0.00009959597,0.000004473353,0.0039549363,0.00016805949,0.0003038515,0.97129947,0.010174561,0.013485007],"study_design_scores_gemma":[0.00018938007,0.000044974535,0.000053531046,0.0000209159,0.000012844994,0.000004056766,0.00014895557,0.7082121,0.00025942136,0.2832887,0.0076337005,0.00013145912],"about_ca_topic_score_codex":0.000016540333,"about_ca_topic_score_gemma":0.000020749992,"teacher_disagreement_score":0.70804405,"about_ca_system_score_codex":0.000018388735,"about_ca_system_score_gemma":0.00005133331,"threshold_uncertainty_score":0.42389056},"labels":[],"label_agreement":null},{"id":"W4388473630","doi":"10.1016/j.disc.2023.113777","title":"On an f-coloring generalization of linear arboricity of multigraphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arboricity; Combinatorics; Mathematics; Multigraph; Conjecture; Degree (music); Simple (philosophy); Generalization; Vertex (graph theory); Edge coloring; Function (biology); Discrete mathematics; Graph; Planar graph; Line graph; Graph power; Biology; Physics","score_opus":0.04239752126348623,"score_gpt":0.3394515713267526,"score_spread":0.29705405006326635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388473630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53540075,0.0000057556294,0.46391934,0.000019530695,0.000045716984,0.0001341938,0.000006440033,0.00009206841,0.00037621034],"genre_scores_gemma":[0.8798537,0.000017256847,0.12001076,0.000008978157,0.0000130334965,0.00001184676,0.0000068104737,0.000014154204,0.0000634395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885297,0.000064547894,0.00030540625,0.000189011,0.00039737293,0.00019072222],"domain_scores_gemma":[0.99879646,0.00022886189,0.00016678404,0.00063301343,0.00011811601,0.00005673505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005164017,0.00009610213,0.00019439816,0.0002752365,0.00005499672,0.000013266861,0.00059868576,0.00003942913,0.000004596594],"category_scores_gemma":[0.00022584377,0.00008208509,0.00006515163,0.0011659953,0.000071748036,0.00020689101,0.0001484234,0.000075427306,0.000011086063],"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.000007682157,0.00010314633,0.00022581496,0.00017286894,0.000015345393,0.0000028640466,0.0028304502,0.012292144,0.01556699,0.9678344,0.00001379218,0.00093450886],"study_design_scores_gemma":[0.00017008418,0.0001669807,0.0004742026,0.00005904185,0.0000038795974,6.024516e-7,0.00014492392,0.68653256,0.067811035,0.24452984,0.000008465046,0.00009837098],"about_ca_topic_score_codex":0.000004937266,"about_ca_topic_score_gemma":0.0000019726463,"teacher_disagreement_score":0.72330457,"about_ca_system_score_codex":0.000010050115,"about_ca_system_score_gemma":0.00001754213,"threshold_uncertainty_score":0.33473328},"labels":[],"label_agreement":null},{"id":"W4389678620","doi":"10.1016/j.disc.2023.113829","title":"Comparability digraphs: An analogue of comparability graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Comparability; Digraph; Mathematics; Lemma (botany); Combinatorics; Comparability graph; Discrete mathematics; Cograph; Graph; Chordal graph; 1-planar graph","score_opus":0.06293062498048756,"score_gpt":0.3512163822837604,"score_spread":0.2882857573032728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389678620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7650313,0.000032077125,0.23234537,0.00015395597,0.00009586814,0.00046039082,0.00005126157,0.0005120657,0.001317717],"genre_scores_gemma":[0.9559236,0.000010840315,0.04390719,0.000017596525,0.000009126008,0.00003417884,0.000039894203,0.000017789656,0.00003974381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997205,0.0002921723,0.00069106015,0.0005650988,0.00070774776,0.0005388745],"domain_scores_gemma":[0.9963754,0.000711334,0.0002262116,0.00223913,0.00021901375,0.00022891912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018816823,0.00024147105,0.00055652024,0.00036576213,0.00016061998,0.0000839348,0.0019142978,0.00007413149,0.000017139639],"category_scores_gemma":[0.00026381572,0.0002047958,0.00023191924,0.0025460345,0.00058838434,0.00059111544,0.0004850709,0.0002345229,0.000088794855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014311909,0.00034892696,0.007912397,0.00031538436,0.00004150906,0.0000072992752,0.0034826554,0.00059434323,0.0008970548,0.98518085,0.0001107245,0.0010945604],"study_design_scores_gemma":[0.00023513714,0.00013492974,0.015879914,0.000033222244,0.000008230586,0.0000044545445,0.00058809604,0.12608686,0.001531288,0.85522497,0.000049168284,0.00022372679],"about_ca_topic_score_codex":0.000011847383,"about_ca_topic_score_gemma":0.000021428814,"teacher_disagreement_score":0.19089235,"about_ca_system_score_codex":0.000025879513,"about_ca_system_score_gemma":0.000048181784,"threshold_uncertainty_score":0.835133},"labels":[],"label_agreement":null},{"id":"W4391155232","doi":"10.1016/j.disc.2024.113872","title":"A Closure Lemma for tough graphs and Hamiltonian degree conditions","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Lemma (botany); Degree (music); Closure (psychology); Combinatorics; Discrete mathematics","score_opus":0.08390284682561662,"score_gpt":0.36928336599470546,"score_spread":0.28538051916908885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391155232","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6930302,0.0019069385,0.25456578,0.006532029,0.00031899803,0.003863829,0.0019450674,0.001344788,0.03649238],"genre_scores_gemma":[0.8690421,0.000073294745,0.1265866,0.00012411636,0.00008298359,0.00080896186,0.00010673538,0.00011681154,0.0030584203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989239,0.00002265043,0.00037071566,0.00027079607,0.00016181284,0.00025014812],"domain_scores_gemma":[0.99801195,0.00131697,0.00007556297,0.0004183659,0.00008267625,0.00009449329],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024913243,0.00021691878,0.00028106564,0.00011766904,0.00024936875,0.00018445025,0.00017585268,0.00008384274,0.00010128568],"category_scores_gemma":[0.00021990559,0.00017828975,0.00016362003,0.00025529374,0.00014775983,0.00014546406,0.00007548882,0.00014667369,0.000035344405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022681565,0.0000526247,0.000027118778,0.0007721434,0.00010968355,0.0000026589496,0.0030807226,3.451745e-7,0.00034811956,0.9824405,0.01234923,0.00081460486],"study_design_scores_gemma":[0.00023033372,0.000062364415,0.00015978297,0.00021819196,0.00021367191,0.000035822173,0.00094396394,0.003274217,0.0003372511,0.9851824,0.009107952,0.0002340709],"about_ca_topic_score_codex":0.0000031651834,"about_ca_topic_score_gemma":0.000036657726,"teacher_disagreement_score":0.17601189,"about_ca_system_score_codex":0.000023297465,"about_ca_system_score_gemma":0.000040740517,"threshold_uncertainty_score":0.72704446},"labels":[],"label_agreement":null},{"id":"W4391197450","doi":"10.1016/j.disc.2024.113902","title":"An upper bound of the number of distinct powers in binary words","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Binary number; Upper and lower bounds; Combinatorics; Discrete mathematics; Arithmetic","score_opus":0.009969578661615004,"score_gpt":0.2774593452152697,"score_spread":0.2674897665536547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391197450","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9653566,0.00014611482,0.02886833,0.00021386184,0.00026503066,0.000113805836,0.000014220665,0.00006218664,0.0049598734],"genre_scores_gemma":[0.9881421,0.0000038105986,0.011640428,0.0000243848,0.000013783831,0.0000043741306,0.0000015374203,0.000012124439,0.0001574574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909294,0.00004916577,0.00030646322,0.00016867807,0.00023643981,0.0001463153],"domain_scores_gemma":[0.99903303,0.00015217045,0.00007980472,0.0006886243,0.00001721918,0.000029151919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038315353,0.000103746395,0.00017811687,0.000053039454,0.000025702517,0.00006970789,0.0008088047,0.00003948364,0.000053907213],"category_scores_gemma":[0.000033585806,0.00006410001,0.00009576214,0.00045085832,0.000117229436,0.0002339611,0.00020749484,0.00009554053,0.000013859557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003065428,0.00019272346,0.0035456766,0.0005675559,0.00002816382,0.00001686499,0.014156749,0.000028553543,0.003253778,0.9744085,0.00019935475,0.003598983],"study_design_scores_gemma":[0.00027628234,0.000084066705,0.020163989,0.0016001388,0.000036063397,0.00007480798,0.0023889341,0.4492408,0.0055671395,0.51973486,0.0004395075,0.00039337415],"about_ca_topic_score_codex":0.00001640047,"about_ca_topic_score_gemma":0.0000032609812,"teacher_disagreement_score":0.45467365,"about_ca_system_score_codex":0.000017380858,"about_ca_system_score_gemma":0.000044224293,"threshold_uncertainty_score":0.26139224},"labels":[],"label_agreement":null},{"id":"W4391589431","doi":"10.1016/j.disc.2024.113908","title":"New weighing matrices via partitioned group actions","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Combinatorics; Group (periodic table); Group action; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.012719165053318967,"score_gpt":0.23222383439495878,"score_spread":0.2195046693416398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391589431","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.028137472,0.0020806089,0.9325116,0.00008610544,0.0017441545,0.00021665287,0.000021266997,0.0017838163,0.033418313],"genre_scores_gemma":[0.99203384,0.000059387392,0.006779142,0.0000074025766,0.00026680753,0.000027820199,0.000015900217,0.00005256745,0.00075715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993363,0.000013003629,0.00023102712,0.00011142725,0.0001281305,0.00018009805],"domain_scores_gemma":[0.9996162,0.00008412446,0.000017875818,0.00019415944,0.00000696288,0.0000806535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001302889,0.00013738705,0.00014243311,0.00009463763,0.00007382881,0.00016028494,0.00010733381,0.000058860787,0.00026114364],"category_scores_gemma":[0.0000063726984,0.00011915658,0.00009989966,0.00026417815,0.000012574712,0.00022723414,0.000014691199,0.00012379517,0.0005038161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034456293,0.00003343619,0.000019498466,0.0033057297,0.00035451076,0.000042296975,0.0078847,0.0029549566,0.01867407,0.94287795,0.016515851,0.007333542],"study_design_scores_gemma":[0.00026971244,0.00005249154,0.00003953972,0.0012985411,0.00028271534,0.000122871,0.0023402711,0.42600253,0.0058340994,0.4828712,0.08001662,0.0008693826],"about_ca_topic_score_codex":0.000004962024,"about_ca_topic_score_gemma":0.0000055100018,"teacher_disagreement_score":0.96389633,"about_ca_system_score_codex":0.00002503794,"about_ca_system_score_gemma":0.0000058608834,"threshold_uncertainty_score":0.64757055},"labels":[],"label_agreement":null},{"id":"W4391629159","doi":"10.1016/j.disc.2024.113915","title":"On a relationship between the characteristic and matching polynomials of a uniform hypertree","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Canadian Stroke Consortium; China Scholarship Council; Natural Science Foundation of Jiangxi Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Hyperbolic tree; Counterexample; Tree (set theory); Exponent; Conjecture; Boundary (topology); Matching (statistics); Discrete mathematics; Pure mathematics; Hyperbolic geometry","score_opus":0.06615074844130979,"score_gpt":0.3378207297208488,"score_spread":0.271669981279539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391629159","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9656432,0.000058348724,0.027026435,0.0019406164,0.000040870193,0.00039831325,0.00014579823,0.0001374141,0.004608998],"genre_scores_gemma":[0.99040496,0.000005114854,0.008985544,0.00004488405,0.000059697464,0.000037007154,0.00001623617,0.000031358228,0.00041518448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910027,0.000034695124,0.00041470004,0.0001455787,0.00017919495,0.00012553376],"domain_scores_gemma":[0.9958351,0.0036193624,0.00012487921,0.00034922926,0.000023600067,0.000047815298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034770934,0.00013509233,0.00023426961,0.00008233149,0.00013572455,0.00009133082,0.00014491894,0.000056687048,0.00003096635],"category_scores_gemma":[0.00026117876,0.0000857928,0.00007993789,0.00016505698,0.00008319758,0.00006370846,0.00004630824,0.00017272435,0.000048681908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025580391,0.000030031651,0.00024907157,0.00040790794,0.00003664339,0.0000011723755,0.0023794228,9.0816485e-7,0.00025628685,0.9958651,0.00042493566,0.00034595912],"study_design_scores_gemma":[0.00010392849,0.000030443955,0.0051331483,0.00038375086,0.0001429376,0.000018059793,0.0004711245,0.0010799697,0.00024564448,0.99204,0.00022653889,0.00012449845],"about_ca_topic_score_codex":0.0000034579991,"about_ca_topic_score_gemma":0.0000015602761,"teacher_disagreement_score":0.024761768,"about_ca_system_score_codex":0.000019676423,"about_ca_system_score_gemma":0.000017137761,"threshold_uncertainty_score":0.3498529},"labels":[],"label_agreement":null},{"id":"W4392919062","doi":"10.1016/j.disc.2024.113968","title":"On extremal and near-extremal self-dual ternary codes","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Ternary operation; Combinatorics; Dual (grammatical number); Discrete mathematics; Computer science","score_opus":0.012475497688923032,"score_gpt":0.24352448114496758,"score_spread":0.23104898345604455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392919062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50599307,0.0008160005,0.46934265,0.0011891833,0.0006306646,0.0002979379,0.000021528946,0.0016464347,0.020062497],"genre_scores_gemma":[0.90839714,0.000030988827,0.090987936,0.0001801955,0.00008272143,0.000013290777,0.0000025665606,0.00002426059,0.00028091983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988763,0.000046539924,0.00020737936,0.00035755723,0.00026295084,0.00024930967],"domain_scores_gemma":[0.99901867,0.0003797494,0.000039136547,0.00044938773,0.000016662285,0.00009639736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034253745,0.00019371732,0.00018202035,0.000101468846,0.0001598295,0.0007107386,0.00036369503,0.0000584572,0.00003476377],"category_scores_gemma":[0.000026256288,0.00015193548,0.00010421037,0.00027574273,0.00009163993,0.00027778346,0.00024099255,0.00016851851,0.00008936961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000491743,0.000065730324,0.00003789503,0.00020036027,0.00005132151,0.00010967831,0.0042762132,0.000012173825,0.00015525476,0.9889518,0.00062254973,0.0055120983],"study_design_scores_gemma":[0.0001883019,0.00026293093,0.00018422668,0.00039448866,0.00004709822,0.00021070857,0.00017441611,0.41659772,0.00034649647,0.57821214,0.002990234,0.00039121436],"about_ca_topic_score_codex":0.0000015532864,"about_ca_topic_score_gemma":0.0000010406364,"teacher_disagreement_score":0.41658553,"about_ca_system_score_codex":0.000012896246,"about_ca_system_score_gemma":0.000028381884,"threshold_uncertainty_score":0.68536687},"labels":[],"label_agreement":null},{"id":"W4393216900","doi":"10.1016/j.disc.2024.114005","title":"A note on highly connected K2,-minor free graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Minor (academic); Discrete mathematics","score_opus":0.022923630332942358,"score_gpt":0.30634562913222824,"score_spread":0.28342199879928587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393216900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02297199,0.0003670614,0.9494096,0.0023371668,0.00063057814,0.00055123516,0.000057508638,0.0013454237,0.022329407],"genre_scores_gemma":[0.7945301,0.00004041455,0.20214966,0.0002972533,0.0001013821,0.00010389832,0.000011996796,0.00008917911,0.0026761491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979437,0.0000750397,0.00032881505,0.00052350416,0.0006389765,0.0004899408],"domain_scores_gemma":[0.9972259,0.0008877372,0.00005840244,0.0015920722,0.000075557145,0.00016035775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044779366,0.0002528538,0.00026020364,0.0003562321,0.00013161151,0.00041297215,0.00174781,0.00008385831,0.000046058252],"category_scores_gemma":[0.0003770076,0.00019624626,0.00016924975,0.0010971265,0.00013402852,0.00037781554,0.0004976067,0.00034644944,0.000565182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005786042,0.000046476376,0.0000030727624,0.00017585413,0.000032694694,0.00009914555,0.0015746569,0.000027199698,0.0012825093,0.99205,0.0012513489,0.003451265],"study_design_scores_gemma":[0.00022385332,0.0001552754,0.000023301442,0.00023085109,0.0000116926,0.00002559475,0.000063733576,0.10167699,0.00511089,0.8896697,0.0025287168,0.0002793698],"about_ca_topic_score_codex":0.0000029301686,"about_ca_topic_score_gemma":0.000004553449,"teacher_disagreement_score":0.7715581,"about_ca_system_score_codex":0.00004952911,"about_ca_system_score_gemma":0.000060211696,"threshold_uncertainty_score":0.800269},"labels":[],"label_agreement":null},{"id":"W4394742206","doi":"10.1016/j.disc.2024.114029","title":"Wickets in 3-uniform hypergraphs","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Hungarian Scientific Research Fund","keywords":"Hypergraph; Mathematics; Combinatorics; Vertex (graph theory); Conjecture; Row; Discrete mathematics; Graph; Computer science","score_opus":0.026816762002405025,"score_gpt":0.31156306649351023,"score_spread":0.2847463044911052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394742206","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82671595,0.0012983958,0.00943695,0.00043837074,0.0011492949,0.00069998036,0.00004976084,0.0007385246,0.15947278],"genre_scores_gemma":[0.9679945,0.00007099725,0.030186566,0.000067505505,0.00011291008,0.000032215805,0.000006381558,0.00007988058,0.0014490547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984678,0.00003804532,0.00050738186,0.00028715254,0.00032394848,0.00037567347],"domain_scores_gemma":[0.9987297,0.0005733829,0.00006033673,0.0005294002,0.000026226271,0.000080942795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056739664,0.0002629471,0.00035264753,0.00030123425,0.0001068189,0.00010487685,0.00032934247,0.00013779703,0.00023004407],"category_scores_gemma":[0.0002362682,0.00019121612,0.00019560914,0.00036651874,0.0001282233,0.00016953412,0.00014705806,0.0003148959,0.00005088738],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004525614,0.000044276818,0.000087820146,0.00075092877,0.000048684557,0.00006653372,0.0077068056,0.000002888357,0.00009507342,0.9886531,0.0011940547,0.0013452906],"study_design_scores_gemma":[0.00015896707,0.000027937598,0.00006602239,0.00040373576,0.00004421615,0.00005425057,0.00090485084,0.004831325,0.00031452498,0.99021065,0.002715132,0.000268383],"about_ca_topic_score_codex":0.000004497421,"about_ca_topic_score_gemma":0.000023130973,"teacher_disagreement_score":0.15802373,"about_ca_system_score_codex":0.000044044205,"about_ca_system_score_gemma":0.000029367313,"threshold_uncertainty_score":0.7797567},"labels":[],"label_agreement":null},{"id":"W4396815724","doi":"10.1016/j.disc.2024.114332","title":"Bivariate P- and Q-polynomial structures of the association schemes based on attenuated spaces","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Canadian Nautical Research Society; Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bivariate analysis; Univariate; Polynomial; Kravchuk polynomials; Eigenvalues and eigenvectors; Association scheme; Pure mathematics; Algebra over a field; Orthogonal polynomials; Combinatorics; Discrete mathematics; Difference polynomials; Macdonald polynomials; Multivariate statistics; Mathematical analysis; Statistics","score_opus":0.01673573007617401,"score_gpt":0.2759600894853987,"score_spread":0.25922435940922467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396815724","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9887993,0.00013335113,0.0028424207,0.0010825172,0.00042302848,0.00035282504,0.00007511388,0.00013586943,0.006155616],"genre_scores_gemma":[0.99467206,0.000005035382,0.004093447,0.00005981809,0.00008087252,0.000008175246,0.000004339754,0.00003326783,0.001042968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988095,0.000095970994,0.0003282489,0.00018727085,0.00039060286,0.00018838882],"domain_scores_gemma":[0.9979459,0.0014014627,0.00022221422,0.0003463583,0.000045185516,0.000038848342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065655075,0.00018514214,0.000278497,0.00009267679,0.000097558324,0.000097077536,0.00018503598,0.00012813049,0.000097135584],"category_scores_gemma":[0.0010491515,0.000113572714,0.00012579699,0.0003071878,0.00008421901,0.000067489804,0.000074662355,0.00020818331,0.000010966131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039160805,0.00010290518,0.0011709565,0.0018756428,0.00030547063,0.000003955132,0.0034072367,0.000035257315,0.0021978854,0.986277,0.004025015,0.00055952487],"study_design_scores_gemma":[0.0005775641,0.00008959691,0.001176721,0.00081507425,0.00037070768,0.0000075267512,0.00089881907,0.02751787,0.025039325,0.94146734,0.0016802745,0.00035916278],"about_ca_topic_score_codex":0.0000040307186,"about_ca_topic_score_gemma":0.0000016414252,"teacher_disagreement_score":0.044809632,"about_ca_system_score_codex":0.000047409892,"about_ca_system_score_gemma":0.000041129126,"threshold_uncertainty_score":0.4631361},"labels":[],"label_agreement":null},{"id":"W4399425163","doi":"10.1016/j.disc.2024.114103","title":"Circular external difference families, graceful labellings and cyclotomy","year":2024,"lang":"en","type":"article","venue":"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":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.01264351024282437,"score_gpt":0.23448091944222596,"score_spread":0.2218374091994016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399425163","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.31307608,0.0048202407,0.6795735,0.0005095923,0.00031860033,0.00017001774,0.000005269768,0.0005223174,0.0010044235],"genre_scores_gemma":[0.8709161,0.00045909677,0.12775727,0.00017105069,0.000014336714,0.000019426778,0.000002398511,0.00002475731,0.00063551666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871486,0.000024174473,0.00027576997,0.00040046533,0.00032051583,0.00026422285],"domain_scores_gemma":[0.99918306,0.00013309658,0.000049694947,0.0004713978,0.000041884425,0.000120856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028750714,0.00018785127,0.0001971324,0.00013532971,0.00011308867,0.0005209269,0.00041878538,0.000061826715,0.0000076058964],"category_scores_gemma":[0.000029007862,0.00014449398,0.00006774519,0.00034256763,0.00009067252,0.00019383055,0.00022451482,0.00017001992,0.00006480925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.6489437e-7,0.00004229038,0.00017593197,0.0005576193,0.000035199046,0.00007688814,0.0040204385,0.000020784371,0.007218867,0.97729987,0.00021426895,0.010337098],"study_design_scores_gemma":[0.00014301606,0.00004155122,0.00015018402,0.00053198443,0.000026638101,0.00010160346,0.00009283671,0.29433998,0.0016427464,0.7013599,0.0012786924,0.0002908302],"about_ca_topic_score_codex":0.000016726619,"about_ca_topic_score_gemma":8.968686e-7,"teacher_disagreement_score":0.55784005,"about_ca_system_score_codex":0.000011325863,"about_ca_system_score_gemma":0.000029026052,"threshold_uncertainty_score":0.58922935},"labels":[],"label_agreement":null},{"id":"W4399763050","doi":"10.1016/j.disc.2024.114139","title":"Some progress on the Aharoni–Korman conjecture","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Defence Academy","keywords":"Conjecture; Mathematics; Combinatorics; Mathematical economics; Discrete mathematics","score_opus":0.035538812438107525,"score_gpt":0.3289845647392108,"score_spread":0.29344575230110326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399763050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62887955,0.013734594,0.091272675,0.059012916,0.019760089,0.019897776,0.00065031357,0.015632976,0.1511591],"genre_scores_gemma":[0.9396398,0.00011413717,0.05009921,0.0005203599,0.0020333368,0.0006880061,0.00002394333,0.000552306,0.006328894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972956,0.00009435372,0.00071089866,0.00044848878,0.0008449468,0.0006057156],"domain_scores_gemma":[0.9958051,0.0024739725,0.00021613459,0.0013005603,0.00006946542,0.00013481075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075482007,0.0005370891,0.0005466737,0.00013375533,0.00026630302,0.00038663068,0.0007899273,0.00019372755,0.00020510417],"category_scores_gemma":[0.00074657565,0.00031377867,0.00029055716,0.00041203486,0.00027051015,0.00027472753,0.0002119085,0.0006932729,0.0006415015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061061796,0.00014474512,0.0000018543412,0.0011025758,0.00013145896,0.000045116027,0.0026826854,0.0000055594755,0.000053557116,0.98586446,0.009454614,0.000507292],"study_design_scores_gemma":[0.00022288109,0.00015113139,0.0000013047813,0.00091974647,0.00013470552,0.000049506238,0.000615779,0.0059860945,0.0020969291,0.9817171,0.0076904683,0.00041432423],"about_ca_topic_score_codex":4.765767e-7,"about_ca_topic_score_gemma":8.984037e-7,"teacher_disagreement_score":0.31076023,"about_ca_system_score_codex":0.00013760442,"about_ca_system_score_gemma":0.00007884007,"threshold_uncertainty_score":0.99993145},"labels":[],"label_agreement":null},{"id":"W4400720472","doi":"10.1016/j.disc.2024.114154","title":"A closure for Hamilton-connectedness in {K1,3,Γ3}-free graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Grantová Agentura České Republiky","keywords":"Mathematics; Closure (psychology); Social connectedness; Combinatorics; Discrete mathematics","score_opus":0.025501284242576465,"score_gpt":0.31533044034136765,"score_spread":0.2898291560987912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400720472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043089308,0.0007959523,0.95067877,0.0008229129,0.00042648017,0.0009303605,0.00006472011,0.0004866216,0.0027048683],"genre_scores_gemma":[0.5651614,0.00008511304,0.43182665,0.00016359195,0.00011008875,0.0006862958,0.000024709952,0.0001270864,0.0018150385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998057,0.00006290335,0.00040653994,0.0005213172,0.00040534465,0.0005468753],"domain_scores_gemma":[0.99761313,0.0008819163,0.00005522711,0.0012531223,0.000087077555,0.000109520704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083590485,0.00023194599,0.00030525855,0.00042719932,0.0000920534,0.00033668146,0.001771199,0.000098759265,0.000013654051],"category_scores_gemma":[0.0003707732,0.00019260035,0.00019076478,0.0013180409,0.000112570575,0.00050868595,0.00035078166,0.0002686018,0.00004734281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008251341,0.000048733466,0.000046359884,0.00060047733,0.000028543325,0.000046705252,0.004597942,0.000040224015,0.00033662232,0.9918559,0.0006106835,0.001779546],"study_design_scores_gemma":[0.00039317596,0.00007438119,0.00003275765,0.0002660374,0.000007976588,0.000020798905,0.0002902686,0.11652288,0.0009298841,0.8795109,0.0017059047,0.0002450772],"about_ca_topic_score_codex":0.000003183696,"about_ca_topic_score_gemma":0.00002396837,"teacher_disagreement_score":0.52207214,"about_ca_system_score_codex":0.00005056213,"about_ca_system_score_gemma":0.000075478696,"threshold_uncertainty_score":0.7854014},"labels":[],"label_agreement":null},{"id":"W4400956666","doi":"10.1016/j.disc.2024.114179","title":"m-Distance-regular graphs and their relation to multivariate P-polynomial association schemes","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Agence Nationale de la Recherche; American Heart Association","keywords":"Mathematics; Association scheme; Combinatorics; Relation (database); Multivariate statistics; Discrete mathematics; Polynomial; Statistics; Computer science","score_opus":0.010421698671277943,"score_gpt":0.23907503008408365,"score_spread":0.2286533314128057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400956666","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.12089371,0.00028536117,0.8751308,0.0011362685,0.00034674964,0.00020887512,0.000011159567,0.000415307,0.0015717949],"genre_scores_gemma":[0.946942,0.000014448878,0.052560966,0.00009152736,0.000046127014,0.000022826614,0.000004461838,0.000016560823,0.0003011217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907786,0.000047825084,0.00021615154,0.00028647363,0.00017302009,0.00019865877],"domain_scores_gemma":[0.9992479,0.00026171483,0.00006792907,0.00031238032,0.00003553687,0.00007454623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057001057,0.0001488571,0.00015561527,0.00015352623,0.00013162034,0.00040589337,0.0002586842,0.00007178123,0.000007281817],"category_scores_gemma":[0.00009620306,0.00011787903,0.000094481955,0.0005008869,0.000022426146,0.0003576476,0.00013451169,0.00011526632,0.00003064374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038879175,0.00001803006,0.0001350482,0.00007793106,0.00005657054,0.0000020259356,0.007127754,0.000012055566,0.0022427305,0.98188466,0.0005689861,0.007870332],"study_design_scores_gemma":[0.00022115662,0.00007544753,0.00066969014,0.00030606013,0.000032062584,0.000006343905,0.00030814993,0.1461729,0.0033233904,0.82761633,0.020890819,0.00037767057],"about_ca_topic_score_codex":0.0000029192308,"about_ca_topic_score_gemma":0.0000022528404,"teacher_disagreement_score":0.82604825,"about_ca_system_score_codex":0.000043592536,"about_ca_system_score_gemma":0.00001692451,"threshold_uncertainty_score":0.48069674},"labels":[],"label_agreement":null},{"id":"W4401581634","doi":"10.1016/j.disc.2024.114204","title":"Cut-down de Bruijn sequences","year":2024,"lang":"nl","type":"article","venue":"Discrete Mathematics","topic":"Fractal and DNA sequence analysis","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Prince Edward Island","funders":"","keywords":"De Bruijn sequence; Mathematics; Combinatorics; Discrete mathematics; De Bruijn graph","score_opus":0.011619641876331518,"score_gpt":0.27638293973404293,"score_spread":0.2647632978577114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401581634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7418767,0.071366884,0.061422523,0.0060972106,0.001482819,0.0008476229,0.0007341373,0.00029125522,0.11588084],"genre_scores_gemma":[0.9714963,0.0032879969,0.004017514,0.0003408529,0.000671315,0.00002762367,0.00022074775,0.000069289716,0.01986839],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99800354,0.0000662287,0.0004866768,0.00057154096,0.00030052118,0.0005714704],"domain_scores_gemma":[0.9989632,0.000059370865,0.00010945392,0.00059326185,0.00007002986,0.00020468458],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039790146,0.00038641025,0.00036781863,0.00009728734,0.00013521785,0.00037829875,0.00042849802,0.00033735958,0.0005677821],"category_scores_gemma":[0.00015555108,0.00031825085,0.00045580603,0.00033639476,0.00027402068,0.000019321544,0.00018055372,0.0002527411,0.0009593507],"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.000068403744,0.0005417842,0.0007874802,0.006981678,0.0034507138,0.00090498506,0.0060944455,0.0006964954,0.8721214,0.046784,0.040347874,0.021220721],"study_design_scores_gemma":[0.00062010903,0.0012950149,0.000080874284,0.0027815667,0.002683999,0.00070009416,0.008596792,0.118153125,0.45775524,0.07346501,0.3307447,0.0031234627],"about_ca_topic_score_codex":0.0000923889,"about_ca_topic_score_gemma":0.000063094725,"teacher_disagreement_score":0.4143662,"about_ca_system_score_codex":0.00006089048,"about_ca_system_score_gemma":0.00031101773,"threshold_uncertainty_score":0.999927},"labels":[],"label_agreement":null},{"id":"W4401872514","doi":"10.1016/j.disc.2024.114220","title":"Pursuit-evasion in graphs: Zombies, lazy zombies and a survivor","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Gothic Literature and Media Analysis","field":"Social Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Ottawa; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Evasion (ethics); Pursuit-evasion; Combinatorics; Discrete mathematics; Mathematical optimization","score_opus":0.017848020287703395,"score_gpt":0.303472337255579,"score_spread":0.2856243169678756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401872514","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84209985,0.016942175,0.001468106,0.013033401,0.0015435737,0.0009617548,0.000059196936,0.0005173543,0.12337462],"genre_scores_gemma":[0.9902827,0.0013876113,0.0016511292,0.00015808617,0.00012558504,0.00003078209,0.000015984766,0.000020808675,0.006327285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987966,0.00009347702,0.00023228303,0.0002113332,0.00040007563,0.00026625572],"domain_scores_gemma":[0.999339,0.00032806024,0.000036829042,0.0001599409,0.000034029363,0.00010217356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010004068,0.000120935445,0.00023082193,0.00020330973,0.00013375463,0.0003743584,0.00015978098,0.00011863181,0.00008943255],"category_scores_gemma":[0.00030351616,0.000094104464,0.00008524019,0.0006615355,0.00019562613,0.00022592917,0.00004769442,0.00017352792,0.000026265925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003613457,0.000053307187,0.001306454,0.0004990252,0.0000693796,0.000056523884,0.22609738,7.2197247e-7,0.00023999656,0.76676476,0.0020172352,0.0028916057],"study_design_scores_gemma":[0.00047062995,0.000083845305,0.0010417055,0.00169765,0.00034114817,0.000010139016,0.09365538,0.0027175527,0.00022462793,0.66964805,0.22936377,0.00074550527],"about_ca_topic_score_codex":0.0006284919,"about_ca_topic_score_gemma":0.0041075316,"teacher_disagreement_score":0.22734654,"about_ca_system_score_codex":0.00003213111,"about_ca_system_score_gemma":0.000077814424,"threshold_uncertainty_score":0.3837469},"labels":[],"label_agreement":null},{"id":"W4401978764","doi":"10.1016/j.disc.2025.114957","title":"A power sum expansion for the Kromatic symmetric function","year":2025,"lang":"en","type":"preprint","venue":"Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Function (biology); Power (physics); Physics; Thermodynamics","score_opus":0.04934159758442348,"score_gpt":0.3407955983862778,"score_spread":0.29145400080185435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401978764","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.0037198,0.0013234008,0.960209,0.0007674838,0.0021431663,0.005734441,0.00041097435,0.0006922668,0.024999473],"genre_scores_gemma":[0.13936225,0.00064452214,0.73432153,0.000541338,0.0010402022,0.00978684,0.00028334765,0.00082465674,0.11319534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99569654,0.00011206839,0.0016747277,0.00078013615,0.000985337,0.00075120066],"domain_scores_gemma":[0.9865225,0.009268553,0.001108068,0.0025124007,0.000453132,0.00013537041],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00138908,0.0009166328,0.0014366799,0.00046713784,0.00047262566,0.00038950625,0.0013033941,0.00060374883,0.00022600166],"category_scores_gemma":[0.006414321,0.00062661344,0.00092834566,0.0005507854,0.0002430933,0.00018563893,0.0014756955,0.00091314036,0.000066346314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039615723,0.00037525274,0.000002696463,0.015162348,0.00065911206,0.0000031000711,0.002376142,0.00015209282,0.00004140268,0.96547204,0.015320718,0.00039546684],"study_design_scores_gemma":[0.0004753108,0.00008743727,0.00001020605,0.0022712643,0.0014020198,0.000007380396,0.0025552716,0.02697803,0.00023334786,0.96406424,0.001269175,0.0006463172],"about_ca_topic_score_codex":0.000007097642,"about_ca_topic_score_gemma":0.000009093936,"teacher_disagreement_score":0.22588748,"about_ca_system_score_codex":0.00024548065,"about_ca_system_score_gemma":0.00021654874,"threshold_uncertainty_score":0.99961853},"labels":[],"label_agreement":null},{"id":"W4402137504","doi":"10.1016/j.disc.2024.114195","title":"Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Government of Ontario; National Science Foundation","keywords":"Treewidth; Combinatorics; Mathematics; Partial k-tree; Tree-depth; Clique-sum; 1-planar graph; Tree decomposition; Discrete mathematics; Chordal graph; Bounded function; Pathwidth; Clique-width; Graph; Line graph; Voltage graph","score_opus":0.020182274357420475,"score_gpt":0.29895184390847096,"score_spread":0.2787695695510505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402137504","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.21094865,0.0006130111,0.77769506,0.001013222,0.000119093565,0.00046218117,0.000018325132,0.0006225087,0.008507961],"genre_scores_gemma":[0.83192956,0.0000553083,0.16770846,0.00005148416,0.000014629695,0.000054800093,0.0000056883,0.000032851527,0.00014724041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985831,0.000051504005,0.00022014878,0.00042302956,0.00037090442,0.00035133993],"domain_scores_gemma":[0.99878037,0.00032389365,0.000042032243,0.0006332187,0.000057375444,0.00016308196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002270285,0.00020419717,0.00020360474,0.00034908316,0.00018318922,0.00047167088,0.000547812,0.00005494248,0.000010811511],"category_scores_gemma":[0.000024665133,0.00014788429,0.00007288999,0.00103054,0.00016019335,0.0005643903,0.0002207393,0.0002422979,0.000034676093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004441222,0.000039700728,0.00006299133,0.00015423843,0.00006144735,0.00007657794,0.0018988422,0.000005135375,0.0036472927,0.9874421,0.00007814173,0.006529094],"study_design_scores_gemma":[0.00027419237,0.00026755943,0.00031763257,0.00032967035,0.000032818793,0.00025858276,0.0002954606,0.04274929,0.0044983095,0.9503392,0.00025203734,0.00038523707],"about_ca_topic_score_codex":0.0000028169754,"about_ca_topic_score_gemma":0.000015500607,"teacher_disagreement_score":0.6209809,"about_ca_system_score_codex":0.00001824972,"about_ca_system_score_gemma":0.000044030752,"threshold_uncertainty_score":0.60305464},"labels":[],"label_agreement":null},{"id":"W4402455871","doi":"10.1016/j.disc.2024.114253","title":"Adversarial graph burning densities","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Mathematics; Combinatorics; Adversarial system; Graph; Discrete mathematics; Artificial intelligence; Computer science","score_opus":0.010629957919076755,"score_gpt":0.23862935155523418,"score_spread":0.22799939363615743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402455871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0129802255,0.000350894,0.97770286,0.00025940567,0.0009486115,0.00008145754,0.0000045581446,0.0005149692,0.007157009],"genre_scores_gemma":[0.84202415,0.000018080922,0.15646513,0.00010973636,0.00021386686,0.000012299803,0.0000044392027,0.000023319551,0.0011289577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912363,0.000031427975,0.00018513807,0.00022442106,0.0002175662,0.00021780006],"domain_scores_gemma":[0.99936706,0.0001684423,0.00003202308,0.00034911165,0.000024049225,0.000059291433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032481836,0.00013215854,0.00014000782,0.00012770231,0.00011685413,0.00040962684,0.00045694655,0.0000434831,0.000027494856],"category_scores_gemma":[0.000030932537,0.000104736886,0.00012956704,0.00035142776,0.00006169073,0.00038994366,0.00015482063,0.00013508486,0.00015245893],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.54875e-7,0.000010117335,0.0000023140979,0.00009481957,0.00003141991,0.00005840806,0.006440254,0.000047840105,0.00021171008,0.99007106,0.00027621296,0.0027552051],"study_design_scores_gemma":[0.000080909784,0.00003016791,0.0000073900096,0.00015895993,0.000019416608,0.00006018782,0.00058778626,0.24359265,0.00088102935,0.75274867,0.0016350949,0.000197708],"about_ca_topic_score_codex":0.0000015365799,"about_ca_topic_score_gemma":4.1090973e-7,"teacher_disagreement_score":0.8290439,"about_ca_system_score_codex":0.000010574712,"about_ca_system_score_gemma":0.000025197123,"threshold_uncertainty_score":0.42710462},"labels":[],"label_agreement":null},{"id":"W4403088534","doi":"10.1016/j.disc.2024.114278","title":"Linear colouring of binomial random graphs","year":2024,"lang":"ca","type":"article","venue":"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":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Binomial (polynomial); Discrete mathematics; Statistics","score_opus":0.027235953647663784,"score_gpt":0.32104101288585546,"score_spread":0.29380505923819167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403088534","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.09218725,0.005222718,0.8885328,0.00066009193,0.0017528081,0.0012066059,0.00014288677,0.00038107435,0.009913757],"genre_scores_gemma":[0.9051186,0.00042348012,0.09158577,0.000027688844,0.0002173282,0.00003925689,0.000008406464,0.00010020529,0.0024792673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673367,0.00018937694,0.00091879885,0.0006157343,0.0008635022,0.0006789433],"domain_scores_gemma":[0.99697226,0.0013221072,0.00020744024,0.0011159644,0.00017035252,0.00021185307],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015346687,0.00037845585,0.0006936319,0.00052230014,0.00015988472,0.00033641246,0.0014129146,0.00016846342,0.00013296296],"category_scores_gemma":[0.00035326456,0.00032259032,0.00048632754,0.0014883599,0.00050089683,0.00048451123,0.0007428862,0.0005495225,0.00026977304],"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.00009276729,0.00015484374,0.000027940336,0.0036556998,0.00029640188,0.00016695968,0.008880261,0.00050915335,0.003794423,0.97669667,0.00041959903,0.0053053005],"study_design_scores_gemma":[0.001044577,0.00025555407,0.000011393334,0.0015367317,0.000103942744,0.00004954823,0.00045692513,0.54398257,0.01210889,0.43862614,0.001383364,0.00044038455],"about_ca_topic_score_codex":0.000006360698,"about_ca_topic_score_gemma":0.00000244546,"teacher_disagreement_score":0.81293136,"about_ca_system_score_codex":0.00006006645,"about_ca_system_score_gemma":0.00022538714,"threshold_uncertainty_score":0.99992263},"labels":[],"label_agreement":null},{"id":"W4403094255","doi":"10.1016/j.disc.2024.114272","title":"The hat guessing game on cactus graphs and cycles","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Cactus; Combinatorics; Discrete mathematics; Biology","score_opus":0.01584206968029182,"score_gpt":0.2596635021553093,"score_spread":0.2438214324750175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403094255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6334743,0.023815596,0.28545743,0.024500258,0.0041347905,0.0009428251,0.000017586943,0.0032210494,0.024436131],"genre_scores_gemma":[0.9828343,0.00021240338,0.016286165,0.00018147804,0.000007093795,0.0000096687545,9.933901e-7,0.000017067876,0.0004508326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910724,0.000026385947,0.00018861706,0.00023533028,0.00023362628,0.00020880852],"domain_scores_gemma":[0.9990744,0.0003641628,0.000040298706,0.00043401585,0.000021968843,0.000065154636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036214833,0.0001254917,0.000109083994,0.00007159245,0.00023402915,0.000890317,0.0003047821,0.000036890695,0.000001896621],"category_scores_gemma":[0.00004612726,0.00007055715,0.000057333444,0.00021861344,0.00010538264,0.00014894718,0.00012983556,0.00012670738,0.000048434846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.0797544e-7,0.000010010356,0.0000059293257,0.00006431664,0.000015857197,0.000010040113,0.0019049919,0.00002520107,0.00024508536,0.98374736,0.0006669767,0.01330362],"study_design_scores_gemma":[0.00005958457,0.000033486907,0.000031815074,0.00030110127,0.00001111513,0.000024082807,0.00014408532,0.15320334,0.00066836993,0.843662,0.0017370827,0.00012392101],"about_ca_topic_score_codex":0.0000036738718,"about_ca_topic_score_gemma":0.0000018964888,"teacher_disagreement_score":0.34936,"about_ca_system_score_codex":0.0000071253166,"about_ca_system_score_gemma":0.000016978061,"threshold_uncertainty_score":0.85853475},"labels":[],"label_agreement":null},{"id":"W4403196330","doi":"10.1016/j.disc.2024.114275","title":"Turán numbers and switching","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Heilbronn Institute for Mathematical Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.02275104926666183,"score_gpt":0.3144958308490341,"score_spread":0.29174478158237227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403196330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8680463,0.0016244728,0.040991195,0.00044406386,0.00090087345,0.00043065983,0.000027031365,0.00075766584,0.08677776],"genre_scores_gemma":[0.9526085,0.000058608137,0.045800257,0.00007208525,0.00015170765,0.000012183156,0.0000023226592,0.00006725096,0.001227072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989326,0.000028973696,0.00031137912,0.0002468443,0.00023320467,0.00024700497],"domain_scores_gemma":[0.9988626,0.0006328925,0.00005330734,0.00034374566,0.000019579193,0.000087851244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041197,0.00021162166,0.00025750027,0.00009091223,0.00019164862,0.00018099927,0.00016601848,0.0000941787,0.000112594425],"category_scores_gemma":[0.00022255794,0.00014943554,0.00011007793,0.00014139494,0.000079425336,0.00013889097,0.00016169569,0.00023796095,0.000019219378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021934109,0.000011498502,0.000031155538,0.00087212684,0.00007574848,0.00002332794,0.009556341,4.2005632e-7,0.00021662077,0.9858244,0.0012391146,0.0021470208],"study_design_scores_gemma":[0.0000888349,0.000016831627,0.000022036633,0.00028858276,0.000087765664,0.000101216516,0.0010650854,0.0033152832,0.00023313858,0.99165577,0.0029082808,0.0002171927],"about_ca_topic_score_codex":0.000003721404,"about_ca_topic_score_gemma":0.0000037995064,"teacher_disagreement_score":0.08555069,"about_ca_system_score_codex":0.000018604864,"about_ca_system_score_gemma":0.00001363655,"threshold_uncertainty_score":0.6093804},"labels":[],"label_agreement":null},{"id":"W4403603865","doi":"10.1016/j.disc.2024.114295","title":"On the size and structure of t-representable sumsets","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.019409441234399576,"score_gpt":0.29332305517473106,"score_spread":0.2739136139403315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403603865","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9845324,0.0003980013,0.0007385456,0.00041781497,0.00026983194,0.00035648845,0.00011914586,0.00009251594,0.013075254],"genre_scores_gemma":[0.99404657,0.000024547211,0.004987765,0.00007404625,0.000054530497,0.0000052327528,0.0000017728587,0.000039245708,0.00076627854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892884,0.00005544248,0.0003166332,0.00020288333,0.00030463765,0.00019157048],"domain_scores_gemma":[0.99544835,0.003827708,0.00008733022,0.000560662,0.000030701896,0.000045260666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027815593,0.00019315627,0.00027471353,0.000050422175,0.00014674528,0.00007659089,0.00024782642,0.000086115724,0.0004430244],"category_scores_gemma":[0.0008853213,0.00009993703,0.00010543997,0.00016092489,0.0002113388,0.000059270697,0.00016349688,0.00022471508,0.0000036116035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067164765,0.000014974248,0.000017877344,0.00064108166,0.00009534914,0.0000044640965,0.0038179487,0.000002400289,0.001553414,0.99098337,0.0027121787,0.00015020354],"study_design_scores_gemma":[0.000084295236,0.00003527244,0.000044403314,0.0002493393,0.000075960044,0.000022977694,0.00067952304,0.0010289715,0.0054603927,0.9918684,0.0003268938,0.00012356947],"about_ca_topic_score_codex":0.0000030553556,"about_ca_topic_score_gemma":0.0000025013774,"teacher_disagreement_score":0.012308975,"about_ca_system_score_codex":0.000010214918,"about_ca_system_score_gemma":0.000014189216,"threshold_uncertainty_score":0.48508063},"labels":[],"label_agreement":null},{"id":"W4403733504","doi":"10.1016/j.disc.2024.114288","title":"Large matchings in maximal 1-planar graphs","year":2024,"lang":"en","type":"article","venue":"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":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics; Planar; Planar graph; Chordal graph; Graph; Computer science","score_opus":0.018123747558879955,"score_gpt":0.30189577878873863,"score_spread":0.28377203122985867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403733504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043363698,0.0005528661,0.9453244,0.00087191985,0.00020829854,0.00027750022,0.000022434671,0.00044962746,0.008929259],"genre_scores_gemma":[0.8425313,0.000048955084,0.15616052,0.00013932756,0.000031318894,0.00005026888,0.000008651001,0.0000467808,0.0009828821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834615,0.00005792834,0.00030071018,0.0003770812,0.0004102053,0.00050791854],"domain_scores_gemma":[0.9990079,0.0002414268,0.000034354052,0.0005990058,0.000023851399,0.00009349197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086039456,0.00017109995,0.0002041024,0.0003670131,0.000070631264,0.00030921717,0.0009479723,0.000058723508,0.000039127615],"category_scores_gemma":[0.00006198024,0.00014088706,0.00009907604,0.0009652405,0.00005598484,0.000564753,0.00025155194,0.000323566,0.00030576542],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001994682,0.00004064478,0.00006909265,0.00019676778,0.000011844813,0.00017088316,0.0038607614,0.000007755938,0.00032495352,0.99406964,0.00023226549,0.0010134251],"study_design_scores_gemma":[0.00012959281,0.000028581853,0.00008216104,0.0001650352,0.000003035417,0.000040713854,0.00032762933,0.0800487,0.0002970466,0.91662633,0.002069603,0.00018159093],"about_ca_topic_score_codex":0.0000037011912,"about_ca_topic_score_gemma":0.000010627972,"teacher_disagreement_score":0.7991676,"about_ca_system_score_codex":0.000038112557,"about_ca_system_score_gemma":0.000037357433,"threshold_uncertainty_score":0.57452077},"labels":[],"label_agreement":null},{"id":"W4403986936","doi":"10.1016/j.disc.2024.114298","title":"On finding the largest minimum distance of locally recoverable codes: A graph theory approach","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics; Graph theory; Graph","score_opus":0.019490960527396996,"score_gpt":0.2627805352785573,"score_spread":0.24328957475116034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403986936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017937098,0.00067921646,0.98942095,0.0002641295,0.00015232114,0.00025141568,0.000069822345,0.00044046348,0.0069279787],"genre_scores_gemma":[0.644406,0.000101694684,0.35452706,0.00009689378,0.000020052752,0.000069789065,0.000014817076,0.00003427605,0.00072940503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865854,0.00005160889,0.0003168914,0.0003647549,0.00033490043,0.00027331582],"domain_scores_gemma":[0.9975044,0.0010262312,0.0001282316,0.0012805095,0.000032046075,0.0000285901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006949413,0.00019146649,0.00024340676,0.00011402568,0.00012012828,0.00017671096,0.0015404263,0.00007258062,0.000007102892],"category_scores_gemma":[0.00038191737,0.000117762684,0.00009987012,0.0006583258,0.00022518107,0.00035498585,0.00036750652,0.00026815233,0.000026962274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004177635,0.00004720452,0.0000021851483,0.000267991,0.00003062061,0.000010213511,0.0012741216,0.00043338933,0.00013298822,0.9943071,0.00076419907,0.0027258224],"study_design_scores_gemma":[0.00007957519,0.00007043573,0.0000029583466,0.00035512962,0.000015669446,0.000014462801,0.00078022457,0.14272012,0.0014461044,0.8534906,0.0008467886,0.00017791268],"about_ca_topic_score_codex":0.0000012106535,"about_ca_topic_score_gemma":0.0000013375162,"teacher_disagreement_score":0.64261234,"about_ca_system_score_codex":0.000041510742,"about_ca_system_score_gemma":0.00003744166,"threshold_uncertainty_score":0.48022228},"labels":[],"label_agreement":null},{"id":"W4404204827","doi":"10.1016/j.disc.2024.114316","title":"On combinatorial and hypergeometric approaches toward second-order difference equations","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Killam Trusts","keywords":"Mathematics; Hypergeometric distribution; Order (exchange); Combinatorial analysis; Hypergeometric function; Basic hypergeometric series; Combinatorics; Generalized hypergeometric function; Discrete mathematics; Pure mathematics","score_opus":0.04607739107835068,"score_gpt":0.2513396514244652,"score_spread":0.2052622603461145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404204827","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.1029982,0.0002659273,0.8916119,0.0007376427,0.00077390793,0.00015837442,0.000007919747,0.00022022553,0.0032259559],"genre_scores_gemma":[0.9857305,0.000005202496,0.0137160905,0.000050732346,0.00007600676,0.000018335617,0.0000059009612,0.000010272372,0.00038690303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991097,0.00002384387,0.00019504958,0.0002785071,0.00022575601,0.0001671354],"domain_scores_gemma":[0.99903923,0.0006005608,0.00003920538,0.00022612224,0.000022391596,0.00007250385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016095198,0.00013571532,0.00015085145,0.00020052659,0.00008515659,0.00040037069,0.00028433022,0.000045631212,0.000021220023],"category_scores_gemma":[0.00014684878,0.00010579274,0.000043569038,0.0006731166,0.000037172067,0.0001859782,0.00016202,0.00012165702,0.000060026072],"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":[7.780828e-7,0.00004077071,0.000002835108,0.00011557501,0.000016173624,0.0000027642698,0.0017210031,0.000042930762,0.00004167678,0.97730505,0.000115672934,0.02059475],"study_design_scores_gemma":[0.000119507946,0.00006242561,0.000118318676,0.00004842849,0.000008780462,0.00000535121,0.000046844718,0.5700325,0.0001280612,0.4291236,0.00017258251,0.00013360748],"about_ca_topic_score_codex":0.0000022383076,"about_ca_topic_score_gemma":8.114561e-7,"teacher_disagreement_score":0.88273233,"about_ca_system_score_codex":0.000022435528,"about_ca_system_score_gemma":0.00004480024,"threshold_uncertainty_score":0.43141025},"labels":[],"label_agreement":null},{"id":"W4404738330","doi":"10.1016/j.disc.2024.114334","title":"Caps and wickets","year":2024,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.02655525774016084,"score_gpt":0.3126294069531486,"score_spread":0.2860741492129878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404738330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9002272,0.0028237044,0.01711153,0.00044591038,0.0008381187,0.0004770836,0.00005409151,0.00074571196,0.077276655],"genre_scores_gemma":[0.96411216,0.0000830995,0.033493094,0.00006661163,0.00014172218,0.000014687099,0.0000034115367,0.00006232491,0.0020229071],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903786,0.000027147837,0.0002732067,0.00022617527,0.0002118679,0.00022371928],"domain_scores_gemma":[0.9990052,0.0005011139,0.000041710835,0.000346837,0.000021995165,0.000083118524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003333902,0.00019118216,0.00023805969,0.0000897066,0.00015080956,0.00012328467,0.00014975376,0.000088214074,0.00014356116],"category_scores_gemma":[0.00019406134,0.00013293879,0.00009127103,0.00013005243,0.00014984963,0.000104654115,0.00014678085,0.00017350176,0.000023109314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018257715,0.000012529057,0.0000249954,0.00083091,0.000062139676,0.000024854897,0.006106775,1.8237024e-7,0.00011454369,0.9887763,0.0024602874,0.0015846465],"study_design_scores_gemma":[0.00008316956,0.000022661428,0.000034807792,0.00021316162,0.0000809658,0.00009033701,0.0005923806,0.0023247858,0.00035117922,0.99232,0.0036936703,0.00019285284],"about_ca_topic_score_codex":0.0000014417006,"about_ca_topic_score_gemma":0.0000019473268,"teacher_disagreement_score":0.07525375,"about_ca_system_score_codex":0.000014109363,"about_ca_system_score_gemma":0.000014289678,"threshold_uncertainty_score":0.54210865},"labels":[],"label_agreement":null},{"id":"W4405493072","doi":"10.1016/j.disc.2024.114364","title":"The intersection density of non-quasiprimitive groups of degree 3p","year":2024,"lang":"en","type":"article","venue":"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":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; University of Regina","funders":"","keywords":"Mathematics; Degree (music); Intersection (aeronautics); Combinatorics; Discrete mathematics","score_opus":0.07298299375134096,"score_gpt":0.35644083075092725,"score_spread":0.28345783699958627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405493072","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87915117,0.00014309314,0.09891949,0.000116507574,0.00029811542,0.00060371903,0.000043497515,0.00009821122,0.020626178],"genre_scores_gemma":[0.98767453,0.00003257973,0.011515452,0.000004536349,0.000058544476,0.000025831385,0.000004641552,0.00005582037,0.000628038],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811983,0.00012675505,0.00068261323,0.00021740104,0.00055976363,0.00029365884],"domain_scores_gemma":[0.9953507,0.003469595,0.00022350898,0.0006735107,0.00022347152,0.000059195536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017411776,0.00020177575,0.00040463096,0.00011858697,0.00010803241,0.000062294996,0.00043111737,0.000107210064,0.000055344783],"category_scores_gemma":[0.0013026176,0.0001314842,0.00025349515,0.00041144722,0.00040947943,0.00012102265,0.00024177332,0.00031978116,0.00004582113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006800504,0.00014831497,0.000089429486,0.002845124,0.0002941213,0.00001332801,0.013872848,0.0000015924725,0.0083246725,0.96988565,0.0009781678,0.0034787592],"study_design_scores_gemma":[0.00024597676,0.00025207334,0.00030268426,0.0010248323,0.00016156906,0.00003809625,0.00975899,0.020900004,0.04355006,0.9234589,0.00009226291,0.00021456782],"about_ca_topic_score_codex":0.000011945497,"about_ca_topic_score_gemma":0.000038049988,"teacher_disagreement_score":0.10852337,"about_ca_system_score_codex":0.000081047976,"about_ca_system_score_gemma":0.00006625531,"threshold_uncertainty_score":0.536177},"labels":[],"label_agreement":null},{"id":"W4405695073","doi":"10.1016/j.disc.2024.114372","title":"Existential closure in uniform hypergraphs","year":2024,"lang":"en","type":"article","venue":"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":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Closure (psychology); Combinatorics; Discrete mathematics; Hypergraph; Existentialism","score_opus":0.02157182862074907,"score_gpt":0.305390688148636,"score_spread":0.28381885952788694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405695073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045381445,0.000776561,0.8989568,0.00089361914,0.00050734554,0.00041508395,0.000012356455,0.000569992,0.0524868],"genre_scores_gemma":[0.87018853,0.00008216868,0.12810746,0.000047192487,0.00005847257,0.00004184497,0.000005396248,0.00003608833,0.0014328632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860394,0.000040959683,0.0002847794,0.00032125993,0.00038414856,0.00036488523],"domain_scores_gemma":[0.99906826,0.00017783868,0.000028990871,0.00061350345,0.00003154585,0.00007987784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050839013,0.00014826974,0.00017590789,0.0003663635,0.0000536342,0.00027783008,0.0008561643,0.000059979448,0.00003237694],"category_scores_gemma":[0.000057433033,0.00011885192,0.00011622634,0.001189763,0.000083564424,0.00048639436,0.00028418176,0.00025972349,0.00016981422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019645734,0.00003016396,0.000058282378,0.00017753404,0.000014280639,0.00010378494,0.0015007209,0.000044626737,0.0002444314,0.9943591,0.0001231384,0.0033420022],"study_design_scores_gemma":[0.00017355799,0.000053113417,0.00007480808,0.00021177623,0.000005654516,0.00004995274,0.0002782355,0.14629,0.0007926503,0.848098,0.00373896,0.00023332142],"about_ca_topic_score_codex":0.000003878826,"about_ca_topic_score_gemma":0.000012050146,"teacher_disagreement_score":0.82480705,"about_ca_system_score_codex":0.000037295013,"about_ca_system_score_gemma":0.000057425812,"threshold_uncertainty_score":0.48466408},"labels":[],"label_agreement":null},{"id":"W4406171432","doi":"10.1016/j.disc.2024.114383","title":"The sandwich problem for odd-hole-free and even-hole-free graphs","year":2025,"lang":"en","type":"article","venue":"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":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.016880662444144736,"score_gpt":0.29887521204873435,"score_spread":0.28199454960458964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406171432","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.0031639442,0.0010911309,0.97321063,0.0066036656,0.00014010447,0.0015389064,0.000055239758,0.00023192649,0.013964442],"genre_scores_gemma":[0.12457051,0.0003969123,0.8612801,0.00053903356,0.00008683137,0.0011586446,0.000014099371,0.00010230988,0.011851597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979937,0.000086902946,0.00043800657,0.00046236176,0.0004278239,0.0005912218],"domain_scores_gemma":[0.995728,0.0014585977,0.00014255356,0.002379804,0.00017900561,0.000112045236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012601749,0.0002501998,0.0002933441,0.00016565934,0.0006617934,0.00045218877,0.0032623776,0.00008314878,0.0000023037192],"category_scores_gemma":[0.00082355435,0.00016777987,0.00014094694,0.00069783017,0.00032497742,0.00029981174,0.0016579248,0.00023503802,0.000006514295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017668634,0.000037272333,0.00004502667,0.00023921512,0.000052957705,0.000001911954,0.0005215137,0.000021933995,0.00023199107,0.98768306,0.004144578,0.0070028943],"study_design_scores_gemma":[0.0008741958,0.00008343095,0.00005949127,0.00013009449,0.000019634226,0.0000046281057,0.00043628397,0.027951224,0.0008229837,0.9634593,0.005961866,0.0001968508],"about_ca_topic_score_codex":0.0000027969402,"about_ca_topic_score_gemma":0.000026895497,"teacher_disagreement_score":0.12140656,"about_ca_system_score_codex":0.00002927861,"about_ca_system_score_gemma":0.00007770991,"threshold_uncertainty_score":0.68418646},"labels":[],"label_agreement":null},{"id":"W4408707386","doi":"10.1016/j.disc.2025.114487","title":"Combinatorics on words and generating Dirichlet series of automatic sequences","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS","keywords":"Mathematics; Combinatorics; Series (stratigraphy); Dirichlet distribution; Dirichlet series; Discrete mathematics","score_opus":0.011094295410950547,"score_gpt":0.2498030594622259,"score_spread":0.23870876405127534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408707386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.652684,0.0004587076,0.3357573,0.0008336882,0.0003280818,0.00023610644,0.0000076242786,0.00026945074,0.009425058],"genre_scores_gemma":[0.91309166,0.000031784537,0.08624901,0.00014859455,0.000010758942,0.000012453472,0.0000015965165,0.0000075804705,0.00044656466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990717,0.000044384487,0.00032462826,0.00019412341,0.00020365427,0.0001614804],"domain_scores_gemma":[0.99906546,0.0002693267,0.00015180322,0.00044355995,0.00003464447,0.00003522314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034204504,0.00014137056,0.00025937814,0.00010115908,0.000109186825,0.00013252946,0.0004451715,0.00004638369,0.000005093172],"category_scores_gemma":[0.00012926207,0.00011033671,0.000041387942,0.0003667736,0.00009898231,0.0002253454,0.00022281888,0.000077225464,0.0000032205721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.833295e-7,0.000041053932,0.00016691575,0.00034730462,0.000021782915,0.0000032585128,0.0021738394,0.00003757169,0.0007884375,0.9926716,0.000104112805,0.0036434482],"study_design_scores_gemma":[0.000217509,0.00011353916,0.00030265533,0.0005799649,0.000019640636,0.000011570821,0.0010882841,0.41830987,0.009739623,0.5693039,0.000103393235,0.0002100467],"about_ca_topic_score_codex":0.0000032259238,"about_ca_topic_score_gemma":9.0179515e-7,"teacher_disagreement_score":0.4233677,"about_ca_system_score_codex":0.000016942535,"about_ca_system_score_gemma":0.000036502854,"threshold_uncertainty_score":0.44994003},"labels":[],"label_agreement":null},{"id":"W4408911910","doi":"10.1016/j.disc.2025.114501","title":"Quaternary Legendre pairs II","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Austrian Science Fund","keywords":"Mathematics; Combinatorics; Quaternary; Legendre polynomials; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.028610582531910733,"score_gpt":0.3253448939372837,"score_spread":0.296734311405373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408911910","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.25788704,0.0004555587,0.47216645,0.0022711891,0.0030472393,0.0024230331,0.000063832755,0.0021170476,0.2595686],"genre_scores_gemma":[0.64751214,0.000046163248,0.31970385,0.00029408254,0.00025498064,0.0002349405,0.000019157078,0.00021167869,0.031723015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729323,0.00007183192,0.0010126915,0.00044715567,0.0005715759,0.0006035273],"domain_scores_gemma":[0.9970233,0.00087266194,0.00037269664,0.001429937,0.00016577725,0.0001356565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057471514,0.0004931474,0.000805807,0.00022809277,0.00040059493,0.00008082879,0.0007935659,0.00021634094,0.00017084695],"category_scores_gemma":[0.0013148154,0.00043303115,0.00028100278,0.00056072156,0.00014764005,0.00023128279,0.00059268536,0.00035622218,0.000112417125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012196838,0.00039053842,0.000054997312,0.00093712186,0.00013343616,0.000017840435,0.0019001905,0.000007728271,0.00041180468,0.98724294,0.008428449,0.00046276874],"study_design_scores_gemma":[0.00069175777,0.000080101105,0.000007696284,0.0005173651,0.00015422344,0.000017250986,0.001317742,0.00312112,0.004048361,0.9846972,0.0049090134,0.00043813864],"about_ca_topic_score_codex":0.0000039825713,"about_ca_topic_score_gemma":0.000004735987,"teacher_disagreement_score":0.3896251,"about_ca_system_score_codex":0.00014788898,"about_ca_system_score_gemma":0.00009658055,"threshold_uncertainty_score":0.9998121},"labels":[],"label_agreement":null},{"id":"W4409115157","doi":"10.1016/j.disc.2025.114500","title":"The graph of a family of functions over quadratic extensions of finite fields","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Finite field; Quadratic equation; Combinatorics; Graph; Discrete mathematics; Finite graph","score_opus":0.0159986512985675,"score_gpt":0.26208359964935496,"score_spread":0.24608494835078745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409115157","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.092671536,0.00021623485,0.8993612,0.00022873352,0.00017629181,0.00012800391,0.000009951072,0.000024685956,0.0071833576],"genre_scores_gemma":[0.9885593,0.000043416607,0.0110942535,0.00005453501,0.000003891138,0.000008648298,7.2616933e-7,0.0000033921528,0.00023182083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991744,0.000049339073,0.00039876185,0.00010446992,0.00016675027,0.00010627966],"domain_scores_gemma":[0.99784297,0.0011103301,0.00020067857,0.00071886275,0.00010762359,0.000019519131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033725123,0.00008210375,0.0002022773,0.00012922719,0.000102222584,0.000017826484,0.00050842704,0.00004081071,0.000006460079],"category_scores_gemma":[0.00018610327,0.000054628716,0.00018927864,0.00072886836,0.00017174697,0.00006366154,0.0001574446,0.00007621345,0.0000010465745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006094487,0.00007730763,0.00011256557,0.00015056944,0.000063271145,2.7136113e-7,0.0012611165,0.00010812415,0.0013932887,0.9950852,0.0005118681,0.0012303444],"study_design_scores_gemma":[0.0002405257,0.00013672441,0.0018440612,0.00039772113,0.0000864931,9.108661e-7,0.0013412939,0.031544853,0.0031004716,0.96082455,0.0003695528,0.00011284174],"about_ca_topic_score_codex":0.000008128338,"about_ca_topic_score_gemma":0.000008158566,"teacher_disagreement_score":0.8958878,"about_ca_system_score_codex":0.000002327217,"about_ca_system_score_gemma":0.000038370177,"threshold_uncertainty_score":0.22276942},"labels":[],"label_agreement":null},{"id":"W4411279523","doi":"10.1016/j.disc.2025.114644","title":"Hopping forcing number in random d-regular graphs","year":2025,"lang":"en","type":"article","venue":"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":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Forcing (mathematics); Discrete mathematics; Random graph; Graph; Mathematical analysis","score_opus":0.014393945943673759,"score_gpt":0.3071972158539919,"score_spread":0.29280326991031813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411279523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03733744,0.000108971966,0.93783027,0.00040809566,0.00011116306,0.0003464895,0.0000011974837,0.0001255173,0.023730826],"genre_scores_gemma":[0.81686866,0.000027815347,0.18150839,0.00015891546,0.0000115474695,0.00007327719,0.0000020726163,0.000019168838,0.0013301483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850357,0.0000895806,0.00037410352,0.00031657613,0.00029753995,0.00041864763],"domain_scores_gemma":[0.99859726,0.00043953207,0.00007532927,0.0007743154,0.000055584762,0.00005799155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084243267,0.00016089996,0.00029321155,0.00028628163,0.00011478688,0.00014811574,0.00094975124,0.00005951735,0.000014986283],"category_scores_gemma":[0.0002448423,0.00014110436,0.00011408306,0.001250857,0.00008481391,0.0003844292,0.0004126573,0.00021072823,0.000039766226],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008174846,0.00003329079,0.000823646,0.0001300023,0.000018641626,0.000014497882,0.0010057734,0.00017603283,0.0005174471,0.9949773,0.00007667687,0.0022185396],"study_design_scores_gemma":[0.0009898343,0.00000811184,0.00015971919,0.00029089686,0.0000051979464,0.0000060277157,0.0002845575,0.06876132,0.0020358788,0.9269892,0.00030045898,0.00016882096],"about_ca_topic_score_codex":0.000005328381,"about_ca_topic_score_gemma":0.000008540164,"teacher_disagreement_score":0.77953124,"about_ca_system_score_codex":0.000045546472,"about_ca_system_score_gemma":0.000056129174,"threshold_uncertainty_score":0.5754069},"labels":[],"label_agreement":null},{"id":"W4411496001","doi":"10.1016/j.disc.2025.114646","title":"Out of the parking lot and into the forest: Parking functions, bond lattices, and unimodal forests","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"National Science Foundation","keywords":"Mathematics; Parking lot; Combinatorics; Engineering; Civil engineering","score_opus":0.026799152434090825,"score_gpt":0.30541797029131035,"score_spread":0.27861881785721954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411496001","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.15006681,0.0009481961,0.84193766,0.0012746854,0.00036154847,0.0007310055,0.000032430267,0.000053362568,0.00459428],"genre_scores_gemma":[0.9688976,0.000038690407,0.030348172,0.0000965149,0.00002977977,0.00004021108,0.0000019912327,0.000025496045,0.0005215517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987937,0.000037383183,0.00045958871,0.00021221013,0.00026832186,0.00022879553],"domain_scores_gemma":[0.99721944,0.0019655363,0.00023971118,0.0004406718,0.000083390994,0.000051254763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048433326,0.00019897164,0.00032202687,0.00004502121,0.00033431491,0.00008883898,0.00026484733,0.00008457472,0.0000060265843],"category_scores_gemma":[0.0018685668,0.00011010551,0.000061859304,0.00019548733,0.00023869153,0.000059692255,0.0003449641,0.00020051698,0.0000012238845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013639831,0.00003886154,0.001051165,0.001255694,0.00007836007,0.0000010111678,0.0050310073,0.0000059727618,0.000040125753,0.9895674,0.00037944666,0.0025372955],"study_design_scores_gemma":[0.0002855761,0.000038893246,0.0007252297,0.0006028379,0.0002813157,0.0000068185022,0.0027306036,0.04358378,0.00010114401,0.95077115,0.00073944376,0.00013322565],"about_ca_topic_score_codex":0.000017211309,"about_ca_topic_score_gemma":0.00046190328,"teacher_disagreement_score":0.8188308,"about_ca_system_score_codex":0.000019818954,"about_ca_system_score_gemma":0.00005156284,"threshold_uncertainty_score":0.44899723},"labels":[],"label_agreement":null},{"id":"W4411673352","doi":"10.1016/j.disc.2025.114648","title":"The forb-flex method for odd coloring and proper conflict-free coloring of planar graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Combinatorics Foundation; National Research Foundation of Korea; Ministry of Education; University of Wyoming; Division of Mathematical Sciences; National Science Foundation","keywords":"Mathematics; Combinatorics; Graph coloring; Discrete mathematics; List coloring; Chordal graph; Graph; Line graph","score_opus":0.03852087644603635,"score_gpt":0.35095695988294967,"score_spread":0.3124360834369133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411673352","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.006006851,0.0003813631,0.9872171,0.0007526301,0.00010184067,0.0009637808,0.0000125928045,0.00006287959,0.0045009176],"genre_scores_gemma":[0.030308526,0.00011295812,0.96731967,0.000078552206,0.000016305472,0.00034771248,0.0000014278943,0.00002443467,0.0017904384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998669,0.00007541446,0.00036753362,0.0002752171,0.0002572594,0.00035557157],"domain_scores_gemma":[0.9966884,0.0020366698,0.00014359105,0.0009172452,0.00015454943,0.000059489506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014526116,0.00015145447,0.00028131367,0.00012912317,0.00034823333,0.00013828129,0.0013362597,0.00005266415,7.913499e-7],"category_scores_gemma":[0.0006946278,0.00009938,0.00008892274,0.0004208443,0.00020537742,0.00019174613,0.00054949714,0.00013458531,7.0437e-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.000030142655,0.000017452376,0.000054726403,0.000307134,0.00006186887,9.288909e-7,0.0011769119,0.000019566698,0.001497337,0.99255127,0.00019158947,0.0040910793],"study_design_scores_gemma":[0.00059980515,0.00012811471,0.00007480405,0.00014355444,0.000024213554,0.000005102851,0.00074662786,0.06152327,0.01376019,0.91749513,0.005354512,0.00014468493],"about_ca_topic_score_codex":0.0000047547205,"about_ca_topic_score_gemma":0.0000081290955,"teacher_disagreement_score":0.07505614,"about_ca_system_score_codex":0.000021956397,"about_ca_system_score_gemma":0.000055562923,"threshold_uncertainty_score":0.40525988},"labels":[],"label_agreement":null},{"id":"W4412018875","doi":"10.1016/j.disc.2025.114668","title":"Proportion of blocking curves in a pencil","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Pencil (optics); Blocking (statistics); Combinatorics; Discrete mathematics; Statistics; Physics; Optics","score_opus":0.05819766605879346,"score_gpt":0.38512914693829836,"score_spread":0.3269314808795049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412018875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82375807,0.00057689945,0.05001186,0.0009561787,0.00008743935,0.0015491955,0.000014840431,0.00012645948,0.12291908],"genre_scores_gemma":[0.97868866,0.00006869248,0.01618716,0.000044120083,0.000012599368,0.00004873205,0.0000043869163,0.000025683397,0.004919946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829596,0.00007825306,0.00070044235,0.000181567,0.0004863283,0.00025746715],"domain_scores_gemma":[0.99859256,0.0005115225,0.00021548592,0.0004924793,0.00015181373,0.00003615572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015172972,0.00014254768,0.00042917323,0.00021742856,0.000034683904,0.00001474744,0.0003032965,0.000067232104,0.00016375909],"category_scores_gemma":[0.0020372204,0.000118989774,0.000101401674,0.000588138,0.00012110623,0.00007534564,0.00014395901,0.00018353117,0.0000130635235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019064946,0.0004047569,0.004115401,0.008953684,0.00008616928,0.000013055641,0.0017572675,0.000005499163,0.0008833244,0.98173946,0.0015597225,0.00046257005],"study_design_scores_gemma":[0.00039476057,0.000027279732,0.00028143887,0.0038842366,0.00007737945,0.0000052280534,0.0014526405,0.005676579,0.0042330497,0.9837283,0.000086386826,0.00015271835],"about_ca_topic_score_codex":0.0000150119895,"about_ca_topic_score_gemma":0.000031840977,"teacher_disagreement_score":0.15493064,"about_ca_system_score_codex":0.00007337611,"about_ca_system_score_gemma":0.00012484564,"threshold_uncertainty_score":0.4852262},"labels":[],"label_agreement":null},{"id":"W4412429706","doi":"10.1016/j.disc.2025.114680","title":"On optimal placement delivery arrays","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Combinatorics; Discrete mathematics; Mathematical optimization","score_opus":0.013573838745498203,"score_gpt":0.2442872188727287,"score_spread":0.2307133801272305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412429706","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.08833839,0.000061318744,0.8820942,0.0006244673,0.00031849043,0.00014100953,0.000003415263,0.00018714632,0.028231585],"genre_scores_gemma":[0.9509591,0.000015945318,0.04330402,0.0011228141,0.000029235322,0.000025675572,0.0000044096164,0.000010582433,0.0045282333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990587,0.000024444822,0.00021460112,0.0002485434,0.00024219768,0.00021146968],"domain_scores_gemma":[0.999084,0.00016832567,0.000058631067,0.00060207484,0.000039504775,0.000047459394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001899626,0.00014098162,0.00016131048,0.00010960237,0.00012157421,0.0001625695,0.0006077985,0.000040161525,0.000014265866],"category_scores_gemma":[0.00004892775,0.00011862206,0.000097926444,0.00018453819,0.000023763498,0.0001225049,0.00021908557,0.00012246692,0.000125233],"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.00001240574,0.0001568328,0.000014023659,0.00007528703,0.00006392231,0.000021317566,0.00090422324,0.003866656,0.000669042,0.9831163,0.008050466,0.0030495063],"study_design_scores_gemma":[0.0007353532,0.00017095637,0.000033815417,0.00040429126,0.000037131278,0.000009460037,0.0005373223,0.9552825,0.002425976,0.038227495,0.0017421873,0.00039350003],"about_ca_topic_score_codex":0.0000051862417,"about_ca_topic_score_gemma":9.1726304e-7,"teacher_disagreement_score":0.95141584,"about_ca_system_score_codex":0.00004830938,"about_ca_system_score_gemma":0.00004035776,"threshold_uncertainty_score":0.48372674},"labels":[],"label_agreement":null},{"id":"W4412720278","doi":"10.1016/j.disc.2025.114687","title":"The e-positivity of the chromatic symmetric function for twinned paths and cycles","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Combinatorics Foundation; National Security Agency; National Sleep Foundation; Danmarks Frie Forskningsfond; National Science Foundation","keywords":"Mathematics; Chromatic scale; Combinatorics; Function (biology); Symmetric function; Discrete mathematics","score_opus":0.017250909404816297,"score_gpt":0.2997031027622832,"score_spread":0.2824521933574669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412720278","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.48313892,0.0009986758,0.4938661,0.0017316971,0.0019924166,0.005661282,0.00008336938,0.00027797007,0.012249583],"genre_scores_gemma":[0.96857905,0.00003815953,0.030142823,0.00005003885,0.000052094703,0.00024487672,0.000002071841,0.00005455879,0.00083629735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981796,0.00010643417,0.00078393775,0.00023440827,0.00037101217,0.0003246174],"domain_scores_gemma":[0.9921694,0.006047725,0.00058792834,0.00094996585,0.00019973132,0.00004525655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009734842,0.000279267,0.00051323685,0.00009984602,0.00053457,0.00008571216,0.00048251747,0.000120362936,0.0000022048782],"category_scores_gemma":[0.004540941,0.00015800828,0.0002206855,0.0006435389,0.00027675563,0.000106467305,0.00027753352,0.00017031707,0.0000012796286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023569764,0.00013465734,0.000061972525,0.0017572471,0.00013325523,1.7364367e-7,0.00054546015,0.000003352326,0.0008320005,0.9941857,0.0005642781,0.0017583282],"study_design_scores_gemma":[0.00061983924,0.00007717297,0.00029358317,0.0004954694,0.0003567945,0.0000038058636,0.0009357614,0.005297848,0.003042069,0.9884116,0.00030189546,0.00016415914],"about_ca_topic_score_codex":0.0000019433744,"about_ca_topic_score_gemma":0.000008841525,"teacher_disagreement_score":0.48544016,"about_ca_system_score_codex":0.00006705675,"about_ca_system_score_gemma":0.000064440894,"threshold_uncertainty_score":0.644339},"labels":[],"label_agreement":null},{"id":"W4412806721","doi":"10.1016/j.disc.2025.114705","title":"Linear independence over naturally-ordered semirings with applications to dimension arguments in extremal combinatorics","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Dimension (graph theory); Combinatorics; Extremal combinatorics; Independence (probability theory); Algebraic combinatorics; Enumerative combinatorics; Discrete mathematics; Statistics","score_opus":0.008895538497888881,"score_gpt":0.2632374750934048,"score_spread":0.2543419365955159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412806721","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.23612824,0.000053359836,0.7614517,0.00064633327,0.000087263856,0.0005368967,0.0000019769036,0.00010141181,0.0009927641],"genre_scores_gemma":[0.9248166,0.000004977777,0.07432206,0.0002939718,0.000011806538,0.000076226956,0.000004678565,0.000008521477,0.00046117033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884605,0.00001925448,0.00027429694,0.00032225694,0.0003132527,0.00022490893],"domain_scores_gemma":[0.99925536,0.00010144751,0.00008906296,0.00041032772,0.00007316363,0.00007066746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016110243,0.00015233953,0.00018427554,0.00017936582,0.00008883672,0.000092013586,0.0005375377,0.00006128152,0.000003131045],"category_scores_gemma":[0.00003211004,0.0001255899,0.00003006356,0.00091226003,0.000021554046,0.00023349609,0.00034718562,0.0001678448,0.000023804543],"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.000030006371,0.0005387467,0.0036422259,0.00032498842,0.000052728858,0.000023092922,0.004214019,0.002330048,0.003080367,0.96421736,0.00047981812,0.021066617],"study_design_scores_gemma":[0.0023460838,0.00020478114,0.017657606,0.0010613468,0.000035744164,0.000018437453,0.00028312558,0.62782156,0.0074554384,0.33999175,0.0021791372,0.00094495673],"about_ca_topic_score_codex":0.000021470472,"about_ca_topic_score_gemma":0.00001903208,"teacher_disagreement_score":0.68868834,"about_ca_system_score_codex":0.00007644425,"about_ca_system_score_gemma":0.00007095788,"threshold_uncertainty_score":0.51214075},"labels":[],"label_agreement":null},{"id":"W4413431503","doi":"10.1016/j.disc.2025.114746","title":"Oriented colouring graphs of bounded degree and degeneracy","year":2025,"lang":"en","type":"article","venue":"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":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Illinois at Urbana-Champaign","keywords":"Mathematics; Degree (music); Bounded function; Degeneracy (biology); Combinatorics; Discrete mathematics","score_opus":0.02541250570613969,"score_gpt":0.3095260943351586,"score_spread":0.2841135886290189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413431503","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.30612975,0.00021987346,0.6884275,0.00014841055,0.00006588355,0.0001975369,0.0000032099001,0.00006379437,0.004743999],"genre_scores_gemma":[0.7006484,0.00003580337,0.29870287,0.000039575483,0.0000042843685,0.000018363422,0.0000013182159,0.000009134243,0.0005402252],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989857,0.000047182708,0.00028104868,0.00022609757,0.00022934939,0.00023059342],"domain_scores_gemma":[0.9988856,0.00027596715,0.00009957138,0.00057256914,0.00010684301,0.000059487425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035419603,0.0001157434,0.00021373975,0.00021778747,0.00011721196,0.00006275719,0.00053517555,0.000040018487,0.0000041105027],"category_scores_gemma":[0.00020442544,0.00009908928,0.000053599797,0.00070204365,0.00017248253,0.00020846903,0.0004506575,0.00010483896,0.0000025715258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005062276,0.000035686335,0.00058718637,0.00016004671,0.000027472659,0.000003210135,0.00064175006,0.000008236459,0.0018999514,0.9939054,0.000030391744,0.0026956105],"study_design_scores_gemma":[0.00039789974,0.00004929123,0.0007110145,0.00014340426,0.000012965252,0.000006576421,0.00024315744,0.024810512,0.023304569,0.94994,0.00024465017,0.00013594882],"about_ca_topic_score_codex":0.0000031605232,"about_ca_topic_score_gemma":0.0000060001644,"teacher_disagreement_score":0.39451864,"about_ca_system_score_codex":0.000016320184,"about_ca_system_score_gemma":0.000045997265,"threshold_uncertainty_score":0.40407437},"labels":[],"label_agreement":null},{"id":"W4413575656","doi":"10.1016/j.disc.2025.114741","title":"Murnaghan–Nakayama rules for symplectic, orthogonal and orthosymplectic Schur functions","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Symplectic geometry; Symplectic matrix; Algebra over a field; Combinatorics; Pure mathematics; Symplectic representation; Moment map","score_opus":0.029620420704520867,"score_gpt":0.3373833707304011,"score_spread":0.3077629500258802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413575656","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.16251771,0.0003266398,0.814822,0.0008551107,0.0010707751,0.0023925886,0.00014859035,0.00060760864,0.017258937],"genre_scores_gemma":[0.4201039,0.000085331434,0.56147194,0.0003201827,0.0003787379,0.0014662972,0.00008925014,0.00034733952,0.015736986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972964,0.000068453926,0.0010074631,0.00055971585,0.00040444153,0.000663524],"domain_scores_gemma":[0.99501973,0.003164298,0.00041427222,0.00087401515,0.00035478815,0.00017291527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006778435,0.0005277805,0.0008465198,0.0003290025,0.0005956684,0.00020264181,0.000382707,0.00023063364,0.000064665146],"category_scores_gemma":[0.0040542902,0.00047954143,0.00026506197,0.0005264233,0.00019671633,0.0002576337,0.00025882802,0.00031502932,0.000031254942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003229287,0.00026953232,0.00026315043,0.0016786632,0.00023520274,0.0000030116785,0.0005122496,0.0000067769283,0.00025754346,0.99325067,0.002731786,0.00075913174],"study_design_scores_gemma":[0.0012938182,0.00013298116,0.00006560191,0.00044711801,0.00046203437,0.000040564802,0.0009187147,0.005532662,0.0005742158,0.9867996,0.003254399,0.00047831124],"about_ca_topic_score_codex":0.0000025745321,"about_ca_topic_score_gemma":0.000032111777,"teacher_disagreement_score":0.25758618,"about_ca_system_score_codex":0.00013327495,"about_ca_system_score_gemma":0.00014171806,"threshold_uncertainty_score":0.99976563},"labels":[],"label_agreement":null},{"id":"W4413947799","doi":"10.1016/j.disc.2025.114767","title":"On connections between association schemes and analyses of polyhedral and positive semidefinite lift-and-project relaxations","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Saskatchewan","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Lift (data mining); Association scheme; Combinatorics; Association (psychology); Discrete mathematics; Computer science; Data mining","score_opus":0.03317771164768675,"score_gpt":0.3412643082010908,"score_spread":0.3080865965534041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413947799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52903026,0.00019376176,0.4680871,0.0009671738,0.00004375932,0.0001490009,0.00003909012,0.00003410306,0.001455724],"genre_scores_gemma":[0.96412903,0.00004463985,0.03541834,0.00007741594,0.000016519685,0.000007247759,0.000023913515,0.0000032753146,0.00027960291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933076,0.000049050752,0.00022402313,0.00017076217,0.00014135754,0.0000840193],"domain_scores_gemma":[0.9985526,0.0010354377,0.00016785032,0.000117202166,0.00010015543,0.000026707503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022011211,0.00008716206,0.00016703428,0.00024128126,0.00016127454,0.00009599462,0.00006597681,0.000050891013,0.0000010317767],"category_scores_gemma":[0.00045541744,0.00007915604,0.0000287056,0.00045252944,0.00003287906,0.00017356765,0.000088676155,0.00007004925,7.8659576e-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.000004246194,0.000048178706,0.00558484,0.00009058193,0.00021253416,4.1313342e-7,0.001963786,0.0002241781,0.0013597244,0.98629194,0.00020671835,0.00401286],"study_design_scores_gemma":[0.0013874025,0.00042941704,0.11735008,0.00059058773,0.00051360915,0.000011190058,0.00095460104,0.32855648,0.022020647,0.52733576,0.00027354644,0.0005766458],"about_ca_topic_score_codex":0.000021386708,"about_ca_topic_score_gemma":0.0000041501594,"teacher_disagreement_score":0.45895615,"about_ca_system_score_codex":0.000024894758,"about_ca_system_score_gemma":0.000043893357,"threshold_uncertainty_score":0.32278895},"labels":[],"label_agreement":null},{"id":"W4414402051","doi":"10.1016/j.disc.2025.114798","title":"Hamiltonicity of transitive graphs whose automorphism group has <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.svg\"> <mml:msub> <mml:mrow> <mml:mi mathvariant=\"double-struck\">Z</mml:mi> </mml:mrow> <mml:mrow> <mml:mi>p</mml:mi> </mml:mrow> </mml:msub> </mml:math> as commutator subgroups","year":2025,"lang":"lv","type":"article","venue":"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":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Lethbridge","funders":"","keywords":"Commutator subgroup; Transitive relation; Automorphism; Automorphism group; Prime (order theory); Commutator; Cayley graph; Graph automorphism","score_opus":0.030278809385671346,"score_gpt":0.2732105888983955,"score_spread":0.24293177951272416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414402051","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59830546,0.0011062297,0.0060776416,0.0010180515,0.0017688295,0.0001996133,0.0011084846,0.0004162163,0.38999945],"genre_scores_gemma":[0.9809912,0.001032115,0.011348958,0.001115996,0.0007239401,0.0014279645,0.0014037993,0.0012702068,0.0006858548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9852492,0.0010915631,0.0037501925,0.002256534,0.0041227248,0.0035297752],"domain_scores_gemma":[0.9850541,0.005167881,0.0032653583,0.004677345,0.00044422338,0.0013910905],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005278407,0.0015996415,0.0010091775,0.0011519175,0.002221125,0.0021448964,0.004089624,0.0032690968,0.19388664],"category_scores_gemma":[0.0029407525,0.002766013,0.0030144432,0.0023930648,0.004245869,0.0017817196,0.00304941,0.0032339315,0.0025894435],"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.0022611313,0.001097562,0.000011442664,0.007650338,0.0034016876,0.0017317435,0.013835719,0.00032635426,0.0037502877,0.884724,0.08046074,0.00074899185],"study_design_scores_gemma":[0.0048974617,0.0023196612,0.00006476478,0.005294233,0.0034678502,0.0015877757,0.010820371,0.12252753,0.8282954,0.0170018,0.0011020039,0.0026211387],"about_ca_topic_score_codex":0.0017149862,"about_ca_topic_score_gemma":0.0014322506,"teacher_disagreement_score":0.8677222,"about_ca_system_score_codex":0.000057296747,"about_ca_system_score_gemma":0.0024277407,"threshold_uncertainty_score":0.99967515},"labels":[],"label_agreement":null},{"id":"W4414474364","doi":"10.1016/j.disc.2025.114809","title":"On the structure of perfectly divisible graphs","year":2025,"lang":"en","type":"article","venue":"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":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clique number; Induced subgraph; Graph; Perfect graph; Divisibility rule; Bounded function; Split graph; Clique graph","score_opus":0.014469867531054576,"score_gpt":0.29108378401340207,"score_spread":0.2766139164823475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414474364","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.2999051,0.00011581068,0.67643213,0.0013928228,0.00017104168,0.00052382296,0.000020523654,0.00011013289,0.021328632],"genre_scores_gemma":[0.9803785,0.000006015908,0.019007323,0.0001518439,0.0000039878573,0.0000051092156,8.637079e-7,0.0000074596805,0.0004388912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896705,0.00007798699,0.00021053331,0.0001960183,0.0003343569,0.00021407052],"domain_scores_gemma":[0.99791133,0.0008620435,0.000085050015,0.0010368248,0.00007355214,0.00003116624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002847371,0.0001221026,0.00017326111,0.00015389289,0.00013323894,0.00006896286,0.001314899,0.000039356648,0.000036290377],"category_scores_gemma":[0.0003020697,0.00007054463,0.00009388743,0.0008297845,0.00014655857,0.0001050747,0.0003224207,0.00019080455,0.000010291102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029128225,0.00002411503,0.000041310286,0.00007100797,0.00002278796,8.44179e-7,0.0005711702,0.0000749456,0.0044728797,0.993779,0.0002720527,0.00066695415],"study_design_scores_gemma":[0.00009167559,0.000044963912,0.0000901555,0.00008602374,0.00000501878,0.000001118469,0.00012271543,0.0094914995,0.03332243,0.9566137,0.00006159353,0.00006909219],"about_ca_topic_score_codex":0.0000012776219,"about_ca_topic_score_gemma":0.0000017400116,"teacher_disagreement_score":0.6804734,"about_ca_system_score_codex":0.000012515173,"about_ca_system_score_gemma":0.000035567493,"threshold_uncertainty_score":0.28767267},"labels":[],"label_agreement":null},{"id":"W4414750135","doi":"10.1016/j.disc.2025.114822","title":"Applications of sparse hypergraph colorings","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Karlsruhe Institute of Technology","keywords":"Hypergraph; Independence number; Upper and lower bounds; Binary logarithm; Extremal combinatorics; Ramsey's theorem; Independence (probability theory)","score_opus":0.017813932260969702,"score_gpt":0.3013916045296683,"score_spread":0.28357767226869857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414750135","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3387934,0.0004402051,0.25817877,0.00034997275,0.00032516418,0.0017375904,0.0000894213,0.0003300317,0.39975542],"genre_scores_gemma":[0.9190528,0.00003642552,0.07765517,0.000077614786,0.000029251938,0.00013509886,0.0000047414637,0.000028139764,0.0029807587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988853,0.00002730164,0.00050513615,0.00018204752,0.00020329698,0.00019694498],"domain_scores_gemma":[0.9984367,0.0005127013,0.00021172958,0.0006914175,0.00010293772,0.000044549986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029558854,0.0001711188,0.00036891075,0.00018714777,0.00016369454,0.000016817035,0.00038759332,0.00009862897,0.000069974965],"category_scores_gemma":[0.00022168692,0.0001366385,0.0001731656,0.00046220396,0.00020335171,0.000048199166,0.0001746774,0.00012731132,0.000005029853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006397647,0.00008860319,0.00025419059,0.000618121,0.0000888017,5.5976545e-7,0.0008014201,0.0000015331678,0.00028137412,0.9962665,0.00079882034,0.000793681],"study_design_scores_gemma":[0.00021643056,0.000017591208,0.00008615774,0.00011426665,0.0001231627,0.000002905606,0.0007140665,0.00016270144,0.0033137295,0.98906726,0.0060503064,0.000131407],"about_ca_topic_score_codex":0.0000030641397,"about_ca_topic_score_gemma":0.0000027044525,"teacher_disagreement_score":0.5802594,"about_ca_system_score_codex":0.000016297014,"about_ca_system_score_gemma":0.000027653386,"threshold_uncertainty_score":0.5571956},"labels":[],"label_agreement":null},{"id":"W4414961962","doi":"10.1016/j.disc.2025.114832","title":"Quantum walks on join graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; University of Manitoba","keywords":"Adjacency matrix; Join (topology); Vertex (graph theory); Adjacency list; Graph; Laplacian matrix; Laplace operator","score_opus":0.010692196613908026,"score_gpt":0.2534811998179653,"score_spread":0.24278900320405727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414961962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07489926,0.00009711578,0.9020227,0.0030535294,0.0006812025,0.00021298132,0.0000045141883,0.00045752848,0.018571164],"genre_scores_gemma":[0.8134623,0.000012351778,0.18389514,0.0013443526,0.000061064035,0.000017266913,0.0000039366137,0.000023086837,0.0011804679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877673,0.000040057694,0.00028052146,0.0003338161,0.00026268268,0.00030620338],"domain_scores_gemma":[0.99878657,0.00021600345,0.000086916516,0.0008083827,0.000037181075,0.00006497014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002518029,0.00019419886,0.00023345639,0.00019050448,0.00018577056,0.0001878054,0.0008879667,0.000061247054,0.0000067394994],"category_scores_gemma":[0.000077008684,0.00014751039,0.00013133351,0.0005316276,0.00004727509,0.00006833266,0.00028303755,0.00022651539,0.000065805965],"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.0000013301578,0.000071175775,0.00001370025,0.00006839725,0.000021783613,0.000010165311,0.0007842601,0.0004892532,0.00011885241,0.98521465,0.0017259083,0.011480515],"study_design_scores_gemma":[0.00014418499,0.000054158274,0.00015824754,0.00016705407,0.000006107566,0.000005824142,0.000040260908,0.62016135,0.00052591355,0.37722477,0.0013648052,0.00014729176],"about_ca_topic_score_codex":0.000004068663,"about_ca_topic_score_gemma":7.605539e-7,"teacher_disagreement_score":0.73856306,"about_ca_system_score_codex":0.00001743065,"about_ca_system_score_gemma":0.000040000094,"threshold_uncertainty_score":0.6015299},"labels":[],"label_agreement":null},{"id":"W4415614171","doi":"10.1016/j.disc.2025.114861","title":"The weak version of the graph complement conjecture and partial results for the delta conjecture","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences; American Institute of Mathematics","keywords":"Conjecture; Complement (music); Graph; Degeneracy (biology); Rank (graph theory); Graph property; Complement graph; Graph minor","score_opus":0.025283000083536362,"score_gpt":0.29180350875645966,"score_spread":0.2665205086729233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415614171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7132292,0.004603781,0.18254659,0.06471624,0.0032583403,0.012785996,0.0026379426,0.00031205764,0.015909852],"genre_scores_gemma":[0.994173,0.00016882231,0.003857944,0.0002291846,0.000116703006,0.00010078036,0.000020780184,0.00003504793,0.0012977323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985318,0.00007739699,0.00057885825,0.00021829297,0.00030764067,0.00028599205],"domain_scores_gemma":[0.99563944,0.0030327912,0.00036573,0.00083587656,0.000091151414,0.000035030145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008504959,0.00022657841,0.00031468872,0.000031634645,0.0007657035,0.00009675245,0.00056542526,0.00008976783,0.000007688917],"category_scores_gemma":[0.0008465762,0.00009685022,0.00021296262,0.0001749455,0.00037937096,0.000035231984,0.0002512429,0.00019725,0.0000011192961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009427018,0.000055216497,0.00006322038,0.0004882566,0.00022926833,2.6955277e-7,0.002739037,0.000024598701,0.00014452758,0.9547037,0.0408316,0.0006260195],"study_design_scores_gemma":[0.0022074287,0.00010776716,0.00031307572,0.0004934413,0.000540103,0.000007629653,0.0060519343,0.0071038962,0.0072226427,0.915903,0.059807062,0.00024207584],"about_ca_topic_score_codex":0.000015855403,"about_ca_topic_score_gemma":0.00010951656,"teacher_disagreement_score":0.2809438,"about_ca_system_score_codex":0.000020988731,"about_ca_system_score_gemma":0.000051643205,"threshold_uncertainty_score":0.588925},"labels":[],"label_agreement":null},{"id":"W4415875756","doi":"10.1016/j.disc.2025.114872","title":"Hermitian adjacency matrices with at most three distinct eigenvalues","year":2025,"lang":"en","type":"article","venue":"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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Hermitian matrix; Eigenvalues and eigenvectors; Adjacency matrix; Adjacency list; Characterization (materials science); Matrix (chemical analysis)","score_opus":0.02290136173924493,"score_gpt":0.29697962776304593,"score_spread":0.274078266023801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415875756","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78304577,0.00038600157,0.0551448,0.0007950427,0.000097686105,0.0012578819,0.00013355064,0.0005289299,0.15861033],"genre_scores_gemma":[0.94047934,0.000027051614,0.050032604,0.00010219162,0.0000612174,0.00030003805,0.00004937986,0.00008492408,0.008863246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845856,0.00004265421,0.00048223848,0.00034512012,0.0003040053,0.00036739997],"domain_scores_gemma":[0.9980341,0.0006136311,0.00024341358,0.0009168174,0.00009441598,0.00009758379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032766553,0.00032246983,0.0004069439,0.00012501435,0.00044523648,0.000082688886,0.0004627325,0.000104186154,0.00027256671],"category_scores_gemma":[0.00017493044,0.00023454354,0.00012376832,0.0006459724,0.00021201106,0.00010606363,0.00017918443,0.0001664685,0.000107973756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020570462,0.00019479351,0.0020005861,0.00062140345,0.0001167099,0.000006490165,0.00066635985,0.0000029659222,0.00018217406,0.99317807,0.0024259537,0.00058395293],"study_design_scores_gemma":[0.00038559618,0.000045484234,0.00086325593,0.00037843452,0.00028317294,0.000018096523,0.0006761957,0.00059331284,0.0016313144,0.99276286,0.0020221614,0.0003401126],"about_ca_topic_score_codex":0.000007669616,"about_ca_topic_score_gemma":0.00024688235,"teacher_disagreement_score":0.15743357,"about_ca_system_score_codex":0.00005949889,"about_ca_system_score_gemma":0.000049786617,"threshold_uncertainty_score":0.9564408},"labels":[],"label_agreement":null},{"id":"W4416176824","doi":"10.1016/j.disc.2025.114860","title":"Spherical codes attached to complex weighing matrices","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Bent molecular geometry; Dimension (graph theory); RADIUS; Sequence (biology); Code (set theory); Upper and lower bounds; Order (exchange)","score_opus":0.029401637998103643,"score_gpt":0.3311629728494699,"score_spread":0.30176133485136625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416176824","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.0017507237,0.00006230044,0.94411314,0.0016546125,0.00007141511,0.00019243319,0.0000046262858,0.0008461936,0.051304556],"genre_scores_gemma":[0.14596796,0.0000023800658,0.8524852,0.00072602613,0.00001520726,0.000026899967,0.0000024899412,0.000012484582,0.00076135003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877167,0.000021779826,0.0003307555,0.00032075244,0.00027037816,0.00028467498],"domain_scores_gemma":[0.99894196,0.00015946655,0.000092267015,0.0006280589,0.00009006193,0.00008817604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023216254,0.0001795554,0.0002730484,0.0001155998,0.00011046913,0.00091630244,0.0013885574,0.000046911475,0.000010542007],"category_scores_gemma":[0.00019581908,0.00015424707,0.000068471745,0.0007794119,0.000053918553,0.00054046424,0.00082356506,0.00009609554,0.0000626264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069759685,0.0003264408,0.0003656641,0.0008284217,0.000076609766,0.00003254301,0.003257927,0.00004134178,0.0067991395,0.88724804,0.033446558,0.06757035],"study_design_scores_gemma":[0.00030749897,0.00012259242,0.0004711075,0.00085089635,0.000044711378,0.000019000536,0.00037672409,0.2895054,0.030846268,0.6543385,0.022230621,0.0008866965],"about_ca_topic_score_codex":0.000005119104,"about_ca_topic_score_gemma":0.0000014837924,"teacher_disagreement_score":0.28946403,"about_ca_system_score_codex":0.000047310208,"about_ca_system_score_gemma":0.000045861092,"threshold_uncertainty_score":0.88359255},"labels":[],"label_agreement":null},{"id":"W4416938455","doi":"10.1016/j.disc.2025.114918","title":"On subsequence sums of index-1-free sequences over cyclic groups","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Rings, Modules, and Algebras","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Subsequence; Counterexample; Generator (circuit theory); Conjecture; Order (exchange); Sequence (biology); Longest increasing subsequence","score_opus":0.02714832407634999,"score_gpt":0.2968632602162857,"score_spread":0.2697149361399357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416938455","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95469457,0.00011929523,0.014162096,0.0002607076,0.00024580673,0.00043858823,0.000046209327,0.00015216533,0.029880548],"genre_scores_gemma":[0.9862227,0.0000452865,0.011777934,0.00016852944,0.000055357144,0.000038174807,0.0000074601858,0.000047287158,0.0016373142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977282,0.00006346886,0.0008134431,0.00039124102,0.0005910055,0.00041260695],"domain_scores_gemma":[0.9970084,0.001027201,0.00040149663,0.0013839051,0.000094712595,0.000084291554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055065774,0.00035174456,0.0006498652,0.00023529047,0.000117898555,0.00006902995,0.00091093854,0.00017112831,0.0001380385],"category_scores_gemma":[0.0014264587,0.00028465388,0.00023430795,0.00043382338,0.0002985314,0.00017646574,0.00022806019,0.0002706487,0.000028989378],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017369517,0.0001642884,0.0010370841,0.0010638095,0.000103098086,0.000009613494,0.0011975566,0.000012715615,0.0016872691,0.992148,0.0023195362,0.00023965872],"study_design_scores_gemma":[0.0005395034,0.000068621324,0.0008803099,0.00083923887,0.00007979989,0.0000054469265,0.00057886506,0.0010349714,0.012125341,0.9834462,0.00011213108,0.00028957304],"about_ca_topic_score_codex":0.000037385904,"about_ca_topic_score_gemma":0.00005489513,"teacher_disagreement_score":0.031528074,"about_ca_system_score_codex":0.00007621584,"about_ca_system_score_gemma":0.00007853136,"threshold_uncertainty_score":0.99996054},"labels":[],"label_agreement":null},{"id":"W603134616","doi":"10.1016/j.disc.2015.05.002","title":"Characterization of the finite C-MH-homogeneous graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Homomorphism; Finite graph; Homogeneous; Discrete mathematics; Graph; Monomorphism; Isomorphism (crystallography); Injective function; Chemistry","score_opus":0.034794152584167154,"score_gpt":0.27989089660593613,"score_spread":0.24509674402176898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W603134616","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.23242608,0.000030227895,0.7638561,0.0003379281,0.00026507274,0.00032029068,0.000014808443,0.00007933427,0.0026701393],"genre_scores_gemma":[0.9672495,0.000010672909,0.031938225,0.00007849636,0.000018061335,0.000019081426,0.000006519307,0.00001879022,0.0006606604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883056,0.00008403725,0.00025833424,0.00016328495,0.0004654352,0.00019833013],"domain_scores_gemma":[0.99856514,0.00011844893,0.0001824257,0.0008957826,0.00015492036,0.000083266816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041399614,0.00010635668,0.0001511403,0.00007566143,0.00006544865,0.0000519719,0.0011393384,0.00003873597,0.000004369033],"category_scores_gemma":[0.00026821665,0.000069183865,0.00008287369,0.0006117848,0.00012128572,0.00021867719,0.00039525624,0.00009563554,0.00002363462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007602201,0.00009499079,0.0004176296,0.000090207766,0.000034038916,0.000005156142,0.0057009133,0.00024532416,0.028313624,0.96277773,0.00007377683,0.0022389942],"study_design_scores_gemma":[0.00030913219,0.00008112613,0.00040011035,0.00007425015,0.000012664601,0.000022194705,0.00016827961,0.05356017,0.03897584,0.90551895,0.00067098625,0.00020627645],"about_ca_topic_score_codex":0.0000011106292,"about_ca_topic_score_gemma":0.0000011629668,"teacher_disagreement_score":0.7348234,"about_ca_system_score_codex":0.000016265867,"about_ca_system_score_gemma":0.000054690852,"threshold_uncertainty_score":0.2821236},"labels":[],"label_agreement":null},{"id":"W7116654097","doi":"10.1016/j.disc.2025.114959","title":"New results in vertex sedentariness","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"University of Manitoba","keywords":"Vertex (graph theory); Bipartite graph; Graph; Neighbourhood (mathematics); Laplace operator","score_opus":0.008692868903677434,"score_gpt":0.2550048605322539,"score_spread":0.24631199162857648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116654097","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.026667744,0.000060598017,0.9519942,0.003095783,0.0004811951,0.0001501837,0.000002492012,0.00016635477,0.017381461],"genre_scores_gemma":[0.36407927,0.0000073955202,0.62953067,0.0004945484,0.00006617759,0.0000065720947,0.000006486135,0.000014999238,0.0057938863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900204,0.00002256307,0.00031052832,0.00027000156,0.00016676492,0.0002280913],"domain_scores_gemma":[0.99915415,0.000156431,0.00006166117,0.00055521785,0.00001927193,0.00005329721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021636105,0.00012804399,0.00018251169,0.00014525141,0.000055855115,0.0001386766,0.0007876323,0.000043415363,0.000004214356],"category_scores_gemma":[0.000089331246,0.00010556526,0.000051520437,0.00059179094,0.000014906346,0.00008860178,0.00037948982,0.00015350098,0.00002136402],"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.00001875064,0.0001899793,0.00041332454,0.0002686848,0.000050436625,0.00009131635,0.010420878,0.006956001,0.00021589357,0.7627804,0.016558582,0.20203573],"study_design_scores_gemma":[0.0007301514,0.00002286239,0.0014864001,0.0002824333,0.000004562378,0.000008242699,0.00006981803,0.8376032,0.0004477722,0.15648559,0.0026813105,0.00017763831],"about_ca_topic_score_codex":0.00008837949,"about_ca_topic_score_gemma":0.000038565446,"teacher_disagreement_score":0.83064723,"about_ca_system_score_codex":0.000026855976,"about_ca_system_score_gemma":0.00008892934,"threshold_uncertainty_score":0.43048263},"labels":[],"label_agreement":null},{"id":"W7116751422","doi":"10.1016/j.disc.2025.114953","title":"A new conjecture on the inertia of graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Conjecture; Adjacency matrix; Lonely runner conjecture; Graph; Collatz conjecture; Line graph","score_opus":0.025653915212671467,"score_gpt":0.30642017992593595,"score_spread":0.2807662647132645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116751422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6719497,0.0001879299,0.12851664,0.0110142315,0.00021841603,0.0020204415,0.0000799619,0.00030163786,0.18571103],"genre_scores_gemma":[0.97728676,0.0000077313425,0.018562386,0.00031931043,0.000018229512,0.00005432889,0.0000039240676,0.00002162256,0.0037256829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917316,0.000044300054,0.00034487573,0.00013410016,0.00015869694,0.00014487818],"domain_scores_gemma":[0.9978562,0.0011903,0.000162074,0.0007153738,0.000039110266,0.000036970447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029430006,0.00015215612,0.00024493085,0.00008713551,0.00010649122,0.000021553105,0.00037160717,0.00006969596,0.00017054043],"category_scores_gemma":[0.00037868673,0.00008902493,0.00015657616,0.00044437477,0.00009585349,0.000022101003,0.000056527748,0.0001565556,0.000019294757],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050864946,0.00007081515,0.000022011807,0.00013209028,0.00006610341,2.6767066e-7,0.0009635481,0.000002774445,0.0006602558,0.9842143,0.013617425,0.00024532777],"study_design_scores_gemma":[0.00016632241,0.000020185216,0.00003681461,0.00018460344,0.000085139276,0.000001334683,0.00058219384,0.00014656104,0.009611909,0.9877133,0.0013659049,0.00008572537],"about_ca_topic_score_codex":0.0000039110746,"about_ca_topic_score_gemma":0.000005112312,"teacher_disagreement_score":0.30533707,"about_ca_system_score_codex":0.0000075769026,"about_ca_system_score_gemma":0.000039486527,"threshold_uncertainty_score":0.36303315},"labels":[],"label_agreement":null},{"id":"W754424760","doi":"10.1016/j.disc.2015.06.022","title":"Edge coloring multigraphs without small dense subsets","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multigraph; Edge coloring; Combinatorics; Mathematics; Conjecture; Statement (logic); Vertex (graph theory); Chromatic scale; Brooks' theorem; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; 1-planar graph; Computer science; Chordal graph; Line graph; Artificial intelligence","score_opus":0.09607106585995495,"score_gpt":0.32043644204658683,"score_spread":0.22436537618663188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W754424760","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9586096,0.00019104166,0.013344585,0.00006642509,0.0007226001,0.00060328044,0.000027434744,0.00036816346,0.026066896],"genre_scores_gemma":[0.8509913,0.000013791339,0.14703412,0.00009220808,0.00017671533,0.000047740145,0.000008601906,0.00010399098,0.0015315026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789655,0.0001184515,0.0006210177,0.00035255592,0.00047538144,0.00053602137],"domain_scores_gemma":[0.9977091,0.0005414718,0.00029840527,0.000911348,0.00019577086,0.0003439227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010417536,0.0004005852,0.00058157626,0.00015830585,0.0002459358,0.00009293286,0.0005341314,0.00019165511,0.00005868373],"category_scores_gemma":[0.0013705454,0.0003082765,0.0002251073,0.00025591758,0.00021158287,0.00012531706,0.00028099192,0.00030018084,0.00005091395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068062756,0.00020177494,0.0038546326,0.0005279759,0.00020563633,0.000050096904,0.025743296,0.000014767321,0.00026958817,0.9643281,0.0042125215,0.00052355166],"study_design_scores_gemma":[0.0011356089,0.000087239416,0.00019273694,0.00016715702,0.0001751345,0.00008677653,0.0027229541,0.002560078,0.0018999189,0.98868215,0.0017082246,0.00058199663],"about_ca_topic_score_codex":0.000009881666,"about_ca_topic_score_gemma":0.00003579031,"teacher_disagreement_score":0.13368954,"about_ca_system_score_codex":0.00006268811,"about_ca_system_score_gemma":0.00005307302,"threshold_uncertainty_score":0.99993694},"labels":[],"label_agreement":null},{"id":"W762650586","doi":"10.1016/j.disc.2015.06.005","title":"Join colourings of chordal graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Chordal graph; Combinatorics; Mathematics; Partition (number theory); Discrete mathematics; Pathwidth; Cograph; Split graph; Indifference graph; Graph; Line graph; 1-planar graph","score_opus":0.04375043402777048,"score_gpt":0.31112911825039025,"score_spread":0.2673786842226198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W762650586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15836108,0.00011301842,0.8244969,0.0003085417,0.00012826693,0.00029648034,0.0000066945095,0.00015254233,0.01613646],"genre_scores_gemma":[0.65403473,0.0000070662286,0.34541178,0.000035710953,0.000014770426,0.000017538407,0.0000015041617,0.000017652514,0.0004592418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986623,0.00005321986,0.00029386778,0.00019946368,0.0005157477,0.0002753871],"domain_scores_gemma":[0.99867964,0.00013814255,0.00014142244,0.0007072522,0.00016382047,0.00016974822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071818323,0.00011937542,0.00022736096,0.00014493978,0.000040207575,0.00005010997,0.000999083,0.000042120297,0.000008731319],"category_scores_gemma":[0.00028103252,0.00009850064,0.000081475424,0.0005169276,0.00014528415,0.00028719046,0.00038267014,0.000121836914,0.000047136196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059186073,0.000065727036,0.00017273302,0.00006502391,0.000016051354,0.000007955487,0.002900416,0.000047157366,0.0008884008,0.99472874,0.00040047595,0.00070142356],"study_design_scores_gemma":[0.00037172335,0.0001432419,0.00007740722,0.00004201501,0.0000051260595,0.000017745466,0.00041856113,0.017892085,0.011480667,0.9689048,0.00048828835,0.00015835218],"about_ca_topic_score_codex":0.0000033081437,"about_ca_topic_score_gemma":0.0000013625144,"teacher_disagreement_score":0.49567366,"about_ca_system_score_codex":0.000022074099,"about_ca_system_score_gemma":0.000059610644,"threshold_uncertainty_score":0.40167394},"labels":[],"label_agreement":null},{"id":"W929955757","doi":"10.1016/j.disc.2015.06.024","title":"Dichotomy for finite tournaments of mixed-type","year":2015,"lang":"en","type":"article","venue":"Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Mathematics; Unary operation; Tournament; Combinatorics; Conjecture; Constraint satisfaction problem; Congruence (geometry); Singleton; Type (biology); Discrete mathematics; Algebraic number; Statistics","score_opus":0.07072933088438883,"score_gpt":0.3471430431633135,"score_spread":0.2764137122789247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W929955757","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.022220567,0.00007742871,0.9747219,0.00012133935,0.00019072743,0.00035810776,0.000010487377,0.000052932766,0.0022465067],"genre_scores_gemma":[0.40008715,0.000008690123,0.5988889,0.000035914458,0.000033493336,0.00003873586,0.00000585971,0.000022470176,0.0008788237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883646,0.000038033915,0.00029321105,0.00017970521,0.0003929641,0.00025961106],"domain_scores_gemma":[0.99842024,0.0003704823,0.00015713576,0.00062082836,0.0002868436,0.00014444525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006539406,0.000111365,0.00021567526,0.000103401144,0.00004311289,0.000051471186,0.0008700029,0.000038802064,0.000005346573],"category_scores_gemma":[0.0007087892,0.00009020266,0.00007531152,0.00035456376,0.0000712743,0.00025962965,0.000247323,0.00007595343,0.000027809596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005178508,0.00022236658,0.00039742305,0.00032345142,0.000087730834,0.0000083424575,0.004534243,0.0007432777,0.00093016063,0.98580307,0.0021428494,0.004755296],"study_design_scores_gemma":[0.0007892897,0.00031568517,0.00002952958,0.00007871632,0.000012185872,0.000006104909,0.00033623425,0.11179221,0.007700912,0.87562746,0.0031189262,0.00019277114],"about_ca_topic_score_codex":9.2350587e-7,"about_ca_topic_score_gemma":7.2914105e-7,"teacher_disagreement_score":0.37786657,"about_ca_system_score_codex":0.000025228459,"about_ca_system_score_gemma":0.00006467914,"threshold_uncertainty_score":0.36783576},"labels":[],"label_agreement":null}]}