{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":26,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":26,"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":"faea0385ff28","filters":{"venue":"Discussiones Mathematicae Graph Theory"}},"results":[{"id":"W1967091137","doi":"10.7151/dmgt.1238","title":"On dominating the Cartesian product of a graph and K <sub>2</sub>","year":2004,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University","funders":"","keywords":"Cartesian product; Mathematics; Combinatorics; Graph; Product (mathematics); Discrete mathematics; Geometry","authors":[{"name":"Bert L. Hartnell","is_ca":true},{"name":"Douglas F. Rall","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01114735121733062,"gpt":0.2550014698056657,"spread":0.2438541185883351,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002009216,0.0009538203,0.00107271,0.002292511,0.002602168,0.003628664,0.001051,0.001324867,0.006074784],"category_scores_gemma":[0.004322845,0.0009215733,0.001215334,0.002151011,0.006385337,0.008142967,0.00270528,0.003651229,0.0007842548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002153746,"about_ca_system_score_gemma":0.0008267825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00277425,"about_ca_topic_score_gemma":0.002346663,"domain_scores_codex":[0.9987893,0.0005276798,0.00005286116,0.0003483775,0.0001407001,0.0001410723],"domain_scores_gemma":[0.9958008,0.002578105,0.0003449213,0.0003618031,0.0004836585,0.0004307136],"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.00002515734,0.000007855957,0.0001660774,0.00003316337,0.000005036796,0.00004938229,0.000429445,0.000316064,0.000208951,0.995989,0.001363458,0.001406456],"study_design_scores_gemma":[0.00001019075,0.00001908047,0.0003221506,0.00001848655,0.00001305737,0.0001455608,0.0002014989,0.001483499,0.0001476766,0.99209,0.005539988,0.000008918477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5511048,0.007883313,0.1134102,0.01402368,0.00239317,0.0001008207,0.0005269916,0.0002491024,0.310308],"genre_scores_gemma":[0.9025605,0.004172049,0.0344269,0.002324939,0.001880715,0.0001385926,0.0006145515,0.0002936553,0.05358821],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006074784,"threshold_uncertainty_score":0.0203222,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983282841","doi":"10.7151/dmgt.1154","title":"Heavy cycles in weighted graphs","year":2002,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Graph theory and applications","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Social Sciences and Humanities Research Council; Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","funders":"University of Twente","keywords":"Mathematics; Combinatorics; Discrete mathematics","authors":[{"name":"J. A. Bondy","is_ca":false},{"name":"Hajo Broersma","is_ca":false},{"name":"Jan van den Heuvel","is_ca":true},{"name":"H.J. Veldman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04106275744352195,"gpt":0.2893674404735425,"spread":0.2483046830300206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008008769,0.0007696963,0.0005841065,0.002577875,0.001343294,0.002103408,0.001041537,0.0009441611,0.005424097],"category_scores_gemma":[0.004768795,0.0006479241,0.0007991589,0.002499229,0.002211613,0.005112342,0.002234247,0.001512328,0.0008062146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001326344,"about_ca_system_score_gemma":0.0004209364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001631213,"about_ca_topic_score_gemma":0.00168734,"domain_scores_codex":[0.9990301,0.0002230282,0.00006099572,0.0002711318,0.0002306638,0.0001840503],"domain_scores_gemma":[0.9979601,0.0009356374,0.0003526971,0.0003036415,0.0002427589,0.0002051344],"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.00004439616,0.00001728038,0.0004244365,0.00009786098,0.00001930591,0.0001215092,0.0003177718,0.004801766,0.002040731,0.9691755,0.001914158,0.02102516],"study_design_scores_gemma":[0.00001177523,0.00001666908,0.0001917016,0.00002150593,0.00001408284,0.0001073531,0.00006891059,0.01200002,0.0007954816,0.9760789,0.01068362,0.00001002003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2702697,0.003175294,0.6633849,0.001284828,0.0002906493,0.0003092398,0.0006121761,0.0005553113,0.0601179],"genre_scores_gemma":[0.7880741,0.003182258,0.1802087,0.0009011326,0.0004655403,0.000547265,0.0008597166,0.0003268841,0.02543438],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005424097,"threshold_uncertainty_score":0.01814544,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2087046441","doi":"10.7151/dmgt.1638","title":"Minimal trees and monophonic convexity","year":2012,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Convexity; Combinatorics; Tree (set theory)","authors":[{"name":"José Cáceres","is_ca":false},{"name":"Ortrud R. Oellermann","is_ca":true},{"name":"María Luz Puertas","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02274028201100312,"gpt":0.2843460459271388,"spread":0.2616057639161357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005156541,0.0003824527,0.0009066175,0.001668549,0.002491313,0.003290508,0.000933699,0.001170174,0.01310835],"category_scores_gemma":[0.002082584,0.0004516829,0.0007916503,0.002041013,0.003152073,0.005069059,0.00208248,0.003311226,0.000926151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001737494,"about_ca_system_score_gemma":0.0006160018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001324561,"about_ca_topic_score_gemma":0.00192566,"domain_scores_codex":[0.999579,0.0001127485,0.00002083026,0.0001074482,0.00010246,0.00007741174],"domain_scores_gemma":[0.9988188,0.000678098,0.00009265443,0.0001325631,0.000123276,0.0001546101],"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.000005190532,0.000003419874,0.00003512902,0.00001539825,0.00000239311,0.00001816173,0.00005469596,0.0002217372,0.000151428,0.9972972,0.000796854,0.001398308],"study_design_scores_gemma":[0.000004223095,0.000001336007,0.00008201887,0.000004405813,0.000003277434,0.00003288672,0.00003555262,0.0004522123,0.00006206781,0.996714,0.002605283,0.000002705236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2978203,0.007724663,0.1880996,0.0172536,0.0008190541,0.00007249635,0.0009036504,0.0003314509,0.4869753],"genre_scores_gemma":[0.9248348,0.002820045,0.022237,0.001378794,0.001251841,0.00009551808,0.000472867,0.0002680811,0.04664106],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01310835,"threshold_uncertainty_score":0.04385179,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975584720","doi":"10.7151/dmgt.1727","title":"On the complexity of the 3-kernel problem in some classes of digraphs","year":2013,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Digraph; Mathematics; Combinatorics; Kernel (algebra); Vertex (graph theory); Discrete mathematics; Computational complexity theory; Graph; Algorithm","authors":[{"name":"Pavol Hell","is_ca":true},{"name":"César Hernández‐Cruz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03571237301953448,"gpt":0.2757938525827622,"spread":0.2400814795632278,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002339978,0.001025139,0.002794716,0.002258155,0.002586414,0.007888678,0.004433037,0.004000215,0.01641023],"category_scores_gemma":[0.02160254,0.001021039,0.002000577,0.00338483,0.00351541,0.01889111,0.003754154,0.005056873,0.000920829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004926155,"about_ca_system_score_gemma":0.002585329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007429037,"about_ca_topic_score_gemma":0.006489305,"domain_scores_codex":[0.9973699,0.0007122474,0.0001589275,0.0006035952,0.0004684872,0.0006867941],"domain_scores_gemma":[0.9603566,0.03257976,0.002503365,0.00160828,0.0008474703,0.002104425],"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.001599841,0.001066812,0.01029221,0.000993692,0.0002425304,0.0006701912,0.001743187,0.1680259,0.002781183,0.7570804,0.02049299,0.03501109],"study_design_scores_gemma":[0.0001784467,0.00005555674,0.001636136,0.00004029281,0.00006320338,0.000232031,0.0003830277,0.278248,0.0005493038,0.7168996,0.001666083,0.00004838582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8467087,0.001549221,0.1089183,0.01035614,0.0001647694,0.0002294662,0.003317721,0.0006499959,0.02810577],"genre_scores_gemma":[0.9623758,0.0009712866,0.02376981,0.0005494562,0.0003406697,0.0002047093,0.002431601,0.0002754116,0.00908131],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01641023,"threshold_uncertainty_score":0.05489767,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033972173","doi":"10.7151/dmgt.1205","title":"On maximal finite antichains in the homomorphism order of directed graphs","year":2003,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Homomorphism; Mathematics; Combinatorics; Algebra homomorphism; Tree (set theory); Discrete mathematics; Order (exchange); Dual (grammatical number)","authors":[{"name":"Jaroslav Nešetřil","is_ca":false},{"name":"Claude Tardif","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01911656552065495,"gpt":0.2735449358042366,"spread":0.2544283702835817,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009281615,0.0004992961,0.000573813,0.001847681,0.001817577,0.002571479,0.0007464791,0.000680354,0.003590695],"category_scores_gemma":[0.002595177,0.0004700629,0.0006751042,0.001383679,0.002478491,0.006216212,0.001841805,0.001470634,0.0004086122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00116486,"about_ca_system_score_gemma":0.000503242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001362078,"about_ca_topic_score_gemma":0.001996343,"domain_scores_codex":[0.9989564,0.0002558023,0.00006445196,0.0002988226,0.0002038757,0.0002206609],"domain_scores_gemma":[0.9961333,0.002078344,0.0005714736,0.0002796267,0.000353013,0.0005843092],"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.00007324857,0.00004422966,0.001246467,0.00006051753,0.000009586832,0.0001974807,0.0006438529,0.001020215,0.003260956,0.9873383,0.0004243483,0.005680799],"study_design_scores_gemma":[0.00001867121,0.0000461575,0.00111491,0.00002134646,0.0000125549,0.0002589306,0.0002543577,0.005482176,0.001730215,0.9873859,0.003658025,0.00001672696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8320497,0.001145704,0.1231396,0.000498152,0.0001572824,0.00004259658,0.0003958799,0.0003194592,0.04225165],"genre_scores_gemma":[0.9645995,0.0004371411,0.02854732,0.0001488838,0.000149701,0.0000632782,0.0004493401,0.00007248185,0.005532315],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003590695,"threshold_uncertainty_score":0.01201212,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165079333","doi":"10.7151/dmgt.1409","title":"A note on domination parameters in random graphs","year":2008,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University; Rogers Communications (Canada)","funders":"","keywords":"Mathematics; Combinatorics; Domination analysis; Random graph; Discrete mathematics; Graph; Vertex (graph theory)","authors":[{"name":"Anthony Bonato","is_ca":true},{"name":"Changping Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0239342018942265,"gpt":0.2893510288309336,"spread":0.2654168269367071,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004386864,0.0008081264,0.001275668,0.00239136,0.001166244,0.002614052,0.001641631,0.001705968,0.004863389],"category_scores_gemma":[0.05009565,0.0005277897,0.0006652324,0.002098844,0.003600451,0.005387191,0.002463029,0.003509538,0.000467502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001781024,"about_ca_system_score_gemma":0.000431997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001288059,"about_ca_topic_score_gemma":0.0007999627,"domain_scores_codex":[0.9977842,0.001121296,0.00007102078,0.0003685801,0.000506558,0.0001482982],"domain_scores_gemma":[0.9433815,0.0476287,0.002610055,0.003098432,0.001940461,0.001340745],"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.0001560931,0.00003890615,0.004780354,0.0002623768,0.000108577,0.0005879835,0.0004484009,0.04363789,0.003558286,0.9187784,0.009785092,0.0178578],"study_design_scores_gemma":[0.00004132202,0.00006141435,0.003486692,0.0001252256,0.00006095117,0.000688376,0.0001146689,0.1251854,0.001183514,0.8591988,0.009767012,0.00008652192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3549238,0.03180016,0.4474709,0.01493944,0.001639348,0.000169726,0.0008732409,0.001485026,0.1466985],"genre_scores_gemma":[0.9826744,0.003330483,0.007791187,0.0008048677,0.0009928265,0.00009567812,0.0001280431,0.0002144026,0.003968081],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004863389,"threshold_uncertainty_score":0.02320021,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052404722","doi":"10.7151/dmgt.1808","title":"Bipartition polynomials, the Ising model and domination in graphs","year":2015,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Cape Breton University","funders":"European Social Fund; Austrian Science Fund; Vienna Science and Technology Fund","keywords":"Mathematics; Combinatorics; Ising model; Discrete mathematics; Statistical physics; Physics","authors":[{"name":"Markus Dod","is_ca":true},{"name":"Tomer Kotek","is_ca":true},{"name":"James Preen","is_ca":true},{"name":"Peter Tittmann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03983445520650829,"gpt":0.3003661581116008,"spread":0.2605317029050925,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004941727,0.0002991075,0.0003371527,0.001434806,0.0009351969,0.001464397,0.0006422382,0.000845919,0.002827371],"category_scores_gemma":[0.002684032,0.0001730943,0.0004671112,0.001916862,0.002175897,0.002963506,0.001181105,0.001700028,0.0003119971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001129551,"about_ca_system_score_gemma":0.0006038973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002824503,"about_ca_topic_score_gemma":0.001907065,"domain_scores_codex":[0.9996102,0.00008936151,0.00001258637,0.0000562544,0.000148946,0.00008252436],"domain_scores_gemma":[0.9991705,0.0003968632,0.0001125319,0.0001265744,0.00008102215,0.0001124909],"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.00001489809,0.000008381776,0.0001112862,0.00002135275,0.000002891098,0.00003813279,0.0001053315,0.002956502,0.0007390486,0.9909429,0.000761266,0.004297934],"study_design_scores_gemma":[0.000003483524,0.000005360559,0.0001406363,0.000005361136,0.000002301244,0.00006025063,0.00003692864,0.009526988,0.0002144327,0.9875929,0.002404851,0.000006372101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4937831,0.009210811,0.3081553,0.006968074,0.0006659101,0.00005344681,0.0005434196,0.0005827204,0.1800372],"genre_scores_gemma":[0.9800242,0.002137821,0.009479474,0.0002552191,0.0004145318,0.00001480822,0.000120611,0.00006467057,0.007488626],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002827371,"threshold_uncertainty_score":0.009458542,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3001905662","doi":"10.7151/dmgt.2293","title":"A new framework to approach Vizing's conjecture","year":2020,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Discrete mathematics","authors":[{"name":"Boštjan Brešar","is_ca":false},{"name":"Bert L. Hartnell","is_ca":true},{"name":"Michael A. Henning","is_ca":false},{"name":"Kirsti Kuenzel","is_ca":false},{"name":"Douglas F. Rall","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04339736179286213,"gpt":0.3020669921606164,"spread":0.2586696303677543,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004171261,0.001192147,0.001285727,0.004315862,0.002784641,0.003627101,0.003504291,0.002290189,0.008615881],"category_scores_gemma":[0.008434904,0.0006538579,0.001490754,0.00287402,0.009001182,0.01404255,0.005813626,0.005574393,0.001023796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002518138,"about_ca_system_score_gemma":0.001004885,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001744851,"about_ca_topic_score_gemma":0.001557949,"domain_scores_codex":[0.99737,0.0009986677,0.00009248033,0.0007202523,0.0005574244,0.000261168],"domain_scores_gemma":[0.9960405,0.001939784,0.0002697652,0.0009061779,0.0005111911,0.0003325934],"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.000004562075,0.000005609234,0.00007029415,0.000008947166,0.000001879105,0.00001786385,0.00006536052,0.0004908687,0.00009119549,0.9974974,0.0005124451,0.001233727],"study_design_scores_gemma":[0.000005482772,0.00001014921,0.0000474296,0.000008690909,0.000002513811,0.00003300473,0.00003757873,0.004034787,0.00007733324,0.9908445,0.004893061,0.000005515908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05455123,0.003919456,0.7637858,0.01164297,0.001008022,0.00009588977,0.0003382483,0.0004031254,0.1642551],"genre_scores_gemma":[0.7160086,0.002521589,0.2505866,0.002837113,0.002671724,0.0003928182,0.0004623614,0.0003395744,0.02417955],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008615881,"threshold_uncertainty_score":0.02882302,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983747324","doi":"10.7151/dmgt.1252","title":"A clone-theoretic formulation of the Erdős-Faber-Lovász conjecture","year":2004,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; clone (Java method); Discrete mathematics; Genetics; Biology","authors":[{"name":"Lucien Haddad","is_ca":true},{"name":"Claude Tardif","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.016729793635537,"gpt":0.2728471466446489,"spread":0.2561173530091119,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001917241,0.0005570315,0.0009755577,0.001392114,0.002094151,0.003910287,0.001468341,0.002212693,0.00500639],"category_scores_gemma":[0.009123792,0.0003516385,0.0008451577,0.002540486,0.004925008,0.01057374,0.003292272,0.002355716,0.0006320499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002377555,"about_ca_system_score_gemma":0.000950355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00160415,"about_ca_topic_score_gemma":0.0007406143,"domain_scores_codex":[0.9981419,0.000457954,0.0001012776,0.0005758657,0.0004772716,0.0002457709],"domain_scores_gemma":[0.9948966,0.002528171,0.0006054129,0.0009012843,0.0007098636,0.000358613],"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.00001304477,0.000004830661,0.0002595096,0.0000151977,0.000003252469,0.00004269702,0.000179089,0.0008040808,0.0003289029,0.9957546,0.0006433032,0.00195149],"study_design_scores_gemma":[0.0000112643,0.00002127291,0.000195628,0.00001495048,0.00001034798,0.0001700722,0.0001375167,0.005739361,0.0005389705,0.9860005,0.007150534,0.000009683361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3655183,0.003545875,0.4683974,0.009249299,0.0003573859,0.0001574079,0.001018176,0.000548923,0.1512073],"genre_scores_gemma":[0.9504731,0.001601289,0.03426573,0.001080754,0.0004952878,0.000190016,0.0005763068,0.00005934671,0.01125826],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00500639,"threshold_uncertainty_score":0.01725042,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992286690","doi":"10.7151/dmgt.1421","title":"The signed matchings in graphs","year":2008,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","authors":[{"name":"Changping Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03104625651139258,"gpt":0.2927063279846094,"spread":0.2616600714732168,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001756188,0.0009504017,0.001194283,0.00515858,0.002330913,0.00645349,0.001262742,0.003106343,0.01003577],"category_scores_gemma":[0.008002745,0.0008456014,0.001203816,0.004455369,0.005565357,0.01101943,0.002580672,0.004153835,0.00104392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002384516,"about_ca_system_score_gemma":0.001166274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001352603,"about_ca_topic_score_gemma":0.0009394769,"domain_scores_codex":[0.9990063,0.0003965147,0.00006693763,0.0001877409,0.000236346,0.0001061052],"domain_scores_gemma":[0.9979751,0.0009632215,0.0003277799,0.0002194484,0.000246717,0.0002677485],"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.000006889712,0.00000442993,0.00003735335,0.00001538662,0.000002386402,0.00001273702,0.00005608312,0.0002523821,0.0000839197,0.9961533,0.0007954938,0.002579757],"study_design_scores_gemma":[0.000004562271,0.000002183245,0.00003997875,0.00000694977,0.000002158365,0.00002359149,0.0000205918,0.0006875658,0.00003161075,0.9972282,0.001948691,0.000004055802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3695377,0.02284759,0.1999744,0.0352044,0.005435412,0.0001870222,0.001025525,0.0005952305,0.3651926],"genre_scores_gemma":[0.8596875,0.01106518,0.0350467,0.003335916,0.006471798,0.0002400087,0.0006301227,0.0002932082,0.08322957],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01003577,"threshold_uncertainty_score":0.03357291,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081711724","doi":"10.7151/dmgt.1221","title":"Generalised irredundance in graphs: Nordhaus-Gaddum bounds","year":2004,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics","authors":[{"name":"Ernest J. Cockayne","is_ca":true},{"name":"Arthur S. Finbow","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02772636584883799,"gpt":0.2987904666951823,"spread":0.2710641008463444,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003022583,0.001215022,0.001888077,0.005305185,0.00338451,0.004548652,0.002080643,0.003012654,0.005445377],"category_scores_gemma":[0.01157456,0.0008437922,0.001731628,0.003567908,0.01011125,0.01301858,0.004605317,0.008496897,0.0007950425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002709857,"about_ca_system_score_gemma":0.0008964233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00179218,"about_ca_topic_score_gemma":0.001582489,"domain_scores_codex":[0.9986023,0.0004855174,0.00006391455,0.0002849749,0.0003457298,0.0002175203],"domain_scores_gemma":[0.9947329,0.003088417,0.0004445439,0.0006742458,0.0004791336,0.0005807829],"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.000004632331,0.000003787966,0.00002795766,0.00001489268,0.000001995731,0.00001501905,0.00009437062,0.0002254395,0.00005134895,0.9984965,0.0003209064,0.0007430909],"study_design_scores_gemma":[0.000001684382,0.000001797331,0.00002533612,0.000005692476,0.000002084684,0.00001449884,0.00001760175,0.0004176522,0.00002071103,0.9989814,0.0005090921,0.000002451645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.241766,0.02068784,0.2470297,0.01681068,0.001694095,0.00006796042,0.0003781426,0.0004990045,0.4710666],"genre_scores_gemma":[0.9347047,0.007018669,0.02822409,0.001813533,0.001888367,0.000104974,0.0001796048,0.0002388525,0.02582733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005445377,"threshold_uncertainty_score":0.01966143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2592983029","doi":"10.7151/dmgt.1732","title":"On the Erd\\H{o}s-Gyárfás conjecture in claw-free graphs","year":2013,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Claw; Mathematics; Combinatorics; Conjecture; Biology","authors":[{"name":"Khodakhast Bibak","is_ca":true},{"name":"Hossein Esfandiari","is_ca":false},{"name":"Pouria Salehi Nowbandegani","is_ca":false},{"name":"Mohammad Hassan Shirdareh Haghighi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02031707558529021,"gpt":0.2612349359308475,"spread":0.2409178603455573,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00142714,0.000505183,0.0009145862,0.002084149,0.001927838,0.002222851,0.001166062,0.001735172,0.005621934],"category_scores_gemma":[0.006604337,0.0003413556,0.0009217906,0.001988641,0.003979615,0.00548694,0.002862857,0.002620613,0.0008471286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001712028,"about_ca_system_score_gemma":0.0008809864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006652223,"about_ca_topic_score_gemma":0.004009309,"domain_scores_codex":[0.999435,0.0001265216,0.00002477795,0.0001605759,0.0001216446,0.000131489],"domain_scores_gemma":[0.9967205,0.002024432,0.0002550621,0.0003324959,0.0003251652,0.0003422792],"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.0001046284,0.00002460432,0.001302779,0.00009628748,0.000008849728,0.0001568477,0.0004811909,0.00530088,0.0009310687,0.9782676,0.003650813,0.009674545],"study_design_scores_gemma":[0.00001755311,0.0000119532,0.0003975664,0.00003580465,0.000005866157,0.00006501798,0.0002222422,0.007111989,0.0004085372,0.9885699,0.00313866,0.00001491704],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7574119,0.005475288,0.06685669,0.01356998,0.0003894502,0.00004463571,0.0006212626,0.0005533302,0.1550775],"genre_scores_gemma":[0.9795327,0.002313417,0.008196551,0.000831211,0.0003186313,0.00005505064,0.0004440085,0.00007506548,0.008233307],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006652223,"threshold_uncertainty_score":0.01880729,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3160192199","doi":"10.7151/dmgt.2494","title":"An analogue of quasi-transitivity for edge-coloured graphs","year":2023,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Mathematics; Combinatorics; Transitive relation; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence","authors":[{"name":"Christopher Duffy","is_ca":true},{"name":"Todd Mullen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02918938736880279,"gpt":0.3245934464297203,"spread":0.2954040590609175,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007551238,0.0003670216,0.0003128394,0.001062666,0.0009432412,0.002159775,0.0007375754,0.0006201598,0.006975865],"category_scores_gemma":[0.002221101,0.0003370519,0.0009319453,0.0009240417,0.002889785,0.004218788,0.001023343,0.001597968,0.0004618977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000900765,"about_ca_system_score_gemma":0.0003158227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001197203,"about_ca_topic_score_gemma":0.001034132,"domain_scores_codex":[0.9990096,0.0001842049,0.00005229004,0.0003995149,0.000181807,0.0001725153],"domain_scores_gemma":[0.9971277,0.0009194747,0.0005537872,0.000845336,0.0003070326,0.0002467041],"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.0000437908,0.00002751005,0.001219375,0.00007242971,0.00001241487,0.00025097,0.0004022908,0.001963538,0.006648312,0.9794602,0.0005633757,0.009335686],"study_design_scores_gemma":[0.00002266193,0.0001245575,0.002795001,0.00003974797,0.00003122068,0.001084038,0.0003492201,0.01374974,0.005637704,0.9609133,0.01522514,0.00002775406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4816689,0.0005834842,0.4294333,0.0008807248,0.0003089148,0.000127201,0.0006600984,0.0004872696,0.08585013],"genre_scores_gemma":[0.9580122,0.0003381022,0.03494399,0.00021697,0.0001210994,0.00004848866,0.0003443153,0.0001268959,0.005847928],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006975865,"threshold_uncertainty_score":0.02333659,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4313905169","doi":"10.7151/dmgt.2480","title":"On the <i>k</i>-independence number of graph products","year":2023,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Fonds Wetenschappelijk Onderzoek","keywords":"Mathematics; Independence number; Combinatorics; Graph; Independence (probability theory); Discrete mathematics; Statistics","authors":[{"name":"Aida Abiad","is_ca":true},{"name":"Hidde Koerts","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01918261965728592,"gpt":0.2552629948764604,"spread":0.2360803752191745,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003115924,0.001014586,0.001093466,0.002846976,0.002048662,0.003027092,0.001815564,0.001168702,0.007012394],"category_scores_gemma":[0.01626518,0.0009195038,0.0009490665,0.002677674,0.005621342,0.007718687,0.003152855,0.004293876,0.00132985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002180223,"about_ca_system_score_gemma":0.0008070605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000982988,"about_ca_topic_score_gemma":0.0008485181,"domain_scores_codex":[0.9977945,0.0005541148,0.0001320401,0.0005982165,0.0004752567,0.0004457753],"domain_scores_gemma":[0.9666947,0.02557228,0.002550232,0.001991773,0.001234873,0.00195614],"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.0006111605,0.0001600413,0.008408015,0.0005741119,0.00008192388,0.0002788977,0.0006755459,0.03026765,0.009339731,0.901321,0.01222899,0.03605282],"study_design_scores_gemma":[0.00004765399,0.0001013272,0.007871391,0.0001380073,0.00008844722,0.0007244401,0.000197095,0.0924404,0.008007823,0.880931,0.009349475,0.000102996],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4911312,0.005855015,0.2933924,0.00641821,0.0003759855,0.000134409,0.002232065,0.0005889784,0.1998717],"genre_scores_gemma":[0.9430012,0.003245764,0.04278479,0.0005686888,0.0005814117,0.0002527373,0.001033083,0.0002264903,0.008305994],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007012394,"threshold_uncertainty_score":0.02345878,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4378981483","doi":"10.7151/dmgt.2499","title":"Chromatic Ramsey numbers of generalised Mycielski graphs","year":2023,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Ramsey's theorem; Discrete mathematics; Graph","authors":[{"name":"Claude Tardif","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04089103654064718,"gpt":0.3316269036095605,"spread":0.2907358670689133,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005971552,0.0003610398,0.0002842097,0.001469601,0.0007680711,0.001217972,0.0006149263,0.0004461495,0.00321423],"category_scores_gemma":[0.00205962,0.000293041,0.0003405352,0.0008088166,0.002082274,0.002361494,0.001264503,0.001155648,0.0001884185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001327256,"about_ca_system_score_gemma":0.0003480704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002032812,"about_ca_topic_score_gemma":0.003724514,"domain_scores_codex":[0.9996681,0.00007148039,0.00001441325,0.00008648385,0.00008566872,0.00007380838],"domain_scores_gemma":[0.9988564,0.0005011827,0.0002186264,0.0001326121,0.0001545662,0.0001366163],"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.000107142,0.00001724715,0.002404716,0.00009372819,0.00002004148,0.0001090714,0.0004899894,0.008323502,0.006087955,0.9734154,0.001205247,0.007725988],"study_design_scores_gemma":[0.00003465964,0.00003287313,0.003756917,0.0000412229,0.00002856816,0.0001645732,0.0003394854,0.02073286,0.002596506,0.9651922,0.007046555,0.00003355063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9059364,0.00120126,0.0405794,0.0009449877,0.00009303343,0.00003449549,0.0002515271,0.0001236745,0.0508352],"genre_scores_gemma":[0.9923104,0.0002991589,0.004607182,0.00006941144,0.00002992327,0.00001630584,0.00007628926,0.00001596827,0.002575337],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00321423,"threshold_uncertainty_score":0.01075268,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2949778016","doi":"10.7151/dmgt.2230","title":"Block graphs with large paired domination multisubdivision number","year":2019,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Domination analysis; Mathematics; Block (permutation group theory); Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence; Vertex (graph theory)","authors":[{"name":"Christina M. Mynhardt","is_ca":true},{"name":"Joanna Raczek","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009081031418182142,"gpt":0.265492382216202,"spread":0.2564113507980199,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002429547,0.0002509096,0.0003739749,0.0007142288,0.0006590934,0.0008722038,0.000443494,0.0003736349,0.003982958],"category_scores_gemma":[0.001382203,0.0002773146,0.000243555,0.0006856851,0.000630723,0.001597301,0.0007963694,0.0005253094,0.0003251735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006775661,"about_ca_system_score_gemma":0.0003874545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008211347,"about_ca_topic_score_gemma":0.001919702,"domain_scores_codex":[0.9996426,0.00007566305,0.00001684672,0.00008113281,0.00009257798,0.0000911792],"domain_scores_gemma":[0.998128,0.0008375117,0.0003705511,0.0002106491,0.0001603874,0.0002929671],"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.001083525,0.0002264316,0.01404461,0.000392149,0.0001093459,0.001470311,0.0006999251,0.07625313,0.09748767,0.7330793,0.008588822,0.06656483],"study_design_scores_gemma":[0.0001780673,0.0003313541,0.01687428,0.00007904612,0.0001077423,0.002148699,0.0007162226,0.2697749,0.02997549,0.6527152,0.02703107,0.00006781126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.917858,0.0003312202,0.06190624,0.0003416496,0.00002489941,0.00006232067,0.0005813864,0.0001894447,0.01870477],"genre_scores_gemma":[0.9775903,0.0001740993,0.01760666,0.00007648295,0.00002220285,0.00008532598,0.00044616,0.00003006425,0.003968663],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003982958,"threshold_uncertainty_score":0.01332432,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4384027103","doi":"10.7151/dmgt.2503","title":"Fractional eternal domination: securely distributing resources across a network","year":2023,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Dawson College; Université de Montréal; University of Victoria","funders":"Fonds de recherche du Québec – Nature et technologies; Université de Montréal; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Combinatorics","authors":[{"name":"Fnu Devvrit","is_ca":true},{"name":"Aaron Krim-Yee","is_ca":true},{"name":"Nithish Kumar","is_ca":true},{"name":"Gary MacGillivray","is_ca":true},{"name":"Ben Seamone","is_ca":true},{"name":"Virgélot Virgile","is_ca":true},{"name":"Anqi Xu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07314322653004089,"gpt":0.3988477076159836,"spread":0.3257044810859427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002989415,0.0007384954,0.001166716,0.001005483,0.001519506,0.002309554,0.001988542,0.0009501445,0.004946798],"category_scores_gemma":[0.01456023,0.0003654851,0.0008398847,0.001279718,0.002702058,0.006826687,0.002694069,0.001577022,0.0003413479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001396918,"about_ca_system_score_gemma":0.000942088,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00153608,"about_ca_topic_score_gemma":0.00184288,"domain_scores_codex":[0.9979324,0.0007747302,0.00009437488,0.0003887761,0.0004088729,0.0004008416],"domain_scores_gemma":[0.9872037,0.008716903,0.001202297,0.001734602,0.0005050436,0.000637436],"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.0009787162,0.0001445778,0.004588865,0.0003391762,0.0001637267,0.0005323981,0.0008740602,0.3724981,0.0179257,0.5127099,0.002967841,0.08627695],"study_design_scores_gemma":[0.00005578073,0.0001186031,0.0006398626,0.00003448787,0.00003887777,0.0004012933,0.000253999,0.6150903,0.004566207,0.3747283,0.004038633,0.00003367159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2789423,0.0004605309,0.7084702,0.000994953,0.00005348563,0.0001612004,0.0002350884,0.0002292354,0.01045295],"genre_scores_gemma":[0.9152907,0.0004830669,0.07823882,0.0001645672,0.00007565278,0.0001466636,0.0001420168,0.0000770749,0.005381524],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004946798,"threshold_uncertainty_score":0.01654869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061151678","doi":"10.7151/dmgt.1503","title":"Structure of the set of all minimal total dominating functions of some classes of graphs","year":2010,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Dominating set; Set (abstract data type); Discrete mathematics; Graph; Vertex (graph theory); Computer science","authors":[{"name":"K. Reji Kumar","is_ca":false},{"name":"Gary MacGillivray","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0143643200391098,"gpt":0.2804135836343913,"spread":0.2660492635952815,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001168817,0.001049003,0.001415072,0.004935034,0.002544558,0.005984263,0.001930636,0.001341326,0.006541003],"category_scores_gemma":[0.004179008,0.0008324189,0.001308366,0.002735568,0.002801528,0.003978587,0.001485282,0.002459048,0.0006102136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002328984,"about_ca_system_score_gemma":0.0009270161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001037191,"about_ca_topic_score_gemma":0.0007663381,"domain_scores_codex":[0.999213,0.0002006148,0.00004407638,0.0002259423,0.0001663524,0.0001499731],"domain_scores_gemma":[0.9950972,0.002983931,0.0005260946,0.0002903642,0.000539708,0.0005625809],"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.0001774196,0.00009153366,0.002233026,0.000154105,0.00008323401,0.0001276602,0.0006662201,0.0036671,0.002699191,0.9782265,0.002879564,0.008994452],"study_design_scores_gemma":[0.00005050779,0.00005214658,0.002512234,0.00004082428,0.00005619761,0.0004067759,0.0002857572,0.01632521,0.001439033,0.9758445,0.002957692,0.00002910388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8890593,0.0009956749,0.06887754,0.00210748,0.00006763592,0.00006142601,0.002850744,0.0002336612,0.03574657],"genre_scores_gemma":[0.9686022,0.000771233,0.01398839,0.000296533,0.0002444227,0.0001844947,0.003567905,0.0001199226,0.01222488],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006541003,"threshold_uncertainty_score":0.02188188,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033204100","doi":"10.7151/dmgt.1781","title":"Fractional aspects of the Erd\\H{o}s-Faber-Lov\\'asz Conjecture","year":2014,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Combinatorics; Conjecture","authors":[{"name":"John Bosica","is_ca":true},{"name":"Claude Tardif","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01463272682985508,"gpt":0.2653539460267434,"spread":0.2507212191968884,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001479051,0.0003233727,0.000517579,0.001127092,0.002175512,0.002372359,0.0009739621,0.001378158,0.004941334],"category_scores_gemma":[0.005110601,0.0002774553,0.0006583522,0.001124142,0.003959862,0.00506577,0.002019312,0.001770249,0.0003103459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002635477,"about_ca_system_score_gemma":0.0007016212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004865589,"about_ca_topic_score_gemma":0.002732947,"domain_scores_codex":[0.9991826,0.0002169394,0.00002993702,0.000177778,0.0002140085,0.0001786506],"domain_scores_gemma":[0.9983365,0.0007434045,0.0002410417,0.0003402428,0.0001801912,0.0001587369],"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.00004252077,0.00001238409,0.000257284,0.00001878298,0.000003114631,0.0000459778,0.0001537511,0.003743001,0.0005035207,0.9918392,0.000956952,0.002423463],"study_design_scores_gemma":[0.00001844868,0.000009932347,0.0003324994,0.00001165248,0.000004734476,0.00004832362,0.0001380204,0.01379598,0.0003674226,0.9804046,0.004857975,0.00001056822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6489938,0.004214413,0.1315806,0.01230454,0.0005100563,0.00005466326,0.0003857237,0.0003463484,0.2016098],"genre_scores_gemma":[0.9835196,0.0007037129,0.008211346,0.0004232507,0.000257857,0.00003372556,0.00009954014,0.00003368091,0.006717316],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004941334,"threshold_uncertainty_score":0.01912183,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2973413571","doi":"10.7151/dmgt.2239","title":"Bounds on watching and watching graph products","year":2019,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","authors":[{"name":"Danny Dyer","is_ca":true},{"name":"Jared Howell","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01496610401219423,"gpt":0.2546068092050074,"spread":0.2396407051928132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00155644,0.001262581,0.001222088,0.002219464,0.001509186,0.003070746,0.002819887,0.001268625,0.01328799],"category_scores_gemma":[0.01578851,0.0006768484,0.001161147,0.002174944,0.002062669,0.007539859,0.002427938,0.003295242,0.00118882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001868003,"about_ca_system_score_gemma":0.0007925829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001705852,"about_ca_topic_score_gemma":0.002228423,"domain_scores_codex":[0.9985932,0.0002504379,0.00007036413,0.0003860494,0.0003103729,0.000389599],"domain_scores_gemma":[0.9784792,0.0147624,0.001128662,0.00166793,0.001387759,0.002574066],"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.0006245236,0.000228518,0.007072951,0.0005688554,0.000123051,0.0003832788,0.001278351,0.04986088,0.01265964,0.8636508,0.008682498,0.05486665],"study_design_scores_gemma":[0.00004142553,0.0002487275,0.003412938,0.0001552934,0.000132022,0.0005429603,0.0004547584,0.1622764,0.007410178,0.8122804,0.0129668,0.00007813574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4441195,0.004692814,0.4419937,0.002832145,0.0003109979,0.0001411767,0.002553131,0.001266408,0.1020901],"genre_scores_gemma":[0.883674,0.002601967,0.09098008,0.0004532816,0.0004167801,0.0002799934,0.001947073,0.0007998649,0.01884704],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01328799,"threshold_uncertainty_score":0.04445279,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081467762","doi":"10.7151/dmgt.1594","title":"Characterizing Cartesian fixers and multipliers","year":2012,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Cartesian coordinate system; Geometry","authors":[{"name":"Stephen Benecke","is_ca":true},{"name":"Christina M. Mynhardt","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01174842629810171,"gpt":0.2355472499799477,"spread":0.223798823681846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002839846,0.00111335,0.001200873,0.004037138,0.00244652,0.005452167,0.001503828,0.002070968,0.01147014],"category_scores_gemma":[0.008966845,0.001536549,0.001633889,0.003498392,0.00470911,0.01371886,0.004773489,0.004070294,0.001143608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001918228,"about_ca_system_score_gemma":0.0007835362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008717771,"about_ca_topic_score_gemma":0.0007876843,"domain_scores_codex":[0.998359,0.0004297376,0.0001201108,0.0005415055,0.0003095376,0.0002400209],"domain_scores_gemma":[0.9952832,0.002313384,0.0007249378,0.0006002267,0.0006582728,0.0004199627],"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.00002152176,0.000009209085,0.0002944237,0.00001948818,0.000007023382,0.00002828863,0.0002489598,0.0002225742,0.0004011152,0.9967007,0.0003101172,0.001736423],"study_design_scores_gemma":[0.00001934357,0.00001700109,0.0002530089,0.00001369586,0.00001908549,0.00008782759,0.0001690424,0.001347087,0.0005057417,0.9946346,0.002921001,0.0000126287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5112451,0.001807985,0.3960351,0.003236417,0.0002654854,0.0001268357,0.000598094,0.0003939521,0.086291],"genre_scores_gemma":[0.8861731,0.001050541,0.07349289,0.0004213162,0.0004466046,0.0001482791,0.0006322195,0.0003006794,0.03733433],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01147014,"threshold_uncertainty_score":0.03837144,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2001998099","doi":"10.7151/dmgt.1377","title":"Couterexample to a conjecture on the structure of bipartite partionable graphs","year":2007,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Cartesian product; Conjecture; Disjoint sets; Partition (number theory); Counterexample; Discrete mathematics; Vertex (graph theory); Graph; Edge-transitive graph; Graph power; Line graph","authors":[{"name":"Richard G. Gibson","is_ca":true},{"name":"Christina M. Mynhardt","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02105752358620902,"gpt":0.2882980533535209,"spread":0.2672405297673119,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00110714,0.0003437605,0.0004509641,0.001074423,0.0020951,0.002110794,0.001106624,0.001576882,0.007097662],"category_scores_gemma":[0.005595895,0.000591427,0.0006410779,0.00191466,0.004656674,0.004631802,0.001631542,0.002095889,0.0006224206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001288875,"about_ca_system_score_gemma":0.0005621893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002366618,"about_ca_topic_score_gemma":0.002500117,"domain_scores_codex":[0.9992408,0.00020812,0.00002397958,0.0002486852,0.0001480064,0.0001303919],"domain_scores_gemma":[0.9937748,0.003670661,0.0005264907,0.001137856,0.0004692338,0.0004210106],"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.0001905611,0.00006500139,0.002983578,0.0001264818,0.0000241013,0.000296025,0.001143903,0.007661563,0.002685885,0.9698167,0.005342266,0.009663908],"study_design_scores_gemma":[0.00004874008,0.00005643916,0.002155188,0.00003634643,0.00002013838,0.0003010242,0.0005097312,0.02177044,0.001501221,0.9667237,0.006859459,0.00001742903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7968459,0.0008424676,0.1432814,0.008364063,0.0001773623,0.00007602598,0.0008591223,0.0005268766,0.04902686],"genre_scores_gemma":[0.9678261,0.000568997,0.02118454,0.000802987,0.0001985869,0.00005313368,0.0008516702,0.00006934757,0.008444825],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007097662,"threshold_uncertainty_score":0.02374405,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3086793159","doi":"10.7151/dmgt.2355","title":"Efficient <i>(j, k)</i> -dominating functions","year":2020,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Dominating set; Discrete mathematics; Graph; Vertex (graph theory)","authors":[{"name":"William F. Klostermeyer","is_ca":false},{"name":"Gary MacGillivray","is_ca":true},{"name":"Piri Farzaneh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01015793320323927,"gpt":0.1914391171773315,"spread":0.1812811839740923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001742629,0.0008353095,0.000712093,0.001319008,0.0009232312,0.002678317,0.001373797,0.0006759292,0.00162934],"category_scores_gemma":[0.004999333,0.0004562635,0.001064941,0.001303352,0.001526023,0.003508798,0.001220546,0.001328998,0.0004747633],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001818618,"about_ca_system_score_gemma":0.001094123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005797816,"about_ca_topic_score_gemma":0.0007221847,"domain_scores_codex":[0.9985731,0.0002720337,0.0001236396,0.0003304324,0.0003547186,0.0003460919],"domain_scores_gemma":[0.9945358,0.002752121,0.0006456023,0.0009085751,0.0008141053,0.0003438656],"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.000491697,0.0002875559,0.006192212,0.0005879788,0.00008763377,0.0005097474,0.0007703705,0.1045391,0.05668538,0.7277038,0.00556508,0.09657945],"study_design_scores_gemma":[0.00007582256,0.000380019,0.004319965,0.0001030461,0.000145011,0.001922375,0.0004783164,0.2996682,0.07568808,0.5865773,0.03053204,0.0001097655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2727658,0.000693518,0.6936421,0.0007365639,0.0001015942,0.0002793709,0.001239554,0.0006819916,0.02985946],"genre_scores_gemma":[0.7621122,0.0005541536,0.2270905,0.0002582673,0.00009529072,0.000261541,0.001244828,0.0002146128,0.008168538],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002678317,"threshold_uncertainty_score":0.01319504,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3047403295","doi":"10.7151/dmgt.2407","title":"Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs","year":2021,"lang":"en","type":"preprint","venue":"Discussiones Mathematicae Graph Theory","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg; University of Victoria","funders":"","keywords":"Cartesian product; Bijection; Combinatorics; Mathematics; Convexity; Regular polygon; Product (mathematics); Binary number; Convex hull; Convex set; Set (abstract data type); Discrete mathematics; Convex optimization; Geometry; Arithmetic; Computer science","authors":[{"name":"MacKenzie Carr","is_ca":true},{"name":"Christina M. Mynhardt","is_ca":true},{"name":"Ortrud R. Oellermann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01795779426189939,"gpt":0.2545900619337912,"spread":0.2366322676718919,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005381585,0.0006189405,0.0005890072,0.002858866,0.0008923783,0.00265458,0.0008253637,0.0004408447,0.003855741],"category_scores_gemma":[0.004941423,0.0006216209,0.0006732756,0.002198878,0.002685006,0.005001024,0.001531208,0.001170368,0.0004277758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001559756,"about_ca_system_score_gemma":0.0007707891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002762071,"about_ca_topic_score_gemma":0.00303277,"domain_scores_codex":[0.9991692,0.000173438,0.0000630572,0.0002283265,0.0002493114,0.0001167104],"domain_scores_gemma":[0.9970459,0.001684605,0.000420511,0.0002925239,0.0003358865,0.0002205264],"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.0000668194,0.00002250412,0.002385365,0.0001059385,0.00001852304,0.0001171385,0.0006046888,0.0148104,0.001894009,0.9504654,0.001686661,0.02782248],"study_design_scores_gemma":[0.00001297899,0.00002581244,0.001435141,0.00004904304,0.00002174063,0.000291365,0.0002438222,0.05000383,0.003282826,0.935527,0.009080548,0.00002583847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5603524,0.001642165,0.394945,0.0005807876,0.00004660211,0.0001448058,0.001359653,0.0002312263,0.04069738],"genre_scores_gemma":[0.8429614,0.00136702,0.1387503,0.0001238893,0.0001179744,0.0002323627,0.002049931,0.0001209346,0.01427626],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003855741,"threshold_uncertainty_score":0.01289874,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3007984159","doi":"10.7151/dmgt.2359","title":"The threshold dimension and irreducible graphs","year":2020,"lang":"en","type":"preprint","venue":"Discussiones Mathematicae Graph Theory","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Winnipeg","funders":"","keywords":"Combinatorics; Metric dimension; Mathematics; Vertex (graph theory); Dimension (graph theory); Graph; Discrete mathematics; Chordal graph; 1-planar graph","authors":[{"name":"Lucas Mol","is_ca":true},{"name":"Matthew J. H. Murphy","is_ca":true},{"name":"Ortrud R. Oellermann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0232763306649944,"gpt":0.2514261500572352,"spread":0.2281498193922408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002844507,0.0004198297,0.0003758513,0.001414342,0.000864105,0.001628963,0.0005141858,0.0005049928,0.002665238],"category_scores_gemma":[0.002340928,0.000306613,0.000507284,0.001245398,0.001786553,0.002620872,0.00152153,0.001129241,0.0002404541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00158054,"about_ca_system_score_gemma":0.0004576796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001233482,"about_ca_topic_score_gemma":0.001074385,"domain_scores_codex":[0.9994259,0.00007584632,0.00003158093,0.0001741536,0.0001451804,0.0001473385],"domain_scores_gemma":[0.9982115,0.0007981179,0.0002955338,0.0002724835,0.000146317,0.0002759164],"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.0001673582,0.00004924156,0.005156275,0.0001850043,0.00004374985,0.0001826713,0.0005054931,0.01530007,0.01347857,0.9317623,0.005887181,0.02728203],"study_design_scores_gemma":[0.00002658821,0.00008060431,0.005970356,0.00006723126,0.00004995565,0.001062868,0.0003358106,0.05634427,0.006735491,0.9098942,0.01937749,0.00005509783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8053444,0.003384088,0.1348178,0.001829277,0.0001443617,0.00005347229,0.001630875,0.000542309,0.05225339],"genre_scores_gemma":[0.9785168,0.0009907504,0.01727515,0.0001761257,0.00007044005,0.00004192891,0.0005292182,0.00004309435,0.002356539],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002665238,"threshold_uncertainty_score":0.01146764,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4293915036","doi":"10.7151/dmgt.2468","title":"On the Strong Path Partition Conjecture","year":2022,"lang":"en","type":"article","venue":"Discussiones Mathematicae Graph Theory","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjecture; Partition (number theory); Combinatorics; Path (computing); Discrete mathematics; Computer science","authors":[{"name":"Johan P. de Wet","is_ca":false},{"name":"Jean E. Dunbar","is_ca":false},{"name":"Marietjie Frick","is_ca":false},{"name":"Ortrud R. Oellermann","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01399524355016314,"gpt":0.2189878998823268,"spread":0.2049926563321636,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003068957,0.0008454416,0.001105539,0.001442738,0.003384507,0.003741933,0.001619606,0.00264405,0.01087288],"category_scores_gemma":[0.01529964,0.0007016874,0.001049471,0.001794014,0.006734165,0.01145043,0.00555586,0.004264825,0.001723383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002037416,"about_ca_system_score_gemma":0.001221898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00199064,"about_ca_topic_score_gemma":0.002074635,"domain_scores_codex":[0.9976036,0.0007203887,0.00007812987,0.0006591323,0.0004803381,0.0004584875],"domain_scores_gemma":[0.9872192,0.008626916,0.0007615833,0.001793641,0.000921624,0.0006771182],"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.0001394113,0.00004126172,0.001918638,0.0001413836,0.00002402972,0.0001024683,0.0003325614,0.004426889,0.0005151401,0.9728968,0.00995878,0.009502571],"study_design_scores_gemma":[0.00002576866,0.00002392628,0.0004715787,0.00003868624,0.00001387766,0.00009163179,0.0001972881,0.008623845,0.0002231975,0.9853665,0.004913887,0.000009803249],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5140071,0.006546278,0.200662,0.04189857,0.001381286,0.000156769,0.002229053,0.0009143084,0.2322046],"genre_scores_gemma":[0.953689,0.002223277,0.02366885,0.00381855,0.001280222,0.0001684963,0.001533711,0.0001706215,0.0134472],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01087288,"threshold_uncertainty_score":0.03637338,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}