{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":6,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":6,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"266c6e2f6daa","filters":{"venue":"Electronic Journal of Graph Theory and Applications"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Mustapha Aouchiche","is_ca":true},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0180531121251337,"gpt":0.31699401568668,"spread":0.2989409035615463,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004416239,0.001005718,0.001321059,0.003722881,0.002565908,0.002952652,0.002375833,0.001515224,0.005121338],"category_scores_gemma":[0.02669779,0.0008434107,0.001371737,0.001926261,0.007034904,0.009800808,0.004484598,0.003983912,0.0006510786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001750511,"about_ca_system_score_gemma":0.000577009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004680168,"about_ca_topic_score_gemma":0.0004616668,"domain_scores_codex":[0.99595,0.001308867,0.0002149482,0.0009362901,0.000968967,0.0006209697],"domain_scores_gemma":[0.9514133,0.03668545,0.002776774,0.003552172,0.002638082,0.002934229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002677015,0.0000484956,0.002314576,0.0001903186,0.00004000072,0.0001563804,0.0003415805,0.008623858,0.003986008,0.9723929,0.001921613,0.009716628],"study_design_scores_gemma":[0.00002293107,0.00006203654,0.0007765983,0.00005206766,0.00003179343,0.0002289981,0.00009424081,0.028016,0.002427038,0.9646355,0.003621405,0.00003147158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.478349,0.005572501,0.3932329,0.006802396,0.0005516905,0.0001187075,0.001059134,0.0003841861,0.1139295],"genre_scores_gemma":[0.9506398,0.002293522,0.03785089,0.0005923814,0.0005459395,0.0001593264,0.0005380786,0.0002716532,0.007108438],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005121338,"threshold_uncertainty_score":0.0233556,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"S. Pirzada","is_ca":false},{"name":"Muhammad Ali Khan","is_ca":true},{"name":"Koko K. Kayibi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01486821573934679,"gpt":0.2869802082873247,"spread":0.272111992547978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003561786,0.001662209,0.001369246,0.003322499,0.002269967,0.004760013,0.002440457,0.001640874,0.009965912],"category_scores_gemma":[0.0240314,0.0005924916,0.00102263,0.003765153,0.006180052,0.009685421,0.003474643,0.003111303,0.001123132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002522662,"about_ca_system_score_gemma":0.001011455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001861023,"about_ca_topic_score_gemma":0.002247321,"domain_scores_codex":[0.9951622,0.001314004,0.0003412074,0.001018431,0.001094914,0.0010694],"domain_scores_gemma":[0.9765817,0.01428317,0.002940326,0.001521924,0.001772471,0.00290036],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002576729,0.0000898774,0.004515249,0.0001424053,0.00005031603,0.0001768295,0.0005840528,0.01757191,0.001764119,0.9425992,0.002369879,0.02987848],"study_design_scores_gemma":[0.00003260291,0.0001497648,0.00233113,0.00005990831,0.00003787616,0.0001951481,0.0002711149,0.04678629,0.0009203004,0.946114,0.003059085,0.00004284905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6118246,0.00135561,0.3204967,0.001829408,0.0002466252,0.0001675216,0.001231181,0.0004122707,0.06243606],"genre_scores_gemma":[0.9427965,0.0007545587,0.0416722,0.0003163873,0.0003604611,0.000301595,0.001180666,0.0002471287,0.01237055],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009965912,"threshold_uncertainty_score":0.03333932,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Doost Ali Mojdeh","is_ca":false},{"name":"Mohammad Reza Samadzadeh","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005659939029547717,"gpt":0.2849349966885266,"spread":0.2792750576589789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001839686,0.00123249,0.001402201,0.002668715,0.002909881,0.004477206,0.001731859,0.001582784,0.004925487],"category_scores_gemma":[0.008665362,0.0007988575,0.00103308,0.004599078,0.004648416,0.007226337,0.003778813,0.002579809,0.001291933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003193656,"about_ca_system_score_gemma":0.001615329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003075292,"about_ca_topic_score_gemma":0.002829464,"domain_scores_codex":[0.9973165,0.0008176531,0.0002001555,0.0006984003,0.0006013311,0.0003658034],"domain_scores_gemma":[0.9949662,0.002768598,0.0006137837,0.0007521544,0.0004576654,0.0004415086],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003890062,0.00001709622,0.0003409381,0.0001739592,0.00002516994,0.0001132974,0.000348039,0.00907463,0.0004685637,0.9705345,0.004401301,0.01446365],"study_design_scores_gemma":[0.00001423664,0.00001977169,0.0001586793,0.00004277883,0.00001890107,0.0002259295,0.0001315149,0.01464848,0.0003267557,0.9623799,0.02202077,0.00001244389],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08122826,0.01138822,0.7860597,0.004321532,0.0007148303,0.0004862438,0.002219584,0.00107495,0.1125066],"genre_scores_gemma":[0.755103,0.009011596,0.2072852,0.001517737,0.0009305678,0.0006336493,0.002283137,0.0002695425,0.02296561],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004925487,"threshold_uncertainty_score":0.02317172,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Gary MacGillivray","is_ca":true},{"name":"C. M. Mynhardt","is_ca":true},{"name":"Virgélot Virgile","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00545523863843947,"gpt":0.26256846333263,"spread":0.2571132246941905,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005965112,0.0002305454,0.0002985531,0.001402989,0.0006544022,0.0008001789,0.0006816952,0.0002487577,0.002665164],"category_scores_gemma":[0.006151936,0.0001614199,0.0003222364,0.0009036582,0.001383036,0.001610021,0.0007325815,0.0004867061,0.0001182662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006812198,"about_ca_system_score_gemma":0.0002500284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001548162,"about_ca_topic_score_gemma":0.001731784,"domain_scores_codex":[0.9994583,0.000125123,0.00001640473,0.0001450173,0.00014787,0.0001072882],"domain_scores_gemma":[0.9942383,0.003669322,0.000862754,0.0005791146,0.0003364158,0.0003142514],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003719683,0.0001088429,0.03047504,0.0001567791,0.00008167834,0.0004005182,0.0006284167,0.1380047,0.02639446,0.7624129,0.001576198,0.03938839],"study_design_scores_gemma":[0.00004183763,0.0001246984,0.01670452,0.0000321116,0.00004623873,0.0008440629,0.0002599609,0.4589322,0.0150721,0.5006556,0.007240169,0.00004654013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8671671,0.000276869,0.1138905,0.0002306041,0.00001268612,0.00002293768,0.0002064978,0.0001101967,0.01808243],"genre_scores_gemma":[0.9886579,0.00009082336,0.009864953,0.00001845005,0.00001191759,0.00001598487,0.0001089187,0.0000165407,0.001214506],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002665164,"threshold_uncertainty_score":0.008915842,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","authors":[{"name":"Julia Ingrid Hoepner","is_ca":true},{"name":"Gary MacGillivray","is_ca":true},{"name":"Christina M. Mynhardt","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005619373229954166,"gpt":0.2739667729574518,"spread":0.2683473997274977,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001354865,0.0008213721,0.001237739,0.00141606,0.001656162,0.002181281,0.001969623,0.001242572,0.003278461],"category_scores_gemma":[0.01166936,0.001074188,0.0009824065,0.002450938,0.001296123,0.005189147,0.002013619,0.001770459,0.0007615968],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002196713,"about_ca_system_score_gemma":0.0009696997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003114698,"about_ca_topic_score_gemma":0.004561454,"domain_scores_codex":[0.9985857,0.0003854565,0.00007252038,0.0003002645,0.0003333863,0.0003227004],"domain_scores_gemma":[0.9892412,0.007802361,0.001014898,0.0009545596,0.0004811287,0.0005058898],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002276873,0.0003982598,0.005552018,0.001516874,0.0002554758,0.0005520048,0.002032283,0.4926868,0.04928325,0.232793,0.02951887,0.1831343],"study_design_scores_gemma":[0.0002106866,0.0001674013,0.002150059,0.0001251713,0.0001073645,0.0004633405,0.0004859216,0.6494126,0.01585444,0.3215613,0.009414429,0.00004723621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2936815,0.002426091,0.6755324,0.001936025,0.0001066457,0.0003423557,0.001783048,0.001985071,0.02220691],"genre_scores_gemma":[0.7605696,0.001434125,0.2271096,0.0003087823,0.0002248034,0.0003994041,0.002352335,0.0004440443,0.007157278],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003278461,"threshold_uncertainty_score":0.01593834,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Olga O’Mahony","is_ca":false},{"name":"Rachel Quinlan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00595558774374082,"gpt":0.267807855989703,"spread":0.2618522682459622,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008455052,0.0003311429,0.0003729108,0.00137123,0.0006875556,0.001349334,0.0004281946,0.0004937483,0.002628584],"category_scores_gemma":[0.004700591,0.0003373012,0.0003605304,0.0005701407,0.002342721,0.003101836,0.001232565,0.001216116,0.0003329631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000494956,"about_ca_system_score_gemma":0.0003421667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003009338,"about_ca_topic_score_gemma":0.0003565707,"domain_scores_codex":[0.9995348,0.0001120906,0.00003551905,0.0001282591,0.0001022678,0.00008705634],"domain_scores_gemma":[0.9955446,0.002210898,0.0006603249,0.0004275444,0.0005937146,0.0005629074],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007498735,0.00002272772,0.001180086,0.00003890029,0.000006866238,0.0003637271,0.0002820864,0.002486466,0.004706407,0.9864662,0.0004476933,0.003923876],"study_design_scores_gemma":[0.00001961825,0.00006127475,0.0007772414,0.0000215797,0.00001155636,0.0004509792,0.0001501623,0.01430411,0.002916771,0.9788643,0.002402846,0.00001951969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.810492,0.000488204,0.1616349,0.0004871211,0.00009226512,0.00005270878,0.000195186,0.0001514331,0.0264061],"genre_scores_gemma":[0.9807433,0.0002166279,0.01597907,0.00007377123,0.00007615618,0.00002503843,0.00009482843,0.0000344722,0.002756862],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002628584,"threshold_uncertainty_score":0.008793533,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}