{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009980415,0.0007500923,0.000464803,0.0005521826,0.0008293932,0.001336821,0.001898849,0.001194357,0.004491047],"category_scores_gemma":[0.0021276,0.0004597807,0.0008673316,0.000935548,0.001511118,0.002650754,0.001065001,0.001707084,0.0007116598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001890969,"about_ca_system_score_gemma":0.001474783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003394946,"about_ca_topic_score_gemma":0.002767653,"domain_scores_codex":[0.998997,0.000325116,0.00004053463,0.0002106481,0.0002728092,0.0001538618],"domain_scores_gemma":[0.9986765,0.0005543592,0.0001351931,0.0003283499,0.0001646228,0.0001408636],"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.0001316851,0.00006569831,0.0002925021,0.0001048487,0.00002258812,0.0001500235,0.000182591,0.3180414,0.005670337,0.6607438,0.002404199,0.01219033],"study_design_scores_gemma":[0.0000524191,0.00008729941,0.0001126449,0.00001894338,0.00001700041,0.0001149521,0.00004282756,0.6939809,0.001751321,0.2896323,0.0141651,0.0000243236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02117704,0.000342942,0.9648644,0.0004856245,0.0001476447,0.0000849833,0.000110439,0.0002444026,0.01254265],"genre_scores_gemma":[0.6384204,0.001021239,0.3349343,0.000496787,0.0002084886,0.0004766993,0.0003712078,0.0003468686,0.02372406],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004491047,"threshold_uncertainty_score":0.01502407,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001720424,0.0003265911,0.0002762417,0.0006710456,0.0007123917,0.0005883984,0.0005035873,0.0003783357,0.002401768],"category_scores_gemma":[0.0008286794,0.000195078,0.0003281476,0.0006324614,0.0007571927,0.0004644821,0.0007010557,0.0007073167,0.0002163561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005136058,"about_ca_system_score_gemma":0.0003498353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002050336,"about_ca_topic_score_gemma":0.003706485,"domain_scores_codex":[0.9999124,0.0000265404,0.000003856077,0.00001545159,0.0000211814,0.00002059264],"domain_scores_gemma":[0.9994965,0.0002293679,0.0000595788,0.00007188194,0.00004558896,0.00009702224],"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.00003363926,0.00003250085,0.0007472622,0.00009471325,0.00001113641,0.0004025386,0.0002754031,0.007873967,0.005738273,0.9678583,0.001665394,0.01526677],"study_design_scores_gemma":[0.00004327326,0.0000977503,0.0009296823,0.00005549237,0.0000222917,0.0003477382,0.0000917928,0.0402324,0.004566243,0.9401857,0.01339318,0.00003453015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6078622,0.001689333,0.2903078,0.001154903,0.0003029896,0.0001306618,0.0004775104,0.0004285361,0.09764605],"genre_scores_gemma":[0.9480541,0.0007614918,0.04190712,0.0003300741,0.00007984808,0.0000510578,0.0001778576,0.00005219015,0.008586201],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002401768,"threshold_uncertainty_score":0.008034706,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00201236,0.0006962293,0.001028291,0.005142787,0.002032707,0.005294856,0.002168636,0.001658316,0.006849403],"category_scores_gemma":[0.01670159,0.001029105,0.00123352,0.002748662,0.003207759,0.008827765,0.002348074,0.001502656,0.0007759173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001731353,"about_ca_system_score_gemma":0.0006245123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006798643,"about_ca_topic_score_gemma":0.0007437341,"domain_scores_codex":[0.9959874,0.0004889334,0.0006548937,0.00126125,0.0009592086,0.0006482845],"domain_scores_gemma":[0.9760477,0.01382513,0.003049849,0.002223632,0.002428979,0.00242463],"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.000864942,0.0001714751,0.03634464,0.0005447675,0.0001539448,0.001202492,0.00310289,0.008473166,0.01714616,0.8826448,0.002874157,0.04647661],"study_design_scores_gemma":[0.00006797571,0.0001468504,0.006706915,0.0001655946,0.0001225103,0.002007987,0.0009580762,0.03560708,0.008217798,0.9358035,0.01006324,0.0001323849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8308351,0.0009157058,0.1484421,0.0004261043,0.0001461977,0.000148813,0.001960583,0.0008217113,0.01630365],"genre_scores_gemma":[0.9444126,0.0004558597,0.04499343,0.0001402984,0.0002863363,0.0003191325,0.001922441,0.0003172964,0.007152685],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006849403,"threshold_uncertainty_score":0.02291358,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001271944,0.0003147673,0.0002966634,0.0007082337,0.0008973544,0.00109461,0.0004826066,0.0003590663,0.006386814],"category_scores_gemma":[0.0006755888,0.0002621373,0.0002573301,0.000616072,0.0008166532,0.001273248,0.0009657739,0.0006138661,0.0004142241],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005019339,"about_ca_system_score_gemma":0.0002489492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00102194,"about_ca_topic_score_gemma":0.002072181,"domain_scores_codex":[0.9998292,0.0000293288,0.000009834062,0.00005046555,0.00003616695,0.00004501106],"domain_scores_gemma":[0.9991614,0.0003214127,0.0001469441,0.00006934479,0.00008865172,0.0002123157],"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.00009014766,0.00005599776,0.001806501,0.0001325967,0.00003008051,0.0009182853,0.0007973923,0.004129635,0.006347403,0.9710565,0.002014544,0.01262087],"study_design_scores_gemma":[0.00006502643,0.0000974913,0.001775672,0.00003738993,0.00004747809,0.0006430672,0.0008364883,0.02297475,0.004622469,0.9532425,0.0156265,0.00003107673],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8629009,0.0004244836,0.07154016,0.0002982294,0.0001137652,0.00006898881,0.0004647156,0.0001411006,0.06404772],"genre_scores_gemma":[0.9826198,0.0002394905,0.008187556,0.000092722,0.00003127227,0.00003615917,0.000321265,0.00002022761,0.00845153],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006386814,"threshold_uncertainty_score":0.021366,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001007344,0.0004262961,0.0004138124,0.002776332,0.001299842,0.002730199,0.0008713728,0.0009498613,0.005873284],"category_scores_gemma":[0.005834302,0.0003686719,0.0008477984,0.001780344,0.002280971,0.006165529,0.001064572,0.001240783,0.0005859003],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001265506,"about_ca_system_score_gemma":0.0004392381,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008711166,"about_ca_topic_score_gemma":0.0008343431,"domain_scores_codex":[0.9992235,0.0002850363,0.00005448809,0.0001952131,0.000168842,0.0000730207],"domain_scores_gemma":[0.9964393,0.002186241,0.0004393658,0.0002422482,0.0004518427,0.0002409444],"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.000008201471,0.00000966128,0.0003339142,0.00003692139,0.000006949441,0.00008609272,0.0002876476,0.00140608,0.0007533884,0.9932167,0.000749898,0.00310453],"study_design_scores_gemma":[0.000004996694,0.00001085103,0.0004167323,0.00002420618,0.00001090216,0.000135206,0.0001311284,0.01573672,0.0002868931,0.9795252,0.003705798,0.00001134873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2905488,0.0020267,0.6242801,0.003086554,0.0002095474,0.0001503537,0.001840687,0.0004941908,0.07736306],"genre_scores_gemma":[0.8793626,0.0008368563,0.1069876,0.0006006137,0.0003974163,0.0002310007,0.001349255,0.0002002667,0.01003439],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005873284,"threshold_uncertainty_score":0.01964813,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002904929,0.0007072149,0.001097268,0.0007315131,0.002066879,0.002752546,0.0007214776,0.001768102,0.0109376],"category_scores_gemma":[0.01245245,0.0004604949,0.001174121,0.0007323278,0.004579658,0.007483595,0.002484338,0.003385493,0.002038564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001316253,"about_ca_system_score_gemma":0.001142201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000759559,"about_ca_topic_score_gemma":0.0007913923,"domain_scores_codex":[0.9975365,0.0005382819,0.0001533996,0.0007914401,0.0005313224,0.0004490187],"domain_scores_gemma":[0.9943979,0.003001818,0.0004074705,0.0009906724,0.0008599588,0.000342354],"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.000207374,0.00002768216,0.00159654,0.0001972735,0.00004682192,0.0001031602,0.0002000603,0.003303406,0.001167487,0.9626605,0.01321907,0.01727061],"study_design_scores_gemma":[0.00002573079,0.00003533721,0.0004197605,0.00004752957,0.00001478215,0.0001055634,0.0001272339,0.004999998,0.001210147,0.9832178,0.009780968,0.00001514954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3042284,0.004264405,0.3804519,0.05387112,0.003119013,0.0001682661,0.001624724,0.0008332154,0.2514389],"genre_scores_gemma":[0.9068813,0.001533426,0.06098,0.00452358,0.001137454,0.000200853,0.001006688,0.0001204357,0.02361631],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0109376,"threshold_uncertainty_score":0.03658992,"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001161537,0.0008717323,0.001017287,0.00244225,0.0008274253,0.002960704,0.001588636,0.001453506,0.00300774],"category_scores_gemma":[0.01287851,0.0006188762,0.0005144594,0.003152899,0.00386662,0.008112215,0.001858146,0.001902935,0.0005285131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001134028,"about_ca_system_score_gemma":0.0002953939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006028885,"about_ca_topic_score_gemma":0.0003492914,"domain_scores_codex":[0.9986518,0.0002771568,0.0001100916,0.000555766,0.0002366254,0.0001685712],"domain_scores_gemma":[0.983356,0.01048901,0.003072007,0.0009099638,0.0005645799,0.001608426],"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.001021493,0.000231339,0.02847433,0.0004622142,0.0000938363,0.0007149822,0.001593197,0.02760828,0.01704281,0.8701447,0.007069127,0.0455437],"study_design_scores_gemma":[0.00007276322,0.0002243943,0.01344779,0.00009703313,0.00006722108,0.001205784,0.000522416,0.04310581,0.003263503,0.9298079,0.008094829,0.00009062458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.829612,0.006435067,0.1326092,0.002098918,0.0003841541,0.00005170924,0.001666527,0.0003543022,0.02678805],"genre_scores_gemma":[0.9740959,0.002198415,0.01965228,0.0001601691,0.001005099,0.0001278855,0.0007865541,0.0001180405,0.001855599],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00300774,"threshold_uncertainty_score":0.01006192,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}