{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002881411,0.0001236931,0.0002227464,0.00006527611,0.0008410829,0.00004015549,0.0006708819,0.00005583316,0.00009150706],"category_scores_gemma":[0.0003051942,0.00007951081,0.0002020529,0.0001353306,0.0005711947,0.0001012427,0.00003876692,0.0004207258,0.000005767713],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001189305,"about_ca_system_score_gemma":0.00005908919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001341968,"about_ca_topic_score_gemma":0.000003409348,"domain_scores_codex":[0.9988889,0.0002040927,0.0003907286,0.0001246214,0.0001618856,0.0002297352],"domain_scores_gemma":[0.9965662,0.001632279,0.000842998,0.000759047,0.0001396069,0.00005989378],"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.0001002039,0.0001787663,0.0002227428,0.00001189817,0.0001084353,1.780143e-7,0.00009342592,4.934051e-7,0.0005205268,0.9966928,0.0002070078,0.001863502],"study_design_scores_gemma":[0.0002327018,0.00006384968,0.0008037505,0.00002646989,0.00009932742,0.00004674947,0.0002080636,7.983468e-7,0.001953374,0.994598,0.001888689,0.00007826805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.968384,0.0003254293,0.01984709,0.001273433,0.00002852544,0.0004149877,0.00001592913,0.00001470652,0.009695944],"genre_scores_gemma":[0.9991342,0.0003312109,0.0001816619,0.00007248164,0.00004436972,0.00006235177,6.10403e-7,0.00001223134,0.0001608608],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03075027,"threshold_uncertainty_score":0.6469015,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00207288,0.0001365578,0.0002015034,0.0004800729,0.000160826,0.0001040201,0.0004697162,0.00004398986,0.000002273129],"category_scores_gemma":[0.0001213155,0.0001123523,0.00005057785,0.0005794274,0.0002320124,0.0004695039,0.0001113248,0.0005349761,0.000002536238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007979701,"about_ca_system_score_gemma":0.0001929713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003003509,"about_ca_topic_score_gemma":0.000008393503,"domain_scores_codex":[0.9984559,0.0002716628,0.0003052067,0.0002390049,0.000296097,0.0004320726],"domain_scores_gemma":[0.9987997,0.0004432268,0.00017954,0.0002665014,0.0001082849,0.0002027399],"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.0001744805,0.00009791766,0.001186873,0.000005325046,0.00002542586,0.000007260331,0.0002057873,0.000165773,0.0008508074,0.9747347,0.00002290032,0.02252273],"study_design_scores_gemma":[0.0008075653,0.0004568298,0.001420106,0.00006398423,0.000007855809,0.0003208346,0.0001045319,0.0001603634,0.0008351575,0.9954955,0.0002092829,0.0001179862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7448267,0.008062612,0.2461275,0.0003795705,0.00003987415,0.0002516441,0.000001680466,0.00001866025,0.000291716],"genre_scores_gemma":[0.9980975,0.0006945953,0.0009814397,0.00009824447,0.00005027293,0.00002083784,5.457428e-7,0.00001020845,0.00004638248],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2532707,"threshold_uncertainty_score":0.4581593,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00246737,0.00008726022,0.0001508244,0.0006547119,0.0001488255,0.00004309829,0.0005563728,0.00004064781,0.000004363823],"category_scores_gemma":[0.00004922556,0.00007734072,0.00008086095,0.001369718,0.0001399524,0.0003184537,0.00006235301,0.0004504837,0.000001517552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005104658,"about_ca_system_score_gemma":0.0001778334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001067833,"about_ca_topic_score_gemma":0.00000704198,"domain_scores_codex":[0.9987711,0.0003258867,0.0002791478,0.0001715843,0.0001284732,0.0003237519],"domain_scores_gemma":[0.9990004,0.0004755462,0.0001132787,0.0002629626,0.00009681605,0.00005100629],"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.00004571282,0.00006165058,0.0003555146,0.000007775713,0.00002425592,0.000001192884,0.00006058941,0.00002803282,0.001216659,0.9713427,0.00001896512,0.02683696],"study_design_scores_gemma":[0.000367562,0.0000965423,0.001011164,0.00002524332,0.000007863125,0.00004055738,0.00009421812,0.00005071183,0.001083613,0.9942147,0.002942869,0.00006491964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04039649,0.005106471,0.9521701,0.0005909802,0.00002822066,0.0002093232,8.419821e-7,0.00001990228,0.001477627],"genre_scores_gemma":[0.9976894,0.001246229,0.0007369933,0.0001322142,0.00001441264,0.00004513904,5.751342e-7,0.000003915963,0.0001311722],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9572929,"threshold_uncertainty_score":0.3153863,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002418365,0.00006935213,0.0001040482,0.0002231814,0.0004554022,0.00004794061,0.0004337525,0.00001559111,0.00001059837],"category_scores_gemma":[0.00002405423,0.00006610257,0.00004647277,0.0003808052,0.00009514912,0.0003086299,0.0001847964,0.0004859773,4.46242e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005373558,"about_ca_system_score_gemma":0.00009315759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.603789e-7,"about_ca_topic_score_gemma":8.063471e-7,"domain_scores_codex":[0.9989262,0.0002978924,0.0001941394,0.0001469105,0.0001982929,0.0002366172],"domain_scores_gemma":[0.9992065,0.0003258291,0.0001716928,0.0001660373,0.00006166969,0.00006829932],"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.00005366113,0.00002944986,0.00008574451,0.000003321672,0.00002184395,0.000001697952,0.0001544106,0.0001079134,0.002914618,0.9572062,0.000005801005,0.03941528],"study_design_scores_gemma":[0.0003126743,0.0002476817,0.0002819083,0.000003201957,0.000007369515,0.0004986672,0.0001459052,0.0001768963,0.0007928534,0.9903386,0.007123811,0.00007042651],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1089666,0.002919356,0.887362,0.0003524075,0.00002290463,0.0001389739,0.000001899345,0.00001412112,0.0002217287],"genre_scores_gemma":[0.997937,0.0006970266,0.001087803,0.00009903868,0.00003516367,0.00005407177,5.106041e-7,0.000005811317,0.00008361284],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8889704,"threshold_uncertainty_score":0.3502631,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00195877,0.0001183959,0.0001917792,0.000734224,0.0002141505,0.00009343802,0.0005671934,0.00005384481,0.000003383192],"category_scores_gemma":[0.00003476469,0.0001045301,0.00006486699,0.00106785,0.0002696037,0.0003721176,0.0001382025,0.000570755,7.741547e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004564063,"about_ca_system_score_gemma":0.0002237453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001845442,"about_ca_topic_score_gemma":0.00003304734,"domain_scores_codex":[0.9986494,0.0002443139,0.0003174786,0.0002358761,0.0001691463,0.000383783],"domain_scores_gemma":[0.9990448,0.000381306,0.0001291634,0.0002814171,0.00008052612,0.0000827751],"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.00006500817,0.00006599723,0.0009839328,0.000008278776,0.00003719878,0.000003284962,0.0001167916,0.00001178783,0.0009024687,0.8992859,0.00001169393,0.09850764],"study_design_scores_gemma":[0.0005322026,0.0001152857,0.004994455,0.00002886001,0.00001002963,0.0001087629,0.000145441,0.00003135781,0.0004710358,0.9900937,0.003381889,0.00008698463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2209817,0.02388076,0.7527581,0.0008886265,0.00004319389,0.000334335,0.000001837806,0.00002922037,0.001082173],"genre_scores_gemma":[0.9960905,0.002850634,0.0007339188,0.0001264426,0.00001142695,0.00003763045,4.332595e-7,0.000005490504,0.0001435738],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7751088,"threshold_uncertainty_score":0.4262615,"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003214777,0.0001242479,0.0002117367,0.0001808046,0.0002687319,0.0000849462,0.0006103104,0.00003108082,0.00001160082],"category_scores_gemma":[0.000131522,0.00007934408,0.00009820832,0.0004865637,0.0007843368,0.0004262149,0.0001306589,0.0005760689,0.0000076825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001994277,"about_ca_system_score_gemma":0.0001109342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.135136e-7,"about_ca_topic_score_gemma":6.588891e-7,"domain_scores_codex":[0.9983149,0.0004896651,0.0002721652,0.0002685162,0.0002437839,0.0004110266],"domain_scores_gemma":[0.9977789,0.001384895,0.0001419668,0.0004192049,0.0001739091,0.0001011293],"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.0001769467,0.00004532512,0.000104554,0.000007649921,0.00005317944,7.348039e-7,0.0003197435,0.00000359628,0.001344345,0.9795535,0.000008243831,0.01838225],"study_design_scores_gemma":[0.0007835881,0.0001537414,0.0004186403,0.00001362475,0.0000227114,0.0002387252,0.0002498711,0.00004114154,0.0009254249,0.9950133,0.002042745,0.00009649386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2130076,0.02523292,0.7535405,0.005139786,0.00009867045,0.001192236,0.00000317139,0.00004019855,0.001745012],"genre_scores_gemma":[0.9968751,0.0017103,0.001038826,0.0001442044,0.00003589487,0.00005120341,3.63766e-7,0.000008532608,0.0001355542],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7838675,"threshold_uncertainty_score":0.3235557,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}