{"meta":{"query_hash":"48dc3f2ed2a8","filters":{"venue":"Open Journal of Discrete Mathematics"},"cohort_total":7,"direct_labels_cover":0,"predictions_cover":7,"exported":7,"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/48dc3f2ed2a8","api":"https://metacan.xera.ac/api/v1/cohort?venue=Open+Journal+of+Discrete+Mathematics"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04083047348209679,"score_gpt":0.33034497499909926,"score_spread":0.2895145015170025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512997342","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.29054883,0.0020267,0.6242801,0.0030865544,0.00020954739,0.00015035372,0.0018406875,0.0004941908,0.07736306],"genre_scores_gemma":[0.8793626,0.00083685626,0.10698761,0.0006006137,0.00039741627,0.00023100071,0.0013492547,0.00020026672,0.010034392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992235,0.0002850363,0.00005448809,0.00019521311,0.00016884203,0.0000730207],"domain_scores_gemma":[0.9964393,0.0021862409,0.00043936577,0.00024224822,0.00045184267,0.00024094436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010073435,0.00042629606,0.00041381243,0.0027763322,0.0012998421,0.0027301994,0.00087137276,0.0009498613,0.0058732843],"category_scores_gemma":[0.0058343024,0.0003686719,0.00084779836,0.0017803438,0.0022809706,0.0061655287,0.0010645717,0.0012407835,0.0005859003],"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.000008201471,0.00000966128,0.0003339142,0.00003692139,0.0000069494413,0.000086092725,0.0002876476,0.0014060795,0.00075338845,0.9932167,0.00074989797,0.00310453],"study_design_scores_gemma":[0.0000049966943,0.000010851028,0.00041673228,0.000024206178,0.000010902163,0.00013520604,0.00013112844,0.01573672,0.00028689308,0.9795252,0.0037057977,0.000011348734],"about_ca_topic_score_codex":0.00087111664,"about_ca_topic_score_gemma":0.0008343431,"teacher_disagreement_score":0.0058732843,"about_ca_system_score_codex":0.0012655063,"about_ca_system_score_gemma":0.00043923812,"threshold_uncertainty_score":0.019648135},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Chromatic scale; Mathematics; Scheduling (production processes); Graph; Combinatorics; Computer science; Mathematical optimization; Discrete mathematics","score_opus":0.058188764967941606,"score_gpt":0.3432924704403453,"score_spread":0.28510370547240366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980709314","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.021177042,0.00034294196,0.9648644,0.00048562454,0.0001476447,0.0000849833,0.00011043902,0.00024440265,0.012542651],"genre_scores_gemma":[0.6384204,0.0010212392,0.33493426,0.000496787,0.00020848858,0.0004766993,0.00037120777,0.00034686865,0.02372406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899703,0.000325116,0.000040534625,0.00021064805,0.00027280924,0.00015386184],"domain_scores_gemma":[0.9986765,0.0005543592,0.00013519307,0.00032834985,0.00016462279,0.0001408636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009980415,0.0007500923,0.00046480302,0.00055218255,0.0008293932,0.001336821,0.0018988486,0.0011943573,0.004491047],"category_scores_gemma":[0.0021275997,0.00045978074,0.00086733163,0.00093554804,0.0015111185,0.002650754,0.0010650007,0.0017070838,0.00071165984],"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.00013168507,0.00006569831,0.00029250208,0.00010484872,0.000022588123,0.00015002351,0.00018259104,0.3180414,0.0056703365,0.66074383,0.0024041987,0.012190326],"study_design_scores_gemma":[0.000052419102,0.00008729941,0.00011264495,0.000018943378,0.000017000406,0.00011495215,0.00004282756,0.69398093,0.0017513207,0.2896323,0.014165098,0.000024323595],"about_ca_topic_score_codex":0.0033949455,"about_ca_topic_score_gemma":0.0027676525,"teacher_disagreement_score":0.004491047,"about_ca_system_score_codex":0.001890969,"about_ca_system_score_gemma":0.0014747826,"threshold_uncertainty_score":0.015024066},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10824437539757367,"score_gpt":0.378923508772303,"score_spread":0.2706791333747294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022005952","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.86290085,0.00042448356,0.07154016,0.00029822942,0.00011376524,0.00006898881,0.0004647156,0.00014110055,0.06404772],"genre_scores_gemma":[0.98261976,0.0002394905,0.008187556,0.000092722,0.000031272273,0.00003615917,0.000321265,0.000020227611,0.00845153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998292,0.000029328805,0.000009834062,0.00005046555,0.00003616695,0.000045011056],"domain_scores_gemma":[0.99916136,0.00032141272,0.00014694408,0.00006934479,0.000088651715,0.00021231566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012719443,0.0003147673,0.00029666338,0.0007082337,0.0008973544,0.0010946102,0.00048260656,0.0003590663,0.0063868137],"category_scores_gemma":[0.0006755888,0.00026213733,0.0002573301,0.000616072,0.00081665325,0.0012732483,0.0009657739,0.0006138661,0.0004142241],"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.00009014766,0.000055997763,0.0018065013,0.0001325967,0.000030080515,0.00091828534,0.00079739233,0.0041296347,0.006347403,0.97105646,0.0020145436,0.012620868],"study_design_scores_gemma":[0.000065026434,0.0000974913,0.0017756721,0.000037389935,0.00004747809,0.0006430672,0.00083648827,0.022974752,0.0046224687,0.95324254,0.015626503,0.00003107673],"about_ca_topic_score_codex":0.0010219403,"about_ca_topic_score_gemma":0.002072181,"teacher_disagreement_score":0.0063868137,"about_ca_system_score_codex":0.0005019339,"about_ca_system_score_gemma":0.0002489492,"threshold_uncertainty_score":0.021366},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04059337117785439,"score_gpt":0.29666614932892066,"score_spread":0.25607277815106627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059355032","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.60786223,0.001689333,0.29030785,0.0011549032,0.00030298962,0.00013066179,0.00047751042,0.0004285361,0.09764605],"genre_scores_gemma":[0.9480541,0.00076149177,0.041907124,0.00033007408,0.000079848076,0.000051057803,0.00017785761,0.00005219015,0.008586201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9999124,0.000026540403,0.0000038560765,0.000015451587,0.000021181397,0.000020592639],"domain_scores_gemma":[0.99949646,0.00022936787,0.000059578804,0.000071881936,0.000045588957,0.00009702224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017204236,0.0003265911,0.00027624166,0.0006710456,0.0007123917,0.0005883984,0.0005035873,0.0003783357,0.0024017685],"category_scores_gemma":[0.0008286794,0.00019507801,0.00032814758,0.0006324614,0.00075719267,0.00046448215,0.00070105575,0.0007073167,0.00021635606],"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.00003363926,0.00003250085,0.0007472622,0.00009471325,0.000011136414,0.00040253857,0.00027540306,0.007873967,0.0057382733,0.9678583,0.0016653944,0.015266772],"study_design_scores_gemma":[0.00004327326,0.0000977503,0.0009296823,0.00005549237,0.000022291699,0.00034773815,0.0000917928,0.0402324,0.0045662434,0.94018567,0.013393184,0.000034530145],"about_ca_topic_score_codex":0.0020503358,"about_ca_topic_score_gemma":0.003706485,"teacher_disagreement_score":0.0024017685,"about_ca_system_score_codex":0.00051360583,"about_ca_system_score_gemma":0.00034983526,"threshold_uncertainty_score":0.008034706},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01700377759767581,"score_gpt":0.2718911566169423,"score_spread":0.2548873790192665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064603234","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.8308351,0.00091570575,0.14844215,0.0004261043,0.00014619774,0.00014881304,0.0019605826,0.00082171126,0.016303651],"genre_scores_gemma":[0.9444126,0.00045585973,0.044993427,0.00014029842,0.00028633626,0.00031913246,0.0019224413,0.00031729645,0.007152685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99598736,0.00048893335,0.0006548937,0.0012612505,0.00095920864,0.0006482845],"domain_scores_gemma":[0.9760477,0.013825132,0.0030498488,0.0022236316,0.002428979,0.0024246303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00201236,0.00069622934,0.0010282912,0.0051427865,0.0020327072,0.005294856,0.0021686358,0.0016583162,0.006849403],"category_scores_gemma":[0.016701594,0.0010291052,0.00123352,0.0027486624,0.0032077588,0.0088277655,0.0023480745,0.001502656,0.0007759173],"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.000864942,0.00017147511,0.03634464,0.00054476754,0.00015394475,0.0012024916,0.0031028895,0.008473166,0.017146163,0.8826448,0.002874157,0.04647661],"study_design_scores_gemma":[0.000067975714,0.00014685036,0.0067069153,0.00016559463,0.00012251029,0.002007987,0.00095807615,0.035607085,0.008217798,0.9358035,0.010063242,0.00013238488],"about_ca_topic_score_codex":0.00067986426,"about_ca_topic_score_gemma":0.00074373407,"teacher_disagreement_score":0.006849403,"about_ca_system_score_codex":0.0017313535,"about_ca_system_score_gemma":0.00062451226,"threshold_uncertainty_score":0.022913575},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0416074269276484,"score_gpt":0.35081594703235613,"score_spread":0.30920852010470773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605695111","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.829612,0.0064350674,0.13260925,0.002098918,0.00038415412,0.00005170924,0.0016665272,0.00035430223,0.026788048],"genre_scores_gemma":[0.9740959,0.0021984153,0.019652285,0.00016016913,0.0010050987,0.00012788552,0.00078655407,0.0001180405,0.0018555995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986518,0.00027715677,0.000110091634,0.000555766,0.00023662543,0.00016857123],"domain_scores_gemma":[0.983356,0.010489013,0.0030720066,0.0009099638,0.00056457985,0.0016084258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011615371,0.0008717323,0.0010172868,0.0024422503,0.0008274253,0.002960704,0.0015886356,0.0014535056,0.0030077395],"category_scores_gemma":[0.012878511,0.0006188762,0.0005144594,0.0031528987,0.0038666204,0.0081122145,0.0018581456,0.001902935,0.0005285131],"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.0010214935,0.00023133899,0.028474329,0.00046221423,0.0000938363,0.0007149822,0.0015931973,0.027608281,0.017042814,0.87014467,0.0070691267,0.045543697],"study_design_scores_gemma":[0.00007276322,0.00022439427,0.0134477895,0.00009703313,0.00006722108,0.0012057843,0.00052241597,0.043105815,0.0032635026,0.9298079,0.008094829,0.000090624584],"about_ca_topic_score_codex":0.0006028885,"about_ca_topic_score_gemma":0.0003492914,"teacher_disagreement_score":0.0030077395,"about_ca_system_score_codex":0.001134028,"about_ca_system_score_gemma":0.00029539387,"threshold_uncertainty_score":0.01006192},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Goldbach's conjecture; Mathematics; Conjecture; Combinatorics; Collatz conjecture; Discrete mathematics","score_opus":0.0854747755188135,"score_gpt":0.4140941728248309,"score_spread":0.3286193973060174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402734443","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.30422837,0.0042644055,0.3804519,0.053871125,0.003119013,0.00016826607,0.0016247239,0.00083321537,0.25143892],"genre_scores_gemma":[0.9068813,0.0015334263,0.06098,0.00452358,0.0011374544,0.00020085297,0.001006688,0.00012043566,0.023616308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99753654,0.0005382819,0.00015339957,0.00079144014,0.00053132244,0.0004490187],"domain_scores_gemma":[0.9943979,0.0030018177,0.00040747054,0.0009906724,0.0008599588,0.00034235403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029049292,0.00070721493,0.0010972683,0.00073151314,0.002066879,0.0027525458,0.00072147755,0.0017681017,0.010937601],"category_scores_gemma":[0.012452451,0.00046049486,0.0011741208,0.00073232775,0.004579658,0.0074835946,0.002484338,0.0033854928,0.0020385638],"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.00020737399,0.000027682157,0.0015965396,0.00019727355,0.000046821915,0.00010316016,0.00020006033,0.0033034063,0.0011674865,0.9626605,0.013219072,0.017270606],"study_design_scores_gemma":[0.000025730787,0.000035337212,0.0004197605,0.000047529567,0.00001478215,0.00010556336,0.00012723393,0.004999998,0.0012101473,0.98321784,0.009780968,0.000015149536],"about_ca_topic_score_codex":0.00075955904,"about_ca_topic_score_gemma":0.00079139235,"teacher_disagreement_score":0.010937601,"about_ca_system_score_codex":0.0013162531,"about_ca_system_score_gemma":0.0011422009,"threshold_uncertainty_score":0.03658992},"labels":[],"label_agreement":null}]}