{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001206785,0.0008548716,0.0006265517,0.003016221,0.001309893,0.002698584,0.001038304,0.0009743441,0.009359952],"category_scores_gemma":[0.005336678,0.0003760208,0.001027054,0.00171701,0.001801898,0.003416206,0.00126905,0.002435784,0.003160884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001380459,"about_ca_system_score_gemma":0.0005616292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001111913,"about_ca_topic_score_gemma":0.002021403,"domain_scores_codex":[0.9990811,0.0001544096,0.0000898299,0.0001476905,0.000344906,0.0001820509],"domain_scores_gemma":[0.9983538,0.0006096953,0.0002677398,0.0001828929,0.0004769861,0.0001088502],"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.00001580961,0.0000111175,0.0001245457,0.00007626163,0.000005018007,0.0001060255,0.0002298246,0.0005120016,0.001919869,0.9832381,0.00190314,0.01185821],"study_design_scores_gemma":[0.000006272177,0.0000244319,0.0002060405,0.00004977623,0.00001634066,0.0004034727,0.000103891,0.01012715,0.004095139,0.9745612,0.01035528,0.00005102335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1040892,0.008948215,0.6309375,0.001932323,0.002778499,0.000147104,0.0004497341,0.0009646145,0.2497529],"genre_scores_gemma":[0.8124317,0.004335895,0.1345963,0.001069389,0.001453073,0.0001500187,0.0004126047,0.0006477658,0.0449033],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009359952,"threshold_uncertainty_score":0.03131217,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006752083,0.0004464088,0.0004597097,0.00189341,0.001319806,0.001163812,0.0005930651,0.0006712995,0.003956871],"category_scores_gemma":[0.002519087,0.00020274,0.0005377613,0.001367342,0.001928393,0.00407753,0.001114155,0.001441075,0.0005408881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008266293,"about_ca_system_score_gemma":0.0005111558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005856996,"about_ca_topic_score_gemma":0.0005558449,"domain_scores_codex":[0.9994936,0.00009991151,0.00002460217,0.0001138852,0.0001736646,0.00009433008],"domain_scores_gemma":[0.9990238,0.0003037874,0.0001723866,0.00009853424,0.0002840986,0.0001174292],"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.00001820327,0.000008519496,0.0003131217,0.00005178275,0.000004453243,0.0001028414,0.0001646521,0.001209339,0.001223346,0.9877962,0.00098066,0.008126923],"study_design_scores_gemma":[0.00001292917,0.00004105164,0.000746987,0.00004004538,0.00001013804,0.0006056515,0.0001814257,0.0210182,0.001209614,0.9619095,0.01418781,0.00003661854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.4944106,0.007496789,0.3307718,0.002202577,0.0008986688,0.00009508768,0.0004932075,0.0002520347,0.1633793],"genre_scores_gemma":[0.9301116,0.002940143,0.04638674,0.0004920874,0.0007240476,0.00008491616,0.0002580808,0.00009483712,0.01890758],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.003956871,"threshold_uncertainty_score":0.01323712,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003005011,0.00145946,0.001105379,0.003424128,0.00233941,0.004381681,0.002165629,0.0022294,0.009260682],"category_scores_gemma":[0.008367628,0.0007800574,0.001704036,0.002259886,0.005226367,0.007568236,0.003091627,0.00410144,0.002698674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001797747,"about_ca_system_score_gemma":0.001113708,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008588543,"about_ca_topic_score_gemma":0.0008959182,"domain_scores_codex":[0.9980304,0.0004246487,0.0001605279,0.0002808693,0.00079464,0.0003089862],"domain_scores_gemma":[0.9977667,0.0008169335,0.000228283,0.0003211751,0.0006703938,0.0001965762],"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.000004415881,0.00000680031,0.00002652315,0.00001413481,0.000002106278,0.00004065609,0.0001118153,0.0002166424,0.0003252132,0.995565,0.0005573838,0.003129299],"study_design_scores_gemma":[0.000005212406,0.000008471276,0.00004653079,0.00001655023,0.000003556773,0.0001119208,0.00004724574,0.003874906,0.000473598,0.9927194,0.002675899,0.00001668799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05742034,0.001661935,0.8012106,0.00149119,0.001055969,0.0001232648,0.0002345189,0.000394241,0.136408],"genre_scores_gemma":[0.5957294,0.002041543,0.3506826,0.001641765,0.001277984,0.0003774795,0.0004314136,0.0006393485,0.04717838],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009260682,"threshold_uncertainty_score":0.03098005,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001113444,0.001748474,0.001215314,0.003508891,0.002046668,0.002602456,0.001399864,0.001133046,0.02364129],"category_scores_gemma":[0.003910304,0.000855297,0.002757426,0.005441153,0.002906355,0.006869667,0.001913461,0.003365942,0.00436878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002089948,"about_ca_system_score_gemma":0.0006876735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004464288,"about_ca_topic_score_gemma":0.003637169,"domain_scores_codex":[0.9988683,0.0001653162,0.00007658324,0.0003665494,0.0003101166,0.0002131945],"domain_scores_gemma":[0.9976974,0.001140397,0.0002318391,0.0002525704,0.0003312525,0.0003465343],"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.0001222411,0.000078891,0.001235528,0.000547563,0.00005763713,0.0002330678,0.0009346661,0.006033144,0.002050595,0.9286391,0.01642477,0.04364273],"study_design_scores_gemma":[0.00002199958,0.00007385021,0.001129583,0.00009739011,0.00005721972,0.0003482333,0.000268292,0.01184833,0.0009910689,0.9444832,0.04064821,0.00003260543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1282352,0.02297976,0.5265879,0.004760189,0.001316814,0.0002540803,0.004104838,0.002165946,0.3095952],"genre_scores_gemma":[0.7183325,0.02447037,0.1214304,0.00315704,0.00387786,0.0004345895,0.006336502,0.00226201,0.1196989],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02364129,"threshold_uncertainty_score":0.07908797,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001941094,0.001210132,0.0006892745,0.002255676,0.001799769,0.002336822,0.001061921,0.001413689,0.01016366],"category_scores_gemma":[0.004325667,0.0004769796,0.001674514,0.001376521,0.005035294,0.007940563,0.006167852,0.004069728,0.001230379],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002058517,"about_ca_system_score_gemma":0.001319236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001513119,"about_ca_topic_score_gemma":0.001064074,"domain_scores_codex":[0.9992185,0.000168924,0.00004605427,0.0001711977,0.0002598279,0.0001355379],"domain_scores_gemma":[0.9978033,0.001236059,0.0001143076,0.0001891155,0.0004475755,0.000209659],"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.000006116657,0.00001068847,0.0000694698,0.00004140559,0.000004080214,0.0000710983,0.0001126674,0.0003224027,0.0004915482,0.9947514,0.001141276,0.002977851],"study_design_scores_gemma":[0.00001883348,0.00002523086,0.0002440844,0.00004010876,0.00001225069,0.0003006172,0.0001600965,0.003376978,0.001446774,0.9725655,0.02178614,0.00002333525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.04700123,0.002841548,0.80134,0.01397538,0.001701874,0.0002021452,0.0008708792,0.0007208951,0.1313459],"genre_scores_gemma":[0.8123398,0.005320244,0.1417607,0.004218152,0.00177594,0.0007948453,0.0007092258,0.0003743878,0.03270684],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01016366,"threshold_uncertainty_score":0.03400087,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006482614,0.0004633074,0.0003874246,0.001345148,0.0004608345,0.001702998,0.0004676092,0.0005993256,0.006498192],"category_scores_gemma":[0.005497191,0.0002240072,0.0002899241,0.0009207039,0.00184033,0.002112153,0.0006912378,0.001324794,0.0009957881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004891246,"about_ca_system_score_gemma":0.0004451109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002784257,"about_ca_topic_score_gemma":0.0002829792,"domain_scores_codex":[0.9996033,0.0001019683,0.00001789034,0.00005222162,0.0001583642,0.00006629487],"domain_scores_gemma":[0.9986707,0.0005714159,0.0002197265,0.00007455156,0.0003114056,0.0001521967],"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.00002931467,0.000017819,0.0004178403,0.00002861805,0.000003650238,0.0001805521,0.0001194622,0.00123517,0.003609342,0.9835641,0.0007735134,0.0100206],"study_design_scores_gemma":[0.00001560073,0.00004316986,0.001239853,0.00002707611,0.000008248712,0.0005367309,0.0001071919,0.02121352,0.005595847,0.9671737,0.003996844,0.00004226981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5931232,0.001317343,0.2422614,0.001129021,0.0007125733,0.00006871286,0.0002036478,0.0003506086,0.1608334],"genre_scores_gemma":[0.9620347,0.0006152052,0.01831022,0.0001812865,0.0001755763,0.00004077782,0.00008328725,0.0001189835,0.01843992],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006498192,"threshold_uncertainty_score":0.02173859,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009069298,0.0004398389,0.0005006479,0.001161435,0.001189856,0.001552909,0.0005898055,0.0006900487,0.004050001],"category_scores_gemma":[0.001633773,0.0003104903,0.000824945,0.001033915,0.002876661,0.005753675,0.002809719,0.002221034,0.0005285872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001017314,"about_ca_system_score_gemma":0.0003325485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001352787,"about_ca_topic_score_gemma":0.001826665,"domain_scores_codex":[0.9992471,0.0001957464,0.00003592914,0.0001632142,0.0002334617,0.0001245858],"domain_scores_gemma":[0.9990926,0.0002853136,0.00009385461,0.0001795991,0.0002131397,0.0001354491],"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.00002138375,0.000005384115,0.0001515222,0.00002420991,0.000003096508,0.0001173417,0.0003547647,0.0004584936,0.001095514,0.9921618,0.0005724975,0.005033994],"study_design_scores_gemma":[0.000008465709,0.00003723928,0.0006074912,0.00002203171,0.0000123112,0.0006592088,0.00033671,0.005971711,0.001322177,0.9678574,0.02314308,0.00002217655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4742017,0.002698997,0.2978849,0.001995652,0.0002717296,0.000102483,0.0004276964,0.000638992,0.2217778],"genre_scores_gemma":[0.9358299,0.0006467242,0.03951544,0.0003786505,0.0000848018,0.00007779698,0.0002196908,0.00007193536,0.02317516],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004050001,"threshold_uncertainty_score":0.01354855,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009720848,0.0007849105,0.0004631454,0.001662593,0.001228641,0.002024399,0.001018952,0.0009396712,0.00770788],"category_scores_gemma":[0.003652421,0.0002172302,0.0008437061,0.0007483877,0.002194127,0.003246506,0.001386803,0.001871622,0.001484275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007155325,"about_ca_system_score_gemma":0.0003663258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002098571,"about_ca_topic_score_gemma":0.0002068287,"domain_scores_codex":[0.9995444,0.0001021274,0.0000284446,0.00007097678,0.0001854313,0.00006850434],"domain_scores_gemma":[0.9992478,0.000255913,0.0001284346,0.0001165641,0.0001271658,0.0001240153],"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.00002150193,0.00001737573,0.0003020887,0.0000216483,0.000003457811,0.0001691096,0.0001899401,0.000641698,0.002521212,0.9898023,0.0004868809,0.005822874],"study_design_scores_gemma":[0.00002026426,0.00003095747,0.0003801816,0.00001990634,0.000009336643,0.0004572616,0.0001001491,0.01331485,0.002231413,0.9786667,0.004748304,0.00002086895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5554081,0.0008804961,0.280257,0.001134715,0.0009958032,0.0001145036,0.0001725447,0.0004371984,0.1605996],"genre_scores_gemma":[0.9363678,0.0006155228,0.0325392,0.0003013381,0.0006239168,0.0001032654,0.0001186873,0.0001593909,0.02917099],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00770788,"threshold_uncertainty_score":0.02578545,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000429607,0.0005653773,0.0004957138,0.003184691,0.001044335,0.001094401,0.0007546804,0.000507275,0.003998016],"category_scores_gemma":[0.002351452,0.0003633789,0.0006243855,0.001544515,0.001029934,0.001654759,0.0009917349,0.001115546,0.001111187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005893012,"about_ca_system_score_gemma":0.0008724158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001264329,"about_ca_topic_score_gemma":0.002465868,"domain_scores_codex":[0.9996766,0.00007609447,0.00002789874,0.00009076092,0.00009076118,0.00003789736],"domain_scores_gemma":[0.9990475,0.0003103586,0.00008380358,0.0002051502,0.0002494016,0.0001038146],"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.0001590084,0.0002139599,0.004286651,0.0003673761,0.00009181531,0.0004780256,0.0009379082,0.01411891,0.04869867,0.6527754,0.008101131,0.269771],"study_design_scores_gemma":[0.000106989,0.0002654129,0.002843672,0.000102005,0.00008055645,0.0009698461,0.0005866028,0.2060992,0.02463902,0.7223576,0.04177484,0.0001741537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06524788,0.0003300374,0.918247,0.000230062,0.0001510812,0.0002087622,0.0003651045,0.0009418266,0.01427829],"genre_scores_gemma":[0.2523817,0.0003108619,0.7398378,0.0001318746,0.00008531753,0.0001940651,0.0005670101,0.0001719767,0.006319447],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003998016,"threshold_uncertainty_score":0.01337469,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005758488,0.001380954,0.001444067,0.001312119,0.003140212,0.002391833,0.003583757,0.002966038,0.02444142],"category_scores_gemma":[0.02079652,0.0005784458,0.00120155,0.001930826,0.005939946,0.01320106,0.003575004,0.006117212,0.003705571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001187543,"about_ca_system_score_gemma":0.0006663561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003077487,"about_ca_topic_score_gemma":0.002210341,"domain_scores_codex":[0.9968331,0.00101272,0.0001433409,0.0007969467,0.0007295257,0.0004843294],"domain_scores_gemma":[0.9833061,0.01119786,0.0008698603,0.001951748,0.001522613,0.001151871],"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.000459514,0.0001328152,0.003105686,0.0003866093,0.00004891868,0.0006684203,0.0007814949,0.01068629,0.001646652,0.8489261,0.09845158,0.03470598],"study_design_scores_gemma":[0.00009904257,0.0001630342,0.001770282,0.0001394831,0.00003080891,0.0003493091,0.0005753858,0.01200443,0.001065612,0.9222404,0.06147469,0.0000875277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1166093,0.01943859,0.3200715,0.252528,0.01693639,0.000123526,0.001569731,0.002807484,0.2699154],"genre_scores_gemma":[0.7475027,0.01391547,0.1000967,0.0372343,0.02049433,0.0003599023,0.00248447,0.001258116,0.07665401],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02444142,"threshold_uncertainty_score":0.0817647,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003014288,0.0003613631,0.0003105874,0.0007656735,0.0005555411,0.0005433961,0.0004737183,0.0002630875,0.002342517],"category_scores_gemma":[0.00120335,0.0002542032,0.0007853613,0.0004054661,0.0008468453,0.001095099,0.0007524667,0.0007328176,0.0005369543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003686306,"about_ca_system_score_gemma":0.0005085999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005443925,"about_ca_topic_score_gemma":0.0009296431,"domain_scores_codex":[0.9996346,0.00006888054,0.00002274804,0.0001006678,0.0001152312,0.00005783691],"domain_scores_gemma":[0.999094,0.000258325,0.00010645,0.0003093642,0.0001497843,0.0000820241],"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.0002714942,0.0002155062,0.006789945,0.0003256784,0.00006380315,0.0009595463,0.001313386,0.0277003,0.1648151,0.6347046,0.003916499,0.1589241],"study_design_scores_gemma":[0.00007665368,0.0004712506,0.005310815,0.00006534495,0.0001464977,0.001212303,0.0006964142,0.1478775,0.1360271,0.6619353,0.04607296,0.0001078127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2419828,0.00007606584,0.743964,0.0001424166,0.00005930571,0.0001770975,0.0002449978,0.00119943,0.01215388],"genre_scores_gemma":[0.6269883,0.0001533167,0.3655666,0.0000746807,0.00004327223,0.0001194364,0.0008175085,0.0002757117,0.005961275],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002342517,"threshold_uncertainty_score":0.007836521,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005674674,0.0007686533,0.00058687,0.0008692117,0.001047708,0.003042036,0.001167968,0.001437051,0.003481821],"category_scores_gemma":[0.006085056,0.0006605507,0.0006485747,0.001556048,0.001886822,0.004770231,0.001919951,0.001488613,0.0004162982],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001197638,"about_ca_system_score_gemma":0.0006284045,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002097139,"about_ca_topic_score_gemma":0.002210135,"domain_scores_codex":[0.999018,0.0002640327,0.00005251086,0.0003479613,0.0001365153,0.000180998],"domain_scores_gemma":[0.9942338,0.003864544,0.0007949209,0.0005672403,0.0001907692,0.0003486573],"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.001076217,0.0002857646,0.0120979,0.0005930887,0.0001191567,0.0004841579,0.0007327842,0.122552,0.01782737,0.7231573,0.009493637,0.1115806],"study_design_scores_gemma":[0.00006280949,0.0000548132,0.001748939,0.00004417653,0.00004203523,0.0002715994,0.0002696246,0.1171373,0.00532604,0.8675327,0.00747546,0.00003459353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6483034,0.002109073,0.320757,0.001845213,0.0001578199,0.000182519,0.001030483,0.0005572207,0.02505716],"genre_scores_gemma":[0.9107583,0.001291774,0.07853687,0.0003272592,0.0001567088,0.0001376003,0.001072155,0.0001526462,0.00756668],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003481821,"threshold_uncertainty_score":0.01164788,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006553773,0.0004118681,0.0005589605,0.001767173,0.001818959,0.002423981,0.0004531836,0.0005919721,0.002851014],"category_scores_gemma":[0.002949505,0.0003320606,0.0007788222,0.0008589993,0.003182992,0.003523504,0.001815866,0.0008658362,0.00026581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001467764,"about_ca_system_score_gemma":0.0003120263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009442628,"about_ca_topic_score_gemma":0.0007243959,"domain_scores_codex":[0.9993157,0.0001455413,0.00004759915,0.0001560927,0.0001613157,0.0001736813],"domain_scores_gemma":[0.9982442,0.0007753947,0.0003748318,0.0002286869,0.0001107411,0.0002660649],"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.0001116027,0.0000453425,0.005786674,0.00004275528,0.00001755862,0.0002449818,0.001597091,0.004099817,0.005673008,0.9760592,0.0002066088,0.006115375],"study_design_scores_gemma":[0.00002727434,0.0001068225,0.004248673,0.00001877894,0.00002055934,0.0003582463,0.0006232346,0.01664534,0.008220572,0.966493,0.00320872,0.00002895041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9792073,0.0001329917,0.01319659,0.0001250065,0.00001131747,0.00001659446,0.00003768227,0.00003284838,0.007239651],"genre_scores_gemma":[0.99544,0.00008637263,0.002240434,0.00001641584,0.00003284453,0.00001934281,0.00007995479,0.00001197236,0.00207263],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002851014,"threshold_uncertainty_score":0.01064944,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008662192,0.0004439348,0.0003398092,0.001798695,0.0008091627,0.001271148,0.0005906919,0.0004739417,0.006851587],"category_scores_gemma":[0.003448447,0.0001788555,0.0004240749,0.001212483,0.001371553,0.002444407,0.0007617521,0.001363985,0.001211298],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008276319,"about_ca_system_score_gemma":0.0005903966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009500287,"about_ca_topic_score_gemma":0.0009197833,"domain_scores_codex":[0.9995721,0.00008093978,0.00001433547,0.00005568477,0.0001635184,0.0001134628],"domain_scores_gemma":[0.9993532,0.0002105516,0.0001095152,0.00004039904,0.0001959968,0.00009040491],"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.00001557933,0.00001033602,0.0001710129,0.00001941649,0.00000174004,0.00006261996,0.000093498,0.001480645,0.001711795,0.9880069,0.0006657232,0.007760637],"study_design_scores_gemma":[0.00001322953,0.00003397421,0.0007017486,0.00003639871,0.000007540257,0.0004422369,0.0001460235,0.03711531,0.002252555,0.9508877,0.008329836,0.00003339575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4051064,0.002674009,0.3747777,0.001313132,0.0007632494,0.0001013231,0.0003457397,0.0002548025,0.2146637],"genre_scores_gemma":[0.9366526,0.001457209,0.03180495,0.0003091335,0.000581061,0.00007538641,0.0002347705,0.0001383673,0.02874653],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006851587,"threshold_uncertainty_score":0.02292085,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001066194,0.0006848119,0.0007725813,0.001111485,0.001421593,0.002170542,0.001873909,0.001126098,0.008729117],"category_scores_gemma":[0.009697374,0.0007946088,0.0008630094,0.0009137574,0.001995359,0.004645117,0.003351199,0.002409925,0.0007879917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009627499,"about_ca_system_score_gemma":0.0004955156,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001277774,"about_ca_topic_score_gemma":0.002048412,"domain_scores_codex":[0.9991308,0.0001590588,0.00004488393,0.0002523791,0.0001469961,0.0002659103],"domain_scores_gemma":[0.9946461,0.002606965,0.0005705382,0.0008920945,0.0004514073,0.0008329696],"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.0005000833,0.00008142021,0.005005381,0.000413856,0.00007493259,0.0006295084,0.0006786775,0.03797913,0.01181493,0.924541,0.004802286,0.01347873],"study_design_scores_gemma":[0.00006385844,0.00008315448,0.001823143,0.00006738218,0.00004454935,0.0004372825,0.0003593644,0.1123877,0.006803166,0.873756,0.004132423,0.00004197607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7585171,0.001242332,0.1920194,0.001362858,0.0001586422,0.00008938281,0.0009528644,0.0004905559,0.0451669],"genre_scores_gemma":[0.975247,0.0003272403,0.0179452,0.0003835318,0.00007460979,0.00009234789,0.0004516218,0.0001272236,0.005351306],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008729117,"threshold_uncertainty_score":0.02920187,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001710243,0.0005801622,0.0006905753,0.002018482,0.001392581,0.002233649,0.0009803846,0.0008493892,0.004064432],"category_scores_gemma":[0.008883841,0.0003212258,0.0006584752,0.001530007,0.00259351,0.004087295,0.001005693,0.00187203,0.0008454428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001334019,"about_ca_system_score_gemma":0.0004873215,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007242223,"about_ca_topic_score_gemma":0.0006479267,"domain_scores_codex":[0.9991677,0.0001754348,0.00005509561,0.0001296087,0.000281749,0.0001905099],"domain_scores_gemma":[0.9972478,0.001652487,0.000405827,0.0001886011,0.0003668999,0.0001383831],"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.00001714181,0.000008065234,0.0002740462,0.00003505644,0.000003266104,0.0001250217,0.0002957032,0.001153296,0.001408855,0.9900794,0.0006180084,0.005982253],"study_design_scores_gemma":[0.000008175961,0.00001421994,0.0002777108,0.00001965335,0.000007223054,0.0002336344,0.00007901643,0.01143826,0.0014181,0.9840716,0.00241407,0.00001831235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4451403,0.004059806,0.4558785,0.002092566,0.0006227834,0.00009225751,0.0004073554,0.000448681,0.09125773],"genre_scores_gemma":[0.9539566,0.001397264,0.02956386,0.0004400629,0.0004779668,0.0001244267,0.0002602616,0.0002021002,0.01357738],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004064432,"threshold_uncertainty_score":0.01359689,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001042634,0.0003914,0.0003506881,0.001541266,0.001206703,0.002203971,0.0007123435,0.0006110467,0.00447489],"category_scores_gemma":[0.002443646,0.0003163033,0.0007265111,0.001325112,0.002485858,0.004032524,0.001448553,0.001535774,0.000780075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002284289,"about_ca_system_score_gemma":0.0007158854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002693648,"about_ca_topic_score_gemma":0.001430255,"domain_scores_codex":[0.9993236,0.0001180175,0.00003346126,0.0001384052,0.0002245717,0.0001619839],"domain_scores_gemma":[0.9988083,0.0004219649,0.0002618893,0.0001208154,0.0001680657,0.0002189136],"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.000009252268,0.00000951422,0.0002454309,0.00001524714,0.000002035569,0.00005808225,0.0002150795,0.000573941,0.0005292319,0.9955432,0.0002620636,0.002537036],"study_design_scores_gemma":[0.000008650869,0.00002573566,0.0004483078,0.00001008915,0.000005884154,0.0001568825,0.00009972043,0.006999581,0.0007952423,0.9875051,0.003928975,0.00001568777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6409276,0.004582783,0.2556644,0.002671513,0.0001969842,0.0001569209,0.001132777,0.0003479207,0.09431911],"genre_scores_gemma":[0.9635296,0.0007377452,0.0215851,0.0002350416,0.0002243852,0.00006455383,0.0003286396,0.00003419533,0.01326063],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00447489,"threshold_uncertainty_score":0.01657373,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006696711,0.0005559158,0.0005572556,0.001576432,0.000528688,0.001049087,0.0005263464,0.0002496016,0.002945569],"category_scores_gemma":[0.003173689,0.000284848,0.0006594468,0.0008171048,0.001831874,0.001327378,0.001152938,0.0007313573,0.0002764951],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008627911,"about_ca_system_score_gemma":0.000264926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001211661,"about_ca_topic_score_gemma":0.0006242397,"domain_scores_codex":[0.9993798,0.0001502007,0.0000247062,0.00009147832,0.000242217,0.0001116674],"domain_scores_gemma":[0.99778,0.001221778,0.0003388107,0.0002522074,0.0001910886,0.000216153],"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.0004277395,0.00008767957,0.006637269,0.0002727508,0.00009823898,0.0008165324,0.0008946992,0.179083,0.05519293,0.6918374,0.001924443,0.06272727],"study_design_scores_gemma":[0.00001873394,0.0002216757,0.01183803,0.00004100326,0.00003484507,0.0009133877,0.000444854,0.6664932,0.01860571,0.2958204,0.005530135,0.00003804131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7723614,0.0007619233,0.2117841,0.0001340889,0.00003478832,0.00002577285,0.0001792242,0.0001048218,0.01461385],"genre_scores_gemma":[0.9717083,0.0005019211,0.02373649,0.000021624,0.00003785559,0.00003420946,0.0003192386,0.0000542858,0.003586023],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002945569,"threshold_uncertainty_score":0.009853899,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009427062,0.001338796,0.0006265327,0.001406126,0.0007985595,0.001315407,0.0009124712,0.001190674,0.005624384],"category_scores_gemma":[0.004466779,0.0003995521,0.0009715086,0.001542717,0.002543613,0.002625953,0.001637202,0.002210311,0.002715193],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001034766,"about_ca_system_score_gemma":0.00106589,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001681015,"about_ca_topic_score_gemma":0.0009935214,"domain_scores_codex":[0.9991892,0.0002946332,0.00005117667,0.0001171293,0.0002580874,0.00008964894],"domain_scores_gemma":[0.9987677,0.0005543478,0.0001000155,0.0001832617,0.0003312355,0.00006349788],"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.00002331735,0.000009948224,0.0001433232,0.00006146387,0.000007317202,0.00005429586,0.0001079095,0.01270477,0.00237351,0.9384,0.002346406,0.04376782],"study_design_scores_gemma":[0.00001686818,0.00004554747,0.00009251911,0.00004085813,0.00001519543,0.0002325826,0.00004232898,0.1317022,0.008048791,0.8325654,0.02713545,0.00006214219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005920532,0.000807385,0.9751544,0.000432257,0.000189945,0.00003715514,0.00007985176,0.0003091545,0.01706924],"genre_scores_gemma":[0.156082,0.003447612,0.8098325,0.0006386698,0.0005880829,0.000252983,0.0002882716,0.0006885715,0.02818133],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005624384,"threshold_uncertainty_score":0.01881546,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007111304,0.0007102766,0.0009720581,0.0009583234,0.000872698,0.001865234,0.001835593,0.001763707,0.009152806],"category_scores_gemma":[0.00207527,0.0006273316,0.00159439,0.001067875,0.002551393,0.002791875,0.001719582,0.002095304,0.001595383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001718122,"about_ca_system_score_gemma":0.00105014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003091648,"about_ca_topic_score_gemma":0.003661462,"domain_scores_codex":[0.9994181,0.0001278175,0.00003333435,0.0001513375,0.000202198,0.00006712706],"domain_scores_gemma":[0.9993703,0.000277935,0.000115512,0.00008373175,0.00008750243,0.00006506238],"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.00001932237,0.00002184047,0.0002687791,0.0001332561,0.00001105195,0.0001219462,0.0001308497,0.2616371,0.002644398,0.7235274,0.004561095,0.006923069],"study_design_scores_gemma":[0.00001667912,0.00003197189,0.0001174778,0.00003521486,0.00000903806,0.0001412673,0.0000487146,0.6824373,0.0008332297,0.299078,0.01722608,0.00002501904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01042026,0.0006597969,0.969806,0.001321861,0.0002971496,0.00006419518,0.0003098339,0.0001555683,0.0169654],"genre_scores_gemma":[0.3484024,0.002328706,0.5775399,0.001306967,0.0007071497,0.001169213,0.0009362571,0.0005320028,0.06707736],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009152806,"threshold_uncertainty_score":0.03061914,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003725022,0.0005163018,0.0007714726,0.002050078,0.001038908,0.001698947,0.001145345,0.0005849673,0.001718959],"category_scores_gemma":[0.02232227,0.0003289362,0.0006606751,0.001778935,0.005613693,0.006064433,0.002313275,0.002043854,0.0002083574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001911676,"about_ca_system_score_gemma":0.0006375855,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001639196,"about_ca_topic_score_gemma":0.0007280508,"domain_scores_codex":[0.9977797,0.000991232,0.00007282513,0.0004071183,0.0005000802,0.0002491723],"domain_scores_gemma":[0.9830183,0.01178355,0.001832226,0.001541922,0.0009545491,0.0008694846],"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.0000690997,0.00001671031,0.002389639,0.00004239105,0.00001268885,0.00008084962,0.0002209704,0.0161488,0.001247414,0.9706417,0.0004617669,0.008667945],"study_design_scores_gemma":[0.00001941013,0.00008084061,0.001470475,0.0000304264,0.00001205915,0.0002299404,0.0001940105,0.1193205,0.002328736,0.8728986,0.00338098,0.00003398414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4165996,0.002990418,0.5550055,0.003342398,0.0001548482,0.00004874894,0.0002575363,0.0002750488,0.02132581],"genre_scores_gemma":[0.9674125,0.001584296,0.02621416,0.0002037863,0.0006348316,0.00007446054,0.0001586162,0.0001033102,0.00361402],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003725022,"threshold_uncertainty_score":0.01970005,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009227386,0.0008242559,0.001215199,0.0007158885,0.000895521,0.00149277,0.001646089,0.001230127,0.003342488],"category_scores_gemma":[0.00704324,0.0004490356,0.0006965605,0.0007394813,0.002020628,0.004327794,0.001297008,0.001469183,0.0002742271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001310497,"about_ca_system_score_gemma":0.0008449245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002406893,"about_ca_topic_score_gemma":0.002415028,"domain_scores_codex":[0.9990376,0.0003243584,0.00004893293,0.0002153228,0.0001343829,0.0002394359],"domain_scores_gemma":[0.9935856,0.004249484,0.0008466686,0.0004129797,0.000200904,0.0007043947],"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.0009881048,0.0003316739,0.002680118,0.0003964526,0.0001160521,0.0007830064,0.0008394826,0.260521,0.01400929,0.6893287,0.005162092,0.02484401],"study_design_scores_gemma":[0.0001279657,0.0001778025,0.001212774,0.00003032081,0.00004481562,0.0002653535,0.0002298585,0.519146,0.003217827,0.4728474,0.002661997,0.00003774065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6664141,0.0002744365,0.3159416,0.0008149574,0.00004064436,0.0001876153,0.0006410497,0.0002914237,0.01539419],"genre_scores_gemma":[0.9387093,0.0003317796,0.055199,0.0001461346,0.00003909407,0.000196402,0.0005484292,0.000129157,0.004700832],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003342488,"threshold_uncertainty_score":0.01118171,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009755806,0.0002665175,0.0003069068,0.0004992792,0.0005850275,0.0007438496,0.0005057828,0.0003085942,0.00361517],"category_scores_gemma":[0.0005936185,0.0002646763,0.0002935331,0.0003929283,0.0009813369,0.0008371362,0.0007453603,0.0004395064,0.0003289779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004307192,"about_ca_system_score_gemma":0.0002424047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001546145,"about_ca_topic_score_gemma":0.001254283,"domain_scores_codex":[0.9998117,0.0000251951,0.00001040614,0.00005050058,0.00005502224,0.00004713281],"domain_scores_gemma":[0.9997725,0.00004610504,0.00005423975,0.00004411431,0.00002709866,0.00005606054],"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.000730103,0.000226771,0.01762523,0.0004375668,0.0001101266,0.002851383,0.001074312,0.1651686,0.1026244,0.6450198,0.00387823,0.06025341],"study_design_scores_gemma":[0.0001452808,0.0004597916,0.02072659,0.00007391591,0.00005597977,0.00258156,0.001395367,0.5992057,0.04669661,0.3193963,0.009158002,0.0001048782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9603622,0.0001924612,0.0295147,0.00004897958,0.00003108706,0.00002415758,0.0001178835,0.00006383909,0.009644597],"genre_scores_gemma":[0.9847469,0.0001726904,0.01134258,0.00003836347,0.000020878,0.00003520309,0.0003179204,0.00003814356,0.003287274],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00361517,"threshold_uncertainty_score":0.01209396,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002195944,0.000407934,0.000379418,0.00148023,0.0009973262,0.001308631,0.0005953574,0.0004401926,0.005482968],"category_scores_gemma":[0.0007097895,0.0001730408,0.0004286845,0.001672926,0.001083764,0.002111893,0.001408535,0.0008391856,0.001172938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006050077,"about_ca_system_score_gemma":0.0005795493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002308512,"about_ca_topic_score_gemma":0.001885858,"domain_scores_codex":[0.9994137,0.000127185,0.00002256015,0.0001663439,0.0001665412,0.0001036577],"domain_scores_gemma":[0.9992931,0.0001037753,0.0001375101,0.0001045693,0.0002302859,0.0001308311],"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.00006764627,0.00004439373,0.0009982751,0.00008361616,0.00002045906,0.0002099469,0.0004844927,0.007207982,0.0037928,0.9433624,0.005043116,0.03868471],"study_design_scores_gemma":[0.00001772101,0.0001322157,0.002287736,0.00004029824,0.00002605677,0.0006171007,0.000612516,0.06989961,0.003987514,0.8768159,0.0455093,0.00005408364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2783438,0.0008365615,0.6323392,0.001042621,0.0001974634,0.0001698107,0.002494762,0.001422522,0.0831534],"genre_scores_gemma":[0.8705493,0.0008734702,0.09551668,0.0004698895,0.0001512105,0.0002651954,0.004842151,0.0002755414,0.02705661],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005482968,"threshold_uncertainty_score":0.01834238,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009406574,0.0006405822,0.0007197165,0.001029495,0.001373943,0.002002461,0.001682234,0.001002023,0.008602639],"category_scores_gemma":[0.008146842,0.0007477012,0.0008002289,0.0008867055,0.001859273,0.004290954,0.003188895,0.002182243,0.0007473998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008940187,"about_ca_system_score_gemma":0.0004543118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001264219,"about_ca_topic_score_gemma":0.002030205,"domain_scores_codex":[0.9992067,0.0001452529,0.00004100782,0.0002281627,0.0001324341,0.0002465099],"domain_scores_gemma":[0.9954538,0.002142912,0.0004874389,0.0007793476,0.0004060802,0.0007303117],"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.0005278997,0.00008777,0.006043233,0.0004547878,0.00008145129,0.0007403728,0.0007631265,0.03952238,0.01485566,0.91636,0.004913069,0.0156502],"study_design_scores_gemma":[0.00007097788,0.00009643891,0.002323792,0.00007141045,0.00005067247,0.000538975,0.0004388977,0.1150913,0.008524189,0.8678184,0.004929333,0.00004557164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7707298,0.001128285,0.1838563,0.001141116,0.0001383686,0.0000856178,0.0008793749,0.0004521885,0.04158889],"genre_scores_gemma":[0.9763229,0.0002942568,0.01734625,0.000336523,0.00006323616,0.00008229054,0.0004268719,0.0001136486,0.005014065],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008602639,"threshold_uncertainty_score":0.02877873,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004784584,0.0005369208,0.0005221312,0.001392726,0.001043987,0.002121672,0.0008395303,0.0005718049,0.01579207],"category_scores_gemma":[0.004204603,0.0003306507,0.000748409,0.001643399,0.002375125,0.004144106,0.001047019,0.001226381,0.00197538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009778328,"about_ca_system_score_gemma":0.0007659526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001269794,"about_ca_topic_score_gemma":0.002708137,"domain_scores_codex":[0.999308,0.00008165342,0.00005201842,0.0001623025,0.0002590154,0.0001370009],"domain_scores_gemma":[0.9979392,0.001071057,0.0001618533,0.0004057375,0.0003192351,0.000102945],"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.0004622711,0.0001312286,0.007159089,0.0003529272,0.00004401361,0.0003455059,0.0007099953,0.07926122,0.0124102,0.7522712,0.008237221,0.1386151],"study_design_scores_gemma":[0.00003798088,0.0001152882,0.001547572,0.0000431899,0.00001905778,0.0001800973,0.0002622768,0.1118476,0.02266409,0.8498189,0.01340842,0.00005549656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6825201,0.0003570947,0.2495885,0.0004687092,0.0001478666,0.0001061994,0.001901099,0.001300676,0.0636099],"genre_scores_gemma":[0.8483219,0.0001960714,0.1361901,0.0001105412,0.00004587705,0.00007146153,0.001954242,0.0002473754,0.01286232],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01579207,"threshold_uncertainty_score":0.05282974,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002100088,0.0004465703,0.0007162914,0.00162291,0.001220986,0.001706979,0.000979298,0.0005606517,0.00282456],"category_scores_gemma":[0.005708843,0.000375032,0.001164756,0.001325112,0.003837548,0.006513467,0.00310824,0.003166033,0.0003259687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001332966,"about_ca_system_score_gemma":0.0004974616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008276035,"about_ca_topic_score_gemma":0.00063994,"domain_scores_codex":[0.9988613,0.0002437145,0.00006389882,0.0002898216,0.0003306914,0.0002105654],"domain_scores_gemma":[0.9954149,0.003189099,0.0003574637,0.0003929836,0.0003263692,0.0003193165],"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.00005698933,0.00001707086,0.0009477601,0.00004869435,0.000007755371,0.000165339,0.0003662942,0.001564085,0.002149222,0.9884057,0.0007157085,0.005555303],"study_design_scores_gemma":[0.00004091584,0.00007754878,0.002138815,0.00003700445,0.00002896833,0.0006180868,0.0002576326,0.02104386,0.00244839,0.9647727,0.008500697,0.00003540586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6025715,0.001622938,0.3023632,0.003745971,0.0002047661,0.0001056137,0.0008068915,0.0005254135,0.08805369],"genre_scores_gemma":[0.9597438,0.0006876921,0.02952131,0.0004219309,0.0003739501,0.0001042376,0.0006586167,0.0001106716,0.008377834],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00282456,"threshold_uncertainty_score":0.01110649,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001958796,0.001377915,0.001911805,0.003936097,0.002086358,0.004588825,0.002787998,0.0027175,0.01261402],"category_scores_gemma":[0.008666345,0.001239936,0.001576135,0.008021759,0.003377173,0.01239278,0.002669383,0.004744254,0.003962788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004033166,"about_ca_system_score_gemma":0.002214914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003719982,"about_ca_topic_score_gemma":0.002565824,"domain_scores_codex":[0.9979513,0.0004561426,0.0001047611,0.0007064393,0.0006077764,0.0001735583],"domain_scores_gemma":[0.9940017,0.004308127,0.0002133028,0.0006460046,0.0005958279,0.0002351084],"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.00009099103,0.0001196188,0.001394775,0.003293312,0.00006455764,0.0001211345,0.0002985377,0.0118945,0.000707123,0.7137271,0.05196989,0.2163184],"study_design_scores_gemma":[0.00002096648,0.00006157057,0.001007572,0.001195465,0.00004120189,0.0006188709,0.0001867787,0.01485306,0.0006227393,0.6331493,0.3481883,0.00005418515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.016615,0.6366781,0.1562428,0.02015026,0.004391997,0.0001618299,0.00160431,0.0008494498,0.1633063],"genre_scores_gemma":[0.1577189,0.6976207,0.08544426,0.008759541,0.0112121,0.0002775495,0.003623995,0.001015442,0.03432748],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.01261402,"threshold_uncertainty_score":0.04219806,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001955456,0.0003132656,0.0003269971,0.0007813121,0.000913284,0.001034072,0.0004145273,0.000508415,0.004053949],"category_scores_gemma":[0.001190028,0.0002683856,0.000351086,0.001076552,0.0006574287,0.002546307,0.0007808614,0.0003026322,0.0005895442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004467898,"about_ca_system_score_gemma":0.0004078673,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007009241,"about_ca_topic_score_gemma":0.001230447,"domain_scores_codex":[0.9996387,0.00005055911,0.00003391634,0.0001272691,0.00006815277,0.00008139879],"domain_scores_gemma":[0.9992454,0.000229291,0.0002036748,0.0001610988,0.00009378664,0.00006675855],"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.0002576005,0.00008475877,0.004973164,0.0003273871,0.00008956264,0.0008769396,0.0006415435,0.01864308,0.0309963,0.8617322,0.00639164,0.0749857],"study_design_scores_gemma":[0.00002896852,0.000128074,0.005676863,0.00006392324,0.000109153,0.002899981,0.0006885168,0.04655079,0.01631709,0.888202,0.03929811,0.00003656833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7704423,0.0008387828,0.1483114,0.0007042253,0.00006792219,0.00007009145,0.00134173,0.0004225237,0.07780096],"genre_scores_gemma":[0.9645573,0.0005174745,0.02662994,0.0001579351,0.00005563921,0.00003654948,0.0008462581,0.00005321154,0.007145675],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004053949,"threshold_uncertainty_score":0.01356179,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001973056,0.0006813577,0.001008987,0.002219454,0.002096684,0.002136987,0.00123394,0.0008373971,0.002994823],"category_scores_gemma":[0.01036419,0.0004238102,0.0008763357,0.003644113,0.002518434,0.00354417,0.002452757,0.002634143,0.0004208307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002094579,"about_ca_system_score_gemma":0.00076454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002929094,"about_ca_topic_score_gemma":0.00292811,"domain_scores_codex":[0.9981332,0.000404716,0.00007138248,0.0004033312,0.0005816035,0.0004057672],"domain_scores_gemma":[0.9831513,0.01305737,0.0008576027,0.0009348366,0.001177981,0.0008209206],"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.0002501019,0.00008111881,0.005266866,0.0003616129,0.0001140375,0.0005094023,0.000827327,0.05803076,0.007326374,0.8790095,0.01316475,0.03505814],"study_design_scores_gemma":[0.00004682094,0.000143976,0.003694838,0.0001277567,0.0001131014,0.001603263,0.0002800212,0.1592033,0.003801518,0.7951822,0.03574364,0.00005956212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2903432,0.01581081,0.5399784,0.007078115,0.0007101094,0.0001593164,0.001204398,0.0004760833,0.1442396],"genre_scores_gemma":[0.9374722,0.0063967,0.04340462,0.001251117,0.001077299,0.0001753539,0.0005805708,0.0001696313,0.009472539],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002994823,"threshold_uncertainty_score":0.01519734,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005297036,0.0006636717,0.0006211776,0.002567581,0.001030482,0.001660841,0.0008400777,0.0007799181,0.003033983],"category_scores_gemma":[0.003827457,0.0004215618,0.0004905798,0.001292918,0.002287226,0.003592653,0.001700012,0.001118379,0.0003928388],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001089944,"about_ca_system_score_gemma":0.0003173411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006292237,"about_ca_topic_score_gemma":0.0006388093,"domain_scores_codex":[0.9994759,0.0001140897,0.00002083363,0.0001606758,0.00009484936,0.0001336889],"domain_scores_gemma":[0.9958664,0.002547103,0.00059766,0.0002945197,0.0002643827,0.0004299289],"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.0002466041,0.00006804164,0.00747513,0.000259373,0.00006179649,0.0002935333,0.0007624407,0.02916735,0.01629307,0.9187688,0.005699381,0.02090457],"study_design_scores_gemma":[0.00003186783,0.0001234269,0.007438464,0.0000721169,0.00004946157,0.0007974296,0.0004767434,0.1025276,0.0120707,0.8660065,0.01031002,0.00009566811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8642395,0.002183477,0.09494063,0.00141372,0.0001095865,0.00002937948,0.0005296777,0.000253725,0.03630021],"genre_scores_gemma":[0.9864938,0.0007076386,0.009834333,0.0001328274,0.00008939586,0.00004101464,0.0002638116,0.00005734434,0.002379858],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003033983,"threshold_uncertainty_score":0.01014972,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001213512,0.0006674624,0.0006560667,0.002444868,0.001114387,0.002338478,0.0008749853,0.0008521902,0.007278844],"category_scores_gemma":[0.003624467,0.000327988,0.0009134501,0.0009324703,0.00295853,0.004804159,0.001356089,0.001764109,0.001467993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001132246,"about_ca_system_score_gemma":0.0004798805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005121661,"about_ca_topic_score_gemma":0.0005346399,"domain_scores_codex":[0.9993793,0.0001205579,0.00002728687,0.0001013758,0.0002622766,0.0001091553],"domain_scores_gemma":[0.9991974,0.0003240303,0.0001106679,0.0001335418,0.0001543882,0.00007997611],"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.000006790387,0.000006720769,0.00005097815,0.0000147571,0.000001533723,0.00004413092,0.0001227177,0.000542663,0.000542993,0.995037,0.0004220548,0.003207664],"study_design_scores_gemma":[0.000005909245,0.00001392738,0.0000786119,0.00001549938,0.00000359713,0.0001080768,0.00005253534,0.007293232,0.0009879494,0.9882342,0.003194858,0.00001163203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.327105,0.002477086,0.4503851,0.002540538,0.0008977974,0.00009243785,0.0002286901,0.0007587443,0.2155148],"genre_scores_gemma":[0.9191419,0.001599804,0.04960477,0.00051734,0.0009023913,0.00008911644,0.0001395358,0.000218477,0.02778649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007278844,"threshold_uncertainty_score":0.02435011,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008645963,0.0007922163,0.0009299239,0.001461559,0.002432495,0.002770087,0.001356244,0.00132916,0.01461248],"category_scores_gemma":[0.006013256,0.0005245418,0.001018569,0.001753553,0.003675642,0.006152374,0.002595648,0.003320267,0.000944908],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001623275,"about_ca_system_score_gemma":0.0006445776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003267817,"about_ca_topic_score_gemma":0.003061176,"domain_scores_codex":[0.9990545,0.0002053476,0.00003767183,0.0002992123,0.0001773766,0.0002260325],"domain_scores_gemma":[0.9948738,0.003011045,0.0005827078,0.0003989671,0.0002730243,0.0008604582],"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.0001155453,0.0000481291,0.002019388,0.0001389461,0.00002583549,0.0001264185,0.0004628021,0.003596715,0.0008795592,0.9734196,0.00795651,0.01121057],"study_design_scores_gemma":[0.0000141121,0.00001405519,0.0009010331,0.0000287378,0.00001220172,0.0001207066,0.0001803804,0.006751097,0.0003214623,0.9868625,0.004778314,0.00001535389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.608549,0.007086399,0.1890457,0.01000261,0.001156393,0.0001001952,0.001355842,0.0004938598,0.1822101],"genre_scores_gemma":[0.9553857,0.001538169,0.02135645,0.0007481539,0.0007231139,0.00006238746,0.0005373104,0.0001213127,0.01952723],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01461248,"threshold_uncertainty_score":0.04888368,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007850796,0.0004332706,0.0004247038,0.004380743,0.002146298,0.002788933,0.001132594,0.0009320004,0.008143409],"category_scores_gemma":[0.004176507,0.0007128872,0.0006383787,0.001457074,0.002439067,0.004810492,0.002541688,0.001635507,0.0004805278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001476134,"about_ca_system_score_gemma":0.0003237333,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001458873,"about_ca_topic_score_gemma":0.001171638,"domain_scores_codex":[0.9988952,0.0001417286,0.00006710921,0.0002818218,0.0004186559,0.0001954664],"domain_scores_gemma":[0.9964952,0.00126733,0.0004999916,0.0004170369,0.0005643139,0.0007562041],"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.0001078179,0.00007030073,0.009244304,0.00006373422,0.0000365556,0.000841675,0.0017678,0.002741893,0.006770909,0.9649783,0.001484276,0.01189236],"study_design_scores_gemma":[0.00004957331,0.00007774055,0.01707291,0.0000487354,0.00006854537,0.002630303,0.001698919,0.03264786,0.01301141,0.918514,0.01408892,0.00009109018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9128103,0.0002665292,0.05481841,0.0003481827,0.0000472926,0.00005405849,0.0002739445,0.0001744254,0.03120678],"genre_scores_gemma":[0.9878173,0.0001767561,0.006180464,0.00005369603,0.00003227539,0.00005429734,0.0003731458,0.00005177211,0.005260203],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008143409,"threshold_uncertainty_score":0.02724236,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002356068,0.0004829234,0.0006302543,0.0009247934,0.002151035,0.001623745,0.001222342,0.001544656,0.003166891],"category_scores_gemma":[0.003690685,0.0003149048,0.0009112596,0.0008116373,0.004642095,0.003987158,0.002233474,0.004369554,0.0005909022],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008028739,"about_ca_system_score_gemma":0.0008250806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007448238,"about_ca_topic_score_gemma":0.0005452218,"domain_scores_codex":[0.9987583,0.0003891008,0.00005421926,0.0001519819,0.0004630003,0.0001833987],"domain_scores_gemma":[0.9985469,0.0006236794,0.0001397211,0.0002744301,0.0002506191,0.0001646101],"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.000007923371,0.000004459506,0.00005102297,0.00002112653,0.000002103659,0.0000708506,0.0001109846,0.0003022508,0.0006004245,0.9958243,0.0008888021,0.002115689],"study_design_scores_gemma":[0.000003617282,0.0000218438,0.00008779047,0.00001441683,0.00000405867,0.0001987223,0.00003881712,0.005721146,0.0005246778,0.9865299,0.006840723,0.00001422412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1206196,0.007579242,0.6831941,0.01326487,0.004308731,0.00006481609,0.0001988967,0.0003314852,0.1704382],"genre_scores_gemma":[0.8690493,0.004279877,0.09720562,0.004732217,0.002308417,0.00005535757,0.0001072216,0.00018582,0.02207631],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003166891,"threshold_uncertainty_score":0.01246023,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002273143,0.0003529292,0.0003119944,0.001122259,0.00080997,0.001802798,0.0003756547,0.0004417631,0.004500219],"category_scores_gemma":[0.001055111,0.000306987,0.0002833904,0.0007844697,0.002297211,0.001985796,0.001299304,0.0009838518,0.0004725446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007616894,"about_ca_system_score_gemma":0.0003393974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007063898,"about_ca_topic_score_gemma":0.0007170889,"domain_scores_codex":[0.9994838,0.0000927002,0.00002767864,0.0001182404,0.0001928906,0.00008467256],"domain_scores_gemma":[0.9993901,0.0002047727,0.0001464997,0.00006742679,0.00009465138,0.00009650045],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009633573,0.00002374537,0.00287259,0.00009600995,0.00001110258,0.0003660091,0.0004481889,0.01195621,0.009563998,0.944049,0.001440438,0.02907642],"study_design_scores_gemma":[0.00003276725,0.0001606476,0.01155228,0.00007811461,0.00001659594,0.002934121,0.00111633,0.1192291,0.01004491,0.8112093,0.0435349,0.0000910539],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7140991,0.00147525,0.1980237,0.0008075801,0.00008841405,0.0000969961,0.0008370024,0.0001304272,0.08444157],"genre_scores_gemma":[0.9253832,0.0007949743,0.06153053,0.0001225891,0.0001283536,0.0001151723,0.0007923744,0.00007168853,0.01106096],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004500219,"threshold_uncertainty_score":0.0150547,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003313876,0.0005238279,0.0003449479,0.001186824,0.0008587255,0.001323889,0.0006431944,0.0005495038,0.005393117],"category_scores_gemma":[0.002009174,0.0003794267,0.0005767681,0.0009997835,0.0008617563,0.001929555,0.001121783,0.0009036379,0.0006509341],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009784899,"about_ca_system_score_gemma":0.0008390988,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00215128,"about_ca_topic_score_gemma":0.003958141,"domain_scores_codex":[0.9995073,0.0001115865,0.00003224706,0.0001216207,0.00009072685,0.0001365112],"domain_scores_gemma":[0.9986355,0.0004138442,0.0001948545,0.0002335154,0.000290399,0.0002319515],"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.0003169885,0.0001295949,0.002253234,0.0003222972,0.00007319315,0.0004555015,0.0005901664,0.03952836,0.01381982,0.8825195,0.007997971,0.05199332],"study_design_scores_gemma":[0.00005752541,0.00009233056,0.001756891,0.0001151358,0.000072497,0.0005829835,0.0004571204,0.1398095,0.006934447,0.8297988,0.02027354,0.00004923169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3882153,0.0009774108,0.5449684,0.0007315161,0.00009992101,0.0002951185,0.002106339,0.0003999788,0.06220596],"genre_scores_gemma":[0.8577306,0.0005729964,0.1269307,0.0003593947,0.00005662033,0.0002464777,0.002566637,0.0001137573,0.01142281],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005393117,"threshold_uncertainty_score":0.01804179,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004363046,0.0003187608,0.0002778388,0.0007975211,0.0008040323,0.001203317,0.0004113551,0.0003021432,0.003308898],"category_scores_gemma":[0.001411781,0.0003438793,0.0003997419,0.0008106348,0.001658484,0.001251106,0.000924231,0.0005745041,0.000253166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000847796,"about_ca_system_score_gemma":0.0004698372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00239699,"about_ca_topic_score_gemma":0.002772419,"domain_scores_codex":[0.9995379,0.000101937,0.00002437314,0.0001715411,0.00008905856,0.00007520891],"domain_scores_gemma":[0.99861,0.0005963458,0.0001855754,0.0001909045,0.000222774,0.0001943447],"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.0002797449,0.00005239045,0.003050949,0.0001714521,0.00002843225,0.0003115,0.0008981749,0.01558196,0.01127849,0.942479,0.00335437,0.02251351],"study_design_scores_gemma":[0.00006879617,0.0001461605,0.00485054,0.00003648409,0.00005744885,0.001060185,0.0004927874,0.06258032,0.008446787,0.9017321,0.0204799,0.00004834897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8363503,0.0004129604,0.1125719,0.0003694335,0.00004825407,0.00004295753,0.0006333046,0.0002080591,0.04936282],"genre_scores_gemma":[0.9378713,0.0002911284,0.04735738,0.0000799237,0.00003048291,0.00004654485,0.0007683941,0.00007069181,0.01348406],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003308898,"threshold_uncertainty_score":0.01106936,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002929597,0.0003386443,0.0002879051,0.0005884999,0.0005809825,0.001305182,0.0004668503,0.0005001273,0.003103868],"category_scores_gemma":[0.0009612862,0.0002804066,0.0005233932,0.0005828709,0.0008743598,0.00129674,0.0008781453,0.0007137739,0.0003196141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000657407,"about_ca_system_score_gemma":0.0002353016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006955055,"about_ca_topic_score_gemma":0.0007950758,"domain_scores_codex":[0.9996543,0.00007340528,0.00001887178,0.00008898911,0.00006258152,0.000101953],"domain_scores_gemma":[0.9994598,0.0001498177,0.0001267852,0.00007923276,0.00005085508,0.0001335052],"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.0001534653,0.00005586806,0.001434534,0.00004480758,0.00001969621,0.000244227,0.0002611014,0.01397234,0.01566763,0.9493496,0.001336024,0.01746068],"study_design_scores_gemma":[0.00004974963,0.00009075426,0.00254206,0.00002774153,0.00002419127,0.0004296392,0.0001858956,0.1055412,0.006041318,0.8787913,0.006239606,0.00003659373],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7354788,0.0004046938,0.238927,0.0003913198,0.00006448135,0.00005856839,0.0003718596,0.000242452,0.02406096],"genre_scores_gemma":[0.9718344,0.0001766556,0.02441868,0.00006586591,0.000056144,0.00005939853,0.0002507674,0.00003464375,0.003103431],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003103868,"threshold_uncertainty_score":0.01038355,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002124327,0.001993823,0.001640764,0.003184041,0.00134939,0.002906215,0.002513949,0.00132376,0.004531479],"category_scores_gemma":[0.01441405,0.0007034611,0.001252927,0.002181916,0.002263217,0.005011918,0.003267199,0.003151135,0.001173832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003395355,"about_ca_system_score_gemma":0.0007596698,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001272914,"about_ca_topic_score_gemma":0.001623421,"domain_scores_codex":[0.9975013,0.0004601801,0.0001173726,0.0006705175,0.000713783,0.0005368431],"domain_scores_gemma":[0.9779797,0.01713406,0.001202558,0.001356472,0.001115369,0.001211895],"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.002006081,0.0004304068,0.0235069,0.002358436,0.000551914,0.001021523,0.001584337,0.3465189,0.09050277,0.3772327,0.02305412,0.131232],"study_design_scores_gemma":[0.00009091073,0.0004081224,0.01111338,0.0004285816,0.0002764614,0.002309415,0.0004097156,0.6254268,0.02460088,0.3079234,0.02682365,0.0001886535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4191047,0.03006314,0.4268154,0.007358226,0.0005310958,0.000181837,0.003334884,0.001523464,0.1110873],"genre_scores_gemma":[0.918705,0.007935108,0.06145808,0.0007839124,0.0006587008,0.0002451625,0.001703017,0.0003610491,0.008149876],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004531479,"threshold_uncertainty_score":0.02463508,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000417708,0.0003416859,0.000385154,0.0008176382,0.0006748259,0.001792147,0.0006059284,0.000375325,0.006618019],"category_scores_gemma":[0.0005988485,0.0001846224,0.0005480609,0.0004105322,0.001045373,0.002971553,0.001282286,0.001279412,0.0007714204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008340191,"about_ca_system_score_gemma":0.0003371417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004558759,"about_ca_topic_score_gemma":0.0004482293,"domain_scores_codex":[0.9996682,0.00004363971,0.00001271049,0.00008464321,0.0001026821,0.0000880083],"domain_scores_gemma":[0.9996707,0.00007058417,0.00006013932,0.00003628835,0.00004613712,0.0001160896],"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.00005108239,0.0000354074,0.0005014625,0.00004749103,0.000008478065,0.0001186552,0.0002280489,0.001592716,0.003292235,0.9845695,0.0006256921,0.008929209],"study_design_scores_gemma":[0.00004480705,0.0002100007,0.002087395,0.00002555718,0.00003088776,0.000509713,0.0002443767,0.01895047,0.006711869,0.9605334,0.01060287,0.00004863115],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7863755,0.0007385971,0.1525952,0.000636146,0.0001485636,0.00007250469,0.0004926773,0.0003586653,0.05858214],"genre_scores_gemma":[0.9698118,0.0003379018,0.01438969,0.000119598,0.0001893688,0.00004811715,0.0003095071,0.00005171401,0.01474235],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006618019,"threshold_uncertainty_score":0.02213949,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007965447,0.0004051731,0.0004808535,0.001696252,0.001051638,0.001482451,0.0006002079,0.0006728829,0.002078751],"category_scores_gemma":[0.004109145,0.0002961521,0.0004455761,0.0008155198,0.00268316,0.001927534,0.001779629,0.00112059,0.0002215938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001077541,"about_ca_system_score_gemma":0.0002484051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000439312,"about_ca_topic_score_gemma":0.0005324173,"domain_scores_codex":[0.9995332,0.0001421765,0.00002622328,0.00009812786,0.000102693,0.00009762317],"domain_scores_gemma":[0.995659,0.001898544,0.0009326124,0.000520812,0.0002786456,0.0007104021],"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.0002924359,0.00005401721,0.006415685,0.00009877788,0.00002536037,0.0003126218,0.0008393901,0.02293651,0.01108131,0.9421516,0.001338459,0.0144539],"study_design_scores_gemma":[0.00003644013,0.00007050697,0.002394781,0.00002754568,0.0000267311,0.0003124269,0.0003736555,0.08030631,0.005338784,0.9080003,0.003083077,0.00002948826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9554836,0.0002135819,0.03204749,0.0006004299,0.00002974869,0.00001519649,0.0001010735,0.0001115687,0.01139748],"genre_scores_gemma":[0.9929515,0.0001089525,0.005115247,0.00005353935,0.00003630958,0.00001420289,0.0001122101,0.00003523507,0.001572882],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002078751,"threshold_uncertainty_score":0.007818162,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000400246,0.0003449665,0.0005607832,0.00146684,0.002018596,0.001977512,0.0004732745,0.0007936844,0.005228499],"category_scores_gemma":[0.002477912,0.0004087367,0.0005151081,0.0008934504,0.002807754,0.003023352,0.001196394,0.001595636,0.0007867118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008280744,"about_ca_system_score_gemma":0.0003503282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00116605,"about_ca_topic_score_gemma":0.001062496,"domain_scores_codex":[0.9990236,0.0001831207,0.00003465735,0.0002141737,0.0003139999,0.0002304173],"domain_scores_gemma":[0.9978532,0.001168261,0.0002792853,0.0002531465,0.0002448995,0.0002011313],"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.00007788358,0.00001947424,0.000790434,0.00003638287,0.000009193882,0.0001239087,0.00033383,0.002884602,0.004111506,0.9827539,0.000751034,0.008107831],"study_design_scores_gemma":[0.00001970662,0.00006891595,0.001165774,0.00002972116,0.00001180897,0.0003647469,0.0002604778,0.01622754,0.005062225,0.9603119,0.0164498,0.00002730722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6986201,0.001721282,0.1654931,0.001457503,0.0001957546,0.00005773432,0.0002718471,0.0002724921,0.1319102],"genre_scores_gemma":[0.9491347,0.0006058022,0.02770225,0.0002555383,0.0003388925,0.00005639268,0.0002945632,0.0001121906,0.02149976],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005228499,"threshold_uncertainty_score":0.01749104,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002773757,0.0002216625,0.0001673801,0.0005948251,0.0005782204,0.0008317172,0.0002733151,0.000284391,0.00275487],"category_scores_gemma":[0.001186839,0.000138318,0.0003043395,0.0004407825,0.000918296,0.0009747986,0.0004421675,0.0006460888,0.0003313197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007450496,"about_ca_system_score_gemma":0.0005657009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001039347,"about_ca_topic_score_gemma":0.0009311599,"domain_scores_codex":[0.9997634,0.0000368439,0.000009566058,0.00003944519,0.00004718108,0.0001035268],"domain_scores_gemma":[0.9996276,0.0001156797,0.00008778444,0.00005864637,0.00004574228,0.00006449913],"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.0002479408,0.00005266905,0.003254761,0.00008080046,0.00001201787,0.0004112989,0.0002321783,0.006931878,0.02241876,0.9460977,0.001933011,0.01832698],"study_design_scores_gemma":[0.00009019113,0.0005012762,0.01092367,0.0000771634,0.00005762783,0.002980915,0.0006372152,0.1189536,0.05739737,0.7755702,0.03266273,0.0001480823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.928141,0.0005505866,0.03181308,0.0005599021,0.0001694286,0.0000243397,0.0001661902,0.00009815282,0.03847732],"genre_scores_gemma":[0.9889538,0.0002606209,0.00480838,0.0000628435,0.00006030002,0.000009971774,0.0001064998,0.00001786999,0.005719723],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00275487,"threshold_uncertainty_score":0.009215951,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002518827,0.001589634,0.00182646,0.001401664,0.00179538,0.003678322,0.002354683,0.002520974,0.01006723],"category_scores_gemma":[0.01302538,0.0009180296,0.002727684,0.002162798,0.003361478,0.008915385,0.003677319,0.004890086,0.001574746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001206269,"about_ca_system_score_gemma":0.001172957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007164198,"about_ca_topic_score_gemma":0.0009815613,"domain_scores_codex":[0.9967716,0.0008182369,0.0002678355,0.0009795644,0.0007692033,0.000393615],"domain_scores_gemma":[0.9927746,0.005197642,0.0005004302,0.0008340492,0.0003902342,0.000303117],"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.0005964449,0.0003402033,0.00131086,0.0008140564,0.000119995,0.0006716494,0.001183935,0.0395528,0.005561125,0.8477027,0.006661233,0.09548508],"study_design_scores_gemma":[0.0001096963,0.0001173124,0.0002547121,0.00006154975,0.00005315016,0.0004488984,0.0003410388,0.05723023,0.004482367,0.9298746,0.006964255,0.00006215341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2550204,0.001365878,0.6956945,0.002590839,0.0003781806,0.0003291527,0.0007770404,0.0004898232,0.04335421],"genre_scores_gemma":[0.4999053,0.001464308,0.4581297,0.0008420688,0.0008749565,0.0006227538,0.002600901,0.0005021069,0.03505795],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01006723,"threshold_uncertainty_score":0.03367823,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006864546,0.0005852635,0.001061974,0.0009885541,0.002691264,0.001904412,0.001044938,0.001537454,0.009121913],"category_scores_gemma":[0.008829017,0.0005512168,0.001419946,0.000848046,0.001940308,0.00381981,0.001672237,0.001201548,0.001280403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001084359,"about_ca_system_score_gemma":0.0008163545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00437142,"about_ca_topic_score_gemma":0.004012164,"domain_scores_codex":[0.9986848,0.0001443618,0.00009751949,0.0006419288,0.0002112325,0.0002201545],"domain_scores_gemma":[0.9957507,0.00180074,0.0005391638,0.0006229914,0.0005219507,0.0007644807],"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.001185776,0.0002148389,0.008573538,0.0002909835,0.00006346605,0.0009610137,0.001708487,0.01188212,0.01719865,0.9170815,0.009530718,0.03130892],"study_design_scores_gemma":[0.0003040772,0.0005899226,0.005211612,0.0001859013,0.000154537,0.003514172,0.001437627,0.0940911,0.01549832,0.8366843,0.04213754,0.0001908869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7618029,0.001140512,0.179931,0.001503406,0.0002899813,0.0001820201,0.001741035,0.001077795,0.0523314],"genre_scores_gemma":[0.9252149,0.0004069924,0.05997279,0.0004118119,0.0002248361,0.0002211703,0.00178704,0.000311063,0.01144946],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009121913,"threshold_uncertainty_score":0.03051585,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00153517,0.0007032687,0.001035494,0.002343489,0.00115182,0.002648915,0.0008594139,0.0005149493,0.003356817],"category_scores_gemma":[0.01092063,0.0003384216,0.0006616338,0.001638869,0.005137715,0.005245926,0.00282642,0.00377699,0.0006404714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001662572,"about_ca_system_score_gemma":0.0007256178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001765283,"about_ca_topic_score_gemma":0.0008809209,"domain_scores_codex":[0.998725,0.0002533853,0.000043468,0.0003381866,0.0003271908,0.0003127977],"domain_scores_gemma":[0.9918508,0.005696089,0.0008361301,0.0003842561,0.000632946,0.0005997258],"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.0001287805,0.00003818976,0.0006158391,0.00008897151,0.00001122651,0.0001784752,0.0005226087,0.004318273,0.002028613,0.9772915,0.001158302,0.01361919],"study_design_scores_gemma":[0.00003664423,0.00004475274,0.0005429577,0.00003156526,0.000009741529,0.0002496057,0.000184204,0.01921771,0.0008055635,0.9742669,0.004582348,0.00002804521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6140949,0.005127188,0.2903886,0.003573496,0.0003776336,0.00006973779,0.000697614,0.0002676217,0.08540315],"genre_scores_gemma":[0.9722725,0.001936847,0.01545379,0.0002125715,0.0006066604,0.00005279946,0.000286017,0.00008769987,0.009091184],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003356817,"threshold_uncertainty_score":0.01206285,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003234349,0.0003527183,0.0004867454,0.0009999003,0.001454186,0.001451083,0.0006835479,0.0008276235,0.005428205],"category_scores_gemma":[0.002126148,0.0004330121,0.0006747195,0.001102884,0.001050436,0.002419623,0.0009934268,0.001017155,0.0004265629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007784872,"about_ca_system_score_gemma":0.0004021064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007104283,"about_ca_topic_score_gemma":0.001279567,"domain_scores_codex":[0.9994977,0.0001048349,0.00003361821,0.0001780852,0.00008362009,0.0001022166],"domain_scores_gemma":[0.9983032,0.0007656149,0.0003466459,0.0002145393,0.0001505713,0.000219395],"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.000210374,0.00007561864,0.00319344,0.0002894991,0.00004657743,0.0002890632,0.0008106992,0.01597661,0.01275154,0.9403735,0.007118268,0.01886469],"study_design_scores_gemma":[0.00005008719,0.0001003353,0.006229646,0.00005332324,0.00007954449,0.001248201,0.0006614653,0.06848197,0.006702273,0.8992761,0.01707157,0.00004566458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8014751,0.0009178923,0.1516809,0.001367379,0.0000834008,0.00009560689,0.001969453,0.0002657544,0.04214441],"genre_scores_gemma":[0.9586698,0.0003855419,0.03320354,0.0002473832,0.00008476365,0.000126442,0.001382516,0.00005629298,0.00584368],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005428205,"threshold_uncertainty_score":0.01815915,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005160669,0.0005718144,0.0007277459,0.001374985,0.001183821,0.002308401,0.001238011,0.0006914275,0.00454607],"category_scores_gemma":[0.003743256,0.000538437,0.0004066661,0.001554632,0.001090952,0.002128947,0.001053335,0.0008374306,0.0007112588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001212877,"about_ca_system_score_gemma":0.0006372623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002172075,"about_ca_topic_score_gemma":0.001447883,"domain_scores_codex":[0.999213,0.00014587,0.00005843171,0.0001538169,0.0002241002,0.0002047143],"domain_scores_gemma":[0.9959989,0.001597445,0.001038313,0.0003294203,0.000401309,0.0006346461],"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.003085707,0.0005168242,0.03738513,0.0006683434,0.0002150784,0.001065611,0.00212389,0.1685519,0.1050973,0.6019418,0.01395325,0.06539528],"study_design_scores_gemma":[0.0004409704,0.000797238,0.02260385,0.0001711951,0.0001844294,0.002072142,0.002388858,0.5236527,0.05176515,0.3697767,0.0259893,0.0001574808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9461247,0.0002327834,0.04153703,0.0002714729,0.00001119067,0.00007036662,0.001081536,0.0001712802,0.01049974],"genre_scores_gemma":[0.9636104,0.0003456937,0.0287551,0.00009424576,0.00004824145,0.0002267947,0.00221238,0.0001104319,0.00459668],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00454607,"threshold_uncertainty_score":0.01520813,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005102842,0.000509806,0.0003281566,0.00103871,0.001608689,0.001627402,0.0005342502,0.0006389682,0.006701628],"category_scores_gemma":[0.001477252,0.0002419378,0.0007453521,0.0009207535,0.003251239,0.003651708,0.001221447,0.001644153,0.0006476821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001039794,"about_ca_system_score_gemma":0.0003996563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009131238,"about_ca_topic_score_gemma":0.001381601,"domain_scores_codex":[0.9996153,0.00007359321,0.00001862977,0.00008084452,0.0001055293,0.0001061016],"domain_scores_gemma":[0.999458,0.0001877105,0.00007256863,0.00009352887,0.0001059214,0.00008228351],"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.00001397884,0.000005053328,0.0001358406,0.00001096428,0.00000171744,0.0000507426,0.0001286122,0.0002718729,0.0005586174,0.9940817,0.0008133006,0.003927602],"study_design_scores_gemma":[0.000008096466,0.00001270644,0.0004803516,0.000008541816,0.000004581484,0.0002982563,0.0001205526,0.001460688,0.0008757958,0.9875338,0.009185366,0.00001108773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4678678,0.003073632,0.2321037,0.002535462,0.001159084,0.00009586654,0.000308271,0.0002245895,0.2926317],"genre_scores_gemma":[0.9303278,0.001161772,0.03682394,0.0007113604,0.0004496562,0.00007354466,0.0001514929,0.0000991421,0.03020133],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006701628,"threshold_uncertainty_score":0.02241915,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}