{"meta":{"query_hash":"266c6e2f6daa","filters":{"venue":"Electronic Journal of Graph Theory and Applications"},"cohort_total":6,"direct_labels_cover":0,"predictions_cover":6,"exported":6,"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/266c6e2f6daa","api":"https://metacan.xera.ac/api/v1/cohort?venue=Electronic+Journal+of+Graph+Theory+and+Applications"},"results":[{"id":"W2171410117","doi":"10.5614/ejgta.2015.3.1.2","title":"On scores, losing scores and total scores in hypertournaments","year":2015,"lang":"en","type":"article","venue":"Electronic Journal of Graph Theory and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"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 Calgary","funders":"Killam Trusts; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Combinatorics; Mathematics; Hypergraph; Element (criminal law); Vertex (graph theory); Enhanced Data Rates for GSM Evolution; Graph; Computer science; Artificial intelligence; Law","score_opus":0.014868215739346788,"score_gpt":0.28698020828732473,"score_spread":0.27211199254797797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171410117","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74482673,0.008062612,0.24612749,0.0003795705,0.00003987415,0.00025164406,0.0000016804662,0.00001866025,0.00029171605],"genre_scores_gemma":[0.9980975,0.00069459534,0.0009814397,0.00009824447,0.000050272934,0.000020837844,5.457428e-7,0.000010208445,0.00004638248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845594,0.00027166278,0.00030520672,0.0002390049,0.00029609696,0.00043207264],"domain_scores_gemma":[0.9987997,0.00044322677,0.00017954002,0.00026650145,0.000108284854,0.00020273986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020728803,0.00013655782,0.00020150344,0.0004800729,0.00016082596,0.00010402007,0.00046971624,0.00004398986,0.0000022731292],"category_scores_gemma":[0.000121315476,0.00011235228,0.00005057785,0.0005794274,0.00023201245,0.00046950387,0.000111324785,0.00053497613,0.000002536238],"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.00017448046,0.00009791766,0.0011868732,0.000005325046,0.00002542586,0.000007260331,0.00020578729,0.00016577305,0.00085080735,0.9747347,0.000022900324,0.022522725],"study_design_scores_gemma":[0.00080756535,0.00045682982,0.0014201058,0.000063984226,0.000007855809,0.0003208346,0.000104531944,0.00016036342,0.00083515747,0.9954955,0.00020928287,0.000117986245],"about_ca_topic_score_codex":0.0000030035087,"about_ca_topic_score_gemma":0.000008393503,"teacher_disagreement_score":0.25327072,"about_ca_system_score_codex":0.000079797006,"about_ca_system_score_gemma":0.0001929713,"threshold_uncertainty_score":0.45815933},"labels":[],"label_agreement":null},{"id":"W2766975978","doi":"10.5614/ejgta.2017.5.2.14","title":"On the nullity number of graphs","year":2017,"lang":"en","type":"article","venue":"Electronic Journal of Graph Theory and Applications","topic":"Graph theory and applications","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Clique number; Upper and lower bounds; Graph; Clique; Discrete mathematics","score_opus":0.0180531121251337,"score_gpt":0.31699401568668,"score_spread":0.2989409035615463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766975978","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96838397,0.0003254293,0.01984709,0.0012734327,0.000028525443,0.00041498768,0.000015929132,0.000014706521,0.009695944],"genre_scores_gemma":[0.99913424,0.00033121087,0.00018166193,0.00007248164,0.000044369717,0.00006235177,6.10403e-7,0.000012231345,0.00016086076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988889,0.00020409268,0.00039072864,0.00012462137,0.0001618856,0.00022973516],"domain_scores_gemma":[0.9965662,0.0016322786,0.000842998,0.000759047,0.00013960685,0.00005989378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028814112,0.00012369308,0.00022274637,0.00006527611,0.00084108295,0.000040155486,0.00067088194,0.00005583316,0.00009150706],"category_scores_gemma":[0.0003051942,0.00007951081,0.00020205288,0.00013533061,0.0005711947,0.00010124268,0.00003876692,0.0004207258,0.0000057677125],"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.000100203884,0.0001787663,0.00022274282,0.000011898173,0.00010843526,1.7801433e-7,0.000093425915,4.9340514e-7,0.00052052684,0.99669284,0.00020700782,0.0018635016],"study_design_scores_gemma":[0.00023270182,0.00006384968,0.0008037505,0.000026469887,0.00009932742,0.00004674947,0.0002080636,7.983468e-7,0.0019533744,0.994598,0.0018886891,0.00007826805],"about_ca_topic_score_codex":0.0000013419678,"about_ca_topic_score_gemma":0.0000034093482,"teacher_disagreement_score":0.030750265,"about_ca_system_score_codex":0.000011893049,"about_ca_system_score_gemma":0.00005908919,"threshold_uncertainty_score":0.6469015},"labels":[],"label_agreement":null},{"id":"W2980714832","doi":"10.5614/ejgta.2019.7.2.10","title":"Exponent-critical primitive graphs and the Kronecker product","year":2019,"lang":"en","type":"article","venue":"Electronic Journal of Graph Theory and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Memorial University of Newfoundland","keywords":"Exponent; Mathematics; Combinatorics; Critical exponent; Kronecker product; Kronecker delta; Graph; Discrete mathematics; Product (mathematics); Physics; Geometry","score_opus":0.00595558774374082,"score_gpt":0.267807855989703,"score_spread":0.2618522682459622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980714832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21300757,0.02523292,0.75354046,0.0051397863,0.00009867045,0.0011922357,0.0000031713903,0.000040198553,0.0017450122],"genre_scores_gemma":[0.9968751,0.0017103005,0.0010388263,0.00014420437,0.00003589487,0.000051203413,3.6376596e-7,0.000008532608,0.00013555422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831486,0.00048966514,0.00027216517,0.00026851625,0.0002437839,0.00041102662],"domain_scores_gemma":[0.9977789,0.0013848954,0.00014196677,0.00041920485,0.00017390914,0.00010112928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032147765,0.00012424789,0.0002117367,0.00018080464,0.00026873188,0.0000849462,0.0006103104,0.00003108082,0.000011600816],"category_scores_gemma":[0.00013152201,0.00007934408,0.00009820832,0.00048656366,0.0007843368,0.00042621486,0.00013065887,0.00057606894,0.0000076825],"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.00017694672,0.000045325116,0.00010455397,0.000007649921,0.000053179436,7.348039e-7,0.0003197435,0.0000035962796,0.0013443452,0.97955346,0.000008243831,0.01838225],"study_design_scores_gemma":[0.0007835881,0.0001537414,0.00041864027,0.000013624746,0.000022711398,0.00023872519,0.00024987114,0.000041141542,0.0009254249,0.9950133,0.0020427448,0.00009649386],"about_ca_topic_score_codex":5.1351356e-7,"about_ca_topic_score_gemma":6.588891e-7,"teacher_disagreement_score":0.78386754,"about_ca_system_score_codex":0.00001994277,"about_ca_system_score_gemma":0.000110934205,"threshold_uncertainty_score":0.32355574},"labels":[],"label_agreement":null},{"id":"W3205515510","doi":"10.5614/ejgta.2022.10.2.19","title":"Eternal domination and clique covering","year":2022,"lang":"en","type":"article","venue":"Electronic Journal of Graph Theory and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Circulant matrix; Split graph; Discrete mathematics; Vertex (graph theory); Domination analysis; Dominating set; Circulant graph; Clique number; Chordal graph; Clique; Graph; Line graph; 1-planar graph; Graph power","score_opus":0.00545523863843947,"score_gpt":0.26256846333263,"score_spread":0.2571132246941905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205515510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10896662,0.0029193563,0.887362,0.00035240751,0.000022904627,0.0001389739,0.000001899345,0.000014121118,0.00022172871],"genre_scores_gemma":[0.99793696,0.0006970266,0.001087803,0.00009903868,0.000035163666,0.000054071774,5.106041e-7,0.0000058113174,0.00008361284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892616,0.00029789243,0.0001941394,0.00014691055,0.0001982929,0.00023661718],"domain_scores_gemma":[0.9992065,0.00032582908,0.00017169282,0.00016603728,0.000061669685,0.00006829932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024183653,0.00006935213,0.00010404816,0.0002231814,0.00045540222,0.000047940608,0.00043375252,0.000015591106,0.000010598371],"category_scores_gemma":[0.00002405423,0.00006610257,0.000046472775,0.00038080517,0.00009514912,0.00030862988,0.00018479642,0.00048597733,4.4624196e-7],"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.000053661126,0.000029449864,0.00008574451,0.0000033216722,0.000021843947,0.0000016979519,0.00015441062,0.00010791337,0.0029146178,0.95720625,0.000005801005,0.039415278],"study_design_scores_gemma":[0.0003126743,0.00024768166,0.00028190835,0.0000032019573,0.000007369515,0.00049866724,0.00014590523,0.00017689625,0.0007928534,0.9903386,0.0071238107,0.00007042651],"about_ca_topic_score_codex":5.603789e-7,"about_ca_topic_score_gemma":8.0634715e-7,"teacher_disagreement_score":0.8889704,"about_ca_system_score_codex":0.000053735585,"about_ca_system_score_gemma":0.000093157585,"threshold_uncertainty_score":0.35026315},"labels":[],"label_agreement":null},{"id":"W4415764895","doi":"10.5614/ejgta.2025.13.2.1","title":"Maximum boundary independent broadcasts in graphs and trees","year":2025,"lang":"en","type":"article","venue":"Electronic Journal of Graph Theory and Applications","topic":"Advanced Graph Theory Research","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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bounded function; Boundary (topology); Graph; Upper and lower bounds; Connectivity; Tree (set theory); Order (exchange)","score_opus":0.0056193732299541655,"score_gpt":0.2739667729574518,"score_spread":0.26834739972749766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415764895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2209817,0.023880765,0.75275815,0.0008886265,0.000043193893,0.00033433503,0.0000018378062,0.000029220373,0.0010821731],"genre_scores_gemma":[0.9960905,0.0028506336,0.0007339188,0.0001264426,0.000011426953,0.000037630452,4.332595e-7,0.000005490504,0.00014357384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986494,0.00024431394,0.00031747855,0.00023587613,0.00016914627,0.000383783],"domain_scores_gemma":[0.99904484,0.00038130605,0.00012916344,0.00028141707,0.00008052612,0.0000827751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019587697,0.00011839591,0.00019177917,0.00073422404,0.0002141505,0.000093438015,0.0005671934,0.000053844815,0.0000033831923],"category_scores_gemma":[0.00003476469,0.00010453014,0.00006486699,0.0010678496,0.0002696037,0.00037211762,0.00013820254,0.000570755,7.7415467e-7],"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.00006500817,0.00006599723,0.0009839328,0.000008278776,0.000037198777,0.000003284962,0.00011679164,0.0000117878335,0.0009024687,0.8992859,0.000011693932,0.09850764],"study_design_scores_gemma":[0.0005322026,0.000115285715,0.004994455,0.000028860008,0.00001002963,0.00010876292,0.00014544101,0.000031357806,0.00047103578,0.9900937,0.003381889,0.00008698463],"about_ca_topic_score_codex":0.000001845442,"about_ca_topic_score_gemma":0.000033047345,"teacher_disagreement_score":0.77510875,"about_ca_system_score_codex":0.000045640634,"about_ca_system_score_gemma":0.00022374529,"threshold_uncertainty_score":0.42626154},"labels":[],"label_agreement":null},{"id":"W4415764896","doi":"10.5614/ejgta.2025.13.2.8","title":"Perfect coalition in graphs","year":2025,"lang":"en","type":"article","venue":"Electronic Journal of Graph Theory and Applications","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Disjoint sets; Perfect graph theorem; Trivially perfect graph; Vertex (graph theory); Dominating set; Perfect graph; Partition (number theory); Perfect power","score_opus":0.005659939029547717,"score_gpt":0.28493499668852657,"score_spread":0.27927505765897886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415764896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040396485,0.0051064715,0.95217013,0.00059098017,0.000028220662,0.00020932322,8.4198206e-7,0.000019902282,0.001477627],"genre_scores_gemma":[0.99768937,0.0012462288,0.0007369933,0.00013221425,0.000014412635,0.00004513904,5.7513415e-7,0.0000039159627,0.00013117219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877113,0.00032588674,0.00027914782,0.00017158427,0.00012847317,0.0003237519],"domain_scores_gemma":[0.9990004,0.00047554623,0.000113278715,0.00026296257,0.00009681605,0.000051006286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024673701,0.00008726022,0.00015082436,0.0006547119,0.00014882551,0.00004309829,0.0005563728,0.00004064781,0.000004363823],"category_scores_gemma":[0.00004922556,0.00007734072,0.000080860955,0.0013697175,0.00013995236,0.00031845373,0.000062353014,0.00045048373,0.0000015175522],"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.000045712815,0.00006165058,0.00035551464,0.000007775713,0.000024255918,0.0000011928839,0.00006058941,0.000028032819,0.0012166585,0.9713427,0.000018965116,0.026836963],"study_design_scores_gemma":[0.00036756197,0.000096542295,0.0010111637,0.000025243324,0.000007863125,0.000040557385,0.00009421812,0.000050711835,0.0010836133,0.9942147,0.002942869,0.000064919645],"about_ca_topic_score_codex":0.0000010678328,"about_ca_topic_score_gemma":0.00000704198,"teacher_disagreement_score":0.95729285,"about_ca_system_score_codex":0.00005104658,"about_ca_system_score_gemma":0.00017783337,"threshold_uncertainty_score":0.31538633},"labels":[],"label_agreement":null}]}