{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67202526,0.00019459019,0.2023049,0.0004070857,0.00056347094,0.0005415781,0.00006111258,0.000021001631,0.123881],"genre_scores_gemma":[0.9768281,0.0000026909956,0.022859817,0.0000074230634,0.00015095898,0.0000024391825,0.00000850093,0.000010501323,0.00012956618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984447,0.00007827771,0.00081845676,0.00009389934,0.00042925568,0.00013545532],"domain_scores_gemma":[0.997833,0.00010706122,0.0012220095,0.000294385,0.00040762324,0.0001358989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095661276,0.00013116543,0.00083395874,0.00023968732,0.00003541047,0.00012189249,0.0008291858,0.000023258635,0.00025030642],"category_scores_gemma":[0.000025471225,0.00009681312,0.00042561395,0.00080202235,0.000060630053,0.00024186935,0.00022256457,0.0001229645,0.0000024875296],"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.00036501326,0.0034311817,0.15208563,0.000099782315,0.035405084,0.00003471412,0.01408007,0.0037171454,0.0009601824,0.73333466,0.040737744,0.01574882],"study_design_scores_gemma":[0.004012227,0.0011536909,0.001215618,0.00049901847,0.017580446,0.000013334649,0.022290137,0.067279555,0.0036361876,0.8755477,0.005916338,0.00085574423],"about_ca_topic_score_codex":0.000083434315,"about_ca_topic_score_gemma":0.000012125503,"teacher_disagreement_score":0.30480283,"about_ca_system_score_codex":0.00002154374,"about_ca_system_score_gemma":0.000101941485,"threshold_uncertainty_score":0.39479247},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0632658,0.00006892408,0.9346179,0.0005601641,0.000055918703,0.00069380965,0.0000016734331,0.000011980498,0.0007238353],"genre_scores_gemma":[0.40803686,0.000007052508,0.59159577,0.000051872576,0.000020876974,0.000028557166,2.1554078e-7,0.000015202146,0.00024358243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984917,0.00004655823,0.00055452075,0.00016916954,0.00040577023,0.00033227037],"domain_scores_gemma":[0.99799204,0.00041087184,0.0004635932,0.00047233762,0.00046133503,0.00019980814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012427358,0.00013766816,0.00034140775,0.00012959291,0.00017812209,0.0007155276,0.0026867583,0.000045319888,0.000021849854],"category_scores_gemma":[0.0007675642,0.0001074788,0.00015914203,0.00019950604,0.000049560866,0.0017868233,0.0006509944,0.000215789,0.000033414537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"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.00008477348,0.00051207514,0.00019057929,0.00058014493,0.00038796384,0.000058784703,0.011432867,0.19217947,0.037262663,0.74499774,0.00047439855,0.011838544],"study_design_scores_gemma":[0.00049170095,0.00008369317,0.0000035831536,0.00010259542,0.0000071001805,0.000063537926,0.000276457,0.61334187,0.0017376441,0.3837745,0.000028061808,0.000089276655],"about_ca_topic_score_codex":0.000002622158,"about_ca_topic_score_gemma":7.3450605e-7,"teacher_disagreement_score":0.4211624,"about_ca_system_score_codex":0.00004605939,"about_ca_system_score_gemma":0.00015675953,"threshold_uncertainty_score":0.689985},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9091451,0.0003312276,0.00082980597,0.00054998783,0.00046824783,0.0011154242,0.000053181666,0.000026411026,0.08748062],"genre_scores_gemma":[0.9440316,0.00004459201,0.054165106,0.000032313015,0.00027949596,0.000012232443,0.0000029316545,0.00009840453,0.0013333246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99622136,0.00036338824,0.0013945937,0.000201374,0.001163699,0.00065555476],"domain_scores_gemma":[0.9954627,0.0013678387,0.0014230458,0.0009503558,0.00046084152,0.00033519577],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005171938,0.00034676972,0.0010909663,0.000345504,0.00012847729,0.00015604244,0.0016562283,0.00011939795,0.00025256918],"category_scores_gemma":[0.003325774,0.00024530207,0.00029128848,0.00055675424,0.00022678624,0.00083899964,0.00045936985,0.0005532927,0.00004843495],"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.0008660222,0.0050361995,0.0041764337,0.0033181475,0.0011377303,0.0000822156,0.028237015,0.000016337062,0.012436906,0.93085426,0.011467762,0.0023709817],"study_design_scores_gemma":[0.0058469106,0.0044108694,0.0037282077,0.005403001,0.001229688,0.0010443267,0.010733948,0.00025443558,0.11136632,0.8491906,0.004958231,0.0018334732],"about_ca_topic_score_codex":0.0000056253557,"about_ca_topic_score_gemma":0.0000044235294,"teacher_disagreement_score":0.09892941,"about_ca_system_score_codex":0.00008641421,"about_ca_system_score_gemma":0.00013000416,"threshold_uncertainty_score":0.99999994},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16895209,0.00023470815,0.8071416,0.00072808337,0.0006128794,0.00031460548,0.000008698865,0.000021130381,0.02198617],"genre_scores_gemma":[0.8856677,0.000017259317,0.11412786,0.000087986875,0.00006161501,0.0000018819615,2.389005e-7,0.000011619387,0.000023871333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985049,0.000072165734,0.0005934099,0.00010794583,0.00045037086,0.00027125143],"domain_scores_gemma":[0.99811316,0.00022632671,0.0007435863,0.00062485714,0.000112320224,0.00017973795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015873967,0.0001588821,0.00041644575,0.00019542912,0.00008677034,0.00017061096,0.0021930623,0.000048969345,0.000031000567],"category_scores_gemma":[0.00010028722,0.000111391826,0.00027105643,0.00035194567,0.00007282223,0.0007485397,0.00036456037,0.00020644009,0.000014354267],"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.000051226238,0.0005517601,0.0026682976,0.00010327429,0.00016844345,0.000019631632,0.0076199095,0.000033144013,0.00147137,0.97020215,0.0004065929,0.016704189],"study_design_scores_gemma":[0.002832208,0.0023613283,0.01718411,0.0025823533,0.0002976153,0.0008600912,0.0010740265,0.0052252337,0.011357931,0.95056796,0.004614346,0.0010428013],"about_ca_topic_score_codex":0.000002773115,"about_ca_topic_score_gemma":0.0000038008247,"teacher_disagreement_score":0.7167156,"about_ca_system_score_codex":0.000016050577,"about_ca_system_score_gemma":0.000049074857,"threshold_uncertainty_score":0.45424268},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91921496,0.00032027383,0.070286326,0.00059218437,0.00019083747,0.00029663835,0.0000030795572,0.0000074932373,0.009088211],"genre_scores_gemma":[0.8736917,0.00003448068,0.12617765,0.000025945796,0.000017941755,0.0000013708806,1.6227531e-7,0.0000070409633,0.000043696557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867886,0.000039686416,0.000770577,0.00007707423,0.00029654393,0.00013723844],"domain_scores_gemma":[0.9983921,0.00019165318,0.0009125042,0.00029215388,0.00016473948,0.000046866517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008758828,0.000089932364,0.00040091405,0.000110525005,0.000017990827,0.00013086422,0.0014484883,0.000031809715,0.00006735649],"category_scores_gemma":[0.00013328595,0.00006336476,0.00007160869,0.00021624345,0.000049777012,0.0007056844,0.00034582193,0.00011451165,0.0000053230424],"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.000057579105,0.0016741201,0.010199805,0.0015805312,0.00036680675,0.00006721201,0.02447677,0.0008732325,0.053542364,0.86304444,0.0024038327,0.04171329],"study_design_scores_gemma":[0.0042454596,0.0017266414,0.031212548,0.011114099,0.00015969806,0.00033036203,0.0135611165,0.22346537,0.11315125,0.59882104,0.0010853625,0.0011270388],"about_ca_topic_score_codex":0.000030400144,"about_ca_topic_score_gemma":0.0000057445045,"teacher_disagreement_score":0.26422343,"about_ca_system_score_codex":0.000013494281,"about_ca_system_score_gemma":0.00007996259,"threshold_uncertainty_score":0.26916757},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9169836,0.00011433892,0.07837102,0.00081307587,0.0001319213,0.0003575568,0.000009051295,0.0000016295302,0.003217783],"genre_scores_gemma":[0.9033457,0.000050926606,0.096527405,0.0000075055323,0.000004684534,0.0000018515468,5.484607e-8,0.0000053256717,0.00005656478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894667,0.00008680928,0.0004543336,0.00008437663,0.0003136765,0.000114156996],"domain_scores_gemma":[0.9979188,0.00023449272,0.0009295637,0.0007121509,0.00015448451,0.00005050523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001079593,0.00007144838,0.00026030254,0.00009675173,0.00011253819,0.00015813454,0.002491005,0.000021928774,0.00000576576],"category_scores_gemma":[0.00048667923,0.00004262919,0.000071394374,0.00015638258,0.0002768294,0.000780063,0.0008525421,0.00015529225,3.460081e-7],"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.000042299434,0.0003544084,0.045865163,0.000246138,0.0001118984,0.000025396423,0.01543789,0.00008796062,0.0034940082,0.92310286,0.00007130847,0.011160691],"study_design_scores_gemma":[0.0012767515,0.00033085773,0.05314863,0.00084291777,0.000028735923,0.000081040314,0.0016392409,0.0025020598,0.008957976,0.9310075,0.000037831123,0.00014648247],"about_ca_topic_score_codex":0.0000071497034,"about_ca_topic_score_gemma":0.000013927208,"teacher_disagreement_score":0.018156387,"about_ca_system_score_codex":0.000008500517,"about_ca_system_score_gemma":0.000058926544,"threshold_uncertainty_score":0.46289486},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31209135,0.01868788,0.09019295,0.07273881,0.0055285483,0.0064529357,0.00037424357,0.00036281892,0.49357045],"genre_scores_gemma":[0.79967505,0.0010391445,0.13739252,0.0004897602,0.0014068274,0.00006146464,0.000005082917,0.0004714099,0.059458733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99731684,0.00021765378,0.0010128947,0.00018188942,0.00085256685,0.00041816264],"domain_scores_gemma":[0.9948701,0.0036407441,0.00039594338,0.00069135614,0.00022785243,0.00017396483],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0046070167,0.00025237745,0.00052853074,0.00013061693,0.00027785212,0.0017135233,0.002207443,0.000112945374,0.00074373535],"category_scores_gemma":[0.0013011672,0.00013334668,0.0003117357,0.0004089065,0.00020443779,0.00045010305,0.0005025813,0.0008346349,0.00016660268],"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.0000642844,0.000096445605,0.000009365312,0.00059350725,0.000491079,0.00019820011,0.006981796,0.000002395257,0.0003438374,0.89561194,0.09065707,0.004950077],"study_design_scores_gemma":[0.00041450677,0.00025954135,0.0000037120171,0.00082305074,0.000148739,0.0008404684,0.0027397915,0.0014554613,0.001344967,0.9418296,0.04994369,0.00019643384],"about_ca_topic_score_codex":0.0000018658742,"about_ca_topic_score_gemma":0.000004930436,"teacher_disagreement_score":0.4875837,"about_ca_system_score_codex":0.00009361606,"about_ca_system_score_gemma":0.00028032542,"threshold_uncertainty_score":0.9993228},"labels":[],"label_agreement":null}]}