{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":7,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":7,"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":"48dc3f2ed2a8","filters":{"venue":"Open Journal of Discrete Mathematics"}},"results":[{"id":"W1980709314","doi":"10.4236/ojdm.2013.33029","title":"Multiple Circular Colouring as a Model for Scheduling","year":2013,"lang":"en","type":"article","venue":"Open Journal of Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Trent University","funders":"","keywords":"Chromatic scale; Mathematics; Scheduling (production processes); Graph; Combinatorics; Computer science; Mathematical optimization; Discrete mathematics","authors":[{"name":"Bing Zhou","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05818876496794161,"gpt":0.3432924704403453,"spread":0.2851037054724037,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001242736,0.0001376682,0.0003414078,0.0001295929,0.0001781221,0.0007155276,0.002686758,0.00004531989,0.00002184985],"category_scores_gemma":[0.0007675642,0.0001074788,0.000159142,0.000199506,0.00004956087,0.001786823,0.0006509944,0.000215789,0.00003341454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004605939,"about_ca_system_score_gemma":0.0001567595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002622158,"about_ca_topic_score_gemma":7.34506e-7,"domain_scores_codex":[0.9984917,0.00004655823,0.0005545208,0.0001691695,0.0004057702,0.0003322704],"domain_scores_gemma":[0.997992,0.0004108718,0.0004635932,0.0004723376,0.000461335,0.0001998081],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008477348,0.0005120751,0.0001905793,0.0005801449,0.0003879638,0.0000587847,0.01143287,0.1921795,0.03726266,0.7449977,0.0004743985,0.01183854],"study_design_scores_gemma":[0.000491701,0.00008369317,0.000003583154,0.0001025954,0.00000710018,0.00006353793,0.000276457,0.6133419,0.001737644,0.3837745,0.00002806181,0.00008927665],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0632658,0.00006892408,0.9346179,0.0005601641,0.0000559187,0.0006938096,0.000001673433,0.0000119805,0.0007238353],"genre_scores_gemma":[0.4080369,0.000007052508,0.5915958,0.00005187258,0.00002087697,0.00002855717,2.155408e-7,0.00001520215,0.0002435824],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4211624,"threshold_uncertainty_score":0.689985,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059355032","doi":"10.4236/ojdm.2012.24032","title":"A Note on Hamiltonian Circulant Digraphs of Outdegree Three","year":2012,"lang":"en","type":"article","venue":"Open Journal of Discrete Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Circulant matrix; Mathematics; Combinatorics; Connection (principal bundle); Integer (computer science); Hamiltonian (control theory); Discrete mathematics; Computer science; Mathematical optimization","authors":[{"name":"Grant Andruchuk","is_ca":true},{"name":"Shonda Gosselin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04059337117785439,"gpt":0.2966661493289207,"spread":0.2560727781510663,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001587397,0.0001588821,0.0004164457,0.0001954291,0.00008677034,0.000170611,0.002193062,0.00004896934,0.00003100057],"category_scores_gemma":[0.0001002872,0.0001113918,0.0002710564,0.0003519457,0.00007282223,0.0007485397,0.0003645604,0.0002064401,0.00001435427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001605058,"about_ca_system_score_gemma":0.00004907486,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002773115,"about_ca_topic_score_gemma":0.000003800825,"domain_scores_codex":[0.9985049,0.00007216573,0.0005934099,0.0001079458,0.0004503709,0.0002712514],"domain_scores_gemma":[0.9981132,0.0002263267,0.0007435863,0.0006248571,0.0001123202,0.000179738],"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.00005122624,0.0005517601,0.002668298,0.0001032743,0.0001684435,0.00001963163,0.007619909,0.00003314401,0.00147137,0.9702021,0.0004065929,0.01670419],"study_design_scores_gemma":[0.002832208,0.002361328,0.01718411,0.002582353,0.0002976153,0.0008600912,0.001074026,0.005225234,0.01135793,0.950568,0.004614346,0.001042801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1689521,0.0002347081,0.8071416,0.0007280834,0.0006128794,0.0003146055,0.000008698865,0.00002113038,0.02198617],"genre_scores_gemma":[0.8856677,0.00001725932,0.1141279,0.00008798687,0.00006161501,0.000001881961,2.389005e-7,0.00001161939,0.00002387133],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7167156,"threshold_uncertainty_score":0.4542427,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064603234","doi":"10.4236/ojdm.2013.31002","title":"Counting Types of Runs in Classes of Arborescent Words","year":2013,"lang":"en","type":"article","venue":"Open Journal of Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Alphabet; Combinatorics; Word (group theory); Context (archaeology); Type (biology); Root (linguistics); Tree (set theory); Point (geometry); Set (abstract data type); Computer science; Geometry; Biology; Linguistics","authors":[{"name":"Jean‐Philippe Labbé","is_ca":false},{"name":"Gilbert Labelle","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01700377759767581,"gpt":0.2718911566169423,"spread":0.2548873790192665,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008758828,0.00008993236,0.0004009141,0.000110525,0.00001799083,0.0001308642,0.001448488,0.00003180972,0.00006735649],"category_scores_gemma":[0.000133286,0.00006336476,0.00007160869,0.0002162435,0.00004977701,0.0007056844,0.0003458219,0.0001145116,0.000005323042],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001349428,"about_ca_system_score_gemma":0.00007996259,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003040014,"about_ca_topic_score_gemma":0.000005744505,"domain_scores_codex":[0.9986789,0.00003968642,0.000770577,0.00007707423,0.0002965439,0.0001372384],"domain_scores_gemma":[0.9983921,0.0001916532,0.0009125042,0.0002921539,0.0001647395,0.00004686652],"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.00005757911,0.00167412,0.0101998,0.001580531,0.0003668068,0.00006721201,0.02447677,0.0008732325,0.05354236,0.8630444,0.002403833,0.04171329],"study_design_scores_gemma":[0.00424546,0.001726641,0.03121255,0.0111141,0.0001596981,0.000330362,0.01356112,0.2234654,0.1131513,0.598821,0.001085363,0.001127039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.919215,0.0003202738,0.07028633,0.0005921844,0.0001908375,0.0002966383,0.000003079557,0.000007493237,0.009088211],"genre_scores_gemma":[0.8736917,0.00003448068,0.1261777,0.0000259458,0.00001794175,0.000001370881,1.622753e-7,0.000007040963,0.00004369656],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2642234,"threshold_uncertainty_score":0.2691676,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2022005952","doi":"10.4236/ojdm.2012.23016","title":"Hamiltonian Cayley Digraphs on Direct Products of Dihedral Groups","year":2012,"lang":"en","type":"article","venue":"Open Journal of Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Winnipeg","funders":"","keywords":"Dihedral group; Digraph; Dihedral angle; Mathematics; Direct product; Hamiltonian (control theory); Cayley graph; Combinatorics; Semidirect product; Hamiltonian path; Group (periodic table); Chemistry; Graph","authors":[{"name":"Grant Andruchuk","is_ca":true},{"name":"Shonda Gosselin","is_ca":true},{"name":"Yizhe Zeng","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1082443753975737,"gpt":0.378923508772303,"spread":0.2706791333747294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005171938,0.0003467697,0.001090966,0.000345504,0.0001284773,0.0001560424,0.001656228,0.0001193979,0.0002525692],"category_scores_gemma":[0.003325774,0.0002453021,0.0002912885,0.0005567542,0.0002267862,0.0008389996,0.0004593699,0.0005532927,0.00004843495],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008641421,"about_ca_system_score_gemma":0.0001300042,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005625356,"about_ca_topic_score_gemma":0.000004423529,"domain_scores_codex":[0.9962214,0.0003633882,0.001394594,0.000201374,0.001163699,0.0006555548],"domain_scores_gemma":[0.9954627,0.001367839,0.001423046,0.0009503558,0.0004608415,0.0003351958],"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.0008660222,0.005036199,0.004176434,0.003318148,0.00113773,0.0000822156,0.02823702,0.00001633706,0.01243691,0.9308543,0.01146776,0.002370982],"study_design_scores_gemma":[0.005846911,0.004410869,0.003728208,0.005403001,0.001229688,0.001044327,0.01073395,0.0002544356,0.1113663,0.8491906,0.004958231,0.001833473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9091451,0.0003312276,0.000829806,0.0005499878,0.0004682478,0.001115424,0.00005318167,0.00002641103,0.08748062],"genre_scores_gemma":[0.9440316,0.00004459201,0.05416511,0.00003231302,0.000279496,0.00001223244,0.000002931655,0.00009840453,0.001333325],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09892941,"threshold_uncertainty_score":0.9999999,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1512997342","doi":"10.4236/ojdm.2015.53004","title":"A Combinatorial Analysis of Tree-Like Sentences","year":2015,"lang":"en","type":"article","venue":"Open Journal of Discrete Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Digraph; Combinatorics; Sentence; Word (group theory); Alphabet; Mathematics; Tree (set theory); Context (archaeology); Loop (graph theory); Graph; Directed graph; Computer science; Discrete mathematics; Artificial intelligence; Linguistics","authors":[{"name":"Gilbert Labelle","is_ca":true},{"name":"Louise Laforest","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04083047348209679,"gpt":0.3303449749990993,"spread":0.2895145015170025,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009566128,0.0001311654,0.0008339587,0.0002396873,0.00003541047,0.0001218925,0.0008291858,0.00002325864,0.0002503064],"category_scores_gemma":[0.00002547122,0.00009681312,0.000425614,0.0008020223,0.00006063005,0.0002418693,0.0002225646,0.0001229645,0.00000248753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002154374,"about_ca_system_score_gemma":0.0001019415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008343432,"about_ca_topic_score_gemma":0.0000121255,"domain_scores_codex":[0.9984447,0.00007827771,0.0008184568,0.00009389934,0.0004292557,0.0001354553],"domain_scores_gemma":[0.997833,0.0001070612,0.00122201,0.000294385,0.0004076232,0.0001358989],"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.0003650133,0.003431182,0.1520856,0.00009978232,0.03540508,0.00003471412,0.01408007,0.003717145,0.0009601824,0.7333347,0.04073774,0.01574882],"study_design_scores_gemma":[0.004012227,0.001153691,0.001215618,0.0004990185,0.01758045,0.00001333465,0.02229014,0.06727955,0.003636188,0.8755477,0.005916338,0.0008557442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6720253,0.0001945902,0.2023049,0.0004070857,0.0005634709,0.0005415781,0.00006111258,0.00002100163,0.123881],"genre_scores_gemma":[0.9768281,0.000002690996,0.02285982,0.000007423063,0.000150959,0.000002439182,0.00000850093,0.00001050132,0.0001295662],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3048028,"threshold_uncertainty_score":0.3947925,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4402734443","doi":"10.4236/ojdm.2024.143004","title":"The Goldbach Conjecture Is True","year":2024,"lang":"en","type":"article","venue":"Open Journal of Discrete Mathematics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Ontario Tech University","funders":"","keywords":"Goldbach's conjecture; Mathematics; Conjecture; Combinatorics; Collatz conjecture; Discrete mathematics","authors":[{"name":"Jie Hou","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0854747755188135,"gpt":0.4140941728248309,"spread":0.3286193973060174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004607017,0.0002523774,0.0005285307,0.0001306169,0.0002778521,0.001713523,0.002207443,0.0001129454,0.0007437353],"category_scores_gemma":[0.001301167,0.0001333467,0.0003117357,0.0004089065,0.0002044378,0.000450103,0.0005025813,0.0008346349,0.0001666027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009361606,"about_ca_system_score_gemma":0.0002803254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001865874,"about_ca_topic_score_gemma":0.000004930436,"domain_scores_codex":[0.9973168,0.0002176538,0.001012895,0.0001818894,0.0008525669,0.0004181626],"domain_scores_gemma":[0.9948701,0.003640744,0.0003959434,0.0006913561,0.0002278524,0.0001739648],"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.0000642844,0.0000964456,0.000009365312,0.0005935073,0.000491079,0.0001982001,0.006981796,0.000002395257,0.0003438374,0.8956119,0.09065707,0.004950077],"study_design_scores_gemma":[0.0004145068,0.0002595414,0.000003712017,0.0008230507,0.000148739,0.0008404684,0.002739792,0.001455461,0.001344967,0.9418296,0.04994369,0.0001964338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3120914,0.01868788,0.09019295,0.07273881,0.005528548,0.006452936,0.0003742436,0.0003628189,0.4935704],"genre_scores_gemma":[0.799675,0.001039144,0.1373925,0.0004897602,0.001406827,0.00006146464,0.000005082917,0.0004714099,0.05945873],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4875837,"threshold_uncertainty_score":0.9993228,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2605695111","doi":"10.4236/ojdm.2017.72007","title":"Length of the Longest Path and Diameter in Orientations of Graphs","year":2017,"lang":"en","type":"article","venue":"Open Journal of Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Trent University","funders":"","keywords":"Mathematics; Combinatorics; Interval (graph theory); Path (computing); Property (philosophy); Interval graph; Pathwidth; Discrete mathematics; Longest path problem; Indifference graph; Graph; Chordal graph; Line graph; Computer science","authors":[{"name":"Bing Zhou","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0416074269276484,"gpt":0.3508159470323561,"spread":0.3092085201047077,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001079593,0.00007144838,0.0002603025,0.00009675173,0.0001125382,0.0001581345,0.002491005,0.00002192877,0.00000576576],"category_scores_gemma":[0.0004866792,0.00004262919,0.00007139437,0.0001563826,0.0002768294,0.000780063,0.0008525421,0.0001552922,3.460081e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008500517,"about_ca_system_score_gemma":0.00005892654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007149703,"about_ca_topic_score_gemma":0.00001392721,"domain_scores_codex":[0.9989467,0.00008680928,0.0004543336,0.00008437663,0.0003136765,0.000114157],"domain_scores_gemma":[0.9979188,0.0002344927,0.0009295637,0.0007121509,0.0001544845,0.00005050523],"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.00004229943,0.0003544084,0.04586516,0.000246138,0.0001118984,0.00002539642,0.01543789,0.00008796062,0.003494008,0.9231029,0.00007130847,0.01116069],"study_design_scores_gemma":[0.001276752,0.0003308577,0.05314863,0.0008429178,0.00002873592,0.00008104031,0.001639241,0.00250206,0.008957976,0.9310075,0.00003783112,0.0001464825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9169836,0.0001143389,0.07837102,0.0008130759,0.0001319213,0.0003575568,0.000009051295,0.00000162953,0.003217783],"genre_scores_gemma":[0.9033457,0.00005092661,0.09652741,0.000007505532,0.000004684534,0.000001851547,5.484607e-8,0.000005325672,0.00005656478],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01815639,"threshold_uncertainty_score":0.4628949,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}