{"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":"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.61182463,0.00135561,0.32049674,0.0018294079,0.00024662525,0.00016752156,0.0012311805,0.00041227066,0.06243606],"genre_scores_gemma":[0.94279647,0.00075455866,0.041672196,0.00031638728,0.00036046107,0.00030159496,0.001180666,0.0002471287,0.012370554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951622,0.0013140036,0.0003412074,0.0010184314,0.0010949137,0.0010694],"domain_scores_gemma":[0.9765817,0.014283175,0.0029403265,0.0015219244,0.0017724711,0.0029003602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035617864,0.0016622087,0.0013692459,0.0033224989,0.0022699675,0.0047600134,0.0024404572,0.0016408743,0.0099659115],"category_scores_gemma":[0.024031404,0.00059249165,0.0010226303,0.0037651528,0.006180052,0.009685421,0.0034746428,0.0031113029,0.0011231322],"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.00025767295,0.0000898774,0.004515249,0.00014240532,0.000050316026,0.00017682955,0.0005840528,0.01757191,0.0017641191,0.94259924,0.002369879,0.029878482],"study_design_scores_gemma":[0.000032602908,0.00014976485,0.0023311295,0.000059908307,0.00003787616,0.00019514808,0.0002711149,0.04678629,0.00092030043,0.946114,0.0030590848,0.000042849053],"about_ca_topic_score_codex":0.001861023,"about_ca_topic_score_gemma":0.0022473212,"teacher_disagreement_score":0.0099659115,"about_ca_system_score_codex":0.0025226623,"about_ca_system_score_gemma":0.0010114546,"threshold_uncertainty_score":0.03333932},"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":"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.47834903,0.005572501,0.39323288,0.0068023964,0.0005516905,0.000118707474,0.0010591338,0.00038418607,0.11392951],"genre_scores_gemma":[0.9506398,0.0022935218,0.03785089,0.0005923814,0.0005459395,0.00015932642,0.0005380786,0.0002716532,0.0071084383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99595,0.0013088674,0.00021494816,0.00093629013,0.000968967,0.00062096975],"domain_scores_gemma":[0.9514133,0.03668545,0.0027767743,0.0035521719,0.0026380816,0.002934229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044162394,0.0010057181,0.0013210594,0.0037228807,0.0025659085,0.0029526523,0.0023758328,0.0015152235,0.0051213377],"category_scores_gemma":[0.02669779,0.0008434107,0.001371737,0.0019262615,0.0070349043,0.009800808,0.004484598,0.003983912,0.0006510786],"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.00026770154,0.000048495596,0.0023145764,0.00019031862,0.000040000723,0.00015638038,0.00034158048,0.008623858,0.0039860075,0.9723929,0.0019216131,0.009716628],"study_design_scores_gemma":[0.00002293107,0.00006203654,0.0007765983,0.00005206766,0.000031793432,0.00022899808,0.00009424081,0.028016005,0.0024270376,0.9646355,0.0036214055,0.00003147158],"about_ca_topic_score_codex":0.00046801678,"about_ca_topic_score_gemma":0.00046166684,"teacher_disagreement_score":0.0051213377,"about_ca_system_score_codex":0.001750511,"about_ca_system_score_gemma":0.000577009,"threshold_uncertainty_score":0.023355603},"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":"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.810492,0.00048820398,0.16163488,0.00048712105,0.00009226512,0.00005270878,0.00019518597,0.0001514331,0.0264061],"genre_scores_gemma":[0.9807433,0.0002166279,0.015979066,0.00007377123,0.00007615618,0.000025038431,0.00009482843,0.0000344722,0.002756862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953485,0.00011209064,0.00003551905,0.00012825908,0.0001022678,0.00008705634],"domain_scores_gemma":[0.9955446,0.002210898,0.00066032493,0.00042754444,0.00059371465,0.0005629074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008455052,0.00033114286,0.00037291078,0.0013712295,0.0006875556,0.001349334,0.00042819456,0.0004937483,0.0026285844],"category_scores_gemma":[0.0047005913,0.0003373012,0.0003605304,0.0005701407,0.002342721,0.0031018357,0.0012325646,0.0012161158,0.0003329631],"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.00007498735,0.000022727721,0.0011800858,0.000038900293,0.000006866238,0.0003637271,0.0002820864,0.0024864664,0.0047064065,0.9864662,0.0004476933,0.003923876],"study_design_scores_gemma":[0.000019618248,0.000061274746,0.00077724137,0.000021579704,0.000011556359,0.00045097925,0.00015016229,0.014304106,0.0029167715,0.9788643,0.0024028465,0.000019519692],"about_ca_topic_score_codex":0.0003009338,"about_ca_topic_score_gemma":0.00035657067,"teacher_disagreement_score":0.0026285844,"about_ca_system_score_codex":0.000494956,"about_ca_system_score_gemma":0.0003421667,"threshold_uncertainty_score":0.008793533},"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":"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.8671671,0.00027686905,0.113890536,0.00023060408,0.000012686116,0.00002293768,0.0002064978,0.000110196655,0.018082432],"genre_scores_gemma":[0.9886579,0.000090823356,0.009864953,0.000018450055,0.000011917591,0.000015984866,0.00010891873,0.0000165407,0.0012145063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945825,0.00012512304,0.000016404732,0.00014501727,0.00014787001,0.00010728818],"domain_scores_gemma":[0.99423826,0.0036693225,0.000862754,0.0005791146,0.00033641583,0.0003142514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059651124,0.0002305454,0.00029855306,0.0014029894,0.0006544022,0.00080017885,0.0006816952,0.00024875774,0.0026651642],"category_scores_gemma":[0.0061519365,0.00016141986,0.00032223645,0.00090365816,0.0013830358,0.0016100208,0.00073258154,0.00048670612,0.00011826615],"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.00037196826,0.00010884293,0.03047504,0.0001567791,0.000081678336,0.00040051824,0.0006284167,0.13800474,0.026394458,0.7624129,0.0015761977,0.039388392],"study_design_scores_gemma":[0.000041837633,0.00012469845,0.016704522,0.000032111602,0.000046238725,0.0008440629,0.0002599609,0.45893222,0.015072104,0.5006556,0.007240169,0.00004654013],"about_ca_topic_score_codex":0.0015481624,"about_ca_topic_score_gemma":0.0017317836,"teacher_disagreement_score":0.0026651642,"about_ca_system_score_codex":0.0006812198,"about_ca_system_score_gemma":0.00025002842,"threshold_uncertainty_score":0.008915842},"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":"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.2936815,0.0024260913,0.6755324,0.001936025,0.000106645704,0.00034235566,0.001783048,0.001985071,0.022206906],"genre_scores_gemma":[0.76056963,0.0014341248,0.22710964,0.00030878227,0.00022480343,0.00039940406,0.0023523355,0.0004440443,0.007157278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985857,0.0003854565,0.00007252038,0.00030026454,0.00033338633,0.00032270045],"domain_scores_gemma":[0.9892412,0.007802361,0.0010148984,0.0009545596,0.00048112866,0.0005058898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013548648,0.00082137214,0.0012377393,0.0014160601,0.0016561616,0.0021812806,0.0019696231,0.0012425717,0.0032784613],"category_scores_gemma":[0.01166936,0.0010741876,0.0009824065,0.002450938,0.0012961229,0.005189147,0.0020136186,0.0017704589,0.00076159684],"study_design_candidate":"theoretical_or_conceptual","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.0022768734,0.00039825976,0.005552018,0.0015168737,0.0002554758,0.00055200484,0.0020322832,0.4926868,0.049283255,0.23279296,0.029518869,0.18313429],"study_design_scores_gemma":[0.00021068656,0.00016740129,0.0021500594,0.00012517133,0.000107364496,0.00046334046,0.00048592157,0.64941263,0.015854444,0.32156128,0.009414429,0.00004723621],"about_ca_topic_score_codex":0.0031146975,"about_ca_topic_score_gemma":0.004561454,"teacher_disagreement_score":0.0032784613,"about_ca_system_score_codex":0.0021967127,"about_ca_system_score_gemma":0.0009696997,"threshold_uncertainty_score":0.015938342},"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":"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.081228256,0.011388225,0.7860597,0.0043215323,0.0007148303,0.0004862438,0.002219584,0.0010749504,0.11250663],"genre_scores_gemma":[0.755103,0.009011596,0.20728523,0.0015177367,0.0009305678,0.0006336493,0.0022831366,0.00026954248,0.022965612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731654,0.00081765314,0.00020015545,0.0006984003,0.0006013311,0.00036580337],"domain_scores_gemma":[0.9949662,0.0027685983,0.00061378366,0.0007521544,0.0004576654,0.00044150863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001839686,0.0012324901,0.0014022011,0.0026687153,0.0029098806,0.004477206,0.0017318586,0.0015827842,0.004925487],"category_scores_gemma":[0.008665362,0.0007988575,0.0010330796,0.004599078,0.004648416,0.0072263367,0.0037788134,0.0025798094,0.0012919325],"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.000038900624,0.000017096218,0.0003409381,0.00017395918,0.000025169938,0.00011329741,0.00034803897,0.00907463,0.00046856373,0.9705345,0.0044013015,0.01446365],"study_design_scores_gemma":[0.00001423664,0.000019771687,0.00015867928,0.000042778833,0.000018901068,0.00022592954,0.00013151485,0.014648476,0.00032675566,0.9623799,0.022020768,0.00001244389],"about_ca_topic_score_codex":0.0030752923,"about_ca_topic_score_gemma":0.0028294644,"teacher_disagreement_score":0.004925487,"about_ca_system_score_codex":0.003193656,"about_ca_system_score_gemma":0.0016153291,"threshold_uncertainty_score":0.023171723},"labels":[],"label_agreement":null}]}