{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":412,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":412,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"a15dcbaaeb2a","filters":{"venue":"Contributions to Discrete Mathematics"}},"results":[{"id":"W1847349865","doi":"10.55016/ojs/cdm.v11i1.62389","title":"Diagonal recurrence relations for the Stirling numbers of the first kind","year":2016,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Diagonal; Stirling engine; Stirling numbers of the first kind; Stirling number; Recurrence relation; Stirling numbers of the second kind; Mathematics; Bell polynomials; Algebra over a field; Combinatorics; Pure mathematics; Physics; Geometry; Thermodynamics","authors":[{"name":"Feng Qi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0292395445902785,"gpt":0.3350296788509379,"spread":0.3057901342606594,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.000885236,0.0002737701,0.0004329769,0.00006232955,0.0007252021,0.00004379307,0.0009179785,0.0001220036,0.00005853291],"category_scores_gemma":[0.01997646,0.0001337557,0.0003243316,0.0005123127,0.0002939038,0.0001472144,0.0002936083,0.0001717512,0.00004253567],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002359778,"about_ca_system_score_gemma":0.0001382518,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002663407,"about_ca_topic_score_gemma":0.00003580295,"domain_scores_codex":[0.9978752,0.00005404996,0.0008818634,0.0002642595,0.0004741533,0.0004504417],"domain_scores_gemma":[0.9868856,0.0105288,0.0005792598,0.001229493,0.0006686074,0.000108227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001363461,0.0001240539,0.00009446074,0.0001254236,0.00008522908,1.858829e-7,0.001092982,0.00006281494,0.0002964822,0.9928856,0.004840402,0.0003787211],"study_design_scores_gemma":[0.0008390695,0.00005338086,0.0001239376,0.0008133883,0.0002681981,0.000007160806,0.0003336712,0.001268085,0.002707612,0.9825488,0.01078252,0.0002541562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009367191,0.00008048024,0.9742215,0.01110411,0.0007988465,0.002638177,0.0009769725,0.00009396909,0.0007187987],"genre_scores_gemma":[0.92704,0.00001954468,0.07012703,0.00008673862,0.0002523116,0.0008781172,0.000004992834,0.00008082455,0.001510486],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9176728,"threshold_uncertainty_score":0.9882787,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3213466060","doi":"10.55016/ojs/cdm.v18i2.74415","title":"On some new families of $k$-Mersenne and generalized $k$-Gaussian Mersenne numbers and their polynomials","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mersenne prime; Mathematics; Gaussian; Combinatorics; Physics; Quantum mechanics","authors":[{"name":"Munesh Kumari","is_ca":false},{"name":"Jagmohan Tanti","is_ca":false},{"name":"Kalika Prasad","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01022743975645085,"gpt":0.2895393895616404,"spread":0.2793119498051896,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001694036,0.0002076845,0.0004288516,0.00009041466,0.0001988762,0.00004039941,0.0001097943,0.00004192689,0.00007665075],"category_scores_gemma":[0.0001146804,0.0001591602,0.00008651669,0.0003102876,0.0001545185,0.00008386434,0.000120876,0.0000838591,0.00005075988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001642155,"about_ca_system_score_gemma":0.0000297828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000344651,"about_ca_topic_score_gemma":0.000002378625,"domain_scores_codex":[0.9989927,0.0000219238,0.0003671206,0.0002252187,0.0000944638,0.0002985702],"domain_scores_gemma":[0.9987771,0.0004681654,0.0001322887,0.0003343904,0.00005328841,0.0002347792],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000852647,0.00004142564,0.00001187534,0.00002967672,0.00006671608,1.801347e-7,0.001059798,0.00005648165,0.003297975,0.9925222,0.001033075,0.001872036],"study_design_scores_gemma":[0.0006423665,0.00005045438,0.00004906971,0.0000865263,0.00005399435,0.000001008191,0.004008872,0.001359071,0.005749333,0.9848232,0.002954584,0.0002214891],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6238781,0.0001526982,0.3562607,0.007639478,0.0001105084,0.001552609,0.002866729,0.0002246094,0.007314533],"genre_scores_gemma":[0.9900958,0.00005616475,0.007922145,0.0000755531,0.0001130858,0.00009539832,0.00009356112,0.00003337472,0.001514913],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3662177,"threshold_uncertainty_score":0.6490367,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400596733","doi":"10.55016/ojs/cdm.v15i1.68111","title":"Closed formulas and identities on the Bell polynomials and falling factorials","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"National Research Foundation of Korea; National Research Foundation","keywords":"Mathematics; Expression (computer science); Falling (accident); Bessel function; Combinatorics; Bell polynomials; Pure mathematics; Mathematical analysis","authors":[{"name":"Feng Qi","is_ca":false},{"name":"Da‐Wei Niu","is_ca":false},{"name":"Dongkyu Lim","is_ca":false},{"name":"Bai‐Ni Guo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06137965349062514,"gpt":0.3260544114094571,"spread":0.264674757918832,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008043607,0.0003268942,0.0006458604,0.00007670637,0.0005610018,0.0003315209,0.0002402735,0.0001336429,0.0002734192],"category_scores_gemma":[0.008032602,0.0002145383,0.0001269364,0.0002199851,0.000139833,0.0001266801,0.0002211542,0.0002205453,0.000119918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004721479,"about_ca_system_score_gemma":0.00004004414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005482631,"about_ca_topic_score_gemma":0.000004723448,"domain_scores_codex":[0.9980984,0.0001123982,0.0007470261,0.000322951,0.0003177248,0.000401499],"domain_scores_gemma":[0.9947993,0.004048849,0.0002169993,0.0004354983,0.0001480719,0.0003512615],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003073234,0.00006535581,0.00001688856,0.0002709366,0.0001141035,0.000002183595,0.003973948,0.000003835661,0.002756044,0.9779885,0.01455543,0.0002220346],"study_design_scores_gemma":[0.0009613872,0.0003549106,0.00005955678,0.0003147653,0.0003597747,0.00001478723,0.001989731,0.00248152,0.008611797,0.9749096,0.009334702,0.0006074404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8380777,0.0002771902,0.1221278,0.0288178,0.0003464386,0.003018508,0.001260022,0.0003250679,0.005749488],"genre_scores_gemma":[0.9898769,0.0000667649,0.007453924,0.001233507,0.0005105581,0.000146504,0.00001199752,0.00005542041,0.0006444795],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1517991,"threshold_uncertainty_score":0.9616356,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403976080","doi":"10.55016/ojs/cdm.v19i3.72597","title":"Some results about star-factors in graphs","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Star (game theory); Combinatorics; Mathematics","authors":[{"name":"Sizhong Zhou","is_ca":false},{"name":"Xu Yang","is_ca":false},{"name":"Zhiren Sun","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02607026517526349,"gpt":0.3353275022472045,"spread":0.309257237071941,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009687549,0.0002982038,0.0004161051,0.000446958,0.0002140995,0.0001847883,0.0003747228,0.0001462648,0.00005778675],"category_scores_gemma":[0.001810473,0.0002489556,0.0002246522,0.001185314,0.000109361,0.0002383237,0.0001111796,0.0003332647,0.0002518524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001506464,"about_ca_system_score_gemma":0.00008330511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001134418,"about_ca_topic_score_gemma":0.00004190984,"domain_scores_codex":[0.9978638,0.00007938799,0.0008386871,0.0004226347,0.0002790817,0.0005164165],"domain_scores_gemma":[0.9973086,0.001485081,0.00009654773,0.000772329,0.0001220618,0.0002153464],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001113647,0.0001502461,0.00002150965,0.0001519789,0.00004809323,0.000009381984,0.002157601,0.000009984224,0.0006094264,0.9922225,0.004538685,0.00006940581],"study_design_scores_gemma":[0.0003390054,0.0000397414,0.0002558007,0.0004454814,0.00008101569,0.000005992881,0.0005925447,0.001050793,0.001870425,0.9872509,0.007756709,0.000311565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9565961,0.0009612293,0.02343063,0.004677492,0.0005137208,0.002360942,0.005517696,0.001102222,0.004840003],"genre_scores_gemma":[0.9901225,0.00005040541,0.008070808,0.00006682334,0.0001049214,0.0002864449,0.000140111,0.00005609624,0.001101904],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03352642,"threshold_uncertainty_score":0.9999962,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3186474464","doi":"10.55016/ojs/cdm.v16i2.71724","title":"Canonical functions: a proof via topological dynamics","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Austrian Science Fund; Grantová Agentura České Republiky","keywords":"Mathematics; Countable set; Algebraic number; Topological dynamics; Algebraic properties; Argument (complex analysis); Topology (electrical circuits); Pure mathematics; Combinatorics; Discrete mathematics; Functional analysis","authors":[{"name":"Michael Pinsker","is_ca":false},{"name":"Manuel Bodirsky","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02147232780708104,"gpt":0.3424850571934865,"spread":0.3210127293864055,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005017362,0.0002857337,0.0005694265,0.00008386353,0.000459612,0.00004699735,0.0002744404,0.0002911881,0.0008231378],"category_scores_gemma":[0.006205693,0.0002483448,0.0002266216,0.0004749442,0.0002638834,0.0001086207,0.0002693348,0.0004218978,0.0002757539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003569885,"about_ca_system_score_gemma":0.0002258725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002431954,"about_ca_topic_score_gemma":0.0001530068,"domain_scores_codex":[0.9979011,0.0001849198,0.0006480857,0.0004241736,0.0002552415,0.0005865244],"domain_scores_gemma":[0.997026,0.001210637,0.0001452226,0.0008256959,0.0005141574,0.0002782507],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002317263,0.0003940965,0.00003377172,0.00005629694,0.00009075791,0.00006710656,0.0002807045,0.00002999678,0.0003493855,0.9964806,0.001614199,0.0005798932],"study_design_scores_gemma":[0.0005107577,0.0001011852,0.0000246069,0.00006383458,0.0001561698,0.0002917496,0.0009337579,0.003874515,0.001913968,0.9880558,0.003730786,0.0003428902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01739672,0.0001630191,0.9674199,0.005184255,0.0003064664,0.0005544252,0.0005194589,0.00024114,0.00821468],"genre_scores_gemma":[0.8561866,0.00001547454,0.1281651,0.0007213152,0.000282633,0.0003688796,0.0002953251,0.00006966996,0.01389497],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8392547,"threshold_uncertainty_score":0.9999969,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4391148181","doi":"10.55016/ojs/cdm.v18i2.73022","title":"On signs of certain Toeplitz-Hessenberg determinants whose elements involve Bernoulli numbers","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Mathematical Inequalities and Applications","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Toeplitz matrix; Mathematics; Bernoulli's principle; Combinatorics; Bernoulli number; Pure mathematics","authors":[{"name":"Feng Qi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06309121257354112,"gpt":0.3922120505685635,"spread":0.3291208379950223,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001071227,0.0004039318,0.0008298929,0.0002602066,0.0003137472,0.00007493435,0.0005810857,0.0001757048,0.0003949743],"category_scores_gemma":[0.004285121,0.0003503741,0.0002948746,0.001069079,0.0001400728,0.00010381,0.0002795187,0.0002145891,0.0008112781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001608539,"about_ca_system_score_gemma":0.00008177792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002413445,"about_ca_topic_score_gemma":0.00004199154,"domain_scores_codex":[0.9965706,0.00009578942,0.001464053,0.0004323412,0.0006775957,0.0007595524],"domain_scores_gemma":[0.9947934,0.002756902,0.0004851875,0.001230066,0.0003945546,0.0003398736],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001497036,0.0004859963,0.00005428883,0.0005948984,0.00009833861,0.000006064652,0.001953172,0.00003347201,0.001436716,0.9767949,0.01824379,0.0002833928],"study_design_scores_gemma":[0.0007222123,0.0002477551,0.00004304305,0.0007035746,0.0001751664,0.000005026915,0.002524717,0.007188513,0.007642772,0.9772046,0.002996268,0.000546409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8006136,0.0000252595,0.1758409,0.003064889,0.0002375147,0.003819785,0.00465444,0.0008061343,0.01093745],"genre_scores_gemma":[0.9626076,0.00002567739,0.02808397,0.0002460097,0.0001303046,0.001032954,0.0002056358,0.000138574,0.007529227],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.161994,"threshold_uncertainty_score":0.9999667,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3192511544","doi":"10.55016/ojs/cdm.v16i2.71726","title":"Conant's generalised metric spaces are Ramsey","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Grantová Agentura České Republiky; Univerzita Karlova v Praze","keywords":"Mathematics; Monoid; Metric (unit); Extension (predicate logic); Combinatorics; Metric space; Property (philosophy); Commutative property; Ramsey's theorem; Automorphism; Discrete mathematics; Computer science","authors":[{"name":"Jan Hubička","is_ca":false},{"name":"Matěj Konečný","is_ca":false},{"name":"Jaroslav Nešetřil","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02958034679594445,"gpt":0.3494398780752159,"spread":0.3198595312792714,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005551326,0.0003139191,0.0006914109,0.0001864538,0.0004092158,0.00009528871,0.0003161455,0.0002159331,0.0005500083],"category_scores_gemma":[0.008586476,0.000279952,0.0002249876,0.0008977337,0.00016331,0.0001416299,0.0002215414,0.0002798236,0.0002970659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001448717,"about_ca_system_score_gemma":0.000138869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001965274,"about_ca_topic_score_gemma":0.00002624707,"domain_scores_codex":[0.9979309,0.0001969454,0.0005872289,0.0004015867,0.0003020373,0.0005812293],"domain_scores_gemma":[0.9965713,0.001360175,0.0002764015,0.0008699996,0.0006479867,0.0002741191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001525509,0.0002327578,0.00006744074,0.0001101,0.0001438189,0.00009499142,0.0005854961,0.00005624323,0.001365793,0.9906718,0.006482817,0.000173489],"study_design_scores_gemma":[0.00103602,0.00004912235,0.0001320038,0.0001582616,0.0002538683,0.0001163978,0.002207532,0.0006996831,0.01332029,0.9642134,0.01728347,0.0005299611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1122742,0.001224599,0.8675473,0.007426052,0.0005935564,0.0009388351,0.001257629,0.0004911909,0.008246601],"genre_scores_gemma":[0.8315268,0.0000979312,0.1560735,0.001001256,0.0003405724,0.0001968309,0.0001562525,0.00009602452,0.01051087],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7192526,"threshold_uncertainty_score":0.9999653,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400596851","doi":"10.55016/ojs/cdm.v15i3.62721","title":"Alternating series of Apéry-type for the Riemann zeta function","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Riemann zeta function; Mathematics; Series (stratigraphy); Particular values of Riemann zeta function; Type (biology); Riemann hypothesis; Transformation (genetics); Class (philosophy); Pure mathematics; Arithmetic zeta function; Function (biology); Mathematical analysis; Prime zeta function; Combinatorics; Computer science; Chemistry","authors":[{"name":"Wenchang Chu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.062275568514577,"gpt":0.3553928450027088,"spread":0.2931172764881318,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0004372495,0.0002596243,0.0005533671,0.00005426199,0.0003376267,0.00008416936,0.0004726193,0.00007512357,0.00008234601],"category_scores_gemma":[0.01375339,0.0001871265,0.0002146615,0.0004588762,0.0001647918,0.0002561747,0.0001707576,0.0001652509,0.00005721644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005940959,"about_ca_system_score_gemma":0.00005461131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002229442,"about_ca_topic_score_gemma":0.00001260915,"domain_scores_codex":[0.9981066,0.00003883216,0.0008366837,0.0002569657,0.0003832821,0.0003776657],"domain_scores_gemma":[0.9958286,0.002299404,0.0003982777,0.0005428013,0.0007644448,0.0001664858],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007381563,0.00007624704,0.00001199988,0.0008427586,0.000184036,8.573838e-7,0.002335494,0.0001865206,0.002109473,0.9881102,0.005963818,0.0001048093],"study_design_scores_gemma":[0.000517517,0.000353612,0.00002232934,0.0001690057,0.0004916373,0.000007489042,0.00228726,0.008953953,0.00643764,0.9757106,0.004764298,0.0002846578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01089099,0.0001692582,0.9799043,0.00517881,0.0002283653,0.001811533,0.000489891,0.0002045269,0.001122337],"genre_scores_gemma":[0.7263885,0.00004627052,0.2689619,0.0004838434,0.0006627662,0.0005588119,0.00006514128,0.0001501408,0.002682635],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7154975,"threshold_uncertainty_score":0.9945542,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2799119604","doi":"10.55016/ojs/cdm.v15i2.62327","title":"A method to determine algebraically integral Cayley digraphs on finite abelian group","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Cayley graph; Mathematics; Cayley transform; Abelian group; Cayley's theorem; Combinatorics; Eigenvalues and eigenvectors; Commutative property; Algebraic number; Finite field; Group (periodic table); Discrete mathematics; Graph; Mathematical analysis","authors":[{"name":"Fei Li","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04104743184635903,"gpt":0.3480774510444147,"spread":0.3070300191980557,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000755275,0.0004385228,0.0006733765,0.0002317916,0.0003729731,0.0001405721,0.0007071988,0.0001579553,0.0001494457],"category_scores_gemma":[0.003958947,0.0003715413,0.0003467817,0.001330126,0.00007928524,0.00009793389,0.0002319706,0.0003832947,0.0007093842],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000763705,"about_ca_system_score_gemma":0.0000434116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005141773,"about_ca_topic_score_gemma":0.0000206274,"domain_scores_codex":[0.9974157,0.0001752884,0.0008214391,0.0005845916,0.000388292,0.0006146631],"domain_scores_gemma":[0.9957412,0.002078682,0.000193437,0.0008499477,0.0002679275,0.000868794],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005387606,0.0002655052,0.00001104064,0.00008126877,0.00008294079,0.000007354291,0.002236143,0.00004525752,0.004397738,0.9868373,0.004505939,0.001475639],"study_design_scores_gemma":[0.0008336329,0.0007100127,0.00006145614,0.0002823129,0.0002576956,0.00001325928,0.0006307542,0.005951946,0.006073834,0.9587988,0.0256437,0.0007425973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03179296,0.00001466812,0.9461514,0.01599391,0.00005130467,0.001801643,0.001231909,0.0004358887,0.002526343],"genre_scores_gemma":[0.5041291,0.000003277806,0.4895994,0.004716325,0.0001809772,0.0008054764,0.00009424399,0.00008984326,0.0003813373],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4723362,"threshold_uncertainty_score":0.9998736,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400596734","doi":"10.55016/ojs/cdm.v13i2.62728","title":"Some remarks on the lonely runner conjecture","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"National Science Foundation","keywords":"Conjecture; Combinatorics; Mathematics; Constant (computer programming); Lonely runner conjecture; Upper and lower bounds; Unit (ring theory); Binary logarithm; Collatz conjecture; Mathematical analysis; Computer science","authors":[{"name":"Terence Tao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0138935808667428,"gpt":0.2813669509504867,"spread":0.2674733700837439,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005051569,0.0001518246,0.0001524038,0.0001077318,0.0005368611,0.0002509736,0.000627981,0.00006327779,0.00005939041],"category_scores_gemma":[0.0007301504,0.00009867658,0.00007893159,0.0005934865,0.00007904555,0.0001963072,0.0001897502,0.0001340312,0.0007579222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007219953,"about_ca_system_score_gemma":0.00008587887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001658599,"about_ca_topic_score_gemma":0.00000377144,"domain_scores_codex":[0.9988202,0.00006764238,0.0002577683,0.0002659004,0.0003186309,0.0002698105],"domain_scores_gemma":[0.9983632,0.0004177169,0.00008925954,0.0006766288,0.0003377733,0.0001154159],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003059112,0.00004104919,0.000001238948,0.000004072833,0.00001781671,0.000001480622,0.0004048736,0.0003772121,0.0006658069,0.9807888,0.01690997,0.0007846449],"study_design_scores_gemma":[0.000586181,0.0005529763,0.0005931438,0.0001314532,0.00003933839,0.00004621569,0.0000978162,0.2304242,0.02054983,0.6762604,0.0701659,0.0005524865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00853345,0.00005906187,0.9627217,0.02543776,0.0004564526,0.0004313944,0.00005707555,0.000125128,0.002177963],"genre_scores_gemma":[0.9617672,0.00000461655,0.03230297,0.003704492,0.0009156219,0.00007007589,0.00002521439,0.00001178004,0.001198033],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9532337,"threshold_uncertainty_score":0.9741809,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400596724","doi":"10.55016/ojs/cdm.v15i1.62323","title":"Construction of strongly regular graphs having an automorphism group of composite order","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Hrvatska Zaklada za Znanost","keywords":"Mathematics; Automorphism; Automorphism group; Combinatorics; Isomorphism (crystallography); Outer automorphism group; Order (exchange); Graph automorphism; Discrete mathematics; Group (periodic table); Inner automorphism; Generalization; Orbit (dynamics); Graph; Crystallography; Physics; Chemistry","authors":[{"name":"Dean Crnković","is_ca":false},{"name":"Marija Maksimović","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04021462561897225,"gpt":0.3332336608738456,"spread":0.2930190352548733,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009247033,0.0002849715,0.0008120231,0.0002405454,0.0001698697,0.00004638462,0.0005550947,0.0001601071,0.0001711],"category_scores_gemma":[0.002517951,0.0002732659,0.0001962488,0.001061394,0.0004497906,0.0002371944,0.0002469845,0.0002889472,0.00002253056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008110183,"about_ca_system_score_gemma":0.00009381014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001117985,"about_ca_topic_score_gemma":0.000006800037,"domain_scores_codex":[0.9972299,0.0002485989,0.001078352,0.0003521767,0.0006464915,0.0004444629],"domain_scores_gemma":[0.9966944,0.0006748683,0.0004959741,0.0007997005,0.0009796843,0.0003554103],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008318008,0.0002916456,0.0002512658,0.0005680345,0.0001424684,0.000004712721,0.002296489,0.00007632013,0.06149254,0.934325,0.000228891,0.0002394165],"study_design_scores_gemma":[0.002741032,0.001438307,0.0004896607,0.0007112538,0.0005552963,0.00005501737,0.004588452,0.0416263,0.05270228,0.8939009,0.0003761659,0.0008153355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5993658,0.00005198059,0.3966708,0.0007870795,0.00006833007,0.001080238,0.001082925,0.0001755093,0.0007173896],"genre_scores_gemma":[0.7863382,0.000004889007,0.2133574,0.00003189323,0.000046234,0.00004164359,0.00009651742,0.00005303908,0.00003027772],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1869724,"threshold_uncertainty_score":0.9999719,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4412647858","doi":"10.55016/ojs/cdm.v2i1.61890","title":"Coloring edges and vertices of graphs without short or long cycles","year":2007,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics","authors":[{"name":"Vadim Lozin","is_ca":false},{"name":"Marcin Kamiński","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02436192913843581,"gpt":0.3102164975382111,"spread":0.2858545683997753,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008173804,0.0001387487,0.0002703985,0.0001883534,0.000188744,0.00009251818,0.0003371591,0.00005914094,0.000003400076],"category_scores_gemma":[0.0004222173,0.0001038703,0.00005369174,0.0005146954,0.0001151216,0.0001985061,0.0002270653,0.00008014013,0.000006460305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001965257,"about_ca_system_score_gemma":0.00003822356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009289957,"about_ca_topic_score_gemma":0.00004007415,"domain_scores_codex":[0.9987679,0.00002062149,0.0004271218,0.0002355045,0.0002350093,0.000313807],"domain_scores_gemma":[0.9987455,0.0003058308,0.0000894564,0.0004198019,0.0002554014,0.0001839915],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003044991,0.0001710272,0.008798075,0.000176798,0.00009071036,0.00001600303,0.00225609,0.00009296793,0.008629997,0.9732041,0.0001777906,0.006355959],"study_design_scores_gemma":[0.00293507,0.001342059,0.04869551,0.002289052,0.000478613,0.0002630233,0.002272298,0.06955916,0.3053331,0.5636193,0.001175073,0.002037663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4674224,0.0002567267,0.5312963,0.0002764208,0.00009383314,0.0002338252,0.00001459432,0.0001014058,0.0003045465],"genre_scores_gemma":[0.9366038,0.00002333802,0.06323554,0.00004992028,0.00000547242,0.00001167214,0.000002142907,0.000007606965,0.000060439],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4691815,"threshold_uncertainty_score":0.423571,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1489838207","doi":"10.55016/ojs/cdm.v8i2.62171","title":"Elements of finite order in automorphism groups of homogeneous structures","year":2014,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Homogeneous; Automorphism; Order (exchange); Mathematics; Pure mathematics; Automorphism group; Combinatorics; Business","authors":[{"name":"Dogan Bilge","is_ca":false},{"name":"Julien Melleray","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02142485615338601,"gpt":0.3408321053292531,"spread":0.3194072491758671,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009879,0.0004638583,0.001499929,0.000409137,0.00008140458,0.00001412375,0.0007112516,0.0005577168,0.0002167499],"category_scores_gemma":[0.006178274,0.0004280381,0.0002560306,0.0003278346,0.000325562,0.00003850494,0.0008194216,0.000618531,0.00001378689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001426355,"about_ca_system_score_gemma":0.0001796094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001138517,"about_ca_topic_score_gemma":0.00004944873,"domain_scores_codex":[0.9967347,0.0002320551,0.001765938,0.000424441,0.0003682667,0.0004745387],"domain_scores_gemma":[0.9951848,0.001630551,0.001179232,0.001282141,0.000600706,0.000122557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005884115,0.0003509578,0.0001274834,0.001702179,0.0002756378,0.00001163455,0.002114637,0.005615311,0.0004867845,0.9886391,0.0003584762,0.0002589257],"study_design_scores_gemma":[0.0007485597,0.00009584121,0.000095148,0.000656328,0.0002304811,0.000009108834,0.0002317995,0.005628282,0.002986276,0.9887638,0.0001725122,0.0003818651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2525706,0.0002709212,0.7405797,0.0002564059,0.000384749,0.001676545,0.003056813,0.00009321736,0.001111094],"genre_scores_gemma":[0.8717934,0.00003235945,0.1274552,0.00004720542,0.00006646119,0.0001344618,0.0002010899,0.00005812552,0.0002116755],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6192229,"threshold_uncertainty_score":0.9998171,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400596810","doi":"10.55016/ojs/cdm.v15i3.69846","title":"Binomial transforms of the balancing and Lucas-balancing polynomials","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Catalan number; Mathematics; Binomial (polynomial); Recurrence relation; Binomial coefficient; Catalan; Combinatorics; Discrete mathematics; Statistics","authors":[{"name":"Nazmiye Yılmaz","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008304321983629265,"gpt":0.2711280594762513,"spread":0.262823737492622,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001121441,0.0001351827,0.0002978754,0.00001501514,0.0002035963,0.00003274619,0.0001885465,0.00002803288,0.00008171747],"category_scores_gemma":[0.0001546963,0.00009023306,0.000113351,0.000236286,0.00009570525,0.00006333611,0.0001014758,0.0001061217,0.00001532928],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001726937,"about_ca_system_score_gemma":0.00003557277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005859442,"about_ca_topic_score_gemma":7.24153e-7,"domain_scores_codex":[0.9991367,0.0000150521,0.0003743615,0.0001519291,0.0001129031,0.0002090859],"domain_scores_gemma":[0.9991961,0.000216257,0.0001234266,0.000237768,0.00007492147,0.0001515024],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006579305,0.00003448583,0.0002178397,0.00005612569,0.00003384567,7.769372e-8,0.002005034,0.00008904428,0.009761141,0.9865994,0.0001547838,0.001041578],"study_design_scores_gemma":[0.001904999,0.0001083366,0.0009446438,0.0003807672,0.0003543691,0.000004462812,0.006773336,0.01052704,0.1085362,0.8605727,0.00912612,0.0007670539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1645053,0.0000332361,0.8258975,0.004676682,0.00004449011,0.0006808223,0.0009761436,0.00003565039,0.003150244],"genre_scores_gemma":[0.9934652,0.000001372924,0.006147867,0.0001206463,0.00014729,0.00005056379,0.000009249025,0.00001404257,0.00004369877],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.82896,"threshold_uncertainty_score":0.3679597,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2907170940","doi":"10.55016/ojs/cdm.v13i2.62730","title":"Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo; Deutscher Akademischer Austauschdienst","keywords":"Hypergraph; Mathematics; Combinatorics; Hamiltonian (control theory); Hamiltonian path; Degree (music); Upper and lower bounds; Discrete mathematics; Mathematical analysis; Physics; Graph","authors":[{"name":"Josefran de Oliveira Bastos","is_ca":false},{"name":"Guilherme Oliveira Mota","is_ca":false},{"name":"Mathias Schacht","is_ca":false},{"name":"Jakob Schnitzer","is_ca":false},{"name":"Fabian Schulenburg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0222772638909818,"gpt":0.3291700127212284,"spread":0.3068927488302466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007617291,0.0004016867,0.0005455475,0.0001762553,0.001232102,0.000124536,0.0006691666,0.0002452165,0.0008366462],"category_scores_gemma":[0.002034466,0.0003278755,0.000250365,0.000428271,0.0002669306,0.0001884536,0.000511107,0.0002522739,0.0003984884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001614504,"about_ca_system_score_gemma":0.00004689102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004726948,"about_ca_topic_score_gemma":0.00002778578,"domain_scores_codex":[0.9975207,0.00009557219,0.0006549743,0.0004384292,0.0004726266,0.0008176341],"domain_scores_gemma":[0.9973563,0.0005006099,0.0002353074,0.001101014,0.0004591116,0.0003476665],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004144002,0.0001748357,0.0000556669,0.00009778592,0.0001173291,0.0000047503,0.002332777,5.493972e-7,0.002152011,0.8778206,0.1166712,0.0005310284],"study_design_scores_gemma":[0.001663124,0.0002716396,0.0002026279,0.0002620648,0.0002459027,0.00002497583,0.0006722788,0.002058734,0.01016001,0.9095249,0.0741618,0.0007519764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3992557,0.0004670404,0.537957,0.002553426,0.001272014,0.002697898,0.009693929,0.001026516,0.04507654],"genre_scores_gemma":[0.9739513,0.00001445947,0.02162651,0.0004682545,0.0003593267,0.00007137715,0.0001492889,0.00008520816,0.003274222],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5746957,"threshold_uncertainty_score":0.9999173,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400596768","doi":"10.55016/ojs/cdm.v15i1.67964","title":"On parity and recurrences for certain partition functions","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Partition (number theory); Parity (physics); Combinatorics; Legendre polynomials; Euler's formula; Recurrence relation; Discrete mathematics; Mathematical analysis","authors":[{"name":"Darlison Nyirenda","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06222150038527333,"gpt":0.3641647935390036,"spread":0.3019432931537303,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.0003370437,0.000245382,0.0004482312,0.00006958122,0.0003808065,0.0001223353,0.0001696266,0.00009525352,0.00009660763],"category_scores_gemma":[0.01315964,0.0002145506,0.0001260328,0.0002563337,0.0001210166,0.0001744487,0.00009776986,0.0001617497,0.0001184403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007372434,"about_ca_system_score_gemma":0.00003722457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001349669,"about_ca_topic_score_gemma":0.00001008641,"domain_scores_codex":[0.9984537,0.00004652928,0.0005273072,0.0003444601,0.0002541635,0.0003738122],"domain_scores_gemma":[0.9967512,0.002167872,0.0001636076,0.0003111087,0.0002726465,0.0003335649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003164804,0.000128386,0.000006228794,0.0003879945,0.00004080478,9.346826e-7,0.001013374,0.00002931986,0.0001780371,0.9802798,0.0177252,0.0001782638],"study_design_scores_gemma":[0.000493154,0.000313242,0.00001002262,0.0001726155,0.0001434342,0.000003644006,0.0009311883,0.007798611,0.0006207924,0.9859933,0.00324807,0.0002718911],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01816281,0.00005788334,0.966114,0.01003296,0.0001170546,0.00168514,0.001292279,0.0003032038,0.002234625],"genre_scores_gemma":[0.8637659,0.00002584234,0.1318576,0.0008466044,0.0003386713,0.001315934,0.000128845,0.00008553654,0.001635074],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8456031,"threshold_uncertainty_score":0.995153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2797717882","doi":"10.55016/ojs/cdm.v17i1.69514","title":"Some relational structures with polynomial growth and their associated algebras II. Finite generation.","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Topics in Algebra","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Permutation (music); Bounded function; Invariant (physics); Combinatorics; Conjecture; Polynomial; Discrete mathematics; Pure mathematics","authors":[{"name":"Maurice Pouzet","is_ca":false},{"name":"Nicolas M. Thiéry","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02508052111001085,"gpt":0.2819581800075086,"spread":0.2568776588974978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0003829492,0.0003139476,0.000424362,0.0001705938,0.001325556,0.00007426508,0.0002658811,0.00009285525,0.0001229707],"category_scores_gemma":[0.002632276,0.0002578176,0.0000856375,0.0003905672,0.0001254451,0.000224081,0.0004839451,0.0004103752,0.00000379727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002887205,"about_ca_system_score_gemma":0.0001347647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004226406,"about_ca_topic_score_gemma":0.00001691593,"domain_scores_codex":[0.9981455,0.0001289589,0.0005171683,0.0003666924,0.0004386986,0.0004029883],"domain_scores_gemma":[0.9979694,0.000912656,0.0003041462,0.0004301892,0.0002174268,0.0001661466],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001706508,0.0001236842,0.00006550762,0.00002158588,0.0001447563,0.000004151531,0.001642833,0.0003272345,0.0009292254,0.9937702,0.002923194,0.00003056839],"study_design_scores_gemma":[0.001085368,0.0002570078,0.0001323738,0.00002585457,0.00009999619,0.00004036721,0.0004110405,0.006283032,0.001940907,0.9873267,0.001961403,0.0004359395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.712118,0.0004450383,0.2717667,0.007449244,0.0004468684,0.001946267,0.004568687,0.0007036914,0.0005554984],"genre_scores_gemma":[0.9412839,0.000009568738,0.05663791,0.0003897328,0.0003580171,0.0002973647,0.0003553048,0.00009350784,0.0005746403],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.229166,"threshold_uncertainty_score":0.9999874,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4390714631","doi":"10.55016/ojs/cdm.v17i1.72482","title":"Homothetic covering of convex hulls of compact convex sets","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Natural Science Foundation of Shanxi Province; National Natural Science Foundation of China","keywords":"Mathematics; Convex hull; Combinatorics; Homothetic transformation; Convex set; Convex polytope; Orthogonal convex hull; Convex body; Cover (algebra); Regular polygon; Convex combination; Parallelepiped; Subderivative; Convex analysis; Integer (computer science); Geometry; Convex optimization; Computer science","authors":[{"name":"Senlin Wu","is_ca":false},{"name":"Keke Zhang","is_ca":false},{"name":"Chan He","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03718798935189808,"gpt":0.346655638837027,"spread":0.3094676494851289,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001153365,0.0002402537,0.0009653833,0.0003844725,0.0002463839,0.00002667454,0.0004820732,0.00006021759,0.0008841195],"category_scores_gemma":[0.002555233,0.0002289221,0.000249148,0.00102215,0.0001419694,0.00009191303,0.0003090223,0.0002152979,0.00001711517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001509508,"about_ca_system_score_gemma":0.0001567382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003120639,"about_ca_topic_score_gemma":0.000002819673,"domain_scores_codex":[0.9974765,0.0001125561,0.001126279,0.0002178802,0.0006521856,0.0004146072],"domain_scores_gemma":[0.9967189,0.001355815,0.0006662402,0.0006376154,0.0004860818,0.0001353811],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005629362,0.0007523802,0.0001759912,0.002068582,0.0002910141,0.000007268644,0.00698266,0.0005621428,0.002579018,0.9815166,0.004832081,0.0001759888],"study_design_scores_gemma":[0.003082922,0.001304731,0.0002506603,0.0006861474,0.000634966,0.0001322728,0.01786052,0.009252562,0.04820554,0.9070277,0.01044467,0.001117287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7678905,0.000604225,0.2084802,0.001312184,0.000372074,0.001817714,0.009698506,0.0001927666,0.009631827],"genre_scores_gemma":[0.9942999,0.00001147468,0.004791995,0.00006235122,0.00002224283,0.0000587239,0.00004684459,0.00003620312,0.0006702548],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2264095,"threshold_uncertainty_score":0.9680488,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2626654879","doi":"10.55016/ojs/cdm.v15i1.62606","title":"Pell Coding and Pell Decoding Methods with Some Applications","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Theories and Applications","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Decoding methods; Coding (social sciences); Mathematics; Coding theory; Combinatorics; Algorithm; Arithmetic; Discrete mathematics; Statistics","authors":[{"name":"Nıhal Taş","is_ca":false},{"name":"Sümeyra Uçar","is_ca":false},{"name":"Nihal Yılmaz Özgür","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01617388617014612,"gpt":0.3439716188136487,"spread":0.3277977326435025,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001649446,0.0001981845,0.0003223988,0.00003127912,0.0003562673,0.00009996943,0.0001820708,0.00003083558,0.0001345528],"category_scores_gemma":[0.00007920224,0.0001609488,0.00006602182,0.0003221894,0.0001041313,0.0001416252,0.0001368561,0.0001483035,0.0001071862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000234816,"about_ca_system_score_gemma":0.00002949103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001672859,"about_ca_topic_score_gemma":1.955678e-7,"domain_scores_codex":[0.9989627,0.00002668383,0.0003172815,0.0002910342,0.0001099698,0.0002923594],"domain_scores_gemma":[0.9986997,0.000409492,0.0001230252,0.0003015866,0.000124104,0.000342084],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004092683,0.00004538463,0.00002154159,0.00004644011,0.00004227748,1.769858e-7,0.0005024742,0.00008031799,0.001646873,0.994513,0.0001181254,0.002979261],"study_design_scores_gemma":[0.0006609046,0.00008750314,0.00001320316,0.00008712698,0.0002329307,0.000003910626,0.003155263,0.02152803,0.008503676,0.9344326,0.03075824,0.0005366292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001053134,0.00005440648,0.9886966,0.003129381,0.000008241971,0.0008678648,0.0003234287,0.00008877595,0.005778177],"genre_scores_gemma":[0.3959118,0.000008671859,0.6025841,0.0002941432,0.0002693093,0.0005745449,0.00005706495,0.00003985588,0.0002605565],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3948587,"threshold_uncertainty_score":0.6563302,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400596849","doi":"10.55016/ojs/cdm.v15i2.62866","title":"A new mathematical model for tiling finite regions of the plane with polyominoes","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Underdetermined system; MATLAB; Mathematics; Polyomino; Backtracking; Binary number; Linear programming; Computer science; Algorithm; Combinatorics; Discrete mathematics; Geometry","authors":[{"name":"Marcus R. Garvie","is_ca":true},{"name":"John Burkardt","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0263591108650448,"gpt":0.2696174514845941,"spread":0.2432583406195493,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001139843,0.0001401358,0.0002525094,0.00003343959,0.0002010526,0.00007869212,0.0008697959,0.00004648764,0.000007040983],"category_scores_gemma":[0.0004038278,0.00009031249,0.0001220196,0.000454664,0.00005040679,0.0001017574,0.0002329061,0.0000867257,0.00002311405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002295739,"about_ca_system_score_gemma":0.0001951344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001805688,"about_ca_topic_score_gemma":0.000003704217,"domain_scores_codex":[0.9989685,0.00001327708,0.0003409742,0.0002297261,0.000214095,0.0002333618],"domain_scores_gemma":[0.9984821,0.0003246528,0.0001444777,0.000706475,0.0001380386,0.0002042741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005688569,0.00004571884,0.000003286612,0.00007092727,0.00002709727,3.390913e-7,0.002692639,0.004335424,0.002015465,0.9883347,0.002267501,0.0002012018],"study_design_scores_gemma":[0.0003172017,0.00004330453,0.000006139467,0.00006681779,0.00005488099,0.000006681657,0.00007967877,0.9149066,0.005521277,0.07805355,0.0008212221,0.0001226852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008050281,0.00002259751,0.9798414,0.01774902,0.0000102181,0.0008550025,0.0002675938,0.0001063603,0.0003428159],"genre_scores_gemma":[0.4973156,0.000001428502,0.5016139,0.0003556323,0.00003896279,0.0001207398,0.00001821822,0.00001545902,0.0005200321],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9105712,"threshold_uncertainty_score":0.3682836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4413186465","doi":"10.55016/ojs/cdm.v4i2.62086","title":"The distribution of polynomials over finite fields, with applications to the Gowers norms","year":2009,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"John D. and Catherine T. MacArthur Foundation; National Science Foundation","keywords":"Mathematics; Distribution (mathematics); Combinatorics; Finite field; Orthogonal polynomials; Pure mathematics; Mathematical analysis","authors":[{"name":"Ben Green","is_ca":false},{"name":"Terence Tao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.021690663179079,"gpt":0.3436793809764977,"spread":0.3219887177974187,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001434338,0.0002310737,0.0003748615,0.00006408992,0.00070362,0.000134799,0.0008186302,0.00009209713,0.00005052264],"category_scores_gemma":[0.002895558,0.0001200082,0.000151128,0.000856886,0.0001917182,0.00007786536,0.0001432662,0.0002558779,0.0001285049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001684597,"about_ca_system_score_gemma":0.0001302408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001361855,"about_ca_topic_score_gemma":0.00007577091,"domain_scores_codex":[0.9979039,0.0001053717,0.0006417723,0.0002511626,0.0005702656,0.0005274866],"domain_scores_gemma":[0.9951724,0.002507883,0.000235397,0.001319032,0.000544383,0.0002208518],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008253586,0.0001719329,0.00003232452,0.00003558344,0.0001169856,0.00000116563,0.0008329258,0.0003537209,0.0001351955,0.9761584,0.02062812,0.001451126],"study_design_scores_gemma":[0.001223651,0.0006833124,0.0008476262,0.000323223,0.0004807961,0.00002591537,0.002625055,0.006013844,0.003247426,0.8899783,0.0938427,0.0007080823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01264285,0.0000633415,0.9638091,0.01790839,0.00003577426,0.002445841,0.0008683321,0.00007409508,0.002152228],"genre_scores_gemma":[0.9917354,0.00001973106,0.005107753,0.0003144952,0.0001428227,0.0004164298,0.00006666492,0.00002640807,0.002170268],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9790926,"threshold_uncertainty_score":0.5411747,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2952565476","doi":"10.55016/ojs/cdm.v5i2.62032","title":"The Cops and Robber game on graphs with forbidden (induced) subgraphs","year":2010,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Fédération Wallonie-Bruxelles; Fonds De La Recherche Scientifique - FNRS","keywords":"Combinatorics; Mathematical economics; Computer science; Mathematics","authors":[{"name":"Gwenaël Joret","is_ca":false},{"name":"Marcin Kamiński","is_ca":false},{"name":"Dirk Oliver Theis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01203548192157513,"gpt":0.2990309502276869,"spread":0.2869954683061118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008063306,0.0002201279,0.0002206093,0.0001671411,0.0006897217,0.0004450398,0.001023254,0.00007844134,0.000007654773],"category_scores_gemma":[0.0006920805,0.000130863,0.0000726509,0.0008176734,0.0002938172,0.0002583387,0.0003128563,0.0004791928,0.00006461663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002707532,"about_ca_system_score_gemma":0.00007229372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003917024,"about_ca_topic_score_gemma":0.00008356959,"domain_scores_codex":[0.9982656,0.00006764928,0.0002632184,0.0003794655,0.0004436929,0.0005803252],"domain_scores_gemma":[0.9970501,0.0009372421,0.00009849998,0.001282447,0.0003370761,0.0002946152],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001617475,0.00003915272,0.00007448087,0.000007694067,0.00002885669,0.000005311478,0.0003869121,0.000008516524,0.002316151,0.9949141,0.0002028638,0.001999792],"study_design_scores_gemma":[0.0008113131,0.0005248323,0.001184501,0.00007996738,0.00002616264,0.00009001946,0.0002450492,0.006672602,0.006127158,0.9775484,0.006236429,0.0004535693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3464074,0.00008682585,0.6408681,0.007276198,0.0002553661,0.001490844,0.00008677872,0.0002791337,0.003249357],"genre_scores_gemma":[0.9791048,0.00001662488,0.02017509,0.0001481959,0.00003125399,0.0001683378,0.000003645491,0.000021787,0.0003303026],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6326973,"threshold_uncertainty_score":0.5336437,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3196775760","doi":"10.55016/ojs/cdm.v15i2.68165","title":"Hyperball packings related to truncated cube and octahedron tilings in hyperbolic space","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Supramolecular Self-Assembly in Materials","field":"Materials Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Coxeter group; Combinatorics; Mathematics; Hyperbolic space; Cube (algebra); Octahedron; Space (punctuation); Hypersphere; Voronoi diagram; Crystallography; Geometry; Crystal structure","authors":[{"name":"Jenő Szirmai","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01103728293238904,"gpt":0.2798916512988554,"spread":0.2688543683664664,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007876609,0.0003412578,0.0006569751,0.0001526217,0.0001519072,0.0002939439,0.0004412049,0.0001821198,0.0002135383],"category_scores_gemma":[0.003188986,0.0003250366,0.00007096332,0.0008207131,0.00007637412,0.0001982542,0.0003766119,0.0001666693,0.001220053],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001650693,"about_ca_system_score_gemma":0.00008324554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004521593,"about_ca_topic_score_gemma":0.00001289494,"domain_scores_codex":[0.997461,0.0001542085,0.000764754,0.0006041584,0.0003664281,0.0006494544],"domain_scores_gemma":[0.9984173,0.0002071676,0.0001608136,0.0004890056,0.0002148789,0.0005108559],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00004273088,0.0000600469,0.0001627476,0.00008068606,0.00001545956,0.00002951415,0.004924294,0.0001611752,0.9809992,0.01289723,0.0005738424,0.00005311377],"study_design_scores_gemma":[0.002855246,0.0006238979,0.002198501,0.0005616976,0.000214297,0.0001380512,0.002238764,0.00887076,0.9606267,0.01200513,0.008065365,0.001601644],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9804519,0.0001073319,0.00595566,0.01121745,0.0001740811,0.001148146,0.0002334545,0.0002873303,0.0004246223],"genre_scores_gemma":[0.9852307,0.00001037503,0.01331478,0.001121633,0.00005017032,0.0001092154,0.0000324914,0.00005738518,0.00007321685],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02037252,"threshold_uncertainty_score":0.9999202,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400596848","doi":"10.55016/ojs/cdm.v15i2.62857","title":"A subspace based subspace inclusion graph on vector space","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Nuclear Receptors and Signaling","field":"Neuroscience","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Linear subspace; Geometry","authors":[{"name":"Mohammad Ashraf","is_ca":false},{"name":"Mohit Kumar","is_ca":false},{"name":"Ghulam Mohammad","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02762793962611365,"gpt":0.287593333763203,"spread":0.2599653941370894,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002495306,0.0002752931,0.0003543558,0.0001199328,0.0008091976,0.0001411925,0.0004461776,0.00009962804,0.0003348805],"category_scores_gemma":[0.003744016,0.0002383679,0.0001830359,0.0009413159,0.00008719429,0.0001017857,0.0004150545,0.0002829067,0.0008081474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001156571,"about_ca_system_score_gemma":0.00006853809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005268243,"about_ca_topic_score_gemma":0.000003989207,"domain_scores_codex":[0.9980355,0.0001351113,0.0003097538,0.000494545,0.0005489551,0.0004761407],"domain_scores_gemma":[0.9983124,0.0005268913,0.0001413671,0.0004256208,0.0001114073,0.0004823002],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001388424,0.0002524991,0.00002557397,0.0001006522,0.00001220657,0.00003457658,0.004431542,0.001623152,0.795361,0.1879863,0.009883634,0.000149977],"study_design_scores_gemma":[0.001610293,0.0007981658,0.0000497886,0.0003299701,0.00007683515,0.000007621699,0.0004591602,0.07775519,0.8614379,0.00609671,0.05051255,0.0008658746],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4636949,0.00008721034,0.3874748,0.1380165,0.0004806092,0.002346924,0.0009449163,0.0009939701,0.005960178],"genre_scores_gemma":[0.9929284,0.000006919936,0.002971317,0.003653734,0.0001306987,0.00003212683,0.00001090646,0.00005268329,0.0002131477],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5292336,"threshold_uncertainty_score":0.9999698,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3100427284","doi":"","title":"Loose Hamiltonian cycles forced by large (k-2)-degree - sharp version","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Hamiltonian path; Hamiltonian (control theory); Degree (music); Upper and lower bounds; Discrete mathematics; Mathematical analysis; Physics; Graph; Mathematical optimization","authors":[{"name":"Josefran de Oliveira Bastos","is_ca":false},{"name":"Guilherme Oliveira Mota","is_ca":false},{"name":"Mathias Schacht","is_ca":false},{"name":"Jakob Schnitzer","is_ca":false},{"name":"Fabian Schulenburg","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0222772638909818,"gpt":0.3291700127212284,"spread":0.3068927488302466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007617291,0.0004016867,0.0005455475,0.0001762553,0.001232102,0.000124536,0.0006691666,0.0002452165,0.0008366462],"category_scores_gemma":[0.002034466,0.0003278755,0.000250365,0.000428271,0.0002669306,0.0001884536,0.000511107,0.0002522739,0.0003984884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001614504,"about_ca_system_score_gemma":0.00004689102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004726948,"about_ca_topic_score_gemma":0.00002778578,"domain_scores_codex":[0.9975207,0.00009557219,0.0006549743,0.0004384292,0.0004726266,0.0008176341],"domain_scores_gemma":[0.9973563,0.0005006099,0.0002353074,0.001101014,0.0004591116,0.0003476665],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004144002,0.0001748357,0.0000556669,0.00009778592,0.0001173291,0.0000047503,0.002332777,5.493972e-7,0.002152011,0.8778206,0.1166712,0.0005310284],"study_design_scores_gemma":[0.001663124,0.0002716396,0.0002026279,0.0002620648,0.0002459027,0.00002497583,0.0006722788,0.002058734,0.01016001,0.9095249,0.0741618,0.0007519764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3992557,0.0004670404,0.537957,0.002553426,0.001272014,0.002697898,0.009693929,0.001026516,0.04507654],"genre_scores_gemma":[0.9739513,0.00001445947,0.02162651,0.0004682545,0.0003593267,0.00007137715,0.0001492889,0.00008520816,0.003274222],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5746957,"threshold_uncertainty_score":0.9999173,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3161412004","doi":"10.55016/ojs/cdm.v17i2.72886","title":"Heesch numbers of unmarked polyforms","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Quasicrystal Structures and Properties","field":"Materials Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":true,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Compute Canada","keywords":"Simple (philosophy); Computation; Computer science; Solver; Algorithm; Mathematics; Theoretical computer science","authors":[{"name":"Craig S. Kaplan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008354561850720256,"gpt":0.261442577098515,"spread":0.2530880152477948,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004493231,0.0001209601,0.0002557217,0.00005677951,0.0004033923,0.00004233601,0.0003553763,0.00002782754,0.00295399],"category_scores_gemma":[0.0002419872,0.00009387122,0.00009178928,0.000266987,0.00008432753,0.00007656348,0.0003457588,0.00009918585,0.00005987034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001116366,"about_ca_system_score_gemma":0.00006367874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008465778,"about_ca_topic_score_gemma":0.000008307265,"domain_scores_codex":[0.9987813,0.00006016613,0.0003710741,0.0001590588,0.0003467943,0.0002815971],"domain_scores_gemma":[0.9992306,0.00007525687,0.0001386184,0.0003471039,0.0001080557,0.0001003755],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001273067,0.0001606911,0.0001015618,0.0001570593,0.00004230429,0.000005633051,0.003717612,0.001386766,0.8013072,0.1858067,0.00665745,0.0005297174],"study_design_scores_gemma":[0.002333312,0.001246494,0.000913795,0.0001749046,0.0002295447,0.0001737567,0.01015312,0.004388228,0.6878622,0.1524117,0.1386424,0.001470628],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9794363,0.000192712,0.01158919,0.001009729,0.0003446402,0.0005359731,0.00214127,0.00008681453,0.004663369],"genre_scores_gemma":[0.995549,0.000002303686,0.003451512,0.0001171833,0.00003139272,0.00007969894,0.00002739388,0.00001399819,0.0007275263],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1319849,"threshold_uncertainty_score":0.9979575,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4412376432","doi":"10.55016/ojs/cdm.v10i1.62182","title":"Expanding polynomials over finite fields of large characteristic, and a regularity lemma for definable sets","year":2015,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"National Science Foundation","keywords":"Lemma (botany); Mathematics; Combinatorics; Finite field; Pure mathematics; Discrete mathematics","authors":[{"name":"Terence Tao","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03380846415234004,"gpt":0.3295930332362433,"spread":0.2957845690839033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001297188,0.0001873592,0.0004730896,0.0001159108,0.0001734569,0.0001686423,0.000474081,0.0001176367,0.000008548843],"category_scores_gemma":[0.002775579,0.0001730684,0.0001023368,0.0002881518,0.00005804409,0.0002690494,0.0006402288,0.00009942442,0.000007368889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001115823,"about_ca_system_score_gemma":0.0001324875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000181492,"about_ca_topic_score_gemma":0.00001245345,"domain_scores_codex":[0.9984064,0.00006477603,0.0005116208,0.0003485953,0.0002361753,0.0004324888],"domain_scores_gemma":[0.9976764,0.0007364976,0.0002052643,0.0006970853,0.0004391599,0.0002455575],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007371113,0.0008318617,0.001313193,0.0006964867,0.0001545463,0.00001409551,0.01056308,0.0002649447,0.00160533,0.9733725,0.006578912,0.004531362],"study_design_scores_gemma":[0.003621273,0.0007307357,0.003855883,0.0002538895,0.0001295098,0.00004550969,0.0003959615,0.5975739,0.006273303,0.3797405,0.006514769,0.0008647068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08508471,0.00008549843,0.9118083,0.001230465,0.0002045791,0.0007453997,0.0006078227,0.00008227483,0.0001510167],"genre_scores_gemma":[0.8375501,0.000003606389,0.162005,0.0001287654,0.00006437982,0.00009591258,0.00002835616,0.0000111887,0.0001127365],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7524654,"threshold_uncertainty_score":0.7057526,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3088613651","doi":"10.55016/ojs/cdm.v16i1.71194","title":"A survey of graph burning","year":2021,"lang":"en","type":"preprint","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graph; Conjecture; Combinatorics; Computer science; Discrete mathematics; Theoretical computer science; Mathematics","authors":[{"name":"Anthony Bonato","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04110074314837459,"gpt":0.3554839238866452,"spread":0.3143831807382707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002315444,0.000340126,0.0008402059,0.0004356835,0.0001763306,0.000342976,0.002361397,0.0002343074,0.00002808009],"category_scores_gemma":[0.005609651,0.0003292507,0.0002916611,0.00157386,0.0001521307,0.0001852405,0.004561781,0.0007144507,0.00002608579],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001330594,"about_ca_system_score_gemma":0.0005145166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006969269,"about_ca_topic_score_gemma":0.00006632196,"domain_scores_codex":[0.9967766,0.0004658065,0.0008372392,0.0006757662,0.0006791042,0.0005654313],"domain_scores_gemma":[0.9936331,0.001088038,0.0004277689,0.002426808,0.002147767,0.0002765114],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002102814,0.0005571348,0.0007916039,0.001171232,0.000584998,0.00007143668,0.005494094,0.01090576,0.0026085,0.9735563,0.0007125766,0.003525359],"study_design_scores_gemma":[0.0009914131,0.0002327593,0.009727581,0.002882115,0.0001348968,0.00003957156,0.0005344877,0.1604033,0.01283004,0.8100673,0.0002963209,0.001860241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01695933,0.0007507601,0.9793805,0.0003661678,0.0002619291,0.0007262146,0.0008546702,0.0001394874,0.0005609724],"genre_scores_gemma":[0.8091154,0.00005675521,0.1901553,0.00003959389,0.0000286917,0.0001637001,0.0002498221,0.00003248233,0.0001581971],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7921561,"threshold_uncertainty_score":0.999916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400596816","doi":"10.55016/ojs/cdm.v16i3.62279","title":"Graphs where each spanning tree has a perfect matching","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Spanning tree; Minimum degree spanning tree; Matching (statistics); Graph; Connectivity; Discrete mathematics; Connected dominating set; Tree (set theory); Minimum spanning tree","authors":[{"name":"Baoyindureng Wu","is_ca":false},{"name":"Heping Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02635374451992335,"gpt":0.3218086747465916,"spread":0.2954549302266682,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008572555,0.0002681755,0.0004070891,0.0002377302,0.0007713956,0.0007512622,0.001098717,0.00009330726,0.00006226888],"category_scores_gemma":[0.001134966,0.0002517147,0.000235023,0.001590144,0.0001241008,0.0005239425,0.0008548329,0.0003891728,0.000252008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000146797,"about_ca_system_score_gemma":0.0002456463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006609854,"about_ca_topic_score_gemma":0.00004368432,"domain_scores_codex":[0.9974582,0.0002094809,0.0004543658,0.0005688948,0.0005475143,0.0007615099],"domain_scores_gemma":[0.9970253,0.0005840179,0.0001134217,0.001378068,0.0005603493,0.0003388994],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005032791,0.0001145362,0.00007436727,0.00007458538,0.0000651525,0.0001052645,0.003019966,0.0004641683,0.007743965,0.9846154,0.0008793495,0.002838246],"study_design_scores_gemma":[0.0007991024,0.000120209,0.0002650183,0.000424421,0.0000447931,0.0002194916,0.00123891,0.02641005,0.01175054,0.9506373,0.007418065,0.0006720705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01643375,0.0006707801,0.9741941,0.00488447,0.0001474002,0.0003881259,0.00007436494,0.0003192082,0.002887777],"genre_scores_gemma":[0.7008958,0.00003191165,0.2970657,0.0002122311,0.00007156476,0.0001412275,0.00002735424,0.0000425707,0.001511595],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6844621,"threshold_uncertainty_score":0.9999935,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3023069363","doi":"10.55016/ojs/cdm.v19i3.75096","title":"note on total co-independent domination in trees","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Junta de Andalucía","keywords":"Mathematics; Combinatorics","authors":[{"name":"Abel Cabrera Martínez","is_ca":false},{"name":"Frank A. Hernández Mira","is_ca":false},{"name":"José M. Sigarreta","is_ca":false},{"name":"Ismael G. Yero","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01549687035414816,"gpt":0.3529796377747737,"spread":0.3374827674206256,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008174633,0.0001603794,0.000201213,0.0004985198,0.0001201253,0.0003315489,0.0005554903,0.00007091531,0.0000296853],"category_scores_gemma":[0.0006533373,0.0001378014,0.00009018124,0.0009576983,0.00005034887,0.0003725839,0.0001864176,0.0002684942,0.0005328507],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003494688,"about_ca_system_score_gemma":0.00009293205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002359578,"about_ca_topic_score_gemma":0.00001715554,"domain_scores_codex":[0.9983401,0.00008407029,0.0003288017,0.0003786061,0.0004694088,0.0003990103],"domain_scores_gemma":[0.9985866,0.0005545052,0.00003535362,0.0005765749,0.0001087706,0.0001381847],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008358721,0.00008176541,0.000006136446,0.00003011982,0.00001075883,0.00004861194,0.001420995,0.0008866149,0.002100903,0.987972,0.0002778358,0.007155902],"study_design_scores_gemma":[0.0007577944,0.0003120024,0.0007798017,0.0005240376,0.00001332205,0.00005386303,0.0002087694,0.4537182,0.01347843,0.5264587,0.003209491,0.0004856364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01377313,0.00008983337,0.9784585,0.003398705,0.0001877991,0.0005717541,0.0001229311,0.0002199025,0.003177447],"genre_scores_gemma":[0.9836233,0.000005944388,0.01534931,0.00005628101,0.00004899489,0.0001302258,0.00001565197,0.0000154367,0.0007548359],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9698502,"threshold_uncertainty_score":0.6848896,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3048753990","doi":"10.55016/ojs/cdm.v18i1.71209","title":"The localization number and metric dimension of graphs of diameter 2","year":2023,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":true,"about_ca":false},"ca_institutions":"Vancouver Island University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metric dimension; Mathematics; Dimension (graph theory); Metric (unit); Combinatorics; Upper and lower bounds; Chordal graph; Discrete mathematics; Metric space; Graph; 1-planar graph; Mathematical analysis","authors":[{"name":"Anthony Bonato","is_ca":true},{"name":"Melissa A. Huggan","is_ca":true},{"name":"Trent G. Marbach","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01131250695302687,"gpt":0.2742144988106574,"spread":0.2629019918576305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007150348,0.00008869087,0.0001878783,0.000187007,0.0001937513,0.00004445819,0.0002567572,0.00004230722,0.000001871733],"category_scores_gemma":[0.0008173924,0.0000582641,0.00006290033,0.002076775,0.0001088779,0.00008678139,0.0002388506,0.00004621948,0.0000240991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009224515,"about_ca_system_score_gemma":0.00002232854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008560813,"about_ca_topic_score_gemma":0.000001658462,"domain_scores_codex":[0.9989723,0.00005132829,0.0003868078,0.000153134,0.0002534385,0.0001829686],"domain_scores_gemma":[0.9984009,0.0005448384,0.0001617503,0.0004626126,0.0003580316,0.00007185537],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002191132,0.00003354554,0.0004308376,0.00004592677,0.00002906912,5.457344e-7,0.000672409,0.0005336164,0.002000396,0.993642,0.001417342,0.00119216],"study_design_scores_gemma":[0.0004270863,0.00009779765,0.0007976352,0.0001539802,0.00005120417,0.000006613796,0.0002473847,0.2791075,0.01503687,0.703374,0.0005222338,0.0001776472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1265928,0.0002661989,0.8708092,0.001345249,0.0001758314,0.0003964519,0.00005089644,0.0001350875,0.0002283447],"genre_scores_gemma":[0.9864028,0.00008434257,0.01337558,0.00003773259,0.000001865719,0.00001200623,0.000006905816,0.000006588954,0.00007218636],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8598101,"threshold_uncertainty_score":0.2375941,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2620630814","doi":"10.55016/ojs/cdm.v14i1.62425","title":"Generating Special Arithmetic Functions by Lambert Series Factorizations","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Factorization; Euler's formula; Series (stratigraphy); Partition (number theory); Lambert W function; Inverse; Arithmetic function; Generating function; Divergent series; Algebra over a field; Arithmetic; Pure mathematics; Combinatorics; Discrete mathematics; Algorithm; Mathematical analysis","authors":[{"name":"Maxie D. Schmidt","is_ca":false},{"name":"Mircea Merca","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01507964982958641,"gpt":0.3020657537032398,"spread":0.2869861038736534,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003679626,0.000427228,0.0006973731,0.0001844827,0.0004967232,0.0002842077,0.0003796376,0.0001740583,0.001758113],"category_scores_gemma":[0.003709188,0.000397904,0.0002165859,0.000638125,0.0001269884,0.0005577675,0.0002458436,0.0003017166,0.001828511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003002787,"about_ca_system_score_gemma":0.00009660324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004901608,"about_ca_topic_score_gemma":0.00002673727,"domain_scores_codex":[0.9972826,0.00007619684,0.0009387162,0.0004562318,0.0005703371,0.0006759172],"domain_scores_gemma":[0.9971009,0.0008975709,0.0002763145,0.000902816,0.0005239414,0.000298455],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001033491,0.000345883,0.0001018466,0.0002962601,0.0001392656,0.000003321733,0.001472504,0.0002548516,0.008794555,0.9235099,0.0649972,0.00007407946],"study_design_scores_gemma":[0.0009103562,0.0002133096,0.00002483373,0.0003220971,0.0003155406,0.00005893037,0.003063683,0.0045033,0.005121919,0.938594,0.04580448,0.001067554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05535736,0.0000732742,0.9089156,0.001994529,0.001094732,0.002205018,0.002204353,0.0006343831,0.02752079],"genre_scores_gemma":[0.2207695,0.00004851989,0.4053159,0.0004022611,0.003107712,0.001138123,0.0008873531,0.0004586449,0.367872],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5035997,"threshold_uncertainty_score":0.9998473,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3196602131","doi":"","title":"Sun toughness and P ≥3 -factors in graphs.","year":2019,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Toughness; Discrete mathematics; Composite material; Materials science","authors":[{"name":"Sizhong Zhou","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01043630366436741,"gpt":0.2555756008409956,"spread":0.2451392971766282,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003461852,0.000140234,0.0002413859,0.000214206,0.00008462017,0.0001332706,0.0003428036,0.00006305846,0.00001332705],"category_scores_gemma":[0.0001863999,0.0001145067,0.00004889204,0.0006611383,0.00003644267,0.000210273,0.0002267818,0.0001076834,0.00008709869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002968048,"about_ca_system_score_gemma":0.0000324054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000217367,"about_ca_topic_score_gemma":0.00001179578,"domain_scores_codex":[0.9989133,0.00003209416,0.0002885895,0.0002869702,0.0001781859,0.0003008017],"domain_scores_gemma":[0.9989887,0.0001689201,0.00006073008,0.0005287037,0.0001109882,0.00014197],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001138634,0.00004932711,0.005278299,0.00002781365,0.00000794698,0.00000203767,0.0009918517,0.0001055146,0.0009611105,0.9922553,0.00017573,0.0001439423],"study_design_scores_gemma":[0.001326822,0.0001648999,0.01206781,0.0003023963,0.00002036909,0.00001809435,0.0004337718,0.05750556,0.004207294,0.9219741,0.001337467,0.0006413915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9207708,0.0001447312,0.07616392,0.001293309,0.0002091612,0.0004509903,0.00002963692,0.0001334277,0.0008039958],"genre_scores_gemma":[0.986694,0.000008582967,0.01296037,0.000121773,0.000001986832,0.00001790147,0.000006117781,0.000007451358,0.0001818459],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07028117,"threshold_uncertainty_score":0.4669448,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2945144629","doi":"10.55016/ojs/cdm.v16i3.71284","title":"Homotopy Type of Independence Complexes of Certain Families of Graphs","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Indian Institute of Technology Bombay; Infosys Foundation","keywords":"Mathematics; Homotopy; Combinatorics; Homotopy sphere; Regular homotopy; Categorical variable; Discrete mathematics; Independence (probability theory); Graph; n-connected; Wedge (geometry); Pure mathematics; Geometry","authors":[{"name":"Samir Shukla","is_ca":false},{"name":"Shuchita Goyal","is_ca":false},{"name":"Anurag Singh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02473329372496672,"gpt":0.306981659783901,"spread":0.2822483660589343,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003031541,0.0001013908,0.0004710203,0.0002455542,0.00005052635,0.00001994887,0.0006921015,0.00006104047,0.00006989331],"category_scores_gemma":[0.001771209,0.00008040067,0.0001475568,0.002876173,0.0001474199,0.0001113886,0.0004361634,0.00007164947,0.000008853235],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001362153,"about_ca_system_score_gemma":0.00008891169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005309928,"about_ca_topic_score_gemma":0.0000187058,"domain_scores_codex":[0.9986887,0.00005766065,0.0005371693,0.000192484,0.0003510416,0.0001729477],"domain_scores_gemma":[0.9976122,0.0003850354,0.0002441191,0.0007091947,0.0009751411,0.00007425746],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003820347,0.0002484351,0.001100174,0.0001025525,0.000101732,0.000004354014,0.000445453,0.0001382566,0.01111721,0.9851909,0.0001988966,0.001348177],"study_design_scores_gemma":[0.001026011,0.0007282798,0.01889711,0.0003820599,0.0003452928,0.00003194218,0.002411998,0.01829089,0.3732343,0.5817329,0.002266981,0.0006522883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1499108,0.0003973654,0.8475088,0.000502471,0.00005794265,0.0001383121,0.0007146022,0.00002620334,0.0007435093],"genre_scores_gemma":[0.9449788,0.00006065416,0.05476849,0.00002299401,0.000004521209,0.000004338392,0.00003151257,0.000002632164,0.00012606],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.795068,"threshold_uncertainty_score":0.3278644,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4390714589","doi":"10.55016/ojs/cdm.v17i1.70935","title":"A note on the fully degenerate Bell polynomials of the second kind","year":2022,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Mathematical Identities","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematics; Bell polynomials; Degenerate energy levels; Difference polynomials; Hahn polynomials; Wilson polynomials; Orthogonal polynomials; Classical orthogonal polynomials; Discrete orthogonal polynomials; Combinatorics; Koornwinder polynomials; Pure mathematics; Algebra over a field; Discrete mathematics; Gegenbauer polynomials; Quantum mechanics; Physics","authors":[{"name":"Dongkyu Lim","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0288789253404306,"gpt":0.3198250354135563,"spread":0.2909461100731258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001360137,0.0003227858,0.0005850219,0.0001142343,0.001149075,0.00007830832,0.001148916,0.00007054907,0.001839547],"category_scores_gemma":[0.004442372,0.0001968013,0.0003493392,0.0006521706,0.000255537,0.00008385228,0.0009797203,0.0004805719,0.00009128249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003097863,"about_ca_system_score_gemma":0.0001546437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003816166,"about_ca_topic_score_gemma":0.00004367974,"domain_scores_codex":[0.9971244,0.0003187867,0.0009426913,0.0003014985,0.0008011378,0.0005114781],"domain_scores_gemma":[0.9946163,0.002947665,0.0005651163,0.001488621,0.0002598283,0.0001224894],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002035526,0.0002569289,0.000003925367,0.0001503386,0.00007789806,0.000002463309,0.002080044,0.0002478978,0.006931834,0.9739655,0.0162365,0.00002632903],"study_design_scores_gemma":[0.0004289922,0.0001318636,0.000018433,0.0001227586,0.0001500316,0.00002556147,0.001383143,0.001057284,0.05090359,0.9343266,0.01114697,0.0003047365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7676494,0.0002616156,0.1499532,0.02621288,0.001355078,0.008009998,0.009543709,0.0003699245,0.03664418],"genre_scores_gemma":[0.9623772,0.000003073113,0.01113291,0.0007911687,0.0001415892,0.000814521,0.00001317569,0.00009598623,0.02463041],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1947277,"threshold_uncertainty_score":0.9990729,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1594941289","doi":"10.55016/ojs/cdm.v6i1.62040","title":"2L-convex polyominoes: Geometrical aspects","year":2011,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Polyomino; Regular polygon; Mathematics; Combinatorics; Geometry","authors":[{"name":"Khalil Tawbe","is_ca":false},{"name":"Laurent Vuillon","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02982236613708421,"gpt":0.2946020199361581,"spread":0.2647796537990739,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003776442,0.0002273996,0.0003270036,0.000385676,0.0001720845,0.0004471347,0.001523331,0.00009371925,0.00003458122],"category_scores_gemma":[0.001659772,0.0002001638,0.0001186635,0.001424955,0.0001044578,0.0008760829,0.0007313419,0.0001589291,0.0005944408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001278752,"about_ca_system_score_gemma":0.0001178245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000914685,"about_ca_topic_score_gemma":0.000001399734,"domain_scores_codex":[0.9982831,0.00002721124,0.0004348036,0.0003988393,0.0003456301,0.0005104109],"domain_scores_gemma":[0.9979738,0.0001550052,0.0001394525,0.001034777,0.0003910645,0.0003058831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002934324,0.0002789553,0.00003947302,0.00003517861,0.00002970781,0.00003146027,0.001244766,4.409297e-7,0.0005101069,0.9870689,0.003391198,0.007366871],"study_design_scores_gemma":[0.0004271071,0.0003247372,0.0006486122,0.0001955497,0.00005007487,0.0001193387,0.0001026801,0.01142584,0.08547495,0.8954912,0.00490221,0.0008376318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001019812,0.0001025744,0.9495856,0.000767622,0.0001073268,0.0003442253,0.00004740025,0.0009829855,0.04704241],"genre_scores_gemma":[0.5800063,0.000003060248,0.4192042,0.0002768143,0.0000315419,0.00006619743,0.000004276452,0.00001648544,0.0003911377],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5789865,"threshold_uncertainty_score":0.8162443,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400596797","doi":"10.55016/ojs/cdm.v15i3.62692","title":"Decomposition of complete tripartite graphs into cycles and paths of length three","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Combinatorics; Mathematics; Decomposition; Path (computing); Discrete mathematics; Computer science; Chemistry","authors":[{"name":"Shanmugasundaram Priyadarsini","is_ca":false},{"name":"A. Muthusamy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01375142081272199,"gpt":0.2541824710650604,"spread":0.2404310502523384,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001645687,0.0001272918,0.0003560866,0.00007291105,0.00005792563,0.00001433215,0.0001179037,0.00005261372,0.00001184847],"category_scores_gemma":[0.00008210887,0.0001193162,0.00008744093,0.0002602884,0.00007580331,0.00006883038,0.00003877238,0.00006888292,0.000008678716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001303083,"about_ca_system_score_gemma":0.000006503757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005106755,"about_ca_topic_score_gemma":0.00001043131,"domain_scores_codex":[0.999169,0.00002837538,0.0004424178,0.000103113,0.0001149884,0.0001420904],"domain_scores_gemma":[0.9994019,0.0001171554,0.00008265657,0.0001841827,0.00009301741,0.0001210324],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004862283,0.00008939061,0.0007504931,0.002012678,0.0003095037,0.000002923313,0.009328158,0.003185339,0.2399182,0.7427364,0.0004080142,0.001210242],"study_design_scores_gemma":[0.003337213,0.0008265202,0.005134739,0.001492147,0.0006152919,0.00002735831,0.003900548,0.3635195,0.1468956,0.4711647,0.001876334,0.001210056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7655113,0.0004765686,0.2323719,0.0001959037,0.00005582264,0.0003834409,0.0005288059,0.00009800719,0.0003781606],"genre_scores_gemma":[0.9969127,0.00002015891,0.002969304,0.00001569871,0.00001707024,0.00002331875,0.00002557211,0.00001499094,0.0000012415],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3603342,"threshold_uncertainty_score":0.4865572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3119622264","doi":"10.55016/ojs/cdm.v15i1.62679","title":"Total colouring of some cartesian and direct product graphs","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":true,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cartesian product; Combinatorics; Mathematics; Bipartite graph; Chromatic scale; Graph; Direct product; Windmill graph; Discrete mathematics; Graph power; Line graph","authors":[{"name":"Kyle MacKeigan","is_ca":true},{"name":"Jeannette Janssen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01224504562014082,"gpt":0.2449382544388957,"spread":0.2326932088187549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002416874,0.0001278816,0.0002811221,0.00008197605,0.0001371292,0.00007572499,0.0002656567,0.00003223851,0.000002726415],"category_scores_gemma":[0.000511629,0.0001107688,0.00006630031,0.0004872398,0.00006774523,0.0001798674,0.000242346,0.00008077094,0.00001356733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001180638,"about_ca_system_score_gemma":0.00004149865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006136072,"about_ca_topic_score_gemma":7.420834e-7,"domain_scores_codex":[0.9989363,0.00003284217,0.0003182755,0.000290444,0.000190518,0.0002316444],"domain_scores_gemma":[0.9990436,0.00009034663,0.00010133,0.0003641102,0.0001711382,0.0002294979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003992543,0.00006251668,0.0001428019,0.0001238055,0.00004365755,0.00000466524,0.002594789,0.0002222528,0.01667025,0.9787825,0.0008155613,0.0005332081],"study_design_scores_gemma":[0.002549097,0.00118243,0.002098737,0.0006446347,0.0002491525,0.00009333685,0.0005440617,0.2119225,0.1540142,0.6237539,0.00145206,0.001495941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7015033,0.002259067,0.2598862,0.03179319,0.0003477578,0.001620506,0.0002987804,0.0007222139,0.001568978],"genre_scores_gemma":[0.9679458,0.000009853262,0.03178486,0.000187042,0.00001041992,0.00001920566,0.000003414124,0.000007682154,0.00003170828],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3550286,"threshold_uncertainty_score":0.451702,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400596743","doi":"10.55016/ojs/cdm.v15i1.67935","title":"3-uniform hypergraphs: modular decomposition and realization by tournaments","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Hypergraph; Realization (probability); Mathematics; Combinatorics; Modular design; Tournament; Decomposition; Discrete mathematics; Element (criminal law); Computer science","authors":[{"name":"Abderrahim Boussaïri","is_ca":false},{"name":"Brahim Chergui","is_ca":false},{"name":"Pierre Ille","is_ca":false},{"name":"Mohamed Zaidi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00590559664333025,"gpt":0.2351990458460217,"spread":0.2292934492026915,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001080969,0.0001337259,0.0001833365,0.00004847004,0.00012421,0.00007046277,0.00009172778,0.00006201134,0.00001711308],"category_scores_gemma":[0.00006148335,0.0001302999,0.00004377568,0.0002356495,0.00002060904,0.0001261549,0.00002485017,0.00007164602,0.00003379469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003982758,"about_ca_system_score_gemma":0.000003980796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001551427,"about_ca_topic_score_gemma":9.571776e-7,"domain_scores_codex":[0.9993093,0.00002073382,0.0002583896,0.0001186361,0.0001141131,0.000178818],"domain_scores_gemma":[0.9995429,0.00002709797,0.00003469918,0.000138885,0.0000572331,0.0001992073],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005276169,0.0001895004,0.000449651,0.001324865,0.000610013,0.00001583713,0.01080831,0.02745029,0.3281815,0.5854787,0.04294573,0.002492848],"study_design_scores_gemma":[0.001989886,0.000335782,0.0002849454,0.0004937091,0.0002961695,0.00005641244,0.001953482,0.8662402,0.0335852,0.06452706,0.02899954,0.001237628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2032848,0.0003687039,0.7931167,0.0005776925,0.00008875478,0.0004307265,0.0004911416,0.0002937052,0.00134767],"genre_scores_gemma":[0.9983758,0.00005321307,0.001194694,0.0001179746,0.0000394695,0.00003934099,0.000137196,0.0000219729,0.00002033492],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8387899,"threshold_uncertainty_score":0.5313474,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4412582169","doi":"10.55016/ojs/cdm.v12i2.62487","title":"Lower Bounds on the Distance Domination Number of a Graph","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; University of Johannesburg; National Research Foundation; National Science Foundation","keywords":"Combinatorics; Mathematics; Domination analysis; Graph; Discrete mathematics; Vertex (graph theory)","authors":[{"name":"Randy Davila","is_ca":false},{"name":"Caleb C. Fast","is_ca":false},{"name":"Michael A. Henning","is_ca":false},{"name":"Franklin Kenter","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02026100834720616,"gpt":0.3484921222010613,"spread":0.3282311138538551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008994577,0.0001387041,0.0002079769,0.00006965156,0.0008894712,0.0003465066,0.001940915,0.00004650146,0.00003430221],"category_scores_gemma":[0.002608732,0.00009285835,0.0001240066,0.0002908726,0.000334672,0.0003547365,0.0004070656,0.0001581976,0.0001418218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006707037,"about_ca_system_score_gemma":0.00004671982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002893856,"about_ca_topic_score_gemma":0.000006403948,"domain_scores_codex":[0.9986438,0.00007274599,0.000290071,0.0002413854,0.0004393138,0.0003126694],"domain_scores_gemma":[0.9965122,0.000570796,0.0002605565,0.002140434,0.0004170809,0.00009894056],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001129806,0.00007714938,0.00006011383,0.00001221313,0.00001730402,0.000002336055,0.0003132819,0.00001713333,0.0003146562,0.998133,0.0004545887,0.0005868924],"study_design_scores_gemma":[0.0003436709,0.00007750151,0.0008929594,0.0001430576,0.00001137308,0.000006232301,0.00006949564,0.007624652,0.004423492,0.9837378,0.00248873,0.0001810094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02125769,0.00001434377,0.9630835,0.006121268,0.0001469601,0.0004814196,0.0001133996,0.00004648775,0.008734932],"genre_scores_gemma":[0.9841904,0.000006190549,0.01487562,0.00007892484,0.00002660868,0.00009740503,0.000002618877,0.000009974269,0.00071226],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9629327,"threshold_uncertainty_score":0.6841183,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2952374475","doi":"10.55016/ojs/cdm.v13i2.62737","title":"Face Module for Realizable Z-matroids","year":2018,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Royal Swedish Academy of Sciences; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation","keywords":"Matroid; Mathematics; Combinatorics; Face (sociological concept); Tutte polynomial; Hilbert–Poincaré series; Graphic matroid; Discrete mathematics; Sociology; Graph","authors":[{"name":"Ivan Martino","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03275326053272644,"gpt":0.3737193537021035,"spread":0.3409660931693771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008694303,0.0004579839,0.0008016189,0.0001839873,0.0006197862,0.0001422663,0.0007139885,0.0002152687,0.0001110156],"category_scores_gemma":[0.009307507,0.0004220408,0.0002704481,0.0006242133,0.0002032207,0.0002368183,0.0002778437,0.0001753204,0.000394794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003446971,"about_ca_system_score_gemma":0.0001195403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003402183,"about_ca_topic_score_gemma":0.00001211779,"domain_scores_codex":[0.997052,0.00005615395,0.000977506,0.0005090554,0.0004755698,0.0009297332],"domain_scores_gemma":[0.9951715,0.001353759,0.0003649983,0.001415858,0.001319287,0.0003745613],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003317332,0.0002501362,0.00000302351,0.0002497305,0.00007956522,0.000001296491,0.001066056,0.00002689455,0.0009824953,0.9710943,0.02603323,0.0001800917],"study_design_scores_gemma":[0.001079057,0.0003942077,0.000002809922,0.0002021195,0.0001696004,0.00001654761,0.0004226858,0.01173707,0.01326046,0.9517013,0.02049146,0.0005226486],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006334397,0.00003577023,0.9811696,0.001076631,0.0006638768,0.00263259,0.0008030719,0.0005533673,0.006730638],"genre_scores_gemma":[0.3135343,0.000006862366,0.6784759,0.0002074008,0.001104765,0.001113214,0.00006928352,0.0002138496,0.005274412],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3071999,"threshold_uncertainty_score":0.9998232,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2150373920","doi":"10.55016/ojs/cdm.v12i2.62601","title":"Group Irregular Labelings of Disconnected Graphs","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Combinatorics; Group (periodic table); Totally disconnected space; Mathematics; Geography; Physics; Locally compact space","authors":[{"name":"Marcin Anholcer","is_ca":false},{"name":"Sylwia Cichacz-Przenioslo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01379689517686602,"gpt":0.2826579197102871,"spread":0.2688610245334211,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006062865,0.0001891017,0.0003657705,0.0001656256,0.0006951067,0.0003198402,0.001538088,0.0000834673,0.0000119808],"category_scores_gemma":[0.001110765,0.0001581856,0.0001580198,0.0002540412,0.0001862989,0.0003749747,0.0005725112,0.0001161616,0.00007122692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002340743,"about_ca_system_score_gemma":0.00004318434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003495342,"about_ca_topic_score_gemma":0.00001156319,"domain_scores_codex":[0.9984364,0.00003772813,0.000494936,0.0003379379,0.0003264885,0.0003664921],"domain_scores_gemma":[0.9968365,0.0001278504,0.0003790036,0.002002297,0.0004482341,0.0002061538],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002295504,0.00009872486,0.0001071446,0.00003285834,0.00003553798,0.000003015472,0.0003914128,0.00001876396,0.007809533,0.9904187,0.0004351868,0.0006468696],"study_design_scores_gemma":[0.0008459213,0.0001382873,0.0008203008,0.0002646817,0.00005696318,0.00001203708,0.0000631561,0.0187968,0.01005871,0.9677651,0.0008179836,0.0003600847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.146367,0.0002399097,0.8453747,0.005003284,0.000423786,0.0005876187,0.0001724217,0.0002843895,0.001546888],"genre_scores_gemma":[0.9088077,0.00001038092,0.09090199,0.00008628651,0.000006936651,0.00003353574,0.00001232312,0.00001210818,0.0001287566],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7624407,"threshold_uncertainty_score":0.645062,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400596751","doi":"10.55016/ojs/cdm.v15i1.62708","title":"Latin Squares and their Bruhat Order","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Latin square; Mathematics; Combinatorics; Class (philosophy); Order (exchange); Relation (database); Cover (algebra); Computer science; Biology; Artificial intelligence","authors":[{"name":"Rosário Fernandes","is_ca":false},{"name":"Henrique F. da Cruz","is_ca":false},{"name":"Domingos Salomão","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01050787619489485,"gpt":0.2220730865490173,"spread":0.2115652103541225,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001033615,0.0001521902,0.0002259964,0.00004800277,0.00009742911,0.00006631247,0.0001117642,0.00005699637,0.00005414455],"category_scores_gemma":[0.0002217472,0.0001216001,0.00004603628,0.0003477457,0.00003239127,0.00006345233,0.00004255418,0.00009515094,0.0001103027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001635638,"about_ca_system_score_gemma":0.00000739366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001095307,"about_ca_topic_score_gemma":0.000002401009,"domain_scores_codex":[0.9993709,0.00002062547,0.00022045,0.0001171397,0.00006751231,0.0002033107],"domain_scores_gemma":[0.9994489,0.0001039169,0.00002198626,0.000175757,0.00006506499,0.0001843607],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002374527,0.00006490391,0.0004022395,0.001136673,0.0003676893,0.00001032069,0.03611978,0.008161978,0.03883358,0.8978299,0.01416185,0.002887381],"study_design_scores_gemma":[0.002589713,0.0004159515,0.00135075,0.0007401606,0.0002281155,0.00004641788,0.01850666,0.6922557,0.03782072,0.1179321,0.1257922,0.002321393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.389124,0.001034626,0.5986108,0.002592335,0.0001891211,0.000791216,0.0007438149,0.0008255029,0.006088533],"genre_scores_gemma":[0.9985318,0.00001204643,0.001081144,0.0001338115,0.00007332941,0.0000389612,0.00001648296,0.00002383406,0.00008863134],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7798977,"threshold_uncertainty_score":0.4958708,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2401383348","doi":"10.55016/ojs/cdm.v20i2.62715","title":"Reversed Dickson polynomials of the (k+1)-th kind over finite fields, II","year":2025,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Finite field; Combinatorics; Permutation (music); Mathematics; Prime (order theory); Generalization; Polynomial; Algebraic number; Discrete mathematics; Physics","authors":[{"name":"Neranga Fernando","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007535830103252515,"gpt":0.2693822721952439,"spread":0.2618464420919913,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004827638,0.0001356124,0.0002483198,0.0001380962,0.0003915929,0.0000732011,0.001050792,0.00008200753,0.00003960007],"category_scores_gemma":[0.0008747748,0.00009792823,0.0002162165,0.001003893,0.00008948166,0.0001176968,0.0007018701,0.0001367653,0.000009967486],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003727557,"about_ca_system_score_gemma":0.00009673182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009441919,"about_ca_topic_score_gemma":0.00001013715,"domain_scores_codex":[0.9989207,0.00008587363,0.0003631041,0.0002071848,0.0001855894,0.0002375534],"domain_scores_gemma":[0.9981686,0.00047556,0.0001426687,0.001018732,0.0001335932,0.00006077109],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007211348,0.00007736235,0.0001220541,0.000035639,0.00004849967,5.407182e-7,0.0009374016,0.00008891302,0.0009568277,0.9903699,0.006563886,0.0007917252],"study_design_scores_gemma":[0.001509372,0.0002107556,0.003435915,0.001022674,0.0002090448,0.000004485513,0.0002457226,0.01824731,0.0334553,0.8854871,0.05560552,0.000566774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03272543,0.0000835667,0.9540989,0.006558383,0.0004499107,0.0004710826,0.0001307145,0.00008180393,0.005400202],"genre_scores_gemma":[0.9915091,0.000007145915,0.006557628,0.0007431497,0.00002823719,0.00002834015,0.000002713712,0.000004841231,0.001118789],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9587837,"threshold_uncertainty_score":0.3993397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400596815","doi":"10.55016/ojs/cdm.v16i1.69407","title":"Direct and inverse problems for restricted signed sumsets in integers","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Division of Human Resource Development; Ministry of Education, India; Indian Institute of Technology Roorkee","keywords":"Mathematics; Combinatorics; Inverse; Abelian group; Integer (computer science); Lambda; Cardinality (data modeling); Wedge (geometry); Sigma; Discrete mathematics; Physics; Geometry; Computer science","authors":[{"name":"Jagannath Bhanja","is_ca":false},{"name":"Takao Komatsu","is_ca":false},{"name":"Ram Krishna Pandey","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02488638337267567,"gpt":0.3159489004040905,"spread":0.2910625170314148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005047029,0.0002373246,0.0005018748,0.0001856595,0.0002639249,0.00007902305,0.0001788705,0.000152492,0.00003443064],"category_scores_gemma":[0.007111903,0.0002040891,0.0001237398,0.0005511924,0.0001044895,0.00009611289,0.0002015531,0.0001511968,0.00000363892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001123874,"about_ca_system_score_gemma":0.00008779074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006073037,"about_ca_topic_score_gemma":0.0001258413,"domain_scores_codex":[0.9983938,0.0001047247,0.0005606469,0.0003392709,0.0001806829,0.0004209143],"domain_scores_gemma":[0.997379,0.001484099,0.0001330677,0.0004887352,0.0003442971,0.0001708244],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003973454,0.0001715756,0.0001308604,0.0004989982,0.0001086505,0.00001918194,0.004703524,0.00003507183,0.004548022,0.9850529,0.004373621,0.000317822],"study_design_scores_gemma":[0.001572933,0.0001010966,0.0001847111,0.0003857503,0.0001396414,0.00002569061,0.001283235,0.00265361,0.006507494,0.9835568,0.003168915,0.0004201282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7542124,0.0006761324,0.2240449,0.002927372,0.0005976536,0.004866382,0.002286997,0.0004042792,0.009983865],"genre_scores_gemma":[0.9367836,0.00004585397,0.06155503,0.0001939194,0.00007072023,0.0003580613,0.00008866705,0.0000548573,0.0008493319],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1825711,"threshold_uncertainty_score":0.8514126,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400596792","doi":"10.55016/ojs/cdm.v16i1.68085","title":"A neighborhood condition for graphs to have restricted fractional (g,f)-factors","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Nuclear Receptors and Signaling","field":"Neuroscience","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Government of Jiangsu Province","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Function (biology); Discrete mathematics","authors":[{"name":"Sizhong Zhou","is_ca":false},{"name":"Zhiren Sun","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02998719724849127,"gpt":0.3230272442340674,"spread":0.2930400469855762,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001202056,0.0001799826,0.0002630341,0.0001520453,0.0004855687,0.0001804998,0.0001738462,0.00009009497,0.0003421232],"category_scores_gemma":[0.005879248,0.0001682992,0.0001759902,0.0005882166,0.00003698174,0.0001408305,0.0000824529,0.0001369072,0.0001397819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001220104,"about_ca_system_score_gemma":0.0001000814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003133427,"about_ca_topic_score_gemma":0.000004852505,"domain_scores_codex":[0.9984998,0.00006398754,0.0003657371,0.0003895344,0.0003038916,0.0003770143],"domain_scores_gemma":[0.9981406,0.0007926063,0.0001054575,0.0003109985,0.0003714668,0.0002788714],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00003692291,0.0002874329,0.0001544506,0.00004131651,0.00002987218,0.00001088463,0.0007991625,0.000370653,0.4840467,0.5043225,0.009746504,0.0001536963],"study_design_scores_gemma":[0.001828449,0.0004503458,0.0007887126,0.0002193652,0.000180207,0.00007062845,0.002093295,0.01167321,0.711679,0.1974514,0.07256836,0.0009969216],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3853016,0.00002185619,0.6007367,0.005537841,0.0005935815,0.001531449,0.00392288,0.0002427074,0.002111351],"genre_scores_gemma":[0.9939294,0.000004492821,0.004295187,0.0007539285,0.00009733215,0.0001336033,0.0001591914,0.00003382014,0.0005930606],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6086278,"threshold_uncertainty_score":0.7038434,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3114956369","doi":"10.55016/ojs/cdm.v16i3.72075","title":"On the real roots of domination polynomials","year":2021,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":true,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Dominating set; Closure (psychology); Cardinality (data modeling); Graph; Domination analysis; Order (exchange); Discrete mathematics","authors":[{"name":"Jason I. Brown","is_ca":true},{"name":"Iain Beaton","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01916133842144236,"gpt":0.3299928174266208,"spread":0.3108314790051784,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000844018,0.0001054526,0.0002026542,0.00009644876,0.0001990577,0.00009070773,0.0006898917,0.00004362618,0.00004294753],"category_scores_gemma":[0.003194045,0.00007400691,0.0000958993,0.0007756103,0.00008134318,0.0001354503,0.0003180398,0.0001189926,0.0000853962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008115144,"about_ca_system_score_gemma":0.0001229356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002195792,"about_ca_topic_score_gemma":0.000005527066,"domain_scores_codex":[0.9986742,0.000172554,0.0003191825,0.0002136221,0.0003638105,0.0002566678],"domain_scores_gemma":[0.9968015,0.001488501,0.0001164782,0.0009684969,0.000535439,0.00008957427],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004667977,0.00006292908,0.000004424779,0.00001037648,0.00001626772,0.000003749991,0.0002922566,0.0001155567,0.01228664,0.9859592,0.0005205692,0.0007233236],"study_design_scores_gemma":[0.000346224,0.00009664585,0.0004145296,0.0001014482,0.00001335961,0.000009124705,0.0002152338,0.01176219,0.1266019,0.8597077,0.0005724753,0.0001591654],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03771812,0.00003912935,0.9493649,0.006685999,0.00009979719,0.0003868063,0.0001080885,0.00005394469,0.005543233],"genre_scores_gemma":[0.9746316,0.00001412027,0.02446814,0.0001370869,0.00003218769,0.00006560995,0.000009207659,0.000009430726,0.0006325931],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9369135,"threshold_uncertainty_score":0.3823801,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403975939","doi":"10.55016/ojs/cdm.v19i2.62694","title":"Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete t-partite graph","year":2024,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Combinatorics; Spanning tree; Mathematics; Discrete mathematics; Minimum spanning tree; Kruskal's algorithm; Minimum degree spanning tree; Trémaux tree; Graph; Line graph; Pathwidth","authors":[{"name":"Xia Hong","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0337211460636568,"gpt":0.2992418798723409,"spread":0.2655207338086841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001408756,0.0005264225,0.0007997878,0.001041796,0.0005834482,0.001070465,0.0008725353,0.000176892,0.00001254736],"category_scores_gemma":[0.0003584326,0.0004818833,0.0003014606,0.001400457,0.0002135199,0.0005335904,0.0006072549,0.0004487919,0.00004593152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001241175,"about_ca_system_score_gemma":0.00011766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009150964,"about_ca_topic_score_gemma":0.0002852662,"domain_scores_codex":[0.9960589,0.000129412,0.001130129,0.001015876,0.0006507906,0.001014876],"domain_scores_gemma":[0.9973846,0.0008695435,0.0002054345,0.0007947091,0.0003277849,0.0004179439],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003026309,0.00018473,0.0008703418,0.0002414971,0.0001648551,0.00006155517,0.003766819,0.002868498,0.007542463,0.9808614,0.001365732,0.0020418],"study_design_scores_gemma":[0.002020335,0.0004661562,0.006242364,0.001447144,0.0001429542,0.0001363492,0.0006121909,0.5604764,0.0007796991,0.4227742,0.003863654,0.001038497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1455095,0.002185099,0.8449744,0.003645668,0.0005467142,0.00159798,0.0007056118,0.000595715,0.0002393237],"genre_scores_gemma":[0.9232336,0.00003418517,0.07593866,0.0002741374,0.00002843058,0.0002753158,0.00008869965,0.00004731016,0.00007969303],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7777241,"threshold_uncertainty_score":0.9999665,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4400596836","doi":"10.55016/ojs/cdm.v15i2.67943","title":"Minimum size blocking sets of certain line sets with respect to an elliptic quadric in $PG(3,q)$","year":2020,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Division of Human Resource Development; Science and Engineering Research Board; Ministry of Education, India; Council of Scientific and Industrial Research, India","keywords":"Quadric; Combinatorics; Mathematics; Line (geometry); Blocking (statistics); Type (biology); Blocking set; Connection (principal bundle); Discrete mathematics; Geometry; Pure mathematics; Projective space; Statistics","authors":[{"name":"Bart De Bruyn","is_ca":false},{"name":"Puspendu Pradhan","is_ca":false},{"name":"Binod Kumar Sahoo","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01543163178081314,"gpt":0.2643581330574836,"spread":0.2489265012766704,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003803861,0.0002492882,0.000511259,0.0001463097,0.0000649748,0.0000429482,0.0002870503,0.00009081188,0.00004019589],"category_scores_gemma":[0.0005697916,0.0002216551,0.00007282846,0.0009891287,0.00003342428,0.0000967522,0.00004888453,0.0001790014,0.0000580358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007977418,"about_ca_system_score_gemma":0.000030859,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007745922,"about_ca_topic_score_gemma":0.00006047419,"domain_scores_codex":[0.9984704,0.0000829268,0.0005897584,0.0002403329,0.0002247342,0.0003918458],"domain_scores_gemma":[0.9987671,0.000301406,0.00007507753,0.0004254832,0.0001144351,0.0003165202],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00080679,0.000924648,0.002167388,0.00447242,0.0008277086,0.0002880708,0.1001025,0.5487313,0.1695361,0.1684053,0.001984692,0.00175315],"study_design_scores_gemma":[0.005720237,0.003383455,0.002990688,0.003899522,0.0005229089,0.0001105687,0.01641099,0.8658021,0.07080363,0.02349934,0.003729542,0.003126991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9217659,0.0001231948,0.07529522,0.0007206639,0.00007038261,0.000891789,0.0003240316,0.0002142737,0.0005945855],"genre_scores_gemma":[0.9947147,0.000003266076,0.004975442,0.00008557214,0.00004700615,0.00007511529,0.00002022554,0.00004601544,0.00003268384],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3170709,"threshold_uncertainty_score":0.9038834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4412582204","doi":"10.55016/ojs/cdm.v12i2.62488","title":"Split (n + t)-color partitions and 2-color F-partitions","year":2017,"lang":"en","type":"article","venue":"Contributions to Discrete Mathematics","topic":"Color Science and Applications","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Council of Scientific and Industrial Research, India","keywords":"Combinatorics; Mathematics","authors":[{"name":"Meenakshi Rana","is_ca":false},{"name":"J. K. Sareen","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01482414625906138,"gpt":0.331935284873171,"spread":0.3171111386141097,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000201453,0.0001570722,0.0002192913,0.00005617021,0.002252489,0.0004853785,0.0003815498,0.00003959368,0.0003933492],"category_scores_gemma":[0.0001577147,0.0001437146,0.00009586065,0.0001382354,0.0002590634,0.000297069,0.0002294129,0.0001128918,0.0005069786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003632865,"about_ca_system_score_gemma":0.00007653682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004756931,"about_ca_topic_score_gemma":0.00003996011,"domain_scores_codex":[0.9989225,0.00001408046,0.0002857801,0.0002759196,0.0001393163,0.0003623505],"domain_scores_gemma":[0.998472,0.0001079732,0.0001602964,0.0008105145,0.0001849028,0.0002643127],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002077784,0.0001660148,0.00131341,0.000007874933,0.0000326007,5.847247e-7,0.0003361519,0.00006370728,0.001277641,0.9920309,0.003889208,0.0008798505],"study_design_scores_gemma":[0.00147142,0.000186092,0.03849144,0.0001929053,0.0004261551,0.000009482676,0.002279846,0.01836807,0.005976072,0.8043912,0.1271229,0.001084375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7851921,0.0000265685,0.1471291,0.02176601,0.0001630983,0.00150398,0.003093584,0.0001283985,0.04099718],"genre_scores_gemma":[0.9923615,0.000002827634,0.005135718,0.00008621593,0.0001619497,0.0007577786,0.00006502407,0.00001148192,0.001417489],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2071695,"threshold_uncertainty_score":0.9990464,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}