{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002312189,0.0003036156,0.0003847473,0.0004019298,0.0004576701,0.00009152907,0.001171252,0.00005873467,0.000005921853],"category_scores_gemma":[0.0007077861,0.0001546462,0.0001988774,0.00118024,0.0008343193,0.0003777233,0.0004114885,0.0003209804,0.0000190832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001945779,"about_ca_system_score_gemma":0.00005091356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001093878,"about_ca_topic_score_gemma":0.000002114014,"domain_scores_codex":[0.9973699,0.0004453538,0.000463815,0.000598408,0.0006398494,0.0004826604],"domain_scores_gemma":[0.9969835,0.001085407,0.0002502477,0.001422899,0.0001106092,0.0001473622],"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.00004693887,0.0001904064,0.00001495953,0.0001202332,0.00003758424,0.000008444802,0.004042321,0.00006497686,0.02048989,0.9551023,0.00001230245,0.01986963],"study_design_scores_gemma":[0.0004400244,0.0001255886,0.0004334575,0.0003046512,0.00001609448,0.00003901218,0.0007541831,0.00009770692,0.08852305,0.9090617,0.000003504997,0.0002010679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6952834,0.0004649381,0.2993862,0.002195603,0.000132733,0.0009397835,0.000006775094,0.0001778737,0.001412687],"genre_scores_gemma":[0.9921497,0.0000442668,0.007518291,0.00009503424,0.00002227334,0.0001076489,0.000001132962,0.00003093161,0.00003071586],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2968663,"threshold_uncertainty_score":0.6306288,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001275925,0.00041939,0.0005857577,0.0006004625,0.0003171388,0.00005702257,0.0005912713,0.0001811884,0.002355384],"category_scores_gemma":[0.0003201607,0.0002773395,0.0003632591,0.001245015,0.000378316,0.0002359109,0.0001128976,0.0003414275,0.0004032484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002239473,"about_ca_system_score_gemma":0.000007754203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001542126,"about_ca_topic_score_gemma":0.000008299766,"domain_scores_codex":[0.9972265,0.0004514371,0.0008335394,0.0005247392,0.000384634,0.000579181],"domain_scores_gemma":[0.9972855,0.001133191,0.0002391546,0.00109697,0.0000506371,0.0001945596],"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.00003206107,0.001102728,0.0002572532,0.0001500264,0.0000461789,0.00001068829,0.002713044,4.534456e-7,0.0003444432,0.9905482,0.00172903,0.003065893],"study_design_scores_gemma":[0.0005443988,0.00002931829,0.0004273127,0.000265669,0.00006049043,0.00002607409,0.00158636,0.0002172504,0.0008401737,0.9951349,0.0004484725,0.000419614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9371294,0.0006690373,0.006439975,0.001903985,0.0002347284,0.0014232,0.00004427702,0.0007723467,0.051383],"genre_scores_gemma":[0.9884852,0.0001122805,0.008291407,0.0001407044,0.00003466184,0.0004099362,0.000009271715,0.00008693687,0.002429559],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05135579,"threshold_uncertainty_score":0.9999679,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001922771,0.000279054,0.0003451186,0.0002811917,0.0003171368,0.0001064991,0.0008871444,0.00009152595,0.000132191],"category_scores_gemma":[0.0002566985,0.0001725175,0.0001438119,0.0005713506,0.0005184981,0.001107031,0.0006351243,0.0002316971,0.0002143697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001667476,"about_ca_system_score_gemma":0.00002356109,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.735567e-7,"about_ca_topic_score_gemma":6.287077e-7,"domain_scores_codex":[0.9976518,0.0004326963,0.0003410888,0.0004193137,0.0004196383,0.000735453],"domain_scores_gemma":[0.9976742,0.0007600971,0.0001228155,0.0009938077,0.000049034,0.0004000776],"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.00003091486,0.0002046008,0.001056269,0.00005708212,0.0000322735,0.000003579705,0.003152972,6.433593e-7,0.001491024,0.9833071,0.00009394393,0.01056959],"study_design_scores_gemma":[0.0003195661,0.0000553935,0.007044889,0.00005885019,0.00001481889,0.00005350721,0.0008883994,0.0005120898,0.001962109,0.9884624,0.0003230261,0.0003049698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3982905,0.002568776,0.5898145,0.0009196018,0.0003841404,0.000602209,0.00001171289,0.0004975072,0.006911074],"genre_scores_gemma":[0.9713997,0.00006584715,0.02751128,0.0001048485,0.00005302864,0.00008044325,0.000002177983,0.00002811705,0.000754551],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5731092,"threshold_uncertainty_score":0.7035058,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001731341,0.0002491213,0.0004218636,0.0003085469,0.0001871289,0.00004986867,0.002805204,0.0000716834,0.0001375339],"category_scores_gemma":[0.0004731251,0.00009933521,0.000310769,0.001459713,0.002098109,0.000464489,0.0007122588,0.0003511442,0.00003552227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001583706,"about_ca_system_score_gemma":0.0000470052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001061772,"about_ca_topic_score_gemma":0.000004942374,"domain_scores_codex":[0.9968584,0.0009618297,0.000656863,0.0003703973,0.0007324488,0.0004200619],"domain_scores_gemma":[0.9956198,0.001949245,0.0003830185,0.001843397,0.0001287127,0.00007577515],"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.00001938476,0.000372266,0.0003677805,0.000130531,0.00002730878,5.543302e-7,0.001712447,0.00002806251,0.002536952,0.9936108,0.0001191342,0.001074781],"study_design_scores_gemma":[0.0002177611,0.00005994816,0.008259601,0.0003695746,0.000005790626,0.000002824226,0.000832545,0.000707799,0.006558246,0.9828424,0.000006064395,0.0001373831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.91613,0.0003141503,0.0580449,0.01053798,0.0002327344,0.003668124,0.00002496215,0.0001573501,0.01088981],"genre_scores_gemma":[0.9949194,0.00001644869,0.004475475,0.0001370157,0.000006656418,0.0002019301,6.158576e-7,0.00001972364,0.0002227208],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07878943,"threshold_uncertainty_score":0.7730569,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033234,0.0003233768,0.0004495475,0.0007697557,0.0002291647,0.00006987309,0.001749199,0.00009942886,0.0001178896],"category_scores_gemma":[0.001815552,0.00016896,0.0002250577,0.003307805,0.0005245638,0.0002914711,0.0001569174,0.0004107998,0.00004867531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001409381,"about_ca_system_score_gemma":0.00005453547,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001374628,"about_ca_topic_score_gemma":0.000003054848,"domain_scores_codex":[0.9958093,0.001700216,0.0005763974,0.0005255843,0.0008032522,0.0005852945],"domain_scores_gemma":[0.9947539,0.003163509,0.0002116669,0.001634574,0.000131928,0.0001044078],"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.00004826229,0.0006417391,0.000157877,0.00006087107,0.00002708971,0.00003281137,0.003534158,0.00006835184,0.0003915595,0.99387,0.00006084825,0.001106398],"study_design_scores_gemma":[0.0005444479,0.000138194,0.0008637914,0.0001688773,0.00001062126,0.00002389214,0.0009317153,0.0008962928,0.0009900843,0.9951211,0.00006406048,0.0002469599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2692657,0.0004329945,0.6999589,0.001189201,0.0003405627,0.001647806,0.00002444621,0.0003925875,0.02674788],"genre_scores_gemma":[0.9844428,0.00003765203,0.01489554,0.0002206917,0.000005597584,0.0001182974,0.00000323069,0.0000311663,0.0002449624],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7151772,"threshold_uncertainty_score":0.6889989,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002038029,0.0003290286,0.0004705354,0.001139187,0.0003251535,0.0000603862,0.001260967,0.0001132472,0.00003358908],"category_scores_gemma":[0.0007117934,0.0002108854,0.0002862634,0.001721703,0.0004534927,0.0006288494,0.0002317815,0.0003778127,0.0001778729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004726252,"about_ca_system_score_gemma":0.00005517296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001811372,"about_ca_topic_score_gemma":0.000002537527,"domain_scores_codex":[0.9966317,0.0008147856,0.0005456581,0.0006656293,0.0007460384,0.0005961623],"domain_scores_gemma":[0.9964128,0.001937148,0.0001716648,0.001226648,0.00006909901,0.0001826813],"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.0003026972,0.0003797295,0.000101211,0.000037207,0.00001765071,0.00008576221,0.004096477,0.000184274,0.0005325053,0.9860844,0.00005966743,0.008118409],"study_design_scores_gemma":[0.001870598,0.000112242,0.001059198,0.0001715602,0.000005563582,0.00005234965,0.000216256,0.002084988,0.003102252,0.9909672,0.00003913748,0.0003186995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3147065,0.0001135496,0.6766263,0.0008960071,0.0002442031,0.0009727838,0.00000470661,0.0003226355,0.006113289],"genre_scores_gemma":[0.968357,0.00008094632,0.03066263,0.0001971271,0.00001082141,0.000235279,0.000003902178,0.00003417294,0.0004181069],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6536505,"threshold_uncertainty_score":0.8599656,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003617252,0.000195928,0.000235035,0.0004544924,0.0002265444,0.0001630712,0.0007254492,0.00007057266,0.000005243277],"category_scores_gemma":[0.0004383211,0.0001069328,0.00007939821,0.0009169223,0.0003512816,0.0008657548,0.0003550216,0.0002152862,0.00001957148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003327041,"about_ca_system_score_gemma":0.00005359441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002327163,"about_ca_topic_score_gemma":0.000006050349,"domain_scores_codex":[0.9978646,0.0005490524,0.00036573,0.0003971483,0.0004526996,0.0003707773],"domain_scores_gemma":[0.9984025,0.0004963063,0.0001261236,0.0007312928,0.00008208575,0.0001617011],"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.00004011376,0.00008398979,0.00007033917,0.00002248611,0.000007795943,0.000003438343,0.004984491,0.0004651872,0.0007237246,0.9857792,0.00009232012,0.007726958],"study_design_scores_gemma":[0.0004245455,0.00002823625,0.0002933259,0.00007742968,0.000006452297,0.00001661461,0.001265677,0.06493809,0.0004629757,0.9323072,0.00002040868,0.0001589967],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2180957,0.0005822123,0.7741061,0.003677513,0.0001345391,0.0006345919,0.000003900749,0.0001672471,0.002598096],"genre_scores_gemma":[0.9844005,0.0000421431,0.01503894,0.0001673207,0.00001410868,0.0001022837,0.000002283071,0.00001961993,0.0002128125],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7663047,"threshold_uncertainty_score":0.4360595,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008213278,0.0006237245,0.0008960134,0.000222826,0.0005061082,0.00011715,0.001086177,0.0003396618,0.001038174],"category_scores_gemma":[0.002554265,0.0003685685,0.0005162054,0.001013076,0.0001745572,0.0001533753,0.0005296527,0.0006475943,0.0001370948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002096355,"about_ca_system_score_gemma":0.0000546043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000106888,"about_ca_topic_score_gemma":3.103675e-7,"domain_scores_codex":[0.9967345,0.0003711612,0.0007445072,0.0008038381,0.0006742979,0.0006716682],"domain_scores_gemma":[0.9963418,0.001293652,0.000251001,0.001120845,0.00004625581,0.0009464769],"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.0001753375,0.0001072233,0.00003156583,0.0003311436,0.0001581692,0.00001059392,0.03036799,0.000008226913,0.0001873058,0.9544193,0.009973247,0.00422993],"study_design_scores_gemma":[0.0003942343,0.0001250004,0.0000431042,0.0002378935,0.0001515531,0.00002968246,0.003356743,0.00006341188,0.0005255759,0.991985,0.002481792,0.0006059731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02738255,0.0002565017,0.9445266,0.00436213,0.0003880838,0.001248647,0.00002767338,0.0007728334,0.02103494],"genre_scores_gemma":[0.55209,0.00001113825,0.4422965,0.003609832,0.0006185852,0.00009601172,0.000008770799,0.0001838549,0.001085361],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5247074,"threshold_uncertainty_score":0.9998766,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001426752,0.0004851445,0.0006923684,0.0002284771,0.0006495558,0.00003848485,0.000936365,0.0002784227,0.0003657274],"category_scores_gemma":[0.001094232,0.0002293436,0.0007264983,0.0006878299,0.0007910586,0.0001861375,0.0003833725,0.0004096552,0.00001365346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005060504,"about_ca_system_score_gemma":0.00006984473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002440065,"about_ca_topic_score_gemma":0.000004125694,"domain_scores_codex":[0.9969685,0.0004234029,0.0009520178,0.0004327724,0.0007217349,0.0005015648],"domain_scores_gemma":[0.9965208,0.001002093,0.0006503726,0.001567981,0.0001230604,0.0001356589],"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.00009539513,0.0002360866,0.0001549915,0.0004944872,0.000130306,0.000002939848,0.007723601,0.00003336548,0.001162692,0.9893056,0.00009603566,0.0005645328],"study_design_scores_gemma":[0.001021229,0.00006943143,0.0009426672,0.0005659731,0.0002459132,0.00006026673,0.001264456,0.00002007835,0.009967401,0.985429,0.00005811623,0.0003554083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9594879,0.0002682283,0.02716448,0.000865057,0.0006950941,0.001313425,0.00004860173,0.0002258394,0.009931397],"genre_scores_gemma":[0.9932812,0.00002069133,0.005853496,0.0001502438,0.00008099633,0.00005997489,0.000005577296,0.00008790845,0.0004599322],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0337933,"threshold_uncertainty_score":0.9352359,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002356817,0.0005256697,0.0007486311,0.0003019983,0.0009561877,0.00006397816,0.00104846,0.0001813226,0.0001071558],"category_scores_gemma":[0.002781646,0.0002815654,0.0003766096,0.0009745719,0.0006862875,0.0003073939,0.0002748985,0.0004906252,0.0001276763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006628135,"about_ca_system_score_gemma":0.00006093688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002099081,"about_ca_topic_score_gemma":0.000008098537,"domain_scores_codex":[0.9961646,0.00052464,0.001205784,0.0004919714,0.0008079163,0.0008051442],"domain_scores_gemma":[0.9923448,0.005463489,0.0004738204,0.001425913,0.0001066183,0.000185371],"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.00008432994,0.0004373762,0.00009338404,0.0001573415,0.00004841852,0.00004414775,0.00528532,0.00000197388,0.0003041428,0.9920741,0.0008061095,0.0006633505],"study_design_scores_gemma":[0.0007682023,0.00005133614,0.0001603101,0.0002712046,0.00003876708,0.0001055469,0.002601483,0.00006464314,0.0005558972,0.9947017,0.0002441631,0.000436729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9077217,0.0007541294,0.05980467,0.001723961,0.001446796,0.00286328,0.00001507465,0.001128389,0.02454201],"genre_scores_gemma":[0.9755394,0.0001826752,0.02038765,0.00009696394,0.0000751632,0.0004299976,0.000003566745,0.000180523,0.003104073],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0678177,"threshold_uncertainty_score":0.9999636,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001893521,0.0006825735,0.0009248909,0.0007460311,0.0006195897,0.0001148841,0.0009725987,0.0003057208,0.0004356715],"category_scores_gemma":[0.0006951554,0.0004376683,0.0005593724,0.001160831,0.0007408771,0.0003900527,0.0003159858,0.0005424691,0.00004899113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009581473,"about_ca_system_score_gemma":0.00007685172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001108987,"about_ca_topic_score_gemma":0.00004261563,"domain_scores_codex":[0.9960192,0.0004109247,0.001162165,0.0007788885,0.0007045349,0.0009242152],"domain_scores_gemma":[0.9971082,0.0006748174,0.0003858155,0.00147115,0.00009330511,0.0002667777],"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.0001317726,0.0005300562,0.0003468777,0.0003066841,0.00009782943,0.00004609891,0.007219843,0.00003152568,0.0006938295,0.9894571,0.0002974666,0.0008409097],"study_design_scores_gemma":[0.001701745,0.00007034572,0.001314247,0.0005432474,0.00008404303,0.00005747673,0.00177643,0.00001760095,0.001148551,0.9923677,0.0002253917,0.0006932024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9703621,0.000609667,0.01122156,0.0007365323,0.0008913622,0.001009404,0.00004165166,0.000479843,0.01464786],"genre_scores_gemma":[0.9794958,0.00008951191,0.01860172,0.0003545295,0.0001128742,0.0002061395,0.00001583564,0.0001451867,0.0009783644],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0136695,"threshold_uncertainty_score":0.9998075,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002061391,0.0006822344,0.0007803942,0.0005076237,0.0006898651,0.0001452816,0.001785104,0.0003284987,0.004052064],"category_scores_gemma":[0.002666272,0.0003058811,0.0005503695,0.0008642828,0.0007876466,0.0002427686,0.0005219617,0.0008548916,0.0001979338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003707827,"about_ca_system_score_gemma":0.00002814821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000775709,"about_ca_topic_score_gemma":0.0000102216,"domain_scores_codex":[0.9959267,0.0008980279,0.0009519682,0.0006465793,0.0007589603,0.0008177334],"domain_scores_gemma":[0.9910004,0.005704281,0.0003581486,0.00264736,0.00008934814,0.000200433],"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.0000641188,0.0003041649,0.0001107753,0.0001552226,0.0001037138,0.00001131481,0.005872422,0.000003147619,0.000140828,0.9808027,0.01153019,0.0009014255],"study_design_scores_gemma":[0.0007663604,0.00008960297,0.001044972,0.0003903472,0.00006181693,0.0000287456,0.002797366,0.00005182187,0.0003714506,0.9936941,0.0001954263,0.0005080523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9456529,0.0002567701,0.001723613,0.006289347,0.0006569393,0.002549598,0.00004017771,0.0003968111,0.04243383],"genre_scores_gemma":[0.994004,0.00003155823,0.002106437,0.001517495,0.00007594335,0.0005661187,0.000006187105,0.0001284857,0.001563828],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04835103,"threshold_uncertainty_score":0.9999393,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003971965,0.000318445,0.000593085,0.0009402556,0.0003598973,0.0000730493,0.001782391,0.0001363219,0.00002968761],"category_scores_gemma":[0.0004346211,0.0002152895,0.0004516883,0.002639021,0.0005063049,0.0007365536,0.0002170901,0.0001981643,0.0000448018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000139938,"about_ca_system_score_gemma":0.00006253025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001428939,"about_ca_topic_score_gemma":0.00000526566,"domain_scores_codex":[0.9967275,0.000709246,0.0005725732,0.0007003985,0.0005854614,0.0007048085],"domain_scores_gemma":[0.995921,0.001708172,0.0002241208,0.001657782,0.0002239218,0.0002649781],"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.0001128399,0.0005001015,0.00008020983,0.0002768775,0.00006708948,0.000009069646,0.003450961,0.00005043317,0.011325,0.9736475,0.0001419034,0.01033803],"study_design_scores_gemma":[0.0005234551,0.0003354167,0.001248492,0.0001099551,0.00002471858,0.000007760846,0.001191332,0.007538959,0.006913561,0.9817556,0.00004520651,0.0003055565],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1169741,0.00006565224,0.8801212,0.000549193,0.000210498,0.0009681219,0.00008605529,0.0006262369,0.0003989433],"genre_scores_gemma":[0.9721767,0.00002772593,0.0270868,0.00005169872,0.00002545796,0.0003264661,0.00004152695,0.00005046588,0.0002131853],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8552026,"threshold_uncertainty_score":0.8779249,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002890928,0.0002561945,0.0003092629,0.0002774329,0.0003267527,0.00007585496,0.001407029,0.00008748565,0.00009810261],"category_scores_gemma":[0.0006669785,0.0001205312,0.0002083088,0.002588824,0.0003261113,0.000210737,0.0003711333,0.0002456521,0.0008096787],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004931825,"about_ca_system_score_gemma":0.00004411681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000205017,"about_ca_topic_score_gemma":3.202722e-7,"domain_scores_codex":[0.9973726,0.0003591541,0.0004825905,0.0005316182,0.0008390891,0.0004149414],"domain_scores_gemma":[0.9967036,0.001093871,0.0002424984,0.00169227,0.0001693789,0.00009834923],"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.00001152005,0.0001480794,0.00005323411,0.00008369982,0.0000325491,0.00000647013,0.001446707,0.00002809017,0.00183597,0.991663,0.00372859,0.0009621175],"study_design_scores_gemma":[0.0001582809,0.00003615146,0.000221843,0.0002501973,0.00001448005,0.00001618174,0.0003518233,0.0005009182,0.006638526,0.9915658,0.00005325105,0.000192508],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8863366,0.0002641577,0.05961068,0.02161764,0.001851479,0.001804988,0.00002530067,0.002357238,0.02613194],"genre_scores_gemma":[0.9945765,0.00003493854,0.003567616,0.000359732,0.000007883106,0.00008948185,0.000003171418,0.00002707979,0.001333644],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1082399,"threshold_uncertainty_score":0.9999683,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002157981,0.0004326358,0.0008878004,0.0005520713,0.0002978924,0.00001830641,0.0006242233,0.000248187,0.001007444],"category_scores_gemma":[0.001266073,0.0002819937,0.0005213919,0.001290015,0.0008248421,0.00021007,0.000199133,0.0002734449,0.0003000587],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001916027,"about_ca_system_score_gemma":0.00003958367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001389629,"about_ca_topic_score_gemma":0.000002552802,"domain_scores_codex":[0.996853,0.000591169,0.0009812401,0.0004569205,0.0004888297,0.0006288721],"domain_scores_gemma":[0.9957438,0.002369983,0.0004894604,0.001125509,0.00008959506,0.0001816113],"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.00008875791,0.0002763016,0.00009676001,0.0006944289,0.0001936305,0.00002324486,0.004188969,0.00001357139,0.003407118,0.9879113,0.002305763,0.0008001932],"study_design_scores_gemma":[0.0006701124,0.00005663876,0.0002570997,0.0003177876,0.0001502727,0.00002805936,0.004160705,0.000132873,0.003518065,0.9902489,0.00008287185,0.0003766096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9557292,0.0001838214,0.02284692,0.0005598147,0.0005816011,0.0009794225,0.00006645889,0.00113008,0.01792262],"genre_scores_gemma":[0.9800204,0.0001007646,0.01370634,0.0001368967,0.00005975985,0.0001861603,0.00004750805,0.0001376495,0.005604545],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02429112,"threshold_uncertainty_score":0.9999632,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002160201,0.0004135968,0.0004806106,0.0004232427,0.000357575,0.0001746818,0.001418041,0.0001330037,0.0004096012],"category_scores_gemma":[0.0001534419,0.0002384014,0.0002452569,0.001416671,0.0002086037,0.001094054,0.0005192574,0.000332639,0.001187896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003245769,"about_ca_system_score_gemma":0.00004272912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.483649e-7,"about_ca_topic_score_gemma":0.000002393077,"domain_scores_codex":[0.9962769,0.0006040771,0.000470002,0.0008580573,0.001014553,0.0007764825],"domain_scores_gemma":[0.9967721,0.0007758314,0.0002510294,0.001759253,0.0001997485,0.0002420698],"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.0001594246,0.000426509,0.002515572,0.0001282918,0.0000580923,0.00001786734,0.001756904,0.00001844519,0.001299287,0.9890403,0.00008427568,0.004494995],"study_design_scores_gemma":[0.001635584,0.0001588514,0.002864717,0.0003167359,0.00002024908,0.00006652898,0.0008576863,0.003837282,0.002142558,0.9873638,0.0002232136,0.0005128338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4676564,0.00007371745,0.5213311,0.0004463785,0.0002652218,0.001361506,0.000013453,0.0006346267,0.008217546],"genre_scores_gemma":[0.9676,0.00001805854,0.02977393,0.0001021172,0.00001596186,0.0001265612,0.00001097197,0.00005862373,0.002293712],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4999436,"threshold_uncertainty_score":0.9995898,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.01098826,0.0002675481,0.0004116989,0.0002062343,0.001414978,0.0004234878,0.00112692,0.0001311057,0.001450595],"category_scores_gemma":[0.003018976,0.0001561516,0.0003631098,0.002689008,0.0004334875,0.0003608515,0.0004257775,0.0003018153,0.003205859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002069392,"about_ca_system_score_gemma":0.00002536991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.169518e-7,"about_ca_topic_score_gemma":0.000002997026,"domain_scores_codex":[0.9956416,0.0006859477,0.0009630311,0.0006355584,0.001434304,0.0006395145],"domain_scores_gemma":[0.9923362,0.005808597,0.0005117614,0.0009298517,0.0002090943,0.0002045651],"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.0001007205,0.0001103945,0.0009944636,0.00001700319,0.00004371191,0.000009793936,0.00532577,0.0005541992,0.0002503345,0.9734917,0.007729797,0.01137214],"study_design_scores_gemma":[0.0002534642,0.00001820308,0.01404081,0.00008602057,0.0000196354,0.00002637854,0.009053195,0.0009035708,0.0001185275,0.9646229,0.01062782,0.0002295361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8786584,0.0000935124,0.1064894,0.003599142,0.0005257005,0.0004624343,0.0001939087,0.0005368736,0.009440667],"genre_scores_gemma":[0.9915487,0.000008560338,0.0007335963,0.0001422875,0.0003643478,0.0001628869,0.00004335487,0.00003020627,0.006966024],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1128903,"threshold_uncertainty_score":0.999885,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001014805,0.0002314134,0.0005661884,0.000414537,0.00011466,0.00001275582,0.001568265,0.0001276743,0.00009916192],"category_scores_gemma":[0.000722097,0.0001224661,0.0004473877,0.001087075,0.001367155,0.0003925081,0.0006309123,0.0003708692,0.000001146229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004793484,"about_ca_system_score_gemma":0.00007532963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002524417,"about_ca_topic_score_gemma":0.00000420711,"domain_scores_codex":[0.9974317,0.0003676521,0.000853513,0.0003228857,0.0007176927,0.0003065663],"domain_scores_gemma":[0.9960583,0.001244376,0.0008566257,0.001469323,0.0002869534,0.00008440841],"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.0000402482,0.0001240472,0.0003651914,0.0002918623,0.00006404797,3.546732e-7,0.001915088,0.00001844623,0.3613127,0.6346544,0.00001347108,0.001200103],"study_design_scores_gemma":[0.000287358,0.00009206761,0.003003723,0.0001692704,0.00003782706,0.00001521772,0.001371425,0.0002741355,0.1912502,0.8033747,0.000005194008,0.0001188472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9798976,0.00007931565,0.01866821,0.0001630522,0.0002930933,0.0003851165,0.0001295547,0.0000295361,0.0003544882],"genre_scores_gemma":[0.9825859,0.00000479816,0.01723954,0.000008212082,0.00001549229,0.00001204512,0.00000310527,0.00001995195,0.0001109495],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1700625,"threshold_uncertainty_score":0.5037339,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001780949,0.0004598865,0.0007085231,0.0002028783,0.0006798294,0.00003815949,0.0009869606,0.0002602458,0.001073114],"category_scores_gemma":[0.002008433,0.0002162524,0.000689583,0.0005164281,0.0008118014,0.0001470269,0.0003892703,0.0004942123,0.00002406319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002432993,"about_ca_system_score_gemma":0.00004914732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001533765,"about_ca_topic_score_gemma":0.000004240823,"domain_scores_codex":[0.9966605,0.0008091548,0.0008107129,0.0004489558,0.0008148178,0.0004558248],"domain_scores_gemma":[0.994874,0.002648245,0.0006454989,0.001558089,0.0001279745,0.0001461634],"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.00006055313,0.0002156976,0.0002170119,0.000326391,0.0001583348,0.000001266178,0.00209779,0.000007009234,0.0006860376,0.9939544,0.001183959,0.001091584],"study_design_scores_gemma":[0.0005358008,0.00005576376,0.001899876,0.000309738,0.0001837186,0.00005374451,0.0006794285,0.00006873265,0.004093052,0.9906725,0.00111095,0.0003367434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7478067,0.0003896859,0.05720258,0.002251739,0.002870219,0.001784257,0.0001047677,0.0005043521,0.1870857],"genre_scores_gemma":[0.9951677,0.000009550179,0.002927045,0.0002649591,0.0001973664,0.00004649588,0.000004524863,0.00008032866,0.001301994],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.247361,"threshold_uncertainty_score":0.99984,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001429461,0.0003185361,0.000360991,0.0002763705,0.0003357072,0.0003218768,0.000961278,0.00008865084,0.0000683317],"category_scores_gemma":[0.000275529,0.0001901077,0.0001290106,0.0005371961,0.0001909194,0.0007095555,0.0004208806,0.0002889128,0.0004738407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001802604,"about_ca_system_score_gemma":0.00003009809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003705742,"about_ca_topic_score_gemma":0.000001220413,"domain_scores_codex":[0.9976133,0.0002285967,0.0004448756,0.0007496265,0.0004977993,0.0004658671],"domain_scores_gemma":[0.997875,0.00053971,0.0001722288,0.001207657,0.0000671829,0.0001382213],"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.00001818837,0.000132925,0.0002137855,0.0001184143,0.00002716943,0.000007991572,0.00913152,0.0000300352,0.002832507,0.965371,0.0001235299,0.02199291],"study_design_scores_gemma":[0.000083347,0.00009159664,0.00036495,0.000321087,0.00001182621,0.00002796494,0.001434603,0.00168139,0.008325324,0.9869596,0.0003536383,0.0003446704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8452979,0.0002324728,0.1398858,0.004172753,0.0008961823,0.0007081289,0.000002570666,0.0004636489,0.008340619],"genre_scores_gemma":[0.983156,0.00002945971,0.01500146,0.0003263643,0.00005932763,0.00003498408,0.000001881623,0.00003441104,0.001356165],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1378581,"threshold_uncertainty_score":0.7752368,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005428212,0.0001923064,0.0002210251,0.0001216512,0.0002450918,0.00006739378,0.0003756317,0.00005681074,0.00003403502],"category_scores_gemma":[0.0000835388,0.0001145029,0.00008422163,0.0002329333,0.0001378345,0.0008366735,0.0002150833,0.0001141652,0.00006030944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009589759,"about_ca_system_score_gemma":0.000007250042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.467499e-7,"about_ca_topic_score_gemma":1.102604e-7,"domain_scores_codex":[0.9988059,0.000112277,0.0002148105,0.0002596006,0.0001732687,0.0004341238],"domain_scores_gemma":[0.9989486,0.0002139306,0.0001015012,0.0004845868,0.00001531894,0.0002360241],"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.000004485778,0.00008016083,0.0005479111,0.00004327113,0.00001478728,0.000001938494,0.006961376,4.05271e-7,0.00315093,0.9713009,0.00002063325,0.01787323],"study_design_scores_gemma":[0.0003173297,0.00002970799,0.009825345,0.0001041052,0.00002135673,0.00005639096,0.002403157,0.0005174663,0.002158735,0.983596,0.0005580409,0.0004123981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2366031,0.0007555377,0.7546309,0.001112908,0.0004996342,0.0003566222,0.000003501131,0.0004434173,0.005594448],"genre_scores_gemma":[0.9704171,0.00002381017,0.02895702,0.0002954461,0.0000513144,0.0000331246,0.000001905731,0.00001537478,0.0002048376],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7338141,"threshold_uncertainty_score":0.4669291,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002360233,0.0003041796,0.0003692853,0.0004938889,0.0003569497,0.0000813477,0.00170446,0.0001002728,0.0002790161],"category_scores_gemma":[0.000548985,0.0001482876,0.0002261095,0.001851672,0.0003593726,0.0002417017,0.0003777152,0.0003170691,0.00007170119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002035939,"about_ca_system_score_gemma":0.00003707938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000166598,"about_ca_topic_score_gemma":0.000007830316,"domain_scores_codex":[0.9971238,0.000355939,0.0005380294,0.0005217687,0.000806403,0.0006540456],"domain_scores_gemma":[0.9956585,0.002030299,0.0002110734,0.00170291,0.0001472497,0.0002499446],"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.0000966792,0.0001231723,0.00009314116,0.00004751872,0.00004632307,0.000006616603,0.002323255,0.00008319,0.01480536,0.979592,0.0003986306,0.002384181],"study_design_scores_gemma":[0.0001912235,0.0001480584,0.0006809515,0.0001277793,0.00000993797,0.00001317062,0.0005856932,0.00009659906,0.05339637,0.9440393,0.0004980816,0.0002127644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3390727,0.00008768369,0.655762,0.00212484,0.0002102787,0.0009540246,0.0000400272,0.0001813056,0.001567164],"genre_scores_gemma":[0.9871823,0.000004706173,0.01181792,0.0005891005,0.00002595881,0.00002698641,0.000003778855,0.00002910245,0.0003201027],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6481097,"threshold_uncertainty_score":0.6046993,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005081909,0.0002711612,0.0003294157,0.0001088351,0.0002172176,0.00004677178,0.0002622222,0.00008228723,0.0004278122],"category_scores_gemma":[0.0001213964,0.0001831022,0.0002408609,0.000543563,0.0001075502,0.00005943821,0.00005293973,0.0002088286,0.0006453944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001199976,"about_ca_system_score_gemma":0.000006479894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.638645e-7,"about_ca_topic_score_gemma":1.379403e-7,"domain_scores_codex":[0.9986044,0.0001440582,0.0004228796,0.0002548553,0.0002402838,0.0003334956],"domain_scores_gemma":[0.9991133,0.000223552,0.000060722,0.0003407614,0.00002833643,0.0002333129],"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.00006460304,0.000163942,0.00007804,0.001085704,0.0002112743,0.00001857031,0.01186675,0.02124945,0.02511292,0.9314898,0.003179957,0.005478945],"study_design_scores_gemma":[0.002149456,0.0002086725,0.0003872107,0.001019089,0.0004083276,0.0001001006,0.03809432,0.2197728,0.009347552,0.7186955,0.007468673,0.002348288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5522299,0.0009660673,0.3721632,0.0007116299,0.0011077,0.0008383347,0.00005912609,0.002674701,0.06924929],"genre_scores_gemma":[0.9987578,0.000004594751,0.0006065762,0.0001306177,0.0001096475,0.00008872561,0.00000771537,0.00006626275,0.00022803],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4465279,"threshold_uncertainty_score":0.8295456,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001108479,0.0003604769,0.0008697715,0.0002406981,0.00009482432,0.0002798641,0.001039994,0.0001210513,0.000002561693],"category_scores_gemma":[0.0005761381,0.0002093693,0.000174717,0.0003908507,0.001228098,0.0004663841,0.002095125,0.0002504582,1.511322e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005211699,"about_ca_system_score_gemma":0.0001172208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005006446,"about_ca_topic_score_gemma":0.000001002616,"domain_scores_codex":[0.9975895,0.0002576508,0.0008636066,0.0006024999,0.0004620284,0.0002246641],"domain_scores_gemma":[0.996762,0.0005209516,0.001016907,0.001265411,0.000361355,0.00007333562],"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.00003186356,0.000585167,0.0006521841,0.01287027,0.0004044644,0.00001811972,0.03577537,0.000007538662,0.02373467,0.8509402,0.00005407321,0.07492613],"study_design_scores_gemma":[0.0001220821,0.00006565571,0.0010954,0.003190493,0.00006861721,0.00003481156,0.00197432,0.0008367923,0.02509434,0.9672223,0.000002623595,0.0002925906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7001222,0.007463942,0.2840273,0.001497723,0.0002622132,0.001824747,0.0002000193,0.0003481498,0.004253658],"genre_scores_gemma":[0.9200329,0.0001086117,0.07974185,0.00002450908,0.000004250285,0.00003498348,0.00001089814,0.00002610994,0.00001588056],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2199107,"threshold_uncertainty_score":0.8537832,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002089009,0.000642744,0.0006734192,0.0002696955,0.001052432,0.0008098606,0.002027217,0.0003063251,0.00001278623],"category_scores_gemma":[0.0002581056,0.0003227216,0.0004198731,0.0006256872,0.0006271623,0.0002220188,0.00406224,0.0009173474,0.00006867685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000129937,"about_ca_system_score_gemma":0.0000942562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003729605,"about_ca_topic_score_gemma":0.000001352842,"domain_scores_codex":[0.9961403,0.00038547,0.000810198,0.00132887,0.0007382772,0.0005969096],"domain_scores_gemma":[0.9958091,0.0007043512,0.00047046,0.002501489,0.0001336953,0.0003808438],"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.00002120581,0.00009136759,0.00002390931,0.0002423444,0.0001058328,0.00001197645,0.002004194,0.00002607165,0.00055754,0.9904585,0.002857951,0.003599033],"study_design_scores_gemma":[0.0002386504,0.00005259537,0.0001001758,0.0005804303,0.0000775678,0.00002476791,0.0003418437,0.005772461,0.0004573827,0.9915367,0.0003138253,0.0005035438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3070056,0.08047375,0.3431161,0.1991039,0.0172267,0.01071106,0.0001501989,0.009361676,0.03285106],"genre_scores_gemma":[0.9758045,0.001528094,0.02080639,0.0007900893,0.00003044966,0.0002754818,0.00002061633,0.00009429335,0.000650057],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6687989,"threshold_uncertainty_score":0.9999225,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001693907,0.0001920293,0.0001825961,0.0001412282,0.001130453,0.0001063373,0.0009306516,0.0000330398,0.0006274117],"category_scores_gemma":[0.0001441581,0.00009295232,0.0001756148,0.0005782152,0.0001220986,0.0001203029,0.0004166249,0.000323425,0.000090155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001725487,"about_ca_system_score_gemma":0.0000278576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.825332e-7,"about_ca_topic_score_gemma":2.268289e-7,"domain_scores_codex":[0.9978086,0.0006441895,0.0002843331,0.0003783831,0.0005807605,0.0003037745],"domain_scores_gemma":[0.9980493,0.0006294528,0.0002053445,0.001004667,0.00002835938,0.00008290551],"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.00001116865,0.0001749335,0.000006953739,0.00001180678,0.00001978485,0.000006302905,0.001481814,0.0003263268,0.0002372692,0.9933625,0.003083693,0.001277425],"study_design_scores_gemma":[0.0001867124,0.0001186286,0.00003422723,0.00004223966,0.00001208938,0.00002000095,0.0009074499,0.002744305,0.0002783223,0.9951217,0.0003696129,0.0001646697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3338991,0.0007349761,0.6088147,0.03281117,0.00205013,0.001834441,0.00006322881,0.001562698,0.01822948],"genre_scores_gemma":[0.9967306,0.000003864734,0.001321865,0.001165814,0.000006414036,0.0002457319,0.000006738172,0.00001721635,0.0005017322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6628315,"threshold_uncertainty_score":0.8694643,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}