{"meta":{"query_hash":"faea0385ff28","filters":{"venue":"Discussiones Mathematicae Graph Theory"},"cohort_total":26,"direct_labels_cover":0,"predictions_cover":26,"exported":26,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/faea0385ff28","api":"https://metacan.xera.ac/api/v1/cohort?venue=Discussiones+Mathematicae+Graph+Theory"},"results":[{"id":"W1967091137","doi":"10.7151/dmgt.1238","title":"On dominating the Cartesian product of a graph and K 2","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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Cartesian product; Mathematics; Combinatorics; Graph; Product (mathematics); Discrete mathematics; Geometry","score_opus":0.011147351217330617,"score_gpt":0.25500146980566574,"score_spread":0.2438541185883351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967091137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5511048,0.007883313,0.11341022,0.014023678,0.0023931696,0.00010082069,0.00052699156,0.0002491024,0.310308],"genre_scores_gemma":[0.9025605,0.0041720495,0.034426898,0.0023249392,0.0018807153,0.00013859259,0.00061455154,0.00029365526,0.05358821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878925,0.0005276798,0.000052861164,0.0003483775,0.00014070013,0.00014107229],"domain_scores_gemma":[0.9958008,0.0025781053,0.0003449213,0.0003618031,0.0004836585,0.00043071355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020092155,0.0009538203,0.0010727099,0.002292511,0.0026021677,0.0036286644,0.001051,0.0013248665,0.006074784],"category_scores_gemma":[0.004322845,0.00092157326,0.0012153336,0.0021510106,0.0063853366,0.008142967,0.0027052797,0.0036512287,0.0007842548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025157336,0.000007855957,0.00016607739,0.000033163375,0.0000050367958,0.000049382288,0.00042944503,0.00031606396,0.00020895097,0.995989,0.0013634576,0.001406456],"study_design_scores_gemma":[0.000010190748,0.000019080468,0.00032215062,0.000018486546,0.000013057369,0.00014556083,0.00020149887,0.0014834991,0.00014767665,0.99209,0.005539988,0.000008918477],"about_ca_topic_score_codex":0.0027742498,"about_ca_topic_score_gemma":0.0023466628,"teacher_disagreement_score":0.006074784,"about_ca_system_score_codex":0.0021537459,"about_ca_system_score_gemma":0.0008267825,"threshold_uncertainty_score":0.020322204},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.035712373019534484,"score_gpt":0.27579385258276223,"score_spread":0.24008147956322776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975584720","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8467087,0.0015492215,0.108918324,0.010356144,0.00016476937,0.00022946624,0.003317721,0.0006499959,0.028105771],"genre_scores_gemma":[0.96237576,0.00097128656,0.023769805,0.00054945616,0.00034066974,0.0002047093,0.002431601,0.00027541158,0.00908131],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973699,0.00071224745,0.00015892752,0.0006035952,0.00046848715,0.00068679405],"domain_scores_gemma":[0.9603566,0.03257976,0.0025033646,0.0016082799,0.0008474703,0.0021044246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023399778,0.0010251387,0.0027947156,0.0022581555,0.002586414,0.0078886775,0.004433037,0.0040002153,0.016410228],"category_scores_gemma":[0.021602536,0.0010210386,0.0020005773,0.0033848302,0.0035154098,0.018891105,0.0037541543,0.0050568734,0.00092082896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015998406,0.0010668121,0.0102922125,0.000993692,0.00024253035,0.0006701912,0.001743187,0.16802591,0.0027811828,0.75708044,0.020492991,0.035011094],"study_design_scores_gemma":[0.00017844673,0.00005555674,0.0016361355,0.000040292805,0.00006320338,0.00023203103,0.00038302774,0.27824798,0.00054930383,0.71689963,0.0016660831,0.000048385824],"about_ca_topic_score_codex":0.007429037,"about_ca_topic_score_gemma":0.0064893053,"teacher_disagreement_score":0.016410228,"about_ca_system_score_codex":0.0049261553,"about_ca_system_score_gemma":0.0025853293,"threshold_uncertainty_score":0.054897666},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.041062757443521954,"score_gpt":0.2893674404735425,"score_spread":0.24830468303002057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983282841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2702697,0.0031752936,0.6633849,0.0012848276,0.00029064933,0.00030923984,0.00061217614,0.0005553113,0.0601179],"genre_scores_gemma":[0.78807414,0.0031822585,0.18020868,0.0009011326,0.00046554027,0.000547265,0.0008597166,0.0003268841,0.025434379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990301,0.00022302821,0.000060995724,0.0002711318,0.00023066376,0.00018405031],"domain_scores_gemma":[0.9979601,0.0009356374,0.00035269713,0.00030364146,0.00024275889,0.00020513436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008008769,0.0007696963,0.00058410654,0.002577875,0.0013432943,0.0021034079,0.0010415373,0.00094416115,0.005424097],"category_scores_gemma":[0.0047687953,0.00064792414,0.00079915894,0.0024992288,0.0022116126,0.0051123416,0.0022342466,0.0015123276,0.00080621464],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004439616,0.000017280376,0.00042443647,0.000097860975,0.00001930591,0.00012150918,0.00031777183,0.0048017665,0.002040731,0.96917546,0.0019141582,0.021025164],"study_design_scores_gemma":[0.000011775232,0.000016669079,0.00019170163,0.000021505926,0.000014082843,0.000107353095,0.00006891059,0.012000021,0.00079548155,0.97607887,0.010683616,0.0000100200305],"about_ca_topic_score_codex":0.0016312134,"about_ca_topic_score_gemma":0.0016873403,"teacher_disagreement_score":0.005424097,"about_ca_system_score_codex":0.0013263437,"about_ca_system_score_gemma":0.0004209364,"threshold_uncertainty_score":0.018145442},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; clone (Java method); Discrete mathematics; Genetics; Biology","score_opus":0.016729793635537005,"score_gpt":0.2728471466446489,"score_spread":0.25611735300911187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983747324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3655183,0.0035458752,0.4683974,0.009249299,0.00035738593,0.00015740788,0.0010181764,0.00054892304,0.15120733],"genre_scores_gemma":[0.95047307,0.0016012889,0.03426573,0.0010807541,0.00049528776,0.00019001601,0.0005763068,0.00005934671,0.0112582585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981419,0.00045795395,0.00010127758,0.00057586574,0.00047727156,0.0002457709],"domain_scores_gemma":[0.9948966,0.0025281713,0.00060541293,0.00090128434,0.00070986355,0.000358613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019172408,0.00055703154,0.0009755577,0.0013921141,0.0020941512,0.0039102873,0.0014683407,0.0022126934,0.0050063897],"category_scores_gemma":[0.009123792,0.0003516385,0.00084515766,0.0025404864,0.004925008,0.01057374,0.0032922723,0.002355716,0.00063204987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013044774,0.0000048306606,0.0002595096,0.000015197703,0.000003252469,0.00004269702,0.00017908904,0.0008040808,0.00032890294,0.9957546,0.0006433032,0.0019514898],"study_design_scores_gemma":[0.000011264305,0.00002127291,0.00019562802,0.000014950485,0.000010347981,0.00017007224,0.00013751672,0.0057393606,0.0005389705,0.9860005,0.0071505336,0.000009683361],"about_ca_topic_score_codex":0.0016041503,"about_ca_topic_score_gemma":0.0007406143,"teacher_disagreement_score":0.0050063897,"about_ca_system_score_codex":0.0023775545,"about_ca_system_score_gemma":0.00095035497,"threshold_uncertainty_score":0.017250419},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.031046256511392575,"score_gpt":0.29270632798460944,"score_spread":0.26166007147321685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992286690","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36953774,0.02284759,0.19997442,0.035204396,0.0054354123,0.00018702217,0.0010255248,0.0005952305,0.3651926],"genre_scores_gemma":[0.8596875,0.011065176,0.035046704,0.0033359155,0.006471798,0.00024000867,0.0006301227,0.00029320817,0.08322957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900633,0.00039651466,0.00006693763,0.0001877409,0.00023634604,0.00010610518],"domain_scores_gemma":[0.99797505,0.0009632215,0.0003277799,0.00021944844,0.00024671695,0.0002677485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017561879,0.0009504017,0.0011942834,0.0051585804,0.002330913,0.0064534904,0.0012627417,0.0031063433,0.010035765],"category_scores_gemma":[0.008002745,0.00084560143,0.0012038156,0.0044553685,0.0055653574,0.011019431,0.0025806723,0.0041538347,0.0010439199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006889712,0.00000442993,0.000037353355,0.000015386617,0.0000023864015,0.000012737025,0.000056083118,0.0002523821,0.0000839197,0.9961533,0.0007954938,0.002579757],"study_design_scores_gemma":[0.0000045622714,0.0000021832452,0.000039978746,0.00000694977,0.0000021583653,0.000023591489,0.000020591802,0.00068756583,0.000031610747,0.9972282,0.0019486912,0.0000040558025],"about_ca_topic_score_codex":0.0013526027,"about_ca_topic_score_gemma":0.0009394769,"teacher_disagreement_score":0.010035765,"about_ca_system_score_codex":0.002384516,"about_ca_system_score_gemma":0.0011662741,"threshold_uncertainty_score":0.033572912},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Cartesian product; Conjecture; Disjoint sets; Partition (number theory); Counterexample; Discrete mathematics; Vertex (graph theory); Graph; Edge-transitive graph; Graph power; Line graph","score_opus":0.021057523586209024,"score_gpt":0.28829805335352093,"score_spread":0.2672405297673119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001998099","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7968459,0.00084246765,0.14328139,0.008364063,0.0001773623,0.00007602598,0.0008591223,0.0005268766,0.04902686],"genre_scores_gemma":[0.96782607,0.000568997,0.02118454,0.000802987,0.00019858686,0.000053133677,0.00085167016,0.000069347574,0.008444825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924076,0.00020812002,0.000023979575,0.00024868522,0.00014800641,0.00013039193],"domain_scores_gemma":[0.9937748,0.0036706615,0.0005264907,0.001137856,0.00046923384,0.00042101063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011071402,0.00034376048,0.00045096406,0.0010744225,0.0020951,0.0021107942,0.0011066245,0.0015768823,0.007097662],"category_scores_gemma":[0.0055958945,0.00059142703,0.0006410779,0.0019146602,0.0046566743,0.0046318015,0.0016315418,0.0020958888,0.00062242063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019056113,0.00006500139,0.002983578,0.00012648175,0.000024101304,0.00029602495,0.0011439034,0.0076615633,0.002685885,0.9698167,0.005342266,0.009663908],"study_design_scores_gemma":[0.000048740076,0.00005643916,0.002155188,0.00003634643,0.000020138385,0.00030102424,0.0005097312,0.02177044,0.0015012213,0.96672374,0.006859459,0.000017429033],"about_ca_topic_score_codex":0.002366618,"about_ca_topic_score_gemma":0.0025001168,"teacher_disagreement_score":0.007097662,"about_ca_system_score_codex":0.0012888752,"about_ca_system_score_gemma":0.0005621893,"threshold_uncertainty_score":0.023744047},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Combinatorics; Conjecture","score_opus":0.014632726829855083,"score_gpt":0.26535394602674345,"score_spread":0.2507212191968884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033204100","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64899385,0.0042144125,0.1315806,0.012304537,0.0005100563,0.00005466326,0.00038572366,0.00034634842,0.2016098],"genre_scores_gemma":[0.9835196,0.0007037129,0.008211346,0.00042325075,0.000257857,0.000033725562,0.000099540135,0.000033680913,0.0067173163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918264,0.00021693938,0.00002993702,0.000177778,0.0002140085,0.00017865056],"domain_scores_gemma":[0.9983365,0.0007434045,0.00024104172,0.00034024278,0.00018019116,0.00015873693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014790511,0.0003233727,0.00051757897,0.0011270918,0.0021755125,0.002372359,0.0009739621,0.0013781585,0.0049413345],"category_scores_gemma":[0.005110601,0.00027745526,0.0006583522,0.001124142,0.003959862,0.0050657704,0.0020193118,0.0017702492,0.00031034587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042520773,0.0000123840855,0.00025728403,0.000018782985,0.0000031146312,0.000045977802,0.00015375108,0.0037430008,0.00050352066,0.99183923,0.000956952,0.0024234632],"study_design_scores_gemma":[0.000018448676,0.000009932347,0.00033249945,0.000011652481,0.0000047344756,0.00004832362,0.00013802045,0.013795981,0.0003674226,0.98040456,0.004857975,0.00001056822],"about_ca_topic_score_codex":0.0048655886,"about_ca_topic_score_gemma":0.0027329465,"teacher_disagreement_score":0.0049413345,"about_ca_system_score_codex":0.0026354766,"about_ca_system_score_gemma":0.0007016212,"threshold_uncertainty_score":0.019121826},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.019116565520654952,"score_gpt":0.2735449358042366,"score_spread":0.2544283702835817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033972173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8320497,0.0011457044,0.12313957,0.00049815205,0.00015728238,0.000042596585,0.00039587988,0.00031945918,0.04225165],"genre_scores_gemma":[0.96459955,0.00043714113,0.028547319,0.00014888376,0.00014970101,0.000063278196,0.00044934012,0.00007248185,0.0055323155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895644,0.0002558023,0.00006445196,0.00029882256,0.0002038757,0.00022066094],"domain_scores_gemma":[0.9961333,0.0020783443,0.00057147356,0.00027962672,0.00035301302,0.0005843092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092816155,0.00049929606,0.000573813,0.0018476811,0.0018175772,0.0025714794,0.00074647914,0.00068035396,0.0035906946],"category_scores_gemma":[0.0025951774,0.00047006292,0.00067510415,0.0013836793,0.0024784908,0.006216212,0.0018418053,0.0014706335,0.00040861222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007324857,0.000044229655,0.0012464672,0.00006051753,0.000009586832,0.0001974807,0.0006438529,0.0010202146,0.0032609564,0.9873383,0.00042434825,0.0056807986],"study_design_scores_gemma":[0.000018671208,0.000046157504,0.0011149098,0.000021346465,0.0000125549,0.00025893064,0.00025435773,0.0054821763,0.001730215,0.98738587,0.0036580253,0.000016726965],"about_ca_topic_score_codex":0.0013620777,"about_ca_topic_score_gemma":0.001996343,"teacher_disagreement_score":0.0035906946,"about_ca_system_score_codex":0.0011648601,"about_ca_system_score_gemma":0.000503242,"threshold_uncertainty_score":0.012012124},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.039834455206508294,"score_gpt":0.3003661581116008,"score_spread":0.2605317029050925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052404722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49378312,0.009210811,0.30815527,0.006968074,0.0006659101,0.000053446813,0.00054341956,0.0005827204,0.1800372],"genre_scores_gemma":[0.98002416,0.0021378212,0.009479474,0.00025521906,0.00041453182,0.000014808218,0.00012061102,0.000064670574,0.007488626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961025,0.00008936151,0.000012586372,0.0000562544,0.00014894601,0.00008252436],"domain_scores_gemma":[0.99917054,0.0003968632,0.000112531896,0.00012657442,0.000081022146,0.0001124909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049417274,0.00029910746,0.00033715265,0.0014348058,0.0009351969,0.0014643973,0.0006422382,0.000845919,0.0028273708],"category_scores_gemma":[0.002684032,0.0001730943,0.00046711115,0.0019168622,0.0021758967,0.0029635064,0.0011811047,0.0017000281,0.0003119971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014898094,0.000008381776,0.00011128619,0.00002135275,0.0000028910981,0.000038132788,0.0001053315,0.0029565017,0.00073904864,0.9909429,0.00076126604,0.0042979345],"study_design_scores_gemma":[0.0000034835243,0.0000053605586,0.00014063629,0.000005361136,0.000002301244,0.000060250633,0.00003692864,0.009526988,0.00021443266,0.9875929,0.0024048507,0.000006372101],"about_ca_topic_score_codex":0.0028245032,"about_ca_topic_score_gemma":0.0019070648,"teacher_disagreement_score":0.0028273708,"about_ca_system_score_codex":0.0011295505,"about_ca_system_score_gemma":0.00060389726,"threshold_uncertainty_score":0.009458542},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Dominating set; Set (abstract data type); Discrete mathematics; Graph; Vertex (graph theory); Computer science","score_opus":0.0143643200391098,"score_gpt":0.2804135836343913,"score_spread":0.26604926359528147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061151678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8890593,0.0009956749,0.06887754,0.0021074796,0.00006763592,0.00006142601,0.0028507442,0.00023366117,0.035746574],"genre_scores_gemma":[0.9686022,0.000771233,0.0139883915,0.00029653296,0.00024442273,0.0001844947,0.0035679054,0.000119922646,0.012224879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999213,0.00020061484,0.00004407638,0.0002259423,0.00016635237,0.00014997314],"domain_scores_gemma":[0.9950972,0.0029839305,0.0005260946,0.0002903642,0.00053970795,0.0005625809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011688169,0.0010490027,0.0014150719,0.0049350336,0.0025445581,0.005984263,0.0019306357,0.001341326,0.0065410035],"category_scores_gemma":[0.0041790083,0.0008324189,0.0013083657,0.0027355682,0.0028015277,0.003978587,0.0014852824,0.002459048,0.0006102136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017741961,0.00009153366,0.0022330256,0.000154105,0.00008323401,0.00012766023,0.0006662201,0.0036671,0.0026991914,0.9782265,0.0028795642,0.008994452],"study_design_scores_gemma":[0.00005050779,0.000052146577,0.0025122345,0.00004082428,0.000056197612,0.00040677594,0.00028575724,0.016325207,0.0014390328,0.9758445,0.002957692,0.000029103878],"about_ca_topic_score_codex":0.0010371909,"about_ca_topic_score_gemma":0.0007663381,"teacher_disagreement_score":0.0065410035,"about_ca_system_score_codex":0.002328984,"about_ca_system_score_gemma":0.00092701614,"threshold_uncertainty_score":0.021881878},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Cartesian coordinate system; Geometry","score_opus":0.011748426298101706,"score_gpt":0.23554724997994775,"score_spread":0.22379882368184603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081467762","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51124513,0.001807985,0.3960351,0.0032364172,0.0002654854,0.00012683567,0.000598094,0.0003939521,0.086291],"genre_scores_gemma":[0.88617307,0.001050541,0.07349289,0.00042131625,0.0004466046,0.00014827914,0.0006322195,0.00030067944,0.03733433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998359,0.0004297376,0.00012011079,0.00054150546,0.00030953757,0.00024002086],"domain_scores_gemma":[0.9952832,0.002313384,0.00072493777,0.00060022675,0.00065827277,0.00041996274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028398456,0.0011133496,0.0012008734,0.004037138,0.00244652,0.0054521672,0.0015038277,0.0020709676,0.011470144],"category_scores_gemma":[0.008966845,0.0015365492,0.0016338892,0.0034983917,0.00470911,0.013718856,0.004773489,0.004070294,0.0011436075],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002152176,0.000009209085,0.00029442372,0.000019488178,0.000007023382,0.000028288634,0.0002489598,0.00022257419,0.00040111525,0.9967007,0.0003101172,0.0017364225],"study_design_scores_gemma":[0.00001934357,0.000017001086,0.00025300894,0.000013695861,0.00001908549,0.00008782759,0.00016904238,0.0013470872,0.00050574174,0.9946346,0.0029210006,0.000012628702],"about_ca_topic_score_codex":0.0008717771,"about_ca_topic_score_gemma":0.0007876843,"teacher_disagreement_score":0.011470144,"about_ca_system_score_codex":0.0019182282,"about_ca_system_score_gemma":0.0007835362,"threshold_uncertainty_score":0.038371444},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.027726365848837992,"score_gpt":0.29879046669518233,"score_spread":0.27106410084634436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081711724","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24176602,0.020687837,0.2470297,0.01681068,0.0016940953,0.00006796042,0.00037814258,0.0004990045,0.4710666],"genre_scores_gemma":[0.93470466,0.007018669,0.028224092,0.001813533,0.0018883675,0.00010497395,0.00017960476,0.00023885252,0.02582733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860233,0.00048551738,0.00006391455,0.0002849749,0.0003457298,0.00021752025],"domain_scores_gemma":[0.99473286,0.0030884165,0.00044454393,0.00067424576,0.00047913363,0.00058078294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030225827,0.0012150222,0.0018880768,0.0053051854,0.00338451,0.004548652,0.0020806429,0.0030126541,0.0054453765],"category_scores_gemma":[0.011574564,0.00084379216,0.0017316277,0.0035679077,0.010111246,0.013018585,0.0046053166,0.008496897,0.0007950425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046323307,0.0000037879656,0.000027957663,0.0000148926765,0.0000019957313,0.000015019046,0.00009437062,0.00022543948,0.000051348947,0.99849653,0.00032090643,0.00074309093],"study_design_scores_gemma":[0.0000016843818,0.0000017973312,0.000025336125,0.000005692476,0.0000020846842,0.000014498839,0.000017601747,0.0004176522,0.000020711032,0.9989814,0.00050909206,0.0000024516448],"about_ca_topic_score_codex":0.0017921798,"about_ca_topic_score_gemma":0.0015824889,"teacher_disagreement_score":0.0054453765,"about_ca_system_score_codex":0.002709857,"about_ca_system_score_gemma":0.0008964233,"threshold_uncertainty_score":0.019661427},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Convexity; Combinatorics; Tree (set theory)","score_opus":0.02274028201100312,"score_gpt":0.2843460459271388,"score_spread":0.26160576391613566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087046441","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2978203,0.007724663,0.18809958,0.017253602,0.00081905414,0.000072496354,0.0009036504,0.00033145086,0.48697528],"genre_scores_gemma":[0.92483485,0.0028200445,0.022237,0.0013787942,0.0012518407,0.00009551808,0.00047286702,0.00026808106,0.046641063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999579,0.000112748516,0.000020830259,0.00010744819,0.00010246004,0.000077411736],"domain_scores_gemma":[0.9988188,0.000678098,0.00009265443,0.00013256309,0.00012327603,0.00015461007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005156541,0.00038245268,0.0009066175,0.0016685494,0.0024913135,0.0032905077,0.00093369896,0.0011701739,0.0131083485],"category_scores_gemma":[0.0020825842,0.0004516829,0.0007916503,0.0020410127,0.003152073,0.0050690593,0.0020824804,0.0033112264,0.000926151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051905317,0.0000034198736,0.00003512902,0.000015398247,0.0000023931098,0.000018161729,0.00005469596,0.00022173718,0.00015142796,0.9972972,0.000796854,0.0013983083],"study_design_scores_gemma":[0.000004223095,0.0000013360074,0.00008201887,0.0000044058133,0.0000032774337,0.000032886725,0.000035552617,0.00045221232,0.00006206781,0.996714,0.0026052834,0.000002705236],"about_ca_topic_score_codex":0.0013245606,"about_ca_topic_score_gemma":0.0019256602,"teacher_disagreement_score":0.0131083485,"about_ca_system_score_codex":0.0017374941,"about_ca_system_score_gemma":0.0006160018,"threshold_uncertainty_score":0.043851793},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.0239342018942265,"score_gpt":0.2893510288309336,"score_spread":0.2654168269367071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165079333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35492375,0.03180016,0.4474709,0.014939441,0.0016393478,0.00016972597,0.0008732409,0.0014850255,0.1466985],"genre_scores_gemma":[0.9826744,0.0033304829,0.007791187,0.00080486765,0.0009928265,0.000095678115,0.00012804307,0.00021440256,0.0039680805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977842,0.0011212963,0.00007102078,0.00036858013,0.00050655805,0.00014829825],"domain_scores_gemma":[0.94338155,0.047628704,0.0026100548,0.0030984322,0.0019404605,0.0013407449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004386864,0.00080812635,0.0012756676,0.0023913602,0.0011662436,0.002614052,0.0016416305,0.0017059677,0.004863389],"category_scores_gemma":[0.05009565,0.0005277897,0.00066523236,0.002098844,0.0036004507,0.005387191,0.0024630292,0.0035095382,0.00046750205],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015609311,0.00003890615,0.0047803544,0.0002623768,0.00010857698,0.0005879835,0.00044840085,0.043637887,0.0035582865,0.91877836,0.0097850915,0.0178578],"study_design_scores_gemma":[0.000041322022,0.00006141435,0.0034866924,0.00012522565,0.000060951174,0.000688376,0.00011466886,0.12518539,0.0011835143,0.8591988,0.009767012,0.00008652192],"about_ca_topic_score_codex":0.0012880592,"about_ca_topic_score_gemma":0.0007999627,"teacher_disagreement_score":0.004863389,"about_ca_system_score_codex":0.0017810244,"about_ca_system_score_gemma":0.000431997,"threshold_uncertainty_score":0.023200214},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Claw; Mathematics; Combinatorics; Conjecture; Biology","score_opus":0.020317075585290206,"score_gpt":0.26123493593084746,"score_spread":0.24091786034555726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592983029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7574119,0.0054752883,0.06685669,0.013569982,0.0003894502,0.00004463571,0.00062126265,0.00055333023,0.15507753],"genre_scores_gemma":[0.97953266,0.002313417,0.008196551,0.000831211,0.00031863133,0.00005505064,0.0004440085,0.00007506548,0.008233307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999435,0.00012652163,0.000024777954,0.00016057593,0.0001216446,0.00013148904],"domain_scores_gemma":[0.9967205,0.002024432,0.0002550621,0.0003324959,0.00032516522,0.00034227924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014271404,0.00050518295,0.00091458624,0.0020841486,0.0019278381,0.0022228507,0.0011660618,0.0017351725,0.0056219343],"category_scores_gemma":[0.006604337,0.00034135557,0.0009217906,0.001988641,0.0039796154,0.00548694,0.0028628567,0.0026206132,0.00084712857],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010462838,0.000024604322,0.0013027788,0.00009628748,0.000008849728,0.0001568477,0.00048119092,0.0053008804,0.00093106873,0.97826755,0.003650813,0.009674545],"study_design_scores_gemma":[0.000017553106,0.000011953204,0.0003975664,0.000035804645,0.0000058661567,0.00006501798,0.00022224223,0.007111989,0.00040853725,0.9885699,0.00313866,0.000014917045],"about_ca_topic_score_codex":0.0066522234,"about_ca_topic_score_gemma":0.0040093088,"teacher_disagreement_score":0.0066522234,"about_ca_system_score_codex":0.0017120276,"about_ca_system_score_gemma":0.0008809864,"threshold_uncertainty_score":0.018807292},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.009081031418182142,"score_gpt":0.26549238221620197,"score_spread":0.25641135079801985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949778016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.917858,0.00033122025,0.06190624,0.00034164957,0.000024899413,0.00006232067,0.00058138644,0.00018944472,0.018704766],"genre_scores_gemma":[0.97759026,0.00017409935,0.01760666,0.000076482946,0.000022202852,0.00008532598,0.00044615997,0.000030064248,0.0039686626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996426,0.000075663054,0.000016846716,0.000081132814,0.000092577975,0.0000911792],"domain_scores_gemma":[0.998128,0.00083751173,0.00037055108,0.00021064914,0.00016038735,0.0002929671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024295473,0.00025090962,0.00037397494,0.0007142288,0.0006590934,0.00087220385,0.00044349398,0.00037363495,0.0039829584],"category_scores_gemma":[0.0013822028,0.0002773146,0.00024355495,0.0006856851,0.00063072296,0.0015973008,0.0007963694,0.00052530935,0.00032517346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010835245,0.00022643156,0.014044611,0.00039214897,0.00010934593,0.0014703106,0.00069992506,0.07625313,0.097487666,0.73307925,0.008588822,0.06656483],"study_design_scores_gemma":[0.00017806728,0.0003313541,0.01687428,0.00007904612,0.000107742264,0.0021486985,0.00071622257,0.26977488,0.02997549,0.6527152,0.027031071,0.00006781126],"about_ca_topic_score_codex":0.00082113466,"about_ca_topic_score_gemma":0.0019197016,"teacher_disagreement_score":0.0039829584,"about_ca_system_score_codex":0.0006775661,"about_ca_system_score_gemma":0.00038745452,"threshold_uncertainty_score":0.01332432},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.01496610401219423,"score_gpt":0.25460680920500744,"score_spread":0.23964070519281322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973413571","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44411954,0.0046928143,0.44199365,0.0028321447,0.0003109979,0.00014117669,0.0025531305,0.0012664081,0.10209012],"genre_scores_gemma":[0.88367397,0.0026019672,0.09098008,0.0004532816,0.0004167801,0.00027999337,0.0019470735,0.00079986494,0.018847043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859315,0.0002504379,0.000070364134,0.00038604945,0.00031037285,0.00038959895],"domain_scores_gemma":[0.9784792,0.014762403,0.0011286621,0.0016679296,0.0013877591,0.002574066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015564404,0.0012625812,0.0012220884,0.0022194637,0.0015091863,0.003070746,0.002819887,0.0012686248,0.013287986],"category_scores_gemma":[0.01578851,0.0006768484,0.0011611466,0.0021749444,0.002062669,0.0075398586,0.0024279384,0.0032952419,0.0011888195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006245236,0.00022851804,0.007072951,0.00056885544,0.00012305095,0.00038327882,0.0012783512,0.049860876,0.012659636,0.8636508,0.008682498,0.054866645],"study_design_scores_gemma":[0.000041425534,0.0002487275,0.003412938,0.00015529341,0.00013202199,0.0005429603,0.00045475844,0.16227636,0.0074101784,0.81228036,0.012966796,0.00007813574],"about_ca_topic_score_codex":0.0017058516,"about_ca_topic_score_gemma":0.0022284226,"teacher_disagreement_score":0.013287986,"about_ca_system_score_codex":0.0018680034,"about_ca_system_score_gemma":0.0007925829,"threshold_uncertainty_score":0.044452786},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Discrete mathematics","score_opus":0.043397361792862126,"score_gpt":0.30206699216061644,"score_spread":0.2586696303677543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001905662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05455123,0.0039194557,0.76378584,0.011642971,0.0010080218,0.000095889765,0.00033824833,0.00040312542,0.16425514],"genre_scores_gemma":[0.7160086,0.0025215894,0.25058663,0.0028371126,0.002671724,0.00039281818,0.00046236144,0.0003395744,0.024179554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737,0.0009986677,0.00009248033,0.0007202523,0.0005574244,0.000261168],"domain_scores_gemma":[0.99604046,0.0019397844,0.0002697652,0.0009061779,0.0005111911,0.00033259336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041712606,0.0011921466,0.0012857273,0.004315862,0.0027846408,0.003627101,0.0035042912,0.0022901893,0.008615881],"category_scores_gemma":[0.008434904,0.00065385795,0.0014907541,0.00287402,0.009001182,0.014042552,0.0058136256,0.0055743926,0.0010237962],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045620754,0.0000056092335,0.00007029415,0.000008947166,0.0000018791052,0.000017863855,0.000065360524,0.0004908687,0.00009119549,0.9974974,0.0005124451,0.0012337274],"study_design_scores_gemma":[0.000005482772,0.000010149207,0.000047429603,0.0000086909085,0.0000025138108,0.000033004733,0.000037578735,0.004034787,0.000077333236,0.99084455,0.004893061,0.0000055159076],"about_ca_topic_score_codex":0.0017448515,"about_ca_topic_score_gemma":0.0015579491,"teacher_disagreement_score":0.008615881,"about_ca_system_score_codex":0.002518138,"about_ca_system_score_gemma":0.0010048848,"threshold_uncertainty_score":0.028823018},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023276330664994398,"score_gpt":0.25142615005723523,"score_spread":0.22814981939224083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007984159","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8053444,0.003384088,0.13481784,0.0018292774,0.0001443617,0.000053472286,0.0016308749,0.00054230896,0.05225339],"genre_scores_gemma":[0.97851676,0.0009907504,0.017275149,0.00017612574,0.00007044005,0.000041928914,0.0005292182,0.00004309435,0.0023565388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994259,0.00007584632,0.000031580927,0.00017415355,0.00014518043,0.00014733849],"domain_scores_gemma":[0.9982115,0.0007981179,0.00029553383,0.00027248348,0.00014631702,0.00027591636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028445068,0.00041982974,0.00037585132,0.0014143424,0.000864105,0.0016289628,0.0005141858,0.0005049928,0.0026652375],"category_scores_gemma":[0.0023409284,0.00030661296,0.00050728396,0.0012453977,0.0017865526,0.0026208723,0.0015215295,0.0011292406,0.0002404541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016735817,0.000049241564,0.0051562754,0.00018500426,0.00004374985,0.0001826713,0.0005054931,0.015300066,0.01347857,0.93176234,0.0058871806,0.02728203],"study_design_scores_gemma":[0.00002658821,0.00008060431,0.005970356,0.00006723126,0.000049955648,0.0010628684,0.0003358106,0.05634427,0.0067354906,0.9098942,0.019377494,0.000055097833],"about_ca_topic_score_codex":0.0012334818,"about_ca_topic_score_gemma":0.0010743845,"teacher_disagreement_score":0.0026652375,"about_ca_system_score_codex":0.0015805402,"about_ca_system_score_gemma":0.00045767965,"threshold_uncertainty_score":0.011467636},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017957794261899387,"score_gpt":0.25459006193379125,"score_spread":0.23663226767189185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047403295","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5603524,0.0016421647,0.39494503,0.0005807876,0.000046602112,0.00014480585,0.0013596533,0.00023122625,0.04069738],"genre_scores_gemma":[0.8429614,0.0013670201,0.13875026,0.0001238893,0.000117974436,0.0002323627,0.0020499309,0.00012093462,0.014276262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916923,0.00017343798,0.0000630572,0.00022832653,0.0002493114,0.000116710355],"domain_scores_gemma":[0.99704593,0.0016846053,0.00042051097,0.00029252394,0.00033588652,0.00022052643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053815846,0.0006189405,0.0005890072,0.0028588658,0.00089237833,0.0026545804,0.0008253637,0.00044084468,0.0038557407],"category_scores_gemma":[0.0049414234,0.00062162086,0.00067327556,0.0021988782,0.002685006,0.005001024,0.0015312079,0.0011703683,0.00042777575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000668194,0.000022504119,0.0023853653,0.00010593846,0.000018523036,0.00011713845,0.0006046888,0.014810399,0.0018940088,0.9504654,0.0016866609,0.027822478],"study_design_scores_gemma":[0.000012978988,0.000025812438,0.0014351408,0.000049043043,0.000021740627,0.00029136502,0.00024382217,0.050003827,0.0032828262,0.935527,0.009080548,0.000025838472],"about_ca_topic_score_codex":0.0027620713,"about_ca_topic_score_gemma":0.0030327702,"teacher_disagreement_score":0.0038557407,"about_ca_system_score_codex":0.0015597555,"about_ca_system_score_gemma":0.0007707891,"threshold_uncertainty_score":0.012898743},"labels":[],"label_agreement":null},{"id":"W3086793159","doi":"10.7151/dmgt.2355","title":"Efficient (j, k) -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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Dominating set; Discrete mathematics; Graph; Vertex (graph theory)","score_opus":0.010157933203239268,"score_gpt":0.19143911717733153,"score_spread":0.18128118397409226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086793159","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27276576,0.00069351797,0.69364214,0.0007365639,0.0001015942,0.0002793709,0.0012395537,0.0006819916,0.029859459],"genre_scores_gemma":[0.7621122,0.00055415364,0.2270905,0.0002582673,0.00009529072,0.00026154105,0.0012448283,0.00021461281,0.008168538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857306,0.00027203368,0.00012363959,0.00033043238,0.00035471865,0.0003460919],"domain_scores_gemma":[0.9945358,0.0027521213,0.0006456023,0.00090857514,0.00081410527,0.0003438656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017426295,0.0008353095,0.000712093,0.0013190077,0.0009232312,0.0026783173,0.0013737967,0.0006759292,0.0016293399],"category_scores_gemma":[0.004999333,0.0004562635,0.0010649408,0.0013033523,0.0015260231,0.0035087983,0.0012205464,0.0013289985,0.0004747633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000491697,0.00028755594,0.006192212,0.0005879788,0.00008763377,0.0005097474,0.00077037053,0.10453909,0.056685384,0.72770375,0.0055650803,0.09657945],"study_design_scores_gemma":[0.00007582256,0.00038001902,0.0043199654,0.00010304611,0.00014501097,0.0019223746,0.00047831636,0.2996682,0.07568808,0.5865773,0.030532043,0.00010976549],"about_ca_topic_score_codex":0.0005797816,"about_ca_topic_score_gemma":0.00072218466,"teacher_disagreement_score":0.0026783173,"about_ca_system_score_codex":0.0018186184,"about_ca_system_score_gemma":0.0010941233,"threshold_uncertainty_score":0.013195038},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02918938736880279,"score_gpt":0.3245934464297203,"score_spread":0.29540405906091755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160192199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48166892,0.0005834842,0.42943332,0.0008807248,0.00030891475,0.00012720103,0.0006600984,0.00048726963,0.08585013],"genre_scores_gemma":[0.9580122,0.00033810223,0.034943994,0.00021697,0.00012109944,0.000048488655,0.0003443153,0.00012689589,0.005847928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990096,0.00018420494,0.000052290037,0.00039951495,0.00018180696,0.00017251527],"domain_scores_gemma":[0.9971277,0.0009194747,0.0005537872,0.000845336,0.00030703263,0.00024670412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007551238,0.0003670216,0.00031283943,0.0010626662,0.00094324123,0.002159775,0.0007375754,0.00062015984,0.0069758645],"category_scores_gemma":[0.0022211012,0.0003370519,0.00093194534,0.00092404167,0.0028897845,0.004218788,0.0010233432,0.0015979679,0.00046189767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000437908,0.000027510046,0.0012193752,0.00007242971,0.000012414872,0.00025096998,0.00040229078,0.0019635381,0.006648312,0.97946024,0.00056337565,0.009335686],"study_design_scores_gemma":[0.000022661929,0.00012455745,0.0027950008,0.000039747974,0.000031220683,0.0010840377,0.00034922006,0.013749738,0.005637704,0.9609133,0.01522514,0.000027754062],"about_ca_topic_score_codex":0.0011972027,"about_ca_topic_score_gemma":0.0010341322,"teacher_disagreement_score":0.0069758645,"about_ca_system_score_codex":0.000900765,"about_ca_system_score_gemma":0.0003158227,"threshold_uncertainty_score":0.02333659},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjecture; Partition (number theory); Combinatorics; Path (computing); Discrete mathematics; Computer science","score_opus":0.01399524355016314,"score_gpt":0.21898789988232675,"score_spread":0.20499265633216363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293915036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5140071,0.0065462776,0.20066196,0.04189857,0.0013812862,0.00015676903,0.002229053,0.0009143084,0.23220463],"genre_scores_gemma":[0.953689,0.0022232772,0.023668848,0.0038185497,0.0012802219,0.00016849628,0.001533711,0.00017062153,0.0134472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976036,0.0007203887,0.00007812987,0.00065913226,0.00048033815,0.00045848748],"domain_scores_gemma":[0.9872192,0.0086269155,0.0007615833,0.0017936415,0.00092162396,0.0006771182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003068957,0.0008454416,0.0011055393,0.0014427375,0.0033845068,0.003741933,0.0016196064,0.0026440497,0.010872883],"category_scores_gemma":[0.015299643,0.0007016874,0.0010494711,0.0017940139,0.0067341654,0.011450426,0.00555586,0.004264825,0.0017233833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013941126,0.00004126172,0.0019186378,0.0001413836,0.00002402972,0.00010246831,0.00033256138,0.0044268887,0.00051514007,0.9728968,0.00995878,0.009502571],"study_design_scores_gemma":[0.000025768655,0.000023926277,0.00047157868,0.000038686245,0.000013877661,0.000091631795,0.00019728809,0.008623845,0.00022319752,0.98536646,0.0049138875,0.000009803249],"about_ca_topic_score_codex":0.0019906396,"about_ca_topic_score_gemma":0.002074635,"teacher_disagreement_score":0.010872883,"about_ca_system_score_codex":0.0020374155,"about_ca_system_score_gemma":0.0012218981,"threshold_uncertainty_score":0.036373377},"labels":[],"label_agreement":null},{"id":"W4313905169","doi":"10.7151/dmgt.2480","title":"On the k-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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fonds Wetenschappelijk Onderzoek","keywords":"Mathematics; Independence number; Combinatorics; Graph; Independence (probability theory); Discrete mathematics; Statistics","score_opus":0.01918261965728592,"score_gpt":0.2552629948764604,"score_spread":0.2360803752191745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313905169","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49113125,0.0058550145,0.29339236,0.0064182095,0.00037598555,0.00013440904,0.0022320652,0.0005889784,0.19987172],"genre_scores_gemma":[0.94300115,0.003245764,0.042784788,0.0005686888,0.0005814117,0.00025273729,0.0010330832,0.00022649026,0.008305994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977945,0.00055411475,0.0001320401,0.00059821655,0.00047525667,0.00044577525],"domain_scores_gemma":[0.96669465,0.025572281,0.0025502318,0.001991773,0.0012348732,0.00195614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031159236,0.0010145864,0.0010934663,0.002846976,0.0020486622,0.0030270922,0.0018155645,0.0011687023,0.007012394],"category_scores_gemma":[0.01626518,0.0009195038,0.00094906654,0.002677674,0.0056213425,0.0077186874,0.003152855,0.0042938762,0.0013298499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061116053,0.00016004131,0.008408015,0.0005741119,0.00008192388,0.00027889773,0.00067554595,0.030267647,0.009339731,0.901321,0.012228988,0.036052816],"study_design_scores_gemma":[0.00004765399,0.000101327234,0.007871391,0.0001380073,0.00008844722,0.0007244401,0.00019709504,0.092440404,0.0080078235,0.88093096,0.009349475,0.00010299596],"about_ca_topic_score_codex":0.000982988,"about_ca_topic_score_gemma":0.0008485181,"teacher_disagreement_score":0.007012394,"about_ca_system_score_codex":0.0021802234,"about_ca_system_score_gemma":0.00080706045,"threshold_uncertainty_score":0.023458779},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Ramsey's theorem; Discrete mathematics; Graph","score_opus":0.04089103654064718,"score_gpt":0.3316269036095605,"score_spread":0.2907358670689133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378981483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9059364,0.0012012596,0.040579397,0.0009449877,0.00009303343,0.000034495493,0.00025152706,0.00012367454,0.050835203],"genre_scores_gemma":[0.9923104,0.00029915888,0.0046071825,0.00006941144,0.000029923265,0.000016305841,0.00007628926,0.00001596827,0.0025753372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996681,0.00007148039,0.000014413246,0.00008648385,0.00008566872,0.00007380838],"domain_scores_gemma":[0.9988564,0.00050118275,0.00021862639,0.0001326121,0.00015456622,0.00013661629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005971552,0.0003610398,0.0002842097,0.0014696011,0.0007680711,0.0012179717,0.0006149263,0.0004461495,0.0032142298],"category_scores_gemma":[0.0020596196,0.00029304103,0.0003405352,0.00080881664,0.002082274,0.0023614943,0.0012645032,0.0011556481,0.00018841853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107141976,0.000017247154,0.0024047163,0.000093728195,0.000020041482,0.000109071414,0.0004899894,0.008323502,0.0060879546,0.97341543,0.0012052472,0.0077259876],"study_design_scores_gemma":[0.000034659635,0.00003287313,0.003756917,0.0000412229,0.000028568158,0.00016457315,0.0003394854,0.020732857,0.0025965062,0.9651922,0.0070465547,0.00003355063],"about_ca_topic_score_codex":0.0020328118,"about_ca_topic_score_gemma":0.0037245138,"teacher_disagreement_score":0.0032142298,"about_ca_system_score_codex":0.0013272561,"about_ca_system_score_gemma":0.0003480704,"threshold_uncertainty_score":0.010752678},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.07314322653004089,"score_gpt":0.3988477076159836,"score_spread":0.3257044810859427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384027103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27894226,0.0004605309,0.7084702,0.000994953,0.000053485626,0.00016120037,0.00023508843,0.0002292354,0.01045295],"genre_scores_gemma":[0.9152907,0.00048306695,0.078238815,0.00016456716,0.00007565278,0.0001466636,0.00014201683,0.000077074896,0.0053815236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793243,0.00077473023,0.00009437488,0.0003887761,0.00040887287,0.00040084164],"domain_scores_gemma":[0.98720366,0.008716903,0.001202297,0.0017346023,0.0005050436,0.000637436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029894146,0.0007384954,0.0011667158,0.0010054829,0.0015195061,0.0023095545,0.0019885425,0.00095014455,0.004946798],"category_scores_gemma":[0.014560231,0.00036548512,0.00083988474,0.0012797175,0.0027020578,0.0068266867,0.0026940694,0.001577022,0.0003413479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009787162,0.00014457776,0.004588865,0.0003391762,0.00016372671,0.0005323981,0.0008740602,0.37249807,0.017925696,0.5127099,0.0029678408,0.08627695],"study_design_scores_gemma":[0.000055780725,0.00011860313,0.00063986256,0.00003448787,0.000038877766,0.00040129328,0.00025399902,0.6150903,0.004566207,0.3747283,0.0040386333,0.000033671586],"about_ca_topic_score_codex":0.0015360803,"about_ca_topic_score_gemma":0.0018428803,"teacher_disagreement_score":0.004946798,"about_ca_system_score_codex":0.0013969177,"about_ca_system_score_gemma":0.000942088,"threshold_uncertainty_score":0.016548693},"labels":[],"label_agreement":null}]}